• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.494-494
• /
• 2000

This paper demonstrates that the largest Lyapunov exponent $\lambda$ of recurrent neural networks can be controlled by a gradient method. The method minimizes a square error $e_{\lambda}=(\lambda-\lambda^{obj})^2$ where $\lambda^{obj}$ is desired exponent. The $\lambda$ can be given as a function of the network parameters P such as connection weights and thresholds of neurons' activation. Then changes of parameters to minimize the error are given by calculating their gradients $\partial\lambda/\partialP$. In a previous paper, we derived a control method of $\lambda$via a direct calculation of $\partial\lambda/\partialP$ with a gradient collection through time. This method however is computationally expensive for large-scale recurrent networks and the control is unstable for recurrent networks with chaotic dynamics. Our new method proposed in this paper is based on a stochastic relation between the complexity $\lambda$ and parameters P of the networks configuration under a restriction. Then the new method allows us to approximate the gradient collection in a fashion without time evolution. This approximation requires only $O(N^2)$ run time while our previous method needs $O(N^{5}T)$ run time for networks with N neurons and T evolution. Simulation results show that the new method can realize a "stable" control for larege-scale networks with chaotic dynamics.

• Journal of Ecology and Environment
• /
• v.31 no.2
• /
• pp.89-95
• /
• 2008

Sensing the approach of a predator is critical to the survival of prey, especially when the prey has no choice but to escape at a precisely timed moment. Escape behavior has been approached from both proximate and ultimate perspectives. On the proximate level, empirical research about electrophysiological mechanisms for detecting predators has focused on vision, an important modality that helps prey to sense approaching danger. Studies of looming-sensitive neurons in locusts are a good example of how the selective sensitivity of nervous systems towards specific targets, especially approaching objects, has been understood and realistically modeled in software and robotic systems. On the ultimate level, general optimality models have provided an evolutionary framework by considering costs and benefits of visually elicited escape responses. A recent paper showed how neural network models can be used to understand the evolution of visually mediated antipredatory behaviors. We discuss this new trend towards integration of these relatively disparate approaches, the proximate and the ultimate perspectives, for understanding of the evolution of behavior of predators and prey. Focusing on one of the best-studied escape pathway models, the Orthopteran LGMD/DCMD pathway, we discuss how ultimate-level optimality modeling can be integrated with proximate-level studies of escape behaviors in animals.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.4
• /
• pp.67-75
• /
• 1998

In general, Evoluationary Algorithm(EAs) are refered to as methods of population-based optimization. And EAs are considered as very efficient methods of optimal sytem design because they can provice much opportunity for obtaining the global optimal solution. This paper presents a co-evolution scheme of artifical neural networks, which has two different, still cooperatively working, populations, called as a host popuation and a parasite population, respectively. Using the conventional generatic algorithm the host population is evolved in the given environment, and the parastie population composed of schemata is evolved to find useful schema for the host population. the structure of artificial neural network is a diagonal recurrent neural netork which has self-feedback loops only in its hidden nodes. To find optimal neural networks we should take into account the structure of the neural network as well as the adaptive parameters, weight of neurons. So we use the genetic algorithm that searches the structure of the neural network by the co-evolution mechanism, and for the weights learning we adopted the evolutionary stategies. As a results of co-evolution we will find the optimal structure of the neural network in a short time with a small population. The validity and effectiveness of the proposed method are inspected by applying it to the stabilization and position control of the invered-pendulum system. And we will show that the result of co-evolution is better than that of the conventioal genetic algorithm.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.367-376
• /
• 2011

In this paper, we propose self-organizing schemes for the initial configuration of the neighbor cell list (NCL), maintenance of the NCL, and physical cell identifier (PCI) allocation in heterogeneous networks such as long term evolution systems where lower transmission power nodes are additionally deployed in macrocell networks. Accurate NCL maintenance is required for efficient PCI allocation and for avoiding handover delay and redundantly increased system overhead. Proposed self-organizing schemes for the initial NCL configuration and PCI allocation are based on evolved universal terrestrial radio access network NodeB (eNB) scanning that measures reference signal to interference and noise ratio and reference symbol received power, respectively, transmitted from adjacent eNBs. On the other hand, the maintenance of the NCL is managed by adding or removing cells based on periodic user equipment measurements. We provide performance analysis of the proposed schemes under various scenarios in the respects of NCL detection probability, NCL false alarm rate, handover delay area ratio, PCI conflict ratio, etc.

• Journal of the Korea Institute of Building Construction
• /
• v.20 no.6
• /
• pp.577-584
• /
• 2020

Construction automation and robotics have been widely adopted in the construction industry as a promising solution to such issues like a shortage of skilled labor and the difficulties workers face in harsh working environments. The analysis of the knowledge structure and its evolution from the existing articles helps identify essential knowledge elements and possible future research directions. This study attempts to (1) construct keyword networks from the papers published in the International Symposium on Automation and Robotics in Construction (ISARC), (2) investigate how keywords and keyword communities are associated with each other, and (3) examine the changes in the crucial keywords over time. Through cluster analysis, 79 keywords were categorized into four groups (BIM, Building construction, Sensing, and GPS as representative keywords) with similar structural positions. Research trends show that research themes related to Infrastructure, Construction equipment, and 3D have consistently received a large amount of attention, regardless of geographical region. Research on as-built status model utilization through BIM and Laser scanning and improving Energy performance is taking place more frequently. In contrast, research studies related to problem-solving based on Neural networks are not as common as previously. This study provides useful insights into the construction automation field, at both the macro and micro levels.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.498-503
• /
• 1994

The paper demonstrates that holon networks can be used effectively for identification of nonlinear dynamical systems. The emphasis of the paper is on modeling of complicated systems which have a great deal of uncertainty and unknown interactions between their elements and parameters. The concept of applying a quantitative model building, for example, to environmental or ecological systems is not new. In a previous paper we presented a holon network model as an another alternative to quantitative modeling. Holon networks have a hierarchical construction where each level of hierarchy consists of networks with reciprocal actions among their elements. The networks are able to evolve by self-organizing their structure and adapt their parameters to environments. This was achieved by an autonomous decentralized adaptation algorithm. In this paper we propose a new emergent evolution algorithm. In this algorithm the initial holon networks consists of only a few elements and it grows gradually with each new observation in order to fit their function to the environment. Some examples show that this algorithm can lead to a network structure which has sufficient flexibility and adapts well to the environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3110-3125
• /
• 2014

Network coding improves TCP's performance in lossy wireless networks. However, the complex congestion window evolution of network coded TCP (TCP-NC) makes the analysis of end-to-end throughput challenging. This paper analyzes the evolutionary process of TCP-NC against lossy links. An analytic model is established by applying a two-dimensional Markov chain. With maximum window size, end-to-end erasure rate and redundancy parameter as input parameters, the analytic model can reflect window evolution and calculate end-to-end throughput of TCP-NC precisely. The key point of our model is that by the novel definition of the states of Markov chain, both the number of related states and the computation complexity are substantially reduced. Our work helps to understand the factors that affect TCP-NC's performance and lay the foundation of its optimization. Extensive simulations on NS2 show that the analytic model features fairly high accuracy.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.513-522
• /
• 2016

We propose a mechanism for monitoring load in quality of service (QoS)-enabled wireless networks and show how it can be used for network management as well as for dynamic pricing. Mobile network traffic, especially video, has grown exponentially over the last few years and it is anticipated that this trend will continue into the future. Driving factors include the availability of new affordable, smart devices, such as smart-phones and tablets, together with the expectation of high quality user experience for video as one would obtain at home. Although new technologies such as long term evolution (LTE) are expected to help satisfy this demand, the fact is that several other mechanisms will be needed to manage overload and congestion in the network. Therefore, the efficient management of the expected huge data traffic demands is critical if operators are to maintain acceptable service quality while making a profit. In the current work, we address this issue by first investigating how the network load can be accurately monitored and then we show how this load metric can then be used to provide creative pricing plans. In addition, we describe its applications to features like traffic offloading and user satisfaction tracking.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.527-530
• /
• 2017

LTE-R(Long Term Evolution-Railway) based on LTE technology is expected to use core communication technology for high speed railway as one of standards for railway communications. In this paper, transmission performance of video traffic as an application is analyzed on LTE-R networks. Performance is evaluated with compter simulation based NS(Network Simulator)-2, open video traffic is used, RTP(Real Time Protocol) is used for transmission protocol. Results and methods of this paper can be used for research and developmemt of LTE-R networks.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.16-22
• /
• 2023

Enhanced radio access technologies (RAT) are deployed in Next Generation Convergence Networks by the service providers so as to satisfy the basic requirements of end-users for e.g. QoS. Whenever the available resources are being shared simultaneously and dynamically by multiple users or distribution of allocated channels randomly, the deficiency of spectral resources and dynamic behavior of Network traffic in real time Networking, we may have problem. In order to evaluate the performance of our proposed algorithm, computer simulation has been performed on NS-2 simulator and a comparison with the existing algorithms has been made.