• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2001년도 Proceedings ICPE 01 2001 International Conference on Power Electronics
• /
• pp.266-270
• /
• 2001

This paper presents a novel topological prototype of voltage source series quasi-resonant zero current soft-switching pulse frequency modulated dc-dc power converter circuit using IGBTs which incorporates a high-frequency flyback transformer link. Its steady-state operating principle is described on the basis of simulation analysis, along with the open loop controlled power regulation characteristics of the multi-functional coupled inductors linked dc-dc power converter operating under a principle of zero current soft switching commutation.

• 천문학회보
• /
• 제38권2호
• /
• pp.56.2-56.2
• /
• 2013

We study the three-dimensional genus topology of large-scale structure using the CMASS Data Release 11 sample of the SDSS-III Baryon Oscillation Spectroscopic Survey (BOSS). The CMASS sample yields a genus curve that is characteristic of one produced by Gaussian random-phase initial conditions. The data thus supports the standard model of inflation where random quantum fluctuations in the early universe produced Gaussian random-phase initial conditions. Modest deviations in the observed genus from random phase are as expected from the nonlinear evolution of structure. We construct mock SDSS CMASS surveys along the past light cone from the Horizon Run 3 (HR3) N-body simulations, where gravitationally bound dark matter subhalos are identified as the sites of galaxy formation. We study the genus topology of the HR3 mock surveys with the same geometry and sampling density as the observational sample, and the observed genus topology to be consistent with LCDM as simulated by the HR3 mock samples.

• 한국전산유체공학회지
• /
• 제13권1호
• /
• pp.14-20
• /
• 2008

The flow characteristics around a rudder in open water condition is analyzed by the computational method. Reynolds averaged Navier-Stoke's equation is utilized for the computation. The computational hydrodynamic force coefficients are verified through comparing with the experimental results. The information of these flow characteristics is necessary to predict cavitation and maneuvering performances, to estimate steering gear capacitance, and to get the bending moment which is useful for the structural analysis. The pressure distribution, the three-dimensional flow separation, and the tip vortices are investigated. The pattern of the three-dimensional flow separation is analyzed utilizing a topological rule. The tip vortices are also investigated through a visualization technique.

• 한국정밀공학회지
• /
• 제22권12호
• /
• pp.141-148
• /
• 2005

When one opens the door of a microwave oven during operation, microwave might leak through the clearance of the door. Present research has been motivated by the need to reduce the possible clearance by enhancing torsional stiffness of the door of the microwave oven. Static deformation of the door frame of the oven is analyzed under a door-opening force. On the basis of the topological optimization, the right flange of the door frame is shown to need reinforcing. Several types of reinforcing brackets weldable to the right flange is proposed, and their effects to the stiffness of the door frame are compared and evaluated.

• 한국멀티미디어학회논문지
• /
• 제17권6호
• /
• pp.725-732
• /
• 2014

The Pancake graph is node symmetric and useful interconnection network in the field of data sorting algorithm. The Half Pancake graph is a new interconnection network that reduces the degree of the Pancake graph by approximately half and improves the network cost of the Pancake graph. In this paper, we analyze topological properties of the Half Pancake graph $HP_n$. Fist, we prove that $HP_n$ has maximally fault tolerance and recursive scalability. In addition, we show that in $HP_n$, there are isomorphic graphs of low-dimensional $HP_n$. Also, we propose that the Bubblesort $B_n$ can be embedded into Half Pancake $HP_n$ with dilation 5, expansion 1. These results mean that various algorithms designed for the Pancake graph and the Bubble sort graph can be executed on $HP_n$ efficiently.

• 전자공학회논문지C
• /
• 제34C권7호
• /
• pp.82-91
• /
• 1997

In this paper, we analyze the dynamics of langevine competitive learning neural network based on its fokker-plank equation. From the viewpont of the stochastic differential equation (SDE), langevine competitive learning equation is one of langevine stochastic differential equation and has the diffusin equation on the topological space (.ohm., F, P) with probability measure. We derive the fokker-plank equation from the proposed algorithm and prove by introducing a infinitestimal operator for markov semigroups, that the weight vector in the particular simplex can converge to the globally optimal point under the condition of some convex or pseudo-convex performance measure function. Experimental resutls for pattern recognition of the remote sensing data indicate the superiority of langevine competitive learning neural network in comparison to the conventional competitive learning neural network.

• Membrane and Water Treatment
• /
• 제1권3호
• /
• pp.181-192
• /
• 2010

A linear quantitative structure-property relationship (QSPR) model is presented for the prediction of rejection in permeation through membrane. The model was produced by using the multiple linear regression (MLR) technique on the database consisting of retention data of 25 pesticides in 4 different membrane separation experiments. Among the 3224 different physicochemical, topological and structural descriptors that were considered as inputs to the model only 50 were selected using several criteria of elimination. The physical meaning of chosen descriptor is discussed in detail. The accuracy of the proposed MLR models is illustrated using the following evaluation techniques: leave-one-out cross validation procedure, leave-many-out cross validation procedure and Y-randomization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권5호
• /
• pp.1069-1084
• /
• 2011

This paper considers an optimal base station clustering problem for designing a mobile (wireless) communication network. For a given network with a set of nodes (base stations), the problem is to optimally partition the set of nodes into subsets (each called a cluster) such that the associated inter-cluster traffic is minimized under certain topological constraints and cluster capacity constraints. In the problem analysis, the problem is formulated as an integer programming problem. The integer programming problem is then transformed into a binary integer programming problem, for which the associated linear programming relaxation is solved in a column generation approach assisted by a branch-and-bound procedure. For the column generation, both a heuristic algorithm and a valid inequality approach are exploited. Various numerical examples are solved to evaluate the effectiveness of the LP (Linear Programming) based branch-and-bound algorithm.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 제39회 하계학술대회
• /
• pp.623-624
• /
• 2008

We present a level set method for numerical shape optimization of electromagnetic systems. The level set method does not only lead to efficient computational schemes, but also is able to handle topological changes such as merging, splitting and even disappearing of connected components. The velocity field on boundaries is obtained by a shape derivative of continuum sensitivity analysis using the material derivative concept and an adjoint variable technique. Two numerical results of dielectric optimization between electrodes showed that the level set method is feasible and effective in solving shape optimization problems of electromagnetic systems.

• 대한산업공학회지
• /
• 제23권1호
• /
• pp.215-222
• /
• 1997

This paper deals with the problem of generating a uniform tetrahedral mesh which fills a 3-D space with the tetrahedra which are close to the equilateral tetrahedra as possible. This problem is particularly interesting in finite element modeling where a fat triangulation minimizes the error of an analysis. Fat triangulation is defined as a scheme for generating an equilateral triangulation as possible in a given dimension. In finite element modeling, there are many algorithms for generating a mesh in 2-D and 3-D. One of the difficulties in generating a mesh in 3-D is that a 3-D object can not be filled with uniform equilateral tetrahedra only regardless of the shape of the boundary. Fat triangulation in 3-D has been proved to be the one which fills a 3-D space with the tetrahedra which are close to the equilateral as possible. Topological and geometrical properties of the fat triangulation and its application to meshing algorithm are investigated.