• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.405-410
• /
• 2009

This paper proposes an efficient path finding scheme capable of searching the paths to k static objects from a given query point, aiming at both improving the legacy k-nearest neighbor search and making it easily applicable to the road network environment. To the end of improving the speed of finding one-to-many paths, the modified A* obviates the duplicated part of node scans involved in the multiple executions of a one-to-one path finding algorithm. Additionally, the cost to the each object found in this step makes it possible to finalize the k objects according to the network distance from the candidate set as well as to order them by the path cost. Experiment results show that the proposed scheme has the accuracy of around 100% and improves the search speed by $1.3{\sim}3.0$ times of k-nearest neighbor searches, compared with INE, post-Dijkstra, and $na{\ddot{i}}ve$ method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2188-2208
• /
• 2023

Quality of Service (QoS) is a critical feature of Wireless Sensor Networks (WSNs) with routing algorithms. Data packets are moved between cluster heads with QoS using a number of energy-efficient routing techniques. However, sustaining high scalability while increasing the life of a WSN's networks scenario remains a challenging task. Thus, this research aims to develop an energy-balancing component that ensures equal energy consumption for all network sensors while offering flexible routing without congestion, even at peak hours. This research work proposes a Gravitational Blackhole Search Optimised splay tree routing framework. Based on the splay tree topology, the routing procedure is carried out by the suggested method using three distinct steps. Initially, the proposed GBSO decides the optimal route at initiation phases by choosing the root node with optimum energy in the splay tree. In the selection stage, the steps for energy update and trust update are completed by evaluating a novel reliance function utilising the Parent Reliance (PR) and Grand Parent Reliance (GPR). Finally, in the routing phase, using the fitness measure and the minimal distance, the GBSO algorithm determines the best route for data broadcast. The model results demonstrated the efficacy of the suggested technique with 99.52% packet delivery ratio, a minimum delay of 0.19 s, and a network lifetime of 1750 rounds with 200 nodes. Also, the comparative analysis ensured that the suggested algorithm surpasses the effectiveness of the existing algorithm in all aspects and guaranteed end-to-end delivery of packets.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2486-2491
• /
• 2013

There are invisible defects by naked eyes in ceramic material images such as internal stomata, cracks and foreign substances. In this paper we propose a method to detect and extract such defects from ceramic pipe weld zone by applying ART2 learning. In pre-processing, we apply Ends-in Search Stretching to enhance the intensity and then perform fuzzy binarization with triangle type membership function followed by enhanced ART2 that interacts with random input patterns to extract such invisible defects. The experiment verifies that this proposed method is sufficiently effective.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.2
• /
• pp.117-128
• /
• 2008

Compared with the existing bar code system, RFID system has lots of advantages such as it identifies automatically massive objects. We might anticipate RFID technology will be a substitution for an optical bar code system in the near future. However, their feature that uses radio waves may cause various security problems. Many kinds of solutions have been researched to overcome these security problems. In this paper, we analyze the previous proposed protocols. And then, we categorize RFID authentication into two types according to the synchronization requirement between a Back-end Database and a Tag. In addition, we introduce the previous proposed approaches to tag search problem in RFID authentication. And we propose an efficient method which provides fast tag search by using membership test algorithm, a Bloom filter.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.70-84
• /
• 2006

We propose a new distributed QoS routing scheme called pre-computation based selective probing (PCSP). The PCSP scheme is designed to provide an exact solution to the constrained optimization problem with moderate overhead, considering the practical environment where the state information available for the routing decision is not exact. It does not limit the number of probe messages, instead, employs a qualitative (or conditional) selective probing approach. It considers both the cost and QoS metrics of the least-cost and the best-QoS paths to calculate the end-to-end cost of the found feasible paths and find QoS-satisfying least-cost paths. It defines strict probing condition that excludes not only the non-feasible paths but also the non-optimal paths. It additionally pre-computes the QoS variation taking into account the impreciseness of the state information and applies two modified QoS-satisfying conditions to the selection rules. This strict probing condition and carefully designed probing approaches enable to strictly limit the set of neighbor nodes involved in the probing process, thereby reducing the message overhead without sacrificing the optimal properties. However, the PCSP scheme may suffer from high message overhead due to its conservative search process in the worst case. In order to bound such message overhead, we extend the PCSP algorithm by applying additional quantitative heuristics. Computer simulations reveal that the PCSP scheme reduces message overhead and possesses ideal success ratio with guaranteed optimal search. In addition, the quantitative extensions of the PCSP scheme turn out to bound the worst-case message overhead with slight performance degradation.

• International Journal of Aeronautical and Space Sciences
• /
• v.15 no.1
• /
• pp.20-31
• /
• 2014

This paper deals with the development of a realistic shape optimization of damaged columns that are subjected to conservative and non-conservative forces, using the Genetic Algorithm (GA). The analysis is based on the design of the most optimized shape of the column under the constraint of constant weight, considering the Static, Vibrational, and Flutter characteristics. Under the action of conservative and non-conservative longitudinal forces, an elastic column loses its stability. A numerical analysis based on FEM has been performed on a uniform damaged column, to compute the fundamental buckling load, vibration frequency, and flutter load, under various end restraints. An optimization search based on the Genetic Algorithm is then executed, to find the optimal shape design of the column. The optimized column references the one having the highest buckling load, highest vibration frequency, and highest flutter load, among all the possible shapes of the column, for a given volume. A comparison is then made between the values obtained for the optimized damaged column, and those obtained for the optimized undamaged column. The comparison reveals that the incorporation of damage in the column alters its optimal shape to only a certain extent. Also, the critical load and frequency values for the optimized damaged column are comparatively low, compared with those obtained for the optimized undamaged column. However, these results hold true only for moderate-intensity damage cases. For high intensity damage, the optimal shape may not remain the same, and may vary, according to the severity of damage.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.1
• /
• pp.44-49
• /
• 2020

Recently, one of the major issues of shipbuilding and marine is the reduction of air and marine pollution emission to ships. In response, the International Maritime Organization (IMO) has concluded an international convention (MARPOL) to prevent pollution from ships. A Annex Six of The Convention restricts and regulates air and marine pollution of ship from exhausting gases. To this end, it is required to apply EEDI (Energy Efficiency Design Indicators) to the construction of new ships, and to minimize the emission of environmental pollutants by recommending the application of EEOI (Energy Efficiency Operation Indicators) to operational ships. Therefore, in this study, we propose to calculate the grade of operating efficiency (EG) of ships based on actual operational data for transport ships and to provide energy-efficient optimal path search information through analysis of marine environment data.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.609-617
• /
• 2010

This paper is concerned with the use of a selforganizing map (SOM) to estimate the desired channel states of an unknown digital communication channel for blind equalization. The modification of SOM is accomplished by using the Bayesian likelihood fitness function and the relation between the desired channel states and channel output states. At the end of each clustering epoch, a set of estimated clusters for an unknown channel is chosen as a set of pre-defined desired channel states, and used to extract the channel output states. Next, all of the possible desired channel states are constructed by considering the combinations of extracted channel output states, and a set of the desired states characterized by the maximal value of the Bayesian fitness is subsequently selected for the next SOM clustering epoch. This modification of SOM makes it possible to search the optimal desired channel states of an unknown channel. In simulations, binary signals are generated at random with Gaussian noise, and both linear and nonlinear channels are evaluated. The performance of the proposed method is compared with those of the "conventional" SOM and an existing hybrid genetic algorithm. Relatively high accuracy and fast search speed have been achieved by using the proposed method.

• Industrial Engineering and Management Systems
• /
• v.15 no.3
• /
• pp.224-230
• /
• 2016

The use of new words, numerous spoken languages, and abbreviations on the Internet is extensive. As such, automatically acquiring words for the purpose of analyzing Internet content is very difficult. In a previous study, we proposed a method for Japanese word segmentation using character N-grams. The previously proposed method is based on a simple state-transition model that is established under the assumption that the input document is described based on four states (denoted as A, B, C, and D) specified beforehand: state A represents words (nouns, verbs, etc.); state B represents statement separators (punctuation marks, conjunctions, etc.); state C represents postpositions (namely, words that follow nouns); and state D represents prepositions (namely, words that precede nouns). According to this state-transition model, based on the states applied to each pseudo-word, we search the document from beginning to end for an accessible pattern. In other words, the process of this transition detects some words during the search. In the present paper, we perform experiments based on the proposed word acquisition algorithm using Japanese and Chinese newspaper articles. These articles were obtained from Japan's Kyoto University and the Chinese People's Daily. The proposed method does not depend on the language structure. If text documents are expressed in Unicode the proposed method can, using the same algorithm, obtain words in Japanese and Chinese, which do not contain spaces between words. Hence, we demonstrate that the proposed method is language independent.

• Journal of Biomedical Engineering Research
• /
• v.17 no.2
• /
• pp.263-273
• /
• 1996

The time instants, at which QRS complexes are detected, are used in the electrocardioyam rhythm analysis. Hence, it is necessary that all QRS complexes are detected and that no other waves or artifacts are wrongly labeled as such. These time instants are also used in other tasks as an indication of the location of significant events in the ECG. For example, the QRS typification algorithm uses these points to define the region of interest for complex comparison and alignment. When waveform recognition is drone for each complex, these points are used to define search intervals in which the onset and the end of the QRS nmplex have to be found This paper proposes the method for the detection of QRS complexes and decision rule for the classification scheme. The efficiency of the detection is demonstrated with the aid of an internationally validated CSE(Common Standard for Quantitative Electrocardioyaph) data set 3 and 4.