• Korean Institute of Interior Design Journal
• /
• v.14 no.3 s.50
• /
• pp.64-72
• /
• 2005

The purpose of this study is to propose a topological design principles and to analyze the space of digital architecture applying topological invariant expressive characteristics. As this study is based on topology as a science of true world's pattern, we intented to explain the concepts and provide some methods of low-level and hyperspace topological invariant Properties. Four major aspects are discussed. Those are connection theory, boundary concept, homotopy group, knot Pattern theory as topological invariant properties. Then we intented to make understand topological characteristics of the Algorithms, luring machine, cellular automata, string theory, membrane, DNA and supramolecular chemistry. In fine, the topological invariant properties of the digital architecture as genetic algorithms based on self-organization and heterogeneous networks of interacting actors can be analyzed and used as a critical tool. Therefore topology can be provided endless possibilities for architecture, designers and scientists intended in expressing the more complex and organic patterns of nature as life.

• KIEE International Transactions on Power Engineering
• /
• v.4A no.1
• /
• pp.18-25
• /
• 2004

This paper proposes a totally new method in the chaos characteristics' analysis of power systems, the introduction of topological invariants. Using a return histogram, a bifurcation graph was drawn. As well, the periodic orbits and topological invariants - the local crossing number, relative rotation rates, and linking number during the process of period-doubling bifurcation and chaos were extracted. This study also examined the effect on the topological invariants when the sensitive parameters were varied. In addition, the topological invariants of a three-dimensional embedding of a strange attractor were extracted and the result was compared with those obtained from differential equations. This could be a new approach to state detection and fault diagnosis in dynamical systems.

• Proceedings of the KIEE Conference
• /
• 2003.11a
• /
• pp.297-299
• /
• 2003

This paper proposes a totally new method in the chaos characteristics analysis of power systems, the introduction of topological invariants. Using a return histogram the bifurcation graph was drawn, the periodic orbits and topological invariants the local crossing number, relative rotation rates, and linking number during the process of period-doubting bifurcation and chaos were extracted. This study also examined the effect on the topological invariants when the sensitive parameters were varied. In addition, the topological invariants of a three-dimensional embedding of the strange attractor was extracted and the result was compared with those obtained from differential equations. This could be a new way for a state detection and fault diagnosis in a dynamical system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.145-164
• /
• 2014

Network virtualization provides a promising tool to allow multiple heterogeneous virtual networks to run on a shared substrate network simultaneously. A long-standing challenge in network virtualization is the Virtual Network Embedding (VNE) problem: how to embed virtual networks onto specific physical nodes and links in the substrate network effectively. Recent research presents several heuristic algorithms that only consider single topological attribute of networks, which may lead to decreased utilization of resources. In this paper, we introduce six complementary characteristics that reflect different topological attributes, and propose three topology-aware VNE algorithms by leveraging the respective advantages of different characteristics. In addition, a new KS-core decomposition algorithm based on two characteristics is devised to better disentangle the hierarchical topological structure of virtual networks. Due to the overall consideration of topological attributes of substrate and virtual networks by using multiple characteristics, our study better coordinates node and link embedding. Extensive simulations demonstrate that our proposed algorithms improve the long-term average revenue, acceptance ratio, and revenue/cost ratio compared to previous algorithms.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.135-139
• /
• 2006

Today's social networking services have tens of millions of users, and are growing fast. Their sheer size poses a significant challenge in capturing and analyzing their topological characteristics. Snowball sampling is a popular method to crawl and sample network topologies, but requires a high sampling ratio for accurate estimation of certain metrics. In this work, we evaluate how close topological characteristics of snowball sampled networks are to the complete network. Instead of using a synthetically generated topology, we use the complete topology of Cyworld ilchon network. The goal of this work is to determine sampling ratios for accurate estimation of key topological characteristics, such as the degree distribution, the degree correlation, the assortativity, and the clustering coefficient.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.5
• /
• pp.444-449
• /
• 2006

Path planning is a key element in navigation of a mobile robot. Several algorithms such as a gradient method have been successfully implemented so for. Although the gradient method can provide the global optimal path, it computes the navigation function over the whole environment at all times, which result in high computational cost. This paper proposes a high-speed path planning scheme, called a gradient method with topological information, in which the search space for computation of a navigation function can be remarkably reduced by exploiting the characteristics of the topological information reflecting the topology of the navigation path. The computing time of the gradient method with topological information can therefore be significantly decreased without losing the global optimality. This reduced path update period allows the mobile robot to find a collision-free path even in the dynamic environment.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.162-171
• /
• 1999

Plane sweep plays an important role in computational geometry. This paper shows that an extension of topological plane sweep to three-dimensional space can calculate the volume swept by rotating a solid polyhedral object about a fixed axis. Analyzing the characteristics of rotational swept volumes, we present an incremental algorithm based on the three-dimensional topological sweep technique. Our solution shows the time bound of O(n²·2?+T?), where n is the number of vertices in the original object and T? is time for handling face cycles. Here, α(n) is the inverse of Ackermann's function.

• Bulletin of the Korean Chemical Society
• /
• v.16 no.3
• /
• pp.269-277
• /
• 1995

A topological theory has been introduced to extend the theory of Balsara and Nauman to evaluate the entropy of in homogeneous polymer solutions. Previous theories have considered only the terms about the displacement of junction points, while the present theory has obtained a more complete expression for the entropy by adding the topological interaction terms between strands. There have been predicted the characteristics of the spinodal decomposition and the interfacial tension of polymer solutions from the resultant expression. It is exposed that the theoretically predictive values show good agreement with the experimental data for polymer solutions.

• Korean Institute of Interior Design Journal
• /
• v.14 no.5 s.52
• /
• pp.26-34
• /
• 2005

The systematic way of the boundary thought in Buddhism, when applied to the principles of building, determines certain forms to certain temples, and organizes their topological boundary concept structure - the continuous experience of the visitor from his/her entry bridge(connecting), through the main temple gate(neighbourhood), pavilion gate(including), stairs(continuance), to the arrival at the pavilion of the god of a mountain(spiral), which reconstitutes the Buddhist boundary symbolism and philosophy. The topological boundary spaces of temples are an architectural manifestation of Buddhism's Mahayana boundary concept aspects, whose object is to play a productive and active role in the enlightenment of people, serving the very basic end of the religion. The disciplined topological boundary spaces of the temple, as a reification of the boundary symbolisms of Buddhist topological cosmology, corresponds to Buddha-Ksetra, the highest state of existence in the universe. Visitors to the temple are invited to participate in the world of abundant Buddhist boundary concept symbols, and through this process, is enabled to elevate oneself to the transcendent topological boundary world and have a simulated experience of liberation.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.5
• /
• pp.48-58
• /
• 1998

In this paper, we proposed a new algorithm using characteristics of th ereconstructed phase trajectory by topological mapping developed for a real-tiem detection of the QRS complexes of ECG signals. Using fill-factor algorithm and mutual information algorithm which are in genral used to find out the chaotic characteristics of sampled signals, we inferred the proper mapping parameter, time delay, in ECG signals and investigated QRS detection rates with varying time delay in QRS complex detection. And we compared experimental time dealy with the theoretical one. As a result, it shows that the experimental time dealy which is proper in topological mapping from ECG signals is 20ms and theoretical time delays of fill-factor algorithm and mutual information algorithm are 20.+-.0.76ms and 28.+-.3.51ms, respectively. From these results, we could easily infer that the fill-factor algorithm in topological mapping from one-dimensional sampled ECG signals to two-dimensional vectors, is a useful algorithm for the detemination of the proper ECG signals to two-dimensional vectors, is a useful algorithm for the detemination of the proper time delay. Also with the proposed algorithm which is very simple and robust to low-frequency noise as like baseline wandering, we could detect QRS complex in real-time by simplifying preprocessing stages. For the evaluation, we implemented the proposed algorithm in C-language and applied the MIT/BIH arrhythmia database of 48 patients. The proposed algorithm provides a good performance, a 99.58% detection rate.