• 한국CDE학회논문집
• /
• 제14권3호
• /
• pp.207-216
• /
• 2009

Modern engineering design problems involve complexity of disciplinary coupling and difficulty of problem formulation. Multidisciplinary design optimization can overcome the complexity and design optimization software or frameworks can lessen the difficulty. Recently, a growing number of new multidisciplinary design optimization techniques have been proposed. However, each technique has its own pros and cons and it is hard to predict a priori which technique is more efficient than others for a specific problem. In this study, a software system has been developed to directly solve MDO problems with minimal input required. Since the system is based on MATLAB, it can exploit the optimization toolbox which is already developed and proven to be effective and robust. The framework is devised to change an MDO technique to another as the optimization goes on and it is called a reconfigurable MDO framework. Several numerical examples are shown to prove the validity of the reconfiguration idea and its effectiveness.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 춘계학술대회
• /
• pp.841-844
• /
• 2009

현재 우리사회는 정보화시대에서 유비쿼터스 시대로 전환되고 있으며, 유비쿼터스 도시화는 각 국가별 및 지역별로 경쟁적으로 추진되고 있다. 이와 같은 시점에서 적절한 네트워크 환경의 재구성은 도시경쟁력 제고에 매우 중요한 요인이 되고 있다. 유비쿼터스 도시화는 신도시와 기존도시로 구분되어 추진된다. 예를 들면, 신도시에서와는 달리, 기존도시에서는 네트워크의 지중화 설계가 어려우므로 통신네트워크가 점유되고 있는 물리적 공간에 대한 제한적 요소도 충분히 고려되어야 한다. 본 논문에서는 신도시와 기존도시의 유비쿼터스 추진사례를 조사하고 비교 분석하였으며 기존도시의 재생개념으로 추진되고 있는 유비쿼터스 도시 인프라의 특성을 중점 분석하였다. 또한, 기존도시의 유비쿼터스 추진에 문제점으로 제기되는 도시환경개선을 위한 네트워크 무선화 정책방안도 제시한다.

• 디지털산업정보학회논문지
• /
• 제11권1호
• /
• pp.89-96
• /
• 2015

The various services applied internet have been provided by the rapid development of wireless networks and providing multimedia contents are also increasing. It is caused a number of problems such as increasing of network traffic rapidly. P2P technique is gaining popularity for solving these problems. In particular, P2P technique in a wireless network environment has gained much popularity. Among them, MANET-based P2P techniques has been studied actively. It is not easy to be applied the existing technique as it is due to the dynamic topology and low bandwidth by moving nodes in MANET that is consisted of only mobile nodes. In this paper, we proposed sharing group construction technique for providing a stable connection between mobile nodes and reducing the load of network traffic and overhead of sharing group reconfiguration in order to improve data transmission performance between mobile nodes. The sharing group member nodes applied virtual sharing group generation technique with neighboring nodes of 1-hop distance in order to reduce traffic for file sharing. We performed comparative experiments with DHT technique to evaluate the performance of the proposed technique in this paper and the excellent performance is confirmed through experiments.

• Journal of Astronomy and Space Sciences
• /
• 제28권4호
• /
• pp.285-290
• /
• 2011

This paper presents an algorithm that can provide initial conditions for formation flying at the beginning of a region of interest to maximize scientific mission goals in the case of a tetrahedral satellite formation. The performance measure is to maximize the quality factor that affects scientific measurement performance. Several path constraints and periodicity conditions at the beginning of the region of interest are identified. The optimization problem is solved numerically using a direct transcription method. Our numerical results indicate that there exist an optimal configuration and states of a tetrahedral satellite formation. Furthermore, the initial states and algorithm presented here may be used for reconfiguration maneuvers and fuel balancing problems.

• Journal of Astronomy and Space Sciences
• /
• 제21권3호
• /
• pp.209-220
• /
• 2004

Some methods have been presented to get optimal formation trajectories in the step of configuration or reconfiguration, which subject to constraints of collision avoidance and final configuration. In this study, a method for optimal formation trajectory-planning is introduced in view of fuel/time minimization using parameter optimization technique which has not been applied to optimal trajectory-planning for satellite formation flying. New constraints of nonlinear equality are derived for final configuration and constraints of nonlinear inequality are used for collision avoidance. The final configuration constraints are that three or more satellites should be placed in an equilateral polygon of the circular horizontal plane orbit. Several examples are given to get optimal trajectories based on the parameter optimization problem which subjects to constraints of collision avoidance and final configuration. They show that the introduced method for trajectory-planning is well suited to trajectory design problems of formation flying missions.

• 한국CDE학회논문집
• /
• 제8권3호
• /
• pp.184-188
• /
• 2003

The harness design process consists of repetitious routines to decide the wire configuration in its interior. A slight change in one of the wire's configuration will require a total reconfiguration of the entire wire system. Therefore, the harness design is extremely time consuming and is vulnerable to human errors by an engineer. Based on both electrical and mechanical area, Wiring Harness system is in complicated area. Existing systems are, therefore, not exactly suitable for practical use. This paper presents a novel framework for ameliorating existing system's defects. In this paper, Visio and Visual Basic was interfaced to process wire bundle information and wire bundle location to alleviate problems mentioned beforehand concerning harness design; at the same time developing the automation of the entire design process based on the feature based design method, optional print, and management of documents for reuse.

• Kyungpook Mathematical Journal
• /
• 제56권3호
• /
• pp.647-655
• /
• 2016

Let H be a graph, and $k{\geq}{\chi}(H)$ an integer. We say that H has a cyclic Gray code of k-colourings if and only if it is possible to list all its k-colourings in such a way that consecutive colourings, including the last and the first, agree on all vertices of H except one. The Gray code number of H is the least integer $k_0(H)$ such that H has a cyclic Gray code of its k-colourings for all $k{\geq}k_0(H)$. For complete bipartite graphs, we prove that $k_0(K_{\ell},r)=3$ when both ${\ell}$ and r are odd, and $k_0(K_{\ell},r)=4$ otherwise.

• 천문학회보
• /
• 제37권2호
• /
• pp.160.1-160.1
• /
• 2012

We present an alternative approach for satellite formation reconfiguration by an optimal impulsive-thrust strategy to minimize the total characteristic velocity in a near-circular-orbit. Linear transformation decouples the Hill-Clohessy-Wiltshire(HCW) dynamics into a new block-diagonal system matrix consisting of 1-dimensional harmonic oscillator and 2-dimensional subsystem. In contrast to a solution based on the conventional primer vector theory, the optimal solution and the necessary conditions are represented as times and directions of impulses. New analytical expression of the total characteristic velocity is found for each sub systems under general boundary conditions including transfer time constraint. To minimize the total characteristic velocity, necessary conditions for times and directions of impulses are analytically solved. While the solution to the 1-dimensional harmonic oscillator has been found, the solution to the 2-dimensional subsystem is currently under construction. Our approach is expected to be applicable to more challenging problems.

• 한국IT서비스학회지
• /
• 제10권1호
• /
• pp.117-133
• /
• 2011

In this paper, we present a frequency reassignment problem (FRP) arising from the reconfiguration of radio networks such as adding new base stations (BSs) and changing the number of frequencies assigned to BSs. For this problem, we develop an integer programming (IP) model that minimizes the sum of frequency reassignment cost and the cost for unsatisfied frequency demands, while avoiding interference among frequencies. To obtain tight lower bounds, we develop some valid inequalities and devise an objective function relaxation scheme. Also, we develop a simple but efficient heuristic procedure to solve large size problems. Computational results show that the developed valid inequalities are effective for improving lower bounds. Also, the proposed tabu search heuristic finds tight upper bounds with average optimality gap of 2.3%.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 하계학술대회 논문집 B
• /
• pp.800-803
• /
• 1996

This paper proposes the algorithm to solve emergency service restoration problems using efficient reconfiguration method in distribution system. In this algorithm, we try to avoid the blackout of important loads by considering service rank. It is possible to reconfigurate the system by using fuzzy inference results in which was reflected the expected distribution power, line capacity and service rank. A 27-bus, 32-branch model system is used to demonstrate the effectiveness of the proposed algorithm.