• Title/Summary/Keyword: data complexity

Search Result 2,379, Processing Time 0.032 seconds

Development of 3D CAD Part Data Simplification System for Ship and Offshore Plant Equipment (조선해양 기자재 3D CAD 단품 데이터 간략화 시스템 개발)

  • Kim, Byung Chul;Kwon, Soonjo;Park, Sunah;Mun, Duhwan;Han, Soonhung
    • Korean Journal of Computational Design and Engineering
    • /
    • v.18 no.3
    • /
    • pp.167-176
    • /
    • 2013
  • It is necessary to construct equipment catalog in ship outfitting design and offshore plant design. The three-dimensional CAD data of equipment take on different level-of-detail depending on the purpose. Equipment suppliers provide CAD data with high complexity while ship designers need CAD data with low complexity. Therefore, it is necessary to simplify CAD data. However, it takes much time to simplify them manually. To resolve the issue, a system for automatically simplifying the 3D CAD data of equipment was developed. This paper presents the architecture of the system and the implementation details. In addition, experiment result using the prototype system is explained.

Factors Boosting Impulse Buying Behavior in Live-streaming Commerce - Roles of Para-social Interactions, Task Complexity and Perceived Amount of Information (라이브 커머스의 충동구매행동에 대한 영향 요인 - 의사사회적 상호작용, 과업 복잡성과 지각된 정보의 양을 중심으로 -)

  • Kim, Hyojung;Lee, Yuri;Park, Minjung
    • Fashion & Textile Research Journal
    • /
    • v.23 no.1
    • /
    • pp.70-83
    • /
    • 2021
  • Live-streaming commerce is attracting attention as a noticeable trend in the retail industry. It is a new mobile shopping service platform developed by combining live streaming with e-commerce technologies. This study examined the impact of para-social interactions on consumer impulse buying behavior and investigated the impact through task complexity as well as perceived amount of information. To achieve this goal, 203 women using a mobile commerce participated in an online survey after experiencing beauty live-streaming commerce. The collected data were analyzed using SPSS 25.0, AMOS 23.0, and SPSS PROCESS Macro program. The results of the study revealed that para-social interactions negatively influenced task complexity, positively influenced perceived amounts of information, and positively influenced impulse buying behavior. In addition, impulse buying behavior was negatively influenced by task complexity versus positively that was influenced by perceived amounts of information. The impact of para-social interactions on impulse buying behavior is mediated by task complexity and perceived information. The findings of this study contribute to the theoretical extension of para-social interaction on impulse buying behavior in the context of live-streaming commerce. The implications of the findings suggest practical marketing strategies for digital media commerce retailers.

Iterative Channel Estimation for Higher Order Modulated STBC-OFDM Systems with Reduced Complexity

  • Basturk, Ilhan;Ozbek, Berna
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.6
    • /
    • pp.2446-2462
    • /
    • 2016
  • In this paper, a frequency domain Expectation-Maximization (EM)-based channel estimation algorithm for Space Time Block Coded-Orthogonal Frequency Division Multiplexing (STBC-OFDM) systems is investigated to support higher data rate applications in wireless communications. The computational complexity of the frequency domain EM-based channel estimation is increased when higher order constellations are used because of the ascending size of the search set space. Thus, a search set reduction algorithm is proposed to decrease the complexity without sacrificing the system performance. The performance results of the proposed algorithm is obtained in terms of Bit Error Rate (BER) and Mean Square Error (MSE) for 16QAM and 64QAM modulation schemes.

Motion Estimation Method Based on Correlations of Motion Vectors for Multi-view Video Coding (다시점 비디오 부호화를 위한 움직임 벡터들의 상관성을 이용한 움직임 추정 기법)

  • Yoon, Hyo-Sun;Kim, Mi-Young
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.10
    • /
    • pp.1131-1141
    • /
    • 2018
  • Motion Estimation which is used to reduce the redundant data plays an important role in video compressions. However, it requires huge computational complexity of the encoder part. And therefore many fast motion estimation methods has been developed to reduce complexity. Multi-view video is obtained by using many cameras at different positions and its complexity increases in proportion to the number of cameras. In this paper, we proposed a fast motion estimation method for multi-view video. The proposed method predicts a search start point by using correlated candidate vectors of the current block. According to the motion size of the start search point, a search start pattern of the current block is decided adaptively. The proposed method proves to be about 2 ~ 5 times faster than existing methods while maintaining similar image quality and bitrates.

High-Performance and Low-Complexity Image Pre-Processing Method Based on Gradient-Vector Characteristics and Hardware-Block Sharing

  • Kim, Woo Suk;Lee, Juseong;An, Ho-Myoung;Kim, Jooyeon
    • Transactions on Electrical and Electronic Materials
    • /
    • v.18 no.6
    • /
    • pp.320-322
    • /
    • 2017
  • In this paper, a high-performance, low-area gradient-magnitude calculator architecture is proposed, based on approximate image processing. To reduce the computational complexity of the gradient-magnitude calculation, vector properties, the symmetry axis, and common terms were applied in a hardware-resource-shared architec-ture. The proposed gradient-magnitude calculator was implemented using an Altera Cyclone IV FPGA (EP4CE115F29) and the Quartus II v.16 device software. It satisfied the output-data quality while reducing the logic elements by 23% and the embedded multipliers by 76%, compared with previous work.

A Study for Domain Categorization and Estimation of Complexity for Reliability Improvement of Domain Analysis (도메인 분석의 신뢰성 향상을 위한 도메인 분류와 복잡도 측정에 관한 연구)

  • Lee, Eun-Ser
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.1
    • /
    • pp.1-6
    • /
    • 2016
  • Domain analysis is an important component for reliability of development project. Domain analysis error have an effect in the whole system. As a result, the system reliability will be deteriorated. Therefore, we need a methodology to analyze domain characteristic for a reliable analysis in the domain analysis phase. In this paper, we propose a methodology for domain categorization and estimation of complexity for reliability improvement of domain analysis.

Reduced Complexity Signal Detection for OFDM Systems with Transmit Diversity

  • Kim, Jae-Kwon;Heath Jr. Robert W.;Powers Edward J.
    • Journal of Communications and Networks
    • /
    • v.9 no.1
    • /
    • pp.75-83
    • /
    • 2007
  • Orthogonal frequency division multiplexing (OFDM) systems with multiple transmit antennas can exploit space-time block coding on each subchannel for reliable data transmission. Spacetime coded OFDM systems, however, are very sensitive to time variant channels because the channels need to be static over multiple OFDM symbol periods. In this paper, we propose to mitigate the channel variations in the frequency domain using a linear filter in the frequency domain that exploits the sparse structure of the system matrix in the frequency domain. Our approach has reduced complexity compared with alternative approaches based on time domain block-linear filters. Simulation results demonstrate that our proposed frequency domain block-linear filter reduces computational complexity by more than a factor of ten at the cost of small performance degradation, compared with a time domain block-linear filter.

ESTIMATING THE OPERATOR'S PERFORMANCE TIME OF EMERGENCY PROCEDURAL TASKS BASED ON A TASK COMPLEXITY MEASURE

  • Jung, Won-Dea;Park, Jin-Kyun
    • Nuclear Engineering and Technology
    • /
    • v.44 no.4
    • /
    • pp.415-420
    • /
    • 2012
  • It is important to understand the amount of time required to execute an emergency procedural task in a high-stress situation for managing human performance under emergencies in a nuclear power plant. However, the time to execute an emergency procedural task is highly dependent upon expert judgment due to the lack of actual data. This paper proposes an analytical method to estimate the operator's performance time (OPT) of a procedural task, which is based on a measure of the task complexity (TACOM). The proposed method for estimating an OPT is an equation that uses the TACOM as a variable, and the OPT of a procedural task can be calculated if its relevant TACOM score is available. The validity of the proposed equation is demonstrated by comparing the estimated OPTs with the observed OPTs for emergency procedural tasks in a steam generator tube rupture scenario.

A Study on VLSI-Oriented 2-D Systolic Array Processor Design for APP (Algebraic Path Problem) (VLSI 지향적인 APP용 2-D SYSTOLIC ARRAY PROCESSOR 설계에 관한 연구)

  • 이현수;방정희
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.7
    • /
    • pp.1-13
    • /
    • 1993
  • In this paper, the problems of the conventional special-purpose array processor such as the deficiency of flexibility have been investigated. Then, a new modified methodology has been suggested and applied to obtain the common solution of the three typical App algorithms like SP(Shortest Path), TC(Transitive Closure), and MST(Minimun Spanning Tree) among the various APP algorithms using the similar method to obtain the solution. In the newly proposed APP parallel algorithm, real-time Processing is possible, without the structure enhancement and the functional restriction. In addition, we design 2-demensional bit-parallel low-triangular systolic array processor and the 1-PE in detail. For its evaluation, we consider its computational complexity according to bit-processing method and describe relationship of total chip size and execution time. Therefore, the proposed processor obtains, on which a large data inputs in real-time, 3n-4 execution time which is optimal o(n) time complexity, o(n$^{2}$) space complexity which is the number of total gate and pipeline period rate is one.

  • 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