• 한국정보통신설비학회:학술대회논문집
• /
• 2006.08a
• /
• pp.166-169
• /
• 2006

High Frequency에서 회로를 해석할 때 기존의 Full-wave Analysis Method와는 다른 Topological Analysis Method에 기반한 BLT equation을 도입하여 새로운 해석을 시도해본다. 이 해석방법은 기존의 방법과는 다르게 회로를 junction과 node로 구분하여 회로 방정식을 만들어 해석을 하는 새로운 방식이다. 이 논문에서는 간단한 회로를 제작하여 BLT equation과 기존의 Simulation Tool을 사용한 해석과 실제 실험결과와 비교하면서 BLT equation을 검증하고, 실제적인 적용 회로를 선정하여 해석을 시도하였다.

• Steel and Composite Structures
• /
• v.21 no.6
• /
• pp.1389-1410
• /
• 2016

This paper proposes a hybrid of topological derivative-based level set method (LSM) and isogeometric analysis (IGA) for structural topology optimization. In topology optimization a significant drawback of the conventional LSM is that it cannot create new holes in the design domain. In this study, the topological derivative approach is used to create new holes in appropriate places of the design domain, and alleviate the strong dependency of the optimal topology on the initial design. Furthermore, the values of the gradient vector in Hamilton-Jacobi equation in the conventional LSM are replaced with a Delta function. In the topology optimization procedure IGA based on Non-Uniform Rational B-Spline (NURBS) functions is utilized to overcome the drawbacks in the conventional finite element method (FEM) based topology optimization approaches. Several numerical examples are provided to confirm the computational efficiency and robustness of the proposed method in comparison with derivative-based LSM and FEM.

• Journal of the Korean Mathematical Society
• /
• v.57 no.5
• /
• pp.1079-1101
• /
• 2020

This work is concerned with a geometric inverse problem in fluid mechanics. The aim is to reconstruct an unknown obstacle immersed in a Newtonian and incompressible fluid flow from internal data. We assume that the fluid motion is governed by the Stokes-Brinkmann equations in the two dimensional case. We propose a simple and efficient reconstruction method based on the topological sensitivity concept. The geometric inverse problem is reformulated as a topology optimization one minimizing a least-square functional. The existence and stability of the optimization problem solution are discussed. A topological sensitivity analysis is derived with the help of a straightforward approach based on a penalization technique without using the classical truncation method. The theoretical results are exploited for building a non-iterative reconstruction algorithm. The unknown obstacle is reconstructed using a levelset curve of the topological gradient. The accuracy and the robustness of the proposed method are justified by some numerical examples.

• Journal of the Korean Geographical Society
• /
• v.41 no.2 s.113
• /
• pp.188-194
• /
• 2006

Three-dimensional topological data is essential for 3D modeling and application such as emergency management and 3D network analysis. This paper reviewed current 3D topological data model and developed a method to construct 3D topological node-relation data structure from 2D computer aided design (CAD) data. The method needed two steps with medial axis-transformation and topological node-relation algorithms. Using a medial-axis transformation algorithm, the first step is to extract skeleton from wall data that was drawn polygon or double line in a CAD data. The second step is to build a topological node-relation structure by converting rooms to nodes and the relations between rooms to links. So, links represent adjacency and connectivity between nodes (rooms). As a result, with the conversion method 3D topological data for micro-level sub-unit of each building can be easily constructed from CAD data that are commonly used to design a building as a blueprint.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1098-1100
• /
• 2005

The floorplanning problem is an essential design step in VLSI layout design and it is how to place rectangular modules as density as possible. And then, as the DSM advances, the VLSI chip becomes more congested even though more metal layers are used for routing. Usually, a VLSI chip includes several buses. As design increases in complexity, bus routing becomes a heavy task. To ease bus routing and avoid unnecessary iterations in physical design, we need to consider bus planning in early floorplanning stage. In this paper, we propose a floorplanning method for topological constraint consisting of bus constraint and memory constraint. The proposed algorithms based on Genetic Algorithm(GA) is adopted a sequence pair. For selection control, new objective functions are introduced for topological constraint. Studies on floor planning and cell placement have been reported as being applications of GA to the LSI layout problem. However, no studies have ever seen the effect of applying GA in consideration of topological constraint. Experimental results show improvement of bus and memory constraint.

• Proceedings of the KIEE Conference
• /
• 2004.07d
• /
• pp.2450-2452
• /
• 2004

Map building is essential to a mobile robot navigation system. Localization and path planning methods depend on map building strategies. A topological map is commonly constructed using the GVG(Generalized Voronoi Graph). The advantage of the GVG based topological map is compactness. But the GVG method have many difficulties because it consists of collision-free path. In this paper, we proposed an extended map building method, the AVG (Areal Voronoi Graph) based topological map. The AVG based topological map consists of collision-free area. This feature can improve map building, localization and path planning performance.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.6
• /
• pp.492-497
• /
• 2002

Map building is the process of modeling the robot's environment. The map is usually built based on a grid-based or topological approach, which has its own merits and demerits. These two methods, therefore, can be integrated to provide a better way of map building, which compensates for each other's drawbacks. In this paper, a method of building the topological map based on the occupancy grid map through a Voronoi diagram is presented and verified by various simulations. This Voronoi diagram is made by using a labeled Voronoi diagram scheme which is suitable for the occupancy grid maps. It is shown that the Proposed method is efficient and simple fur building a topological map. The simple path-planning problem is simulated and experimented verify validity of the proposed approach.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.527-538
• /
• 2000

We provide sufficient conditions for the monotone convergence of a Chebysheff-Halley-type method or method of tangent hyperbolas in a partially ordered topological space setting. The famous kantorovich theorem on fixed points is used here.

• Communications of the Korean Mathematical Society
• /
• v.19 no.2
• /
• pp.283-291
• /
• 2004

In this paper we show the radial symmetry of topological one-vortex solutions in the Maxwell-Chern-Simons-Higgs Model.

• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.125-137
• /
• 2006

Nowadays, many commercial CAD systems support history-based, constraint-based and feature-based modeling. Unfortunately, most systems fail during the re-evaluation phase when various kind of topological changes occur. This issue is known as "persistent naming" which refers to the problem of identifying entities in an initial parametric model and matching them in the re-evaluated model. Most works in this domain focus on the persistent naming of atomic entities such as vertices, edges or faces. But very few of them consider the persistent naming of aggregates like shells (any set of faces). We propose in this paper a complete framework for identifying and matching any kind of entities based on their underlying topology, and particularly shells. The identifying method is based on the invariant structure of each class of form features (a hierarchical structure of shells) and on its topological evolution (an historical structure of faces). The matching method compares the initial and the re-evaluated topological histories, and computes two measures of topological similarity between any couple of entities occurring in both models. The naming and matching method has been implemented and integrated in a prototype of commercial CAD Software (Topsolid).