• 대한수학회논문집
• /
• 제19권2호
• /
• pp.197-204
• /
• 2004

Every orthomodular lattice satisfying the loop lemma is the direct product of a Boolean algebra and an irreducible path-connected orthomodular lattice.

• 전자공학회논문지SC
• /
• 제45권4호
• /
• pp.68-78
• /
• 2008

연속적인 경로 사이를 부드러운 곡선으로 잇기 위해서 기존의 로봇 제어기들은 일반적으로 연속적인 경로를 시간 축에서 합성하는 방법을 사용해 왔다. 하지만 이런 방법은 다음과 같은 두 가지 단점을 내재하고 있다. 천이 경로의 형태가 연접하게 생성될 수 없다는 점과 천이하는 동안 속력을 제어할 수 없다는 점이 그것이다. 이러한 문제점들을 극복하기 위해서 본 논문은 매끄럽지 않게 연결된 두 경로들을 부드럽게 잇기 위해 곡률이 제한된 새로운 천이 궤적 생성 방법을 제시하고자 한다. 실험 결과는 기존의 방법들보다 천이 궤적이 더 부드럽게 생성되는 것을 보여주며, 또한 보장된 곡률의 제한 수준은 $0.02{\sim}1$임을 보여준다.

• Journal of Ecology and Environment
• /
• 제36권3호
• /
• pp.151-158
• /
• 2013

We estimated phenotypic selection on the height and number of flowering-stalks in a rosette annual Cardamine hirsuta by applying path analysis to the data collected at three natural populations located in central Japan. The path from rosette size was positively connected with the fruit production through the both height and number of flowering-stalks. In the all three populations, the paths from the number of stalks were more strongly connected with the fruit production than from the height of stalks. The paths from the rosette size showed similar magnitude with the number of stalks and the height of stalks. The direct path from rosette size to the fruit production was detected only at one site. These results suggest stronger phenotypic selection on the rosette size through the number of stalks than the height of stalks. The lateral branching rather than increment of individual inflorescence size is the major response to control the fruit production for C. hirsuta growing in a natural habitat.

• Korean Journal of Mathematics
• /
• 제14권1호
• /
• pp.47-55
• /
• 2006

This paper presents an image analysis technique using connected components by applying SPA (shortest path algorithm) from graph theory. Software implementation of Floyd-Warshall transitive matrix labelling method is discussed. Results are also presented.

• Journal of Electrical Engineering and Technology
• /
• 제10권2호
• /
• pp.676-687
• /
• 2015

Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has $G^2$ continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.

• 호남수학학술지
• /
• 제32권3호
• /
• pp.375-387
• /
• 2010

The paper studies an existence problem of a (generalized) universal covering space over a digital wedge with a compatible adjacency. In algebraic topology it is well-known that a connected, locally path connected, semilocally simply connected space has a universal covering space. Unlike this property, in digital covering theory we need to investigate its digital version which remains open.

• 호남수학학술지
• /
• 제24권1호
• /
• pp.75-86
• /
• 2002

A Nielsen number $\bar{N}(f:X-A)$ is a homotopy invariant lower bound for the number of fixed points on X-A where X is a compact connected polyhedron and A is a connected subpolyhedron of X. This number is extended to Nielsen type numbers $\bar{NP_{n}}(f:X-A)$ of least period n and $\bar{N{\phi}_{n}}(f:X-A)$ of the nth iterate on X-A where the subpolyhedron A of a compact connected polyhedron X is no longer path connected.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권5호
• /
• pp.1303-1315
• /
• 2012

In the draft of the IEEE 802.11s standard, a tree topology is established by the proactive tree-building mode of the Hybrid Wireless Mesh Protocol (HWMP). It is used for cases in which the root station (e.g., gateway) is an end point of the majority of the data connections. In the tree topology, the root or central stations (e.g., parent stations) are connected to the other stations (e.g., leaves) that are one level lower than the central station. Such mesh stations are likely to suffer heavily from contention in bottleneck links when the network has a high traffic load. Moreover, the dependence of the network on such stations is a point of vulnerability. A failure of the central station (e.g., a crash or simply going into sleep mode to save energy) can cripple the whole network in the tree topology. This causes performance degradation for end-to-end transmissions. In a connected mesh topology where the stations having two or more radio links between them are connected in such a way that if a failure subsists in any of the links, the other link could provide the redundancy to the network. We propose a scheme to utilize this characteristic by organizing the network into concentric tiers around the root mesh station. The tier structure facilitates path recovery and congestion control. The resulting mode is referred to as Tier-based Proactive Path Selection Mode (TPPSM). The performance of TPPSM is compared with the proactive tree mode of HWMP. Simulation results show that TPPSM has better performance.

• 호남수학학술지
• /
• 제31권3호
• /
• pp.267-278
• /
• 2009

As a survey-type article, the paper reviews the recent results on a (generalized) universal covering space in digital covering theory. The recent paper [19] established the generalized universal (2, k)-covering property which improves the universal (2, k)-covering property of [3]. In algebraic topology it is well-known that a simply connected and locally path connected covering space is a universal covering space. Unlike this property, in digital covering theory we can propose that a generalized universal covering space has its intrinsic feature. This property can be useful in classifying digital covering spaces and in studying a shortest k-path problem in data structure.

• 한국전자통신학회논문지
• /
• 제5권5호
• /
• pp.444-448
• /
• 2010

RCR 네트워크 토폴로지[1]는 짧은 지름, 대칭성 등의 특징을 가지고 있어 병렬컴퓨팅 환경을 구성하기에 적합한 상호접속네트워크의 일종이다. Hu and Cao[2]에 의하여 이 토폴로지 분석에 대한 재검토가 이루어졌으며, 그래프 비연결성, 직경, bisection width 등에 대한 오류가 있음을 지적하였다. 이 논문에서는 RCR 네트워크 토폴로지 특성을 분석하고, [2]의 결과에도 여전히 남아있는 '연결그래프가 되기 위한 조건' 및 직경에 대한 오류를 정정한다. 그리고 RCR 네트워크에서 최단경로를 구하기 위한 알고리즘을 제안한다.