• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1038-1045
• /
• 1994

In this paper, algorithm and built-in test circuit for testing all PSF(Pattern Sensitive Fault) occuring in CAM(Content Addressable Memory) are proposed. That is, built-in test circuit that uses minimum additional circuit without external equipment is designed. Additional circuit consist`s of parallel comparator, error detector, and modified decoder for parallel testing. Besides, the study on eulerian path for effectiv test pattern is carried out simultaneously. Consequently, using proposed algorithm, we can test all contents of CAM with 325+2b(b:number of bits) operations regardless of number of words. The area occupied by test circuit is about 7.5% of total circuit area.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.2
• /
• pp.8-18
• /
• 1999

It is very important to recover data immediately at a single disk failure for critical applications such as multimedia storage systems. real-time systems and so on. As an efficient solution, this paper proposes that RAID level conversion scheme to improve the performance before a failed disk is replaced with a new disk. By using this scheme, it does not require an additional disk to recover data. Comparing with previous studies, this scheme is appropriate to low cost system that has not additional redundant device. The performance of proposed scheme is evaluated and analyzed with that of RAID level 5 for various requested sizes through the simulation. The results show that the performance of the proposed scheme is improved up to 20 percents compared with that of RAID level 5 at the failure mode and 80 percents at reconfigured mode.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8A
• /
• pp.1227-1237
• /
• 1999

In this paper, we present an oblivious transfer protocol which is the protocol for the fair exchange of secrets. For this, we investigate the verifiable oblivious transfer protocol based on discrete logarithm broblem proposed by Lein Ham etc. And we propose a new obivious transfer protocol that has the additional functions on the existing method. This proposed method has the additional functions that enable to authenticate sender and to protect denial of what he/she has sent message to the other. To do this, we make use of bit commitment scheme and digital signature scheme based on RSA.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.4
• /
• pp.36-42
• /
• 2002

In this paper, we proposed a multiplicative algorithm for two polynomials with all non-zero coefficients over finite field GF($P^m$). Using the proposed multiplicative algorithm, we constructed the multiplier of modular architecture with parallel in-output. The proposed multiplier is composed of $(m+1)^2$ identical cells, each cell consists of one mod(p) additional gate and one mod(p) multiplicative gate. Proposed multiplier need one mod(p) multiplicative gate delay time and m mod(p) additional gate delay time not clock. Also, our architecture is regular and possesses the property of modularity, therefore well-suited for VLSI implementation.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.3
• /
• pp.85-92
• /
• 2018

We consider a project scheduling problem in which the jobs can be compressed by using additional resource to meet the corresponding due dates, referred to as a time-cost tradeoff problem. The project consists of two independent subprojects of which precedence graph is a chain. The due dates of jobs constituting the project can be interpreted as the multiple assessments in the life of project. The penalty cost occurs from the tardiness of the job, while it may be avoided through the compression of some jobs which requires an additional cost. The objective is to find the amount of compression that minimizes the total tardy penalty and compression costs. Firstly, we show that the problem can be decomposed into several subproblems whose number is bounded by the polynomial function in n, where n is the total number of jobs. Then, we prove that the problem can be solved in polynomial time by developing the efficient approach to obtain an optimal schedule for each subproblem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2050-2077
• /
• 2015

One of the major issues in emerging cloud management system needs the efficient service level agreement negotiation framework, with an optimal negotiation strategy. Most researchers focus mainly on the atomic service negotiation model, with the assistance of the Agent Controller in the broker part to reduce the total negotiation time, and communication overhead to some extent. This research focuses mainly on composite service negotiation, to further minimize both the total negotiation time and communication overhead through the pre-request optimization of broker strategy. The main objective of this research work is to introduce an Automated Dynamic Service Level Agreement Negotiation Framework (ADSLANF), which consists of an Intelligent Third-party Broker for composite service negotiation between the consumer and the service provider. A broker consists of an Intelligent Third-party Broker Agent, Agent Controller and Additional Agent Controller for managing and controlling its negotiation strategy. The Intelligent third-party broker agent manages the composite service by assigning its atomic services to multiple Agent Controllers. Using the Additional Agent Controllers, the Agent Controllers manage the concurrent negotiation with multiple service providers. In this process, the total negotiation time value is reduced partially. Further, the negotiation strategy is optimized in two stages, viz., Classified Similarity Matching (CSM) approach, and the Truncated Negotiation Group Gale Shapely Stable Matching (TNGGSSM) approach, to minimize the communication overhead.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.3
• /
• pp.77-87
• /
• 2006

Recently the mobile terminals using GPS offer find-way service. But for obtaining the simple small-map, this system is very additional expensive. Accordingly it is impossible to provide this service using the general mobile terminals which almost all of the people have. Therefore, in this paper we design and develop the mobile outline map and guide map to solve the problems of the existed find-way service in the mobile environments. This system supports the mobile guide service of the destination without the additional cost on mobile terminal based on WIPI at any time and any where. And mobile service providers are able to advertise for neighborhood stores of the searching destination using this system.

• Journal of the Korean Society of Safety
• /
• v.24 no.3
• /
• pp.65-70
• /
• 2009

In-vehicle route guidance information(RGI) systems have been developed with the advancement of the information and communication technologies. However, the RGI is provided by a pre-determined option, drivers occasionally pass the target intersection owing to non- or late- recognizing it. The purpose of this experiment is to examine the position of driver's tum signal operation and intersection recognition approaching at the target intersection which is difficult to identify as a preliminary research on developing the additional RGI connecting with the tum signal control. The field experiment was conducted to measure distances of the turn signal operation and intersection recognition from the target intersection according to driving lanes and landmarks at adjacent intersection. And, glance behavior to the car navigation display was evaluated by using an eye camera. The results indicate that drivers operate the turn signal after confirming a landmark in the case of the intersection with it. However, most case of driving, drivers operate the tum signal at 40 to 50m before coming to the target. To provide the additional RGI, when drivers do not operate the tum signal approaching at the target intersection based on the results, is expected to improve the traffic safety and the comfort for drivers.

• Journal of Power Electronics
• /
• v.9 no.2
• /
• pp.224-231
• /
• 2009

The induction motor rotor fault diagnosis system using current signals, which are measured using an axis-transformation method, is presented in this paper. In inverter-fed motor drives, unlike line-driven motor drives, the stator currents are rich in harmonics; therefore fault diagnosis using stator current is not trivial. The current signals for rotor fault diagnosis need precise and high resolution information, which means the diagnosis system demands additional hardware such as a low pass filter, high resolution ADC, and encoder, etc. The proposed axis-transformation method with encoder and without encoder is expected to contribute to a low cost fault diagnosis system in inverter-fed motor drives without the need for any additional hardware. In order to confirm the validity of the developed algorithms, various experiments for rotor faults are tested and the line current spectrum of each faulty situation using Park transformation is compared with the results obtained from fast Fourier transforms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.826-829
• /
• 2007

In this paper, we proposed two systems, STTC scheme and STBC based on STTC scheme, to enhance the reliability of HDR-WPAN system and analyzed BER(bit error rate) performance of the proposed systems over the slow fading channel. The proposed systems obtained a diversity gain and coding gain without increasing an additional channel bandwidth. However, in terms of reliability, about 4dB improvement at $BER=10^{-3}$ was obtained by the STBC based on STTC scheme because of the additional diversity gain of STBC. From these results, STBC based on STTC scheme was more appropriate to improve the reliability and channel efficiency of HDR-WPAN system.