• The Transactions of the Korea Information Processing Society
• /
• v.1 no.2
• /
• pp.272-278
• /
• 1994

The paper proposes a test pattern generator and a signature analyzer for pseudoexhaustive testing of the combinational circuit part within a sequential circuit when performing built-in self test of the circuit. The test pattern generator can scan in the seed test pattern and generate exhaustive test patterns. The signature analyzer can perform the analysis of the circuit response and scan out the result. Such test pattern generator and signature analyzer have been developed using SRL(shift register latch) and LFSR(linear feedback shift register).

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.77-78
• /
• 2009

In this paper, we study a pattern-aware write cache policy using a NAND flash memory in disk-based mobile storage systems. Our work is designed to face a mix of a number of sequential accesses and fewer non-sequential ones in mobile storage systems by redirecting the latter to a NAND flash memory and the former to a disk. Experimental results show that our policy improves the overall I/O performance by reducing the overhead significantly from a non-volatile cache over a traditional one.

• Journal of the Korean Society for Railway
• /
• v.5 no.4
• /
• pp.209-214
• /
• 2002

Belief revision involves integrating new information with the current belief. It is a ubiquitous human activity. A critical feature of belief revision lies in its sequential nature. Railroad system can be described as organic. Engine drivers take a great role in this system. Recently, Hogarth and Einhorn(1992) have posited a belief-adjustment model for updating beliefs. Based on a sequential anchoring and adjustment strategy, the model is important for decision makers. The sequential nature of information processing is affected by some task variables. The purpose of this study is to examin factors which influnce on the Enginr Driver's belief revision process. The factors are the order, experience and task. The difference of belief revision is due to the order and experience level.

• Proceedings of the KSR Conference
• /
• 1999.11a
• /
• pp.73-80
• /
• 1999

Belief revision involves integrating new information with the current belief. It is a ubiquitous human activity. A critical feature of belief revision lies in its sequential nature. Railroad system can be described as organic. Engine drivers take a great role in this system. Recently, Hogarth and Einhorn(1992) have Posited a belief-adjustment model for updating beliefs. Based on a sequential anchoring and adjustment strategy, the model is important fro decision makers. The sequential nature of information processing is affected by some task variables. This will be mainly explained in this paper. The purpose of this study is to examine the engine drivers' belief revision process and factors which influence on the belief revision process. The factors are the order and the experience. Thereby, this will contribute to the study of engine drivers' behavior. The result of this study is summarized as follows. The order effect due to the order of presentation of the evidence exist. The difference of belief revision is due to The experience level.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1130-1137
• /
• 1996

Every neural network has some kind of feedback. For the sake of analyzing fundamental aspects of information processing in neural nets, a net without feedbacks is an important theoretical model. But here we focus on a recurrent neural net which delay synapses as a realistic dynamical model of nervous systems. Synaptic connections are determined by a version of the Hebb rule (correlation type rule). We use a statistical neurodynamic method to explain the retrieval dynamics of the network. The result of the analysis for the sequential associativ e memory with delay synapses is compared with computer simulation. We have succeeded in explaining the dynamics of this network by theoretical analyses.

• The Journal of Information Technology and Database
• /
• v.6 no.1
• /
• pp.59-72
• /
• 1999

A study on workflow system as an automated business processing system is done recently. However, it did not consider various dependencies between parallel tasks. Therefore, this paper proposes modeling and verification of workflows with various parallel dependencies. For this, firstly, we propose four dependencies to specify various parallel dependencies between tasks. They contain sequential starts, parallel starts, sequential commits, and parallel commits. Secondly, we suggest a method to specify various parallel dependencies on workflow graph. Thirdly, we propose a verification method to detect contradictions on workflow specifications.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.125-128
• /
• 2001

본 논문은 파동분할(Wave partitioning) 방식을 이용한 순차적(Sequential) 메쉬 부호화 방식을 제안한다. 파동분할 방식은 호수에 물방울이 퍼져 나가는 자연 원리를 이용하여 초기 삼각형의 주위에 삼각형을 덧붙여 가면서 하나의 SPB(Small Processing Block)을 만들어내는 방식이다. 이 방식을 이용하여 하나의 모델을 서로 독립적인 SPB로 분할하고, 각각의 SPB 내에서 초기 삼각형을 중심으로 그것에 덧붙여진 삼각형에 의해 만들어진 원 또는 반원을 찾는다. 또한 그 원주를 따라 순차적으로 꼭지점을 구하면 각각의 꼭지점들은 일정한 패턴으로 늘어서게 되고, 이를 이용하여 연결성 정보 없이 부가 정보만 이용하여 모델을 순차적으로 무손실 부호화한다.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1507-1510
• /
• 2002

In this paper, we propose a sequential mesh cod- ing algorithm using the vertex pedigree based on the wave partitioning. After a mesh model is partitioned into several small processing blocks (SPB) using wave partitioning, we obtain vertices for each SPB along circumferences defined by outer edges of the attached triangles. Once all the vertices within each circumference are arranged into one line, we can encode mesh models

• The KIPS Transactions:PartA
• /
• v.19A no.1
• /
• pp.69-72
• /
• 2012

Logic programming based on classical or linear logic has traditionally lacked devices for expressing sequential tasks and sequential iterative tasks. Expressing sequential goal tasks has been addressed by a recent proposal of sequential goals of the form $G_1{\cap}G_2$ which is based on the game semantics of Japaridze. This paper proposes sequential iterative goal formulas of the form ${\cap}_x^LG$ where $G$ is a goal, $x$ is a variable, and $L$ is a list. ${\cap}_x^L$ is called a sequential bounded quantier. These goals allow us to specify the following task: sequentially iterate $G$ with $x$ ranging over all the elements of $L$.

• The KIPS Transactions:PartB
• /
• v.11B no.5
• /
• pp.603-610
• /
• 2004

The distributed Information Retrieval System centrally controlled by mediator or meta search engine result in congestion of heavy traffic and int he problem of increment of cost for the reason of the design of complicated algorithm for central control and installation of hardware. So to figure out this problem, the way is needed that has independent retrieval functionality and can cooperate each other without dependency. In this paper, we overview a few works involved in distributed information retrieval system, then, implement algorithm and design the frame-work of distributed information retrieval system using sequential transferring method(STM) including multiple information retrieval system separated from central control. For this first of all, we present a web partition policy which devide and manage web logically and we present the sequential query processing way by means of illustration through changing numbered information retrieval system. Then, we also present 3-layered structure of framework and function and module of each layer suitable for information retrieval system. Last of ail, for effective implementation of STM algorithm we analysis module structure and present description of pseudocode of this, and show that the proposed STM algorithm works smoothly by demonstration of sequential query transfer process between servers.