• Spatial Information Research
• /
• v.18 no.4
• /
• pp.65-73
• /
• 2010

Recently, the importance of the ocean has been increasing internationally as the new source for mineral resources following the exhausted land resources that arc becoming scarce. On a long-term aspect, growth of nations by gaining competitiveness on marine resources was considered a paradigm. Because dominating the development right of marine resources came up as the main concern. South Korea has also been interested in marine resources and this is the reason why massive amounts of marine exploration data arc annually created through surveying and drilling around the Korean Peninsula. but the data has not been systematically managed very well because of its economic costs. Therefore, this research is mainly focused on systematical data managing methods. For Systematical data management. the exploration data is integrated and organized by using XML tables. This can be a systematical data management. because the methods release dependency between data and system, and it also enables to update existing data and renew the data. In the future, the constructed database from this study could definitely contribute to enhancing data management. As well, the developed system in this research can provide various spatial analysis and searching techniques to enable easier data provision of various exploration areas. Furthermore. this will be very useful to extend functions of the system and to adopt other types of DBMS. In addition, the spatial analysis and search function of location based service can be utilized through GIS. and it can support sustainable and systematic management in a long term.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.1-12
• /
• 2015

NAND flash memory has being used for storage systems widely, because it has good features which are low-price, low-power and fast access speed. However, NAND flash memory has an in-place update problem, and therefore it needs FTL(flash translation layer) to run for applications based on hard disk storage. The FTL includes complex functions, such as address mapping, garbage collection, wear leveling and so on. Futhermore, implementation of the FTL on low-power embedded systems is difficult due to its memory requirements and operation overhead. Accordingly, many index data structures for NAND flash memory have being studied for the embedded systems. Overall performances of the index data structures are enhanced by a decreasing of page write counts, whereas it has increased page read counts, as a side effect. Therefore, we propose an index management method using a page mapping log table in $B^+$-Tree based on NAND flash memory to decrease page write counts and not to increase page read counts. The page mapping log table registers page address information of changed index node and then it is exploited when retrieving records. In our experiment, the proposed method reduces the page read counts about 61% at maximum and the page write counts about 31% at maximum, compared to the related studies of index data structures.

• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.251-261
• /
• 2014

In the typical P2P VOD system, it is very important to develop the fast and efficient peer searching scheme since the peers frequently join and leave to/from P2P system. This paper proposes a new peer searching scheme for P2P VOD system based on DHT network environment. The proposed scheme constructs DHT network by managing the peers having close playback starting times and close network locations into a peer all together. The peer information is mapped onto DHT nodes by hashing the key values each of which consists of the starting time and network location of the peer. From the simulation results, the number of messages required to search the partner peers are decreased, and the number of buffer maps exchanging among the peers are also decreased. The proposed scheme can reduce the average network distances among the partner peers. As a result, the proposed scheme makes routing more efficient and it saves the network resources by decreasing communication traffic overhead.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.6
• /
• pp.766-772
• /
• 2007

As XML is widely used, many researches on the XML storage and query processing have been done. But, previous works on path query processing have mainly focused on the storage and retrieval methods for a large XML document or XML documents had a same DTD. Those researches did not efficiently process partial match queries on the differently-structured document set. To resolve the problem, we suggested a new index structure using relational table. The method constructs the $B^+$-tree index using backward label paths instead of forward label paths used in previous researches for storing path information and allows for finding the label paths that match the partial match queries efficiently using it when process the queries.

• Journal of Digital Contents Society
• /
• v.9 no.2
• /
• pp.285-293
• /
• 2008

In Semantic Web, metadata and ontology for representing semantics and conceptual relationships of information resources are essential factors. RDF and RDF Schema are W3C standard models for describing metadata and ontology. Therefore, many studies to store and retrieve RDF and RDF Schema documents are required. In this paper, we focus on some results of analyzing available query patterns considering both RDF and RDF Schema and classify queries on RDF and RDF Schema into the three patterns. RDF and RDF Schema can be represented as graph models. So, we proposed some strategies to store and retrieve using the graph models of RDF and RDF Schema. We can retrieve entities that can be arrived from a certain class or property in RDF and RDF Schema without a loss of performance on account of multiple joins with tables.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.851-858
• /
• 2004

This paper presents improved teaching and learning GUI for easily analysis tool of load flow of power system with database function for searching solution. In this paper includes not only contingency analysis function but also searching function of conditional solution sets from database of solution for various load levels. The GUI is friendly for study for power system operation and control because picture provide a better visualizing of relationshipsbetween input parameters and effects than a tabula type result. This GUI enables topologyand the output data of load flow for line outages to be shown on same picture page. Userscan input the system data for power flow on the the picture and can easily see the theresult diagram of bus voltage, bus power, line flow. It is also observe the effects of different types of variation of tap, shunt capacitor, loads level, line outages. Proposed GUI has been studied on the Ward-Hale 6-Bus system.

• The KIPS Transactions:PartC
• /
• v.17C no.5
• /
• pp.433-440
• /
• 2010

Energy efficiency, low latency and scalability for wireless sensor networks are important requirements, especially, the wireless sensor network consist of a large number of sensor nodes should be minimized energy consumption of each node to extend network lifetime with limited battery power. An efficient algorithm and energy management technology for minimizing the energy consumption at each sensor node is also required to improve transfer rate. Thus, this paper propose no-overlap multi-pass protocol provides for sensor data transmission in the wireless sensor network environment. The proposed scheme should minimize network overhead through reduced a sensor data translation use to searched multi-path and added the multi-path in routing table. Proposed routing protocol may minimize the energy consumption at each node, thus prolong the lifetime of the sensor network regardless of where the sink node is located outside or inside the received signal strength range. To verify propriety proposed scheme constructs sensor networks adapt to current model using the real data and evaluate consumption of total energy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1828-1834
• /
• 2004

With the rapid development of wireless communications and mobile technologies, requirements of various services based on moving objects like location-based services and mobile applications services have been increased. In this paper, we propose an index structure which can improve the performance on trajectory-based query especially, one of the various query types for moving objects in mobile applications. It maintains link table(L-Table) to obtain good efficiency on retrieval and insertion performance of the existing TB(Trajectory Bundle)-tree proposed for trajectory-based query of moving objects. The L-Table contains page number in disk and memory pointers pointing the leaf node with the first and last line segment of moving objects in order to directly access preceding node. In addition, we design to reside a part of whole index in main memory by preserving a fixed size of buffer in case of being restricted by available main memory. Finally, experimental results with various data sets show that the proposed technique is superior to the existing index structures with respect to insertion and trajectory-based query.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.11
• /
• pp.2429-2434
• /
• 2010

In this paper, we propose a method to extract and analyze palm line with fuzzy method. In order to extract the palm part, we transform the original RGB color space to YCbCr color space and extract sin colors ranging Y:65-255, Cb:25-255, Cr:130-255 and use it as a threshold. Possible noise is removed by 8-directional contour tracking algorithm and morphological characteristic of the palm. Then the edge is extracted from that noise-free image by stretching method and sobel mask Then the fuzzy binarization algorithm is applied to remove any minute noise so that we have only the palm lines and the boundary of the hand. Since the palm line reading is done with major lines, we use the morphological characteristics of the analyzable palm lines and fuzzy inference rules. Experiment verifies that the proposed method is better in visibility and thus more analyzable in palm reading than the old method.

• The Journal of the Korea Contents Association
• /
• v.11 no.12
• /
• pp.560-569
• /
• 2011

In this paper, we propose a text processing method for Hindi characters, Devanagari scripts, in the Android. The key points of the text processing are to device automata, which define the combining rules of alphabets into a set of syllables, and to implement a font rendering engine, which retrieves and displays the glyph images corresponding to specific characters. In general, an automaton depends on the type and the number of characters. For the soft-keyboard, we designed the automata with 14 consonants and 34 vowels based on Unicode. Finally, a combined syllable is converted into a glyph index using the mapping table, used as a handle to load its glyph image. According to the multi-lingual framework of Freetype font engine, Dvanagari scripts can be supported in the system level by appending the implementation of our method to the font engine as the Hindi module. The proposed method is verified through a simple message system.