• Journal of The Korea Institute of Healthcare Architecture
• /
• v.10 no.1
• /
• pp.29-38
• /
• 2004

The purpose of this study is to analyze the air ventilation system in apartment houses focused on the air circulation and pilotis. The air ventilation system is used with the data which were obtained by the environmental health, urban climate, air pollution, ventilation path. The architectural element was pilotis concept connected with piloti ratio, piloti position and piloti type. The summaries of this study were as follows; 1) the well-being apartment concept, 2) the heat island phenomenon, 3) the oxygen density of air, 4) the definition of ventilation path, 5) the pilotis connected with residential environment improvement. In addition, the detailded case study to the air ventilation system in apartment houses be needed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.4
• /
• pp.579-588
• /
• 1996

The purpose of this paper is to develop a method of Collision-Free Path Planning (CFPP) for an articulated robot. First, the configuration of the robot is built by a set of robot joint angles derived from robot inverse kinematics. The joint space, that is made of the joint angle set, forms a Configuration space (Cspcce). Obstacles in the robot workcell are also transformed into the Cobstacles using slice projection method. Actually the Cobstacles means the configurations of the robot causing collision with obstacles. Secondly, a connected graph, a kind of roadmap, is constructed by the free configurations in the Cspace, where the free configurations are randomly sampled from a free Cspace immune from the collision. Thirdly, robot paths are optimally determinant in the connected graph. A path searching algorithm based on $A^*$ is employed in determining the paths. Finally, the whole procedures for the CFPP method are shown for a proper articulated robot as an illustrative example.

• Kyungpook Mathematical Journal
• /
• v.51 no.3
• /
• pp.293-300
• /
• 2011

In this paper, we obtain that the space $\mathcal{W}_2$ of minimally supported frequency wavelets, the supports of whose Fourier transforms consist of two intervals, is path-connected.

• ETRI Journal
• /
• v.42 no.1
• /
• pp.7-16
• /
• 2020

Assuming omnidirectional antenna reception, the ITU-R recently developed a new propagation model on building entry loss (BEL) for 5G millimeter-wave frequency sharing and compatibility studies, which is a simplified outdoor-to-indoor path loss model. Considering the utilization of high-gain narrow-beamwidth beamforming, the omnidirectional-based ITU-R BEL model may not be appropriate to predict propagation characteristics for directional beamforming scenarios. This paper studies the effects of beamwidth on the ITU-R BEL model. This study is based on field measurements collected with four different beamwidth antennas: omnidirectional, 10° horn, 30° horn, and 60° horn. The measurement campaigns were conducted at two types of building sites: traditional and thermally efficient buildings. These sites, as well as the measurement scenarios, were carefully chosen to comply with the ITU-R BEL measurement guidelines and the ITU-R building types. We observed the importance of accurate beam alignment from the BEL variation range. We were able to quantify the beamwidth dependency by fitting to a model that is inversely proportional to the beamwidth.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.2079-2082
• /
• 2002

An interconnection network is called hamiltonian-connected if there exists a hamiltonian path joining every pair of nodes. We consider the problem of adding edges to a mesh to make it hamiltonian- connected. We show that at least two edges are necessary for the problem. Also, we present the method to add two edges to a mesh so that the resulting network is hamiltonian-connected.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.643-651
• /
• 2005

In the first part of this paper we investigate several statements concerning infinite maximal planar graphs which are equivalent in finite case. In the second one, for a given induced $\theta$-path (a finite induced path whose endvertices are adjacent to a vertex of infinite degree) in a 4-connected VAP-free maximal planar graph containing a vertex of infinite degree, a new $\theta$-path is constructed such that the resulting fan is tight.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.723-728
• /
• 1999

In this paper, we designed a Circular Path Built-In Self Test circuit and embedded it into a simple 8-bit microprocessor. Register cells of the microprocessor have been modified into Circular Path register cells and each register cells have been connected to form a scan chain. A BIST controller has been designed for controlling BIST operations and its operation has been verified through simulation. The BIST circuit described in this paper has increased size overhead of the microprocessor by 29.8% and delay time in the longest delay path from clock input to output by 2.9㎱.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.896-899
• /
• 1996

A new algorithm for planning a collision free path is developed based on linear parametric curve. A collision-free path is viewed as a connected space curve in which the path consists of two straight curve connecting start to target point. A single intermediate connection point is considered in this paper and is used to manipulate the shape of path by organizing the control point in polar coordinate (.theta.,.rho.). The algorithm checks interference with obstacles, defined as GM (Geometry Mapping), and maps obstacles in Euclidean Space into images in CPS (Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The clear area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidean Space. Any points from the clear area of CPS is a candidate for a collision-free path. A simulation of GM for number of cases are carried out and results are presented including mapped images of GM and performances of algorithm.

• Journal of the Korean Mathematical Society
• /
• v.42 no.4
• /
• pp.847-856
• /
• 2005

M. Junger, G. Reinelt, and W. R. Pulleyblank asked the following questions ([2]). (1) Is it true that every simple planar 2-edge connected bipartite graph has a 3-partition in which each component consists of the edge set of a simple path? (2) Does every simple planar 2-edge connected graph have a 3-partition in which every component consists of the edge set of simple paths and triangles? The purpose of this paper is to provide a positive answer to the second question for simple outerplanar 2-vertex connected graphs and a positive answer to the first question for simple planar 2-edge connected bipartite graphs one set of whose bipartition has at most 4 vertices.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.73-77
• /
• 2016

This paper deals with the network reliability problem that decides the communication line between main two districts while the k districts were destroyed in military communication network that the n communication lines are connected in m districts. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with O(n) linear time complexity to solve the optimal solution for this problem. This paper suggests the flow path algorithm (FPA) and level path algorithm (LPA). The FPA is to search the maximum number of distinct paths between two districts. The LPA is to construct the levels and delete the unnecessary nodes and edges. The proposed algorithm can be get the same optimal solution as LP for experimental data.