• 대한수학회보
• /
• 제39권1호
• /
• pp.175-184
• /
• 2002

A Cellular embedding of a graph G into an orientable surface S can be considered as a cellular decomposition of S into 0-cells, 1-cells and 2-cells and vise versa, in which 0-cells and 1-cells form a graph G and this decomposition of S is called a map in S with underlying graph G. For a map M with underlying graph G, we define a natural rotation on the line graph of the graph G and we introduce the line map for M. we find that genus of the supporting surface of the line map for a map and we give a characterization for the line map to be embedded in the sphere. Moreover we show that the line map for any life of a map M is map-isomorphic to a lift of the line map for M.

• Journal of Communications and Networks
• /
• 제5권1호
• /
• pp.43-54
• /
• 2003

Due to insufficient available bandwidth resources and the continuously growing demand for cellular communication services, the channel assignment problem has become increasingly important. To trace the optimal assignment, several heuristic strategies have been proposed. So far, most of them focus on the small-scale systems containing no more than 25 cells and they use an anachronistic cost model, which does not satisfy the requirements ity. Solving the small-scale channel assignment problems could not be applied into existing large scale cellular networks' practice. This article proposes a decomposition approach to solve the fixed channel assignment problem (FCAP) for large-scale cellular networks through partitioning the whole cellular network into several smaller sub-networks and then designing a sequential branch-and-bound algorithm that is made to solve the FCAP for them sequentially. The key issue of partition is to minimize the dependences of the sub-networks so that the proposed heuristics for solving smaller problems will suffer fewer constraints in searching for better assignments. The proposed algorithms perform well based on experimental results and they were applied to the Taiwan Cellular Cooperation (TCC) in ChungLi city to find better assignments for its network.

• 제어로봇시스템학회논문지
• /
• 제11권9호
• /
• pp.789-794
• /
• 2005

This paper describes an algorithm for minimal turning complete coverage Path planning for cleaning robots. This algorithm divides the whole cleaning area by cellular decomposition, and then provides the path planning among the cells employing a flow network. It also provides specific path planning inside each cell guaranteeing the minimal turning of the robots. The minimal turning of the robots is directly related to the faster motion and energy saving. The proposed algorithm is compared with previous approaches in simulation and the result shows the validity of the algorithm.

• 한국정밀공학회지
• /
• 제26권7호
• /
• pp.73-80
• /
• 2009

This paper describes a path planning algorithm, which is the minimal turning path based on the shape and size of the cell to clean up the whole area with two cleaning robots. Our method divides the whole cleaning area with each cell by cellular decomposition, and then provides some path plans among of the robots to reduce the rate of energy consumption and cleaning time of it. In addition we suggest how to plan between the robots especially when they are cleaning in the same cell. Finally simulation results demonstrate the effectiveness of the algorithm in an unknown area with multiple robots. And then we compare the performance index of two algorithms such as total of turn, total of time.

• 전자공학회논문지B
• /
• 제33B권9호
• /
• pp.37-48
• /
• 1996

In this paper, for the single s-a-E fault detected in a triangular cellular permutation network (TCPN), we propose a method which can tolerate a fault by reconfiguring the netowrk and analyze the possibilities of the reconfiguration. The network is set up through iterative decomposition of a permutation into the right or left coset. For the s-a-E fault of a cell which is to be transpositioned for an increasing order mapping, we cna reconfigure it merely by switching te decomposition scheme from right coset to left coset or vice versa. Also for a decreasing order mapping, we make a detour around the faulty cell. Reconfiguring with the redundant connectivity of a TCPN, we could realize form 17% to 90% of the permutation for the number of inputs from 4 to 40. REconfiguration of the network by exchanging the first input with the last input and the first output with the last output resulted in more than 99% realization of the permutation. Also with the exchange of all inputs and outputs with neighboring cells, we could have 100% realization of the permutation.

• 로봇학회논문지
• /
• 제18권1호
• /
• pp.1-9
• /
• 2023

This paper presents an optimal path planning strategy for aerial searching and surveying of a user-designated area using multiple Unmanned Aerial Vehicles (UAVs). The method is designed to deal with a single unseparated polygonal area, regardless of polygonal convexity. By defining the search area into a set of grids, the algorithm enables UAVs to completely search without leaving unsearched space. The presented strategy consists of two main algorithmic steps: cellular decomposition and path planning stages. The cellular decomposition method divides the area to designate a conflict-free subsearch-space to an individual UAV, while accounting the assigned flight velocity, take-off and landing positions. Then, the path planning strategy forms paths based on every point located in end of each grid row. The first waypoint is chosen as the closest point from the vehicle-starting position, and it recursively updates the nearest endpoint set to generate the shortest path. The path planning policy produces four path candidates by alternating the starting point (left or right edge), and the travel direction (vertical or horizontal). The optimal-selection policy is enforced to maximize the search efficiency, which is time dependent; the policy imposes the total path-length and turning number criteria per candidate. The results demonstrate that the proposed cellular decomposition method improves the search-time efficiency. In addition, the candidate selection enhances the algorithmic efficacy toward further mission time-duration reduction. The method shows robustness against both convex and non-convex shaped search area.

• ETRI Journal
• /
• 제38권4호
• /
• pp.746-756
• /
• 2016

Owing to the intermittent power generation of renewable energy sources (RESs), future wireless cellular networks are required to reliably aggregate power from retailers. In this paper, we propose a distributed power allocation (DPA) scheme for base stations (BSs) powered by retailers with heterogeneous RESs in order to deal with the unreliable power supply (UPS) problem. The goal of the proposed DPA scheme is to maximize our well-defined utility, which consists of power satisfaction and unit power costs including added costs as a non-subscriber, based on linear and quadratic cost models. To determine the optimal amount of DPA, we apply dual decomposition, which separates the master problem into sub-problems. Optimal power allocation from each retailer can be obtained by iteratively coordinating between the BSs and retailers. Finally, through a mathematical analysis, we show that the proposed DPA can overcome the UPS for BSs powered from heterogeneous RESs.

• International journal of advanced smart convergence
• /
• 제8권2호
• /
• pp.39-46
• /
• 2019

Human mobility estimation plays a key factor in a lot of promising applications including location-based recommendation systems, urban planning, and disease outbreak control. We study the human mobility estimation problem in the case where recent locations of a person-of-interest are unknown. Since matrix decomposition is used to perform latent semantic analysis of multi-dimensional data, we propose a human location estimation algorithm based on matrix factorization to reconstruct the human movement patterns through the use of information of persons with correlated movements. Specifically, the optimization problem which minimizes the difference between the reconstructed and actual movement data is first formulated. Then, the gradient descent algorithm is applied to adjust parameters which contribute to reconstructed mobility data. The experiment results show that the proposed framework can be used for the prediction of human location and achieves higher predictive accuracy than a baseline model.

• Elastomers and Composites
• /
• 제36권1호
• /
• pp.52-60
• /
• 2001

발포체의 물성은 발포체의 밀도, 사용된 폴리머의 기계적 물성과 열린 셀(open cell) 함량, 셀 크기, 셀 크기 분포, 셀 형태, 격벽의 두께 등을 포함하는 셀 구조에 의존하며 이러한 발포체의 밀도는 사용된 폴리머의 종류와 가교제의 농도, 발포제의 농도 그리고 가공 기술 및가공 조건 같은 다양한 원료물질과 가교조건에 영향을 받는다. Ethylene vinyl acetate coplymer (EVA) 발포체는 가교 발포체로서 가교속도와 발포제의 분해속도에 의해 발포특성에 영향을 받으며 이에 따라 발포체 물성에도 영향을 미친다. 본 연구에서는 가공 온도인 $155^{\circ}C$에서의 시간에 따른 발포제의 분해 속도 차이와 이에 따른 발포특성과 발포체의 물성에 대한 영향을 평가하였다. 발포제 분해 속도가 보다 느린 경우, 발포제 분해속도가 빠른 경우와 비교하여 낮은 밀도를 보여주었으며, 우수한 충격흡수성을 나타내었고 발포체의 셀 크기는 보다 균일하였다.

• Journal of Ecology and Environment
• /
• 제29권4호
• /
• pp.337-342
• /
• 2006

The total monoterpenoid content of the pine litter layer and the availability of these compounds as inhibitors/stimulators on Polysphondylium violaceum of cellular slime molds were investigated. In order to determine the several monoterpenoids in the natural environment, we examined their concentrations in fresh, senescent, and decaying needles from 3 pine species (Pinus densiflora, P. thunbergii, P. rigida) by litter bag method. Total monoterpenoid content was highest in the fresh needles, but also remained relatively high in senescent needles. The effect of monoterpenoids identified from Pinus plants on the growth of P. violaceum was studied. We tested four concentrations (1, 0.1, 0.01, and $0.001\;{\mu}g/{\mu}L$) of each compound by using a disk volatilization technique. Each compound was treated after germination of spores of P. violaceum. All of the compounds at $1\;{\mu}g/{\mu}L$ concentration had a very strong inhibitory effect on cell growth of P. violaceum. Fenchone at all concentrations, myrcene, verbenone, bornyl acetate, and limonene at low concentrations stimulated the growth of P. violaceum. These results suggest that inhibitory or enhancing effects of selected monoterpenoids depend upon the concentration of the individual compound.