• 정보보호학회논문지
• /
• 제22권4호
• /
• pp.733-744
• /
• 2012

동적 임계 공개키 암호 시스템(dynamic threshold public-key encryption)이란 시스템을 구축하는 과정에서 전체 사용자들의 집합과 인증된 수신자 집합의 크기, 임계치를 고정값으로 설정하지 않고 유연하게 변경될 수 있는 기능을 제공하는 임계 암호 시스템을 말한다. 이와 관련하여 신원정보를 공개키로 사용하는 ID기반 암호 시스템(identity-based encryption)과 동적 임계 공개키 시스템을 결합하여 ID기반 동적 임계 암호 시스템(identity-based dynamic threshold encryption)을 설계하려는 연구가 이뤄지고 있으며, 최근 2011년 Xing과 Xu은 동적 기능을 제공하는 ID기반 임계 암호기법을 제안하였다. 본 논문에서는 Xing과 Xu가 제안한 ID기반 동적 임계 암호 시스템을 분석하고 구조적으로 문제점이 있음을 보인다. 또한 겹선형 함수를 이용한 ID기반 암호 시스템을 ID기반 동적 임계 암호 시스템으로 변환하는 방법(conversion method)를 제안한다. 마지막으로, 변환하여 설계한 기법이 완전한 풀 모델(full model)로 선택된 평문 공격(chosen plaintext attack)환경에서 안전함을 증명한다.

• 대한전자공학회논문지TC
• /
• 제38권10호
• /
• pp.24-33
• /
• 2001

패킷 통신에 있어서 주요 서비스 품질(QoS : Quality of Service) 요소로는 지연(delay), 지연 변이(delay variation), 패킷 손실율(loss rate) 등이 있다. 본 논문에서는 복수의 논리적 버퍼가 하나의 메모리 버퍼를 공유할 때, 논리버퍼의 손실율 성능을 향상시키기 위한 새로운 버퍼 할당 기법을 제안한다. 제안된 예방적 적응 한계치(PAT : Preventive Adaption Threshold) 버퍼 할당 기법은 기존의 동적 한계치 (Dynamic Threshold)기법에서 사용하는 패킷 폐기 한계치(threshold)의 직선적 변화 궤적과는 다른 한계치 동적 변화 궤적을 사용함으로써 패킷 손실율 성능을 개선하였다. 제안된 기법의 성능을 평가하기 위하여 기존의 무제어(NC : No Control), 고정 한계치(ST : Static Threshold), 동적 한계치(DT : Dynamic Threshold)등의 기법과 여러 측면에서 손실율 성능을 비교하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1235-1238
• /
• 2004

Thresholding has been used to reduce the number of gray values in images. Typically, a single threshold value has been used, resulting in two gray level images. Image reduction of one single threshold value, however, may lose too much of the high-frequency edge information. Thus, dynamic thresholding that uses a different threshold for each pixel is preferred instead of using a single threshold value. Dynamic thresholding can preserve high frequency details as well as reduce the size of images. Since it takes long time to perform existing software dynamic thresholding in an embedded system, this paper proposes and implements a circuit by using a FPGA in order to perform a real-time dynamic thresholding,. The proposed circuit consists of two counters, and threshold look-up table, and control unit. The values of two counters determine each pixel position, the threshold look-up table converts each pixel value into other value, and the control unit generates necessary control signals. On arriving from a camera to the proposed circuit, each pixel is compared with its threshold value and is converted into other gray value. An image processing system by using the proposed circuit will be implemented and some experiments will be performed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권11호
• /
• pp.2597-2615
• /
• 2013

This paper proposes a dynamic downlink load control scheme that jointly employs dynamic load threshold management and virtual coverage management schemes to reduce the degree of performance degradation due to traffic overload in two-tier femtocell networks. With the proposed scheme, the downlink load in a serving macrocell is controlled with a load threshold which is adjusted dynamically depending on the varying downlink load conditions of neighboring macrocells. In addition, traffic overloading is alleviated by virtually adjusting the coverage of the overloaded serving macrocell, based on the adjusted load threshold of the serving macrocell. Simulation results show that the proposed scheme improves the performance of two-tier femtocell networks in terms of the outage probability and sum throughput. This improvement is significantly increased with appropriate values of load thresholds and with an intermediate-level adjustment of the virtual coverage area (i.e., handover hysteresis margin: HOM). Furthermore, the proposed scheme outperforms both a previously proposed load control scheme with a static load threshold and the LTE system without a HOM adjustment.

• ETRI Journal
• /
• 제40권4호
• /
• pp.531-536
• /
• 2018

The weighted K-nearest neighbor (WKNN) algorithm is used to reduce positioning accuracy, as it uses a fixed number of neighbors to estimate the position. In this paper, we propose a dynamic threshold location algorithm (DH-KNN) to improve positioning accuracy. The proposed algorithm is designed based on a dynamic threshold to determine the number of neighbors and filter out singular reference points (RPs). We compare its performance with the WKNN and Enhanced K-Nearest Neighbor (EKNN) algorithms in test spaces of networks with dimensions of $20m{\times}20m$, $30m{\times}30m$, $40m{\times}40m$ and $50m{\times}50m$. Simulation results show that the maximum position accuracy of DH-KNN improves by 31.1%, and its maximum position error decreases by 23.5%. The results demonstrate that our proposed method achieves better performance than other well-known algorithms.

• Bulletin of the Korean Chemical Society
• /
• 제12권5호
• /
• pp.529-536
• /
• 1991

In this paper, the question whether the curvature of the minimum energy path can affect the dynamic threshold was tested using the boundary trajectory method developed by Chesnavich and coworkers. For nonreactive system, the MO EXP model potential surface was used with modified equilibrium distance to control the curvature. The results showed that there is no relation between the curvature and the dynamic threshold. In order to study the reactive system, a generalization of the boundary trajectory method was achieved to apply on the nonsymmetric system. We have found no correspondence between the curvature and the dynamic threshold of the system. It was also shown that the fate of the trajectories strongly depends on the shape of potential surface around the turning points along the symmetric stretch line.

• 반도체디스플레이기술학회지
• /
• 제6권2호
• /
• pp.5-10
• /
• 2007

According to the advantageous features of flash memory, its exploitation and application in mobile and ubiquitous related devices as well as voluminous storage devices is being increased rapidly. The inherent properties that are determined by configuration of flash memory unit might restrict the promising expansion in its utilization. In this paper, we study policies based on threshold values, instead of using global search, in order to satisfy our objective that is to decrease the necessary processing cost or penalty for recycling of flash memory space at the same time minimizing the potential degradation of performance. The proposed cleaning methods create partitions of candidate memory regions, to be reclaimed as free, by utilizing global or dynamic threshold values. The impact of the proposed policies is evaluated through a number of experiments, the composition of the optimal configuration featuring the methods is tested through experiments as well.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.438-441
• /
• 2004

Image binarization using a global threshold value [3] performs at high speed, but usually results in undesired binary images when the source images are of poor quality. In such cases, adaptive local thresholding algorithms [1][2][3] are used to obtain better results, and the algorithm proposed by A.E.Savekis which chooses local threshold using fore­ground and background clustering [1] is one of the best thresholding algorithms. However, this algorithm runs slowly due to its re-computing threshold value of each central pixel in a local window MxM. In this paper, we present a dynamic programming approach for the step of calculating local threshold value that reduces many redundant computations and improves the execution speed significantly. Experiments show that our proposal improvement runs more ten times faster than the original algorithm.

• ETRI Journal
• /
• 제37권4호
• /
• pp.736-742
• /
• 2015

A serial concatenated decoding algorithm with dynamic threshold is proposed for low-density parity-check codes with short and medium code lengths. The proposed approach uses a dynamic threshold to select a decoding result from belief propagation decoding and order statistic decoding, which improves the performance of the decoder at a negligible cost. Simulation results show that, under a high SNR region, the proposed concatenated decoder performs better than a serial concatenated decoder without threshold with an Eb/N0 gain of above 0.1 dB.

• Journal of Communications and Networks
• /
• 제5권1호
• /
• pp.82-89
• /
• 2003

In this paper, an efficient threshold-based filtering (TF) buffer management scheme is proposed. The TF is capable of minimizing the overall loss performance and improving the fairness of buffer usage in a shared buffer packet switch. The TF consists of two mechanisms. One mechanism is to classify the output ports as sctive or inactive by comparing their queue lengths with a dedicated buffer allocation factor. The other mechanism is to filter the arrival packets of inactive output ports when the total queue length exceeds a threshold value. A theoretical queuing model of TF is formulated and resolved for the overall packet loss probability. Computer simulations are used to compare the overall loss performance of TF, dynamic threshold (DT), static threshold (ST) and pushout (PO). We find that TF scheme is more robust against dynamic traffic variations than DT and ST. Also, although the over-all loss performance between TF and PO are close to each other, the implementation of TF is much simpler than the PO.