• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.714-721
• /
• 2005

In this parer, we analyze the preamble model in the OFDMA/TDD(OFDM-FDMA/Time Division Duplexing). Besides, under AWGN, ITU-R M.1225 Ped-B and Veh-A channel environments, we analyze capabilities of symbol timing & carrier frequency offset and performance of cell searching capabilities applied to OFDM/TDD system through computer simulation. The performance using Detection Probability, False Alarm Probability, Missing Probability, Mean Acquisition Time and MSE(Mean Square Error) is analyzed. Especially, in the case of symbol timing offset estimation, the preamble structure and its algorithm with enhanced performance are proposed and then compared with existing ones.

• Journal of Biosystems Engineering
• /
• v.24 no.5
• /
• pp.445-452
• /
• 1999

This study was conducted to develop a searching algorithm for optimal daily temperature setpoint greenhouse. An algorithm using crop growth and energy models was developed to determine optimum crop growth environment. The results of this study were as follows: 1. Mathematical models for crop growth and energy consumption were derived to define optimal daily temperature setpoint. 2. Optimum temperature setpoint, which could maximize performance criterion, was determined by using Pontryagin maximum principle. 3. Dynamic control of daily temperature using the developed algorithm showed higher performance criterion than static control with fixed temperature setpoint. Performance criteria for dynamic control models were with simulated periodic weather data and with real weather data, increased by 48% and 60%, respectively.

• Korean Journal of Cognitive Science
• /
• v.11 no.3_4
• /
• pp.1-11
• /
• 2000

This study investigated information acquisition from hypertext and the difference of searching behavior between adults and children. In experiment 1. we compared the amount of information acquisition from the hypertext to that of the printed text. The result showed that the performance in printed text was better than in hypertext. However. the performance of experienced (in the internet) participant showed no difference between the hypertext and the printed text. Experiment 2 compared the information-searching behavior of the adults and children in the hypertext environment. The results showed that adults performed the information-searching faster than children, yet there was no difference in the proportion of correct responses of the two groups. However. children who were more experienced in the internet and produced right answers to the 7th level questions in depth performed better and faster than the adults who were not. These results suggest that the experience in the internet is the most important factor in the searching of the wanted information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6C
• /
• pp.530-538
• /
• 2010

In this paper, estimation methods of cell searching and DoA (Direction of Arrival) for mobile relay stations with a uniform linear array are proposed. The proposed methods can improve the performance of cell searching and DoA estimation by removing the effect of STOs when there exist symbol timing offsets (STOs) between the signals received from adjacent base stations,. Also, the proposed methods can improve the performance of DoA estimation significantly when there exists Doppler frequency shift caused by movement of the mobile relay station. The performances and computational complexities of the proposed cell searching and DoA methods are evaluated by computer simulation under Mobile WiMAX environments.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.5
• /
• pp.681-687
• /
• 2003

Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces fur realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and the T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in a successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. The dynamic T-search, which is proposed in this paper, combines conventional T-search and the concept of the dynmaic-window search which uses reduced searching windows or sets of triangular surface polygons at each frame by taking advantage of the information regarding dynamic charactereistics of a simulated vehicle. Numerical tests show improvement of searching speeds by about 5% for randomly distributed triangles. For continuous search following a vehicle path, which occurs in actual vehicle simulation, the searching speed becomes 4 times faster.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.3
• /
• pp.389-396
• /
• 2001

In detection of a scene change of the moving pictures which has massive information capacity, the temporal sampling method has a faster searching speed and lower missing scene change detection than the sequential searching method for the whole moving pictures, yet employed searching algorithm and detection interval greatly affect missing frame and searching precision. In this study, the whole moving pictures were primarily retrieved threshold by the temporal difference of histogram scene change detection method. We suggested a dynamic threshold algorithm using cut detection interval and derived an equation formula to determine optimal primary retrieval threshold which can cut detection interval computation. Experimental results show that the proposed dynamic threshold algorithm using cut detection interval method works up about 30 percent in precision of performance than the sequential searching method.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.11
• /
• pp.532-540
• /
• 2001

In this paper, we propose a probabilistic tabu search strategy for function optimization. It is composed of two procedures, one is Basic search procedure that plays a role in local search, and the other is Restarting procedure that enables to diversify search region. In basic search procedure, we use Belief space and Near region to create neighbors. Belief space is made of high-rank neighbors to effectively restrict searching space, so it can improve searching time and local or global searching capability. When a solution is converged in a local area, Restarting procedure works to search other regions. In this time, we use Probabilistic Tabu Strategy(PTS) to adjust parameters such as a reducing rate, initial searching region etc., which makes enhance the performance of searching ability in various problems. In order to show the usefulness of the proposed method, the PTS is applied to the minimization problems such as De Jong functions, Ackley function, and Griewank functions etc., the results are compared with those of GA or EP.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1049-1062
• /
• 2004

With the popularization of a World Wide Web (WWW), the quantity of web information has been increased. Therefore, an efficient searching system is needed to offer the exact result of diverse Information to user. Due to this reason, it is important to extract and analysis of user requirements in the distributed information environment. The conventional searching method used the only keyword for the web searching. However, the searching method proposed in this paper adds the context information of keyword for the effective searching. In addition, this searching method extracts keywords by the new keyword extraction method proposed in this paper and it executes the web searching based on a keyword mining profile generated by the extracted keywords. Unlike the conventional searching method which searched for information by a representative word, this searching method proposed in this paper is much more efficient and exact. This is because this searching method proposed in this paper is searched by the example based query included content information as well as a representative word. Moreover, this searching method makes a domain keyword list in order to perform search quietly. The domain keyword is a representative word of a special domain. The performance of the proposed algorithm is analyzed by a series of experiments to identify its various characteristic.

• Journal of information and communication convergence engineering
• /
• v.11 no.3
• /
• pp.173-178
• /
• 2013

To discover objects of interest in unstructured peer-to-peer networks, the peers rely on flooding query messages which create incredible network traffic. This article evaluates the performance of an unstructured Gnutella-like protocol over mobile ad-hoc networks and proposes modifications to improve its performance. This paper offers an enhanced mechanism for an unstructured Gnutella-like network with improved peer features to better meet the mobility requirement of ad-hoc networks. The proposed system introduces a novel caching optimization technique and enhanced ultrapeer selection scheme to make communication more efficient between peers and ultrapeers. The paper also describes an enhanced query mechanism for efficient searching by applying multiple walker random walks with a jump and replication technique. According to the simulation results, the proposed system yields better performance than Gnutella, XL-Gnutella, and random walk in terms of the query success rate, query response time, network load, and overhead.

• Journal of Internet of Things and Convergence
• /
• v.1 no.1
• /
• pp.11-19
• /
• 2015

The mobile and ubiquitous environment is experiencing a rapid development of information and communications technology as it provides an ever increasing flow of information. Particularly, GIS is now widely applied in daily life due to its high accuracy and functionality. GIS information is utilized through the tiling method, which divides and manages large-scale map information. The tiling method manages map information and additional information to allow overlay, so as to facilitate quick access to tiled data. Unlike past studies, this paper proposes a new architecture and algorithms for tile searching and indexing management to optimize map information and additional information for GIS mobile applications. Since this involves the processing of large-scale information and continuous information changes, information is clustered for rapid processing. In addition, data size is minimized to overcome the constrained performance associated with mobile devices. Our system has been implemented in actual services, leading to a twofold increase in performance in terms of processing speed and mobile bandwidth.