• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2002년도 추계학술대회 논문집(I)
• /
• pp.349-356
• /
• 2002

This paper describes a mathematical programming model for constructing the rolling stock assignment plan. This plan is a schedule which assigns daily routings, maintenance activities, and other tasks to trainsets. A generalized set partitioning model which is a kind of integer programming model is suggested as a model for constructing the assignment plan. And a column generation method are suggested as a solution method.

• 터널과지하공간
• /
• 제11권2호
• /
• pp.132-145
• /
• 2001

핵변환 후 영구 처분될 가압경수로 및 중수로용 사용후 핵연료에 대한 인간 생태계에 대한 영향을, 직접 처분하는 경우와 비교해 보았다. 심지층 처분된 용기에 저장된 사용후 핵연료로부터 유출된 방사성 핵종들이 공학적 방벽을거쳐 결정질 기반암 내 균열대를 통해 지하수의 흐름을 따라 이동하면서, 다양한 지질 및 암종을 거쳐 생태 환경으로 도달한다는 핵종 유출 시나리오 중 가장 보수적인 시나리오인 우물 시나리오에 대한 위해도를 평가하여 상대인 환경친화성을 정량적으로 제시하였다. 현재 국내에 가속기와 미임계형 원자로를 함께 사용하는 핵변환 시스템과 임계형 원자로와 같은 핵변환시스템이 개념적인 수준에서 개발되고 있어, 이 연구를 통해 향후 핵변환시스템 연구에서 요구되는 항목들도 기술적 개선, 경제성 제고, 환경 친화성, 그리고 수용성 측면에서 제시해 보았다.

• 한국컴퓨터정보학회논문지
• /
• 제15권9호
• /
• pp.1-8
• /
• 2010

하드웨어-소프트웨어 통합설계에서 다양한 설계제약 조건을 만족하는 임베디드 시스템 개발을 효율적으로 완료하기 위하여 하드웨어와 소프트웨어의 최적분할을 빠른 시간 안에 탐색하는 핵심기술이 필요하다. 본 논문에서는 다양한 하드웨어-소프트웨어 분할에 따른 매핑 조합 중 최적분할에 해당할 수 없는 조합들은 미리 선별하여 탐색대상에서 제외하는 것을 가능하게 하는 맞춤형 매핑 휴리스틱, CHARMS을 제시한다. CHARMS은 응용프로그램의 여러 태스크를 하드웨어 또는 소프트웨어로 매핑하면서, 단위시간 안에 처리되는 태스크의 수인 Parallelism과 일의 양인 Workload 로 Throughput을 예측하고 최적의 분할대상을 선별하는 기존의 휴리스틱보다 향상된 방법으로, 태스크들의 계산 복잡도를 고려하였으며, 설계제약 조건의 중요도를 다양하게 표현할 수 있는 weighted combo-metric을 활용한다. H.263 인코더 설계에서 CHARMS을 이용할 경우 매핑조합의 95.17%를 탐색 대상에서 제외할 수 있었음을 실험을 통하여 보였다.

• 한국항해학회지
• /
• 제14권1호
• /
• pp.21-38
• /
• 1990

This paper discusses the various modes of operations of cargo ships which are liner operations, tramp shipping and industrial operations, and mathematical programming, simulation , and heuristic method that can be used to solve ships routing and scheduling problems for each of these operations. In particular, this paper put emphasis on a crude oil tanker scheduling problem. The problem is to achieve an optimal sequence of cargoes or an optimal schedule for each ship in a given fleet during a given period. Each cargo is characterized by its type, size, loading and discharging ports, loading and discharging dates, cost, and revenue. Our approach is to enumerate all feasible candidate schedate schedules for each ship, where a candidate schedule specifies a set of cargoes that can be feasibly carried by a ship within the planning horizon , together with loading and discharging dates for each cargo in the set. Provided that candidate schedules have been generated for each ship, the problem of choosing from these an optimal schedule for each ship is formulated as a set partitioning problem, a set packing problem, and a integer generalized network problem respectively. We write the PASCAL programs for schedule generator and apply our approach to the crude oil tanker scheduling problem similar to a realistic system.

• Journal of Power Electronics
• /
• 제17권2호
• /
• pp.411-421
• /
• 2017

An approach based on a 2D lumped model is presented to quantify the voltage transfer gain (VTG) in power converter low power planes. The advantage of the modeling approach is the ease with which typical noise reduction devices such as decoupling capacitors or ferrite beads can be integrated into the model. This feature is enforced by a new modular approach based on effective matrix partitioning, which is presented in the paper. This partitioning is used to decouple power plane equations from external device impedance, which avoids the need for rewriting of a whole set of equation at every change. The model is quickly solved in the frequency domain, which is well suited for an automated layout optimization algorithm. Using frequency domain modeling also allows the integration of frequency-dependent devices such inductors and capacitors, which are required for realistic computation results. In order to check the precision of the modeling approach, VTGs for several layout configurations are computed and compared with experimental measurements based on scattering parameters.

• 대한산업공학회지
• /
• 제27권3호
• /
• pp.250-259
• /
• 2001

Given a tree structured network in which each node has its own demand and also stands for a candidate location of a potential facility, such as plant or warehouse, a capacitated facility location problem on the network (CFLPOT) is to decide capacitated facility locations so that the total demand occurred on the network can be satisfied from those facilities with the minimum cost. In this paper, we first introduce a mixed integer programming formulation for CFLPOT with two additional assumptions, the indivisible demand assumption and the contiguity assumption and then show that it can be reformulated as a tree partitioning problem with an exponential number of variables. We then show that it can be solved in O($n^2b$) time by utilizing the limited column generation method developed by Shaw (1993), where n is the total number of nodes in the network and b is the maximum facility capacity. We also develop a depth-first dynamic programming algorithm with a running time of O(nb) for finding the locally maximal reduced cost which plays an important role in the limited column generation method. Finally, we implement our algorithms on a set of randomly generated problems and report the computational results.

• Smart Structures and Systems
• /
• 제10권3호
• /
• pp.209-228
• /
• 2012

Structural health monitoring with wireless sensor networks has received much attention in recent years due to the ease of sensor installation and low deployment and maintenance costs. However, sensor network technology needs to solve numerous challenges in order to substitute conventional systems: large amounts of data, remote configuration of measurement parameters, on-site calibration of sensors and robust networking functionality for long-term deployments. We present a structural health monitoring network that addresses these challenges and is used in several deployments for monitoring of bridges and buildings. Our system supports a diverse set of sensors, a library of highly optimized processing algorithms and a lightweight solution to support a wide range of network runtime configurations. This allows flexible partitioning of the application between the sensor network and the backend software. We present an analysis of this partitioning and evaluate the performance of our system in three experimental network deployments on civil structures.

• 한국정보처리학회논문지
• /
• 제7권3호
• /
• pp.943-952
• /
• 2000

The surface reconstruction problem from a set of wire-frame contours is very important in diverse fields such as medical imaging or computer animation. In this paper, surface triangulation method is proposed for solving the problem. Generally, many optimal triangulation techniques suffer from the large computation time but heuristic approaches may produce very unnatural surface when contours are widely different in shape. To compensate the disadvantages of these approaches, we propose a new heuristic triangulation method which iteratively decomposes the surface generation problem from a band (a pair of vertices chain) into tow subproblems from two sub-bands. Generally, conventional greedy heuristic contour triangulation algorithm, suffer from the drastic error propagation during surface modeling when the adjacent contours are different in shape. Our divide-and-conquer algorithm, called band partitioning algorithm, processes eccentric parts of the contours first with more global information. Consequently, the resulting facet model becomes more stable and natural even though the shapes are widely different. An interesting property of our method is hat it supports multi-resolution capability in surface modeling time. According to experiments, it is proved to be very robust and efficient in many applications.

• Asia pacific journal of information systems
• /
• 제31권4호
• /
• pp.491-526
• /
• 2021

Airlines can employ a variety of quality monitoring procedures. In this study, we employ a content analysis of 8 years of online reviews for Korean airlines in contrast to other international airlines. Online airline reviews are infrequent, relative to the total number of passengers - the number of reviews is multiple orders of magnitude lower than passenger volumes - and online airline reviews are, therefore, not representative of passenger attitudes overall. Nevertheless, online reviews may be indicative of specific service issues, and draw attention to aspects that require further study by airline operators. Furthermore, significant words and phrases used in these airline reviews may help airline operators to rapidly automate filtering, partitioning, and analysis of incoming passenger comments via other channels, including email, social media posts, and call center transcripts. The current study provides insights into the contents of online reviews of Korean vs Other-International airlines, and opportunities for service enhancement. Further, we provide a set of marker words and phrases that may be helpful for management dashboards that require automated partitioning of passenger comments.

• 한국산학기술학회논문지
• /
• 제4권3호
• /
• pp.263-269
• /
• 2003

이 논문은 3차원 정수 웨이브릿 변환을 이용한 손실 의료 영상 압축에 대한 방법을 보여준다. 의료영상에 3차원 웨이브릿 분할법과 3차원 spatial dependence tree를 이용한 Set Partitioning in Hierarchical Trees(SPIHT) algorithm을 제공한다. 또한 3차원 웨이브릿 분할법에서 정수 웨이브릿 필터들을 이용한 lifting방법을 이용하고, unitary 변환을 만들기 위하여 정확한 scaling을 이용한다. 압축률이 증가하면 할수록 인접한 coding unit사이에선 boundary effect가 생긴다. Video와 같지 않아서 인접한 coding unit사이에서의 boundary artifact는 보여서는 안 된다. 이러한 현상을 제거하기 위해서 인접한 coding unit사이에 axial domain으로 overlapping방법을 사용한다. 또한 코딩 할 때 여러 종류의 정수 필터들을 사용한다. 결과로 어떤 특정한 필터를 사용할 때 좋은 결과를 얻었고 overlapping방법을 사용했기 때문에 ringing artifacts는 거의 찾아 볼 수가 없게 되었다. 그리고 어두운 면을 코딩 할 때도 좋은 결과를 얻었다.