• Journal of Magnetics
• /
• 제21권3호
• /
• pp.330-339
• /
• 2016

A magnetic field sensing system with a single primary sensor and multiple reference sensors deployed locally and orthogonally, was proposed for downlink signal reception and interference cancelling for Through-the-Earth Communication (TEC). This paper mathematically analyzes a design optimization process for a search coil magnetometer (SCM), and applies that process to minimize the bandwidth of the primary SCM for TEC signal reception and the volume of reference SCMs for multiple distributions. The primary SCM achieves a 3-dB bandwidth of 7 Hz, a sensitivity threshold of 120 fT/${\surd}$Hz, and a volume of $2.32{\times}10^{-4}m^3$. The entire sensing system volume is as small as $10^{-2}m^3$. Experiments with interference from industrial frequency harmonics demonstrated an average of 36 dB and 18 dB improvements in signal-to-interference ratio and signal-to-interference plus noise ratio, respectively, using multichannel recursive-least-squares algorithm. Thus, the proposed sensing system can reduce the interference effectively and allows reliable downlink signal reception.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1379-1383
• /
• 2005

Introducing the market into the electricity industry lets the multiple participants get into new competition. These multiple participants of the market need new business strategies for providing value added services to customer. Therefore they need the accurate customer information about the electricity demand. Demand characteristic is the most important one for analyzing customer information. In this study load profile data, which can be collected through the Automatic Meter Reading System, are analyzed for getting demand patterns of customer. The load profile data include electricity demand in 15 minutes interval. An algorithm for clustering similar demand patterns is developed using the load profile data. As results of classification, customers are separated into several groups. And the representative curves for the groups are generated. The number of groups is automatically generated. And it depends on the threshold value for distance to separate groups. The demand characteristics of the groups are discussed. Also, the compositions of demand contracts and standard industrial classification in each group are presented. It is expected that the classified curves will be used for tariff design, load forecasting, load management and so on. Also it will be a good infrastructure for making a value added service related to electricity.

• 한국정보통신학회논문지
• /
• 제16권2호
• /
• pp.213-221
• /
• 2012

본 논문에서는 클라우드 컴퓨팅 환경에서 효율적인 에너지 절감을 위한 동적 전원관리 시스템을 제안한다. 제안한 시스템은 사용자에게 할당된 가상 머신 운용을 위한 키보드와 마우스의 움직임을 감지하고, 가용메모리와 CPU 활용률을 모니터링하게 된다. 만약 시스템이 일정 시간동안 키보드와 마우스의 움직임을 감지하지 못하거나, CPU와 가용 메모리가 미리 정의된 임계값에 도달하게 되면 가상머신 관리자 프로그램은 클라이언트에게 종료 명령을 내리게 되어 상당한 전력절감이 가능하다. 개발된 시스템은 대학 내 실제 컴퓨터 실습실에 적용하여 그 성능을 평가하였다.

• Journal of Communications and Networks
• /
• 제5권3호
• /
• pp.249-257
• /
• 2003

Ring networks are very commonly exploited among local area and metropolitan area networks (LAN/MAN), whereas cells or small fixed-size packets are widely used in synchronized ring networks. In this paper, we present an analytical method for evaluating the delay-throughput performance of a MAC protocol with multiple self-tokens in a slotted ring network under uniform traffic. In our analysis, we introduce the stationary probability, which indicates the number of packets in a node. Also, it is assumed that each node has a sufficiently large amount of self-tokens, and a slotted ring has the symmetry. The analytical results with respect to delay-throughput performance have similar values to computer simulated ones. Furthermore, in order to achieve fair access under non-uniform traffic, we propose an adaptive MAC protocol, where the number of self-tokens in a node dynamically varies, based on the number of packets transmitted within a specified period. In the proposed protocol, when the number of packets transmitted by a node within a specified period is larger than a specified threshold, the node decreases the number of self-tokens in a per-node distributed method. That results in creating free slots in the ring, thus all nodes can obtain an equal opportunity to transmit into the ring. Performance results obtained by computer simulation show that our proposed protocol can maintain throughput fairness under non-uniform traffic.

• 의학교육논단
• /
• 제15권3호
• /
• pp.125-135
• /
• 2013

Since the establishment of the national medical licensing examination board in 1992, the medical licensing examination system has changed enormously and this has had a number of impacts on examination services. All those reforms were aimed at improving the relevance and reliability of the test. Several attempts of the testing system have appeared in the new examination service, and which have also brought about the changes in the medical school curriculum such as introducing integrated courses instead of traditional subjects, using test scores as a reference to the post-graduation selection test. Some examples of changes in the examination system are as follows: 1) choosing three integrated test subjects and outlines of their reference content instead of 15 academic subjects, 2) adjusting the ratio of multiple choice question items to focus more on the problem solving level, 3) introduction of 'one-best answer' single set and 'extended matching type items, 4) item construction based on real clinical cases and real clinical materials. Recently, a clinical skill test system has been introduced to measure examinees' basic clinical skills competencies. Despite continuing efforts, the examination system still has many issues remaining to be solved. These problems include the differential weighting of test items, appropriate threshold for passing, and practicality of pre-testing to stabilize the passing rate and avoid the hazards of newness and undesirably difficult test items.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권8호
• /
• pp.2875-2893
• /
• 2015

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.608-627
• /
• 2016

Wireless mesh networks (WMNs) based on IEEE 802.11s have emerged as one of the prominent technologies in multi-hop communications. However, the deployment of WMNs suffers from serious interference problem which severely limits the system capacity. Using multiple radios for each mesh router over multiple channels, the interference can be reduced and improve system capacity. Nevertheless, interference cannot be completely eliminated due to the limited number of available channels. An effective approach to mitigate interference is to apply dynamic channel switching (DCS) in WMNs. Conventional DCS schemes trigger channel switching if interference is detected or exceeds a predefined threshold which might cause unnecessary channel switching and long protocol overheads. In this paper, a P-learning based dynamic switching algorithm known as learning automaton (LA)-based DCS algorithm is proposed. Initially, an optimal channel for communicating node pairs is determined through the learning process. Then, a novel switching metric is introduced in our LA-based DCS algorithm to avoid unnecessary initialization of channel switching. Hence, the proposed LA-based DCS algorithm enables each pair of communicating mesh nodes to communicate over the least loaded channels and consequently improve network performance.

• Journal of Communications and Networks
• /
• 제4권2호
• /
• pp.148-157
• /
• 2002

This paper investigates schemes to improve TCP performance in multipath forwarding networks. In multipath routing, packets to the same destination are sent to multiple next-hops in either packet-level or flow-level forwarding mode. Effective bandwidth is increased since we can utilize unused capacity of multiple paths to the destination. In packet-level multipath forwarding networks, TCP performance may not be enhanced due to frequent out-of-order segment arrivals at the receiver because of different delays among paths. To overcome this problem, we propose simple TCP modifications. At the sender, the fast retransmission threshold is adjusted taking the number of paths into consideration. At the receiver, the delayed acknowledgment scheme is modified such that an acknowledgment for an out-of-order segment arrival is delayed in the same way for the in-order one. The number of unnecessary retransmissions and congestion window reductions is diminished, which is verified by extensive simulations. In flow-level multipath forwarding networks, hashing is used at routers to select outgoing link of a packet. Here, we show by simulations that TCP performance is increased in proportion to the number of paths regardless of delay differences.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2016년도 춘계학술대회
• /
• pp.666-668
• /
• 2016

Salt and pepper 잡음은 주로 전송 채널 또는 센서의 오류로 발생하며, 영상의 화질을 저하시키고 시각적 오류를 유발한다. 이러한 salt and pepper 잡음을 제거하기 위해 간단한 알고리즘과 우수한 잡음제거 성능을 나타내는 SMF(standard median filter)가 많이 사용되고 있다. 하지만 영상의 에지영역에서 보존 특성이 다소 미흡하다. 따라서 본 논문에서는 salt and pepper 잡음에 훼손된 영상을 효과적으로 복원하기 위해, 비잡음 신호는 그대로 보존하고 잡음 신호는 국부 마스크의 잡음 밀도임계값을 적용하여 그 크기에 따라 필터를 다르게 적용하는 다중 필터를 제안하였다.

• Journal of Communications and Networks
• /
• 제12권3호
• /
• pp.222-230
• /
• 2010

In this paper, we present a closed-form approximation of the average sum rate of zero-forcing (ZF) beamforming (BF) with semi-orthogonal user selection (SUS). We first derive the survival probability associated with the SUS that absolute square of the channel correlation between two users is less than the orthogonalization level threshold (OLT).With this result, each distribution for the number of surviving users at each iteration of the SUS and the number of streams for transmission is calculated. Secondly, the received signal power of ZF-BF is represented as a function of the elements of the upper triangular matrix from QR decomposition of the channel matrix. Thirdly, we approximate the received signal power of ZF-BF with the SUS as the maximum of scaled chisquare random variables where the scaling factor is approximated as a function of both OLT and the number of users in the system. Putting all the above derivations and order statistics together, the approximated ergodic sum rate of ZF-BF with the SUS is shown in a closed form. The simulation results verify that the approximation tightly matches with the sample average for any OLT and even for a small number of users.