• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.5
• /
• pp.18-27
• /
• 2006

Rapid increase of the amount of music data demands for a new method that allows efficient similarity retrieval of music genre using audio features in music databases. To build this similarity retrieval, an indexing techniques that support audio features as a time-series pattern and data mining technologies are needed. In this paper, we address the development of a system that retrieves similar genre music based on the indexing techniques. We first propose the structure of content-based music genre retrieval system based on the time-series pattern index file and data mining technologies. In addition, we implement the time-series pattern index file using audio features and present performance analysis of the time-series pattern index file for similar genre retrieval. The experiments are performed on real data to verify the performance of the proposed method.

• Journal of Computing Science and Engineering
• /
• v.6 no.4
• /
• pp.280-286
• /
• 2012

The last decades have witnessed an increasingly indispensible role of high performance computing (HPC) in science, business and financial sectors, as well as military and national security areas. To introduce key aspects of HPC to a broader community, an HPC session was organized for the first time ever for the United States and Korea Conference (UKC) during 2012. This paper summarizes four invited talks that each covers scientific HPC applications, large-scale parallel file systems, administration/maintenance of supercomputers, and green technology towards building power efficient supercomputers of the next generation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.387-390
• /
• 2012

In this paper, we propose a fast booting solution with embedded linux-based smart devices. We have divided the fast boot process into six steps, such as boot loader, kernel, file system, the init-scripts, shared libraries, and applications for an embedded linux-based boot process to improve the fast booting. Improvements for the fast boot are made in the boot loader phase, which is the first phase at power-up, and the init-script that runs the boot loader phase. To improve the fast booting, standby time from the boot loader and unnecessary initialization routine have been removed, and uncompressed kernel image loading as well as optimized copy routine have been applied. Further, a technology that replaces binary scripts in init-script phase and light-weight init process have been utilized to improve the boot.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.2
• /
• pp.161-169
• /
• 2016

This paper is intended to propose a novel approach to select an optimal site for a small-scaled artificial recharge system installation using TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) with geospatial data. TOPSIS is a MCDM (Multi-Criteria Decision Making) method to choose the preferred one of derived alternatives by calculating the relative closeness to an ideal solution. For applying TOPSIS, in the first, the topographic shape representing optimal recovery efficiency is defined based on a hydraulic model experiment, and then an appropriate surface slope is determined for the security of a self-purification capability with DEM (Digital Elevation Model). In the second phase, the candidate areas are extracted from an alluvial map through a morphology operation, because local alluvium with a lengthy and narrow shape could be satisfied with a primary condition for the optimal site. Thirdly, a shape file over all candidate areas was generated and criteria and their values were assigned according to hydrogeologic attributes. Finally, TOPSIS algorithm was applied to a shape file to place the order preference of candidate sites.

• Journal of Information Processing Systems
• /
• v.10 no.4
• /
• pp.628-645
• /
• 2014

In past few years, distributed hash table (DHT)-based P2P systems have been proven to be a promising way to manage decentralized index information and provide efficient lookup services. However, the skewness of users' preferences regarding keywords contained in a multi-keyword query causes a query load imbalance that combines both routing and response load. This imbalance means long file retrieval latency that negatively influences the overall system performance. Although index replication has a great potential for alleviating this problem, existing schemes did not explicitly address it or incurred high cost. To overcome this issue, we propose, in this paper, an integrated solution that consists of three replication schemes to alleviate query load imbalance while minimizing the cost. The first scheme is an active index replication that is used in order to decrease routing load in the system and to distribute response load of an index among peers that store replicas of the index. The second scheme is a proactive pointer replication that places location information of each index to a predetermined number of peers for reducing maintenance cost between the index and its replicas. The third scheme is a passive index replication that guarantees the maximum query load of peers. The result of simulations indicates that the proposed schemes can help alleviate the query load imbalance of peers. Moreover, it was found by comparison that our schemes are more cost-effective on placing replicas than PCache and EAD.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3694-3722
• /
• 2022

In today's globalized world, there is no transparency in exchanging data and information between producers and consumers. However, these tasks experience many challenges, such as administrative barriers, confidential data leakage, and extensive time delays. To overcome these challenges, we propose a decentralized, secured, and verified smart chain framework using Ethereum Smart Contract which employs Inter Planetary File Systems (IPFS) and MongoDB as storage systems to automate the process and exchange information into blocks using the Tendermint algorithm. The proposed work promotes complete traceability of the product, ensures data integrity and transparency in addition to providing security to their personal information using the Lelantos mode of shipping. The Tendermint algorithm helps to speed up the process of validating and authenticating the transaction quickly. More so in this time of pandemic, it is easier to meet the needs of customers through the Ethermint Smart Chain, which increases customer satisfaction, thus boosting their confidence. Moreover, Smart contracts help to exploit more international transaction services and provide an instant block time finality of around 5 sec using Ethermint. The paper concludes with a description of product storage and distribution adopting the Ethermint technique. The proposed system was executed based on the Ethereum-Tendermint Smart chain. Experiments were conducted on variable block sizes and the number of transactions. The experimental results indicate that the proposed system seems to perform better than existing blockchain-based systems. Two configuration files were used, the first one was to describe the storage part, including its topology. The second one was a modified file to include the test rounds that Caliper should execute, including the running time and the workload content. Our findings indicate this is a promising technology for food supply chain storage and distribution.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.12
• /
• pp.487-496
• /
• 2017

In MySQL InnoDB, there are two ways of storing data. One is to create a separate tablespace for each table and store it separately. Another is to store all table and index information in a single system tablespace. You can use this information to recover deleted data from the record. However, in most of the current database forensic studies, the former is actively researched and its structure is analyzed, whereas the latter is not enough to be used for forensics. Both approaches must be analyzed in terms of database forensics because their storage structures are different from each other. In this paper, we propose a method for recovering deleted records in a method of storing records in IBDATA file, which is a single system tablespace. First, we analyze the IBDATA file to reveal its structure. And introduce delete record recovery algorithm which extended to an unallocated page area which was not considered in the past. In addition, we show that the recovery rate is improved up to 68% compared with the existing method through verification using real data by implementing the algorithm as a tool.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.286-290
• /
• 2008

As the number of mobile device users increases, many researches on peer-to-peer(P2P) systems in mobile environments have been carried out. In this paper, we propose a couple of double-layered P2P file sharing systems to overcome the 'flooding' problem in previous mobile P2P systems. We classify peers into two groups, super peers and sub-peers to establish new routing tables. A super peer manages its sub-peers in the systems. The first proposed system partitions the service area into small cells, each of which is a square. Each super peer is located near the center of the square. The second system selects super peers which have the largest number of adjacent peers. As file transmission and file searches are managed mainly by super peers, unnecessary multi-broadcasting could be avoided. The experimental results show that the proposed systems outperform a typical file sharing system in terms of the amount of message traffic with about $1.2{\sim}1.6$ times improvement on the average.

• Journal of Technologic Dentistry
• /
• v.39 no.1
• /
• pp.35-42
• /
• 2017

Purpose: The purpose of this paper was to evaluate the occurrence of errors regarding adaptation by conducting a three-dimensional assessment comparing the bridge type dental restoration after the cutting process, which has multiple abutments, with a single type dental restoration. Methods: By using ten identical files obtained by scanning the master model, thirty designs were created consisting of ten maxillary right first premolars and ten maxillary right first molars with single crown abutments, along with ten bridge designs with the identical abutment. A 5-axis milling machine was used to produce the design file. The produced denture prostheses were scanned using a silicone replica for a STL file. An evaluation was conducted using 3D analysis software on the master model and each of the thirty data files. Results: The RMS value of the pre-molar (14) was $38.4{\pm}4{\mu}m$ for single and $54.7{\pm}6{\mu}m$ for bridge abutment; therefore, a statistically significant difference was observed for single and bridge designs although both shared the same abutment form (P<.05). Also, the RMS value of the molar (16) was $47.6{\pm}2{\mu}m$ and $56.6{\pm}5{\mu}m$ for the single and bridge designs, respectively, thereby presenting a statistically significant difference (P<.05). Conclusion: As a result, dental prosthesis fabricated using the single method presented better internal adaptation outcomes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.4
• /
• pp.65-69
• /
• 2019

This paper presents an optimized adoption of NVM for the storage system considering application characteristics. To do so, we first characterize the storage access patterns for different application types, and make two prominent observations that can be exploited in allocating NVM storage efficiently. The first observation is that a bulk of I/O does not happen on a single storage partition, but it is varied significantly for different application categories. Our second observation is that there exists a large proportion of single accessing in storage data. Based on these observations, we show that maximizing the storage performance with NVM is not obtained by fixing it as a specific storage partition but by allocating it adaptively for different applications. Specifically, for graph, database, and web applications, using NVM as a swap, a journal, and a file system partitions, respectively, performs well.