• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.1
• /
• pp.91-100
• /
• 2010

According to the recent increase in air traffic a more efficient air traffic flow control is required. This paper proposes the algorithm for efficient air traffic flow control. Aeronautical communication environment is different from the common communication environment since it needs a direct communication between stations (or airplanes) and requires a strict priority for safety message. Moreover, the wide area for basic service causes high propagation delay. In this paper, by using existing CSMA/CA Media Access Control (MAC) protocol, we set the message priorities according to air traffic condition (congestion airport area, approach control area, En route area, and ocean area). This prioritization scheme enables the data transmission with higher access probability. Simulation results confirm that our protocol shows better performance in terms of channel efficiency and success probability compared to exisiting CSMA/CA protocol.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.5 s.305
• /
• pp.55-62
• /
• 2005

In this paper, we propose the face recognition system using HNMA(Hippocampal Neuron Modeling Algorithm) which can remodel the cerebral cortex and hippocampal neuron as a principle of a man's brain in engineering, then it can learn the feature-vector of the face images very fast and construct the optimized feature each image. The system is composed of two parts. One is feature-extraction and the other is teaming and recognition. In the feature extraction part, it can construct good-classified features applying PCA(Principal Component Analysis) and LDA(Linear Discriminants Analysis) in order. In the learning part, it cm table the features of the image data which are inputted according to the order of hippocampal neuron structure to reaction-pattern according to the adjustment of a good impression in the dentate gyrus region and remove the noise through the associate memory in the CA3 region. In the CA1 region receiving the information of the CA3, it can make long-term memory learned by neuron. Experiments confirm the each recognition rate, that are face changes, pose changes and low quality image. The experimental results show that we can compare a feature extraction and learning method proposed in this paper of any other methods, and we can confirm that the proposed method is superior to existing methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.37-45
• /
• 2006

In this paper, we propose the development of MHLA(Modulatory Hippocampus Learning Algorithm) which remodel a principle of brain of hippocampus. Hippocampus takes charge auto-associative memory and controlling functions of long-term or short-term memory strengthening. We organize auto-associative memory based 3 steps system(DG, CA3, CAl) and improve speed of learning by addition of modulator to long-term memory learning. In hippocampal system, according to the 3 steps order, information applies statistical deviation on Dentate Gyrus region and is labelled to responsive pattern by adjustment of a good impression. In CA3 region, pattern is reorganized by auto-associative memory. In CAI region, convergence of connection weight which is used long-term memory is learned fast by neural networks which is applied modulator. To measure performance of MHLA, PCA(Principal Component Analysis) is applied to face images which are classified by pose, expression and picture quality. Next, we calculate feature vectors and learn by MHLA. Finally, we confirm cognitive rate. The results of experiments, we can compare a proposed method of other methods, and we can confirm that the proposed method is superior to the existing method.

• Journal of the Korean Ceramic Society
• /
• v.40 no.12
• /
• pp.1170-1176
• /
• 2003

We developed an evolutionary optimization process involving a genetic algorithm and combinatorial chemistry (combi-chem), which was tailored exclusively for tile development of LED phosphors with a high luminescent efficiency, when excited by soft ultra violet irradiation. The ultimate goal of our study was to develop oxide red phosphors, which are suitable for three-band white Light Emitting Diodes (LED). To accomplish this, a computational evolutionary optimization process was adopted to screen a Eu$^{3+}$-doped alkali earth borosilicate system. The genetic algorithm is a well-known, very efficient heuristic optimization method and combi-chem is also a powerful tool for use in an actual experimental optimization process. Therefore the combination of a genetic algorithm and combi-chem would enhance the searching efficiency when applied to phosphor screening. Vertical simulations and an actual synthesis were carried out and promising red phosphors for three-band white LED applications, such as Eu$_{0.14}$Mg$_{0.18}$Ca$_{0.07}$Ba$_{0.12}$B$_{0.17}$Si$_{0.32}$O$_{\delta}$, were obtained.

• Korean Journal of Radiology
• /
• v.20 no.1
• /
• pp.94-101
• /
• 2019

Objective: To investigate the efficacy of motion-correction algorithm (MCA) in improving coronary artery image quality and measurement accuracy using an anthropomorphic dynamic heart phantom and 256-detector row computed tomography (CT) scanner. Materials and Methods: An anthropomorphic dynamic heart phantom was scanned under a static condition and under heart rate (HR) simulation of 50-120 beats per minute (bpm), and the obtained images were reconstructed using conventional algorithm (CA) and MCA. We compared the subjective image quality of coronary arteries using a four-point scale (1, excellent; 2, good; 3, fair; 4, poor) and measurement accuracy using measurement errors of the minimal luminal diameter (MLD) and minimal luminal area (MLA). Results: Compared with CA, MCA significantly improved the subjective image quality at HRs of 110 bpm (1.3 ± 0.3 vs. 1.9 ± 0.8, p = 0.003) and 120 bpm (1.7 ± 0.7 vs. 2.3 ± 0.6, p = 0.006). The measurement error of MLD significantly decreased on using MCA at 110 bpm (11.7 ± 5.9% vs. 18.4 ± 9.4%, p = 0.013) and 120 bpm (10.0 ± 7.3% vs. 25.0 ± 16.5%, p = 0.013). The measurement error of the MLA was also reduced using MCA at 110 bpm (19.2 ± 28.1% vs. 26.4 ± 21.6%, p = 0.028) and 120 bpm (17.9 ± 17.7% vs. 34.8 ± 19.6%, p = 0.018). Conclusion: Motion-correction algorithm can improve the coronary artery image quality and measurement accuracy at a high HR using an anthropomorphic dynamic heart phantom and 256-detector row CT scanner.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.4
• /
• pp.206-208
• /
• 2014

In this letter, IQ mismatch of a CA-supporting terminal for LTE-A is analyzed and each of the analog blocks is modeled mathematically. Based on the model, a new digital calibration algorithm is proposed and verified using simulation results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.1
• /
• pp.75-82
• /
• 1999

This paper describes the implementation of wireless realtime monitoring system using modified CSMA/CA protocol. This system consists of wireless modem, central monitor, mobile station, DB server, and offer advantage of mobility, reduced installation time, long-term cost savings, and so on. And this system offers patient position pursuit service. Patient position pursuit service must be offered to deal with emergency which can be occured during patient movement. This paper proposes modified CSMA/CA protocol and patient position pursuit algorithm, implements wireless realtime monitoring system using it.

• Journal of Korea Multimedia Society
• /
• v.5 no.6
• /
• pp.665-673
• /
• 2002

In this paper, we introduce cellular automata and propose a new block cipher algorithm based on cellular automata. For the evaluation of performance and security, we compare the results of the proposed algorithm with them of the standard block ciphers such as DES, Rijndael regarding on avalanche effects and processing time, and analyze the differential cryptanalysis for a reduction version of the proposed algorithm. In addition, we perform the statistical tests in FIPS PUB 140-2(Federal Information Processing Standards Publication 140-2) for the output bit sequences of proposed algorithm to guarantee the randomness property.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.10a
• /
• pp.40-47
• /
• 2000

One of the drawbacks of GA-based structural optimization is that the fitness evaluation of a population of hundreds of individuals requiring hundreds of structural analyses at each CA generation is computational too expensive. Therefore, a parallel genetic algorithm is developed for structural optimization on a cluster of personal computers in this paper. Based on the parallel genetic algorithm, a population at every generation is partitioned into a number of sub-populations equal to the number of slave computers. Parallelism is exploited at sub-population level by allocationg each sub-population to a slave computer. Thus, fitness of a population at each generation can be concurrently evaluated on a cluster of personal computers. For implementation of the algorithm a virtual distributed computing system in a collection of personal computers connected via a 100 Mb/s Ethernet LAN. The algorithm is applied to the minimum weight design of a steel structure. The results show that the computational time requied for serial GA-based structural optimization process is drastically reduced.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1939-1946
• /
• 2011

Expander graphs are useful in the design and analysis of communication networks. Mukhopadhyay et. al introduced a method to generate a family of expander graphs based on nongroup two predecessor single attractor CA(Cellular Automata). In this paper we propose a method to generate a family of expander graphs based on 60/102 Null boundary CA(NBCA) which is a group CA. The spectral gap generated by our method is larger than that of Mukhopadhyay et. al [12]. As an application we give an algorithm which generate one-way functions whose security lies on the combinatorial properties of our expander graphs. the one-way function using d-regular graph generated by the 60/102 NBCA is based on the Goldreich's construction [5].