• Journal of the Korean Institute of Landscape Architecture
• /
• v.34 no.4 s.117
• /
• pp.18-36
• /
• 2006

The purpose of this research was to establish a green-networks from the perfective of landscape ecology in order to improve the function of urban green spaces. The study site was Dalsu-Gu in Daegu City. This research consisted of three phases. In the first phase, field surveys were carried out in order to understand existing distribution pattern of green spaces in the study site. 533 green spaces surveyed in the first phase were classified into 7 patterns and 24 types. The total area of the green spaces in Dalsu-gu was 3,329ha. Specifically the area of the 'urban nature parks' type was 57.49% of the total area of green spaces in Dalsu-gu, and it was expected that 'urban nature parks' type can play important roles in the green-networks in Dalsu-gu. Two analysis with green spaces in 9 types including 'urban nature parks', 'rivers' and 'neighborhood parks' were performed to establish a basic network frame of the green-networks. In the second phase, 'mutual connectivity analysis' and 'mutual matrix analysis' were performed to select core green spaces of a green-networks using 'areas of each green space and a distance between each space' and 'a rate of green spaces and a rate of water permeable pavement'. The results of the second phase indicated that, in mutual connectivity analysis, large green spaces apart from each other were evaluated as having higher mutual connectivity than small green spaces near to each other. In mutual matrix analysis, the green spaces with higher mutual connectivity and the small green spaces near to each other were evaluated as having better mutual matrix. In the last phase, we structured a basic frame of the green-networks in Dalsu-Gu. The results suggested that the basic frame of the green-networks in Dalsu-Gu was composed on four green-network axes and its shape mirrored a cruciform(+) of northwest${\longleftrightarrow}$southeast directions and southwest${\longleftrightarrow}$northeast directions, The Duryu neighborhood park is at the central point of this green-networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.1009-1016
• /
• 2015

In this paper, we propose EPCM(Efficient Prediction-based Context-awareness Matrix) algorithm analyzing connectivity by predicting cluster's context data such as velocity and direction. In the existing DTN, unrestricted relay node selection causes an increase of delay and packet loss. The overhead is occurred by limited storage and capability. Therefore, we propose the EPCM algorithm analyzing predicted context data using context matrix and adaptive revision weight, and selecting relay node by considering connectivity between cluster and base station. The proposed algorithm saves context data to the context matrix and analyzes context according to variation and predicts context data after revision from adaptive revision weight. From the simulation results, the EPCM algorithm provides the high packet delivery ratio by selecting relay node according to predicted context data matrix.

• Journal of Digital Convergence
• /
• v.1 no.1
• /
• pp.147-164
• /
• 2003

The use of electronic mail and messenger software tools has been increased rapidly over a decade. Compared to the variety of research related to the relationship between personal psychological traits and communication modes, effects of human psychology on online activities have only recently become a focus of interest. This research analyzed the relationship between personal psychological type and online connectivity. We employed network analysis methodology and collected and analyzed data from 146 subjects. Significant differences in network measures were found among groups with different psychological style. Findings of the research can provide several implications for managerial activities regarding social connectivity.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.531-538
• /
• 2008

With the dynamic and mobile nature of ad hoc networks, links may fail due to topology changes. So, a major challenge in ad hoc network is dynamically to search paths from a source to destination with an efficient routing method, which is an important issue for delay-sensitive real-time application. The main concerns of graph theory in communications are finding connectivity and searching paths using given nodes. A topology of the nodes in ad hoc networks can be modeled as an adjacency matrix. In this paper, based on this adjacency matrix, we propose new path search algorithms using a sequence of matrix calculation. The proposed algorithms can search paths from a destination to a source using connectivity matrix. Two matrix-based algorithms for two different purposes are proposed. Matrix-Based Backward Path Search(MBBS) algorithm is designed for shortest path discovery and Matrix-Based Backward Multipath Search(MBBMS) algorithm is for multipath search.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1C
• /
• pp.14-19
• /
• 2006

The high encoding complexity of LDPC codes can be solved by designing structured parity-check matrix. If the parity-check matrix of LDPC codes is composed of same type of blocks, decoder implementation can be simple, this structure allow structured decoding and required memory for storing the parity-check matrix can be reduced largely. In this parer, we propose a construction algorithm for short block length structured LDPC codes based on girth condition, PEG algorithm and variable node connectivity. The code designed by this algorithm shows similar performance to other codes without structured constraint in low SNR and better performance in high SNR than those by simulation

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.1
• /
• pp.197-205
• /
• 2007

We have proposed a novel line detection method based on the estimated probability density function of gradient directions of edges. By estimating peaks of the density function, we determine groups of edges that have the same gradient direction. For edges in the same groups, we detect lines that correspond to peaks of the connectivity weighted distribution of the distances from the origin. In the experiments using the Data Matrix barcode images and LCD images, the proposed method showed better performance than conventional Methods in terms of the processing speed and accuracy.

• Journal of Applied and Pure Mathematics
• /
• v.5 no.3_4
• /
• pp.255-263
• /
• 2023

In general, the rigidity problem of braced rectangular frameworks is determined by the connectivity of the bipartite graph induced by given rectangular framework. In this paper, we study how to solve the rigidity problem of the braced rectangular framework using the Laplacian matrix of the matrix induced by a braced rectangular framework.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1865-1867
• /
• 2007

We propse a novel corner detection algorithm for locating 2D Data Matrix barcode in an image. The proposed method accumulates weight for each cross point defined by every combination of edge points in the image, and detects the corner point of the barcode L-pattern by determining the location of the highest accumulated weight. By designing the weight considering the connectivity of two lines around the cross point, we were able to detect the corner of L-pattern even for the cases that the lines of L-patterns are short. In the experiments, the proposed method showed improved performance compared with the conventional Hough transform based method in terms of detectability and computation time.

• Proceedings of the IEEK Conference
• /
• 2003.07c
• /
• pp.2705-2708
• /
• 2003

In this paper, we propose a method that applies matrix decomposition technique to the connection of actuator capabilities of each robot to object acceleration limits for multiple cooperative robot systems. The robot systems under consideration are composed of several robot manipulators and each robot contacts a single object to carry the object while satisfying the constraints described in kinematics as well as dynamics. By manipulating kinematic and dynamic equations of both robots and objects, we at first derive a matrix relating joint torques with object acceleration, manipulate the null space of the matrix, and then we decompose the matrix into three parts representing indeterminancy, connectivity, and redundancy. With the decomposed matrix we derive the boundaries of object accelerations from given joint actuators. To show the validity of the proposed method some examples are given in which the results can be expected by intuitive observation.

• Communications of the Korean Mathematical Society
• /
• v.11 no.4
• /
• pp.1159-1174
• /
• 1996

The spectrum of the Laplacian matrix of a graph gives an information of the structure of the graph. For example, the product of non-zero eigenvalues of the characteristic polynomial of the Laplacian matrix of a graph with n vertices is n times of the number of spanning trees of that graph. The characteristic polynomial of the Laplacian matrix of a graph tells us the number of spanning trees and the connectivity of given graph. in this paper, we compute the characteristic polynomial of the Laplacian matrix of a graph bundle when its voltage lie in an abelian subgroup of the full automorphism group of the fibre; in particular, the automorphism group of the fibre is abelian. Also we study a relation between the characteristic polynomial of the Laplacian matrix of a graph G and that of the Laplacian matrix of a graph bundle over G. Some applications are also discussed.