• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.2177-2193
• /
• 2018

This paper studies resource allocation schemes for the relay-aided cooperative system consisting of multiple source-destination pairs and decode-forward (DF) relays. Specially, relaying selection, multisubcarrier pairing and assignment, and power allocation are investigated jointly. We consider a combinatorial optimization problem on quality of experience (QoE) and energy consumption based on relay-aided cooperative system. For providing better QoE and lower energy consumption we formulate a multi-objective optimization problem to maximize the total mean opinion score (MOS) value and minimize the total power consumption. To this end, we employ the nondominated sorting genetic algorithm version II (NSGA-II) and obtain sets of Pareto optimal solutions. Specially, two formulas are devised for the optimal solutions of the multi-objective optimization problems with and without a service priority constraint. Moreover, simulation results show that the proposed schemes are superior to the existing ones.

• 한국산학기술학회논문지
• /
• 제5권5호
• /
• pp.429-432
• /
• 2004

본 논문은 단일형태의 버퍼 구조로 물리적인 단일 큐의 시퀀서 갖고 논리적으로 다중 큐의 형태로 구성된 ATM스위치를 제안한다. 제안된 스위치는 순환적 순위 알고리즘이 적용되도록 하드웨어로 구현된 ATM 셀의 출력 포트에 따라 ATM 셀이 정렬되도록 프로시져를 수행시킨다. 이 구조는 물리적으로 단일 버퍼를 갖지만 논리적으로는 순환적으로 순위를 결정하여 출력포트에서의 상충을 최대한 억제하도록 설계된 다중 큐의 기능을 하고 있다. 향후 이러한 형태의 구조는 다양한 구조의 라우팅을 위한 스위치로 응용되고, 시스템 구성의 확장성에 있어서도 큰 장점을 지니고 있어, 전송 효율적인 면에서도 훌륭한 구조로 평가된다.

• 비파괴검사학회지
• /
• 제35권1호
• /
• pp.1-11
• /
• 2015

본 연구에서는 온라인 감염 씨감자 비파괴선별 시스템을 구축하고 감염 씨감자 선별을 위한 통계적 모델을 개발하여 적용함으로써 선별시스템의 성능을 평가하였다. 선별모델 개발을 위해 토양병 및 잠복 감염의 대표적인 병원성 세균인 pectobacteruim atrosepticum을 인위적으로 씨감자에 감염시켜 씨감자 내부에 병징이 발현되도록 하여 실험하였다. 구축된 선별시스템을 통해 감염 및 정상 씨감자의 투과스펙트럼을 획득한 후 최소자승판별법(partial least square-discriminant analysis)을 이용하여 감염 씨감자 검출모델을 개발하였다. 개발된 모델의 검정결정계수는($R^2$) 0.943이었고 분류의 정확도는 99%(n=80) 이상으로 우수한 선별성능을 보였다. 개발된 온라인 감염 씨감자 선별시스템은 씨감자 선별뿐만 아니라 다양한 농산물의 감염을 검출하는 기반기술로 응용이 가능할 것으로 판단된다.

• 컴퓨터교육학회논문지
• /
• 제6권3호
• /
• pp.1-8
• /
• 2003

본 논문에서는 O(NlogN) 의 시간 복잡도와 데이터의 분포상태에 영향을 받지 않는 정보블록 정렬알고리즘(IBSA : Information Block Sort Algorithm)을 제안하고, 시뮬레이터를 이용하여 그 성능을 평가하였다. 2백만 개의 랜덤 데이터를 이용하여 IBSA의 성능을 측정해본 결과, 퀵 정렬의 22%, 개선된 퀵 정렬의 36% 정도의 비교회수만으로도 정렬할 수 있음을 보여주었다.

• 대한기계학회논문집A
• /
• 제28권7호
• /
• pp.1055-1063
• /
• 2004

In this study, we developed an automatic veneer sorting system controlled by nonlinear friction and nonlinear stiffness. With these nonlinear characteristics, it was difficult to analysis and to control the system in the fast. However it is necessary to consider nonlinear characteristics to satisfy accurate and rapid control demand in these days. We used not only nonlinear friction but also nonlinear stiffness and combined both to control the system. An experimental device was designed with 4 AC servo-motors and 2 Sensors. Through a series of experiment, we found nonlinear friction characteristics among roller versus veneer and veneer versus veneer and nonlinear stiffness characteristics with stacked veneers. Finally, we showed that the proposed control algorithm was very effective for veneer sorting system with nonlinear friction and stiffness.

• Journal of Biosystems Engineering
• /
• 제24권1호
• /
• pp.67-74
• /
• 1999

A prototype cut-flower sorter was developed and tested for its performance with five varieties of roses. Support plates driven by a chain mechanism transported the roses into an image inspection chamber. Color image processing algorithms were developed to evaluate the length, thickness, and straightness of stem and color, height, and maturity of bud. The average absolute errors of the system for the measurements of stem length, stem thickness, and height of bud were 19.7 mm, 0.5 mm, and 3.8 mm, respectively. The results of classification by the sorter were compared with those of a human inspector for straightness of stem and maturity of bud. The classification error for the straightness of stem was 8.6%, when both direct image and reflected image by a mirror were analyzed. The accuracy in classifying the maturity of bud varied among the varieties, the smallest for‘Nobless’(1.5%) and the largest for‘Rote Rose’(13.5%). The time required to process a rose averaged 2.06 seconds, equivalent to the capacity of 1,600 roses per hour.

• 한국과학교육학회지
• /
• 제7권2호
• /
• pp.37-43
• /
• 1987

Computer in one of the most tremendous achievements of the modern scientific technique. Not only in government, business, research and education but in our daily life. computers are widely utilized to assist in solving various problems. With increasing frequency, it is recognized that a right understanding of the computer is necessary: naturally, this recognition places a great emphasis on the computer education. In Korea computer is chosen either as an optional subject or as a kind of group activity in many schools. It is the purpose of this study to compare and analyze the internal sorting algorithms which are used frequently in data processing. and to present the results of program analysis. which will make it possible to choose the appropriate sorting algorithm for each data processing. Generally the algorithms are coded in a language appropriate for structured programming. like PASCAL: however, here the algorithms are expressed in BASIC which is widely used with the personal computers so that the students and the teachers may understand them easily.

• Journal of applied mathematics & informatics
• /
• 제9권1호
• /
• pp.239-252
• /
• 2002

A sort sequence $S_n$ is sequence of all unordered pairs of indices in $I_n$={1,2,…n}. With a sort sequence $S_n$ = ($s_1,S_2,...,S_{\frac{n}{2}}$),one can associate a predictive sorting algorithm A($S_n$). An execution of the a1gorithm performs pairwise comparisons of elements in the input set X in the order defined by the sort sequence $S_n$ except that the comparisons whose outcomes can be inferred from the results of the preceding comparisons are not performed. A sort sequence is said to be extremal if it maximizes a given objective function. First we consider the extremal sort sequences with respect to the objective function $\omega$($S_n$) - the expected number of tractive predictions in $S_n$. We study $\omega$-extremal sort sequences in terms of their prediction vectors. Then we consider the objective function $\Omega$($S_n$) - the minimum number of active predictions in $S_n$ over all input orderings.

• 한국멀티미디어학회논문지
• /
• 제11권6호
• /
• pp.737-745
• /
• 2008

In this paper, a novel neighborhood metric of histogram equalization (HE) algorithm for contrast enhancement is presented. We present a refinement of HE using neighborhood metrics with a general framework which orders pixels based on a sequence of sorting functions which uses both global and local information to remap the image greylevels. We tested a novel sorting key with the suggestion of using the original image greylevel as the primary key and a novel neighborhood distinction metric as the secondary key, and compared HE using proposed distinction metric and other HE methods such as global histogram equalization (GHE), HE using voting metric and HE using contrast difference metric. We found that our method can preserve advantages of other metrics, while reducing drawbacks of them and avoiding undesirable over-enhancement that can occur with local histogram equalization (LHE) and other methods.

• 정보과학회 컴퓨팅의 실제 논문지
• /
• 제23권8호
• /
• pp.498-503
• /
• 2017

SIMD(Single Instruction Multiple Data)는 대표적인 병렬화 아키텍처 중 하나로, SIMD 레지스터에 적재된 여러 개의 데이터들을 하나의 명령어로 처리하는 기술이다. 퀵정렬(Quicksort)은 데이터 값들이 리스트로 저장되어 있을 때, 임의의 위치에 있는 데이터 값을 피봇으로 하여 그것보다 작은 값은 왼편으로, 큰 값은 오른편으로 분할하여 생성된 두 개의 서브리스트에 대하여 같은 작업을 반복함으로써 데이터 값들을 정렬하는 정렬 알고리즘이다. 본 연구에서는 SIMD 명령어를 이용하여 파이프라인 아키텍처에서 조건 예측 실패에 따른 성능 저하를 유발하지 않도록 분기 조건을 최소로 사용하는 효율적인 퀵정렬(Quicksort) 알고리즘을 제안한다. 또한, VBP(Vertical Bit Parallel) 기법과 얼리 프루닝(early pruning) 기법을 적용하여 SIMD 레지스터에 데이터를 바이트 단위로 적재함으로써 퀵 정렬 알고리즘의 성능을 향상하였다.