Pub Date : 2016-11-22DOI: 10.17230/INGCIENCIA.12.24.7
Evelio Astaiza, O. HéctorFabioBermudez, Luis Muñoz
This paper presents the study results of the identification of the regions of spectral efficiency that satisfy the requirements of quality of service (QoS) based on restrictions of bandwidth based on IEEE 802.11 multicell. This problem is addressed from the perspective of game theory for the channeling defined in 802.11g, and considering only the nonoverlapping channels. To solve the game, the concepts of Nash Equilibrium (NE), Satisfaction Equilibrium (ES) and Efficient Satisfaction Equilibrium (ESE) are introduced, proposing an algorithm to identify regions of capacity that satisfy the QoS required by a user. Particularly, in this game, the solution that allows to guarantee the transfer information rate required by a network user while minimizing the required resources (bandwidth) is sought, allowing users to maximize the amount that can be associated to an AP on the network. In the present scenario, it is verified that the different Equilibrium NE, SE and ESE depend directly on the conditions of channel gain.
{"title":"Regiones de Eficiencia Espectral Asociadas a Satisfacción de QoS Basadas en Estrategias de Ancho de Banda","authors":"Evelio Astaiza, O. HéctorFabioBermudez, Luis Muñoz","doi":"10.17230/INGCIENCIA.12.24.7","DOIUrl":"https://doi.org/10.17230/INGCIENCIA.12.24.7","url":null,"abstract":"This paper presents the study results of the identification of the regions of spectral efficiency that satisfy the requirements of quality of service (QoS) based on restrictions of bandwidth based on IEEE 802.11 multicell. This problem is addressed from the perspective of game theory for the channeling defined in 802.11g, and considering only the nonoverlapping channels. To solve the game, the concepts of Nash Equilibrium (NE), Satisfaction Equilibrium (ES) and Efficient Satisfaction Equilibrium (ESE) are introduced, proposing an algorithm to identify regions of capacity that satisfy the QoS required by a user. Particularly, in this game, the solution that allows to guarantee the transfer information rate required by a network user while minimizing the required resources (bandwidth) is sought, allowing users to maximize the amount that can be associated to an AP on the network. In the present scenario, it is verified that the different Equilibrium NE, SE and ESE depend directly on the conditions of channel gain.","PeriodicalId":30405,"journal":{"name":"Ingenieria y Ciencia","volume":"12 1","pages":"149-168"},"PeriodicalIF":0.0,"publicationDate":"2016-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67422598","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-11DOI: 10.17230/INGCIENCIA.12.24.3
D. K. Nagar, Sergio Alexander Gómez-Noguera, Arjun K. Gupta
espanolEn este articulo definimos y estudiamos formas generalizadas de las funciones gama y beta matriz variadas extendidas. Utilizando varios resultados del algebra matricial, funciones especiales de argumento matricial y polinomios zonales, derivamos algunas de las propiedades de estas funciones. Tambien mostramos algunas aplicaciones de estas funciones a la teoria de distribuciones. EnglishIn this article, we define and study generalized forms of extended matrix variate gamma and beta functions. By using a number of results from matrix algebra, special functions of matrix arguments and zonal polynomials we derive a number of properties of these newly defined functions. We also give some applications of these functions to statistical distribution theory.
{"title":"Generalized Extended Matrix Variate Beta and Gamma Functions and Their Applications","authors":"D. K. Nagar, Sergio Alexander Gómez-Noguera, Arjun K. Gupta","doi":"10.17230/INGCIENCIA.12.24.3","DOIUrl":"https://doi.org/10.17230/INGCIENCIA.12.24.3","url":null,"abstract":"espanolEn este articulo definimos y estudiamos formas generalizadas de las funciones gama y beta matriz variadas extendidas. Utilizando varios resultados del algebra matricial, funciones especiales de argumento matricial y polinomios zonales, derivamos algunas de las propiedades de estas funciones. Tambien mostramos algunas aplicaciones de estas funciones a la teoria de distribuciones. EnglishIn this article, we define and study generalized forms of extended matrix variate gamma and beta functions. By using a number of results from matrix algebra, special functions of matrix arguments and zonal polynomials we derive a number of properties of these newly defined functions. We also give some applications of these functions to statistical distribution theory.","PeriodicalId":30405,"journal":{"name":"Ingenieria y Ciencia","volume":"12 1","pages":"51-82"},"PeriodicalIF":0.0,"publicationDate":"2016-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67422037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-11DOI: 10.17230/INGCIENCIA.12.24.4
Tomas Angel Sarmiento Bahoque, John Fredys Cantillo Palacio, J. Gómez, Javier Antonio Montoya Martínez
espanolEl objetivo de este trabajo es estudiar y comparar diferentes estrategias para el desmantelamiento optimo de redes delincuenciales, las cuales estan representadas en algoritmos que permiten la identificacion optima de los individuos claves en la red. La estrategia de mayor complejidad se basa en la metrica de centralidad de Katz-Bonacich como medida de influencia en la red, y da lugar a un problema NP-dificil por lo que se debe recurrir a metodos heuristicos para encontrar soluciones aproximadas. Aqui se desarrolla un algoritmo basado en el metodo Monte Carlo y se compara con un metodo basado en algoritmos voraces introducido recientemente en la literatura. En este trabajo se compara ademas el desempeno de estos con estrategias menos sofisticadas y se proporciona evidencia que dichos algoritmos se desempenan relativamente bien, contribuyendo asi a proporcionar un mejor entendimiento de estos. Se discute ademas un modelo introducido recientemente que justifica el uso de la centralidad de Katz-Bonacich desde el punto de vista de la teoria de juegos sobre redes. EnglishThis work deals with the study and comparison of different strategies for the optimal dismantling of delinquent networks, which aim to optimally identify the most relevant individuals in the network. The strategy of greater complexity that we have studied here, is based on the Katz-Bonacich centrality criteria as a measure of influence of the individuals in the network. This results in an NP-hard type of problem, therefore, in order to apply that criteria, we must use heuristic methods which allow us to find approximate solutions. In particular, the methods used in this work are the Monte Carlo and greedy algorithms. We compared their performance against less sophisticated strategies and we were able to find that these algorithms perform relatively better, which contributes to improve our understanding of these approaches. In addition, we discuss a model that was recently introduced, which justifies the use of Katz-Bonacich centrality from the point of view of game theory on networks.
这项工作的目的是研究和比较不同的策略，以最优地拆除犯罪网络，这些策略是在算法中表示的，允许最优地识别网络中的关键个人。最复杂的策略是基于Katz-Bonacich中心性度量作为对网络影响的度量，这导致了np困难问题，因此必须诉诸启发式方法来寻找近似解。本文提出了一种基于蒙特卡罗方法的算法，并与文献中最近引入的贪婪算法进行了比较。本文还比较了这些算法与不那么复杂的策略的性能，并提供了证据，证明这些算法的性能相对较好，从而有助于更好地理解这些算法。本文还讨论了最近引入的一个模型，该模型从网络博弈论的角度证明了Katz-Bonacich中心性的使用。这项工作的目的是研究和比较最优瓦解犯罪网络的不同战略，以便最优地查明网络中最相关的个人。我们在此研究的更复杂的战略是基于Katz-Bonacich中心性标准，作为衡量个人在网络中的影响力的标准。这导致了NP-hard类型的问题，因此，为了应用这个标准，我们必须使用发式方法，使我们能够找到近似的解。= =地理= =根据美国人口普查，这个县的面积为。我们算不上其性能针对较sophisticated strategies and We能够是to find that这些算法区域的better,密改善our understanding of这些办法。此外，我们还讨论了最近引入的一种模型，它从网络游戏理论的角度证明了Katz-Bonacich中心性的使用。
{"title":"Desmantelamiento óptimo de redes delincuenciales. Una perspectiva desde el modelado matemático y computacional","authors":"Tomas Angel Sarmiento Bahoque, John Fredys Cantillo Palacio, J. Gómez, Javier Antonio Montoya Martínez","doi":"10.17230/INGCIENCIA.12.24.4","DOIUrl":"https://doi.org/10.17230/INGCIENCIA.12.24.4","url":null,"abstract":"espanolEl objetivo de este trabajo es estudiar y comparar diferentes estrategias para el desmantelamiento optimo de redes delincuenciales, las cuales estan representadas en algoritmos que permiten la identificacion optima de los individuos claves en la red. La estrategia de mayor complejidad se basa en la metrica de centralidad de Katz-Bonacich como medida de influencia en la red, y da lugar a un problema NP-dificil por lo que se debe recurrir a metodos heuristicos para encontrar soluciones aproximadas. Aqui se desarrolla un algoritmo basado en el metodo Monte Carlo y se compara con un metodo basado en algoritmos voraces introducido recientemente en la literatura. En este trabajo se compara ademas el desempeno de estos con estrategias menos sofisticadas y se proporciona evidencia que dichos algoritmos se desempenan relativamente bien, contribuyendo asi a proporcionar un mejor entendimiento de estos. Se discute ademas un modelo introducido recientemente que justifica el uso de la centralidad de Katz-Bonacich desde el punto de vista de la teoria de juegos sobre redes. EnglishThis work deals with the study and comparison of different strategies for the optimal dismantling of delinquent networks, which aim to optimally identify the most relevant individuals in the network. The strategy of greater complexity that we have studied here, is based on the Katz-Bonacich centrality criteria as a measure of influence of the individuals in the network. This results in an NP-hard type of problem, therefore, in order to apply that criteria, we must use heuristic methods which allow us to find approximate solutions. In particular, the methods used in this work are the Monte Carlo and greedy algorithms. We compared their performance against less sophisticated strategies and we were able to find that these algorithms perform relatively better, which contributes to improve our understanding of these approaches. In addition, we discuss a model that was recently introduced, which justifies the use of Katz-Bonacich centrality from the point of view of game theory on networks.","PeriodicalId":30405,"journal":{"name":"Ingenieria y Ciencia","volume":"9 1","pages":"83-103"},"PeriodicalIF":0.0,"publicationDate":"2016-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67422540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-11DOI: 10.17230/INGCIENCIA.12.24.2
C. G. Pinzón, W. O. León
espanolEn este articulo presentamos un estudio sobre las K-algebras finitas, es decir las K-algebras conmutativas con unidad que son espacios vectoriales de dimension finita sobre un cuerpo K. Estas son suma directa de K-algebras finitas locales. Caracterizamos la K-algebra finita local K[x]/(f(x)), mostramos que ciertas K-algebras finitas son isomorfas y descomponemos la K-algebra finita K[x]/(f(x)) en K-algebras finitas locales. EnglishThis paper is devoted to the study of finite K-algebras i.e. the commutative K-algebras with unity that are finite dimensional vector space over a field K. A finite K-algebra is direct sum of local finite K-algebras. We obtain a characterization of the local finite K-algebra K[x]/(f(x)) , show that certain finite K-algebras are isomorphic and discompose the finite K-algebra K[x]/(f(x)) in local finite K-algebras.
{"title":"K-álgebras finitas conmutativas con unidad","authors":"C. G. Pinzón, W. O. León","doi":"10.17230/INGCIENCIA.12.24.2","DOIUrl":"https://doi.org/10.17230/INGCIENCIA.12.24.2","url":null,"abstract":"espanolEn este articulo presentamos un estudio sobre las K-algebras finitas, es decir las K-algebras conmutativas con unidad que son espacios vectoriales de dimension finita sobre un cuerpo K. Estas son suma directa de K-algebras finitas locales. Caracterizamos la K-algebra finita local K[x]/(f(x)), mostramos que ciertas K-algebras finitas son isomorfas y descomponemos la K-algebra finita K[x]/(f(x)) en K-algebras finitas locales. EnglishThis paper is devoted to the study of finite K-algebras i.e. the commutative K-algebras with unity that are finite dimensional vector space over a field K. A finite K-algebra is direct sum of local finite K-algebras. We obtain a characterization of the local finite K-algebra K[x]/(f(x)) , show that certain finite K-algebras are isomorphic and discompose the finite K-algebra K[x]/(f(x)) in local finite K-algebras.","PeriodicalId":30405,"journal":{"name":"Ingenieria y Ciencia","volume":"12 1","pages":"31-49"},"PeriodicalIF":0.0,"publicationDate":"2016-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67422031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-11DOI: 10.17230/ingciencia.12.24.5
Rafael Ricardo Rentería, J. S. Mejía
espanolEn esta investigacion se propone la construccion de un modelo basado en agentes, para estudiar el impacto que tiene la cohesion social y la victimizacion en el proceso de la toma de decision de un criminal. En el modelado se consideraron los aspectos criminologicos establecidos desde las teorias del desorden social y de las actividades rutinarias en una arquitectura de inteligencia artificial PECS (Physis, Emotion, Cognitive, Social), con el objeto de articular todas las dimensiones que intervienen en la construccion de la decision. La cohesion social sera representada por redes sociales siguiendo el experimento de Watts - Strogatz, y la victimizacion como resultado acumulado de victimizaciones previas. Los resultados obtenidos de la simulacion permitieron replicar las conductas sociales caracteristicas del actor criminal, ya que en ellos se resaltan la importancia que tiene la percepcion de la cohesion social sobre la memoria de victimizacion generada por eventos criminales pasados, elementos que presentan consistencia con la evidencia empirica de los principios teoricos establecidos en el desordensocial y las acciones rutinarias. EnglishIn this research the construction of an agent-based model is proposed to study the impact of social cohesion and victimization in the process of decision making of a criminal. Modeling criminological aspects-established from theories of social disorder and routine activities in an architecture of artificial intelligence PECS (Physic, Emotion, Cognitive, Social), in order to articulate all dimensions involved in the construction of the decision. Social cohesion will be represented by social networks following the experiment done by Watts - Strogatz, and victimization as a cumulative result of previous victimizations. The results obtained in the simulation allowed to replicate social behavior main characteristics of a criminal Actor, because in them, the importance of the perception of social cohesion on the memory of victimization generated by past criminal events are highlighted. Elements that are consistent with the empirical evidence of the theoretical principles established in social disorder and routine actions.
本研究提出建立一个基于行动者的模型，以研究社会凝聚力和受害对罪犯决策过程的影响。该模型考虑了在PECS(物理、情感、认知、社会)人工智能架构中建立的社会混乱和日常活动理论的犯罪学方面，以阐明参与决策构建的所有维度。在Watts - Strogatz实验之后，社会凝聚力将以社交网络为代表，而受害是先前受害的累积结果。成果的simulacion复制了演员的社会caracteristicas犯罪行为,因为在他们强调社会融合percepcion关于他的记忆过去的犯罪事件产生的victimizacion元素具有一致性与证据empirica teoricos原则desordensocial和日常行动。本文提出建立一个基于行为者的模型来研究社会凝聚力和受害在罪犯决策过程中的影响。对人工智能(物理、情感、认知、社会)架构中社会失调和日常活动理论所建立的犯罪学方面进行建模，以便阐明决策构建所涉及的所有维度。在Watts - Strogatz的实验之后，社会凝聚力将由社会网络来代表，而受害是先前受害的累积结果。模拟的结果使犯罪行为者的社会行为的主要特征得以复制，因为在模拟中，社会凝聚力的感知对过去犯罪事件所产生的受害记忆的重要性得到了强调。Elements that with the经验证据理论是相一致原则成立社会到处和常规行动。
{"title":"Diseño de un modelo basado en agentes para estudiar el impacto de la cohesión social y la victimización el comportamiento de un criminal","authors":"Rafael Ricardo Rentería, J. S. Mejía","doi":"10.17230/ingciencia.12.24.5","DOIUrl":"https://doi.org/10.17230/ingciencia.12.24.5","url":null,"abstract":"espanolEn esta investigacion se propone la construccion de un modelo basado en agentes, para estudiar el impacto que tiene la cohesion social y la victimizacion en el proceso de la toma de decision de un criminal. En el modelado se consideraron los aspectos criminologicos establecidos desde las teorias del desorden social y de las actividades rutinarias en una arquitectura de inteligencia artificial PECS (Physis, Emotion, Cognitive, Social), con el objeto de articular todas las dimensiones que intervienen en la construccion de la decision. La cohesion social sera representada por redes sociales siguiendo el experimento de Watts - Strogatz, y la victimizacion como resultado acumulado de victimizaciones previas. Los resultados obtenidos de la simulacion permitieron replicar las conductas sociales caracteristicas del actor criminal, ya que en ellos se resaltan la importancia que tiene la percepcion de la cohesion social sobre la memoria de victimizacion generada por eventos criminales pasados, elementos que presentan consistencia con la evidencia empirica de los principios teoricos establecidos en el desordensocial y las acciones rutinarias. EnglishIn this research the construction of an agent-based model is proposed to study the impact of social cohesion and victimization in the process of decision making of a criminal. Modeling criminological aspects-established from theories of social disorder and routine activities in an architecture of artificial intelligence PECS (Physic, Emotion, Cognitive, Social), in order to articulate all dimensions involved in the construction of the decision. Social cohesion will be represented by social networks following the experiment done by Watts - Strogatz, and victimization as a cumulative result of previous victimizations. The results obtained in the simulation allowed to replicate social behavior main characteristics of a criminal Actor, because in them, the importance of the perception of social cohesion on the memory of victimization generated by past criminal events are highlighted. Elements that are consistent with the empirical evidence of the theoretical principles established in social disorder and routine actions.","PeriodicalId":30405,"journal":{"name":"Ingenieria y Ciencia","volume":"12 1","pages":"105-127"},"PeriodicalIF":0.0,"publicationDate":"2016-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67422554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-11DOI: 10.17230/INGCIENCIA.12.24.1
J. C. Parra, Héctor Román Quiceno Echavarría, O. Lobo
espanolEn el presente articulo se analiza el efecto que tiene sobre la igualdad d(P, F1) + d(P, F2)=2a siendo P un punto del plano, F1 y F2 los focos de esta figura plana llamada elipse y a una constante positiva, el uso de la suma k-deformada en el sentido de Kaniadakis, la cual se define como para 0 EnglishIn this paper we study the effects of the K-deformed sum, defined as on the Euclidean distance function d(P, F1) + d(P, F2) = 2a, where P is an arbitrary point in R2 ; F1 and F2 are the focus of the curve named Ellipse. The points satisfying the resulting equality d(P, F1) d(P, F2) = 2a, describe a curve named K-deformed ellipse for which the resulting analityc expression is analogue to the standard one. We make a deep study of the vertex, local extrema, asymptotes, the latus rectum and the graph of the resulting K-deformed conic ections: Ellipse, hyperbola, circumference and parabola in the K-deformed setting. We also make a study of the area of the regions limited by the -deformed ellipse and hyperbola for an arbitrary value of K.
espanolEn el现在危象se analiza el efecto这种人尤其la igualdad d (P, F1) + d (P, F2) = 2 siendo P联合国punto德尔普莱诺,F1 y F2洛杉矶中心de esta figura术后llamada椭圆y una常数positiva, el uso de la suma k-deformada en el打过德Kaniadakis la是se定义科莫对位0 EnglishIn本文我们研究K-deformed总和的影响,定义为在欧几里得距离函数(P, F1) + d (P, F2) = 2, P是一个任意点在R2;F1和F2是椭圆曲线的焦点。满足所得等式d(P, F1) d(P, F2) = 2a的点，描述了一条名为k -变形椭圆的曲线，其所得解析表达式与标准解析表达式类似。我们深入研究了k -变形条件下的顶点、局部极值、渐近线、直点以及由此产生的椭圆、双曲线、周长和抛物线的图形。我们还研究了任意K值下，变形椭圆和双曲线所限定的区域的面积。
{"title":"Secciones cónicas k-deformadas","authors":"J. C. Parra, Héctor Román Quiceno Echavarría, O. Lobo","doi":"10.17230/INGCIENCIA.12.24.1","DOIUrl":"https://doi.org/10.17230/INGCIENCIA.12.24.1","url":null,"abstract":"espanolEn el presente articulo se analiza el efecto que tiene sobre la igualdad d(P, F1) + d(P, F2)=2a siendo P un punto del plano, F1 y F2 los focos de esta figura plana llamada elipse y a una constante positiva, el uso de la suma k-deformada en el sentido de Kaniadakis, la cual se define como para 0 EnglishIn this paper we study the effects of the K-deformed sum, defined as on the Euclidean distance function d(P, F1) + d(P, F2) = 2a, where P is an arbitrary point in R2 ; F1 and F2 are the focus of the curve named Ellipse. The points satisfying the resulting equality d(P, F1) d(P, F2) = 2a, describe a curve named K-deformed ellipse for which the resulting analityc expression is analogue to the standard one. We make a deep study of the vertex, local extrema, asymptotes, the latus rectum and the graph of the resulting K-deformed conic ections: Ellipse, hyperbola, circumference and parabola in the K-deformed setting. We also make a study of the area of the regions limited by the -deformed ellipse and hyperbola for an arbitrary value of K.","PeriodicalId":30405,"journal":{"name":"Ingenieria y Ciencia","volume":"12 1","pages":"9-29"},"PeriodicalIF":0.0,"publicationDate":"2016-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67422019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-22DOI: 10.17230/INGCIENCIA.12.23.5
M. JoseA.Díaz, O. Téquita, F. Naranjo
We simulated the neuronal electrical activity using the Hodgkin-Huxley model (HH) and a superconductor circuit, containing Josephson junctions. These HH model make possible simulate the main neuronal dynamics characteristics such as action potentials, firing threshold and refractory period. The purpose of the manuscript is show a method to syncronize a RCLshunted Josephson junction to a neuronal dynamics represented by the HH model. Thus the RCLSJ circuit is able to mimics the behavior of the HH neuron. We controlated the RCLSJ circuit, using and improved adaptative track scheme, that with the improved Lyapunov functions and the two controllable gain coecients allowing synchronization of two neuronal models. Results will provide the path to follow forward the understanding neuronal networks synchronization about, generating the intrinsic brain behavior.
{"title":"Neuronal Synchronization of Electrical Activity, using the Hodgkin-Huxley Model and RCLSJ Circuit","authors":"M. JoseA.Díaz, O. Téquita, F. Naranjo","doi":"10.17230/INGCIENCIA.12.23.5","DOIUrl":"https://doi.org/10.17230/INGCIENCIA.12.23.5","url":null,"abstract":"We simulated the neuronal electrical activity using the Hodgkin-Huxley model (HH) and a superconductor circuit, containing Josephson junctions. These HH model make possible simulate the main neuronal dynamics characteristics such as action potentials, firing threshold and refractory period. The purpose of the manuscript is show a method to syncronize a RCLshunted Josephson junction to a neuronal dynamics represented by the HH model. Thus the RCLSJ circuit is able to mimics the behavior of the HH neuron. We controlated the RCLSJ circuit, using and improved adaptative track scheme, that with the improved Lyapunov functions and the two controllable gain coecients allowing synchronization of two neuronal models. Results will provide the path to follow forward the understanding neuronal networks synchronization about, generating the intrinsic brain behavior.","PeriodicalId":30405,"journal":{"name":"Ingenieria y Ciencia","volume":"12 1","pages":"93-106"},"PeriodicalIF":0.0,"publicationDate":"2016-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67422174","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-22DOI: 10.17230/INGCIENCIA.12.23.8
Diego Renza, L. DoraM.Ballesteros, R. Rincón
Abstract Steganography is the process of data hiding into a host signal with three main characteristics: imperceptibility, payload and quality of the recovered data. For images, one of the pixel modification methods is the BPHM (Block Pixel Hiding Method) which has good imperceptibility and payload, but it does not ensure the good quality of the recovered secret image. In this paper, we propose an improvement of the BPHM with the purpose to obtain similar results to the well-known QIM (Quantization Index Modulation) method. According to the results, the imperceptibility of the stego image and the quality of the recovered secret image were improved, and then, our results are closer to QIM results.
{"title":"Método de ocultamiento de píxeles para esteganografía de imágenes en escala de gris sobre imágenes a color","authors":"Diego Renza, L. DoraM.Ballesteros, R. Rincón","doi":"10.17230/INGCIENCIA.12.23.8","DOIUrl":"https://doi.org/10.17230/INGCIENCIA.12.23.8","url":null,"abstract":"Abstract Steganography is the process of data hiding into a host signal with three main characteristics: imperceptibility, payload and quality of the recovered data. For images, one of the pixel modification methods is the BPHM (Block Pixel Hiding Method) which has good imperceptibility and payload, but it does not ensure the good quality of the recovered secret image. In this paper, we propose an improvement of the BPHM with the purpose to obtain similar results to the well-known QIM (Quantization Index Modulation) method. According to the results, the imperceptibility of the stego image and the quality of the recovered secret image were improved, and then, our results are closer to QIM results.","PeriodicalId":30405,"journal":{"name":"Ingenieria y Ciencia","volume":"12 1","pages":"145-162"},"PeriodicalIF":0.0,"publicationDate":"2016-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67422428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-22DOI: 10.17230/INGCIENCIA.12.23.9
Q. Rodríguez, O. Osorno, D. A. Maya
Este articulo presenta una revision de la literatura de los estudios realizados sobre problemas de relocalizacion de vehiculos de Servicios de Emergencia Medica, (SEM). En particular se presenta una descripcion basica de las actividades que se realizan en un SEM, la forma como son clasificados este tipo de problemas, los principales componentes que se tienen en cuenta en el diseno de los modelos, los metodos de solucion que se han implementado a la fecha y las medidas de desempeno para evaluar las soluciones. Ademas se discuten los softwares utilizados para su desarrollo, las estrategias para la recoleccion de los datos que se tienen en cuenta y las tecnicas de verificacion y validacion. Finalmente, se presentan las politicas de relocalizacion mas evaluadas e implementadas.
{"title":"Relocalización de vehículos en servicios de emergencias médicas: una revisión","authors":"Q. Rodríguez, O. Osorno, D. A. Maya","doi":"10.17230/INGCIENCIA.12.23.9","DOIUrl":"https://doi.org/10.17230/INGCIENCIA.12.23.9","url":null,"abstract":"Este articulo presenta una revision de la literatura de los estudios realizados sobre problemas de relocalizacion de vehiculos de Servicios de Emergencia Medica, (SEM). En particular se presenta una descripcion basica de las actividades que se realizan en un SEM, la forma como son clasificados este tipo de problemas, los principales componentes que se tienen en cuenta en el diseno de los modelos, los metodos de solucion que se han implementado a la fecha y las medidas de desempeno para evaluar las soluciones. Ademas se discuten los softwares utilizados para su desarrollo, las estrategias para la recoleccion de los datos que se tienen en cuenta y las tecnicas de verificacion y validacion. Finalmente, se presentan las politicas de relocalizacion mas evaluadas e implementadas.","PeriodicalId":30405,"journal":{"name":"Ingenieria y Ciencia","volume":"12 1","pages":"163-202"},"PeriodicalIF":0.0,"publicationDate":"2016-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67421988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-22DOI: 10.17230/INGCIENCIA.12.23.4
E. Munguía-Balvanera, A. Blanco-Piñón, Justino Alavez-Ramírez
Abstract In the biological context water is known to be favorable in wetlands, whether these are natural or artificial. The problem being addressed is the lack of hydrodynamic studies on the know-how of water behavior in artificial wetlands. This work was analyzed in three localities, and was complemented with a comparison of the shape of artificial wetlands at different ages and parts of the world; and it was concluded that its geometry is in a grid-shaped canals. For the artificial wetland grid a free two-dimensional software was used to make numerical simulations and deduce the hydrodynamic behavior. It was shown that the grid accomplishes the behavior of the natural wetlands; dissipating the energy of the water flow by draining and holding it down. The grid canal does it better than an equivalent meandering canal; the results were not found in other sources. The advantage of using a free 2D software to make artificial wetland simulations is its convenient representation of water flows and low cost. More research remains to be done on the field of wetland hydrodynamics, such as: different geometric shapes, the inclusion of sediment drag, rain simulation, among other aspects
{"title":"Análisis hidrodinámico de rejas de canales mediante simulaciones numéricas bidimensionales","authors":"E. Munguía-Balvanera, A. Blanco-Piñón, Justino Alavez-Ramírez","doi":"10.17230/INGCIENCIA.12.23.4","DOIUrl":"https://doi.org/10.17230/INGCIENCIA.12.23.4","url":null,"abstract":"Abstract In the biological context water is known to be favorable in wetlands, whether these are natural or artificial. The problem being addressed is the lack of hydrodynamic studies on the know-how of water behavior in artificial wetlands. This work was analyzed in three localities, and was complemented with a comparison of the shape of artificial wetlands at different ages and parts of the world; and it was concluded that its geometry is in a grid-shaped canals. For the artificial wetland grid a free two-dimensional software was used to make numerical simulations and deduce the hydrodynamic behavior. It was shown that the grid accomplishes the behavior of the natural wetlands; dissipating the energy of the water flow by draining and holding it down. The grid canal does it better than an equivalent meandering canal; the results were not found in other sources. The advantage of using a free 2D software to make artificial wetland simulations is its convenient representation of water flows and low cost. More research remains to be done on the field of wetland hydrodynamics, such as: different geometric shapes, the inclusion of sediment drag, rain simulation, among other aspects","PeriodicalId":30405,"journal":{"name":"Ingenieria y Ciencia","volume":"12 1","pages":"73-92"},"PeriodicalIF":0.0,"publicationDate":"2016-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67422132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：