• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.3D
• /
• pp.361-366
• /
• 2006

It is widely known that the dynamic optimal path algorithm, adopting real-time path finding, can be supporting an optimal route with which users are satisfied economically and accurately. However, this system has to search optimal routes frequently for updating them. The proposed concept of optimizing search area lets it reach heuristic optimal path rapidly and efficiently. Since optimal path should be increased in proportion to an distance between origin and destination, tremendous calculating time and highly efficient computers are required for searching long distance journey. In this paper, as a result of which the concepts of partial solution and representative path are suggested. It was possible to find an optimal route by decreasing a half area in comparison with the previous method. Furthermore, as the size of the searching area is uniform, comparatively low efficient computer is required for long distance trip.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.295-298
• /
• 2002

This paper presents a fast block-matching algorithm to improve the conventional Three-Step Search (TSS) based method. The proposed Comparison Fast Block Matching Algorithm (CFBMA) begins with DAB for adaptive search range to choose searching method, and searches a part of search window that has high possibility of motion vector like other partial search algorithms. The CFBMA also considers the opposite direction to reduce local minimum, which is ignored in almost conventional based partial search algorithms. CFBMA uses the summation half-stop technique to reduce the computational load. Experimental results show that the proposed algorithm achieves the high computational complexity compression effect and very close or better image quality compared with TSS, SES, NTSS based partial search algorithms.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.224-238
• /
• 2006

As XML became the standard of data exchange in the internet, the needs for effective query processing for XML data in streaming environment is increasing. Applying the existing database technique which processes data with the unit of tuple to the streaming XML data causes the out-of-memory problem due to limited memory volume. Likewise the cost for searching query path and accessing specific data may be remarkably increased because of special structure of XML. In a word it is unreasonable to apply the existing database system to the streaming environment that processes query for partial data, not the whole one. Thus, it should be able to search partial streaming data that rapidly satisfies join predicate through using low-capacity memory, based on a store technique suitable to streaming XML data. In this thesis, in order to study the store technique for low-capacity memory, the PCDATA and the CDATA-related parts, which can be used as predicate on join query, were fetched and saved. In addition, in an attempt to compare rapid join predicates, the range window of streaming XML data was set with the object of selectively joining windows that satisfies the query, based on Cardinality * and + among the structure information of DTD.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1240-1255
• /
• 1996

This paper suggests power optimization technique in multi-level SCPC system as a method for efficient utilization of limited satellite power. The power optimization is realized by optimal assignment of satellite input carrier powers considering interference and noise generated in up-link and down-link. The Fletcher-Powell algorithm searching minimum(or maximum) point using gradient information is used to detemine the optimal input carrier powers. To apply Flectcher-Powell algorithm mathematical descriptions and their partial derivatives to interference and nose are presented. Because a target, which should be optimized, is satellite input carrier power, amplitude of each carrier group will be assumed to be an independent variable. The performance criterion for optimal power assignmentis classified into 4 categories with respect to CNR of destination receiver earth station to meet the requirement for various satellite link environment. Simulation results for two-level, four-level and six-level SCPC system are presented.

• The Journal of the Korea Contents Association
• /
• v.15 no.12
• /
• pp.212-221
• /
• 2015

This study searched the effect of volunteering activity on democratic citizen consciousness as a mediation of adolescents' leadership living technique. For this, it has been conducted that a survey for 386 middle and high school students in Chungcheongbuk-do. Main analysis results are as follows. First, searching the effect on democratic citizen consciousness, it is analyzed that volunteering activity participation satisfaction level(${\beta}=.215$), learning ability technique(${\beta}=.297$), group activity technique(${\beta}=.145$) have a positive(+) effect. Second, as a result of mediation effect, volunteering activity is confirmed that is meaningful as both a direct effect(.35) on democratic citizen consciousness and an indirect effect($.42{\times}.65=.29$) as leadership living technique and it is appeared as an partial mediation effect. Therefore, in order to improve adolescents' democratic citizen consciousness, active support for volunteering activity and overall efforts which are able to activate the leadership technique in real youth everyday life are necessary.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.418-432
• /
• 2023

In this work, we proposed a low-complexity hybrid layered tabu-likelihood ascent search (LTLAS) algorithm for large multiple-input multiple-output (MIMO) system. The conventional layered tabu search (LTS) approach involves many partial reactive tabu searches (RTSs), and each RTS requires an initialization and searching phase. In the proposed algorithm, we restricted the upper limit of the number of RTS operations. Once RTS operations exceed the limit, RTS will be replaced by low-complexity likelihood ascent search (LAS) operations. The block-based detection approach is considered to maintain a higher signal-to-noise ratio (SNR) detection performance. An efficient precomputation technique is derived, which can suppress redundant computations. The simulation results show that the bit error rate (BER) performance of the proposed detection method is close to the conventional LTS method. The complexity analysis shows that the proposed method has significantly lower computational complexity than conventional methods. Also, the proposed method can reduce almost 50% of real operations to achieve a BER of 10^-3.

• Journal of KIISE:Software and Applications
• /
• v.37 no.7
• /
• pp.548-557
• /
• 2010

In this paper, we propose a semi-automatic modeling approach of ontology to annotate VOD to realize the IPTV's intelligent searching. The ontology is made by combining partial tree that extracts hypernym, hyponym, and synonym of keywords related to a service domain from WordNet. Further, we add to the partial tree new keywords that are undefined in WordNet, such as foreign words and words written in Chinese characters. The ontology consists of two parts: generic hierarchy and specific hierarchy. The former is the semantic model of vocabularies such as keywords and contents of keywords. They are defined as classes including property restrictions in the ontology. The latter is generated using the reasoning technique by inferring contents of keywords based on the generic hierarchy. An annotation generates metadata (i.e., contents and genre) of VOD based on the specific hierarchy. The generic hierarchy can be applied to other domains, and the specific hierarchy helps modeling the ontology to fit the service domain. This approach is proved as good to generate metadata independent of any specific domain. As a result, the proposed method produced around 82% precision with 2,400 VOD annotation test data.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.11 s.102
• /
• pp.1131-1137
• /
• 2005

An orthogonal frequency division multiplexing(OFDM) system has the problem of peak-to-average power ratio (PAPR) due to the overlapping phenomena of many sub-carriers. In order to improve the performance of PAPR, we propose in this paper a new genetic sub-block phase weighting(GA-SPW) using the SPW technique. Not only the selecting mapping(SLM) and the partial sequence(PTS) but also the previously proposed SPW becomes more effective as the number of sub-blocks and phase elements increases. However, all of them have limitation on the number of sub-blocks since the searching repetition increases exponentially as the number of sub-blocks increases. Therefore, in this research, a new GA SPW is proposed to reduce the amount of calculation by using Genetic algorithm(GA). In the proposed method, the number of calculations involved in the iterative phase searching yields to depend on the number of population and generation not on the number of sub-blocks and phase elements. The superiority of the proposed method is presented in the experimental results and analysis.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.5
• /
• pp.179-186
• /
• 2014

Current networks such as social network, web page link, traffic network are big data which have the large numbers of nodes and edges. Many applications such as social network services and navigation systems use these networks. Since big networks are not fit into the memory, existing in-memory based analysis techniques cannot provide high performance. Frontier-Expansion-Merge (FEM) framework for graph search operations using three corresponding operators in the relational database (RDB) context. FEM exploits an index table that stores pre-computed partial paths for efficient shortest path discovery. However, the index table of FEM has low hit ratio because the indices are determined by distances of indices rather than the possibility of containing a shortest path. In this paper, we propose an method that construct index table using high degree nodes having high hit ratio for efficient shortest path discovery. We experimentally verify that our index technique can support shortest path discovery efficiently in real-world datasets.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.3 s.303
• /
• pp.39-52
• /
• 2005

In this paper, a registration method is presented to register partial 3D point clouds, acquired from a multi-view camera, for 3D reconstruction of an indoor environment. In general, conventional registration methods require a high computational complexity and much time for registration. Moreover, these methods are not robust for 3D point cloud which has comparatively low precision. To overcome these drawbacks, a projection-based registration method is proposed. First, depth images are refined based on temporal property by excluding 3D points with a large variation, and spatial property by filling up holes referring neighboring 3D points. Second, 3D point clouds acquired from two views are projected onto the same image plane, and two-step integer mapping is applied to enable modified KLT (Kanade-Lucas-Tomasi) to find correspondences. Then, fine registration is carried out through minimizing distance errors based on adaptive search range. Finally, we calculate a final color referring colors of corresponding points and reconstruct an indoor environment by applying the above procedure to consecutive scenes. The proposed method not only reduces computational complexity by searching for correspondences on a 2D image plane, but also enables effective registration even for 3D points which have low precision. Furthermore, only a few color and depth images are needed to reconstruct an indoor environment.