• Journal of Information Processing Systems
• /
• v.7 no.3
• /
• pp.435-446
• /
• 2011

Microprocessors are becoming increasingly vulnerable to soft errors due to the current trends of semiconductor technology scaling. Traditional redundant multi-threading architectures provide perfect fault tolerance by re-executing all the computations. However, such a full re-execution technique significantly increases the verification workload on the processor resources, resulting in severe performance degradation. This paper presents a pro-active verification management approach to mitigate the verification workload to increase its performance with a minimal effect on overall reliability. An anomaly-speculation-based filter checker is proposed to guide a verification priority before the re-execution process starts. This technique is accomplished by exploiting a value similarity property, which is defined by a frequent occurrence of partially identical values. Based on the biased distribution of similarity distance measure, this paper investigates further application to exploit similar values for soft error tolerance with anomaly speculation. Extensive measurements prove that the majority of instructions produce values, which are different from the previous result value, only in a few bits. Experimental results show that the proposed scheme accelerates the processor to be 180% faster than traditional fully-fault-tolerant processor with a minimal impact on overall soft error rate.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2341-2348
• /
• 2000

The special effects on the compressed :vII'EG domain become one of the interesting problems. In this paper, we developed minimal deCilder to effect in DCT compressed domain, proposed the video effects including wipe, dissolve, and zooming. To increase the expandability and portabilitv, the minimal decoder and the effects arc implemented to filters of COM based DirectShow.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1646-1655
• /
• 1999

This thesis presents a new VHDL intermediate format CDDG(Control Dominated Data Graph) and a minimal constrained scheduling algorithm for an optimal control dominated ASIC design. CDDG is a control flow graph which represents conditional branches and loops efficiently. Also it represents data dependency and such constraints as hardware resource and timing. In the proposed scheduling algorithm, the constraints using the inclusion and overlap relation among subgraphs. The effectiveness of the proposed algorithm has been proven by the experiment with the benchmark examples.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.2
• /
• pp.89-95
• /
• 2002

Global routing is to assign each net to routing regions to accomplish the required interconnections. The most popular algorithms for global routing inlcude maze routing algorithm, line-probe algorithm, shortest path based algorithm, and Steiner tree based algorithm. In this paper we propose weighted network heuristic(WNH) as a minimal Steiner tree search method in a routing graph and a genetic algorithm based on WNH for the global routing. We compare the genetic algorithm(GA) with simulated annealing(SA) by analyzing the results of each implementation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.611-614
• /
• 2001

본 논문에서는 7 개의 마그네틱 센서를 이용하여 가상 캐릭터의 자연스런 동작을 재현하는 애니메이션 알고리즘에 대해 기술한다. 이 방법의 특징은 인체 특징점의 위치와 방향정보를 Inverse Kinematics 이론에 적용하고, 이 특징점이 갖는 3 차원 벡터의 법선벡터를 이용하여 관절 방향을 표현하므로서 최소한의 센서로 전 인체의 동작을 재현할 수 있다는 점이다. 이 방법은 퍼스널 컴퓨터를 플랫폼으로 하는 단순한 모션 캡쳐 환경에서도 구현할 수 있으므로 애니메이션을 활용하는 각종 영상 응용 시스템 제작에 유용하게 쓰일 수 있다.

• Journal of Information Processing Systems
• /
• v.13 no.1
• /
• pp.104-113
• /
• 2017

In this paper, we present an approach to transmit data from the source to the destination through a minimal path (least-cost path) in a computer network of n nodes. The motivation behind our approach is to address the problem of finding a minimal path between the source and destination. From the work we have studied, we found that a Steiner tree with bounded Steiner vertices offers a good solution. A novel algorithm to construct a Steiner tree with vertices and bounded Steiner vertices is proposed in this paper. The algorithm finds a path from each source to each destination at a minimum cost and minimum number of Steiner vertices. We propose both the sequential and parallel versions. We also conducted a comparative study of sequential and parallel versions based on time complexity, which proved that parallel implementation is more efficient than sequential.

• Proceedings of the Korean Society of Postharvest Science and Technology of Agricultural Products Conference
• /
• 2001.06a
• /
• pp.113-113
• /
• 2001

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1463-1466
• /
• 1987

The problem of generating minimal area CMOS functional cell layout can be converted to that of decomposing the transistor connection graph into a minimum number of subgraphs, each having a pair of Euler paths with the same sequence of input labels on the N-graph and P-graph, which are portions of the graph corresponding to NMOS and PMOS parts respectively. This paper proposes a heuristic algorithm which yields a nearly minimal number of Euler paths from the path representation formula which represents the give a logic function. Subpath merging is done through a list processing scheme where the pair of paths which results in the lowest cost is successively merged from all candidate merge pairs until no further path merging and further reduction of number of subgraphs are possible. Two examples were shown where we were able to further reduce the number of interlaces, i.e., the number of non-butting diffusion islands, from 3 to 2, and from 2 to 1, compared to the earlier work [1].

• The Korean Journal of Food And Nutrition
• /
• v.31 no.5
• /
• pp.689-695
• /
• 2018

This study was carried out to select apple cultivars suited for the fresh cutting or minimal processing as investigating correlation between total phenol and ascorbic acid as browning factors and the enzymatic browning degree. In soluble solid-acid ratio, 'Gamhong' and 'Arisoo' were highest value of 71.69 and 71.52 compared with other cultivars. And the change of lightness (${\Delta}L$) and color (${\Delta}E$) in 'Gamhong' and 'Arisoo' showed lower than other cultivars while 'Arkansas black' was highest change of lightness and color as ${\Delta}L$ 8.27, ${\Delta}E$ 13.86 respectively. Total phenol and ascorbic acid contents in 'Arkansas black' were highest such as 334.3 mg GAE/100 g and 9.22 mg/100 g, respectively. And polyphenol oxidase (PPO) activity also was the highest such as 14.43unit in 'Arkansas black'. The correlation test showed browning of apple was significantly dependent on ${\Delta}L$, ${\Delta}E$, total phenol, ascorbic acid contents and PPO activity (p<0.01). On the contrary, no significant correlation had been determined between the browning and ascorbic acid oxidase (AAO) activity. Thus, it seemed that the browning of apple was not only due to oxidation of ascorbic acid but also total phenol. It was suggested that 'Gamhong' and 'Arisoo' were suitable for fresh cutting or minimal processing.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.411-425
• /
• 2000

Information retrieval systems for structured documents which are written in SGML or XML support partial retrieval of document. In order to efficiently process queries based on document structures, low memory overhead for indexing, quick response time for queries, supports to powerful types of user queries, and minimal updates of index structure for document updates are required. This paper suggests the Global Document Instance Tree(GDIT) and proposes an effective indexing scheme and query processing algorithms based on the GDIT. The indexing scheme keeps up indexing and retrieval effciency and also guarantees minimal updates of the index structure when document structures are updated.