• Journal of Internet Computing and Services
• /
• 제16권6호
• /
• pp.23-30
• /
• 2015

As BigData is issued, many applications that operate based on the results of data analysis have been developed, typically applications are products recommend service of e-commerce application service system, search service on the search engine service and friend list recommend system of social network service. In this paper, we suggests a decision frequent pattern tree that is combined the origin frequent pattern tree that is mining similar pattern to appear in the data set of the existing data mining techniques and decision tree based on the theory of computer science. The decision frequent pattern tree algorithm improves about problem of frequent pattern tree that have to make some a lot's pattern so it is to hard to analyze about data. We also proposes to model for a Mapredue framework that is a programming model to help to operate in distributed environment.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• 제44권8호
• /
• pp.668-674
• /
• 2016

In this paper the development directions of the next generation launch vehicle program following KSLV-II has been discussed, which are to be executed after year 2020 according to the Medium and Long Term Plan for National Space Development. Also, several areas of technology advancement have been identified for the successful development of the LVs. The next generation LV must aim for not only the high performance but also for low cost as well as high reliability in order to compete against global commercial launch service providers. To this end, the next generation LVs program shall capitalize on many anticipated accomplishments of the KSLV-II program such as the 75 ton class LOX/kerosene rocket engine.

• Journal of Aerospace System Engineering
• /
• 제10권4호
• /
• pp.67-74
• /
• 2016

The primary aim for using a Korean Condition Based Maintenance (CBM) system is to maintain military operational readiness using Interactive Collection Analysis Systems (ICAS) installed on naval vessels. Other aims are to preemptively provision maintenance and supply functions, to guarantee economical management of logistical assets, and to implement data driven equipment life cycle management. In order to accomplish these aims, it is necessary to establish standard system conditions. However, because manufacturers do not provide the technology necessary for maintenance management, it is required to retain component performance maps for each piece of equipment, and to accumulate data about frequently occurring fault patterns. This study confirms the validity of component performance maps using micro gas turbines and provides accumulated data on machine break downs. This would allow real time equipment performance checks and present performance trends. Then analysis would provide solutions for maintaining the best machine operating conditions with detailed maintenance manuals for operators. This study is a basis for further research to investigate additional ways to develop CBM using data obtained from naval vessels used in actual military operations.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• 제33권9호
• /
• pp.16-26
• /
• 2005

The aerodynamic design of a proprotor for the Smart UAV adopting tiltrotor aircraft concept is conducted in this study. Since proprotor of tiltrotor aircraft is operated at both rotary and fixed wing mode with single configuration rotor, the proprotor has to be designed to meet performance requirements for both flight modes. The aerodynamic design of proprotor is accomplished by combining three sources of data - the proprotor performance data, the aerodynamic data of vehicle, and the performance data of engine. The performance analysis code for proprotor is based on the combined momentum and blade element theory and validated by comparison with the TRAM data. In order to design configuration for a proprotor satisfying requirements for both rotary and fixed wing mode, various kind of performance maps are constructed for many performance and configuration parameters. From the analysis the twist angle of 38 degrees and the solidity of 0.118 are decided to be the optimal geometric parameters for both operating conditions.

• Journal of KIISE
• /
• 제41권10호
• /
• pp.762-773
• /
• 2014

As the web of data is increasingly producing large RDFS datasets, it becomes essential in building scalable reasoning engines over large triples. There have been many researches used expensive distributed framework, such as Hadoop, to reason over large RDFS triples. However, in many cases we are required to handle millions of triples. In such cases, it is not necessary to deploy expensive distributed systems because logic program based reasoners in a single machine can produce similar reasoning performances with that of distributed reasoner using Hadoop. In this paper, we propose a scalable RDFS reasoner using logical programming methods in a single machine and compare our empirical results with that of distributed systems. We show that our logic programming based reasoner using a single machine performs as similar as expensive distributed reasoner does up to 200 million RDFS triples. In addition, we designed a meta data structure by decomposing the ontology triples into separate sectors. Instead of loading all the triples into a single model, we selected an appropriate subset of the triples for each ontology reasoning rule. Unification makes it easy to handle conjunctive queries for RDFS schema reasoning, therefore, we have designed and implemented RDFS axioms using logic programming unifications and efficient conjunctive query handling mechanisms. The throughputs of our approach reached to 166K Triples/sec over LUBM1500 with 200 million triples. It is comparable to that of WebPIE, distributed reasoner using Hadoop and Map Reduce, which performs 185K Triples/sec. We show that it is unnecessary to use the distributed system up to 200 million triples and the performance of logic programming based reasoner in a single machine becomes comparable with that of expensive distributed reasoner which employs Hadoop framework.

• Journal of KIISE:Information Networking
• /
• 제28권2호
• /
• pp.262-276
• /
• 2001

Recently much research for developing forwarding table that support fast router without employing both special hardware and new protocols. This article introduces a new forwarding data structure based on the software to enable forwarding lookup to be penormed at giga-bit speed. The forwarding table is known as a bottleneck of the routers penormance due to its high complexity proportional to the forwarding table size. The recent research that based on the software uses a Patricia trie and its variants. and also uses a hash function with prefix length key and others. The proposed forwarding table structure construct a forwarding table by the bit stream array in which it constructs trie from routing table prefix entries and it represents each pointer pointing the child node and the associated forwarding table entry with one bit The trie structure and routing prefix pointer need a large memory when representing those by linked-list or array. but in the proposed data structure, the needed memory size is small enough since it represents information with one bit. Additionally, by use a lookup method that start searching at desired middle level we can shorten the search path. The introduced data structure. called bit-map trie shows that we can implement a fast forwarding engine on the conventional Pentium processor by reducing the backbone routing table fits into Level 2 cache of Pentium II processor and shortens the searching path. Our experiments to evaluate the performance of proposed method show that this bit-map trie accomplishes 5.7 million lookups per second.