• Korean Institute of Interior Design Journal
• /
• no.22
• /
• pp.123-131
• /
• 2000

The purpose of this study is to propose a new design concept and properties within new paradigm. Contemporary students of architectural design seem to redefine the mechanic and reductive approach to design method based upon Euclidean geometry. In this study, the organic space-time and holistic view-point that constitutes the background for all this is radically different from the modern design. It consists of three sections as follow: First, it presents a concept of complex system and properties of complexity that we find in new natural science and tries to combine that news geometry with architectural design to provide a methodological basis for morphogenesis and transformation. Second, the complexity in architecture is defined as a fractal shape, folded space, and irreducible organic system that cannot be fully understood by modernist idea of architecture. Third, the complexity in architecture is strategy based on the electronic paradigm that would enable the emergence of creative possibility. The complexity theory offer new insights to explain not only natural laws but also define dynamic architecture. In fine, this study places a great emphasis on the organic world-view to the spatial organization, which I hope will contribute to generating a greater number of creative possibilities for design.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1282-1287
• /
• 1999

통신 프로그램은 고도의 신뢰성과 기능성, 확장성, 그리고 유지 보수성이 필요하다. 프로그램 테스트의 결과와 McCabe의 Complexity를 측정한 데이타를 가지고 회귀모델을 만들고 그 신뢰성을 분석함으로서 프로그램의 결함과 복잡도의 관련성을 평가한다.본 연구에서 사용한 통신 프로그램은 500개 블록이 59가지 기능을 수행하는 교환 기능 중에서 복잡도가 너무 많아서 통계 처리의 bias가 될 블록을 제외하고 394 블록을 선정하여 SAS에 의해서 통계 분석을 하고 회귀 분석 모델을 설계하였다. t 분포에 의하여 방정식의 유의성 수준을 검증하고 프로그램의 결함수에 가장 큰 영향을 주고 있는 복잡도가 McCabe의 복잡도와 설계 복잡도 임을 밝혀냈다. 이 연구 결과에 의해서 설계 정보 및 유지 보수 정보를 얻을 수 있다. Abstract Switching software requires high reliability, functionality, extendability and maintainability. For doing, software quality model based on MaCabe's complexity measure is investigated. It is experimentally shown using regression analysis the program fault density depends on the complexity and size of the function unit. The software should be verified and tested if it satisfies its requirements with automated analysis tools. In this paper we propose the regression model with the test data.The sample program for the regression model consists of more than 500 blocks, where each block compose of 10 files, which has 59 functions of switching activity.Among them we choose 394 blocks and analyzed for 59 functions by testing tools and SAS package. We developed Regression Analysis Model and evaluated significant of the equation based on McCabe's cyclomatic complexity, block design complexity, design complexity, and integration complexity.The results of our experimental study are that number of fault are under the influence of McCabe's complexity number and design complexity.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.533-534
• /
• 2006

This paper presents the architecture design of a high-speed, low-complexity 128-point radix-$2^4$ FFT processor for ultra-wideband (UWB) systems. The proposed high-speed, low-complexity FFT architecture can provide a higher throughput rate and low hardware complexity by using 2-parallel data-path scheme and single-path delay-feedback (SDF) structure. This paper presents the key ideas applied to the design of high-speed, low-complexity FFT processor, especially that for achieving high throughput rate and reducing hardware complexity. The proposed FFT processor has been designed and implemented with the 0.18-m CMOS technology in a supply voltage of 1.8 V. The throughput rate of proposed FFT processor is up to 1 Gsample/s while it requires much smaller hardware complexity.

• Architectural research
• /
• v.13 no.4
• /
• pp.19-30
• /
• 2011

This investigation, based on empirical research, examined the role of complexity and order in the aesthetic experience of architectural forms. The basic assumption of this study was that perception in architectural form is a process of interpreting a pattern in a reductive way. Thus, perceptual arousal is not determined by the absolute complexity of a configuration. Rather, the actual perceived complexity is a function of the organization of the system (order). In addition, complexity and order were defined and categorized into four variables according to their significant characteristics; simple order, complex order, random complexity, and lawful complexity. The series of experiments confirmed that there is a point on the psychological complexity dimension which is optimal. By demonstrating that consensual and individual aesthetic preference can be measured to have a unimodal function of relationship with complexity, the results of the experiments indicated that complexity and orderliness are effective design factors for enhancing aesthetics of a building facade. This investigation offered a conceptual framework that relates the physical (architectural form) and psychological factors (complexity and order) operating in the aesthetic experience of building facades.

• Science of Emotion and Sensibility
• /
• v.8 no.2
• /
• pp.103-115
• /
• 2005

This research aimed at a clear definition of simplicity and complexity and other elements of product aesthetics and investigated the influence of simplicity/complexity on consumer preference, and balance. The research also made it an objective to find answers to underlying questions of whether there is a relationship between simplicity/complexity, and balance, and if there is, then how is the relationship? and is balance in a product's aesthetics an influential factor? does a relationship exist between consumer preference, simplicity/complexity, and balance? In conclusion, the research process categorized products into groups by use of FCB Grid, and analyze4 each group to establish a prototype which represents the group, then questionnaires where presented to consumers in order to find satisfaction to consumer preference. Also, the research proposes a verification method through design process.

• Journal of information and communication convergence engineering
• /
• v.4 no.1
• /
• pp.23-27
• /
• 2006

The discipline of software performance is very broad; it influences all aspects of the software development lifecycle, including architecture, design, deployment, integration, management, evolution and servicing. Thus, the complexity of software is an important aspect of development and maintenance activities. Much research has been dedicated to defining different software measures that capture what software complexity is. In most cases, the description of complexity is given to humans in forms of numbers. These quantitative measures reflect human-seen complexity with different levels of success. Software complexity growth has been recognized to be beyond human control. In this paper, we have focused our discussion on the increasing software complexity and the issue with the problems being faced in managing this complexity. This increasing complexity in turn affects the software productivity, which is declining with increase in its complexity.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.1
• /
• pp.153-158
• /
• 2017

This paper investigates a robust low-complexity design problem for tracking control of uncertain switched pure-feedback systems in the presence of unknown control direction. The completely unknown non-affine nonlinearities are assumed to be arbitrarily switched. By combining the nonlinear error transformation technique and Nussbaum-type functions, a robust tracking controller is designed without using any adaptive function approximators. Thus, compared with existing results, the proposed control scheme has the low-complexity property. From Lyapunov stability theory, it is shown that the tracking error remains within the preassigned transient and steady-state error bounds.

• Journal of information and communication convergence engineering
• /
• v.16 no.3
• /
• pp.142-147
• /
• 2018

We present a practical design algorithm for quantizers at nodes in distributed systems in which each local measurement is quantized without communication between nodes and transmitted to a fusion node that conducts estimation of the parameter of interest. The benefits of vector quantization (VQ) motivate us to incorporate the VQ strategy into our design and we propose a low-complexity design technique that seeks to assign vector codewords into sets such that each codeword in the sets should be closest to its associated local codeword. In doing so, we introduce new distance metrics to measure the distance between vector codewords and local ones and construct the sets of vector codewords at each node to minimize the average distance, resulting in an efficient and independent encoding of the vector codewords. Through extensive experiments, we show that the proposed algorithm can maintain comparable performance with a substantially reduced design complexity.

• Archives of design research
• /
• v.14 no.1
• /
• pp.111-118
• /
• 2001

The primary purpose of this research is to identify effects of the complexity levels of visual factors on user's communication in the web-sites. In this study, six complexity levels of visual factors were manipulated with four items(graphics, moving graphics, size and links) to test communication effects. As a result, user's communication was influenced by the complexity of illustration. This result shows that web sites with moderate levels of illustration complexity are more preferred than with complex or simple levels of visual complexity.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.3E
• /
• pp.53-57
• /
• 1998

Spectral information at a speech coder should be quantized with sufficient accuracy to keep perceptually transparent output speech. Spectral information at a low bit rate speech coder is usually transformed into corresponding line spectrum pair parameters and is often quantized with a vector quantization algorithm. As the vector quantization algorithm generally has high complexity in the optimal code vector searching routine, the complexity reduction in that routine is investigated using the ordering property of the line spectrum pair. When the proposed complexity reduction algorithm is applied to the well-known split vector quantization algorithm, the 46% complexity reduction is achieved in the distortion measure compu-tation.