• Title/Summary/Keyword: Limited Memory

Search Result 549, Processing Time 0.027 seconds

An Empirical Study of Temporal Navigation System for Time-based Contents: Focused on Digital TV Systems (시간 기반 컨텐츠를 위한 항해 시스템에 대한 실증적 연구 : 디지털 TV를 중심으로)

  • 김현호;김진우;박경욱;박준아
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.10
    • /
    • pp.944-954
    • /
    • 2003
  • People are experiencing severe problems in temporal navigation as time-based contents and platforms become more popular Relatively limited research, however, has been conducted on temporal navigation compared to that on spatial navigation. This research aims to identify efficient temporal navigation aids for time-based contents. It proposes Time Navigator, a new temporal navigation system based on the episodic indexing theory, and evaluates its efficiency through two experiments with a computer-based simulator for digital TV The video contents of digital TV was focused on because it is one of the most representative time-based contents and platforms. Our results indicate that Time Navigator helps people navigate time -based contents more effectively. Its effects increase as the contents include more narratives.

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.

Energy harvesting techniques for remote corrosion monitoring systems

  • Kim, Sehwan;Na, Ungjin
    • Smart Structures and Systems
    • /
    • v.11 no.5
    • /
    • pp.555-567
    • /
    • 2013
  • An Remote Corrosion Monitoring (RCM) system consists of an anode with low potential, the metallic structures against corrosion, an electrode to provide reference potential, and a data-acquisition system to ensure the potential difference for anticorrosion. In more detail, the data-acquisition (DAQ) system monitors the potential difference between the metallic structures and a reference electrode to identify the correct potential level against the corrosion of the infrastructures. Then, the measured data are transmitted to a central office to remotely keep track of the status of the corrosion monitoring (CM) system. To date, the RCM system is designed to achieve low power consumption, so that it can be simply powered by batteries. However, due to memory effect and the limited number of recharge cycles, it can entail the maintenance fee or sometimes cause failure to protect the metallic structures. To address this issue, the low-overhead energy harvesting circuitry for the RCM systems has designed to replenish energy storage elements (ESEs) along with redeeming the leakage of supercapacitors. Our developed energy harvester can scavenge the ambient energy from the corrosion monitoring environments and store it as useful electrical energy for powering local data-acquisition systems. In particular, this paper considers the energy harvesting from potential difference due to galvanic corrosion between a metallic infrastructure and a permanent copper/copper sulfate reference electrode. In addition, supercapacitors are adopted as an ESE to compensate for or overcome the limitations of batteries. Experimental results show that our proposed harvesting schemes significantly reduce the overhead of the charging circuitry, which enable fully charging up to a 350-F supercapacitor under the low corrosion power of 3 mW (i.e., 1 V/3 mA).

A Streaming XML Hardware Parser using a Tree with Failure Transition (실패 전이를 갖는 트리를 이용한 스트리밍 XML 하드웨어 파서)

  • Lee, Kyu-Hee;Han, Sang-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.10
    • /
    • pp.2323-2329
    • /
    • 2013
  • Web-services employ an XML to represent data and an XML parser is needed to use data. The DOM(Document Object Model) is widely used to parse an XML, but it is not suitable for any systems with limited resources because it requires a preprocessing to create the DOM and additional memory space. In this paper, we propose the StreXTree(Streaming XML Tree) with failure transitions and without any preprocessing tasks in order to improve the system performance. Compared to other works, our StreXTree parser achieves 2.39x and 3.02x improvement in system performance in Search and RBStreX, respectively. In addition, our StreXTree parser supports Well-Formed checking to verify the syntax and structure of XML.

PUF-based Secure FANET Routing Protocol for Multi-Drone

  • Park, Yoon-Gil;Lee, Soo-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.9
    • /
    • pp.81-90
    • /
    • 2020
  • In order to operate multi drone efficiently, existing control methods must be improved, and drones must be able to construct communication networks autonomously. FANET(Flying Ad-Hoc Network), which is being considered as an alternative to solving these problems, is based on ad hoc network technology and can be exposed to a variety of security vulnerabilities. However, due to the limited computational power and memory of FANET nodes, and rapid and frequent changes in network topology, it is not easy to apply the existing security measures to FANET without modification. Thus, this paper proposes lightweight security measures applicable to FANET, which have distinct characteristics from existing ad hoc networks by utilizing PUF technology. The proposed security measures utilize unique values generated by non-replicable PUFs to increase the safety of AODV, FANET's reactive routing protocol, and are resistant to various attacks.

Code Visualization Approach for Low level Power Improvement via Identifying Performance Dissipation (성능 저하 식별을 통한 저전력 개선용 코드 가시화 방법)

  • An, Hyun Sik;Park, Bokyung;Kim, R.Young Chul;Kim, Ki Du
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.10
    • /
    • pp.213-220
    • /
    • 2020
  • The power consumption and performance of hardware-based mobile and IoT embedded systems that require high specifications are one of the important issues of these systems. In particular, the problem of excessive power consumption is because it causes a problem of increasing heat generation and shortening the life of the device. In addition, in the same environment, software also needs to perform stable operation in limited power and memory, thereby increasing power consumption of the device. In order to solve these issues, we propose a Low level power improvement via identifying performance dissipation. The proposed method identifies complex modules (especially Cyclomatic complexity, Coupling & Cohesion) through code visualization, and helps to simplify low power code patterning and performance code. Therefore, through this method, it is possible to optimize the quality of the code by reducing power consumption and improving performance.

An performance analysis on SSD caching mechanism in Linux (리눅스 SSD caching mechanism 의 성능 비교 및 분석)

  • Heo, Sang-Bok;Park, Jinhee;Jo, Heeseung
    • Smart Media Journal
    • /
    • v.4 no.2
    • /
    • pp.62-67
    • /
    • 2015
  • During several decades, hard disk drive(HDD) has been used in most computer systems as secondary storage and, however, the performance enhancement of HDD is limited by its mechanical properties. On the other hand, although the flash memory based solid state drive (SSD) has more advantages over HDD such as high performance and low noise, SSD is still too expensive for common usage and expected to take several years to replace HDD completely. Therefore, SSD caching mechanism using the SSD as a cache of high capacity HDD has been highlighted lately. The representatives of SSD caching mechanisms are typically bcache, dm-cache, Flashcache, and EnhanceIO. Each of them has its own internal mechanism and implementation, and this makes them to show their own pros. and cons. In this paper, we analyze the characteristics of each SSD caching mechanisms and compare the performance of them under various workloads. We expect that our contribution will be useful to enhance the performance of SSD caching mechanisms.

3D Model Extraction Method Using Compact Genetic Algorithm from Real Scene Stereoscopic Image (소형 유전자 알고리즘을 이용한 스테레오 영상으로부터의 3차원 모델 추출기법)

  • Han, Gyu-Pil;Eom, Tae-Eok
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.5
    • /
    • pp.538-547
    • /
    • 2001
  • Currently, 2D real-time image coding techniques had great developments and many related products were commercially developed. However, these techniques lack the capability of handling 3D actuality, occurred by the advent of virtual reality, because they handle only the temporal transmission for 2D image. Besides, many 3D virtual reality researches have been studied in computer graphics. Since the graphical researches were limited to the application of artificial models, the 3D actuality for real scene images could not be managed also. Therefore, a new 3D model extraction method based on stereo vision, that can deal with real scene virtual reality, is proposed in this paper. The proposed method adapted a compact genetic algorithm using population-based incremental learning (PBIL) to matching environments, in order to reduce memory consumption and computational time of conventional genetic algorithms. Since the PBIL used a probability vector and competitive learning, the matching algorithm became simple and the computation load was considerably reduced. Moreover, the matching quality was superior than conventional methods. Even if the characteristics of images are changed, stable outputs were obtained without the modification of the matching algorithm.

  • PDF

Grouping-based 3D Animation Data Compression Method (군집화 기반 3차원 애니메이션 데이터 압축 기법)

  • Choi, Young-Jin;Yeo, Du-Hwan;Klm, Hyung-Seok;Kim, Jee-In
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.461-468
    • /
    • 2008
  • The needs for visualizing interactive multimedia contents on portable devices with realistic three dimensional shapes are increasing as new ubiquitous services are coming into reality. Especially in digital fashion applications with virtual reality technologies for clothes of various forms on different avatars, it is required to provide very high quality visual models over mobile networks. Due to limited network bandwidths and memory spaces of portable devices, it is very difficult to transmit visual data effectively and render realistic appearance of three dimensional images. In this thesis, we propose a compression method to reduce three dimensional data for digital fashion applications. The three dimensional model includes animation of avatar which require very large amounts of data over time. Our proposed method utilizes temporal and spatial coherence of animation data, to reduce the amount. By grouping vertices from three dimensional models, the entire animation is represented by a movement path of a few representative vertices. The existing three dimensional model compression approaches can get benefits from the proposed method by reducing the compression sources through grouping. We expect that the proposed method to be applied not only to three dimensional garment animations but also to generic deformable objects.

  • PDF

Hierarchical Ring Extension of NUMA Systems using Snooping Protocol (스누핑 프로토콜을 사용하는 NUMA 시스템의 계층적 링 구조로의 확장)

  • Seong, Hyeon-Jung;Kim, Hyeong-Ho;Jang, Seong-Tae;Jeon, Ju-Sik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.11
    • /
    • pp.1305-1317
    • /
    • 1999
  • NUMA 구조는 원격 메모리에 대한 접근이 불가피한 구조적 특성 때문에 상호 연결망이 성능을 좌우하는 큰 변수가 된다. 기존에 대중적으로 사용되던 버스는 물리적 확장성 및 대역폭에서 대규모 시스템을 구성하는 데 한계를 보인다. 이를 대체하는 고속의 지점간 링크를 사용한 링 구조는 버스가 가지는 확장성 및 대역폭의 한계라는 단점을 개선하였으나, 많은 클러스터가 연결되는 경우에는 전송 지연시간이 증가하는 문제점을 가지고 있다. 본 논문에서는 스누핑 프로토콜이 적용된 링 구조에서 클러스터 개수 증가에 따른 지연시간 증가의 문제점을 보완하기 위해 계층적 링 구조로의 확장을 제안하고, 이 구조에 효과적인 캐쉬 일관성 프로토콜을 설계하였다. 전역 링과 지역 링을 연결하는 브리지는 캐쉬 프로토콜을 관리하며 이 프로토콜에 의해 지역 링의 부하를 줄일 수 있도록 트랜잭션을 필터링하는 역할도 담당함으로써 시스템의 성능을 향상시킨다. probability-driven 시뮬레이터를 통해 계층적 링 구조가 시스템의 성능 및 링 이용률에 미치는 영향을 알아본다. Abstract Since NUMA architecture has to access remote memory, interconnection network performance determines performance of NUMA architecture. Bus, which has been used as popular interconnection network of NUMA, has a limit to build a large-scale system because of limited physical scalability and bandwidth. Ring interconnection network, composed of high-speed point-to-point link, made up for bus's defects of scalability and bandwidth. But, it also has problem of increasing delay as the number of clusters is increased. In this paper, we propose a hierarchical expansion of snoop-based ring architecture in order to overcome ring's defects of increasing delay. And we also design an efficient cache coherence protocol adopted to this architecture. Bridge, which connects local ring and global ring, maintains cache coherence protocol and does snoop-filtering which reduces local ring and cluster bus utilization. Therefore bridge can improve performance of this system. We analyze effects of hierarchical architecture on the performance of system and utilization of point-to-point links using probability-driven simulator.