• 한국컴퓨터정보학회논문지
• /
• 제23권12호
• /
• pp.1-9
• /
• 2018

The multiple-choice multidimensional knapsack problem (MMKP) is a variant of the well known 0-1 knapsack problem, which is known as an NP-hard problem. This paper proposes a method for solving the MMKP using the integer programming-based local search (IPbLS). IPbLS is a kind of a local search and uses integer programming to generate a neighbor solution. The most important thing in IPbLS is the way to select items participating in the next integer programming step. In this paper, three ways to select items are introduced and compared on 37 well-known benchmark data instances. Experimental results shows that the method using linear programming is the best for the MMKP. It also shows that the proposed method can find the equal or better solutions than the best known solutions in 23 data instances, and the new better solutions in 13 instances.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2005년도 춘계학술대회 논문집
• /
• pp.881-887
• /
• 2005

A total knee replacement is an extremely 'position-sensitive' operation; a malposition or a malalignment of the components will lead to a breakage of the component, a fracture around the knee prosthesis, and the limitation of range of the motion, etc. In a conventional total knee replacement, surgeons have to select an appropriate prosthesis according to the shape of the surgical region. A wrong selection may give rise to side effects or to need re-operation. Nevertheless, it is so difficult to choose the most proper prosthesis out of various kinds of prosthesis. This paper presents a surgical planning system for the total knee replacement with an operation simulating method in order to determine the parameters for the total knee replacement operation. We select an alignment axis and a resection angle as major operation parameters in the total knee replacement operation, and introduce the method to determine the major operation parameters with the operation simulator we developed. The simulator is used to determine operation parameters for optimized operations, to select the most appropriate prosthesis, and to analyze the prospective problems of the operation.

• 한국인터넷방송통신학회논문지
• /
• 제22권5호
• /
• pp.159-164
• /
• 2022

선형배정문제 (LAP)와 선형병목배정문제 (LBAP)는 다항시간으로 최적 해를 구하는 알고리즘이 알려져 있지 않은 NP-난제로 분류되어 메타휴리스틱 방법이나 O(m⁴) 계산 복잡도의 선형계획법 (LP) 소프트웨어 패키지나 헝가리안 알고리즘 (HA)을 적용하고 있다. 본 논문은 LAP와 LBAP에 대해 O(mn)=O(m²),m=n 복잡도의 다항시간 알고리즘을 제안하였다. LAP에 대해서는 선택-삭제 방법을, LBAP에 대해서는 삭제-선택 방법을 단순히 적용하였다. 모든 데이터에 적합한 유일한 알고리즘이 존재하지 않는 실험 데이터에 제안된 알고리즘을 적용한 결과, 제안된 알고리즘은 모든 데이터에 대해 최적 해를 구할 수 있었다.

• Educational Technology International
• /
• 제11권1호
• /
• pp.145-169
• /
• 2010

Many universities are searching for educational methods to cultivate problem-solving ability and cooperative learning ability or already trying to implement them. Problem Based Learning(PBL) and Action Learning(AL) are effective teaching and learning methods to cultivate men of talent qualified for problem-solving and cooperative learning abilities that universities are seeking after. PBL and AL have something in common in that learning is accomplished while learners are solving the authentic problem. But, in spite of this similarity, PBL and AL have differences. However, most literatures and cases on these two models introduce only the outline of commons and differences and do not provide teachers with actual helping aids to select a model appropriate for the actual design or operation of classes. Accordingly, many teachers usually select and utilize a familiar model rather than select a proper model to the nature of a subject and the educational goal. Teaching and learning methods or learning environment should be selected appropriately to the educational goal. This study indicates the characteristics of PBL and AL that are being introduced and utilized as a principal teaching and learning method of college education and then shows how this method can be realized in the university by comparing the cases of classes applied in two methods.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2013년도 춘계학술대회
• /
• pp.401-403
• /
• 2013

동적 스펙트럼 접속 방식 중 하나인 myopic 방식은 즉각적인 처리율을 최대로 하는 방식으로 복잡하지 않고 단순하면서도 효율적인 것이 장점이다. myopic 방식의 단점은 이차 사용자가 많아짐에 따라 이차 사용자간의 충돌로 인해 효율성이 나빠질 수 있다는 것이다. 모든 이차 사용자들이 다른 이차 사용자를 고려하지 않고 자신의 처리율을 최대로 하는 채널을 선택한다면, 대부분의 이차 사용자들이 동일한 채널을 선택하여 전송을 시도할 것이기 때문에 이차 사용자간의 충돌이 많아질 것이다. 이 문제를 해결하기 위해 myopic/CA 방식이 제안되었다. 이 방식에서 이차 사용자는 자신의 성능을 최대로 하는 하나의 채널을 선택하는 것이 아니라, 자신에게 유리한 다수의 후보 채널을 선택하여 그 중 하나의 채널을 임의로 선택하여 전송하는 방식이다. 본 논문에서는 네트워크 환경에 따라 후보 채널의 수를 몇 개로 정하는 것이 전체 네트워크의 성능을 최대로 높일 수 있는지 분석한다.

• 한국정보기술학회논문지
• /
• 제17권10호
• /
• pp.57-63
• /
• 2019

항공기를 이용해서 영상레이더를 운영하는 경우 이상적인 경로와 항공기의 위치가 다르기 때문에 요동 보상이 필요하다. 항공기의 위치를 측정할 때 사용하는 항법 장치의 오차 때문에 보상 후에 잔여 오차가 존재한다. 자동초점 기능은 이런 잔여 요동과 시스템의 부정확성을 보정하기 위해서 제안되었다. 자동초점 기능으로 여러 가지 방법이 제안되었지만 PGA가 가장 널리 활용되고 있다. PGA는 적응적 반복 기법을 사용하고, 표적이나 위상에 대한 특정한 가정이 없다. 하지만, 적응적 반복 기법 특성상 연산 시간이 문제가 주요한 문제이기 때문에 본 논문은 PGA의 연산 시간을 줄이기 위해서 PGA 표적 선택 기법을 개선한다. 영상의 분산을 이용해서 높은 SNR을 가진 표적을 찾아서 연산 시간을 줄이고 수렴 속도를 높인다. 제안한 방법은 실제 영상레이더 데이터를 이용해서 성능을 검증한다.

• 한국통신학회논문지
• /
• 제21권8호
• /
• pp.2077-2089
• /
• 1996

In this paper, a memory organization and its control method are proposed for the implementation of parallel Virterbi decoders. The design is mainly focused on lowering the hardware complexity of a parallel Viterbi decoder which is to reduce the decoding speed. The memories requeired in a Viterbi decoder are the SMM(State Metric Memory) and the TBM(Traceback Memory);the SMM for storing the path metrics of states and the TBM for storing the survial path information. A general parallel Viterbi decoder for high datarate usually consists of multiple ACS (Add-Compare-Select) units and their corresponding memeory modules.for parallel ACS units, SMMs and TBMs are partitioned into smaller independent pairs of memory modules which are separately interleaved to provide the maximum processing speed. In this design SMMs are controlled with addrss generators which can simultaneously compute addresses of the new path metrics. A bit shuffle technique is employed to provide a parallel access to the TBMs to store the survivor path informations from multiple ACS modules.

• 수산해양기술연구
• /
• 제48권1호
• /
• pp.10-19
• /
• 2012

The mesh selectivity of a drift net for yellow croaker (Larimichthys polyactis) was examined in field experiments with six different net mesh size (40, 45, 50, 55, 60 and 65mm) from April to December, 2008 in the coastal areas of Jeollanam-do in Korea. The total catch of 6,748 consisted of yellow croaker (n=6,310; 89.1% of total catch), common mackerel (n=158; 5.6%) and other species (n=280; 9.6%). The selectivity curve for yellow croaker was fit by the models of selectivity curve in SELECT method. The optimal mesh size for 50% retention for minimum landing size (191mm) of yellow croaker was estimated as 49.6mm-51mm by selectivity curves. And the bi-normal model for the selectivity curve was found to fit the data best.

• Journal of Communications and Networks
• /
• 제11권1호
• /
• pp.11-19
• /
• 2009

Multicarrier direct sequence code division multiple access (MC DS-CDMA) is an attractive technique for achieving high data rate transmission. This is valid regardless of whether or not the potentially large peak-to-average power ratio (PAPR) is an important factor for its application. On the other hand, code select CDMA (CS-CDMA) is an attractive technique with constant amplitude transmission of multicode signal regardless of subchannels. This is achieved by introducing a code select method. In this paper, we propose a new multiple access scheme based on the combination of MC DS-CDMA and CS-CDMA. The proposed scheme, which we call MC CS-CDMA, includes as special cases the subclasses of MC DS-CDMA and CS-CDMA. This paper investigates the performance of these systems over a multipath frequency selective fading channel using a RAKE receiver with maximal ratio combiner. In addition, the PAPR of the proposed system is compared with that of both MC DS-CDMA and CS-CDMA. Simulation results demonstrate that the proposed system provides better PAPR reduction than MC DS-CDMA, at the expense of the complexity of the receiver and the number of available users. The numerical result demonstrates that the proposed system has better performance than MC DS-CDMA due to the increased processing gain and time diversity gain.

• Journal of Advanced Marine Engineering and Technology
• /
• 제29권5호
• /
• pp.579-586
• /
• 2005

Recently, it has demanded to the wireless monitoring system in stand-alone PV power generation system. We propose the multiplex monitoring method using RF unit of low-price. RF unit consists of RF modem and communication controller. It is also able to use by repeater to communicate long distance. In this paper. two algorithms were programmed by CCS-C and C++ for multiplex monitoring method, The algorithm of choosing unit was used 'select and poll method' and the course assignment algorithm was embodied with 'Bellman-Ford algorithm'. The good result was achieved in the actual test without communication-data lose. The proposed method will be applied such as monitoring system of PV light on the wayside, monitoring system of unmanned lighthouse, monitoring system of refrigeration container on vessel and so on. It can be applied in the field that various ocean energy system.