• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1990년도 추계학술대회
• /
• pp.15-18
• /
• 1990

In abdominal NMR imaging the respiratory ordering techniques have been successfully used to remove the ghosting artifacts arising from the respiratory motion. In the existing respiratory ordering schemes, however, it is generally accepted that blurring of the moving parts still remains as in the signal averaging technique. A new optimal respiratory ordering scheme which can correct the blurring as well as the ghosting artifacts is theoretically derived through the analysis of the phase encoding directional motion effects in Fourier imaging. The performance of the optimal respiratory ordering scheme is experimentally confirmed together with a suboptimal ordering scheme which is suggested as a compromise for the practicality.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.6-8
• /
• 2006

Using enhanced ordering scheme of graylevel in an image, we can apply it to lossless image compression in this paper. The proposed method is ordering scheme to replace an original grayscale image with a particular ordered image without additional information. From the simulation, it is verified that the proposed method reduces the bit rates than plain ordering scheme. And it can be applied in various fields of lossless compression, water marking and edge detection.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 통신소사이어티 추계학술대회논문집
• /
• pp.302-305
• /
• 2003

3GPP RLC protocol specification adopted an error control scheme based on selective repeat ARQ. In the 3GPP ARQ, distinctive windows are provided at transmitting and receiving stations so that those stations are prohibited to send or receive data PDU's out of window. An increase in window size enhances delay performance. Such an increase, however, raises the occupancy at re-ordering buffer, which results in a long re-ordering time. Aiming at suppressing the occupancy at re-ordering buffer, we propose partial go back N scheme in this paper In the partial go back N scheme, the receiving station regards all data PDU's between the first (lowest sequence numbered) error-detected PDU and last (highest sequence numbered) error-detected PDU. By the employment of the partial go back N scheme, the occupancy at the re-ordering buffer is apparently reduced, while the delay and throughput performance may be degraded due to the remaining properties of go back N. We thus consider peak occupancy of re-ordering buffer, mean sojourn time at re-ordering buffer, mean delay time, and maximum throughput as measures to evaluate tile proposed scheme and investigate such performance by using a simulation method. From numerical examples, we observe a trade-off among performance measures and conclude that the partial go back N scheme is able to effectively reduce the occupancy of re-ordering buffer.

• 한국도서관정보학회지
• /
• 제14권
• /
• pp.149-179
• /
• 1987

The concept of a "switching language " between different indexing languages and information retrieval systems has been discussed since the mid-1960s. Some preliminary investigates into the feasibility of switching between mediating tool yielded positive results. The Broad system of ordering(BSO) , a general classification scheme for information exchange and switching, has been under development as a joint FID/UNESCO project since 1973. The purpose of this study is to find out the origin, development, definition, and principle of BSO. The results of the study can be summarized as follows: (1) BSO is a switching language for the purpose of interconnection of information system which is located different regions, or using different indexing languages. (2) BSO is in effect, fully faceted and broad classification system. (3) BSO is not only a subject code but also an ordering system. (4) BSO can be used information retrieval system because the notation of composite subjects is formed by combining notation. (5) BSO has to some extent sacrificed brevity by leaving large unused notational gap for future use. (6) The structure of the scheme is in no way dependent upon the notation. notation.

• 인터넷정보학회논문지
• /
• 제3권6호
• /
• pp.79-89
• /
• 2002

낙관적 동시성 제어 기법의 성능은 철회율에 매우 민감하다. 재배열 기법을 이용하여 이러한 철회율을 완화시킬 수 있지만 대부분의 재배열 기법은 그래프나 히스토리를 유지하기 위한 공간적 낭비가 심하다. 이 논문에서는 브로드케스팅 기법에 기반 한 효율적인 재배열 기법을 소개한다. CBI라고 불리는 이 기법은 그래프나 히스토리를 유지하기 위한 오버헤드 없이 철회율을 완화시킨다. 성능평가를 통하여 우리가 제안하는 기법이 철회율과 필요 없는 연산을 줄인다는 것을 보여준다. 뿐만 아니라, BTS와 THS보다 제안하는 기법이 우수한 성능을 나타낸다는 것을 보인다.

• Management Science and Financial Engineering
• /
• 제8권1호
• /
• pp.1-19
• /
• 2002

Ordering is used to reduce the amount of fill-ins in the Cholesky factor of a symmetric positive definite matrix. One of the most efficient ordering methods is the minimum degree ordering algorithm(MDO). In this paper, we provide a few techniques that improve the performance of MDO implemented with the clique storage scheme. First, the absorption of nodes in the cliques is developed which reduces the number of cliques and the amount of storage space required for MDO. Second, we present a modified minimum degree ordering algorithm of which the number of degree updates can be reduced by introducing the lower bounds of degrees. Third, using both the lower and upper bounds of degrees, we develop an approximate minimum degree ordering algorithm. Experimental results show that the proposed algorithm is competitive with the minimum degree ordering algorithm that uses quotient graphs from the points of the ordering time and the nonzeros in the Cholesky factor.

• 대한기계학회논문집
• /
• 제15권1호
• /
• pp.19-27
• /
• 1991

본 연구에서는 그래프 이론에 기초한 이단계 번호 부여 방법에 목표밴드폭을 도입하여 계산시간이 짧으면서도 효율적으로 번호를 부여할 수 있는 방법을 제안하고 자 한다.

• 한국정보전자통신기술학회논문지
• /
• 제3권2호
• /
• pp.50-57
• /
• 2010

본 논문에서는 물리계층 다중 안테나 무선채널을 통한 응용계층 H.264/AVC 비디오 전송을 다룬다. 물리계층에서 다중 안테나를 사용할 경우 다수 개의 안테나로부터 전송되는 신호가 서로 간섭으로 작용하여 결국 비디오 품질저하를 초래한다. 본 논문에서는 H.264/AVC 비디오 품질을 향상시키기 위해 개선된 간섭제거 순서화 방식을 제안한다. 모의실험 결과를 통해 제안된 방식에 의해 우수한 PSNR을 달성함을 확인한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권10호
• /
• pp.3406-3418
• /
• 2022

Reversible data hiding is an algorithm that has ability to extract the secret data and to restore the marked image to its original version after data extracting. However, some previous schemes offered the low image quality of marked images. To solve this shortcoming, a new reversible data hiding scheme based on pixel value ordering and edge detection mechanism is proposed. In our proposed scheme, the edge image is constructed to divide all pixels into the smooth regions and rough regions. Then, the pixels in the smooth regions are separated into non overlapping blocks. Then, by taking advantages of the high correlation of current pixels and their adjacent pixels in the smooth regions, PVO algorithm is applied for embedding secret data to maintain the minimum distortion. The experimental results showed that our proposed scheme obtained the larger embedding capacity. Moreover, the greater image quality of marked images are achieved by the proposed scheme than that other previous schemes while the high EC is embedded.

• 한국컴퓨터정보학회논문지
• /
• 제10권5호
• /
• pp.41-48
• /
• 2005

본 논문은 MBBS에서의 전역트랜잭션을 처리하기 위한 동시성 제어 기법을 제안한다. 전역 트랜잭션이 실행을 마치면 곧바로 완료시키는 대부분의 다른 기법과는 달리, 본 연구에서 제안한 기법은 기 결정된 지역 직렬화 가능 순서상 먼저 완료해야할 트랜잭션이 있을 경우에 그 트랜잭션이 완료할 때까지 트랜잭션 완료를 지연시킨다. 이러한 트랜잭션완료의 지면 덕분에 재실행되는 트랜잭션의 수를 줄일 수 있다. 제안된 기법의 성능은 시뮬레이션을 통해 참가하고 있는 LDBS중에 timestamp ordering(TO)방법을 지역 동시성 제어 기법으로 사용하고 있는 LDBS가 많을수록 좋은 성능을 보이는 것으로 측정 되었다.