• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.2
• /
• pp.179-184
• /
• 2006

An intuitive understanding of the dynamic pattern generation in asymmetric networks may be considered an essential component in developing models for the dynamic information processing. It has been reported that the neural network with cyclic connections generates multiple limit cycles. The dynamics of discrete time network with cyclic connections has been investigated intensively. However, the dynamics of a cyclic connection neural network in continuous-time has not been well-known due to the considerable complexity involved in its calculation. In this paper, the dynamic behavior of a continuous-time cyclic connection neural network, in which each neuron is connected only to its nearest neurons with binary synaptic weights of ${\pm}1$, has been investigated. Furthermore, the dynamics and stability of the network have been analyzed using a piece-wise linear approximation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.311-320
• /
• 2006

This paper proposes DDTM for USN having end-point mobility. The existing network protocols did not consider target's and sink's mobility. So it requires flooding and path update whenever targets or sinks move. This can lead to drain battery of sensors excessively and decrease lifetime of USN. DDTM is the protocol based on TTDD considering sink's mobility. TTDD provides sink's mobility efficiently by using the grid structure, but it requires the high energy because of reconstructing the grid structure whenever targets move. In this way, the proposed protocol can decrease a consumption of energy, since it reuses the existing grid structure of TTDD, if the target moves in local cell. We compare DDTM with TTDD under the total message and the energy consumption by using a discrete analytical model for cost analysis. Analytical results demonstrated that our proposed protocol can provide the higher efficiency on target's mobility.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.77-86
• /
• 2013

Cognitive radio (CR) has emerged as one of effective methods to enhance the utilization of existing radio spectrum. Main principle of CR is that secondary users (SUs) are allowed to use the spectrum unused by primary users (PUs) without interfering PU's transmissions. In this paper, PUs operate on a slot-by-slot basis and SUs try to exploit the slots unused by PUs. We propose OSA protocols in the single channel and we propose an opportunistic spectrum access (OSA) protocols in the multi-channel cognitive radio networks with one control channel and several licensed channels where a slot is divided into contention phase and transmission phase. A slot is divided into reporting phase, contention phase and transmission phase. The reporting phase plays a role of finding idle channels unused by PUs and the contention phase plays a role of selecting a SU who will send packets in the data transmission phase. One SU is selected by carrier sense multiple access / collision avoidance (CSMA/CA) with request to send / clear to send (RTS/CTS) mechanism on control channel and the SU is allowed to occupy all remaining part of all idle channels during the current slot. For mathematical analysis, first we deal with the single-channel case and we model the proposed OSA media access control (MAC) protocol by three-dimensional discrete time Markov chain (DTMC) whose one-step transition probability matrix has a special structure so as to apply the censored Markov chain method to obtain the steady state distribution.We obtain the throughput and the distribution of access delay. Next we deal with the multi-channel case and obtain the throughput and the distribution of access delay by using results of single-channel case. In numerical results, our mathematical analysis is verified by simulations and we give numerical results on throughput and access delay of the proposed MAC protocol. Finally, we find the maximum allowable number of SUs satisfying the requirements on throughput and access delay.

• Journal of Korea Game Society
• /
• v.7 no.2
• /
• pp.11-20
• /
• 2007

This paper proposes a real-time simulation technique for thin shells undergoing large deformation. Shells are thin objects such as leaves and papers that can be abstracted as 2D structures. Development of a satisfactory physical model that runs in real-time but produces visually convincing animation of thin shells has been remaining a challenge in computer graphics. Rather than resorting to shell theory which involves the most complex formulations in continuum mechanics, we adopt the energy functions from the discrete shells proposed by Grinspun et al. For real-time integration of the governing equation, we develop a modal warping technique for shells. This new simulation framework results from making extensions to the original modal warping technique which was developed for the simulation of 3D solids. We report experimental results, which show that the proposed method runs in real-time even for large meshes, and that it can simulate large bending and/or twisting deformations with acceptable realism.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2002.10a
• /
• pp.142-148
• /
• 2002

Autonomous underwater vehicles (AUVs) are unmanned underwater vessels to investigate sea environments, oceanography and deep-sea resources autonomously. Docking systems are required to increase the capability of the AUVs to recharge the batteries and to transmit data in real time for specific underwater works, such as repeated jobs at sea bed. This paper presents a visual servo control system for an AUV to dock into an underwater station with a camera mounted at the nose center of the AUV. To make the visual servo control system, this paper derives an optical flow model of a camera, where the projected motions of the image plane are described with the rotational and translational velocities of the AUV. This paper combines the optical flow equation of the camera with the AUVs equation of motion, and derives a state equation for the visual servoing AUV. This paper proposes a discrete-time MIMO controller minimizing a cost function. The control inputs of the AUV are automatically generated with the projected target position on the CCD plane of the camera and with the AUVs motion. To demonstrate the effectiveness of the modeling and the control law of the visual servoing AUV, simulations on docking the AUV to a target station are performed with the 6-dof nonlinear equations of REMUS AUV and a CCD camera.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.6
• /
• pp.1175-1182
• /
• 2011

In this paper, properties of exact confidence interval and some approximate confidence intervals of hyper-geometric parameter, that is the probability of success p in the population is discussed. Usually, binomial distribution is a well known discrete distribution with abundant usage. Hypergeometric distribution frequently replaces a binomial distribution when it is desirable to make allowance for the finiteness of the population size. For example, an application of the hypergeometric distribution arises in describing a probability model for the number of children attacked by an infectious disease, when a fixed number of them are exposed to it. Exact confidence interval estimation of hypergeometric parameter is reviewed. We consider the approximation of hypergeometirc distribution to the binomial and normal distribution respectively. Approximate confidence intervals based on these approximation are also adequately discussed. The performance of exact confidence interval estimates and approximate confidence intervals of hypergeometric parameter is compared in terms of actual coverage probability by small sample Monte Carlo simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6B
• /
• pp.697-709
• /
• 2011

For improvement of wireless Internet service quality at vehicle's moving speed, it is advised to reduce the service disruption time by reducing the handover frequency on vehicle's moving path. Particularly, it is advantageous to avoid the handover to cell whose dwell time is short or can be ignored in terms of service continuity and average throughput. This paper proposes the handover scheme that is suitable for vehicle in order to improve the wireless Internet service quality. In the proposed scheme, the handover process continues to be learned before being modeled to Discrete-Time Markov Chain (DTMC). This modeling reduces the handover frequency by preventing the handover to cell that could provide service sufficiently to passenger even when vehicle passed through the cell but there was no need to perform handover. In order to verify the proposed scheme, we observed the average number of handovers, the average RSSI and the average throughput on various moving paths that vehicle moved in the given urban environment. The experiment results confirmed that the proposed scheme was able to provide the improved wireless Internet service to vehicle that moved to some degree of consistency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9A
• /
• pp.891-899
• /
• 2008

The cdma2000 1xEV-DO system controls the data rates of mobile terminals based on a binary overload indicator from the base station and a simple probabilistic model. However, this traffic control scheme has difficulty in controlling the reverse-link traffic load effectively and in guaranteeing a stable operation of the reverse link because each mobile terminal determines the next data rate autonomously. This paper proposes a new trafRc control scheme to improve the system stability, and analyzes the proposed scheme by modeling it as a discrete-time Markov process. The numerical results show that the maximum data rate of the proposed scheme is much higher than that of the conventional one. Moreover, the proposed scheme does not modify the standard physical channel structure, so it is compatible to the existing 1xEV-DO system.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.17 no.7
• /
• pp.691-696
• /
• 2004

The electronic state and chemical bonding of $\beta$-MnO$_2$ with transition metal dopants were theoretically investigated by DV-X$_{\alpha}$ (the discrete variational X$_{\alpha}$) method, which is a sort of the first principles molecular orbital method using the Hartree-Fock-Slater approximation. The calculations were performed with a $_Mn_{14}$ MO$_{56}$ )$^{-52}$ (M = transition metals) cluster model. The electron energy level, the density of states (DOS), the overlap population, the charge density distribution, and the net charges, were calculated. The energy level diagram of MnO$_2$ shows the different band structure and electron occupancy between the up spin states and down spin states. The dopant levels decrease between the conduction band and the valence band with the increase of the atomic number of dopants. The covalency of chemical bonding was shown to increase and ionicity decreased in increasing the atomic number of dopants. Calculated results were discussed on the basis of the interaction between transition metal 3d and oxygen 2p orbital. In conclusion it is expected that when the transition metals are added to MnO$_2$ the band gap decreases and the electronic conductivity increases with the increase of the atomic number of dopants. the atomic number of dopants.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.409-418
• /
• 2005

This paper presents an efficient multicast method based on a locality in mobile IPv6 networks. We exploit the repetitive movement pattern of mobile node to reduce the total number of experience of graft and join procedure. We defined the locality scope by a movement pattern. While the network is included in the locality scope, the network should maintain a multicast tree even when the mobile node moves to the other network. In this way, the mobile host can receive a multicast service without a delay when it moves to the network in the locality scope later. We compare our scheme with existing schemes under the total signaling cost and the service delay time by using a discrete analytical model for cost analysis. Analytical results demonstrated that the total signaling cost and service delay time was significantly reduced through our proposed scheme.