• 대한수학회보
• /
• 제49권2호
• /
• pp.435-443
• /
• 2012

The Yamabe invariant is a topological invariant of a smooth closed manifold, which contains information about possible scalar curvature on it. It is well-known that a product manifold $T^m{\times}B$ where $T^m$ is the m-dimensional torus, and B is a closed spin manifold with nonzero $\^{A}$-genus has zero Yamabe invariant. We generalize this to various T-structured manifolds, for example $T^m$-bundles over such B whose transition functions take values in Sp(m, $\mathbb{Z}$) (or Sp(m - 1, $\mathbb{Z}$) ${\oplus}\;{{\pm}1}$ for odd m).

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.85-92
• /
• 2006

In this paper, we study a wireless cellular network design problem. It consists of selecting the location of the base station controllers and mobile service switching centres, selecting their types, designing the network into a tree-topology, and selecting the link types, while considering the location and the demand of base transceiver stations. We propose a constraint programming model and develop a heuristic combining local search and constraint programming techniques to find very good solutions in a reasonable amount of time for this category of problem. Numerical results show that our approach, on average, improves the results from the literature.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
• /
• pp.184-186
• /
• 2006

We propose a new method for shortest path planning of mobile robots. The topological information of the graph is obtained by thinning method to generate the collision-free path of robot. And the travelling path is determined through hierarchical planning stages. The first stage generates an initial path by use of Dijkstra's algorithm. The second stage then generates the final path by use of dynamic programming (DP). The DP adjusts the intial path to reduce the total travelling distance of robot. Simulation results are presented to verify the performance of the proposed method.

• 대한전자공학회논문지
• /
• 제10권2호
• /
• pp.23-35
• /
• 1973

ECAP을 사용하여 직류, 교류, 과도현상에 대한 회로해석을 논하였으며 2단 가청주파 증폭기의 저주파 및 고주파 영역에서의 주파수 특성을 ECAP방식을 사용하여 해석하였다. 또한 근사식과 실험을 통하여 전류, 전압의 이득을 구하여 콤퓨터에 의한 값과 비교하여 본 결과 잘 일치함을 보였다.

• 전자공학회논문지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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.1037-1038
• /
• 2008

Since the characters are not clear always due to lighting conditions, sometimes only a part of the characters are detected and the boundary of the number plate is not completely shown. To solve this problem, this paper presents a new efficient algorithm for segmenting the number plate using the topological relationship among the characters in the number plate and its outer contour. The boundary of the number plate is estimated using the detected characters and detected by testing the connectivity of the vertical and horizontal edges. The superior performance of the proposed algorithm has been proved by the experiments.

• ETRI Journal
• /
• 제31권1호
• /
• pp.31-41
• /
• 2009

Optical burst switching is a promising switching paradigm for the next IP-over-optical network backbones. However, its burst loss performance is greatly affected by burst contention. Several methods have been proposed to address this problem, some of them requiring the network to be flooded by frequent state dissemination signaling messages. In this work, we present a traffic engineering approach for path selection with the objective of minimizing contention using only topological information. The main idea is to balance the traffic across the network to reduce congestion without incurring link state dissemination protocol penalties. We propose and evaluate two path selection strategies that clearly outperform shortest path routing. The proposed path selection strategies can be used in combination with other contention resolution methods to achieve higher levels of performance and support the network reaching stability when it is pushed under stringent working conditions. Results show that the network connectivity is an important parameter to consider.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 춘계학술대회 논문집
• /
• pp.400-404
• /
• 1997

This paper presents spatial relationshaps and engineering features for the feature based modeling of Sheet Metal Weld Assemblies (SMWA) that are made of sheet metal components through are welding processes. Spatial relationships in ProMod-S, a sheet metal product modeler,are further extended for the SMWA modeling. Some spatial relationships for special weld joint types are newly introduced. The geometrical and topological relations between spatial reationship, mating features, and assembly features are defined. Finally, assembly data stucturess for the product modeling of SMWA are proposed. They are an engineering relation to represent the constraints between component features, and a mating bond to integrate component design information.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.1089-1092
• /
• 1999

Applications using 3D models are increasing recently. Since 3D polygonal models are structured by a triangular mesh, the coding of polygonal models in strips of triangles is an efficient way of representing the data. These strips may be very long, and may take a long time to render or transmit. If the triangle strips are partitioned, it may be possible to perform more efficient data transmission in an error-prone environment and to display the 3D model progressively. In this paper, we devised the Component Based Data Partitioning (CODAP) which is based on Topological Surgery (TS). In order to support the error resilience and the progressively build-up rendering, we partition the connectivity, geometry, and properties of a 3D polygonal model. Each partitioned component is independently encoded and resynchronization between partitioned components is done.

• Genomics & Informatics
• /
• 제6권2호
• /
• pp.68-71
• /
• 2008

The static approach of representing metabolic pathway diagrams offers no flexibility. Thus, many systems adopt automatic graph layout techniques to visualize the topological architecture of pathways. There are weaknesses, however, because automatically drawn figures are generally difficult to understand. The problem becomes even more serious when we attempt to visualize all of the information in a single, big picture, which usually results in a confusing diagram. To provide a partial solution to this thorny issue, we propose J2dpathway, a metabolic pathway atlas viewer that has node-abstracting features.