• KIISE Transactions on Computing Practices
• /
• v.22 no.1
• /
• pp.56-60
• /
• 2016

Peptide identification in tandem mass spectrometry is usually done by searching the spectra against target databases consisting of reference protein sequences. To control false discovery rates for high-confidence peptide identification, spectra are also searched against decoy databases constructed by permuting reference protein sequences. In this case, a peptide of the same sequence could be included in both the target and the decoy databases or multiple entries of a same peptide could exist in the decoy database. These phenomena make the protein identification problem complicated. Thus, it is important to minimize the number of such redundant peptides for accurate protein identification. In this regard, we examined two popular methods for decoy database generation: 'pseudo-shuffling' and 'pseudo-reversing'. We experimented with target databases of varying sizes and investigated the effect of the maximum number of missed cleavage sites allowed in a peptide (MC), which is one of the parameters for target and decoy database generation. In our experiments, the level of redundancy in decoy databases was proportional to the target database size and the value of MC, due to the increase in the number of short peptides (7 to 10 AA). Moreover, 'pseudo-reversing' always generated decoy databases with lower levels of redundancy compared to 'pseudo-shuffling'.

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

The Gamma Network contains the redundant path thereby is provides the ability to tolerate the faults occured. However, in case of identical the source and destination number, only a single path exists, therefore there is no way of connecting for the fault situation. In addition, for the dynamic packet routing strategy, it shoed perform backtracking analysis to find the redundant path. In this paper we proposed a new network, Dual Network, to resolve these drawbacks. The Dual Network uses switching elements about the same network size as the Gamma Network except first and last stage, and it is more efficient than the Gamma Network, for it has reduced the switching stage by one. And since is used a destination tag routing scheme for the control algorithm, it has on advantage of becoming of simpler and faster routing control.

• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1061-1072
• /
• 1999

한 개 이상의 사이트에 공간 데이타가 중복 저장된 분산 공간 DB에서, 동시에 수행될 수 있는 긴 트랜잭션의 변경은 일관성 제어를 위해 다른 사이트에 전파되어야 한다. 이때 같은 영역의 공간 데이타를 서로 다른 사이트에서 동시에 변경할 경우, 변경 상충 문제가 발생하거나 잠금 기법에 의한 오랜 대기 시간이 초래되는 문제가 있다. 또한 공간 객체는 잠금의 대상이 아닌 공간 관련성에 의한 종속성을 가진다.이 논문은 긴 트랜잭션으로 중복된 공간 데이타를 변경할 경우 중복 제어를 위한 변경 전파와 동시성 제어 문제를 다룬다. 중복된 공간 데이타의 변경 병렬성을 향상시키기 위해 영역 잠금 및 SR-bound WRITE 잠금 기법을 제시한다. 한 사이트에서 수정하는 객체들과 다른 사이트에서 수정하는 객체들 사이에 공간 관련성에 의한 종속성이 없을 경우 병렬 수정을 허용하도록 제어하며, 공간 관련성에 의한 종속성이 있을 경우 SR-based 2PC라 불리는, 확장된 2단계 완료 프로토콜로 협동작업을 수행해서 변경 상충을 해결하는 새로운 중복 제어 기법을 설계하고 구현한다.Abstract The update of a long transaction should be propagated to the other sites for consistency control, when spatial database are replicated at multiple sites to achieve availability, reliability, and performance. When the replicated spatial data are updated at the same time, the update of one site would be conflicted with the other or a user would not be able to access the replicated spatial data under the control of locking. Two spatial objects having spatial relationships should be cooperatively updated even if there are no conflicts of locking for them.This paper deals with the issues of concurrency control and update propagation of replicated spatial data. We present the concept of region lock and SR-bound WRITE lock for enhancing the parallelism of updating the replicated spatial data. If there are no spatial relationships between one site's objets and the other's objects, parallel update would be allowed. Concurrent update of two spatial objects having spatial relationships should be propagated and cooperated by using an extended two-phase commit protocol, called spatial relationship-based 2PC.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.7
• /
• pp.930-939
• /
• 2021

In recent years, the use of broadband bandwidth and redundant links for stable transmission in networks has resulted in excessive energy consumption and reduced transmission efficiency. In this paper, we propose an optimization algorithm that reduces the number of transmission links and minimizes transmission energy by removing redundant traffic in networks where traffic redundancy is allowed. The optimization algorithm proposed in this paper uses the meta-heuristic method using Tabu search algorithm. The proposed optimization algorithm minimizes transmission energy by designing a neighborhood generation method that efficiently routes overlapping traffic. The performance evaluation of the proposed optimization algorithm was performed in terms of the number of links used to transmit all traffic generated in the network and the transmission energy consumed. From the performance evaluation results, it was confirmed that the proposed algorithm is superior to other algorithms previously proposed.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.453-465
• /
• 1995

RPC(Remote Procedure Call) has been studied for programmer to easily write distributed program of little bit higher efficiency and reliability. In this study, fault-tolerant remote procedure call for hardware failures is proposed. Fault-tolerance is supplied by replicated procedures with node group, so called chain, and copies along chains are linearly ordered. Calls for procedure are sent to primary copy along chains, and other copies are propagated internally. If failures happen, first copy in faultless chain returns the result to the caller, Especially, in this study processing of redundant call message and result message, while using limited ack message, are avoided. This method supplies efficient and reliable fault-tolerance compared with existing remote procedure call.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1538-1545
• /
• 1998

System reliability has been a major concern since the beginning age of the electronic digital computers. One of the modest ways of increasing reliability is to design fault-tolerant system. This paper propose a construction mechanism of fault-tolerant system for the general graph topology. This system has several spare nodes. Up to date, fault-tolerant system design is applied only to loop and tree networks. But they are very limited cases. New algorithm of this paper tried to have a capability which can be applied to any kinds of topologies without such a many restriction. the algorithm consist of several steps : minimal diameter spaning tree extraction step, optimal node decision step, original connectivity restoration step and finally redundancy graph construction step.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.14 no.6
• /
• pp.34-42
• /
• 2006

As many systems depend on electronics, concern for fault tolerance is growing rapidly. For example, a car with its steering controlled by electronics and no mechanical linkage from steering wheel to front tires(steer-by-wire) should be fault tolerant because a failure can come without any warning and its effect is devastating. In order to make system fault tolerant, there has been a body of research mainly from aerospace field. This paper presents the structure of predictive smoothing voter that can filter out most erroneous values and noise. In addition, several numerical simulation results are given where the predictive smoothing voter outperforms well-known average and median voters.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.195-198
• /
• 2000

본 논문에서는 정보블록알고리즘(IBPA; Information Block Preprocessing Algorithm)을 이용한 정보블록 정렬알고리즘(IBSA; Information Block Sort Algorithm)을 제안하고 그 성능을 평가하였다. IBSA의 시간복잡도는 O(N)이며, 데이터의 분포상태에 영향을 받지 않는다. IBPA의 성능을 측정해본 결과, 2백만개의 랜덤데이터를 정렬한 경우, 중복 값 허용의 경우(a)는 퀵 정렬의 32.42%, 기수정렬의 9%정도의 비교회수만으로도 정렬할 수 있음을 보여주었으며, 중복 값이 없는 경우(b)는 퀵 정렬의 53.12%, 기수정렬의 12.79%정도의 비교회수만으로도 정렬할 수 있음을 보여주었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.949-952
• /
• 2000

공유 저장장치에 접근할 수 있는 경로를 다중화함으로써 클러스터 파일시스템 내 한 노드에서 발생하는 결함을 허용할 수 있다. 공유 저장장치의 다중접근은 파일 이동과 파일 중복으로 이루어진다. 본 논문에서는 전역 파일 시스템의 평균 응답 시간을 줄이기 위해 파일 자원의 접근률에 따라 우선 순위를 두어 파일이동과 과일 중복 시 발생할 수 있는 클러스터 파일 시스템의 성능 저하 및 서비스 중단을 막기 위한 방법을 제안한다. 파일 자원의 접근률은 파일 처리 시에 사용되는 블록, 아이노드(mode), 슈퍼블록과 같은 자원 사용 빈도를 통해 얻어질 수 있다.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.297-302
• /
• 1994

본 논문에서는 국어 분절음 특성에 맞는 음성 데이터베이스의 모형을 제시하고자 한다. 음성 데이터 베이스는 1) 각 음의 고유음가정보, 2) 인접음 정보, 3) 빈도수에 따른 확률정보를 포함해야 한다. 이 요건을 충족시키기 위해 본 모형은 1) 음운 단위별로 Labeling 하여, 고유음과 인접음 정보를 편집하고, 2) 음운 규칙과 제약정보에 의해 Phoneme Balanced Words를 작성하여, 허용되는 인접음을 취하고, 허용되지 않는 인접음을 탈락시키며 3) 시스템 평가시, 빈도수가 shb은 음과 음소열의 우선적인 인식 및 합성을 우월하게 평가한다는 고정서, 4) 데이터 집적시, 데이터의 음운기능의 중복과 편중을 피함으로서 데이터량을 간소화할 수 있다는 경제성을 들 수 있다.