• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.8
• /
• pp.55-64
• /
• 2017

In this paper, we propose and implement an IoT based mobile smart monitoring system in the view point of safety inspection for solar power generation. The main features and contributions of proposed system are as follows. First, the proposed system model can evaluate periodically in the view point of safety inspection the conditions of the system and structure of solar power generation. Second, the proposed system automatically re-processes the measurement data of the system and structure for solar power generation and save it into database. Third, using the re-processed and saved information, the proposed system can provide the monitoring information with webpage form to both administrator and owner of solar power generation system, thus they can measure and confirm directly in the view point of safety inspection the conditions of the solar generation structure without visiting those places. Fourth, the provided web pages for the monitoring of solar power generation can be accessed regardless of the system structures. The performance evaluations of the proposed system show that the proposed monitoring system can save efficiently the data received from the sensors installed in the structure of solar power generation into the data base in the collecting server. And the proposed system can support that both administrator and user of solar power generation system access webpage in real time without considering places by using mobile phone and desktop computer and obtain the information for the conditions of the system and structure of solar power generation with graph forms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1575-1583
• /
• 2008

Wireless sensor network has merit of low-power, low-cost and self-organization network, so there are many researches substituted for existing wire network. As structure reinforcement work need a high accuracy, many sensors are installed in structure and connected with data logger for monitoring. However this wire data logger method takes a long time to install wires and installed wires obstruct to work. Additionally, wire data logger method represent sensor data by only numeric and graph, it is not able to support a rapid decision-making for working. To resolve wiring problem and support decision-making, we designed and implemented the monitoring system based in wireless sensor network. For verifying performance, accuracy and availability, we simulated and tested our system in real field. Consequently, wireless sensor network method is easier to install and deploy than wire data logger method, user is able to monitor instinctively and overall by 3D representation of structure and sensors, and it show not only accuracy but also performance for many sensors.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.1
• /
• pp.5-25
• /
• 2009

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.12
• /
• pp.1272-1277
• /
• 2014

This article describes a path planning algorithm for fixed-wing UAVs when a real terrain should be considered. Nowadays, many UAVs are required to perform mission flights near given terrain for surveillance, reconnaissance, and infiltration, as well as flight altitude of many UAVs are relatively lower than typical manned aerial vehicles. Therefore, real terrain should be considered in path planning algorithms of fixed-wing UAVs. In this research, we have extended a spline-$RRT^*$ algorithm to three-dimensional planner. The spline-$RRT^*$ algorithm is a $RRT^*$ based algorithm, and it takes spline method to extend the tree structure over the workspace to generate smooth paths without any post-processing. Direction continuity of the resulting path is guaranteed via this spline technique, and it is essential factor for the paths of fixed-wing UAVs. The proposed algorithm confirm collision check during the tree structure extension, so that generated path is both geometrically and dynamically feasible in addition to direction continuity. To decrease degrees of freedom of a random configuration, we designed a function assigning directions to nodes of the graph. As a result, it increases the execution speed of the algorithm efficiently. In order to investigate the performance of the proposed planning algorithm, several simulations are performed under real terrain environment. Simulation results show that this proposed algorithm can be utilized effectively to path planning applications considering real terrain.

• Korean Institute of Interior Design Journal
• /
• v.20 no.3
• /
• pp.249-258
• /
• 2011

As the elderly population are rapidly growing, the elderly who needs special care and nursing homes for them are also growing. However, many nursing homes were planned without considering the hierarchial space organization such as division of housing unit and nursing unit based on the cognitive and behavioral characteristics of the elderly or accessibility and supportiveness of the staff. This study was to examine the hierarchial characteristics in space organization of nursing homes by using Space Syntax. The subjects were 8 nursing homes in Busan. First, spaces in nursing homes were divided into five areas based on the literature review. Then the hierarchy of space organization for the access layer and layers of living floors was grasped by using G-graph. The access layer has a tree-type hierarchical structure and high visuality. Also, average depth of the space was 5. Then the full integration was analyzed. Mobile area, such as elevator, hallways, or living rooms has a high accessibility and the middle corridor type has commonly been characterized. The nursing stations were analyzed through the control degree and it was low in three nursing homes such as B, C, and G. The low clarity was showed in B, D, and F. The low clarity means that it is relatively difficult to recognize the whole space organization of nursing home. Even though the hierarchy of their living floors was tree-type structure with a high visuality, they has a type of grouping spaces around hallways and spreading, or a ring type.

• Steel and Composite Structures
• /
• v.23 no.3
• /
• pp.273-283
• /
• 2017

In this paper, it is aimed to present a detail investigation related to structural behavior of laterally unrestrained steel cantilever roof of tribune with slender cross section. The structure is located in Tutak town in $A{\breve{g}}r{{\i}}$ and collapsed on October 25, 2015 at eastern part of Turkey is considered as a case study. This mild sloped roof structure was built from a variable I beam, and supported on steel columns of 5.5 m height covering totally $240m^2$ closed area in plan. The roof of tribune collapsed completely without any indication during first snowfall after construction at midnight a winter day, fortunately before the opening hours. The meteorological records and observations of local persons are combined together to estimate the intensity of snow load in the region and it is compared with the code specified values. Also, the wide/thickness and height/thickness ratios for flange and web are evaluated according to the design codes. Three dimensional finite element model of the existing steel tribune roof is generated considering project drawings and site investigations using commercially available software ANSYS. The displacements, principal stresses and strains along to the cantilever length and column height are given as contour diagrams and graph format. In addition to site investigation, the numerical and analytical works conducted in this study indicate that the unequivocal reasons of the collapse are overloading action of snow load intensity, some mistakes made in the design of steel cantilever beams, insufficient strength and rigidity of the main structural elements, and construction workmanship errors.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.6
• /
• pp.27-36
• /
• 1999

This paper proposes algorithms that design the highly parallel multiple-valued logic circuit of DTG(Directed Tree Graph) to be represented by tree structure relationship between input and output of nodes. The conventional Nakajima's algorithms have some problems so that this paper introduce the concept of mathematical analysis based on tree structure to design optimized locally computable circuit. Using the proposed circuit design algorithms in this paper it is possible to design circuit in that DTG have any node number - not to design by Nakajima's algorithms. Also, making a comparison between the circuit design using Nakajim's algorithms and this paper's, we testify that proposed algorithms in this paper optimizes circuit design all case of DTG. Some examples are shown to demonstrate the usefulness of the circuit design algorithm.

• Journal of The Korean Digital Architecture Interior Association
• /
• v.9 no.3
• /
• pp.95-102
• /
• 2009

An architectural space can be considered a life form that interconnects a number of architectural elements such as the humans who live in it. It is difficult to understand and evaluate the complexity of the interrelation between each element, but there have been various attempts to understand and evaluate this architectural space. The Space Syntax that emerged in 1980s has been studied and used more frequently than other methods. Space Syntax is the space analysis tool that analyzes the physical structure of space and represents it as a graph. Space syntax enables its various applications in space analysis by quantifying each spatial property of a whole structure, analyzing it systemically and objectively based on mathematical logic, and representing the results as a quantitative value. Integration of Space Syntax, a widely used index, reflects human behavior in spatial configuration. Meanwhile, there have been various studies in the field of architectural environmental psychology about the relationships between space and human behavior by applying behavioral science to architectural plan. One of the most widely used one is spatial behavior simulation which uses models and simulates the behavioral characteristics to anticipate practical situations and investigate the behavior related spatial problems. In this study, which focuses on the accessibility of the space syntax model, the usefulness of space will be analyzed through the simulation of human behavior that moves through each space. Furthermore, the validity of index will be verified by displaying several examples and compared with integration in space syntax, which represents the usefulness of space.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.335-343
• /
• 2009

The crossed cube has received great attention because it has equal or superior properties compared to the hypercube that is widely known as a versatile parallel processing system. It has been known that disjoint two copies of a mesh of size $4{\times}2^m$ or disjoint four copies of a mesh of size $8{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion 1 [Dong, Yang, Zhao, and Tang, 2008]. However, it is not known that disjoint multiple copies of a mesh with more than eight rows and columns can be embedded into a crossed cube with dilation 1 and expansion 1. In this paper, we show that disjoint $2^{n-1}$ copies of a mesh of size $2^n{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion 1 where $n{\geq}1$ and $m{\geq}3$. Our result is optimal in terms of dilation and expansion that are important measures of graph embedding. In addition, our result is practically usable in allocating multiple jobs of mesh structure on a parallel computer of crossed cube structure.

• Journal of Digital Convergence
• /
• v.15 no.3
• /
• pp.181-186
• /
• 2017

The system optimization is a technique that changes the structure of the program in order to extract the duplicated modules without changing the source code, reuse of the extracted module. Structure-oriented development and object-oriented development are efficient at crosscutting concern modular, however can't be modular of crosscutting concept. To apply the crosscutting concept in an existing system, there is a need to a extracting technique for distributed system optimization module within the system. This paper proposes a method for extracting the redundant modules in the completed system. The proposed method extracts elements that overlap over a source code analysis to analyze the data dependency and control dependency. The extracted redundant element is used to program dependency analysis for the system optimization. Duplicated dependency analysis result is converted into a control flow graph, it is possible to produce a minimum crosscutting module. The element extracted by dependency analysis proposes a system optimization method which minimizes the duplicated code within system by setting the crosscutting concern module.