• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.106-113
• /
• 2014

Recently, to reduce test cost by efficiently compressing test patterns for SOCs(System-on-a-chip), different compression techniques have been proposed including the FDR(Frequency-directed run-length) algorithm. FDR is extended to EFDR(Extended-FDR), SAFDR(Shifted-Alternate-FDR) and VPDFDR(Variable Prefix Dual-FDR) to improve the compression ratio. In this paper, a frequency-ordered modification is proposed to further augment the compression ratios of FDR, EFDR, SAFRD and VPDFDR. The compression ratio can be maximized by using frequency-ordered method and consequently the overall manufacturing test cost and time can be reduced significantly.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.5
• /
• pp.93-100
• /
• 2011

In this paper, we propose a FDR(False Data Reduction) strategy for P2P environment that reduces false data. The key idea of our strategy is that we use FDR algorithm to stop transmitting of false data and to delete that. If a user recognizes false data in downloaded-data and the user's peer requests the others to stop the transmission of the false data immediately. Also, the FDR algorithm notifies the other peers to prohibit spreading of the false data in the environment. All this procedure is possible to be executed in each peer without any lookup server. The FDR algorithm needs only a little data exchange among peers. Through simulation, we show that it is more effective to reduce the network traffic than the previous P2P strategy. We also show that the proposed strategy improves the performance of network compared to previous P2P strategy. As a result, The FDR strategy is decreased 9.78 ~ 16.84% of mean true data transmission time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.25-27
• /
• 2004

시스템이 대형화가 되어가고 네트워크 환경이 발전함에 따라 분산 환경이 점점 더 증대되어 가고 있다. 이러한 분산 환경에서 사용되는 리더 선출 알고리즘(Leader Election Algorithm)은 다양하게 제시되었고 본 논문에서는 Garcia-Molina가 제시한 Bully 알고리즘을 프로세스 알제브라 언어인 CSP로 명세하고 FDR 모델체킹 도구를 이용해 해당 요구사항을 만족하는지 검증하였다.

• Journal of Advanced Navigation Technology
• /
• v.24 no.3
• /
• pp.163-172
• /
• 2020

Flight data recorder (FDR) for accident investigation is required to comply with EUROCAE(ED-112) standard so that flight data can be restored when exposed to extreme conditions due to aircraft crash. Since the ED-112 standard defines the general requirements for all aircraft, it is essential to analyze detailed requirements for FDR software to apply appropriate requirements selectively according to the configuration and operation concept of a specific aircraft. In this paper, the software requirements applicable to unmanned aircraft will be analyzed and the FDR software design will be proposed. Also, a software verification method for each requirement will be presented to verify that the implemented software is designed to satisfy all requirements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.562-576
• /
• 2020

The power allocation optimization problem is investigated for improving the physical-layer security in two-way relaying networks, where a full-duplex relay based half-jamming protocol (HJP-FDR) is considered. Specially, by introducing a power splitter factor, HJP-FDR divides the relay's power into two parts: one for forwarding the sources' signals, the other for jamming. An optimization problem for power split factor is first developed, which is proved to be concave and closed-form solution is achieved. Moreover, we formulate a power allocation problem to determine the sources' power subject to the total power constraint. Applying the achieved closed-form solutions to the above-mentioned problems, a two-stage strategy is proposed to implement the overall power allocation. Simulation results highlight the effectiveness of our proposed algorithm and indicate the necessity of optimal power allocation.

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

현재 P2P(Peer-to-Peer) 환경에서는 많은 허위 데이터가 생성되면서 불필요한 네트워크 트래픽이 증가하는 문제점이 발생하고 있다. 본 논문에서는 이러한 문제점을 줄일 수 있는 FDR(False Data Reduction) 알고리즘을 제안한다. 이 알고리즘은 멀티미디어 콘텐츠 파일의 헤더 정보를 이용하여 데이터 파일에 고유 ID를 부여함으로써 허위 데이터 생성을 방지한다. 또한 허위 데이터로 확인된 데이터는 각 peer에 저장된 데이터 전송경로를 이용하여 허위 데이터를 삭제함으로써 허위 데이터 증가에 따른 네트워크 트래픽을 감소시킨다.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.91-94
• /
• 2003

In this paper, we achieve implementation of a Time-Frequency Domain Reflectometry(TFDR) system through comparatively low performance(100MS/s) PCI extensions for Instrumentation(PXI). The TFDR is the general methodology of Time Domain Reflectometry(TDR) and Frequency Domain Reflectometry(FDR). This methodology is robust in Gaussian noises, because the fixed frequency bandwidth is used. Moreover, the methodology can get more information of the fault by using the normalized time-frequency cross correlation function. The Arbitrary Waveform Generator(AWG) module generates the input signal, and the digital oscilloscope module acquires the input and reflected signals, while PXI controller module performs the control of the total PXI modules and execution of the main algorithm. The maximum range of measurement and the blind spot are calculated according ta variations of time duration and frequency bandwidth. On the basis of above calculations, the algorithm and the design of input signals used in the TFDR system are verified by real experiments. The correlation function is added to the TDR methodology for reduction of the blind spot in the TFDR system.

• The KIPS Transactions:PartA
• /
• v.18A no.2
• /
• pp.75-80
• /
• 2011

Recently, many cleaning robots have been made with various algorithms for efficient cleaning. One of them is a DmaxCoverage algorithm which efficiently clean for the situation when the robot has a time limit. This algorithm uses Rectangle Tiling method for finding the biggest rectangle that doesn't have any obstacle. When the robot uses grid map, Rectangle Tiling method can find the optimal value. Rectangle Tiling method is to find all of the rectangles in the grid map. But when the grid map is big, it has a problem that spends a lot of times because of the large numbers of rectangles. In this paper, we propose Four Direction Rectangle Scanning(FDRS) method that has similar accuracy but faster than Rectangle Tiling method. FDRS method is not to find all of the rectangle, but to search the obstacle's all directions. We will show the FDRS method's performance by comparing of FDRS and Rectangle Tiling methods.

• Genomics & Informatics
• /
• v.4 no.4
• /
• pp.161-166
• /
• 2006

The establishment of DNA microarray technology has enabled high-throughput analysis and molecular profiling of various types of cancers. By using the gene expression data from microarray analysis we are able to investigate diagnostic applications at the molecular level. The most important step in the application of microarray technology to cancer diagnostics is the selection of specific markers from gene expression profiles. In order to select markers of Immortalization and transformation we used c-myc and $H-ras^{V12}$ oncogene-transfected NIH3T3 cells as our model system. We have identified 8751 differentially expressed genes in the immortalization/transformation model by multivariate permutation F-test (95% confidence, FDR<0.01). Using the support vector machine algorithm, we selected 13 discriminative genes which could be used to predict immortalization and transformation with perfect accuracy. We assayed $H-ras^{V12}$-transfected 'transformed' cells to validate our immortalization/transformation dassification system. The selected molecular markers generated valuable additional information for tumor diagnosis, prognosis and therapy development.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1214-1221
• /
• 2007

Ad-hoc network is soft wireless communication network that is consisted of mobile node and clusters without helping of infrastructure. We propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. Proposed structure is consisted of context awareness parameters as like distance between each nodes. The proposed architecture performs two types of routing discovery. One is Flooding Discovery Routing(FDR) for comparing analysis step and Local Discovery Routing(LDR) to compose path of node forecast(preservation) step from node's state value. The inference network structure of proposed RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol) adopts a tree structure to enhance an efficient packet in various environment between mobile node. We will have developed an algorithm that will desist multi-hierarchy Layered networks to simulate a desired system.