• 한국컴퓨터정보학회논문지
• /
• 제17권12호
• /
• pp.149-158
• /
• 2012

본 논문에서는 점근적으로 최적인 두가지의 무작위화 함수인 일라이어스(Elias) 함수와 페레즈(Peres) 함수의 장단점을 고려한 하이브리드 무작위화 함수를 제안한다. 무작위화 함수는 편향성이 있는 무작위수의 공급원으로부터 균등한 무작위수를 생성하는데 쓰이는 알고리즘을 수학적으로 추상화한 것이다. 일라이어스 함수와 페레즈 함수는 입력의 길이가 무한으로 증가함에 따라 그 출력효율성이 정보론적 한계치에 다가간다. 특히, 일라이어스 함수는 주어진 (유한의) 입력길이에 대해 최적인 무작위화 함수이다. 그러나 그 계산은 간단하지 않고, 주어진 입력길이에 의존한다. 반면, 페레즈 함수는 정해진 입력의 길이에 대해 출력효율이 최적이지는 않으나, 점근적으로는 최적이고, 간단한 재귀식에 의해 정의되어서 그 계산이 매우 간단하고 적은 메모리를 필요로 한다. 이러한 계산복잡도와 출력효율에 대한 두가지 무작위화 함수의 장단점에 주목하여, 각각의 장점을 고려한 하이브리드 무작위화 함수를 제안하고 이를 분석한다.

• 한국정보통신학회논문지
• /
• 제21권2호
• /
• pp.429-434
• /
• 2017

n개의 정점들을 가지는 그래프 G=(V, E)에서 각 정점에는 마지막에 놓여야 하는 고유한 상자가 존재한다. 따라서 각 정점과 상자를 1부터 n까지의 정수로 나타내고 정점 i에 놓여야 하는 상자는 상자 i로 나타낸다. 하지만 초기에 상자들은 순열(permutation) ${\pi}$에 따라서 정점 i에 상자 ${\pi}$(i)가 놓여있다. 각 단계에서 로봇은 G의 한 에지 상을 움직일 수 있고, 어떤 순간에 많아야 하나의 상자를 운반할 수 있다. 또한 정점에 도착하면 운반 중인 상자와 정점에 놓여 있는 상자를 교환할 수 있다. 문제는 모든 정점이 자신의 상자를 받을 수 있도록, 다시 말해서, ${\pi}$에 의해 섞여진 상자를 정렬하는, 로봇의 움직임의 최소 단계 수를 찾는 것이다. 본 논문에서는 그래프 G가 사이클(cycle)인 경우에 최소 단계수의 상한 값을 찾고 이 단계 안에 정렬을 수행하는 로봇의 움직임을 $O(n^2)$ 시간에 찾는 수 있음을 보일 것이다.

• 한국지능시스템학회논문지
• /
• 제12권3호
• /
• pp.239-245
• /
• 2002

본 논문에서는 입력에 제한이 있는 시간지연 비선형 시스템에 대한 퍼지 $H_2/H_{\infty}$ 제어기 설계 방법을 제시한다. 포화입력을 갖는 시간지연 비선형 시스템을 시간지연과 포화입력을 갖는 Takagi-Sugeno 퍼지 모델로 표현하고 병렬분산보상(PDC)의 개념을 이용하여 제어기를 설계한다. Lyapunov 함수를 이용하여 시간지연과 포화입력을 갖는 $H_2/H_{\infty}$ 퍼지모델에 대한 폐루프 시스템의 안정성 조건과 LQ 성능을 최소화하는 조건을 유도하고, 퍼지 $H_2/H_{\infty}$ 제어기가 존재할 충분조건을 선형행렬부등식(LMI: liner matrix inequality)을 이용하여 구한다. 제어기는 선형행렬부등식의 해를 구하므로써 바로 구할 수 있으며, 설계된 퍼지 $H_2/H_{\infty}$ 제어기는 $H_{\infty}$ 노옴 한계값을 만족하면서 LQ성능의 상한값을 최소화한다. 마지막으로 포화압력으로 포화압력을 가지는 시간지연 비선형 시스템에 대해 퍼지 $H_2/H_{\infty}$ 제어기 설계 사례를 보인다.

• Journal of Electrical Engineering and Technology
• /
• 제9권5호
• /
• pp.1774-1779
• /
• 2014

It is known that muscle strength of human body can alter or deteriorate as aging. In this study, we present an inverse dynamics simulation to investigate the effect of muscle strength on performing the daily activities. A 3D musculoskeletal model developed in this study includes several segments of whole body, long and short muscles, ligaments and disc stiffness. Five daily activities such as standing, flexion, finger tip to floor, standing lift close and lifting flexed were simulated with varying the maximum muscle force capacities (MFC) of each muscle fascicles from 30 to $90N/cm^2$ with an increment of $30N/cm^2$. In the result, no solution can be obtained for finger tip to floor and lifting flexed with $30N/cm^2$. Even though the solution was available for standing lift close activity in case of $30N/cm^2$ capacity, many of muscle fascicles hit the upper bound of muscle strength which means that it is not physiologically possible to perform the acvities in reality. For lifing flexed, even the case of $60N/cm^2$ capaciy, represents the moderate healthy people, was not able to find the solutions, showing that 18 muscles among 258 muscle fascicles reached 100% of muscle capacity. The estimated results imply that people who have low muscle strength such as elders or rehabilitation patients were required higher muscle work to perform and maintain the same daily activities than healthy one.

• 펄프종이기술
• /
• 제39권3호
• /
• pp.70-76
• /
• 2007

The raw oriental lacquer produced in China was used in this study. This lacquer was diluted with ethanol and terpene in different solvent ratios. The diluted lacquer in the solvents had two layers. The upper layer was solvent soluble and the lower contained precipitates. Hanji was treated with the solvent solubles and the mixture containing precipitates, and then properties of the Hanji were evaluated. The average weight, thickness, and density of Hanji treated with oriental lacquer tended to gradually be decreased as the lower concentration of lacquer was used and as the solvent soluble was treated. Tensile strength of the treated Hanji decreased when the diluted lacquer was used and Hanji treated with terpene dilution at the ratio of lacquer to solvent of 1:5 (v/v) showed higher tensile strength than ones treated with ethanol dilution. The folding endurance decreased as the less concentrated lacquer was used and the highest value was obtained when 1:40 (v/v) of lacquer to solvent ratio in both ethanol and terpene mixture. Absorption ratio was higher in the Hanji treated with ethanol mixture, treated with the lacquer in lower concentration, and treated with ethanol mixture. Hanji treated with ethanol dilution at 1:20 (v/v) and the lower ratio of lacquer to solvent showed a hydrophobic property. Amount of the bound dye materials tended to be decreasing as the concentration of lacquer became lower and it was higher in Hanji treated with ethanol mixture than with terpene mixture.

• 한국식품과학회지
• /
• 제30권4호
• /
• pp.970-975
• /
• 1998

약용 식물로부터 여러 효소의 저해제를 탐색 하였다. 한국산 우롱차엽으로부터 80%의 아세톤 추출물을 Sephadex LH-20, MCI-gel, Fuji gel 등을 사용하여 분리하였고 이 화합물은 Anisaldehyde 및 $FeCl_3$에 붉은색과 청색을 나타내었다. 이 화합물의 유도체화에 의한 기기분석 결과에서 상부는 -(-)epicatechin로 하부는 -(-)epigallocatechin 3-O-gallate 결합된 dimeric proanthocyanidin 종류인, $epicatechin-(4{\beta}{\rightarrow}8)-epigallocatechin{\;}3-O-gallate$로 화학 구조가 결정되었다. Xanthin oxidase 저해 효과에서는 $50{\;}{\mu}mole$에서 62%의 저해를 보여주어 앞으로 통풍 예방 기능성 식품 신소재로서의 이용이 가능하다는 것을 확인하였다.

• 산업경영시스템학회지
• /
• 제42권1호
• /
• pp.143-150
• /
• 2019

We focus on the weapon target assignment and fire scheduling problem (WTAFSP) with the objective of minimizing the makespan, i.e., the latest completion time of a given set of firing operations. In this study, we assume that there are m available weapons to fire at n targets (> m). The artillery attack operation consists of two steps of sequential procedure : assignment of weapons to the targets; and scheduling firing operations against the targets that are assigned to each weapon. This problem is a combination of weapon target assignment problem (WTAP) and fire scheduling problem (FSP). To solve this problem, we define the problem with a mixed integer programming model. Then, we develop exact algorithms based on a dynamic programming technique. Also, we suggest how to find lower bounds and upper bounds to a given problem. To evaluate the performance of developed exact algorithms, computational experiments are performed on randomly generated problems. From the results, we can see suggested exact algorithm solves problems of a medium size within a reasonable amount of computation time. Also, the results show that the computation time required for suggested exact algorithm can be seen to increase rapidly as the problem size grows. We report the result with analysis and give directions for future research for this study. This study is meaningful in that it suggests an exact algorithm for a more realistic problem than existing researches. Also, this study can provide a basis for developing algorithms that can solve larger size problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3412-3432
• /
• 2019

Recent advances in radio frequency (RF) power transfer provide a promising technology to power sensor nodes. Adoption of mobile chargers to replenish the nodes' energy has recently attracted a lot of attention and the mobility assisted energy replenishment provides predictable and sustained power service. In this paper, we study the joint optimization of mobile charging and data gathering in sensor networks. A wireless multi-functional vehicle (WMV) is employed and periodically moves along specified trajectories, charge the sensors and gather the sensed data via one-hop communication. The objective of this paper is to maximize the uplink throughput by optimally allocating the time for the downlink wireless energy transfer by the WMV and the uplink transmissions of different sensors. We consider two scenarios where the WMV moves in a straight line and around a circle. By time discretization, the optimization problem is formulated as a 0-1 programming problem. We obtain the upper and lower bounds of the problem by converting the original 0-1 programming problem into a linear programming problem and then obtain the optimal solution by using branch and bound algorithm. We further prove that the network throughput is independent of the WMV's velocity under certain conditions. Performance of our proposed algorithm is evaluated through extensive simulations. The results validate the correctness of our proposed theorems and demonstrate that our algorithm outperforms two baseline algorithms in achieved throughput under different settings.

• 한국정보통신학회논문지
• /
• 제23권6호
• /
• pp.711-718
• /
• 2019

이진결정도는 고장수목 해석에서 기존의 Boolean Logic 해석법의 잘 알려진 대체 방법이다. 고장수목의 규모가 커짐에 따라 계산에 필요한 컴퓨터 연산시간과 자원이 급격하게 증가한다. 이진결정도로부터 단절집합 및 최소단절 집합을 효과적으로 계산하기 위해 새로운 고장경로 탐색법과 고장경로 재구성 방법이 제안되었다. 고장경로 그룹화와 Bottom-Up 탐색법은 고장경로의 탐색에 효율적임을 증명하였고, 최소단절집합 계산을 위한 단절집합의 비교계산 횟수를 줄이기 위해 경로 재구성 방법을 사용할 수 있음을 증명하였다. 새로 제안된 방법을 적용하고, 기존의 근사확률 공식인 MCUB 확률공식과 동일한 새로운 ASDMP 확률공식을 사용하여 정상사상 확률을 계산 할 수 있다.

• 한국컴퓨터정보학회논문지
• /
• 제24권2호
• /
• pp.139-147
• /
• 2019

A false alarm, which is an incorrect report of an emergency, could trigger an unnecessary action. The predictive maintenance framework developed in our previous work has a feature whereby a machine alarm is triggered based on sensor data evaluation. The sensor data evaluator performs three essential evaluation steps. First, it evaluates each sensor data value based on its threshold (lower and upper bound) and labels the data value as "alarm" when the threshold is exceeded. Second, it calculates the duration of the occurrence of the alarm. Finally, in the third step, a domain expert is required to assess the results from the previous two steps and to determine, thereby, whether the alarm is true or false. There are drawbacks of the current evaluation method. It suffers from a high false-alarm ratio, and moreover, given the vast amount of sensor data to be assessed by the domain expert, the process of evaluation is prolonged and inefficient. In this paper, we propose a method for automatic false-alarm labeling that mimics how the domain expert determines false alarms. The domain expert determines false alarms by evaluating two critical factors, specifically the duration of alarm occurrence and identification of anomalies before or while the alarm occurs. In our proposed method, Hierarchical Temporal Memory (HTM) is utilized to detect anomalies. It is an unsupervised approach that is suitable to our main data characteristic, which is the lack of an example of the normal form of sensor data. The result shows that the technique is effective for automatic labeling of false alarms in sensor data.