• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.785-788
• /
• 2005

We design as well as implement MRTG++ enhanced by eliminating drawbacks of original MRTG. Existing MRTG makes it easy to monitor network resources on the web, and it can show some trend utilization about resources of remote systems. However MRTG has only functions showing statistical information data with daily/monthly/yearly characteristics in real-time, and periodically deletes stored data. Thus we improve log file-based storing method as an effectivelly storing method with database, propose expended MRTG++ retrieving as well as managing with measured data. It also can be applied in ubiquitous environment.

• Genomics & Informatics
• /
• v.16 no.4
• /
• pp.30.1-30.6
• /
• 2018

There is urgent need for effective and cost-efficient data storage, as the worldwide requirement for data storage is rapidly growing. DNA has introduced a new tool for storing digital information. Recent studies have successfully stored digital information, such as text and gif animation. Previous studies tackled technical hurdles due to errors from DNA synthesis and sequencing. Studies also have focused on a strategy that makes use of 100-150-bp read sizes in both synthesis and sequencing. In this paper, we a suggest novel data encoding/decoding scheme that makes use of long-read DNA (~1,000 bp). This enables accurate recovery of stored digital information with a smaller number of reads than the previous approach. Also, this approach reduces sequencing time.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.73-77
• /
• 2001

In this paper, we propose a virtual action system based on information agents, We call the system the MultiHammer, MultiHammer can be used for studying and analyzing online actions. MuiltiHammer provides functions of implement-ing a meta online action site and an experiment environ-ment. We have been using MultiHammer as an experiment as an experiment environment for BiddinBot. BiddingBot aims at assisting users to bid simultaneously in multiple online auctions. In order to bid simultaneously in multiple online auctions. In order to analyze the behavior of BiddngBot, we need to pur-chase a lot of items. It is hard for us to prepare a lot of fund to show usability and advantage of BiddingBot. MultiHam-mer enables us to effectively analyze the behavior of BiddingBot. MultiHammer consists of three types of agents for information collecting data storing and auctioning. Agents for information wrappers. To make agent work as wrarp-pers, we heed to realize software modules for each online action site. Implementing these modules reguires a lot of time and patience. To address this problem, we designed a support mechanism for developing the modules. Agents for data storing record the data gathered by agents for informa-tion collecting. Agents for auctioning provide online services using data recorded by agents for data storing. By recording the activities in auction sites. MultiHammer can recreate any situation and trace auction for experimentation, Users can participate in virtual using the same information in real online auctions. Users also participate in real auc-tions via wrapper agents for information collecting

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.4
• /
• pp.487-494
• /
• 2022

With the recent demand for analysis using data, the size of the knowledge graph, which is the data to be analyzed, gradually increased, reaching about 82 billion edges when extracted from the web as a knowledge graph. A lot of knowledge graphs are represented in the form of Resource Description Framework (RDF), which is a standard of W3C for representing metadata for web resources. Because of the characteristics of RDF, existing RDF storages have the limitations of processing time overhead when converting and storing large amounts of RDF data. To resolve these limitations, in this paper, we propose a method of compressing and converting large amounts of RDF data into integer IDs using MapReduce, and vertically partitioning and storing them. Our proposed method demonstrated a high performance improvement of up to 25.2 times compared to RDF-3X and up to 3.7 times compared to H2RDF+.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.612-622
• /
• 2003

This paper studied and proposed a XML document storing-and-retrieval framework based on a variant k-ary complete tree and a RDF metadata, which is composed of an effective storing module to store xml documents, a retrieving module to retrieve xml documents, and a connecting module to make this system intemperate in the web environment. In this storing module, DTD independent DOM based decomposition model using a method of addressing unique ill using a variant k-ary complete tree is adopted and is implemented. Query Processing Module includes a XPath query process and a content based retrieval function using word index for content information. To retrieve more exactly data, a structural retrieval using RDF metadata is adopted and implemented. In order to implement effectively XML document storing and retrieval system in the web environment, API using XML-RPC, API using HTTP's GET, PUT, POST and API using SOAP have been adopted and implemented.

• Journal of Information Technology Applications and Management
• /
• v.9 no.1
• /
• pp.85-96
• /
• 2002

Nowadays an information exchange on XML such as B2B electronic commerce is spreading. Therefore the systematic and stable management mechanism for storing the exchanged Information is needed. For this goal there are many research activities for connection between XML application and relational database. But because XML data have hierarchical structures and relational database can store only flat-structured data, we need to store XML data in object-oriented database that support hierarchical structure. Accordingly the modeling methodology for storing XML data in object-oriented database is needed. In order to build good quality application systems, modeling is an important first step. In 1997, the OMG adopted the UML as its standard modeling language. Since industry has warmly embraced UML, its popularity should become more important in the future. So a design methodology based on UML is need to develop efficiently XML applications. In this paper, we propose a unified design methodology for XML applications based on object- oriented database using UML. To this goal, first we introduce a XML modeling methodology to design W3C XML schema using UML and second we propose data modeling methodology for object-oriented database schema to store efficiently XML data in object-oriented databases.

• The Journal of Society for e-Business Studies
• /
• v.7 no.1
• /
• pp.153-166
• /
• 2002

Nowadays an information exchange on Bn such as B2B electronic commerce is spreading. Therefore the systematic and stable management mechanism for storing the exchanged information is needed. For this goal there are many research activities for connection between XML application and relational database. But because XML data have hierarchical structures and relational database can store only flat-structured data, we need to store XML data in object-relational database that support hierarchical structure. Accordingly the modeling methodology for storing XML data in object-relational database is needed. In order to build good quality application systems, modeling is an important first step. In 1997, the OMG adopted the UML as its standard modeling language. Since industry has warmly embraced UML its popularity should become more important in the future. So a design methodology based on UML is need to develop efficiently XML applications. In this paper, we propose a unified design methodology for In applications based on object-relational database using In. To this goal, first we introduce a XML modeling methodology to design W3C XML schema using UML and second we propose data modeling methodology for object-relational database schema to store efficiently XML data in object-relational databases.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.857-860
• /
• 1999

It is made possible a removal of the preamble for carrier recovery and symbol-timing recovery by storing a burst in memory with low overhead QPSK demodulation and this demodulation method also effects frame efficiency improved by processed synchronization performance. In this paper, we have proposed that new algorithm for arc-tangent look-up table which transform the input I, Q data by phase. This I, Q data plays an important role in demodulation and makes demodulator with low-overhead by storing a burst in memory. To evaluate proposed new algorithm and symbol-timing recovery method, function simulation and timing verification have been done by using synopsys VHDL tool.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1716-1725
• /
• 1996

In this paper, the huffman decoder which is a part of the decoder in JPEG standard format is designed by using a new Ternary CAM. First, the 256 word * 16 bit-size new bit-word all parallel Ternary CAM system is designed and verified using SPICE and CADENCE Verilog-XL, and then the verified novel Ternary CAM is applied to the new huffman decoder architecture of JPEG. So the performnce of the designed CAM cell and it's block is verified. The new Ternary CAM has various applications because it has search data mask and storing data mask function, which enable bit-wise search and don't care state storing. When the CAM is used for huffman look-up table in huffman decoder, the CAM is partitioned according to the decoding symbol frequency. The scheme of partitioning CAM for huffman table overcomes the drawbacks of all-parallel CAM with much power and load. So operation speed and power consumption are improved.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1539-1550
• /
• 2007

As XML is increasingly used for representing and exchanging data, relational database systems have been trying extend their features to handle XML documents XML documents can be stored in a column with XML data type like primitive types. The shredding method, which is one of the traditional methods for storing and managing XML documents in RDBMS, is still useful and viable although it has some drawbacks due to the structural discrepancy between XML and relational databases. This method may be suitable for data-centric XML documents with simple schema. This paper presents the extended version of the Association inlining method that is based on inlined shredding and compares the performance of querying processing to that of XML type method of conventional relational database systems. The experiments showed that in most cases our method resulted in better performance than the other method based on XML data type. This is due to the fact that our shredding method keeps and uses the order and path information of XML documents. The path table has the information of the corresponding table and column for each distinct path and the structure information of the XML document is extracted and stored in data tables.