• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.6
• /
• pp.1375-1382
• /
• 2019

The latest version of commercial protector, Themida, has been updated, it is impossible to apply a normalized unpacking mechanism from previous studies by disable the use of a virtual memory allocation that provides initial data to be tracked. In addition, compared to the previous version, which had many values that determined during execution and easy to track dynamically, it is difficult to track dynamically due to values determined at the time of applying the protector. We will look at how the latest version of Themida make it difficult to normalize the API wrapping process by adopted techniques and examine the possibilities of applying the unpacking techniques to further develop an automated unpacking system.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.149-157
• /
• 2012

In this thesis, the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join state. One approximation scenario is to provide a maximum subset of the result, with the objective of losing as few result tuples as possible. An alternative scenario is to provide a random sample of the join result, e.g., if the output of the join is being aggregated. It is shown formally that neither approximation can be addressed effectively for a sliding-window join of arbitrary input streams. Previous work has addressed only the maximum-subset problem, and has implicitly used a frequency based model of stream arrival. There exists a sampling problem for this model. More importantly, it is shown that a broad class of applications for which an age-based model of stream arrival is more appropriate, and both approximation scenarios under this new model are addressed. Finally, for the case of multiple joins being executed with an overall memory constraint, an algorithm for memory allocation across the join that optimizes a combined measure of approximation in all scenarios considered is provided.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.191-198
• /
• 2009

The FAT (File Allocation Table) compatible file system has been widely used in mobile devices and memory cards because of its data exchangeability among numerous platforms recognizing the FAT file system. By the way. modern embedded systems have tough demands for instant power failure recovery and superior performance for multimedia applications. The key issue is how to achieve the goals of superior write performance and instant booting capability while controlling compatibility issues. To achieve the goals while controlling compatibility issues. we devised a temporary meta-data journaling scheme for a FAT compatible file system. Benchmark results of the scheme implemented in a FAT compatible file system shows that it really improves write performance of the FAT file system by converting small random write for meta-data update to a large sequential write in journaling area. Also, it provides natural way to implement the instant booting capability. Nevertheless, the file system compatibility is temporarily compromised by the scheme because it stores updated meta-data in the temporary journaling area rather than to their original locations. However, the compatibility can be fully recovered at any time by journal-flushing that copies meta-data in journaling area to their original locations. Generally, the journal-flushing is done before un-mounting a memory card so that it can be used in other mobile devices which recognized FAT file system but not the temporary meta-data journaling scheme.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.3
• /
• pp.155-164
• /
• 2016

For frequency pattern analysis of large databases, the new tree-based frequency pattern analysis algorithm which can compensate for the disadvantages of the Apriori method has been variously studied. In frequency pattern tree, the number of nodes is associated with memory allocation, but also affects memory resource consumption and processing speed of the growth. Therefore, reducing the number of nodes in the tree is very important in the frequency pattern mining. However, the absolute criteria which need to order the transaction items for construction frequency pattern tree has lowered the compression ratio of the tree nodes. But most of the frequency based tree construction methods adapted the absolute criteria. FP-tree is typically frequency pattern tree structure which is an extended prefix-tree structure for storing compressed frequent crucial information about frequent patterns. For construction the tree, all the frequent items in different transactions are sorted according to the absolute criteria, frequency descending order. CanTree also need to absolute criteria, canonical order, to construct the tree. In this paper, we proposed a novel frequency pattern tree construction method that does not use the absolute criteria, IRFP-tree algorithm. IRFP-tree(Intersection Rule based FP-tree). IRFP-tree is constituted with the new paradigm of the intersection rule without the use of the absolute criteria. It increased the compression ratio of the tree nodes, and reduced the tree construction time. Our method has the additional advantage that it provides incremental mining. The reported test result demonstrate the applicability and effectiveness of the proposed approach.

• Journal of the Korean Academy of Child and Adolescent Psychiatry
• /
• v.8 no.2
• /
• pp.217-231
• /
• 1997

This paper first reviewed the current neurological theories concerning the etiology of ADHD and secondly, examined results of studies that applied neuropsychological assessment methods in the examination of ADHD children both here in Korea and abroad. ADHD children were found to exhibit characteristic responses indicating deficits in vigilance, sustained attention, distractibility, allocation and regulation of attention in many assessments of attention, in addition to deficits in executive functioning, working and associative memory. Such neuropsychological assessment results suggest that in addition to dysfunction in the frontal lobe and the reticular activation system, dysfunction may exist in other neural pathways involving many areas of the brain. However, because a substantial number of neuropsychological assessment tools being employed in Korea for ADHD children had been developed abroad, a Korean standardization project involving ADHD and normal control children, in addition to other child psychiatric population pools must be conducted in order to obtain appropriate age norms and test validity, and in order to make possible a more accurate and precise comparison and interpretation in the assessment of ADHD children.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.7
• /
• pp.425-432
• /
• 2014

This paper proposes a wear-leveling algorithm that exploits the properties of SSD memories with multi-channel and multi-way architecture. When a write request arrives, the proposed algorithm classifies the stored data in DRAM buffer into hot or cold according to logical address access frequency, and performs data allocation to reduce deviation of block erase counts. It lowers the chance of increasing erase count by allocating cold data to blocks which have high erase count. Effectiveness of the proposed algorithm is verified by executing various applications on a multi-channel, multi-way SSD simulator. Experimental results show that differences in erase count among blocks is reduced by an average of 9.3%, and total erase count decreases by 4.6%, when compared to previous wear-leveling algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.4
• /
• pp.420-430
• /
• 2000

Several caching schemes for realtime multimedia systems have been proposed, but they focus only on increasing the hit ratio without providing any means to utilize the saved disk bandwidth due to cache hits. One of the most important metrics in multimedia systems is the number of clients that the systems can service simultaneously guaranteeing Quality of Service(QoS). Preemptive but Safe Interval Caching(PSIC) was proposed as a caching scheme which makes it possible to provide deterministic QoS.. However, it has no ability to adapt to the change of system environments since it has no mechanism to change the cache size. In this paper, we present a new caching scheme, Dynamic Interval Caching(DIC), which maximizes the performance, regardless of the change of system environments, providing hiccup-free service, by managing memory buffers dynamically. And it is demonstrated that DIC allocates buffer cache optimally, by comparing with PSIC through trace-driven simulations.

• Journal of the Korean Society for Marine Environment & Energy
• /
• v.14 no.2
• /
• pp.121-129
• /
• 2011

The EFDC model has been simplified to enhance the computing performance in hydrodynamic modeling. Water quality module and unnecessary conditional statements were deleted in subroutine list and memory allocation. The performance of the enhanced model (EFDC-E) was checked by applying EFDC and EFDC-E models to simulating the tidal flow in Mokpo coastal zone. Both two-dimensional models and threedimensional models have been applied and compared. Three-dimensional models showed better simulation results agreeing with observed currents than two-dimensional models. The simulation results of EFDC-E model gave good results agreeing with the simulation results of EFDC model and the observed data. The computing speed of EFDC-E model is improved 3 times faster than that of EFDC model in modeling hydrodynamic flow for real time of 3 days in both 2-dimensional modeling and 3-dimensional modeling. The EFDC-E model can be used widely for hydrodynamic modeling because of improved simulation speed.

• Journal of Biomedical Engineering Research
• /
• v.11 no.2
• /
• pp.305-314
• /
• 1990

In this paper we have implemented and tested TPN which is system to supply sufficent nutrition to nutritionally deficient patient by means of ES (expert system) a kind of A.1 (artificial intelligence) . This system affords to evaluation of nutritional state of patient which is essential to physi- cian. who performs TPN, decision of performing TPN and management of patient-data & calculation of information needing to making TPN fluid. The features were as follolv 1. we input data, take ideal weight of patient and 24hr's creatlnln In urine according to chart in system compare TSF (triceps skin fold), MAC (mid-arm circumference), AMC (arm muscle circumference) to 5th, 15th, 50th percentile and evaluate the nutritional state of patient. 2. Calculation of protein & nonprotein calorie needing to treament of patient can be made exactly by stress factor, activity factor and body temperature. 3. patient's personal recording needing to management of patient date name of chief doc- tor, name of department of admission, chart number, history can by taken very easily. 4. The way of system operating is pull-down Menu one, It can be processing very efficiently. 5. Date processing in system, we can manage memory volume of computer verlr efficiently using of dynamic allocation variables. 6. We can make it very easy to edit & revise the input data, processed data is saved to diskette in 2 files (TDF, THF) , these are semipermanent preservation.

• Journal of KIISE
• /
• v.42 no.2
• /
• pp.169-176
• /
• 2015

The atomic write technique is a good solution to solve the problem of the double write buffer. The atomic write technique needs modified I/O subsystems (i.e., file system and I/O schedulers) and a special SSD that guarantees the atomicity of the write request. In this paper, we propose the writing unit aligned block allocation technique (for EXT4 file system) and the merge prevention of requests technique for the CFQ scheduler. We also propose an atomic write-supporting SSD which stores the atomicity information in the spare area of the flash memory page. We evaluate the performance of the proposed atomic write scheme in MariaDB using the tpcc-mysql and SysBench benchmarks. The experimental results show that the proposed atomic write technique shows a performance improvement of 1.4~1.5 times compared to the double write buffer technique.