• Title/Summary/Keyword: complexity science

Search Result 1,853, Processing Time 0.028 seconds

URBAN COMPLEXITY ESTIMATION INDICES BASED ON 3D DISCRETE WAVELET TRANSFORM OF REMOTELY SENSED IMAGERY;THE PRELIMINARY INTERPRETATION WITH LAND COVER MAP

  • Yoo, Hee-Young;Lee, Ki-Won;Kwon, Byung-Doo
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.405-409
    • /
    • 2007
  • Each class in remotely sensed imagery has different spectral and spatial characteristics. Natural features have relatively smaller spatial changes than spectral changes. Meanwhile, urban area in which buildings, roads, and cars are included is inclined to face more changes of spatial variation than spectral one. This study aims to propose the new urban complexity index (UCI) based on the 3D DWT computation of remotely sensed imageries considering these characteristics. And then we analyze relation between index and land cover map. The 3DWUCI values are related to class and the indices of urban area are greater than natural area. The proposed UCI could be used to express effectively the standard of urban complexity over a wide area.

  • PDF

Corporate Meeting Destination Choice: The Effects of Organizational Structure

  • Ariffin, Ahmad Azrni M.;Ishak, Nor Khomar
    • Journal of Global Scholars of Marketing Science
    • /
    • v.16 no.4
    • /
    • pp.75-95
    • /
    • 2006
  • This study attempted to determine the influence of organizational structure on the novelty preference for corporate meeting destination choice. The three dimensions of structure incorporated were formalization, centralization and complexity. A total of 75 corporate meeting planners drawn from public listed services organizations were involved. The main method of data collection was questionnaire survey and multiple regression analysis was employed as the main statistical technique. The results revealed that both formalization and centralization were negatively correlated with novelty preference while complexity was positively correlated. However, only complexity contributed significantly to the prediction of novelty preference for corporate meeting destination choice. The main implication of this study is pertaining to the segmentation and targeting of the corporate meeting market. This study helped in bridging the gap between tourism marketing and organizational research. It also contributed by developing the measurement for novelty preference from the context of experiential marketing.

  • PDF

Punctured Trellis Coded Phase Frequency Shift Keying (펑쳐드 트렐리스 부호화된 위상주파수 변조)

  • 홍성권;송왕철;박성경;송명규;강창언
    • The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.6 no.4
    • /
    • pp.3-10
    • /
    • 1995
  • In this paper, application of PTCM to 2FSK / 4PSK signals is studied. The generator polynomial of punctured trellis coded 2FSK / 4PSK, metric computation techniques, decoding complexity considerations are provided. Simulation results shows that PTCM of 2FSK / 4PSK archieves equal coding gain in com- parison to Padovani and Wolf's system with less decoding complexity.

  • PDF

POLYNOMIAL CONVERGENCE OF PREDICTOR-CORRECTOR ALGORITHMS FOR SDLCP BASED ON THE M-Z FAMILY OF DIRECTIONS

  • Chen, Feixiang;Xiang, Ruiyin
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.5_6
    • /
    • pp.1285-1293
    • /
    • 2011
  • We establishes the polynomial convergence of a new class of path-following methods for semidefinite linear complementarity problems (SDLCP) whose search directions belong to the class of directions introduced by Monteiro [9]. Namely, we show that the polynomial iteration-complexity bound of the well known algorithms for linear programming, namely the predictor-corrector algorithm of Mizuno and Ye, carry over to the context of SDLCP.

A System Dynamics Approach for Making Group Decision

  • Kwahk Kee-Young;Kim Hee-Woong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.958-965
    • /
    • 2003
  • The rapidly changing business environment has required cooperation and coorduiation among functional units n organizations which should Involve group decision-making processes Although many group derision-making support tools and methods have provided the collaborative capabilities for organizational members, they often lack features supporting the dynamic complexity issue frequently occurring at group decision-making processes This study proposes system dynamics modeling as a group decision-making support tool to deal with the group derision-making tasks having properties of dynamic complexity in terms of cognitive fit theory.

  • PDF

An Efficient Sliding Window Algorithm Using Adaptive-Length Guard Window for Turbo Decoders

  • Lim, Hyun-Tack;Kim, Yong-Sang;Cheun, Kyung-Whoon
    • Journal of Communications and Networks
    • /
    • v.14 no.2
    • /
    • pp.195-198
    • /
    • 2012
  • An efficient sliding window algorithm employing an adaptive-length guard window for turbo decoders is proposed. The proposed algorithm results in significant complexity reductions, especially for small sliding window lengths where the additional computational complexity required for the guard window is critical.

A Low-Complexity Sphere Decoding Algorithm for Generalized Spatial Modulation (일반화 공간 변조를 위한 저복잡도 구복호 수신기)

  • Jeon, EunTak;Yoon, SungMin;Lee, JaeSeong;Woo, DaeWi;Lee, Kyungchun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.1
    • /
    • pp.30-36
    • /
    • 2016
  • In this paper, an Rx-ordering aided sphere decoding algorithm for generalized spatial modulation (GSM) systems is proposed. In the proposed sphere decoding algorithm, to efficiently reduce the search region, the received signals are optimally ordered, which results in the reduction of computational complexity. To evaluate the performance and the computational complexity of the proposed Rx-ordered sphere decoding algorithm, the simulations are performed. In the simulation results, it is observed that in GSM systems, the proposed decoding algorithm achieves the same error performance with the conventional SD, whereas it efficiently decreases the computational complexity for symbol detection.

Computation and Communication Efficient Key Distribution Protocol for Secure Multicast Communication

  • Vijayakumar, P.;Bose, S.;Kannan, A.;Jegatha Deborah, L.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.4
    • /
    • pp.878-894
    • /
    • 2013
  • Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications. In this paper, we propose a new key distribution protocol that focuses on two aspects. The first one aims at the reduction of computation complexity by performing lesser numbers of multiplication operations using a ternary-tree approach during key updating. Moreover, it aims to optimize the number of multiplication operations by using the existing Karatsuba divide and conquer approach for fast multiplication. The second aspect aims at reducing the amount of information communicated to the group members during the update operations in the key content. The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication time significantly.

Conceptual Design Optimization of Tensairity Girder Using Variable Complexity Modeling Method

  • Yin, Shi;Zhu, Ming;Liang, Haoquan;Zhao, Da
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.17 no.1
    • /
    • pp.29-36
    • /
    • 2016
  • Tensairity girder is a light weight inflatable fabric structural concept which can be used in road emergency transportation. It uses low pressure air to stabilize compression elements against buckling. With the purpose of obtaining the comprehensive target of minimum deflection and weight under ultimate load, the cross-section and the inner pressure of tensairity girder was optimized in this paper. The Variable Complexity Modeling (VCM) method was used in this paper combining the Kriging approximate method with the Finite Element Analysis (FEA) method, which was implemented by ABAQUS. In the Kriging method, the sample points of the surrogate model were outlined by Design of Experiment (DOE) technique based on Optimal Latin Hypercube. The optimization framework was constructed in iSIGHT with a global optimization method, Multi-Island Genetic Algorithm (MIGA), followed by a local optimization method, Sequential Quadratic Program (SQP). The result of the optimization gives a prominent conceptual design of the tensairity girder, which approves the solution architecture of VCM is feasible and efficient. Furthermore, a useful trend of sensitivity between optimization variables and responses was performed to guide future design. It was proved that the inner pressure is the key parameter to balance the maximum Von Mises stress and deflection on tensairity girder, and the parameters of cross section impact the mass of tensairity girder obviously.