• 디자인학연구
• /
• 제17권1호
• /
• pp.211-220
• /
• 2004

새로운 자연과학의 패러다임으로 대두되고 있는 복잡성의 과학인 카오스(Chaos), 프랙탈(Fractal) 이론은 자연을 몇 개의 단순한 요소로 분해 이해하는 것이 아니라 전체적인 관계 속에서 이해하는 것이다. 인간과 자연을 포함한 모든 세계를 바라보는 우리의 시각을 비선형성, 다양성, 시간성, 복잡성으로 향하게 하며 비정수 차원의 자연과 복잡성을 표현하기에 적합한 적용 방법이다. 비선형적 프랙탈 기하학과 카오스 이론을 예술방면으로 응용하는 것은 과학과 예술이 만나는 상상의 영역이며 아직까지 많은 연구가 이루어지지 않은 분야이다. 이러한 프랙탈 형태의 기하학적 특성과 조형 원리를 파악하기 위해 객관적인 자료를 분석해 조형 언어를 추출한 연구이다. 형식에 있어서 수학적인 방법에 의한 프랙탈적 분석이라기보다는 프랙탈의 여러 개념 가운데 특히 자기 유사성(Self-similarity)과 반복성(Recursiveness) 그리고 무작위성(Randomness), 불가능한 공간에 의해 표현되어진 도형과 그래픽디자인과의 조형적인 유사성을 밝혀 보았다. 즉 프랙탈 도형은 부분의 부분, 또 그 부분을 반복해서 확대해 가도 도형의 본직적인 구조가 변하지 않는 특성을 가지고 있다. 이와 같이 무한소까지 확대해도 전체와 일치하는 자기 닮음 구조로 되어있다. 이것은 어느 부분이나 전체를 재구성할 수 있는 정보를 모두 가지고 있음을 뜻한다. 본 연구에서는 이러한 배경을 바탕으로 그래픽디자인에서 나타난 기하학적 조형성에 대한 프랙탈적 분석 가능성을 주로 검토하는 데 목적을 두고 있다. 그리고 연구의 결과 그래픽디자인은 이미 수학적인 계산 속에서 아름다운 비례를 찾고 있었다는 것을 발견할 수 있었다. 자연을 표현하는 가장 적합한 공식인 프랙탈 기하학은 앞으로 과학과 그래픽디자인의 복합체로서 고유성과 특수성의 고부가가치를 창출해야 한다. 이런 요구를 수용하고 변화에 적응 발전해야 하는 필요성이 대두되는 단계에서 본 연구의 의의가 크다고 하겠다.

• 한국주거학회논문집
• /
• 제14권1호
• /
• pp.87-94
• /
• 2003

As important elements consisting of city streetscape, facade design on building is generally very significant. But without active acceptance and understanding of the concept that the building has a private objective as personal property, it is not easy to take an involvement into design as well as to establish reasonable and scientific standards of harmony. Therefore, for desirable streetscape planning, it is indispensable to know how to closely examine the visual harmony of already established buildings in each street and how to get the solutions for its realization. In this respect, this study is to try to examine and verify the feasibility of our present streetscape situation by experimental application of acceptable Y. Elesheshtawy's model(1997), an interpretation of quantitative index of street buildings by Gestalt theory, for the preparation of the foundation of institute and standards of building design which has social value in contributing to visual and spacious harmony in our street space without giving any damage to private property. From the result, I can assure the validity that the physical complexity, whose schema is socially and culturally different from our reality, is applicable to our actual streetscape in some extent.

• 한국경영과학회지
• /
• 제39권2호
• /
• pp.131-140
• /
• 2014

Customer networks go through constant changes. They may expand or shrink once they are formed. In dynamic environments, it is a critical corporate challenge to identify and manage influential customer groups in a cost effective way. In this context, we apply inverse optimization theory to suggest an efficient method to manage customer networks. In this paper, we assume that there exists a subset of nodes that might have a large effect on the network and that the network can be modified via some strategic actions. Rather than making efforts to find influential nodes whenever the network changes, we focus on a subset of selective nodes and perturb as little as possible the interaction between nodes in order to make the selected nodes influential in the given network. We define the following problem based on the inverse optimization. Given a graph and a prescribed node subset, the objective is to modify the structure of the given graph so that the fixed subset of nodes becomes a minimum dominating set in the modified graph and the cost for modification is minimum under a fixed norm. We call this problem the inverse dominating set problem and investigate its computational complexity.

• 한국화재소방학회논문지
• /
• 제33권1호
• /
• pp.164-170
• /
• 2019

본 연구는 우리나라 소방조직의 구조적 특성을 분석의 요소에 따라 확인하고 규명하고자 수행되었다. 이를 위하여, 소방공무원으로 구성된 소방조직을 연구대상으로 한정하고, 조직의 구조적 특성(복잡성, 집권성, 공식성)을 선행연구와 관계법령을 이용하여 확인하였다. 연구결과, 소방조직은 복잡성, 집권성, 공식성이 모두 높은 조직구조를 갖고 있는 것으로 나타났다. 이는 전형적인 기계적 관료제적의 조직 특성으로, 일반 정부행정조직이나 기업조직에서는 찾아 볼 수 없는 소방조직만의 고유한 특성이다. 본 연구결과는 소방조직의 학술적 개념을 정립하는데 기여가 될 것으로 기대된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권6호
• /
• pp.1431-1448
• /
• 2024

Complexity science is a new stage in the development of systems science that is the frontier areas of contemporary scientific development. Complexity science takes complex systems as the research object, which has attracted widespread attention from researchers in the fields of economy, control, management, and society. In recent years, with the rapid development of science and technology and people's deepening understanding for the theory of complex systems, the systems are no longer an object with a single function, but the systems are composed of multiple individuals with autonomous capabilities through cooperative and cooperation, namely multi-agent system (MAS). Currently, MAS is one of the main models for studying such complex systems. The intelligent control is to break the traditional multi-agent fault-tolerant control (FTC) concept and produce a new type of compensation mechanism. In this paper, the applications of fault-tolerant control methods for MASs are presented, and a discussion is given about development and challenges in this field.

• 전자공학회논문지S
• /
• 제35S권2호
• /
• pp.50-57
• /
• 1998

In this paper, we propoe a log N-stage ATM concentator. ATM concentrator is used in the ATM access network to concentrate the traffic offered at UNI, so that high utilization of the newtork rewources is achieved. The concetrator may be used as a construction block in the design of ATM switch. We define abasic element, named equalizer, and decribe its function and theory to construct an efficient concentrator using the element. In addition, a control scheme to enhance the concentrator to a superconcentrator is presented, which enables the concentration to start from an arbitrary output. This scheme makes it possible to construct an efficient ditributior or a barrel shifter which are often used in ATM switch and other application. The proposed concentrator has a low hardware complexity of O(N log N), thus it is economical to implement. Also, the time complexity of proposed concentrator for determining the rouging is O(N log N), which is faster than that of the existing ones.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제13권1호
• /
• pp.73-82
• /
• 2013

In pattern classification, feature selection is an important factor in the performance of classifiers. In particular, when classifying a large number of features or variables, the accuracy and computational time of the classifier can be improved by using the relevant feature subset to remove the irrelevant, redundant, or noisy data. The proposed method consists of two parts: a wrapper part with an improved genetic algorithm(GA) using a new reproduction method and a filter part using mutual information. We also considered feature selection methods based on mutual information(MI) to improve computational complexity. Experimental results show that this method can achieve better performance in pattern recognition problems than other conventional solutions.

• 한국IT서비스학회지
• /
• 제10권3호
• /
• pp.167-177
• /
• 2011

Code obfuscation is a technique that protects the abstract data contained in a program from malicious reverse engineering and various obfuscation methods have been proposed for obfuscating intention. As the abstract data of control flow about programs is important to clearly understand whole program, many control flow obfuscation transformations have been introduced. Generally, inlining is a compiler optimization which improves the performance of programs by reducing the overhead of calling invocation. In code obfuscation, inlining is used to protect the abstract data of control flow. In this paper, we define new control flow complexity metric based on entropy theory and N-Scope metric, and then apply genetic algorithm to obtain optimal inlining results, based on the defined metric.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제12권1호
• /
• pp.20-28
• /
• 2012

We define a language $\mathcal{RS}$, a subclass of the scheduling language $\mathcal{RS}V$ (resource constrained project scheduling with variant processes). $\mathcal{RS}$ involves the determination of the starting times for ground activities of a project satisfying precedence and resource constraints, in order to minimize the total project duration. In $\mathcal{RS}$ ground activities and two structural symbols (operators) 'seq' and 'pll' are used to construct activity-terms representing scheduling problems. We consider three different variants for formalizing the $\mathcal{RS}$-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the problem $\mathcal{RS}$ is $\mathcal{NP}$-complete. Further we show that the optimizing variant (or number variant) of the $\mathcal{RS}$-problem is computable in polynomial time iff the decision variant is computable in polynomial time.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.971-974
• /
• 2002

Petri net is an effective modeling tool for concurrent systems. Liveness problem is one of analysis problems in Petri net theory verifying whether the system is free from any local deadlocks. It is well known that computational complexity of liveness problem of general Petri net is deterministic exponential space. Some subclasses, such as marked graph and free choice net, are suggested where liveness problem is verified in less complexity. This paper studies liveness of siphon containing circuit (SCC) net. Liveness condition based on algebraic inequalities is shown. Then polynomial time decidability of liveness of SCC net is derived, if the given net is known to be an SCC net a priori.