• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.113-118
• /
• 2005

Softswitch is the core BcN equipment which voice and multimedia switching based on the IP Technologies. It is designed to replace the Class 5(local Exchange) and Class 4(Toll Exchange) switch based on the circuit wired and wireless switching network technologies. Softswitch gets its name because typically it is a software based solution implemented on general purpose computers/servers. While the traditional PSTN switches are rely on dedicated facilities for T and S inter-connection and are designed primarily for voice communications. Packet based Softswitch is divided the control of call and bearer, very different from Public telephone network. Sometimes Call Agent or Media Gateway Controller, a key component in the VoIP solution, is also called Softswitch. This paper will suggest the software architecture of softswitch for performance in call processing part, also suggest the session management model to cover call setup latency.

• 산업기술연구
• /
• 제17권
• /
• pp.43-50
• /
• 1997

Local administration is closely related with intention of residents. Especially, a plan item is closely related with life of residents. Therefore, it has to be logical and objective solution for opinion convergence. Decision of opinion has to be in a triangular position standard and stand in a trio of criteria in standard. But, opinion convergence of residents very difficult. Recently, the technique of GIS presents method for oponion convergence with logical and objective and scientifically solution. And, this study present method for decision of intention to a complex element with GRID and NETWORK techniques of GIS. This study present optimun site of constructure with the GIS technique in consideration of a side face of transportation, technical, social economy and environments.

• 한국컴퓨터정보학회논문지
• /
• 제22권9호
• /
• pp.9-16
• /
• 2017

The course timetabling problem is a problem assigning a set of subjects to the given classrooms and different timeslots, while satisfying various hard constraints and soft constraints. This problem is defined as a constraint satisfaction optimization problem and is known as an NP-complete problem. Various methods has been proposed such as integer programming, constraint programming and local search methods to solve a variety of course timetabling problems. In this paper, we propose an iterative improvement search method to solve the problem based on constraint programming. First, an initial solution satisfying all the hard constraints is obtained by constraint programming, and then the solution is repeatedly improved using constraint programming again by adding new constraints to improve the quality of the soft constraints. Through experimental results, we confirmed that the proposed method can find far better solutions in a shorter time than the manual method.

• Journal of Advanced Marine Engineering and Technology
• /
• 제32권8호
• /
• pp.1215-1220
• /
• 2008

To obtain the shape of the free surface more accurately, computations are carried out by a finite volume method using unstructured meshes and an interface capturing method. Free-surface flow, which is very important in the fields of ship and marine engineering, is numerically simulated for flows of both water and air. Control volumes are used with an arbitrary number of faces and allows a local mesh refinement. The integration is of second order, with a midpoint rule integration and linear interpolation. The method is fully implicit and uses quadratic interpolation. The solution method of pressure-correction type solves sequentially equations of momentum, continuity, conservation, and two-equations turbulence model. Comparison are quantitatively made between the computation and experiment in order to confirm the solution method.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.234-239
• /
• 1993

Most of the control problem is for the redundant manipulators use the pseudo-inverse control, thit is, the redundancy is resolved by the pseudo-inverse of the Jacobian matrix and then the controller is designed based on this resolution. However, this pseudo-inverse control has some problems when the redundant robot repeats the cyclic tasks. This is because the pseudo-inverse resolution is a local solution that generates the different configurations of the robot arm for the same hand position. Therefore it is necessary to find the global solution that maintains the optimal configuration of the robot for the repetitive tasks. In this paper, we want to propose a redundancy resolution method by the optimal theory that uses the calculus of variation. The problem formulations are : first to convert the optimal resolution problem to an optimal control problem and then to resolve the redundancy using the necessary conditions of optimal control.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 추계학술대회 논문집 전력기술부문
• /
• pp.261-263
• /
• 2008

In power systems operation, state estimation takes an important role in security control. For the state estimation problem, the weighted least squares(WLS) method and the fast decoupled method have been widely used at present. But these algorithms have disadvantage of converging local optimal solution. In these days, a modern heuristic optimization method such as Particle Swarm Optimization(PSO), are introduced to overcome the problems of classical optimization. In this paper, we proposed particle swarm optimization (PSO) to search an optimal solution of state estimation in power systems. To demonstrate the usefulness of the proposed method, PSO algorithm was tested in the IEEE-57 bus systems. From the simulation results, we can find that the PSO algorithm is applicable for power system state estimation.

• 대한산업공학회지
• /
• 제23권3호
• /
• pp.451-467
• /
• 1997

Tabu search (TS) is a useful strategy that has been successfully applied to a number of complex combinatorial optimization problems. By guiding the search using flexible memory processes and accepting disimproved solutions at some iterations, TS helps alleviate the risk of being trapped at a local optimum. In this article, we propose TS-based heuristics for solving a class of clustering problems, and compare the relative performances of the TS-based heuristic and the simulated annealing (SA) algorithm. Computational experiments show that the TS-based heuristic with a long-term memory offers a higher possibility of finding a better solution, while the TS-based heuristic without a long-term memory performs better than the others in terms of the combined measure of solution quality and computing effort required.

• 대한산업공학회지
• /
• 제34권1호
• /
• pp.32-41
• /
• 2008

This paper studies a joint EOQ and EPQ model in which a stationary demand can be satisfied by recycled products as well as newly purchased products. The model assumes that a fixed quantity of the used products are collected from customers and later recovered for reuse. The recovered products are regarded as perfectly new ones. We also assume that the number of orders for newly purchasing items and the number of recovery setups in a cycle can be mutually independent integers. Under these assumptions, we develop an optimization model obtaining the economic order quantity for newly procured products, the optimal lot size for the recovery process, and the sequence of the orders and the setups, simultaneously. And then a simple solution procedure to find a local optimal control parameter set is proposed. To validate the model and the solution procedure, finally, some computational experiments are presented.

• 대한산업공학회지
• /
• 제24권1호
• /
• pp.77-93
• /
• 1998

It is discussed how to locate idle vehicles of AGVS on unidirectional guide paths. The problem is modeled as a median location problem on a cyclic network. The characteristics of the optimal location are analyzed and some useful properties are suggested to reduce the solution space. Based on the properties found, several special types of networks - a pure single-loop type, the loop type with a single branching intersection and the loop type with local branching node - are also analyzed as well as the general cyclic network. In each case of the networks, a solution procedure is suggested. Some numerical examples are provided to illustrate the algorithms developed.

• 한국국방경영분석학회지
• /
• 제17권1호
• /
• pp.146-158
• /
• 1991

In this paper, we deal with the TSP (Traveling Salesperson Problem) which is well-known as NP-complete optimization problem. the TSP is applicable to network routing. task allocation or scheduling. and VLSI wiring. Well known numerical methods such as Newton's Metheod. Gradient Method, Simplex Method can not be applicable to find Global Solution but the just give Local Minimum. Exhaustive search over all cyclic paths requires 1/2 (n-1) ! paths, so there is no computer to solve more than 15-cities. Heuristic algorithm. Simulated Annealing, Artificial Neural Net method can be used to get reasonable near-optimum with polynomial execution time on problem size. Therefore, we are able to select the fittest one according to the environment of problem domain. Three methods are simulated about symmetric TSP with 30 and 50-city samples and are compared by means of the quality of solution and the running time.