• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1992년도 하계학술대회 논문집 A
• /
• pp.386-390
• /
• 1992

Algorithmic or kinematic singularities are inevitably a introduced if optimality criteria or augmented kinematic equations are used to resolve the redundancy of almost any manipulator with rotary joints. In this paper, a sufficient condition for a singularity-free optimal solution of the kinematic control of a redundant manipulator is derived and, specifically, algorithmic singularities are analyzed for optimality-based methods. A singularity-free space (SFS) to characterize the performance of a secondary task for a redundant manipulator using the sufficient condition for a redundant manipulator is defined. The SFS is a set of regions classified by the loci of configurations satisfying the inflection condition for manipulability measure in the Configuration space. Using SFS, the topological property of the Configuration space and the invertible workspace without singularities are analyzed.

• 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.

• 경영과학
• /
• 제26권3호
• /
• pp.55-65
• /
• 2009

The objective of this paper is to propose an ant colony optimization (ACO) for clustering design in wireless sensor network problem. This proposed ACO approach is designed to deal with the dynamics of the sensor nodes which can be adaptable to topological changes to any network graph in a time. Long communication distances between sensors and a sink in a sensor network can greatly consume the energy of sensors and reduce the lifetime of a network. We can greatly minimize the total communication distance while minimizing the number of cluster heads using proposed ACO. Simulation results show that our proposed method is very efficient to find the best solutions comparing to the optimal solution using CPLEX in 100, 200, and 400 node sensor networks.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.353-357
• /
• 2003

Although it is more and more well accepted that modeling is a help for experimental biology, little is known about how to integrate physiological processes in general. The fact that no general theory exist in biology has big consequences, the most important being the difficulty to integrate biological phenomena. 1 will present a solution for the three dependent following issues: i) in an appropriate theoretical framework, integration consists in coupling models that each describe physiological mechanisms (formalization is a necessary condition to integration); ii) a biological theory with its own concepts leads to unifying principles in biology that are different from and complementary to physical principles; iii) such a formalized theory consists in a representation in terms of functional interactions and a specific formalism(S-Propagator). Hence a biological theory is of a topological and geometrical nature, in contrast to physical theories that are of a geometrical nature. An application to the interpretation of intelligence is proposed, based on the "intelligence"of movement.

• Journal of Computing Science and Engineering
• /
• 제5권3호
• /
• pp.197-209
• /
• 2011

The increasing popularity of graph data, such as social and online communities, has initiated a prolific research area in knowledge discovery and data mining. As more real-world graphs are released publicly, there is growing concern about privacy breaching for the entities involved. An adversary may reveal identities of individuals in a published graph, with the topological structure and/or basic graph properties as background knowledge. Many previous studies addressing such attacks as identity disclosure, however, concentrate on preserving privacy in simple graph data only. In this paper, we consider the identity disclosure problem in weighted graphs. The motivation is that, a weighted graph can introduce much more unique information than its simple version, which makes the disclosure easier. We first formalize a general anonymization model to deal with weight-based attacks. Then two concrete attacks are discussed based on weight properties of a graph, including the sum and the set of adjacent weights for each vertex. We also propose a complete solution for the weight anonymization problem to prevent a graph from both attacks. In addition, we also investigate the impact of the proposed methods on community detection, a very popular application in the graph mining field. Our approaches are efficient and practical, and have been validated by extensive experiments on both synthetic and real-world datasets.

• Journal of Electrochemical Science and Technology
• /
• 제9권3호
• /
• pp.184-194
• /
• 2018

In this paper, we propose a rapid-charging system for the lithium-ion battery (LIB) packs used in electric forklifts. The battery offers three benefits: reduced charge time, prolonged battery life, and increased charging efficiency. A rapid-charging algorithm and DC/DC converter topology are proposed to achieve these benefits. This algorithm is developed using an electrochemical model, which controls the maximum charging current limit depending on the cell voltage and temperature. The experimental use of a selected 18650 LIB cell verified the prolongation of battery life on use of the algorithm. The proposed converter offers the same topological merits as a conventional resonant converter but solves the light-load regulation problem of conventional resonant converters by adopting pulse-width modulation. A 6.6-kW converter and charging algorithm were used with a forklift battery pack to verify this method's operational principles and advantages.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제17권2호
• /
• pp.87-102
• /
• 2013

An n-string tangle is a three dimensional ball with n-strings which are properly embedded in the ball. In early 90's, C. Ernst and D. Sumners first used a tangle to describe a DNA-protein complex. In this model, DNA is represented by a string and protein is represented by a ball. Mu is a protein which binds to DNA at three sites and a DNA-Mu complex is called Mu-transpososome. Knowing the DNA topology within Mu-transpososome is very important to understand DNA transposition by Mu protein. In 2002, Pathania et al. determined that the DNA configuration within the Mu transpososome is three branched and five noded [12]. In 2007, Darcy et al. analyzed this by using mathematical tangle and concluded that the three branched and five noded DNA configuration is the only biologically reasonable solution [4]. In this paper, based on the result of Pathania et al. and Darcy et al., the author determines the DNA topology within the DNA-Mu complex after the whole Mu transposition process. Furthermore, a new experiment is designed which can support the Pathania et al.'s result. The result of this new experiment is predicted through mathematical knot thory.

• 전산구조공학
• /
• 제9권3호
• /
• pp.179-186
• /
• 1996

본 연구에서는 구조체의 위상학적 최적화를 위한 비선형 formulation(NLP)가 개발, 검토되었다. 이 NLP는 multiple-loading하에서 임의의 오브젝티브 함수, 응력, 변위 제약조건들을 쉽게 다룰 수가 있다. 또한 이 NLP는 해석과 최적화 디자인을 동시에 실시함으로써 요소 사이즈가 영으로 접근함에 따른 강성 매트릭스의 singularity를 피할 수 있다. 즉, 평형 방정식을 등제약조건으로 치환함으로써 강성 매트릭스 그 자체나 그의 역매트릭스를 구할 필요도 없어진다. 이 NLP는 multiple-loading conditon하에서 테스트되었으며, 이를 통해 이 NLP가 다양한 제약조건하에서 강력하게 작용함이 입증되었다.

• 전자공학회논문지CI
• /
• 제39권6호
• /
• pp.24-35
• /
• 2002

Maxwell 방정식을 효율적으로 풀기 위해 웨이브렛 행렬 변환(wavelet matrix transformation)과 경계요소법(Boundary Element Method)을 결합하는 방법을 제안하였으며, 2차원 위상변이 마스크(phase- shifting mask) 문제에 적용하였다. 계산 결과를 해석적인 해 및 참고문헌의 결과와 비교함으로써 구현된 모듈의 정확도를 검증하였으며, 제안된 방법이 경계요소법만을 적용한 경우에 비해 연산 시간과 메모리 사용 측면에서 효율적임을 확인하였다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1993년도 Fifth International Fuzzy Systems Association World Congress 93
• /
• pp.1005-1008
• /
• 1993

Supervised learnmg 01 recurrent neural networks (RNNs) is discussed. First, we review the present state of art, featuring their major properties in contrast of those of the multilayer neural networks. Then, we concisely describe one of the most practical learning algorithms, i.e. backpropagation through time. Revising the basic formulation of the learning algorithms, we derive a general formula to solve for the exact solution(s) of the whole connection weights w of RNNs. On this basis we introduce a novel interpretation of the supervised learning. Namely, we define a multidimensional Euclidean space, by assigning the cost function E(w) and every component of w to each coordinate axis. Since E=E(w) turns up as a hyper surface in this space, we refer to the surface as learning surface. We see that topological features of the learning surface are valleys and hills. Finally, after explicating that the numerical procedures of learning are equivalent to descending slopes of the learning surface along the steepest gradient, we show that a minimal value of E(w) is the intersection of curved valleys.