• Title/Summary/Keyword: Communications profile

Search Result 170, Processing Time 0.027 seconds

Confidence Intervals for the Difference of Binomial Proportions in Two Doubly Sampled Data

  • Lee, Seung-Chun
    • Communications for Statistical Applications and Methods
    • /
    • v.17 no.3
    • /
    • pp.309-318
    • /
    • 2010
  • The construction of asymptotic confidence intervals is considered for the difference of binomial proportions in two doubly sampled data subject to false-positive error. The coverage behaviors of several likelihood based confidence intervals and a Bayesian confidence interval are examined. It is shown that a hierarchical Bayesian approach gives a confidence interval with good frequentist properties. Confidence interval based on the Rao score is also shown to have good performance in terms of coverage probability. However, the Wald confidence interval covers true value less often than nominal level.

Data Dissemination Method for Efficient Contents Search in Mobile P2P Networks (모바일 P2P 네트워크에서 효율적인 콘텐츠 검색을 위한 데이터 배포 기법)

  • Bok, Kyoung-Soo;Cho, Mi-Rim;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.8
    • /
    • pp.37-46
    • /
    • 2012
  • In the existing data dissemination methods for mobile P2P networks, the search performance of content that matches the peer profile is very excellent. However, in the search for content that does not match the their profile, additional consideration about case that contents does not match the profile is needed because costs for the query processing will be incurred. To solve these problems, we propose a new data dissemination method for efficient contents search in mobile P2P networks. In the proposed method, peers determine whether they experienced communications by using a timestamp message and then perform data dissemination. We also propose a ranking algorithm to efficiently store dissemination data in a limited memory. The proposed ranking method can reduce query messages by considering the profile matches, the distribution range, and the connectivity to the data distribution peer.

Transmitting/Receiving of Standard Health Data Using Bluetooth HDP on the Android Platform (안드로이드에서 블루투스 HDP를 이용한 표준건강정보의 송수신)

  • Park, Young-Jin;Cho, Hui-Sup;Son, Jong-Wuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.5
    • /
    • pp.464-470
    • /
    • 2013
  • These days, with increasing interest about the health care, research about standard for transmitting/receiving data of health device has been actively conducted. Standardization and testing / certification is underway through the IEEE 11073 PHD, Health Level Seven and the Continua Health Alliance, it'll continue to be more research and experiments in the future. In this paper, we introduce the IEEE 11073 PHD standards for exchange of remote health information and the Bluetooth Health Device Profile(HDP) for health device profile of the Bluetooth technology, also we conducted experiments about exchange health information between health device and smart device which are adapted the IEEE 11073 PHD and Bluetooth HDP. Transmitting/receiving of the IEEE 11073 PHD standard protocol using the Bluetooth HDP profile between health device and smart device can be known by this experiment, and it expect to implement variety of remote medical services through health device supporting these standards in future.

Performance comparisons of RIO and RIO-DC for QoS guarantee of the Assured Service in Differentiated Services (DiffServ 방식에서 Assured Service의 QoS 보장을 위한 RIO 및 RIO-DC 방식의 성능 비교)

  • Hur, Kyeong;Shin, Dong-Beom;Lee, Sang-Woo;Eom, Doo-Seop;Tchah, Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4C
    • /
    • pp.342-352
    • /
    • 2002
  • In this paper, we compare the performances of RIO and RIO-DC buffer management schemes for DiffServ AF PHB standardized in IETF. For the comparison, we relatively differentiate maximum delay for each Assured Service subclass in Differentiated Services by allocating bandwidth to each subclass differently. In addition, we set the values of RIO and RIO-DC parameters considering the buffer size determined by the network topology and the ratio of bandwidth allocated to each subclass. In this simulation environment, the performances of RIO and RIO-DC schemes are analyzed focusing on the throughput of the In-profile traffic, the link utilization and the fairness. Simulation results show that the performance of RIO-DC scheme is comparable to that of RIO scheme with regard to the throughput of the In-profile traffic and the link utilization. However, under the simulation condition RIO-DC scheme improves the fairness between flows much better than RIO scheme.

An Optimal Power-Throughput Tradeoff Study for MIMO Fading Ad-Hoc Networks

  • Yousefi'zadeh, Homayoun;Jafarkhani, Hamid
    • Journal of Communications and Networks
    • /
    • v.12 no.4
    • /
    • pp.334-345
    • /
    • 2010
  • In this paper, we study optimal tradeoffs of achievable throughput versus consumed power in wireless ad-hoc networks formed by a collection of multiple antenna nodes. Relying on adaptive modulation and/or dynamic channel coding rate allocation techniques for multiple antenna systems, we examine the maximization of throughput under power constraints as well as the minimization of transmission power under throughput constraints. In our examination, we also consider the impacts of enforcing quality of service requirements expressed in the form of channel coding block loss constraints. In order to properly model temporally correlated loss observed in fading wireless channels, we propose the use of finite-state Markov chains. Details of fading statistics of signal-to-interference-noise ratio, an important indicator of transmission quality, are presented. Further, we objectively inspect complexity versus accuracy tradeoff of solving our proposed optimization problems at a global as oppose to a local topology level. Our numerical simulations profile and compare the performance of a variety of scenarios for a number of sample network topologies.

Fast Motion Estimation Algorithm for MPEG-4 to H.264 Transcoder

  • Han, Jong-Ki;Seo, Chan-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.6C
    • /
    • pp.459-470
    • /
    • 2008
  • In this paper, we propose a fast ME (motion estimation) algorithm for MPEG-4 to H.264 Transcoder. Whereas 2 modes ($8{\times}8$, $16{\times}16$) are used for ME in MPEG-4 simple profile, ME using 7 modes is supported for further enhanced coding efficiency in H.264. The transcoding speed is affected dominantly by the computational complexity of encoder part in transcoder, where ME module of H.264 encoder has high complexity due to using 7 modes. In order to increase the speed of transcoding between MPEG-4 and H.264, we use 3 PMVs (predicted motion vectors) and the mode information of MBs (macroblocks) provided from the decoder part of transcoder. Since the proposed 3 PMVs are very close to an optimal motion vector, and we consider only some restricted modes according to the MB information transferred from decoder part, the proposed scheme can speed up the transcoding procedure without loss of image quality. We show experimental results which demonstrate the effectiveness of the proposed algorithm, where performance of our scheme is compared with that of the conventional fast algorithm for H.264.

Energy Saving Characteristics of OSPF Routing Based on Energy Profiles (Energy Profile에 기반한 OSPF 라우팅 방식의 에너지 절약 특성)

  • Seo, Yusik;Han, Chimoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.7
    • /
    • pp.1296-1306
    • /
    • 2015
  • Nowadays the research of energy saving on the IP networks have been studied the various methods in many research institutes. This paper suggests the energy saving method in IP networks which have the various energy profiles, and analyzes its energy saving characteristics in detail. Especially this paper proposes the energy profile based OSPF routing method which have the selectable weighted value in OSPF metric and energy consumption in IP network. This paper analyzes the energy saving effects of the various situations to minimize the energy consumption using the various weighted value on the proposed scheme. The results show that the energy saving efficiency can get about 67% at in ingress input load ${\rho}=0.5$ by using random energy profiles in IP networks. Although the number of hops is a slight increased due to routing the paths for the minimum energy consumption in the algorithm of this method, the increment hop number is limited the mean 1.4 hops. This paper confirms that the energy profile of core router has the large effects of energy saving than the energy profile of edge router, and the proposed method has the excellent energy saving characteristics in IP networks.

Design of a Planar Antenna with Monopole-like Radiation Pattern for On-Body Communications (수직 모노폴 방사패턴을 갖는 인체표면 통신용 평면형 안테나 설계)

  • Kwon, Jaekwang;Woo, Seungmin;Tak, Jinpil;Choi, Jaehoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.26 no.4
    • /
    • pp.365-373
    • /
    • 2015
  • In this paper, a planar antenna with monopole-like radiation pattern for on-body communications is proposed. The proposed antenna consists of three split-rings(SR) to generate a monopole-like radiation characteristic. To account for the on-body application, the proposed antenna is designed to have a low-profile. The antenna has an overall dimensions of $0.29{\lambda}_0{\times}0.29{\lambda}_0{\times}0.008{\lambda}_0$ at 5.8 GHz industrial, scientific, and medical(ISM) band(5.725~5.875 GHz). To verify the body effect, a two-thirds muscle equivalent semi solid phantom is fabricated and used to measure the antenna performance. The 10-dB return loss bandwidth is 280 MHz(5.68~5.96 GHz) and the measured peak gain is 1.91 dBi.

PostScript Conversion of ODIF Data Stream (ODIF 데이터스림의 포스트스크립트 변환)

  • 홍온선;윤근종;이수연
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.11
    • /
    • pp.1027-1036
    • /
    • 1991
  • This paper proposes an implementation of ODIF(Open Document Interchange Format)decoder and PostScript converter. AS ODIF data stream based on IS 8613 is described according to ASN.1 notation it is necessary to decode ODIF data stream to the proper internal structure to PostScript format as proposed in order to make hard copies in good quality using LBP(Laser Beam Printer). Among several kinds of DA(Document Architecture) and DAP(Document Application Profile). PDA(Processable DA) and Core 26(Level 2 DAP) are selected for our study. An ODIF data stream submitted by ICL is used to show the conformance in the level of data stream.

  • PDF

Complexity Analysis of Internet Video Coding (IVC) Decoding

  • Park, Sang-hyo;Dong, Tianyu;Jang, Euee S.
    • Journal of Multimedia Information System
    • /
    • v.4 no.4
    • /
    • pp.179-188
    • /
    • 2017
  • The Internet Video Coding (IVC) standard is due to be published by Moving Picture Experts Group (MPEG) for various Internet applications such as internet broadcast streaming. IVC aims at three things fundamentally: 1) forming IVC patents under a free of charge license, 2) reaching comparable compression performance to AVC/H.264 constrained Baseline Profile (cBP), and 3) maintaining computational complexity for feasible implementation of real-time encoding and decoding. MPEG experts have worked diligently on the intellectual property rights issues for IVC, and they reported that IVC already achieved the second goal (compression performance) and even showed comparable performance to even AVC/H.264 High Profile (HP). For the complexity issue, however, there has not been thorough analysis on IVC decoder. In this paper, we analyze the IVC decoder in view of the time complexity by evaluating running time. Through the experimental results, IVC is 3.6 times and 3.1 times more complex than AVC/H.264 cBP under constrained set (CS) 1 and CS2, respectively. Compared to AVC/H.264 HP, IVC is 2.8 times and 2.9 times slower in decoding time under CS1 and CS2, respectively. The most critical tool to be improved for lightweight IVC decoder is motion compensation process containing a resolution-adaptive interpolation filtering process.