• 대한산업공학회지
• /
• 제27권1호
• /
• pp.25-29
• /
• 2001

We present a two dimensional linear programming knapsack problem with the extended GUB constraint. The presented problem is an extension of the cardinality constrained linear programming knapsack problem. We identify some new properties of the problem and derive a solution algorithm based on the parametric analysis for the knapsack right-hand-side. The solution algorithm has a worst case time complexity of order O($n^2logn$). A numerical example is given.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.371-374
• /
• 2000

This paper proposes a 16-bit ${\times}$ 16-bit multiplier for 2 twos-complement binary numbers with tree-like structure and implements it on a FPGA. The space and time complexity analysis shows that the 16-bit Tree-like multiplier represents lower circuit complexity and computes more quickly than both Booth array multiplier md Modified array multiplier.

• 산업경영시스템학회지
• /
• 제17권30호
• /
• pp.185-192
• /
• 1994

The complexity and consistency are important factors that affect human information processing in use of product. In this study, complexity and consistency of product(remote controller) are measured by Task Action Grammar(TAG) model. Also, new design alternative of the user interface is presented and evaluated. The results show that the consistent system and the good correspondence between hierarchical structure of system and user's mental model lead to the reduction of errors and enhanced user's performance.

• 한국분말야금학회:학술대회논문집
• /
• 한국분말야금학회 2006년도 Extended Abstracts of 2006 POWDER METALLURGY World Congress Part 1
• /
• pp.211-212
• /
• 2006

Production components fabricated by metal powder injection molding are analyzed for features to identify the design window for this powder technology. This reverse approach lets the designer see where PIM has a high probability to succeed. The findings show that the most suitable components tend to be less than 25 mm in size and less than 10 g in mass, are slender, and have high complexity.

• 디지털융복합연구
• /
• 제12권12호
• /
• pp.161-172
• /
• 2014

혁신적인 정보기술이 우리의 일상생활에 빠르게 수용되고 있는 과정에, 일시적으로 수용되었다가 이용이 중단되는 경험을 하기도 한다. 본 연구에서는 마이크로 블로그를 일시적으로 수용한 중국 사용자들을 대상으로 수용 후 이용중단에 미치는 요인을 알아보고자 한다. 실증분석 결과 사용자의 심리요인 중 복잡성과 보안성은 인지된 위험에 모두 영향을 미치는 것으로 나타났으며, 불편함, 혁신성과 주관적 규범은 사회적 위험에만 영향을 미치는 것으로 나타났다. 또한 인지된 위험은 이용중단에 모두 영향을 끼치는 것으로 나타났으며, 특히 복잡성이 가장 큰 영향을 미치는 것으로 나타났다. 이러한 결과를 토대로 향후 마이크로 블로그 사용의 복잡성을 좀 더 감소시키는 것이 필요할 것이다.

• 한국정보과학회논문지:시스템및이론
• /
• 제32권10호
• /
• pp.507-511
• /
• 2005

유한체 GF(p)에서 r=2p+1이 2-솟수이고, p에 대한 2의 위수 m을 가질 때, $q=r^e,\;(e{\geq}2)$를 연결정수로 갖는 FCSR의 생성된 출력 수열에 대한 선형복잡도를 구한다. 또한, 합산 난수 발생기(Summation Generator)는 LFSR의 출력 수열을 정수 합산하여 키 수열을 발생한다. 이와 유사하게 두개의 FCSR의 출력 수열을 상관관계에 안전한 비트별 논리합(bitwise exclusive-oring)을 이용한 이진 난수열 발생기를 제안하고, 선형복잡도 측면에서 출력된 수열의 암호학적 특성을 살펴본다

• Journal of Information Processing Systems
• /
• 제16권4호
• /
• pp.832-844
• /
• 2020

The degree of dispersion of a random variable can be described by the variance, which reflects the distance of the random variable from its mean. However, the time complexity of the traditional variance calculation algorithm is O(n), which results from full calculation of all samples. When the number of samples increases or on the occasion of high speed signal processing, algorithms with O(n) time complexity will cost huge amount of time and that may results in performance degradation of the whole system. A novel multi-step recursive algorithm for variance calculation of the time-varying data series with O(1) time complexity (constant time) is proposed in this paper. Numerical simulation and experiments of the algorithm is presented and the results demonstrate that the proposed multi-step recursive algorithm can effectively decrease computing time and hence significantly improve the variance calculation efficiency for time-varying data, which demonstrates the potential value for time-consumption data analysis or high speed signal processing.

• 한국어교육
• /
• 제28권4호
• /
• pp.1-38
• /
• 2017

This longitudinal study analyzed syntactic development (Complexity, Accuracy, and Fluency; CAF) of six L2 Korean learners in a natural learning context. The learners recalled the stories of a short animated video through speaking and writing every 3 months, from month 0 to 15. The learners' responses were analyzed for a series of CAF measures and their cognitive, psychological, and social variables were investigated. The results showed that (i) L2 Korean learners' speaking and writing in various time periods showed significant differences in spoken and written accuracy, and complexity; (ii) the correlation between spoken and written complexity, spoken and written accuracy, as well as spoken and written fluency were significant, and (iii) the regression analysis showed that learners' cognitive, social, and psychological variables have significant effect on the L2 Korean syntactic development. The current study reports that L2 Korean learners engaged in self-learning in a natural learning environment without formal instruction made significant syntactic development.

• ETRI Journal
• /
• 제41권3호
• /
• pp.308-315
• /
• 2019

Due to its high spectrum efficiency, 64-amplitude phase-shift keying (64-APSK) is one of the primary technologies used in deep space communications and digital video broadcasting through satellite-second generation. However, 64-APSK suffers from considerable computational complexity because of the de-mapping method that it employs. In this study, a low-complexity de-mapping method for (4 + 12 + 20 + 28) 64-APSK is proposed in which we take full advantage of the symmetric characteristics of each symbol mapping. Moreover, we map the detected symbol to the first quadrant and then divide the region in this first quadrant into several partitions to simplify the formula. Theoretical analysis shows that the proposed method requires no operation of exponents and logarithms and involves only multiplication, addition, subtraction, and judgment. Simulation results validate that the time consumption is dramatically decreased with limited degradation of bit error rate performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권4호
• /
• pp.1961-1974
• /
• 2019

In this letter, a harmonic-mean-based dual-antenna selection scheme at relay node is proposed in two-way relaying networks (TWRNs). With well-designed distributed orthogonal concatenated Alamouti space-time block code (STBC), a dual-antenna selection problem based on the instantaneous achievable sum-rate criterion is formulated. We propose a low-complexity selection algorithm based on the harmonic-mean criterion with linearly complexity $O(N_R)$ rather than the directly exhaustive search with complexity $O(N^2_R)$. From the analysis of network outage performance, we show that the asymptotic diversity gain function of the proposed scheme achieves as $1/{\rho}{^{N_R-1}}$, which demonstrates one degree loss of diversity order compared with the full diversity. This slight performance gap is mainly caused by sacrificing some dual-antenna selection freedom to reduce the algorithm complexity. In addition, our proposed scheme can obtain an extra coding gain because of the combination of the well-designed orthogonal concatenated Alamouti STBC and the corresponding dual-antenna selection algorithm. Compared with the common-used selection algorithms in the state of the art, the proposed scheme can achieve the best performance, which is validated by numerical simulations.