• ETRI Journal
• /
• v.38 no.3
• /
• pp.560-567
• /
• 2016

To solve the problem of parameter optimization in image sensor-based visible light positioning systems, theoretical limits for both the location and the azimuth angle of the image sensor receiver (ISR) are calculated. In the case of a typical indoor scenario, maximum likelihood estimations for both the location and the azimuth angle of the ISR are first deduced. The Cramer-Rao Lower Bound (CRLB) is then derived, under the condition that the observation values of the image points are affected by white Gaussian noise. For typical parameters of LEDs and image sensors, simulation results show that accurate estimates for both the location and azimuth angle can be achieved, with positioning errors usually on the order of centimeters and azimuth angle errors being less than $1^{\circ}$. The estimation accuracy depends on the focal length of the lens and on the pixel size and frame rate of the ISR, as well as on the number of transmitters used.

• Journal of Digital Contents Society
• /
• v.6 no.1
• /
• pp.7-12
• /
• 2005

The purpose of this study is to study the relability of degree 2 ICR(Interleaved Cydic Ring) network and to compare with the other rings. Two node reliability is the probability that source node communicates with the destination node through a specified time interval for ICR network. The impact for change of failure rate is studied for ICR network for small size of network, the exact value of reliability is calculated but the approximation of average reliability general function from upper bound and lower bound reliability is obtained for large size of it. The reliability of ICR network is compared with it of the other rings according to changing the cycle value of ICR.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.254-264
• /
• 2007

This paper considers a scheduling problem to minimize the total weighted completion time in the two-stage assembly-type flowshop. The system is composed of multiple fabrication machines in the first stage and a final-assembly machine in the second stage. Each job consists of multiple components, each component is machined on the fabrication machine specified in advance. The manufactured components of each job are subsequently assembled into a final product on the final-assembly machine. The objective of this paper is to find the optimal schedule minimizing the total weighted completion time of jobs. Three lower bounds are derived and tested in a branch-and-bound (B&B) Procedure. Also, three heuristic algorithms are developed based on the greedy strategies. Computational results show that the proposed B&B procedure is more efficient than the previous work which has considered the same problem as this paper.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.5
• /
• pp.1523-1528
• /
• 2018

For $r{\geq}2$, let ${\mathcal{H}}$ be an r-uniform hypergraph with n vertices and m hyperedges. Let R be a random vertex set obtained by choosing each vertex of ${\mathcal{H}}$ independently with probability p. Let ${\mathcal{H}}[R]$ be the subhypergraph of ${\mathcal{H}}$ induced on R. We obtain an upper bound on the matching number ${\nu}({\mathcal{H}}[R])$ and a lower bound on the independence number ${\alpha}({\mathcal{H}}[R])$ of ${\mathcal{H}}[R]$. First, we show that if $mp^r{\geq}{\log}\;n$, then ${\nu}(H[R]){\leq}2e^{\ell}mp^r$ with probability at least $1-1/n^{\ell}$ for each positive integer ${\ell}$. It is best possible up to a constant factor depending only on ${\ell}$ if $m{\leq}n/r$. Next, we show that if $mp^r{\geq}{\log}\;n$, then ${\alpha}({\mathcal{H}}[R]){\geq}np-{\sqrt{3{\ell}np\;{\log}\;n}-2re^{\ell}mp^r$ with probability at least $1-3/n^{\ell}$.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.46 no.5
• /
• pp.360-366
• /
• 2001

Flour physicochemical properties of six Korean waxy wheat lines and their parental plants, including Kanto 107 and BaiHuo, which have partially null in GBSS (granule bound starch synthase), were evaluated in this study. The very low amylose content (3.20%) of Korean waxy wheat lines, which had been influenced by the null in all three GBSS isoforms encoded by three Wx loci, could result in the higher starch swelling power (25.15%), lower starch and flour pasting temperature (61.37$^{\circ}C$; 65.85$^{\circ}C$), and higher starch pasting peak viscosity and breakdown (246.60 RVU; 161.50 RVU) than those of their parental plants. In addition to high swelling and pasting properties, Korean waxy wheat lines had the higher protein content (12.80%), alkaline water retention capacity (97.39%), SDS sedimentation volume (80.33 $m\ell$) and damaged starch content (4.35 %) than those of their parental plants.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.2
• /
• pp.44-50
• /
• 2007

This paper deals with the problem of scheduling jobs and rate-modifying activities on parallel machines. A rate-modifying activity is an activity that changes the production rate of equipment such as maintenance and readjustment. If a job is scheduled after the rate-modifying activity, then the processing time varies depending on the modifying rate of the activity. In this study, we extend the single machine problem to parallel machines problem and propose algorithms is to schedule the rate-modifying activities and jobs to minimize the makespan on parallel machines which is NP-hard. We propose a branch and bound algorithm with three lower bounds to solve medium size problems optimally. Also we develop three heuristics, Modified Longest Processing Time, Modified MULTIFIT and Modified COMBINE algorithms to solve large size problems. The test results show that branch and bound algorithm finds the optimal solution in a reasonable time for medium size problems (up to 15 jobs and 5 machines). For large size problem, Modified COMBINE and Modified MULTIFIT algorithms outperform Modified LPT algorithm in terms of solution quality.

• Proceedings of the KSME Conference
• /
• 2008.11b
• /
• pp.2744-2749
• /
• 2008

Numerical calculations are carried out for the natural convection induced by temperature difference between a cold outer square cylinder and a hot inner circular cylinder for Rayleigh number of $Ra=10^7$. This study investigates the effect of the inner cylinder location on the heat transfer and fluid flow. The location of inner circular cylinder ($\delta$) is changed vertically along the center-line of square enclosure. The natural convection bifurcates from unsteady to steady state according to $\delta$. Two critical positions of ${\delta}_{C,L}$ and ${\delta}_{C,U}$ as a lower bound and an upper bound are ${\delta}_{C,L}=0.05$ and ${\delta}_{C,U}=0.18$, respectively. Within the defined bounds, the thermal and flow fields are steady state. When the inner cylinder locates at ${\delta}{\geq}{\delta}_{C,U}$, the space between the upper surface of inner cylinder and the top surface of the enclosure forms a relatively shallow layer where the natural convection characterized as the pure Rayleigh-Benard convection forms alternately the upwelling and downwelling plums, as a result that a series of cells known as Benard cells is derived.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.310-312
• /
• 2005

무선 인터넷 프록시 서버 클러스터에서 부하 분산기는 사용자의 요청을 각 서버(호스트)로 분산시키는 역할을 한다. 리눅스 가상 서버(LVS: Linux Virtual Server)는 소프트웨어적으로 사용되는 부하 분산기로서 여러 가지 스케줄링 방식들을 가지고 있다. 그러나 부하 분산시에 서버(호스트)의 유동적인 부하 정보를 반영하지 못하는 단점이 있다. 이에 개선된 방식으로 서버의 동시 연결 개수에 따라 상한계(Upper Bound)와 하한계(Lower Bound)를 설정하고, 요청을 분산하는 동적 스케줄링(Dynamic Scheduling)이 존재한다. 그러나 사용자의 요청 컨텐츠에 따라 상한계와 하한계가 바뀔 수 있음에도 불구하고 이 값들이 고정되어 있다는 단점을 가진다. 본 논문에서는 호스트 부하 정보에 기반한 스케줄링 방식을 제안한다. 제안된 방식은 호스트의 부하 정보를 바탕으로 사용자의 요청을 분산하였으며, 사용자의 요청에 따라 상한계와 하한계가 바뀔 수 있음을 고려하여 상한계와 하한계를 설정하지 않고 사용자 요청 컨텐츠에 따라 적절하게 요청이 분배되도록 하였다. 16대의 컴퓨터를 사용하여 실험을 수행하였으며, 실험 결과 사용자가 요청하는 컨텐츠가 동일한 경우에는 기존 스케줄링 방식과 $13\%$ 성능 감소를 다른 경우에는 기존 스케줄링 방식보다 $102\%$의 성능 향상을 보임을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.463-465
• /
• 2005

본 논문에서는 802.l1e MAC의 EDCA 모드를 기반으로 한 무선랜 환경에서 realtime data인 voice traffic의 QoS를 향상하기 위한 방안을 연구하였다. 동적으로 채널의 상태를 보고, 네트워크 상태를 예측하여 채널 경쟁에 참여할지를 결정하는 방안으로, 경쟁이 치열할 때 voice traffic에 차별화된 가중치를 더 줄 수 있어 전반적인 voice traffic의 성능 향상에 기여한다. 본 연구에서 SU(slot utilization)을 계산하여 PT(Probability of Transmission)을 구할 때, 기존의 DCC 알고리즘을 그대로 802.11e에 적용하게 되면 4개의 AC에 똑같은 알고리즘이 적용되어 802.11e의 핵심인 차별화된 QoS를 지원하는데 무리가 있다. 기존 DCC 알고리즘에서 재시도 회수만 고려해 구하는 것을 802.11e 구조에 맞추어 4개의 AC별로 차별화하여 전송확률(PT)를 구할 수 있게 하였다. 뿐만 아니라, 재시도 회수를 고려하여 재시도 회수가 않은 packet에는 PT값이 높게 나을 수 있게 하고, 최대 가능한 재시도 회수에 도달할 때에는 상위 AC 영역의 값이 나오게 하여 AC의 upgrade가 되는 효과를 가져오게 하였다. 이 때 각 AC의 lower bound와 upper bound를 정하고, 이 때 802.11e의 최대 재시도 회수 parameter와의 상관관계를 정의하여 하위 AC가 상위 AC의 영역을 침범하지 못하도록 정의하고 있다. 추가적으로 SU의 값을 구할 때에도 현재의 SU값 대신 누적된 평균 SU값을 사용해 PT값을 구하여, utilization, latency, Packet loss등 전반적인 부분의 성능개선을 확인할 수 있다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.5
• /
• pp.603-608
• /
• 2009

In this paper, a similarity measure between interval-valued vague sets is proposed. In the interval-valued vague sets representation, the upper bound and the lower bound of a vague set are represented as intervals of interval-valued fuzzy set respectively. Proposed method combines the concept of geometric distance and the center-of-gravity point of interval-valued vague set to evaluate the degree of similarity between interval-valued vague sets. We also prove three properties of the proposed similarity measure. It provides a useful way to measure the degree of similarity between interval-valued vague sets.