• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.599-602
• /
• 2014

Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. With regard to procedures of proposal algorithm, duplicated agents were transferred to the point, where the second, third, and fourth cells were created in order, after the first cell was made, and the agents were engineered to search the shortest path to each cell, and then find the most efficient element through competition.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.9
• /
• pp.1193-1201
• /
• 2020

Cell planning, which determines the cell structure for location management of mobile terminals in mobile communications, has been dealt with as an important research task to determine network performance. Among the factors influencing the cell structure planning in mobile communication, the signal cost for location management plays the most important role. In this paper, we propose an optimization algorithm that minimizes the location management cost of all the cells used to plan the cell structure in the network with reporting cell structure in mobile communication. The proposed algorithm uses a Tabu search algorithm, which is a meta-heuristic algorithm, and the proposed algorithm proposes a new neighborhood generation method to obtain a result close to the optimal solution. In order to evaluate the performance of the proposed algorithm, the simulation was performed in terms of location management cost and algorithm execution time. The evaluation results show that the proposed algorithm outperforms the existing genetic algorithm and simulated annealing.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.305-312
• /
• 2001

Recently, high-dimensional index structures have been required for similarity search in such database applications s multimedia database and data warehousing. In this paper, we propose a new cell-based signature tree, called CS-tree, which supports efficient storage and retrieval on high-dimensional feature vectors. The proposed CS-tree partitions a high-dimensional feature space into a group of cells and represents a feature vector as its corresponding cell signature. By using cell signatures rather than real feature vectors, it is possible to reduce the height of our CS-tree, leading to efficient retrieval performance. In addition, we present a similarity search algorithm for efficiently pruning the search space based on cells. Finally, we compare the performance of our CS-tree with that of the X-tree being considered as an efficient high-dimensional index structure, in terms of insertion time, retrieval time for a k-nearest neighbor query, and storage overhead. It is shown from experimental results that our CS-tree is better on retrieval performance than the X-tree.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8B
• /
• pp.809-818
• /
• 2002

In this paper, we propose a fast cell search algorithm keeping compatible with the standard cell search algorithm of the WCDMA system. The proposed algorithm can acquire the synchronization of slot and frame times, and the code group identification using only one synchronization channel while the standard algorithm employs two synchronization channels called P-SCH and S-SCH. The proposed synchronization channel structure is the same as the P-SCH structure of the WCDMA system. However, the P-SCH is modulated with a specific polarization code, which is one element of new code group codes. The proposed algorithm can reduce both the BS' transmission power and the complexity of receiver as compared with the conventional one since only on synchronization channel is used. It is shown through the computer simulation that the proposed algorithm yields a significant improvement in terms of cell search time compared with the standard especially in low SNR environments.

• Structural Engineering and Mechanics
• /
• v.77 no.6
• /
• pp.779-795
• /
• 2021

In the recent decades, various optimization algorithms have been considered for the optimization of structures. In this research, a new enhanced algorithm is used for the size and topology optimization of truss structures. This algorithm, which is obtained from the combination of Crow Search Algorithm (CSA) and the Cellular Automata (CA) method, is called CA-CSA method. In the first iteration of the CA-CSA method, some of the best designs of the crow's memory are first selected and then located in the cells of CA. Then, a random cell is selected from CA, and the best design is chosen from the selected cell and its neighborhood; it is considered as a "local superior design" (LSD). In the optimization process, the LSD design is used to modify the CSA method. Numerical examples show that the CA-CSA method is more effective than CSA in the size and topology optimization of the truss structures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7A
• /
• pp.733-742
• /
• 2008

In 3GPP LTE downlink system, initial cell search is essential for mobile station to connect to base station. In order to obtain information of the base station, the mobile station detects frame timing, frequency offset, and cell identification using primary synchronization channel(PSC) and secondary synchronization channel(SSC), which are defined in downlink OFDMA specification. In this paper, we analyze various detection algorithms in practical environment of inter-cell-interference, frequency offset, and multi-path fading channel and propose the optimal algorithm. Simulation results show that partial correlation method (for PSC acquisition) and interference cancellation method (for SSC detection) are the most superior algorithms among the applicable algorithms. Employ these two algorithms for receiver design, initial cell search is performed with 99% probability within 70ms in the channel environment considered.

• Journal of The Korean Astronomical Society
• /
• v.38 no.2
• /
• pp.81-84
• /
• 2005

We are undertaking an extra-solar planet search around G-type giant stars by means of Doppler technique using an iodine absorption cell installed to the high dispersion echelle spectrograph for the 188 cm reflector at Okayama Astrophysical Observatory (Okayama Planet Search Program, OPSP). Having detected the first planet candidate (Sato et al. 2003)the search has been proved very promising. Taking advantage of this success, we are trying to develop OPSP to an international collaborative work. We here report the current status of our efforts for establishing such collaborations, namely, those with Chinese and Korean astronomers. We also propose to establish an East-Asian network to search for extra-solar planets around G-type giant stars with the transit detecting technique as well as the Doppler technique, asking other persons/groups to join us to enjoy the planet search.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.5
• /
• pp.432-437
• /
• 2008

This paper proposes a defect cell extraction algorithm for TFT-LCD auto-repair system. Auto defect search algorithm and automatic defect cell extraction method are very important for TFT-LCD auto repair system. In the previous literature[1], we proposed an automatic visual inspection algorithm of TFT-LCD. Based on the inspected information(defect size and defect axis, if defect exists) by the automatic search algorithm, defect cells should be extracted from the input image for the auto repair system. For automatic extraction of defect cells, we used a novel block matching algorithm and a simple filtering process in order to find a given reference point in the LCD cell. The proposed defect cell extraction algorithm can be used in all kinds of TFT-LCD devices by changing a stored template which includes a given reference point. Various experimental results show the effectiveness of the proposed method.

• Genomics & Informatics
• /
• v.6 no.2
• /
• pp.64-67
• /
• 2008

The Korean Rice Ds-tagging lines Database (KRDD) is designed to provide information about Ac/Ds insertion lines and activation tagging lines using japonica rice. This database has provided information on 18,158 Ds lines, which includes the ID, description, photo image, sequence information, and gene characteristics. The KRDD is visualized using a web-based graphical view, and anonymous users can query and browse the data using the search function. It has four major menus of web pages: (i) a Blast Search menu of a mutant line; Blast from rice Ds-tagging mutant lines; (ii) a primer design tool to identify genotypes of Ds insertion lines; (iii) a Phenotype menu for Ds lines, searching by identification name and phenotype characteristics; and (iv) a Management menu for Ds lines.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.488-491
• /
• 1995

The paper presents a new global maximum search method for multimodal unknown functions of two variables. The search method is composed of two stages and sequentially samples the candidate point in a subdomain selected using a priority function in each stage. The search domain is auto-similarly divided into triangular subdomains, or cells, during the search process. A measure of accuracy of local maximum search is introduced to check if a local search has converged to a specified accuracy or the maximum of a local peak cannot be the global maximum. A criterion for switching from the first to the second stage, is proposed using a ratio of the observed peak width to the largest cell in the domain. By numerical simulations, the required number of trials is evaluated for some function models with different peak parameters, and the switching criterion is optimally determined. The results show that the proposed method obtains global maximum points with certainty and saves largely computation time even for functions with extremely steep peaks.