• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.4
• /
• pp.71-79
• /
• 2000

The original March algorithms cannot detect CMOS ADOFs(Address Decoder Open Faults) which requires separate deterministic test patterns. Modified March algorithm using DOF(Degree of Freedom) was suggested to detect these faults in addition to conventional stuck faults. This paper augments the modified march test to further capture NPSFs(Neighborhood Pattern Sensitive Faults). Complete CA(Cellular Automata) is used for address generation and Rl-LFSRs(Randomly Inversed LFSRs) for data generation. A new modified March algorithm can detect SAF, CF, TF, CMOS ADOFs, and part of NPSFs. Time complexity of this algorithm is still O(n).

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.369-370
• /
• 2008

The DMB standards allow to transmit IP data on IP Tunneling. It is able to DMB data localcasting services using technologies as assigning IP address, encapsulating IP packets, guiding IP data service and, exchanging IP packet at the local area. As the result of that, we can have good experiences as rich and localized multimedia on the DMB networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2230-2239
• /
• 1998

Recently, mobility support of connectionless mobile ATM data service has been mainly studied in wireless ATM communication network. this paper shows the network model for the mobility support of connectionless data service in ATM network, and proposes the methods to minimize COIP (care of IP address) acquisition processing time for MH(mobile host)migration. Th echaracteristics of proposed methods, COIP acquisition probability and IP data communication sequence of proposed model, are discussed in this paper.

• Journal of the Korea Convergence Society
• /
• v.11 no.10
• /
• pp.97-106
• /
• 2020

The factory information provided by the Industrial Location Information System (ILIS) is provided as raw data by the Korea Industrial Complex Corporation and registered after a filtering process, so the new factory information update is slow. In this study, to solve the problem of updating factory information of industrial location information system, using building data of road name address with relatively fast renewal cycle and building data of real estate, we compared the factory information of existing ILIS and extracted new factory information. In the process of comparison, a method was proposed to compare spatial objects of different types with point data and polygon data. Attribute information matching and object matching were performed, and attribute values of new factory information were extracted. The accuracy evaluation of the proposed spatial analysis method showed 79% accuracy, and the above matching technique was used to confirm the possibility of convergence of road name address data, real estate data and factory information of ILIS.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.7
• /
• pp.71-79
• /
• 2012

As advances in computer technology, dissemination of smartphones and tablet PCs has increased and digital media has become easily accessible. The performance of computer hardware is improved and the form of hardware is changed, but basically the change in mechanism was not occurred. Typically, the data used in the program is resident in memory during the operation because of the operating system efficiency. So, these data in memory is accessible through the memory dumps or real-time memory analysis. The user's personal information or confidential data may be leaked by exploiting data; thus, the countermeasures should be provided. In this paper, we proposed the method that minimizes user's data leakage through finding the physical memory address of the process using virtual memory address, and initializing memory data of the process.

• Journal of the Korean Society of Safety
• /
• v.28 no.1
• /
• pp.158-163
• /
• 2013

While job stress evaluations are reported in the recent surveys upon the nuclear power plants(NPPs), any significant advance in the types of questionnaires is not currently found. There are limitations to their usefulness as analytic tools for the management of safety resources in NPPs. Data mining(DM) has emerged as one of the key features for data computing and analysis to conduct a survey analysis. There are still limitations to its capability such as dimensionality associated with many survey questions and quality of information. Even though some survey methods may have significant advantages, often these methods do not provide enough evidence of causal relationships and the statistical inferences among a large number of input factors and responses. In order to address these limitations on the data computing and analysis capabilities, we propose an advanced procedure of survey analysis incorporating the DM method into a statistical analysis. The DM method can reduce dimensionality of risk factors, but DM method may not discuss the robustness of solutions, either by considering data preprocesses for outliers and missing values, or by considering uncontrollable noise factors. We propose three steps to address these limitations. The first step shows data mining with response surface method(RSM), to deal with specific situations by creating a new method called response surface data mining(RSDM). The second step follows the RSDM with detailed statistical relationships between the risk factors and the response of interest, and shows the demonstration the proposed RSDM can effectively find significant physical, psycho-social, and environmental risk factors by reducing the dimensionality with the process providing detailed statistical inferences. The final step suggest a robust stress management system which effectively manage job stress of the workers in NPPs as a part of a safety resource management using the surrogate variable concept.

• Journal of the Korea Convergence Society
• /
• v.8 no.2
• /
• pp.15-20
• /
• 2017

In this paper, Esp8266, Node.js, and TCP / IP socket communication are used to design a compact data integration device. This device is designed to configure server and client using Esp8266 module that supports Wifi connection and to support bidirectional data transmission using TCP / IP socket communication. The server is configured using the Node.js operating system, and the database is integrated using Mysql. The network is designed to have a separate IP address by assigning a private IP address to the router, such as a home network. This device can transmit data bidirectionally, store individual client data on the server side, and can check the flow of data transmitted bidirectionally through wire-shark, so that it can be used as a compact real-time data integration and convergence device.

• The Journal of the Korea Contents Association
• /
• v.18 no.8
• /
• pp.102-108
• /
• 2018

The existing data transmission technology applied between the non-secure external internet and the secure internal business network has various problems when applied to the building facility management SCADA system control network. Traditional inter-network data transfer technologies involve high complexity and high costs because blacklist-based security techniques are applied to all data. However, whitelist-based security techniques can be applied to data distributed in Building Facility Management SCADA control systems because a small number of structured control data are repeatable and periodic. This simplifies the security technology applied to inter-network data transmission, enabling building facility management SCADA system control network deployment at low cost. In this paper, we proposed building control networks specialized in building facility management SCADA control systems by providing solutions to address and address these problems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2B
• /
• pp.129-137
• /
• 2003

Multimedia streams, like MPEG continuously retrieve multimedia data because of their incessant playback. While these streams need an efficient support of kernel, the current buffer cache mechanism of Linux kernel such as Unix operating system was designed apt for small files, which is aperiodically requested as well as time uncritical. But, in case of continuous media, the CPU must enormously copy memory from kernel address space to user address space. This must lead to a large CPU overhead. This overhead both degrades system throughput and cannot guarantee QOS. In this paper, we have designed and implemented two memory copy reduction schemes in Linux kernel, direct I/O and one copy. The direct I/O skips the buffer cache layer of Linux kernel and results in dramatic reduction of CPU memory copy overhead. And, the one copy provides a fast disk-to-network data path without copying to user address space. The experimental results show considerable reduction of CPU overhead and throughput improvements.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.665-674
• /
• 2000

In data parallel programs incurring high cache locality, the choice of grain sizes affects cache performance. Though the grain sizes chosen provide fair load balance among processors, the grain sizes that ignore underlying caching effect result in address interferences between grains allocated to a processor. These address interferences appear to have a negative impact on the cache locality, since they result in cache conflict misses. To address this problem, we propose a best grain size driven from a cache size and the number of processors based on direct mapped cache's characteristic. Since the proposed method does not map the grains to the same location in the cache, cache conflict misses are reduced. Simulation results show that the proposed best grain size substantially improves the performance of tested data parallel programs through the reduction of cache misses on direct-mapped caches.