• Journal of Advanced Navigation Technology
• /
• 제19권4호
• /
• pp.265-277
• /
• 2015

Automatic dependent surveillance-broadcast (ADS-B) is the core technology of communication, navigation and surveillance/air traffic management (CNS/ATM), automatically broadcasts its own position information using GNSS and has an advantage of lower geological constraints and faster update speed compared with legacy radar systems. EUROCONTROL defined all purpose structured eurocontrol surveillance information exchange (ASTERIX) CAT.021. ASTERIX CAT.021 is modified several times, but it has compatibility issues with previous version of it. In this paper, we have designed an efficient message processing module regardless of the version of ASTERIX CAT.021. This implemented module generates patterns to collect messages received from the network, after that, received messages are processed in the routine that is defined in accordance with the patterns.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제29권7A호
• /
• pp.756-765
• /
• 2004

Using single carrier frequency RFID system in one-to-multiple wireless communications, might be generated data loss because of data collisions. Conventional Anti-collision method prevent data loss from data collisions which are binary tree method and ALOHA. However, those two preventive measures also have week points which are strongly dependent on the time and space when passing through the recognition area. This paper suggests the full-length instruction code method which fits in to half-duplex method, prevents data collision effectively by calculating the non-transmitting time of multiple tags considering approaching time to the recognition area. After full-length instruction code method test using 13.56MHz bandwidth RFID system shows that full-length instruction code method could make better result than any other methods. Moreover, the record shows O(n) result after analyzing O-notation of conventional time-domain procedure.

• Applied Chemistry for Engineering
• /
• 제8권2호
• /
• pp.286-291
• /
• 1997

Taxol which is recognized as a powerful anticancer reagent was extracted from yew extract and separated by NP-HPLC (Normal-PhaseHigh Performance Liquid Chromatography). The experiments were performed in the isocratic mode with $5{\mu}l$ to $100{\mu}l$ injection volume and 1ml/min mobile phase flow rate. The major mobile phase was hexane and small amounts of ethanol, methanol, 1-propanol and isopropanol were added to change the retention behavior. Prior to a real sample, the artificial mixture of taxol, cephalomannine and 10-deacetyltaxol was tested. They are hard to be separated because of similar chemical structures. The experimental results showed that the proper composition of mobile phase for separating the three components was found 96% hexane and 4% ethanol(vol.%) or 96% hexane, 2% 1-propanol and 2% methanol(vol.%). Compared to the run time of 80 minutes for the binary system, the mixture was separated within 50 minutes with the less amount of mobile phase for the ternary system. Finally, $1{\mu}g$ of taxol was separated from yew tree extracts under the optimum operating conditions.

• Journal of KIISE:Information Networking
• /
• 제29권3호
• /
• pp.265-275
• /
• 2002

A default server strategy is a very popular scheme for managing location and state information of mobile hosts in cellular networks. But the communication cost increases if the call requests are frequent and the distant between the default server and the client is long. Still more any connection to a mobile host cannot be established when the default server of the destination mobile host fails. These problems can be solved by replicating default server and by letting nearest replicated default server process the query request which is sent from a client. It is important to allocate replicated default servers efficiently in networks and determine the number of replicated default servers. In this paper, we suggest and evaluate a default server replication strategy to reduce communication costs and to improve service availabilities. Furthermore we propose and evaluate an optimized allocation algorithm and an optimal replication degree for replicating: dofault servers in nn grid networks and binary tree networks.

• Journal of Korea Game Society
• /
• 제17권6호
• /
• pp.113-120
• /
• 2017

With the development of virtual reality technology, in recent years, user-friendly hand gesture interface has been more studied for natural interaction with a virtual 3D object. Most earlier studies on the hand-gesture interface are using relatively simple hand gestures. In this paper, we suggest an intuitive hand gesture interface for interaction with 3D object in the virtual reality applications. For hand gesture recognition, first of all, we preprocess various hand data and classify the data through the binary decision tree. The classified data is re-sampled and converted to the chain-code, and then constructed to the hand feature data with the histograms of the chain code. Finally, the input gesture is recognized by MCSVM-based machine learning from the feature data. To test our proposed hand gesture interface we implemented a 'Virtual Block' game. Our experiments showed about 99.2% recognition ratio of 16 kinds of command gestures and more intuitive and user friendly than conventional mouse interface.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제19권12호
• /
• pp.2364-2375
• /
• 1994

For the efficient recognition of printed Korean characters, a multiplexed minimum average correlation energy(MMACE) filter is proposed. Proposed method solved the disadvantages of the tree structure algorithm which recognition system is very huge and recognition method is sophisticated. Using only one consonant MMACE filter and one vowel one, we recognized the full Korean character. Each MMACE filter is multiplexed by 4 K-tuple MACE filters which are synthesized by 24 consonants and vowels. Hence the proposed MMACE filter and the correlation distribution plane are divided by 4 subregion. We obtained the binary codes for the Korean character recognition from each correlation distribution subplane. And the obtained codes are compared with the truth table for consonants and vowels in computer. We can recognize the full Korean characters when substitute the corresponded consonant or vowel font of the consistent code to the correlation peak place in the output correlation plane. The computer simulation and optical experiment results show that the proposed compact Korean character recognition system using the MMACE filters has high discrimination capability.

• Child Health Nursing Research
• /
• 제18권3호
• /
• pp.143-149
• /
• 2012

Purpose: The aim was to explore the relationship between health status/life style and prevalence of atopic dermatitis in adolescents. Methods: Data from 1,743 adolescents (aged 13 to 18 years) derived from the fourth Korea National Health and Nutrition Examination Survey (KNHANES) were analyzed using binary logistic regression and the classification and regression tree (CART) model. Results: The prevalence rate of atopic dermatitis was 10.3%. Third quartile income class (OR=2.19, 95% CI=1.20-4.00), fair and unhealthy self-rated health (OR=1.49, 95% CI=1.06-2.11; OR= 2.73, 95% CI=1.64-4.55), past or current smoker (OR=0.41, 95% CI=0.20-0.85; OR=0.44, 95% CI=0.21-0.92), and more than average stress (OR=1.43, 95% CI=1.03-1.99) were related with increased prevalence of atopic dermatitis. The high prevalence risk groups for atopic dermatitis were adolescents who perceived themselves to be healthy on self-rated health and had more than average stress and those who perceived themselves to be unhealthy and who never smoked. Conclusion: The results of the study indicate that health status, smoking, and stress are associated with a prevalence risk for adolescent atopic dermatitis in different degrees. Therefore, for control of atopic dermatitis, various interventions for smoking and stress need to be reinforced for the high prevalence atopic dermatitis groups.

• Journal of Computing Science and Engineering
• /
• 제1권2호
• /
• pp.177-194
• /
• 2007

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.

• English & American cultural studies
• /
• 제16권2호
• /
• pp.111-139
• /
• 2016

Plato's philosophical importance in western thinking history cannot be understated. Especially his dichotomy system became common to the European traditions of philosophical and scientific discourses by assigning principal value to the presence that is opposed to the absence. Since the ancient Greeks, the concept of presence has been expressed itself in number of ways such as God, Truth, Logos, and center. Derrida called this European thinking "the metaphysics of presence." In order to analyze logocentrism also called the metaphysics of presence in No Telephone to Heaven, I used the term, paralogy that Aristotle did not accept as rules of argumentation but that Lyotard revived it positively as the principle of reason. Lyotard's incredulity towards rationalist theory of modernism is that knowledge can never be certain. Without any ultimate validity, certainty is impossible. Nevertheless, as Fanon said, the colonial world is dominated with a traditional Manichaean world. As a result what remains to the colonized to establish their identities is that of an armed struggle towards the colonizer even though they know it results in the vicious circle of hatred endlessly. Cliff attempted to show this message in her text through the tragic heroine, Clare Savage. Cliff's another critique of modernism's rationalism is shown through the ambiguous sexuality of Harry/Harriot. In this novel, gender plays also a central role by questioning the traditional binary system of sexuality. In this paper, I deconstructed this traditional gender system in terms of Bulter's concept of performitivity. This study will give the text another layer of deconstructive interpretation echoing with the proverb, one tree cannot make a forest.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제13권5호
• /
• pp.3-15
• /
• 2003

The secure group communication enables the members, which belong to the same group, to communicate each other in a secure and secret manner. To do so, it is the most important that a group key is securely distributed among them and also group membership is efficiently managed. In detail, the generation, the distribution and the refreshment of a group key would be highly regarded in terms of low communication and computation complexity. In this paper, we show you a new protocol to generate a group key which will be safely shared within a group, utilizing the 2-party Diffie-Hellman key exchange protocol and the complete binary tree. Our protocol has less complexity of computation per group member by substituting many parts of exponentiation computations for multiplications. Consequently, each group member needs constant computations of exponentiation and multiplication regardless of the group size in the protocol and then it has less complexity of the computation than that of any other protocols.