• Title/Summary/Keyword: fixed point problem

Search Result 351, Processing Time 0.026 seconds

Channel Selection Using Optimal Channel-Selection Policy in RF Energy Harvesting Cognitive Radio Networks (무선 에너지 하비스팅 인지 무선 네트워크에서 최적의 채널 선택 정책을 이용한 채널 선택)

  • Jung, Jun Hee;Hwang, Yu Min;Cha, Gyeong Hyeon;Kim, Jin Young
    • Journal of Satellite, Information and Communications
    • /
    • v.10 no.3
    • /
    • pp.1-5
    • /
    • 2015
  • Recently, RF energy harvesting technology is a promising technology for small-size IoT(Internet of Things) devices such as sensor to resolve battery scarcity problem. When applied to existing cognitive radio networks, this technology can be expected to increase network throughput through the increase of cognitive user's operating time. This paper proposes a optimal channel-selection policy for RF energy harvesting CR networks model where cognitive users in harvesting zone harvest ambient RF energy from transmission by nearby active primary users and the others in non-harvesting zone choose the channel and communicate with their receiver. We consider that primary users and secondary users are distributed as Poisson point processes and contact with their intended receivers at fixed distances. Finally we can derive the optimal frame duration, transmission power and density of secondary user from the proposed model that can maximize the secondary users's throughput under the given several conditions and suggest future directions of research.

An Interval Data Model for Tracing RFID Tag Objects (RFID 태그 객체의 위치 추적을 위한 구간 데이터 모델)

  • Ban, Chae-Hoon;Hong, Bong-Hee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.578-581
    • /
    • 2007
  • For tracing tag locations, a trajectories should be modeled and indexed in radio frequency identification (RFID) systems. The trajectory of a tag can be represented as a line that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. If a tag enters but does not leave a reader, its trajectory is represented only as a point captured at entry. Because the information that the tag stays in the reader is missing from the trajectory represented only as a point, we should extend the region of a query to find the tag that remains in a reader. In this paper, we propose an interval data model of tag's trajectory in order to solve the problem. Trajectories of tags are represented as two kinds of intervals; dynamic intervals which are time-dependent lines and static intervals which are fixed lines. We also show that the interval data model has better performance than others with a cost model

  • PDF

Development and Utilization of Mathematics Teaching Materials for Gifted Class by the Use of Polyominoes and What if (not)? Strategy (폴리오미노에 What if (not)? 전략을 적용한 영재 학급용 수학 수업 소재 발굴과 활용)

  • Ku, Bon-Wang;Song, Sang-Hun
    • School Mathematics
    • /
    • v.13 no.1
    • /
    • pp.175-187
    • /
    • 2011
  • The purpose of this study is to develop and utilize various kinds of mathematics teaching materials for gifted class in elementary school by utilizing polyominoes and a what-if-not strategy. Blokus is used to let students understand the characteristics of polyominoes, and omok is utilized to let them grasp interior point. Thus, the activities that utilized the new materials, blokus and omok, are developed to teach Pick's theorem. Besides, recreation activities were additionally prepared to provide education in an easy, intriguing and creative manner. The findings of the study is as follows: First, each of the materials was utilized in a different manner when the students engaged in basic and enrichment learning. Second, the mathematically gifted students were able to discover Pick's theorem in the course of utilizing the materials that contained recreational elements. Third, the students were taught to foster their problem-solving skills about area, girth and interior point by making use of the materials that were designed to be linked to each other. Fourth, existing programs were just designed to attain particular objects, to be conducted at a fixed time and to cater to particular graders. Fifth, when the students made problems by making use of the what if (not) strategy and the materials, they responded in diverse ways and were able to apply them.

  • PDF

A Method of ISAR Geometric Calibration for Point Target Using Impulse-Radio UWB (임펄스 초광대역 레이다를 이용한 점표적의 ISAR 기하 보정 방법)

  • Yu, Jiwoong;Nikitin, Konstantin;Paek, Inchan;Jang, Jong Hun;Ka, Min-Ho
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.26 no.4
    • /
    • pp.397-403
    • /
    • 2015
  • In this paper, a method of ISAR geometric calibration is represented by using impulse-radio UWB radar. The ir-UWB is good for using a signal processing in time domain, so, it does not occur a multi-path or coupling problem. If a signal that between antennas and target is assumed a plane wave, a center of rotation in ISAR geometry model can be estimated by using point target. Before image is reconstructed with sinogram, the center of rotation can be calculated by using least square fitting. This method can be obtained a more contrast image, and a maximum value of entropy of image. The method, that estimates a center of rotation in received data, will be used a initial setup of instruments or a periodic compensation to reconstruct image. It would be useful in medical, security and surveillance imaging equipments that have a fixed geometry.

An Anti-Forensic Technique for Hiding Data in NTFS Index Record with a Unicode Transformation (유니코드 변환이 적용된 NTFS 인덱스 레코드에 데이터를 숨기기 위한 안티포렌식 기법)

  • Cho, Gyu-Sang
    • Convergence Security Journal
    • /
    • v.15 no.7
    • /
    • pp.75-84
    • /
    • 2015
  • In an "NTFS Index Record Data Hiding" method messages are hidden by using file names. Windows NTFS file naming convention has some forbidden ASCII characters for a file name. When inputting Hangul with the Roman alphabet, if the forbidden characters for the file name and binary data are used, the codes are convert to a designated unicode point to avoid a file creation error due to unsuitable characters. In this paper, the problem of a file creation error due to non-admittable characters for the file name is fixed, which is used in the index record data hiding method. Using Hangul with Roman alphabet the characters cause a file creation error are converted to an arbitrary unicode point except Hangul and Roman alphabet area. When it comes to binary data, all 256 codes are converted to designated unicode area except an extended unicode(surrogate pairs) and ASCII code area. The results of the two cases, i.e. the Hangul with Roman alphabet case and the binary case, show the applicability of the proposed method.

Design and Implementation of an IP-based Fixed VoIP Emergency System (IP-기반 고정형 VoIP 긴급통화 시스템 설계 및 구현)

  • Ko, Sang-Ki;Chon, Ji-Hun;Choi, Sun-Wan;Kang, Shin-Gak;Huh, Mi-Young
    • The KIPS Transactions:PartC
    • /
    • v.15C no.4
    • /
    • pp.245-252
    • /
    • 2008
  • An emergency service over Voice over IP (VoIP) network is an essential condition, like the existing telecommunication services. To support for the emergency services, standardization works have been performed. The National Emergency Number Association (NENA) has been developing the framework and procedures for an emergency service for Non-IP based network, rather than protocols. In contrast, the Internet Engineering Task Force (IETF) has been only focused on end-to-end IP-based emergency calls. The NENA architecture is incompatible with the IETF protocols. To solve the problem, we design and implement a SIP-based VoIP emergency system by adopting the NENA architecture and by applying IETF protocols, for both IP-based Pubic Safety Answering Point (PSAP) and PSTN-based PSAP. It is implemented and tested under UNIX environment.

Effect of missing values in detecting differentially expressed genes in a cDNA microarray experiment

  • Kim, Byung-Soo;Rha, Sun-Young
    • Bioinformatics and Biosystems
    • /
    • v.1 no.1
    • /
    • pp.67-72
    • /
    • 2006
  • The aim of this paper is to discuss the effect of missing values in detecting differentially expressed genes in a cDNA microarray experiment in the context of a one sample problem. We conducted a cDNA micro array experiment to detect differentially expressed genes for the metastasis of colorectal cancer based on twenty patients who underwent liver resection due to liver metastasis from colorectal cancer. Total RNAs from metastatic liver tumor and adjacent normal liver tissue from a single patient were labeled with cy5 and cy3, respectively, and competitively hybridized to a cDNA microarray with 7775 human genes. We used $M=log_2(R/G)$ for the signal evaluation, where Rand G denoted the fluorescent intensities of Cy5 and Cy3 dyes, respectively. The statistical problem comprises a one sample test of testing E(M)=0 for each gene and involves multiple tests. The twenty cDNA microarray data would comprise a matrix of dimension 7775 by 20, if there were no missing values. However, missing values occur for various reasons. For each gene, the no missing proportion (NMP) was defined to be the proportion of non-missing values out of twenty. In detecting differentially expressed (DE) genes, we used the genes whose NMP is greater than or equal to 0.4 and then sequentially increased NMP by 0.1 for investigating its effect on the detection of DE genes. For each fixed NMP, we imputed the missing values with K-nearest neighbor method (K=10) and applied the nonparametric t-test of Dudoit et al. (2002), SAM by Tusher et al. (2001) and empirical Bayes procedure by $L\ddot{o}nnstedt$ and Speed (2002) to find out the effect of missing values in the final outcome. These three procedures yielded substantially agreeable result in detecting DE genes. Of these three procedures we used SAM for exploring the acceptable NMP level. The result showed that the optimum no missing proportion (NMP) found in this data set turned out to be 80%. It is more desirable to find the optimum level of NMP for each data set by applying the method described in this note, when the plot of (NMP, Number of overlapping genes) shows a turning point.

  • PDF

Embedding Method of Secret Data using Error-Diffusion (오차 확산법을 이용한 기밀 데이터 합성법)

  • 박영란;이혜주;박지환
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.2
    • /
    • pp.155-165
    • /
    • 1999
  • Because the encrypted data is random, there is a possibility of threat that attacker reveals the secret data. On the other hand, as the image steganogrphy is to embed the secret data into cover image and to transmit the embedded image to receiver, an attacker could not know the existence of secret data even though he/she sees the embedded image, therefore the sender may reduce the threat of attack. In the image steganography, the secret data is embedded by modifying value of pixels as a form of noise. If the secret data is embedded into gray image, the degradation of image quality results from the modifications of image due to noise. Therefore many methods have been proposed to embed the secret data while dethering the gray image, but the existing method using error-diffusion has a problem that any patterns such as a diagonal lines or vertical take place due to embedding the secret data at the fixed interval. To solve this problem and to improve the existing method, we proposed the new method that embeds the secret data at changed point with respect to 1's run-length or at the position where has the minimum difference with the original dithered value. We evaluated the performance of the proposed method by computer simulation.

  • PDF

Optimization and Real-time Implementation of QCELP Vocoder (QCELP 보코더의 최적화 및 실시간 구현)

  • 변경진;한민수;김경수
    • The Journal of the Acoustical Society of Korea
    • /
    • v.19 no.1
    • /
    • pp.78-83
    • /
    • 2000
  • Vocoders used in digital mobile phone adopt new improved algorithm to achieve better communication quality. Therefore the communication problem occurs between mobile phones using different vocoder algorithms. In this paper, the efficient implementation of 8kbps and 13kbps QCELP into one DSP chip to solve this problem is presented. We also describe the optimization method at each level, that is, algorithm-level, equation-level, and coding-level, to reduce the complexity for the QCELP vocoder algorithm implementation. The complexity in the codebook search-loop that is the main part for the QCELP algorithm complexity can be reduced about 50% by using these optimizations. The QCELP implementation with our DSP requires only 25 MIPS of computation for the 8kbps and 33 MIPS for the 13kbps ones. The DSP for our real-time implementation is a 16-bit fixed-point one specifically designed for vocoder applications and has a simple architecture compared to general-purpose ones in order to reduce the power consumption.

  • PDF

Performance of MAC frame Fragmentation and Efficient Flow Control Schemes for Synchronous Ethernet Systems (동기식 이더넷 시스템용 MAC 프레임 분할 방식과 효율적인 흐름제어 방식의 성능 분석)

  • Choi Hee-Kyoung;Yoon Chong-Ho;Cho Jae-Hun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12B
    • /
    • pp.838-846
    • /
    • 2005
  • In this paper, we consider the following two issues for implementing the synchronous Ethernet systems. First, a synchronous Ethernet system employs a fixed size superframe which is divided into a synchronous period and an asynchronous one. We note that the starting point of a superframe is not deterministic when an ordinary data frame's transmission is overlapped the superframe boundary. This overlap may be a fatal drawback for strict jitter bounded applications. Circumventing the problem, we propose a frame fragmentation scheme to provide a zero jitter, and compare its delay performance with the hold scheme which also provides the zero jitter. We next concern that IEEE 802.3x pause frames cannot be promptly transmitted in a synchronous period, and thus asynchronous traffics may be dramatically get dropped at the input buffer of a switch. To handle the problem, we propose an efficient flow control by allowing the transmission of the pause frame in a synchronous period, and investigate the blocking probability of the asynchronous traffics by the simulation.