• 유통과학연구
• /
• 제15권7호
• /
• pp.35-41
• /
• 2017

Purpose - A product bundling is a marketing approach where multiple products or components are packaged together into one bundle solution. This paper aims to introduce an optimal bundle search problem (hereinafter called "OBSP") which may be embedded with online recommendation system to provide an optimized service considering pairwise discount and delivery cost. Research design, data, and methodology - Online retailers have their own discount policy and it is time consuming for online shoppers to find an optimal bundle. Unlike an online system recommending one item for each search, the OBSP considers multiple items for each search. We propose a mathematical formulation with numerical example for the OBSP and analyzed the complexity of the problem. Results - We provide two results from the complexity analysis. In general case, the OBSP belongs to strongly NP-Hard which means the difficulty of the problem while the special case of OBSP can be solved within polynomial time by transforming the OBSP into the minimum weighted perfect matching problem. Conclusions - In this paper, we propose the OBSP to provide a customized service considering bundling price and delivery cost. The results of research will be embedded with an online recommendation system to help customers for easy and smart online shopping.

• 한국조경학회지
• /
• 제35권3호
• /
• pp.50-61
• /
• 2007

The purpose of this study is to establish design guidelines for waterscape facilities of healing gardens in psychiatric hospitals. Data were collected through simulation and interview. The subjects included schizophrenic (n=42) and alcoholic (n=41) inpatients as well as medical staff personnel (n=40) at Maeumsarang Hospital. The results of this study are as follows: It was revealed that for all three groups the first preference was a natural flowing waterscape, and the second preference was a natural descending waterscape. The schizophrenic subjects had a greater preference for a static artificial waterscape and a descending artificial multistory waterscape than the other two groups. The alcoholic subjects preferred an ascending natural multistory waterscape. The analysis on the preference towards an ascending type and a descending type from the perspective of naturalness and complexity. Complexity had a greater influence than naturalness in the ascending waterscapes, and naturalness had more influence than complexity in the descending style waterscapes. Therefore, these factors need to be taken into consideration when designing either ascending or descending waterscape facilities. In general, the subjects preferred natural, dynamic and descending waterscapes to the artificial, static and ascending variety.

• 대한전자공학회논문지SD
• /
• 제43권3호
• /
• pp.33-39
• /
• 2006

Divide-and-Conquer방법은 병렬 곱셈기의 구성에 잘 적용되며 가장 대표적으로 카라슈바 방법이 있다. Leone은 최적 반복 회수를 카라슈바 알고리즘에 적용하였으며 Ernst는 다중 분할 카라슈바 방법을 제안하였다. 본 논문에서는 카라슈바 알고리즘에서 불필요한 연산이 제거된 불필요한 연산이 없는 카라슈바 알고리즘과 효율적인 하드웨어 구조를 제안한다. 본 논문에서 제안하는 알고리즘은 기존의 카라슈바 알고리즘에 비교하여 같은 시간 복잡도를 가지나 공간 복잡도를 효율적으로 감소시킨다. 특히 확장체의 차수 n이 홀수 및 소수일 때 더 효율적이며 최대 43%까지 공간 복잡도를 줄일 수 있다.

• 한국게임학회 논문지
• /
• 제17권1호
• /
• pp.51-62
• /
• 2017

게임은 긴장, 즐거움, 재미를 위한 움직임이다. 게임 사용자는 게임을 위한 조작 장치인 버튼을 가지고 놀며, 버튼을 움직이는 다양한 방식에 대한 독특한 경험을 한다. 본 연구에서는 게임의 조작성을 버튼 조작의 복잡성과 버튼 조작의 재미로 분해해 어드벤처 게임에서 사물을 사용하는 조작 방식을 대상으로 게임의 조작성에 대한 함의를 논의했다. 즉, 게임은 복잡해도 재미있고, 단순해도 재미있는 특성이 있으며, 행동 특성을 고려해 버튼 조작을 디자인 할 필요가 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권5호
• /
• pp.909-937
• /
• 2011

Energy efficiency is one of the most critical issues in the design of wireless sensor networks. In object-tracking sensor networks, the data storage and query processing should be energy-conserving by decreasing the message complexity. In this paper, a Prediction-based Energy-conserving Approximate StoragE schema (P-EASE) is proposed, which can reduce the query error of EASE by changing its approximate area and adopting predicting model without increasing the cost. In addition, focusing on reducing the unnecessary querying messages, P-EASE enables an optimal query algorithm to taking into consideration to query the proper storage node, i.e., the nearer storage node of the centric storage node and local storage node. The theoretical analysis illuminates the correctness and efficiency of the P-EASE. Simulation experiments are conducted under semi-random walk and random waypoint mobility. Compared to EASE, P-EASE performs better at the query error, message complexity, total energy consumption and hotspot energy consumption. Results have shown that P-EASE is more energy-conserving and has higher location precision than EASE.

• Journal of Communications and Networks
• /
• 제17권4호
• /
• pp.339-345
• /
• 2015

In this paper, we present an iterative reliability-based modified majority-logic decoding algorithm for two classes of structured low-density parity-check codes. Different from the conventional modified one-step majority-logic decoding algorithms, we design a turbo-like iterative strategy to recover the performance degradation caused by the simply flipping operation. The main computational loads of the presented algorithm include only binary logic and integer operations, resulting in low decoding complexity. Furthermore, by introducing the iterative set, a very small proportion (less than 6%) of variable nodes are involved in the reliability updating process, which can further reduce the computational complexity. Simulation results show that, combined with the factor correction technique and a well-designed non-uniform quantization scheme, the presented algorithm can achieve a significant performance improvement and a fast decoding speed, even with very small quantization levels (3-4 bits resolution). The presented algorithm provides a candidate for trade-offs between performance and complexity.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.28-37
• /
• 2008

In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink channels. We design a scheduler that selects a user for transmission and determines the transmission rate of the selected user based on the channel and backlog information of users. Since it requires prohibitively high computation complexity to determine an optimal scheduler for multi-user systems, we propose a low-complexity scheduling scheme that can achieve near-optimal performance. In this scheme, we reduce the complexity by decomposing the multiuser problem into multiple individual user problems. We arrange the probability of selecting each user such that it can be determined only by the information of the corresponding user and then optimize the transmission rate of each user independently. We solve the user problem by using a dynamic programming approach and analyze the upper and lower bounds of average transmission power and average delay, respectively. In addition, we investigate the effects of the user selection algorithm on the performance for different channel models. We show that a channel-adaptive user selection algorithm can improve the energy efficiency under uncorrelated channels but the gain is obtainable only for loose delay requirements in the case of correlated channels. Based on this, we propose a user selection algorithm that adapts itself to both the channel condition and the backlog level, which turns out to be energy-efficient over wide range of delay requirement regardless of the channel model.

• 한국통신학회논문지
• /
• 제32권8C호
• /
• pp.745-757
• /
• 2007

본 논문에서는 GPS 수신기로 유입되는 간섭 및 재밍 신호를 효율적으로 제거 또는 억압하기 위해 배열 안테나(way antenna)를 적용한 항 재밍(anti-jamming) GPS 시스템을 설계하고 운용 방안을 제시하였다. 특히 제안하는 안테나 구조 및 운용 방안은 전통적인 6 원형 배열 안테나(6 circular array antenna) 구조에서 중앙에 1개의 소자를 추가한 7 배열 원형 안테나 구조로써 주어진 간섭 및 재밍 환경 하에서 전력 효율적으로 운용된다. 아울러 적응형 배열 안테나를 사용하여 디지털 신호처리를 수행할 경우 성능이 우수한 것으로 잘 알려진 STAP(Space Time Adaptive Process)와 SFAP(Space Frequency Adaptive Process)를 적용하고 두 방식의 구조 및 복잡도에 관한 분석, 그리고 동일한 복잡도(Complexity) 조건에서 다양한 재밍 환경에서의 BER 성능 비교를 수행하였다.

• 디지털산업정보학회논문지
• /
• 제12권4호
• /
• pp.33-40
• /
• 2016

Previous works for detecting arrhythmia have mostly used nonlinear method to increase classification accuracy. Most methods require accurate detection of ECG signal, higher computational cost and larger processing time. But it is difficult to analyze the ECG signal because of various noise types. Also in the healthcare system based IOT that must continuously monitor people's situation, it is necessary to process ECG signal in realtime. Therefore it is necessary to design efficient algorithm that classifies different arrhythmia in realtime and decreases computational cost by extrating minimal feature. In this paper, we propose R wave detection considering complexity and arrhythmia classification based on binary coding. For this purpose, we detected R wave through SOM and then RR interval from noise-free ECG signal through the preprocessing method. Also, we classified arrhythmia in realtime by converting threshold variability of feature to binary code. R wave detection and PVC, PAC, Normal classification is evaluated by using 39 record of MIT-BIH arrhythmia database. The achieved scores indicate the average of 99.41%, 97.18%, 94.14%, 99.83% in R wave, PVC, PAC, Normal.

• 한국항공우주학회지
• /
• 제34권4호
• /
• pp.17-24
• /
• 2006

항공기의 주요 발사체 전투손상 중 하나이며 기체 생존성 설계에 중요한 영향을 미치는 수압램을 연구하였다. 수압램의 기본 개념과 물리적 원리, 연구사례를 조사하였다. 간단한 형상의 연료탱크 및 전투기 날개모델(ICW, Intermediate Complexity Wing)에 대해 발사체 관통 및 내부폭발 해석을 수행하였다. 구조-유체 간에 파손이 고려된 General 커플링과 커플링 면간의 상호작용을 정의하여, 구조의 파열과 유체의 터짐을 해석상에서 구현하였다. 유체 압력, 탱크 응력과 변형 등의 해석결과를 보였으며, 연구결과를 토대로 향후 가능성을 제시하였다.