• Title/Summary/Keyword: C&R 통신

Search Result 320, Processing Time 0.031 seconds

MPEG-21 IPMP's Application and Implementation On Linux Server/Client Environments (Linux Server/client 구조에서 MPEG-21 IPMP의 용용 및 구현)

  • Choi Yong-Soo;Kim Ki-Seob;Kim Hyoung-Joong;Han Hyung-Seok;Song Jeong-Seok;Kim Sung-Soo
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.119-123
    • /
    • 2004
  • 이 논문의 목적은 Linux 기반의 서버/클라이언트 구조에서 IPMP 시스템을 구현하는데 있다. DRM(Digital RIghts Management)솔루션을 제공해주는 IPMP(Intellecutual Property Management and Protection)의 참조 소프트웨어인 OpenIPMP 시스템을 기반으로 하며 MPEG-21 권리표현 언어인 XML을 채용하여 새로운 미디어 서비스 환경에 적합한 웹기반 멀티미디어 컨텐츠 서비스 제공 시스템을 구현하는데 있다.

  • PDF

Signal-to-Noise Ratio Formulas of a Scalar Gaussian Quantizer Mismatched to a Laplacian Source

  • Rhee, Ja-Gan;Na, Sang-Sin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6C
    • /
    • pp.384-390
    • /
    • 2011
  • The paper derives formulas for the mean-squared error distortion and resulting signal-to-noise (SNR) ratio of a fixed-rate scalar quantizer designed optimally in the minimum mean-squared error sense for a Gaussian density with the standard deviation ${\sigma}_q$ when it is mismatched to a Laplacian density with the standard deviation ${\sigma}_q$. The SNR formulas, based on the key parameter and Bennett's integral, are found accurate for a wide range of $p\({\equiv}\frac{\sigma_p}{\sigma_q}\){\geqq}0.25$. Also an upper bound to the SNR is derived, which becomes tighter with increasing rate R and indicates that the SNR behaves asymptotically as $\frac{20\sqrt{3{\ln}2}}{{\rho}{\ln}10}\;{\sqrt{R}}$ dB.

Design of Channel Access Algorithm for the AIS (AIS용 채널 접속 알고리즘 설계)

  • 오상헌;최일홍;이상정;김영호;황동환
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.749-752
    • /
    • 2001
  • In this paper, the channel access algorithm for the AIS is analyzed and the design of the functional modules is presented. The function of RATDMA, ITDMA, FATDMA, and SOTDMA algorithm defined by ITU-R M.1371 specification is analyzed. Each TDMA algorithm is designed as a modularized function. In order to verify the function of designed channel access algorithm, the algorithm is implemented using C language and simulated on the PC environment. The simulation results show that the algorithm ran properly allocate a transmission slot and is satisfied with the requirements of the specification.

  • PDF

Implementation of IPMP System for MPEG-4 AVC(H.264) (MPEG-4 AVC(H.264) 기반의 IPMP 시스템 구현)

  • Choi, Yong-Soo;Kim, Ki-Seob;Kim, Hyoung-Joong;Han, Hyung-Seok;Park, Jong-Hyuk;Park, Heung-Soo;Koh, Byoung-Soo
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2005.08a
    • /
    • pp.323-328
    • /
    • 2005
  • 이 논문에서는 Linux 기반의 서버/클라이언트 구조에서 H.264 Content에 대한 IPMP 시스템을 구현하고자 한다. DRM(Digital RIghts Management)솔루션을 제공해주는 IPMP(Intellecutual Property Management and Protection)를 관련 참조 소프트웨어들의 변경 통합과정을 거쳐 H.264에 대한 IPMP 시스템을 구현했다.

  • PDF

Stroke Disease Identification System by using Machine Learning Algorithm

  • K.Veena Kumari ;K. Siva Kumar ;M.Sreelatha
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.11
    • /
    • pp.183-189
    • /
    • 2023
  • A stroke is a medical disease where a blood vessel in the brain ruptures, causes damage to the brain. If the flow of blood and different nutrients to the brain is intermittent, symptoms may occur. Stroke is other reason for loss of life and widespread disorder. The prevalence of stroke is high in growing countries, with ischemic stroke being the high usual category. Many of the forewarning signs of stroke can be recognized the seriousness of a stroke can be reduced. Most of the earlier stroke detections and prediction models uses image examination tools like CT (Computed Tomography) scan or MRI (Magnetic Resonance Imaging) which are costly and difficult to use for actual-time recognition. Machine learning (ML) is a part of artificial intelligence (AI) that makes software applications to gain the exact accuracy to predict the end results not having to be directly involved to get the work done. In recent times ML algorithms have gained lot of attention due to their accurate results in medical fields. Hence in this work, Stroke disease identification system by using Machine Learning algorithm is presented. The ML algorithm used in this work is Artificial Neural Network (ANN). The result analysis of presented ML algorithm is compared with different ML algorithms. The performance of the presented approach is compared to find the better algorithm for stroke identification.

PMIP-based Distributed Mobility Management for Tactical Network (전술 기동망의 이동성 지원을 위한 PMIP기반 분산 이동성 관리 적용방안)

  • Sun, Kyoungjae;Kim, Younghan;Noh, Hongjun;Park, Hyungwon;Han, Myounghun;Kwon, Daehoon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.22 no.5
    • /
    • pp.654-666
    • /
    • 2019
  • The tactical network has several different characteristics compared with commercial internet network such as hierarchical topology, dynamic topology changing and wireless link based connectivity. For considering IP mobility management in the tactical network, current mobility management using Mobile IP(MIP) is not suitable with some reasons such as non-optimal routing paths and single point of failure. Proxy Mobile IP(PMIP) which supporting network-based mobility in hierarchical manner can provide optimal routing path in the tactical network environment, but centralized anchor is still remained a threat to the stability of the tactical network which changes its topology dynamically. In this paper, we propose PMIP-based distributed mobility management for the tactical network environment. From our design, routing paths are always configured in optimized way, as well as path is recovered quickly when the mobility anchor of user is failed. From numerical analysis, comparing to other mobility scheme, result shows that the proposed scheme can reduce packet transmission cost and latency in tactical network model.

An Efficient If Routing Lookup by Using Routing Interval

  • Wang, Pi-Chung;Chan, Chia-Tai;Chen, Yaw-Chung
    • Journal of Communications and Networks
    • /
    • v.3 no.4
    • /
    • pp.374-382
    • /
    • 2001
  • Nowadays, the commonly used table lookup scheme for IP routing is based on the sc-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, this complicates the IP lookup. Currently, this process is mainly performed in software and several schemes hale been proposed for hardware implementation. Since the IP lookup performance is a major design issue for the new generation routers, in this article we investigate the properties of the routing table and present a new approach for IP lookups, our approach is not based Gn BMP and significantly reduces the complexity, thus the computation cast of existing schemes can be significantly reduced. We also propose an efficient IP lookup algorithm, with which we improve the binary search on prefixes to 30 millions of packets per second (MPPS) and 5,000 route updates/s under the same experiment setup with an even larger routing table.

  • PDF

Adaptive Priority-Based Downlink Scheduling for WiMAX Networks

  • Wu, Shih-Jung;Huang, Shih-Yi;Huang, Kuo-Feng
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.692-702
    • /
    • 2012
  • Supporting quality of service (QoS) guarantees for diverse multimedia services are the primary concerns for WiMAX (IEEE 802.16) networks. A scheduling scheme that satisfies QoS requirements has become more important for wireless communications. We propose a downlink scheduling scheme called adaptive priority-based downlink scheduling (APDS) for providing QoS guarantees in IEEE 802.16 networks. APDS comprises two major components: Priority assignment and resource allocation. Different service-type connections primarily depend on their QoS requirements to adjust priority assignments and dispatch bandwidth resources dynamically. We consider both starvation avoidance and resource management. Simulation results show that our APDS methodology outperforms the representative scheduling approaches in QoS satisfaction and maintains fairness in starvation prevention.

Construction of a Retargetable Compiler Generation System from Machine Behavioral Description (머쉰 행위기술로부터 Retargetable 컴파일러 생성시스템 구축)

  • Lee, Sung-Rae;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5B
    • /
    • pp.286-294
    • /
    • 2007
  • In ASIP design, compiler is required for performance evaluation of processors being designed. The design of machine specific compiler is time consuming. This paper presents the system which generates C compiler from MDL descriptions. Compiler generation using MDL can support user retargetability and concurrency between compiler design and processor design. However, it must overcome semantics gap between compiler and machine. To handle this problem, the proposed system maps behavioral descriptions to library which contains abstract behavior for each tree pattern. Using mapped instructions and information on register file usage, the proposed system generates back-end interface function of the compiler. Generated compilers, for MIPS R3000, ARM9 cores, have been proved by application programs written in C code.

Energy Efficient Clustering Scheme for Mobile Wireless Sensor Network (이동 무선 센서 네트워크에서의 에너지 효율적인 클러스터링 기법)

  • Lee, Eun-Hee;Kim, Hyun-Duk;Choi, Won-Ik;Chae, Jin-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4A
    • /
    • pp.388-398
    • /
    • 2011
  • In this paper, we introduce an EMSP(Efficient Mobility Support Protocol) for mobile sensor network with mobility-aware. We propose virtual cluster and node split scheme considering movements of mobile nodes. The existing M-LEACH protocol suffers from communication cost spent on JOIN request information during invitation phase. To address this issue, the large boundary of the cluster in LUR-tree can reduce superfluous update cost. In addition to the expansion of the cluster, the proposed approach exploits node split algorithms used in R-tree in order to uniformly form a cluster. The simulated results show that energy-consumption has less up to about 40% than LEACH-C and 8% than M-LEACH protocol. Finally, we show that the proposed scheme outperforms those of other in terms of lifetime of sensor fields and scalability in wireless sensor network.