• Journal of Convergence Society for SMB
• /
• v.6 no.4
• /
• pp.131-136
• /
• 2016

By providing Asp or Client/Server method, most library system service proposal has a problem that is hard to manage and high cost across the software like high cost of hardware and software license, installation and distribution, purchasing cost, upgrade, customization, problem management etc. As proposed in order to solve this problem, smart library system that supporting multi-tenant environment realized on-demand mode that is a simple and little initial investment costs and possible for low cost IT service.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.4
• /
• pp.981-987
• /
• 2017

Proliferation of cloud computing services brings about reduction of the maintenance and management costs by allowing data to be outsourced to a dedicated third-party remote storage. At the same time, the majority of storage service providers have adopted a data deduplication technique for efficient utilization of storage resources. When a hash tree is employed for duplicate identification as part of deduplication process, size information of the attested data and partial information about the tree can be deduced from eavesdropping. To mitigate such side channels, in this paper, a new duplicate identification method is presented by exploiting a multi-set hash function.

• KIISE Transactions on Computing Practices
• /
• v.24 no.1
• /
• pp.46-52
• /
• 2018

Software metrics as a way to evaluate software play a significant role in reducing software development costs and improving quality. However, the emergence of various software metrics creates the problem that the user must select the correct metric. Various strategies have been studied to solve this problem. However, existing studies still have difficulties in selecting metrics by requiring high user interventions. Therefore, in this paper, we propose a method that helps to select the right metric and the metric tools by using their various characteristics as selection criteria, instead of using weighted expressions to minimize user intervention.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.3
• /
• pp.551-561
• /
• 2018

As the computational technology using quantum computing has been developed, several threats on cryptographic systems are recently increasing. Therefore, many researches on post-quantum cryptosystems which can withstand the analysis attacks using quantum computers are actively underway. Nevertheless, the lattice-based NTRU system, one of the post-quantum cryptosystems, is pointed out that it may be vulnerable to the fault injection attack which uses the weakness of implementation of NTRU. In this paper, we investigate the fault injection attacks and their previous countermeasures on the NTRU signature system and propose a secure and efficient countermeasure to defeat it. As a simulation result, the proposed countermeasure has high fault detection ratio and low implementation costs.

• Journal of Digital Contents Society
• /
• v.2 no.2
• /
• pp.117-127
• /
• 2001

Since the number of e-malls is increased by the rapidly Progress of internet, most e-malls are trying to increase customers' interests by providing personalized services. To Provide this service for CRM, the e-mall must use the personalized rules calculated from customer transaction database. The more filtered transaction data are, the more the e-mall services efficiently and exactly to customer's need. The filtered transaction database is necessary to obtain the food personalized rules. In this paper we propose and develope a personalized e-mall with association rules based on view history of excellent customers who have good transaction data. Association rules based on view history of excellent customers reduce the access time and computing costs. The e-mall with them can provide personalized services more efficiently and exactly.

• Journal of Internet Computing and Services
• /
• v.9 no.3
• /
• pp.1-8
• /
• 2008

With growing interest in location-based service (LBS), there is increasing necessity for nearest neighbor (NN) search through query while the user is moving. NN search in such a dynamic environment has been performed through the repeated applicaton of the NN method to the search segment, but this increases search cost because of unnecessary redundant calculation. We propose slabbed continuous nearest neighbor (Slabbed_CNN) search, which is a new method that searches CNN in the search segment while moving, Slabbed_CNN reduces calculation costs and provides faster services than existing CNN by reducing the search area and calculation cost of the existing CNN method through reducing the search segment using slabs.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.1
• /
• pp.186-192
• /
• 2009

With the proliferation of ubiquitous computing we have witnessed the wide application of many wireless sensor networks into various areas because of easy installations and low-cost merits. The commercially available equipments for monitoring and predicting cracks in the mountain regions are still burden for us in terms of the installation complexity and the cost. Alternatively we in this paper design and implement a pilot slop-crack monitoring and prediction system which is based on low-cost commercial sensor networks. The proposed system is easy to install on cliffs, slopes, rocks, and banks and may minimize the destruction of the original geographical forms. Expected is that its installation and maintenance costs may reduce to the half of those of existing systems.

• Journal of Computing Science and Engineering
• /
• v.8 no.3
• /
• pp.157-172
• /
• 2014

Contemporary embedded systems often use NAND flash memory instead of hard disks as their swap space of virtual memory. Since the read/write characteristics of NAND flash memory are very different from those of hard disks, an efficient page replacement algorithm is needed for this environment. Our analysis shows that temporal locality is dominant in virtual memory references but that is not the case for write references, when the read and write references are monitored separately. Based on this observation, we present a new page replacement algorithm that uses different strategies for read and write operations in predicting the re-reference likelihood of pages. For read operations, only temporal locality is used; but for write operations, both write frequency and temporal locality are used. The algorithm logically partitions the memory space into read and write areas to keep track of their reference patterns precisely, and then dynamically adjusts their size based on their reference patterns and I/O costs. Without requiring any external parameter to tune, the proposed algorithm outperforms CLOCK, CAR, and CFLRU by 20%-66%. It also supports optimized implementations for virtual memory systems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.9
• /
• pp.850-863
• /
• 2008

Business Process is a set of interrelated business functions, which are defined by various business process rule and that will lead a company to accomplishing a specific organizational goal. Many business organizations are using process modeling methods for their business process management, but mostly these methods are accomplished by Human-Based activities. These human-based activities cause unexpected design anomalies in modeling phase. If process engine executed without design anomalies detection, that will be lead to huge loss on costs. To ensure that there is no design anomalies in modeling phase and to detect anomalies of predefined actions within modeling tools are important issues in business process management. In this paper, we provide specific types of design anomalies, which can effectively use to detect design anomalies in business process modeling phase.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.472-476
• /
• 2010

Nowadays, as the indices of the major search engines grow to a tremendous proportion, vertical search services can help customers to find what they need. Real time search is valuable because it lets you know what's happening right now on any given topic. In this paper, we designed a new architecture to implement a high performance real time search system. Based on the real time search's characters, we divided the whole system to two parts which are collection system and search system. The evaluation results showed that our design has the potential to provide the real time search transparent scalability while maintaining the replication overhead costs in check.