• Journal of the Korean Data and Information Science Society
• /
• 제15권4호
• /
• pp.743-752
• /
• 2004

In this paper, we develop the Bayesian model selection procedure using the reference prior for comparing two nested model such as the independent and intraclass models using the distance or divergence between the two as the basis of comparison. A suitable criterion for this is the power divergence measure as introduced by Cressie and Read(1984). Such a measure includes the Kullback -Liebler divergence measures and the Hellinger divergence measure as special cases. For this problem, the power divergence measure turns out to be a function solely of $\rho$, the intraclass correlation coefficient. Also, this function is convex, and the minimum is attained at $\rho=0$. We use reference prior for $\rho$. Due to the duality between hypothesis tests and set estimation, the hypothesis testing problem can also be solved by solving a corresponding set estimation problem. The present paper develops Bayesian method based on the Kullback-Liebler and Hellinger divergence measures, rejecting $H_0:\rho=0$ when the specified divergence measure exceeds some number d. This number d is so chosen that the resulting credible interval for the divergence measure has specified coverage probability $1-{\alpha}$. The length of such an interval is compared with the equal two-tailed credible interval and the HPD credible interval for $\rho$ with the same coverage probability which can also be inverted into acceptance regions of $H_0:\rho=0$. Example is considered where the HPD interval based on the one-at- a-time reference prior turns out to be the shortest credible interval having the same coverage probability.

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

유선 네트워크와 달리 무선 네트워크 환경에서의 브로드캐스팅은 단일 전송으로 다수의 노드들에게 데이터를 한 번에 송신할 수 있다. 즉, 무선 네트워크에서 특정 노드의 전방향적 브로드캐스팅은 인접한 모든 노드들에게 동시에 도달한다. 본 논문에서는 무선 네트워크에서 브로드캐스팅 시 전체 송신 전력을 최소화하는 최소 전력 브로드캐스팅 문제를 해결하기 위한 탐욕 알고리즘을 제안한다. 제안된 알고리즘은 각 노드간의 거리로 구성된 거리 행렬과 인접 노드의 수를 갖는 인접 행렬을 이용한다. 데이터를 수신한 노드 중 인접 노드를 가장 많이 가지고 있는 노드가 우선적으로 데이터를 전송한다. 제안된 알고리즘의 성능평가는 컴퓨터 시뮬레이션을 이용하여 네트워크상의 모든 노드로 브로드캐스팅 시 소요되는 송신 전력 관점에서 랜덤 방식과 비교하며, 실험 결과에서 제안된 알고리즘은 랜덤 방식보다 성능이 우수함을 보인다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2009년도 정보 및 제어 심포지움 논문집
• /
• pp.284-286
• /
• 2009

In this paper, we consider a cognitive radio system operating as secondary user. It uses an empty channel that is not currently used by primary users having the license to the channel. In the previous works, secondary user looks for an empty channel by choosing any channel in order or randomly and by sensing the channel to distinguish whether primary users are using. But if primary user is fixed type, we will find an empty channel faster than the mentioned channel selecting methods by using a method considering prior information about cases that primary user used the channel, since it is possible to analogize the channel access possibility of primary user according to regular time and position. Therefore, we propose a channel searching method based on the channel list for the purpose of reducing the channel searching time and improving throughput of secondary users. Firstly, we determine a weighting value of each channel based on the history of channel activities of primary users. This value is added to current channel state buffer and we search an empty channel from channel with smallest value to one with the biggest value. Finally, we compare the performances of the proposed method with those of the sequential channel searching and the random channel searching methods in terms of the average channel searching time and the average number of transmissions of secondary user.

• 디지털융복합연구
• /
• 제13권1호
• /
• pp.283-288
• /
• 2015

일회용 패스워드는 정적인 패스워드 사용에 따른 위험을 해결하고 사용자 인증을 강화하기 위해 필요하다. 개인정보 유출에 따른 사용자를 인증을 강화하기 위해 OTP 생성 알고리즘이 중요시 되고 있다. 본 논문에서 제안하는 OTP 생성 알고리즘은 Seed값과 Time값을 이용하여 256비트 크기의 OTP Data를 생성하게 된다. 생성한 OTP Data를 행렬로 나열하고 불규칙적으로 32비트의 값을 추출하게 되는 이 값이 최종적인 OTP값이 된다. OTP 생성 횟수가 많을수록 제안하는 알고리즘이 기존 알고리즘에 비해 충돌내성의 확률이 낮음을 알 수 있다.

• 한국시뮬레이션학회논문지
• /
• 제8권3호
• /
• pp.49-66
• /
• 1999

Semiconductor wafer fabrication is known to be one of the most complex manufacturing processes due to process intricacy, random yields, product diversity, and rapid changing technologies. In this study we are concerned with the impact of lot release and dispatching policies on the performance of semiconductor wafer fabrication facilities. We consider several semiconductor wafer fabrication environments according to the machine failure types such as no failure, normal MTBF, bottleneck with low MTBF, high randomness, and high MTBF cases. Lot release rules to be considered are Deterministic, Poisson process, WR(Workload Regulation), SA(Starvation Avoidance), and Multi-SA. These rules are combined with several dispatching rules such as FIFO (First In First Out), SRPT (Shortest Remaining Processing Time), and NING/M(smallest Number In Next Queue per Machine). We applied the combined policies to each of semiconductor wafer fabrication environments. These policies are assessed in terms of throughput and flow time. Basically Weins fabrication setup was used to make the simulation models. The simulation parameters were obtained through the preliminary simulation experiments. The key results throughout the simulation experiments is that Multi-SA and SA are the most robust rules, which give mostly good performance for any wafer fabrication environments when used with any dispatching rules. The more important result is that for each of wafer fabrication environments there exist the best and worst choices of lot release and dispatching policies. For example, the Poisson release rule results in the least throughput and largest flow time without regard to failure types and dispatching rules.

• 융합보안논문지
• /
• 제15권3_1호
• /
• pp.99-105
• /
• 2015

기존 SRAM 기반 PUF (physical unclonable function)는 난수 생성 및 키교환에 사용된다. SRAM에서 생성된 출력값은 일정하게 유지되어야 하나, 외부 환경에 의해 변화하는 문제가 발생된다. 본 논문은 듀얼 안티퓨즈 OTP (one time programmable) 메모리를 SRAM 기반 PUF에 채택한 새로운 구조의 D-PUF (deterministic PUF) 회로를 제안한다. 제안된 PUF 회로는 SRAM에서 한 번 생성된 출력값을 일정하게 계속 유지시켜 PUF 회로의 신뢰성을 향상시킬 수 있다. 우선, 높은 보안 수준을 갖는 안티퓨즈를 이용하여 OTP 메모리를 구성하였다. SRAM은 크로스 커플 인버터쌍의 미스매치를 이용하여 전원이 들어온 후 초기값을 임의로 생성하고 이를 출력한다. 마스킹된 출력값은 안티퓨즈 OTP ROM(read-only memory)에 난수값으로 프로그램된다. 한번 프로그램된 ROM 값은 되돌려지지도 변화하지도 않는다. 따라서, 제안된 D-PUF 회로는 SRAM의 출력값을 OTP 메모리에 저장시켜 한 번 결정된 PUF 출력값을 계속 유지시킨다. 제안된 D-PUF의 출력은 동작 전압 및 온도 변화 등과 같은 외부 환경 변수에 영향을 받지 않아 신뢰성이 향상된다. 따라서, 제안된 D-PUF는 강력한 오류 정정 코드없이 사용하더라도 안정적인 동작을 수행할 수 있다.

• 한국정보전자통신기술학회논문지
• /
• 제9권1호
• /
• pp.67-74
• /
• 2016

본 논문에서는 믹스 음악을 위한 디지털 오디오 워터마킹 기술을 제안하였다. 믹스 음악은 기존에 저작권이 확보되어 있는 음악을 편집하여 한편의 오디오 클립에 다수의 음악이 포함되어 있는 재창조된 음악을 의미한다. 오디오 콘텐츠와 관련된 저작권료는 보통 완전체 오디오를 기준으로 부과된다. 그러나 믹스 음악의 경우에는 오디오 완전체를 모두 사용하는 것이 아니라 일부만을 이용하기 때문에 저작권료의 산정에서 저작권자와 사용자간의 분쟁의 소지를 갖고 있다. 본 연구에서는 이와 같은 오디오 저작권료와 관련된 문제의 기술적인 해결 방법으로서 믹스 음악을 구성하고 있는 각각의 오디오 콘텐츠에 대하여 서로 다른 워터마크를 삽입하여 음악을 구분할 수 있는 워터마킹 기술을 제안하였다. 제안된 기술은 기존의 워터마킹 방법과 달리 믹스음악을 구성하는 각각의 오디오에 대하여 서로 다른 워터마크를 삽입하기 때문에 오디오 전체에 대하여 워터마크를 삽입하는 기존의 방법과 달리 오디오의 품질을 떨어뜨리는 단점이 있다. 이에 대한 기술적 해결로서 비 가청성이 강조된 이진 랜덤 열을 이용하고 워터마크 삽입에 따른 신호의 왜곡 특성이 가장 적은 크기 변조 오디오 워터마킹 기술을 이용하였다. 제안된 방법은 워터마크의 추출 특성을 통하여 성능을 검증하였다.

• 한국멀티미디어학회논문지
• /
• 제25권10호
• /
• pp.1404-1415
• /
• 2022

The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.

• ETRI Journal
• /
• 제34권6호
• /
• pp.807-815
• /
• 2012

In this paper, we propose a scheme for partially dynamic lane control for energy saving in multilane-based high-speed Ethernet. In this scheme, among the given transmission lanes, at least one lane is always operating, and the remaining lanes are dynamically activated to alleviate the network performance in terms of queuing delay and packet loss in the range of acceptance. The number of active lanes is determined by the decision algorithm based on the information regarding traffic and queue status. The reconciliation sublayer adjusts the transmission lane with the updated number of lanes received from the algorithm, which guarantees no processing delay in the media access control layer, no overhead, and minimal delay of the exchanging control frames. The proposed scheme is simulated in terms of queuing delay, packet loss rate, lane changes, and energy saving using an OPNET simulator. Our results indicate that energy savings of around 55% (or, when the offered load is less than 0.25, a significant additional savings of up to 75%) can be obtained with a queuing delay of less than 1 ms, a packet loss of less than $10^{-4}$, and a control packet exchange time of less than $0.5{\mu}s$ in random traffic.

• Earthquakes and Structures
• /
• 제11권3호
• /
• pp.445-459
• /
• 2016

Quantitative estimation of seismic response of various structural systems at the collapse limit state is one of the most significant objectives in Performance-Based Earthquake Engineering (PBEE). Assessing the effects of uncertainties, due to variability in ground motion characteristics and random nature of earthquakes, on nonlinear structural response is a pivotal issue regarding collapse safety prediction. Incremental Dynamic Analysis (IDA) and fragility curves are utilized to estimate demand parameters and seismic performance levels of structures. Since producing these curves based on a large number of nonlinear dynamic analyses would be time-consuming, selection of appropriate earthquake ground motion records resulting in reliable responses with sufficient accuracy seems to be quite essential. The aim of this research study is to propose a methodology to assess the seismic behavior of reinforced concrete frames at collapse limit state via accurate estimation of seismic fragility curves for different Engineering Demand Parameters (EDPs) by using a limited number of ground motion records. Research results demonstrate that accurate estimating of structural collapse capacity is feasible through applying the proposed method offering an appropriate suite of limited ground motion records.