• KSBB Journal
• /
• 제16권1호
• /
• pp.11-14
• /
• 2001

Techniques for protein refolding from inclusion body are discussed in view of its engineering application to large scale protein purification. Among the techniques, dilution and dialysis are mainly utilized due to simple operation. Membrane reactor, gel filtration chromatography, and continuous tank operation are emerging tools for their process-scale possibility in refolding. Reaction engineering approaches could be used to analyze the kinetic behaviour in the process scale refolding reactor. The kinetic analysis is helpful in the optimization of refolding yield in the refolding reactor.

• 경영과학
• /
• 제17권1호
• /
• pp.55-64
• /
• 2000

By managing not only geographical information but also various kinds of attribute data. GIS presents useful information for decision-makings. Most of decision-making problems using GIS can be formulated into network-optimization problems. In this study we deal with the implementation of network optimization system that extracts data from the database in GIS. solves a network optimization problem and present optimal solutions through GIS' graphical user interface. We design a nitwork optimization system and present some implementation techniques by showing a prototype of the network optimization system. Our network optimization system consists of three components : the interface module for user and GIS the basic network the program module the advanced network optimization program module. To handle large-scale networks the program module including various techniques for large sparse networks is also considered, For the implementation of the network optimization system we consider two approaches : the method using script languages supported by GIS and the method using client tools of GIS. Finally some execution results displayed by the prototype version of network optimization system are given.

• 대한조선학회논문집
• /
• 제47권1호
• /
• pp.58-66
• /
• 2010

Topology design optimization is a method to determine the optimal distribution of material that yields the minimal compliance of structures, satisfying the constraint of allowable material volume. The method is easy to implement and widely used so that it becomes a powerful design tool in various disciplines. In this paper, a large-scale topology design optimization method is developed using the efficient adjoint sensitivity and optimality criteria methods. Parallel computing technique is required for the efficient topology optimization as well as the precise analysis of large-scale problems. Parallelized finite element analysis consists of the domain decomposition and the boundary communication. The preconditioned conjugate gradient method is employed for the analysis of decomposed sub-domains. The developed parallel computing method in topology optimization is utilized to determine the optimal structural layout of human powered vessel.

• 대한전기학회논문지:전력기술부문A
• /
• 제51권5호
• /
• pp.217-224
• /
• 2002

This paper presents an algorithm to obtain an approximate optimal solution for the service restoration and load balancing of large scale radial distribution system in a real-time operation environment. Since the problem is formulated as a combinatorial optimization problem, it is difficult to solve a large-scale combinatorial optimization problem accurately within the reasonable computation time. Therefore, in order to find an approximate optimal solution quickly, the authors proposed an algorithm which combines optimization technique called cyclic best-first search with heuristic based feeder loadings balance index for computational efficiency and robust performance. To demonstrate the validity of the proposed algorithm, numerical calculations are carried out the KEPCO's 108 bus distribution system.

• 전기학회논문지
• /
• 제58권4호
• /
• pp.735-741
• /
• 2009

This paper presents an algorithm for the permanent magnet shape optimization of a large scale BLDC(Brushless DC) motor to minimize the cogging torque. A response surface method (RSM) using multiquadric radial basis function is employed to interpolate the objective function in design parameter space. In order to get a reasonable response surface with relatively small number of sampling data points, additional sampling points are added on the basis of design sensitivity analysis computed by using FEM. The algorithm has 2 stages: the first stage is to determine the PM arc angle, and the 2nd stage is to optimize the magnet pole shape. The developed algorithm is applied to a 5MW BLDC motor to get a minimum cogging torque. After 3 iterations with 4 design parameters, the cogging torque is reduced to 13.2% of the initial one.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.101-104
• /
• 2007

Efficient Query processing and optimization are critical for reducing network traffic and decreasing latency of query when accessing and manipulating sensor data of large-scale sensor networks. Currently it has been studied in sensor database projects. These works have mainly focused on in-network query processing for sensor networks and assumes homogeneous sensor networks, where each sensor network has same hardware and software configuration. In this paper, we present a framework for efficient query processing over heterogeneous sensor networks. Our proposed framework introduces query processing paradigm considering two heterogeneous characteristics of sensor networks: (1) data dissemination approach such as push, pull, and hybrid; (2) query processing capability of sensor networks if they may support in-network aggregation, spatial, periodic and conditional operators. Additionally, we propose multi-query optimization strategies supporting cross-translation between data acquisition query and data stream query to minimize total cost of multiple queries. It has been implemented in WSN middleware, COSMOS, developed by ETRI.

• 한국환경과학회지
• /
• 제4권1호
• /
• pp.71-80
• /
• 1995

생화학적 산소요구량(BOD) 및 용존 산소(DO)을 이용하여 여러구간이 있는 강에 대한 이산 상태공간모델은 설정하였다. 상호작용 예측방법을 이용하여, 상태변수에 시간지연이 존재하는 대규모 시스템에 적용가능한 계층적 최적화 방법을 기술하였다. 정상상태 오차를 해석적으로 구하고, 상수 목표티 추적문제에 있어서 정상상태 오차가 발생하지 않을 필요충분조겆을 규명하였다. 수질오염 모델에 대한 컴퓨터 모사를 통하여 기술한 알고리듬의 타당성을 확인하였다.

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

This paper presents an optimization method for optimal reactive power dispatch which minimizes real power loss and improves voltage profile of power systems using evolutionary computation such as genetic algorithms(GAs), evolutionary programming(EP). and evolution strategy(ES). Many conventional methods to this problem have been proposed in the past, but most these approaches have the common defect of being caught to a local minimum solution. Recently, global search methods such as GAs, EP, and ES are introduced. The proposed methods were applied to the IEEE 30-bus system. Each simulation result, compared with that obtained by using a conventional gradient-based optimization method, Sequential Quadratic Programming (SQP), shows the possibility of applications of evolutionary computation to large scale power systems.

• Journal of Information Processing Systems
• /
• 제17권1호
• /
• pp.37-50
• /
• 2021

Query applications based on nested data, the most commonly used form of data representation on the web, especially precise query, is becoming more extensively used. MapReduce, a distributed architecture with parallel computing power, provides a good solution for big data processing. However, in practical application, query requests are usually concurrent, which causes bottlenecks in server processing. To solve this problem, this paper first combines a column storage structure and an inverted index to build index for nested data on MapReduce. On this basis, this paper puts forward an optimization strategy which combines query execution service tree and frequent sub-query trajectory to reduce the response time of frequent queries and further improve the efficiency of multi-user concurrent queries on large scale nested data. Experiments show that this method greatly improves the efficiency of nested data query.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2022년도 춘계학술대회
• /
• pp.665-666
• /
• 2022

미분 진화는 연속 최적화 문제에 대한 효율적인 알고리즘이다. 그러나 대규모 최적화 문제를 해결하기 위해 미분 진화를 적용하면 성능이 빠르게 저하되고 런타임이 기하급수적으로 증가한다. 이 문제를 극복하기 위해 Spark(SparkDECC라고 함)를 기반으로 하는 새로운 협력 공진화 미분 진화를 제안한다. 분할 정복 전략은 SparkDECC에서 사용된다.