• Journal of Astronomy and Space Sciences
• /
• 제38권4호
• /
• pp.217-227
• /
• 2021

In this study, we describe an analytical process for designing a low Earth orbit constellation for discontinuous regional coverage, to be used for a surveillance and reconnaissance space mission. The objective of this study was to configure a satellite constellation that targeted multiple areas near the Korean Peninsula. The constellation design forms part of a discontinuous regional coverage problem with a minimum revisit time. We first introduced an optimal inclination search algorithm to calculate the orbital inclination that maximizes the geometrical coverage of single or multiple ground targets. The common ground track (CGT) constellation pattern with a repeating period of one nodal day was then used to construct the rest of the orbital elements of the constellation. Combining these results, we present an analytical design process that users can directly apply to their own situation. For Seoul, for example, 39.0° was determined as the optimal orbital inclination, and the maximum and average revisit times were 58.1 min and 27.9 min for a 20-satellite constellation, and 42.5 min and 19.7 min for a 30-satellite CGT constellation, respectively. This study also compares the revisit times of the proposed method with those of a traditional Walker-Delta constellation under three inclination conditions: optimal inclination, restricted inclination by launch trajectories from the Korean Peninsula, and inclination for the sun-synchronous orbit. A comparison showed that the CGT constellation had the shortest revisit times with a non-optimal inclination condition. The results of this analysis can serve as a reference for determining the appropriate constellation pattern for a given inclination condition.

• 한국통신학회논문지
• /
• 제34권11B호
• /
• pp.1133-1141
• /
• 2009

본 논문에서는 무선 센서 망으로 k-연결 (k+1)-감지 고장 감내 위상을 구성하는 분산 위상 제어 프로토콜을 제시한다. 센서 망에 있어 최근에 주목받고 있는 근본적인 문제는 최소한의 활동하는 노드들로 위상을 구성하며, 다양한 응용과 환경에 적합한 감지도와 망 연결수를 제공하는 것이다. 망의 수용 능력을 증대시키는 동시에 에너지 효율성을 개선하고 더불어 망의 연결성을 유지하기 위해서, 많은 위상 제어 알고리즘들이 제안되어 왔다. 대부분의 알고리즘들은 연결되는 링크들의 수를 줄임으로써, 노드들의 고장이나 파손시에 여분의 경로배정이 어렵게 되는 문제를 발생시킨다. 특정 감지도를 보장하며 이 문제를 해결하는 프로토콜이 제안되었으나, 감지도 계산을 위해서는 정확한 위치정보가 필요하고, k-감지인 경우에 대부분의 활동 센서들이 2k-연결을 유지한다. 우리는 감지범위의 반지름이 통신 범위의 반지름의 두 배인 조건이 연결이 감지범위를 함의하기 위한 필요충분조건임을 증명하고, 이에 기반하여 무선 센서 망에서 k-연결을 제공하며 (k+1)-감지를 보장하는 고장 감내 위상을 구성하는 프로토콜을 제시한다. 제안한 분산된 알고리즘은 정확한 위치정보 없이 (k+1)-감지를 보장하며, 복잡도는 O(1) 이다. 모의 실험하여 패킷손실율과 전송 지연시간 그리고 에너지 소비율을 분석 하였다.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2005년도 추계학술대회
• /
• pp.71-84
• /
• 2005

The Fieller-Creasy problem involves statistical inference about the ratio of two independent normal means. It is difficult problem from either a frequentist or a likelihood perspective. As an alternatives, a Bayesian analysis with noninformative priors may provide a solution to this problem. In this paper, we extend the results of Yin and Ghosh (2001) to unbalanced sample case. We find various noninformative priors such as first and second order matching priors, reference and Jeffreys' priors. The posterior propriety under the proposed noninformative priors will be given. Using real data, we provide illustrative examples. Through simulation study, we compute the frequentist coverage probabilities for probability matching and reference priors. Some simulation results will be given.

• Journal of Electrical Engineering and information Science
• /
• 제2권5호
• /
• pp.1-8
• /
• 1997

The main purpose of the Boolean equivalence problem is to verify that two Boolean expressions have the same functionality. Simulation has been extensively used as the standard method for the equivalence problem. Obviously, the number of tests required to perform a satisfactory coverage grows exponentially with the number of input variables. However, formal methods as opposed to simulation are getting more attention from the community. We propose a new algorithm called the Cover-Merge Algorithm based on a derivational method using the concept of cover and merge for the equivalence problem and investigate its theoretical aspects. Because of the difficulty of the problem, we emphasize simplification techniques in order to reduce the search space or problem size. Heuristics based on types of merges are developed to speed up the derivation process by allowing simplifications. In comparison with widely used technique called Binary Decision Diagram or BDD, the algorithm proposed outperforms BDD in nearly all cases of input including standard benchmark problems.

• Journal of Communications and Networks
• /
• 제16권3호
• /
• pp.335-343
• /
• 2014

This paper considers the crucial problem of deploying wireless relays for achieving a connected wireless sensor network in indoor environments, an important aspect related to the management of the sensor network. Several algorithms have been proposed for ensuring full sensing coverage and network connectivity. These algorithms are not applicable to indoor environments because of the complexity of indoor environments, in which a radio signal can be dramatically degraded by obstacles such as walls. We first prove theoretically that the indoor relay placement problem is NP-hard. We then predict the radio coverage of a given relay deployment in indoor environments. We consider two practical scenarios; wire-connected relays and radio-connected relays. For the network with wire-connected relays, we propose an efficient greedy algorithm to compute the deployment locations of relays for achieving the required coverage percentage. This algorithm is proved to provide a $H_n$ factor approximation to the theoretical optimum, where $H_n=1+{\frac{1}{2}}+{\cdots}+{\frac{1}{n}}={\ln}(n)+1$, and n is the number of all grid points. In the network with radio-connected relays, relays have to be connected in an ad hoc mode. We then propose an algorithm based on the previous algorithm for ensuring the connectivity of relays. Experimental results demonstrate that the proposed algorithms achieve better performance than baseline algorithms.

• 한국정보통신학회논문지
• /
• 제18권7호
• /
• pp.1540-1546
• /
• 2014

인도어 기지국(Indoor BS) 결함으로 인해 발생하는 커버리지홀 문제를 해결하기 위하여, 새로운 프레임 구조와 최적화 기법 기반의 실제적인 알고리즘을 제안한다. 우리의 핵심 공헌은 다음과 같다: 1) 갑작스런 IBS 결함 문제 해결을 위한 힐링(healing) 채널을 가지는 새로운 프레임 구조를 제안하고 2) 최적화 문제의 복잡도 감소를 위한 고정적 IBS 선택에 기반한 효과적인 휴리스틱 자원할당 알고리즘을 제안한다. 시뮬레이션을 통하여 평균 셀 용량과 사용자 공평성 관점에서 기존 알고리즘에 비해 제안 방안이 우수함을 증명한다.

• 센서학회지
• /
• 제19권5호
• /
• pp.391-397
• /
• 2010

This paper proposes a differential structure sensor for detecting Ringer's solution exhaustion, in which three C-type electrodes of 10 mm width are disposed on a ringer hose at a distance of 5 mm each other in the direction of Ringer's solution flow. In the center of middle electrode, two capacitances are formed at the proposed sensor. When ringer hose is filled with Ringer's solution, there is no difference between two capacitances. But capacitance difference exist under the Ringer's solution shortage, because the shortage causes the hose filled with air from the top position electrode. The capacitance difference got to maximum 1.81 pF, when air was filled between top and middle electrode and the last of hose was filled with 10 % dextrose injection Ringer's solution. The capacitance difference varied with hose-wraparound coverage of electrodes as well as the width of them. For hose-wraparound electrode coverage of 90 % and 70 %, the maximum capacitance difference was 1.81 pF and 1.56 pF, respectively. A differential charge amplifier converted the capacitance difference to electric signal, and minimized electrodes' adhering problem and external noise coupling problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.1951-1972
• /
• 2018

Wi-Fi Access Point (AP) optimization approaches are used in indoor positioning systems for signal coverage enhancement, as well as positioning precision improvement. Although the huge power consumption of the AP optimization forms a serious problem due to the signal coverage requirement for large-scale indoor environment, the conventional approaches treat the problem of power consumption independent from the design of indoor positioning systems. This paper proposes a new Fast Water-filling algorithm Group Power Constraint (FWA-GPC) based Wi-Fi AP optimization approach for indoor positioning in which the power consumed by the AP optimization is significantly considered. This paper has three contributions. First, it is not restricted to conventional concept of one AP for one candidate AP location, but considered spare APs once the active APs break off. Second, it utilizes the concept of water-filling model from adaptive channel power allocation to calculate the number of APs for each candidate AP location by maximizing the location fingerprint discrimination. Third, it uses a fast version, namely Fast Water-filling algorithm, to search for the optimal solution efficiently. The experimental results conducted in two typical indoor Wi-Fi environments prove that the proposed FWA-GPC performs better than the conventional AP optimization approaches.

• Industrial Engineering and Management Systems
• /
• 제8권1호
• /
• pp.47-53
• /
• 2009

We define product line (or mix) selection problem as selecting a subset of potential product variants that can simultaneously minimize product proliferation and maintain market coverage. Selecting the most efficient product mix is a complex problem, which requires analyses of multiple criteria. This paper proposes a method based on Data Envelopment Analysis (DEA) for product line selection. Data Envelopment Analysis (DEA) is a linear programming based technique commonly used for measuring the relative performance of a group of decision making units with multiple inputs and outputs. Although DEA has been proved to be an effective evaluation tool in many fields, it has not been applied to solve the product line selection problem. In this study, we construct a five-step method that systematically adopts DEA to solve a product line selection problem. We then apply the proposed method to an existing line of staplers to provide quantitative evidence for managers to generate desirable decisions to maximize the company profits while also fulfilling market demands.

• 한국정보과학회논문지:시스템및이론
• /
• 제26권9호
• /
• pp.1177-1184
• /
• 1999

본 논문에서는 스캔플립프롭 선택 시간이 짧고 높은 고장 검출률(fault coverage)을 얻을 수 있는 새로운 부분스캔 설계 기술을 제안한다. 순차회로에서 테스트패턴 생성을 용이하게 하기 위하여 완전스캔 및 부분스캔 설계 기술이 널리 이용되고 있다. 스캔 설계로 인한 추가영역을 최소화 하고 최대의 고장 검출률을 목표로 하는 부분스캔 기술은 크게 구조분석과 테스트 가능도(testability)에 의한 설계 기술로 나누어 볼 수 있다. 구조분석에 의한 부분스캔은 짧은 시간에 스캔플립프롭을 선택할 수 있지만 고장 검출률은 낮다. 반면 테스트 가능도에 의한 부분스캔은 구조분석에 의한 부분스캔보다 스캔플립프롭의 선택 시간이 많이 걸리는 단점이 있지만 높은 고장 검출률을 나타낸다. 본 논문에서는 구조분석에 의한 부분스캔과 테스트 가능도에 의한 부분스캔 설계 기술의 장단점을 비교.분석하여 통합함으로써 스캔플립프롭 선택 시간을 단축하고 고장 검출률을 높일 수 있는 새로운 부분스캔 설계 기술을 제안한다. 실험결과 대부분의 ISCAS89 벤치마크 회로에서 스캔플립프롭 선택 시간은 현격히 감소하였고 비교적 높은 고장 검출률을 나타내었다.Abstract This paper provides a new partial scan design technique which not only reduces the time for selecting scan flip-flops but also improves fault coverage. To simplify the problem of the test pattern generation in the sequential circuits, full scan and partial scan design techniques have been widely adopted. The partial scan techniques which aim at minimizing the area overhead while maximizing the fault coverage, can be classified into the techniques based on structural analysis and testabilities. In case of the partial scan by structural analysis, it does not take much time to select scan flip-flops, but fault coverage is low. On the other hand, although the partial scan by testabilities generally results in high fault coverage, it requires more time to select scan flip-flops than the former method. In this paper, we analyzed and unified the strengths of the techniques by structural analysis and by testabilities. The new partial scan design technique not only reduces the time for selecting scan flip-flops but also improves fault coverage. Test results demonstrate the remarkable reduction of the time to select the scan flip-flops and high fault coverage in most ISCAS89 benchmark circuits.