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

Recently, NAND flash memories are used for storage devices because of fast access speed and low-power. However, applications of FTL on low power computing devices lead to heavy workloads which result in a memory requirement and an implementation overhead. Consequently, studies of B+-Tree on embedded devices without the FTL have been proposed. The studies of B+-Tree are optimized for performance of inserting and updating records, considering to disadvantages of the NAND flash memory that it can not support in-place update. However, if a general garbage collection method is applied to the previous studies of B+-Tree, a performance of the B+-Tree is reduced, because it generates a rearrangement of the B+-Tree by changing of page positions on the NAND flash memory. Therefor, we propose a novel garbage collection method which can apply to the B+-Tree based on the NAND flash memory without the FTL. The proposed garbage collection method does not generate a rearrangement of the B+-Tree by using a block information table and a proxy block. We implemented the B+-Tree and ${\mu}$-Tree with the proposed garbage collection on physical devices with the NAND flash memory. In experiment results, the proposed garbage collection scheme compared to greedy algorithm garbage collection scheme increased the number of inserted keys by up to about 73% on B+-Tree and decreased elapsed time of garbage collection by up to about 39% on ${\mu}$-Tree.

• Journal of Korean Society for Geospatial Information Science
• /
• v.1 no.1 s.1
• /
• pp.193-201
• /
• 1993

In a number of areas, there are important benefits to be gained when we bring both the detection and monitoring abilities of remote sensing as well as the philosophical approach and analytic capabilities of a geographic information system to bear on a problem. A key area in the joint applications of remote sensing technology and GIS is to identify change. Whether this change is of interest for its own sake, or because the change causes us to act (for example, to update a map), remote sensing provides an excellent suite of tools for detecting change. At the same time, a GIS is perhaps the best analytic toot for quantifying the process of change. There are two alternative methods for quantifying changes. The conceptually simple approach is to un the pixel values in each of the images. This method is practical but may be too simple to identify the variety of changes in a complex scene. The common alternative is called symbolic change detection. The analyst first decides on a set of thematic categories that are important to distinguish for the application. This approach is useful only if accurate landuse/cover classifications can be obtained. Persons conducting digital change detection must be intimately familiar with the environment under study, the quality of the data set and the characteristics of change detection algorithms. Also, much work remains to identify optimum change detection algorithms for specific geographic areas and problems.

• The KIPS Transactions:PartD
• /
• v.17D no.2
• /
• pp.157-166
• /
• 2010

More recently, RFID (Radio Frequency Identification) systems have begun to find greater use in various industrial fields. The use of RFID system in these application domains has been promoted by efforts to develop the RFID tags which are low in cost, small in size, and high in performance. The RFID applications enable the real-time capture and update of RFID tag information, while simultaneously allowing business process change through real-time alerting and alarms. These be developed to monitor person or objects with RFID tags in a place and to provide visibility and traceability of the seamless flows of RFID tags. In this time, the RFID readers should be placed in diverse locations, the RFID flows between these readers can be tested based on various scenarios. However, due to the high cost of RFID readers, it may be difficult to prepare the similar environment equipped with RFID read/write devices. In this paper, we propose a simulator to allow RFID application testing without installing physical devices. It can model the RFID deployment environment, place various RFID readers and sensors on this model, and move the RFID tags through the business processes. This simulator can improve the software development productivity by accurately testing RFID middleware and applications. In addition, when data security cannot be ensured by any fault, it can decide where the problem is occurred between RFID hardware and middleware.

• 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.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.4
• /
• pp.819-826
• /
• 2018

The generalized Hamming weight is one of the important parameters of the linear code. It determines the performance of the code when the linear codes are applied to a cryptographic system. In addition, when the block code is decoded by soft decision using the lattice diagram, it becomes a measure for evaluating the state complexity required for the implementation. In particular, a bit-parallel multiplier on finite fields based on trinomials have been studied. Cellular automata(CA) has superior randomness over LFSR due to its ability to update its state simultaneously by local interaction. In this paper, we deal with the efficient synthesis of the pseudo random number generator, which is one of the important factors in the design of effective cryptosystem. We analyze the property of the characteristic polynomial of the simple 90/150 transition rule block, and propose a synthesis algorithm of the reversible 90/150 CA corresponding to the trinomials $x^2^n+x^{2^n-1}+1$($n{\geq}2$) and the 90/150 reversible CA(RCA) corresponding to the maximum weight polynomial with $2^n$ degree by using this rule block.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.301-315
• /
• 2010

Recently, competition between companies has intensified and so has the necessity of creating a new business value inventions has increased. A numbers of Business organizations are beginning to realize the importance of business process management. Processes however can often not go the way they were initially designed or non-efficient performance process model could be designed. This can be due to a lack of cooperation and understanding between business analysts and system developers. To solve this problem, business process mining which can be used as the basis of the business process re-engineering has been recognized to an important concept. Current process mining research has only focused their attention on extracting workflow-based process model from competed process logs. Thus there have a limitations in expressing various forms of business processes. The disadvantage in this method is process discovering time and log scanning time in itself take a considerable amount of time. This is due to the re-scanning of the process logs with each new update. In this paper, we will presents a modified FP-Tree algorithm for FP-Tree based business processes, which are used for association analysis in data mining. Our modified algorithm supports the discovery of the appropriate level of process model according to the user's need without re-scanning the entire process logs during updated.

• Journal of Intelligence and Information Systems
• /
• v.14 no.1
• /
• pp.117-129
• /
• 2008

The cost-based scheduling work has been done in both the Operations Research (OR) and Artificial Intelligence (AI) literature. To deal with more realistic problems, AI-based heuristic scheduling approach with non-regular performance measures has been studied. However, there has been little research effort to develop a full inter-job cost propagation algorithm (CPA) for different jobs having multiple downstream and upstream activities. Without such a CPA, decision-making in scheduling heuristics relies upon local, incomplete cost information, resulting in poor schedule performance from the overall cost minimizing objective. For such a purpose, we need two types of CPAs : intra-job CPA and inter-job CPA. Whenever there is a change in cost information of an activity in a job in the process of scheduling, the intra-job CPA updates cost curves of other activities connected through temporal constraints within the same job. The inter-job CPA extends cost propagation into other jobs connected through precedence relationships. By utilizing the cost information provided by CPAs, we propose cost-based scheduling heuristics that attempt to minimize the total schedule cost. This paper develops inter-job CPAs that create and update cost curves of each activity in each search state, and propagate cost information throughout a whole network of temporal constraints. Also we propose various cost-based scheduling heuristics that attempt to minimize the total schedule cost by utilizing the cost propagation algorithm.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.4
• /
• pp.355-363
• /
• 2007

The purpose of this study is to maximize the use of framework data by a method for updating road framework data using a economical, rapid, and accurate Vehicle-based kinematic survey to get the latest road data among "transportation framework data" which was built in 2003. We collected data using a Vehicle-based kinematic survey with DGPS (Differential Global Positioning System) in Daejeon and Pyeongtaek city and verified the accuracy of line and point features between surveying and previous results. The result showed that Daejeon city which is located near GPS CORS (Continuously Operating Reference Station)s and receive a signal well had lower errors than 1/5,000 digital base map, and Pyeongtaek city which is located far from the stations and receive a signal badly had errors beyond the limits. The study showed that postprocessing method or Total Station surveying should be used where signals cannot be detected well after analyzing a receiving rate from GPS CORSs, the stations of other organizations should be shared, and further studies are needed.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.1-10
• /
• 2010

Recently heterogeneous storage system such as hybrid hard disk drive (H-HDD) combining flash memory and magnetic disk is launched, according as the read performance of NAND flash memory is enhanced as similar to that of hard disk drive (HDD) and the power consumption of NAND flash memory is reduced less than that of HDD. However, the read and write operations of NAND flash memory are slower than those of rotational disk. Besides, serious overheads are incurred on CPU and main memory in the case that intensive write requests to flash memory are repeatedly occurred. In this paper, we propose the Least Frequently Used-Hot scheme that replaces the data blocks whose reference frequency of read operation is low and update frequency of write operation is high, and the data flushing scheme that rearranges the data blocks into the multi-zone of the rotation disk. Experimental results show that the execution time of the proposed method is 38% faster than those of conventional LRU and LFU block replacement schemes in I/O performance aspect and the proposed method increases the life span of Non-Volatile Cache 40% higher than those of conventional LRU, LFU, FIFO block replacement schemes.

• Journal of dental hygiene science
• /
• v.15 no.2
• /
• pp.182-189
• /
• 2015

The purpose of this study was to investigate the relationship between degree of satisfaction and experience on performance in accordance with the characteristics for the dental hygiene students. Dental hygiene students to 480 people from November to December 2014 and analyzed by conducting a survey. The higher grade students were more satisfied with the degree of satisfaction on experience for clinical test performance and clinical practice organization rather than the lower grade students. Also, the degree of satisfaction on major for the higher grade students has been shown as relatively higher than the lower grade students. The factors that affecting the experience for clinical performance and the degree of satisfaction for clinical practice were shown as grade, satisfaction for major and period for practice. In order to enhance the degree of satisfaction on the clinical performance for students, it should be established the system for practice management considering the characteristics of clinical practice by relevant organizations. Also, the dental hygienist who is responsible for dental education should manage his/her practice for students actively. Meanwhile, the practice organization should improve and update the content of education through the consistent alliance with colleges continuously.