• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.141-154
• /
• 2007

The connectivity problem is a fundamental problem in graph theory. The best known algorithm to solve the connectivity problem on general graphs with n vertices and m edges takes $O(K(G)mn^{1.5})$ time, where K(G) is the vertex connectivity of G. In this paper, an efficient algorithm is designed to solve vertex connectivity problem, which takes $O(n^2)$ time and O(n) space for a trapezoid graph.

• 한국자동차공학회논문집
• /
• 제14권2호
• /
• pp.1-8
• /
• 2006

In this paper, an optimum design technology is developed to find an optimal position of the shock absorber using ADAMS and VisualDOC. A vehicle with a torsion-beam rear suspension is modeled by using ADAMS. Design variables for the optimal positioning of the shock absorber are defined considering the hard points of the chassis structure and design positioning are specified through the sensitivity analysis using a bump-crossing simulation. The objective function is defined as the joint reaction forces of the shock absorber connecting joints of the chassis structure. Sequential Quadratic Programming and Genetic Algorithms are used for this study. To validate the optimized design variables, pothole simulations are performed. GA showed better results than SQP algorithms for this design purpose.

• Communications for Statistical Applications and Methods
• /
• 제11권1호
• /
• pp.139-151
• /
• 2004

Kim et al. (2002) developed public use SAS-based software for two-way stratification design, which is called SOCSLP We describe the details of a new approach implemented using SOCSLP and key differences between the approach and the sampling schemes of Sitter and Skinner (1994) and Winkler (2001). In addition, a numerical example is given to compare those methods with respect to the probabilities of selecting sample arrays.

• International Journal of Control, Automation, and Systems
• /
• 제1권2호
• /
• pp.178-183
• /
• 2003

This work is a modified version of an earlier work that was based on ellipsoidal type feasible sets. Unlike the earlier work, polyhedral types of invariant and feasible sets are adopted to deal with input constraints. The use of polyhedral sets enables the formulation of on-line algorithm in terms of QP (Quadratic Programming), which can be solved more efficiently than semi-def algorithms. A simple numerical example shows that the proposed method yields larger stabilizable sets with greater bounds on disturbances than is the case in the earlier approach.

• 한국멀티미디어학회:학술대회논문집
• /
• 한국멀티미디어학회 2004년도 춘계학술발표대회논문집
• /
• pp.326-329
• /
• 2004

Content adaptation is an effective solution to support the quality of service over multimedia services over heterogeneous environments. This paper deals with the accuracy and the real-time requirement, two important issues in making decision on content adaptation. From our previous problem formulation, we propose an optimal algorithm and a fast approximation based on the Viterbi algorithm of dynamic programming. Through extensive experiments, we show that the proposed algorithms can enable accurate adaptation decisions, and especially they can support the real-time processing.

• 한국경영과학회지
• /
• 제26권2호
• /
• pp.1-11
• /
• 2001

This paper considers the scheduling of cell-based handoffs to balance the traffic in a fiber-optic microcelluar system. In the system depending on the order of cell based handoff, periodical balancing of the traffic among microcells can be achieved. The cell based handoff problem is formulated as a dynamic programming and the computational complexity is analyzed. Since the scheduling problem requires real time solution, heuristic algorithms are proposed and the computational results are discussed.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.893-896
• /
• 1998

A new evolutionary programming technique using multiple subpopulations with completely differnt evolution mechanisms is propsed to solve the optimization problems. Three subpopulations, each has different evolution charcteristics and uses different EP algorithms such as SAEP, AEP and FEP, are cooperating with synergy effect in which it increases the possibility to quickly find the global optimum of continuous optimization problems. Subpopulations evolve in differnt manner and the interaction among these leads to global minimum quickly.

• 인터넷정보학회논문지
• /
• 제25권2호
• /
• pp.123-132
• /
• 2024

본 연구는 2022 개정 중등 정보과 교육과정의 '알고리즘과 프로그래밍' 영역에서 위계를 고려한 학습 요소를 추출하기 위한 목적으로 진행되었다. 교육과정에 제시된 핵심 아이디어와 '지식·이해', '과정·기능', '가치·태도'의 내용 요소를 고려하여 내재적 타당성을 확보하였고, 25명의 전문가가 참여한 FGI와 CVR 등을 통해 학습 요소 추출의 외현적 타당성을 확보하였다. 본 연구를 통해 도출된 학습 요소는 중학교가 1단계 7개, 2단계 18개, 3단계 26개이며, 고등학교는 1단계 8개, 2단계 23개, 3단계 27개이다. 각 단계별 지식의 범위와 크기가 다를 수는 있으나, 1단계의 지식이 2단계와 3단계로 구체화 되는 위계를 갖기 때문에 하나의 지식이 어떤 구조로 가르쳐져야 하는지에 대한 방향성을 제시하고 있다.

• 한국항행학회논문지
• /
• 제14권4호
• /
• pp.521-529
• /
• 2010

본 논문에서는 OFDM 시스템에서 인접 셀 간 간섭을 줄이기 위한 새로운 스케줄링 알고리즘을 제안한다. 제안된 알고리즘은 스케줄링을 할 때에 셀 별로 서로 다른 부채널 할당 순서를 적용하며 정수계획법을 이용하여 인접한 셀 간의 간섭을 최소화시키는 파라미터를 도출하며 이에 기반하여 스케줄링을 수행하는 방식이다. 시스템 시뮬레이션을 통하여 제안한 방식의 성능을 도출하였으며, 시뮬레이션 결과 제안한 스케줄링 알고리즘은 기존의 알고리즘들에 비해서 평균 전송율 외에 사용자별 공평성 측면에서 개선이 되고 이로 인해서 가입자 QoS 지원을 더 강화할 수 있음을 보였다.

• 대한전기학회논문지:전력기술부문A
• /
• 제55권12호
• /
• pp.549-554
• /
• 2006

Available transfer capability(ATC) is an important indicator of the usable amount of transmission capacity accessible by several parties for commercial trading in power transaction activities. This paper deals with an application of optimization technique for available transfer capability(ATC) calculation and analyzes the results of ATC by considering several constraints. Especially several optimization techniques are used to solve the ATC problem with state-steady security constraints. The results are compared with that of repeat power flow(RPF), sequential quadratic programming(SQP) and linear programming(LP). The proposed method is applied to 10 machines 39 buses model systems to show its effectiveness.