• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.311-323
• /
• 1997

This paper presents a fast fault simulation system for detecting stuck-at faults in mixed-level combinational logic circuits with gale level and switch -level primitives. For a practical fault simulator, the types are not restricted to static switch-level and/or gate-level circuits, but include dynamic switch-level circuits. To efficiently handle the multiple signal contention problems at wired logic elements, we propose a six-valued logic system and its logic calculus which are used together with signal strength information. As a basic algorithm for the fault simulation process, a well -known gate-level parallel pattern single fault propagation(PPSFP) technique is extended to switch-level circuits in order to handle pass-transistor circuits and precharged logic circuits as well as static CMOS circuits. Finally, we demonstrate the efficiency of our system through the experimental results for switch-level ISCAS85 benchmark combinational circuits and various industrial mixed-level circuits.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.6
• /
• pp.1077-1082
• /
• 2019

The development of computing technology and networking has developed into a fundamental technology of the Fourth Industrial Revolution, which provides a ubiquitous environment. In the ubiquitous environment, the IoT environment has become an issue so that various devices and the things can be actively accessed and connected. Also, the RFID system using the wireless identification code attaches an RFID tag to the object, such as the production and distribution of products. It is applied to the management very efficiently. EPCglobal is conducting a research on RFID system standardization and various security studies. Since RFID systems use wireless environment technology, there are more security threats than wire problems. In particular, failure to provide confidentiality, indistinguishability, and forward safety could expose them to various threats in the Fourth Industrial Revolution. Therefore, this study analyzes the standard method of EPCgolbal and proposes RFID security method using hash code that can consider the amount of computation.

• Journal of KIISE:Software and Applications
• /
• v.37 no.10
• /
• pp.736-744
• /
• 2010

Log data collected from mobile devices contain diverse and meaningful personal information. However, it is not easy to implement a context-aware mobile agent using this personal information due to the inherent limitation in mobile platform such as memory capacity, computation power and its difficulty of analysis of the data. We propose a method of selective inference for modular Bayesian Network for context-aware mobile agent with effectiveness and reliability. Each BN module performs inference only when it can change the result by comparing to the history module which contains evidences and posterior probability, and gets results effectively using a method of influence score of the modules. We adopt memory decay theory and virtual linking method for the evaluation of the reliability and conservation of casual relationship between BN modules, respectively. Finally, we confirm the usefulness of the proposed method by several experiments on mobile phones.

• Journal of KIISE
• /
• v.44 no.4
• /
• pp.399-410
• /
• 2017

We present a system that automatically annotates unverified Web sentences with information from credible sources. The system turns to neural theorem proving for an annotating task for cancer related Wikipedia data (1,486 propositions) with Korean National Cancer Center data (19,304 propositions). By switching the recursive module in a neural theorem prover to a word embedding module, we overcome the fundamental problem of tremendous learning time. Within the identical environment, the original neural theorem prover was estimated to spend 233.9 days of learning time. In contrast, the revised neural theorem prover took only 102.1 minutes of learning time. We demonstrated that a neural theorem prover, which encodes a proposition in a tensor, includes a classic theorem prover for exact match and enables end-to-end differentiable logic for analogous words.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1428-1434
• /
• 2006

In this paper, we propose the scheme solving privacy infringement in RFID systems with improving the scalability of back-end server. With RFID/USN becoming important subject, many approaches have been proposed and applied. However, limits of RFID, low computation power and storage, make the protection of privacy difficult. The Hash Chain scheme has been known as one guaranteeing forward security, confidentiality and indistinguishability. In spite of that, it is a problem that requires much of computation to identify tags in Back-End server. In this paper, we introduce an efficient key search method, the Hellman Method, to reduce computing complexity in Back-End server. Hellman Method algorism progresses pre-computation and (re)search. In this paper, after applying Hellman Method to Hash chain theory, We compared Preservation and key reference to analyze and apply to parallel With guaranteeing requistes of security for existing privacy protecting Comparing key reference reduced computation time of server to reduce computation complex from O(m) to $O(\frac{m{^2/3}}{w})$ than the existing form.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.7 no.3
• /
• pp.253-261
• /
• 2002

This paper presents an implementation of position control system of Switched Reluctance Motor (SRM) using digital hysteresis controller by TMS320F740 DSP. Although SRM possess several advantages including simple structure and high efficiency, but the control thrive system using power semiconductor device is required to drive this motor. The control drive system increases overall system cost. To overcome this problem and increase the application of SRM, it is needed to develope the servo dave system of SRM. So, the position control system of 1 Hp SRM is developed and evacuated by adaptive switching angle control. The position/speed response characteristics and voltage/current waveforms are presented to prove the capability of SRM for a servo drive application. Moreover, digital hysteresis current controller is developed and evaluated by experimental testing for the purpose of system developmental cost reduction.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1039-1044
• /
• 2013

We propose a cancellation algorithm based on Alamouti coded OFDM to mitigate ICI due to Frequency Offset (FO) between distributed antennas in the frequency selective fading channel. In the cancellation algorithm, the interference signal is estimated by using the initial detection symbol and then the estimated interference signal is subtracted from the received signal. As the accuracy of initial symbol increases, ICI cancellation becomes more significant. Therefore, the accuracy of the initial detection symbols is very important in the cancellation algorithm. The proposed scheme improves the accuracy of the initial detection symbol by employing an ICI self-cancellation scheme. The proposed cancellation scheme with only one iteration achieves better performance compared to the conventional cancellation schemes with many times iterations based on the conventional Alamouti coded OFDM.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2050-2059
• /
• 2000

In a video-on-Demand(VOD) service, a server has to return to he normal playback quickly at a certain new frame position after interactive operations such as jump or last playback. In this paper, we propose an efficient scheme to write a transmission schedule for a playback restart of a video stream at a new frame position after interactive operations. The proposed scheme is based on convergence characteristics, that is transmission schedules with different playback startup frame position in a video stream meet each other at some frame position. The scheme applies a bandwidth smoothing from a new frame position to a convergence position without considering all remaining frames of a video stream. And then the scheme transmits video dta according to the new schedule from the new frame position to the convergence position, and then transmits the remaining video data according to the reference schedule from the convergence position, and then transmits the remaining video data according to the reference schedule from the convergence position to the last frame position. In this paper, we showed that there existed the convergence position corresponding to nay frame position in a video stream through many experiments based on MPEG-1 bit trace data. With the convergence we reduced the computational overhead of a bandwidth smoothing, which was applied to find a new transmission schedule after interactive operations. Also, storage overhead is greatly reduced by storing pre-calculated schedule information up to the convergence position for each I frame position of a video stream with video data off-line. By saving information on a transmission schedule off-line along with the video data and searching the schedule corresponding to the specified restarting frame position, we expect the possibility of normal playback of a video stream with small tolerable playback startup delay.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.661-670
• /
• 2003

Materialized views which are stored views of the database offer opportunities for significant performance gain in query valuation by providing fast access to pre-computed data. The question of when and how to use a materialized view in processing a given query is a difficult one attracting a significant amount of research. Whether a materialized view can be used in answering a query depends on the relationship between the view and the query. Proposed in this paper are new ways of utilizing materialized views in answering a query. Semantic relationships are used in addition to syntactic ones. We also utilize a materialized view in answering a query even if it has relations unrelated to the query. We first show the conditions for testing whether a materialized view can be utilized in answering a query and then present the algorithms for testing the conditions and reformulating a query with a materialized view.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.577-590
• /
• 2003

The shape-based retrieval is defined as the operation that searches for the (sub) sequences whose shapes are similar to that of a query sequence regardless of their actual element values. In this paper, we propose a similarity model suitable for shape-based retrieval and present an indexing method for supporting the similarity model. The proposed similarity model enables to retrieve similar shapes accurately by providing the combination of various shape-preserving transformations such as normalization, moving average, and time warping. Our indexing method stores every distinct subsequence concisely into the disk-based suffix tree for efficient and adaptive query processing. We allow the user to dynamically choose a similarity model suitable for a given application. More specifically, we allow the user to determine the parameter p of the distance function $L_p$ when submitting a query. The result of extensive experiments revealed that our approach not only successfully finds the subsequences whose shapes are similar to a query shape but also significantly outperforms the sequence search.