• Title/Summary/Keyword: Average latency

Search Result 187, Processing Time 0.025 seconds

The Effect of Punsimgieumgamibang on Sleep Disorder and Emotionality in Animals (분심기음가미방(分心氣飮加味方)이 타면장애(唾眠障碍)와 정서성(情緖性)에 미치는 영향(影響))

  • Hu Yong-Suk;Kim Jong-Woo;Whang Wei-Wan;Kim Hyun-Taek;Park Soon-Kwon;Kim Hyun-Ju
    • Journal of Oriental Neuropsychiatry
    • /
    • v.11 no.2
    • /
    • pp.43-52
    • /
    • 2000
  • This sudy aimed to evaluate the effect of Punsimgieum-gamibang(分心氣飮加味方) on emotionality and sleep disorder. Punsimgieum(分心氣飮) has been used for insomnia, trembling, emotionality caused by strong mental stimulation and continuous stress in Oriental Medicine. And it was reported that Punsimgieum had anti-stress and anti-depression effect. Animals were devided into two groups : control group and Punsimgieum-gamibang group.Emotionality was tested in open-field with five indexes : walking, rearing, grooming, excretion and start latency. For the study of sleep disorder, after two groups had been given caffeine into abdomen, activity amount in animals was assessed for daytime and then the average percentage of sleep in two groups was calculated.The following results were observed.1. In peripheral and central partition, meditaion group walked more than control group. The difference between two groups was statistically significant.2. In rearing and grooming frequency, there was difference between two groups, but it was not statistically significant. 3. In grooming. excretion and start latency. there was no difference between two groups.4. There was no difference in the average percentage of sleep between two groups.

  • PDF

Lightweight AES-based Whitebox Cryptography for Secure Internet of Things (안전한 사물인터넷을 위한 AES 기반 경량 화이트박스 암호 기법)

  • Lee, Jin-Min;Kim, So-Yeon;Lee, Il-Gu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.9
    • /
    • pp.1382-1391
    • /
    • 2022
  • White-box cryptography can respond to white-box attacks that can access and modify memory by safely hiding keys in the lookup table. However, because the size of lookup tables is large and the speed of encryption is slow, it is difficult to apply them to devices that require real-time while having limited resources, such as IoT(Internet of Things) devices. In this work, we propose a scheme for collecting short-length plaintexts and processing them at once, utilizing the characteristics that white-box ciphers process encryption on a lookup table size basis. As a result of comparing the proposed method, assuming that the table sizes of the Chow and XiaoLai schemes were 720KB(Kilobytes) and 18,000KB, respectively, memory usage reduced by about 29.9% and 1.24% on average in the Chow and XiaoLai schemes. The latency was decreased by about 3.36% and about 2.6% on average in the Chow and XiaoLai schemes, respectively, at a Traffic Load Rate of 15 Mbps(Mega bit per second) or higher.

The Design and experiment of 5G-based metaverse motion synchronization system (5G 기반의 메타버스 모션 동기화 시스템의 설계 및 실험)

  • Lee Sangyoon;Lee Daesik;You, Youngmo;You, Hyeonsoo;Lee, Sangku
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.19 no.3
    • /
    • pp.61-75
    • /
    • 2023
  • In this paper, we design and experiment a 5G-based metaverse motion synchronization system with configuration of a mobile motion capture studio that has not been commercialized at home and abroad. As a result of the experiment, the average value of the latency test measurement using Wi-Fi is 0.134 seconds faster than the average latency test measurement value using the 5G network. Existing motion capture studios have spatial limitations as the motion capture range is limited to the Wi-Fi communication range. However, the 5G-based metaverse motion synchronization system configures a mobile motion capture studio so that motion performers can solve the spatial limitations by expanding the motion capture communication range indefinitely regardless of time and place. Therefore, it is possible to implement realistic metaverse contents by displaying a realistic and natural digital human because it is free from spatial constraints. The system which was tested in this paper can create a new business model by converging next-generation technologies that are receiving attention related to the digital virtual world, such as motion capture + 5G + digital human twin + metaverse. And it allows for research and develop a next-generation metaverse-based broadcasting solution at a recent time when the business value of digital human and metaverse technologies and functions has been proven and related sales are growing in earnest.

Location-Based Services for Dynamic Range Queries

  • Park Kwangjin;Song Moonbae;Hwang Chong-Sun
    • Journal of Communications and Networks
    • /
    • v.7 no.4
    • /
    • pp.478-488
    • /
    • 2005
  • To conserve the usage of energy, indexing techniques have been developed in a wireless mobile environment. However, the use of interleaved index segments in a broadcast cycle increases the average access latency for the clients. In this paper, we present the broadcast-based location dependent data delivery scheme (BBS) for dynamic range queries. In the BBS, broadcasted data objects are sorted sequentially based on their locations, and the server broadcasts the location dependent data along with an index segment. Then, we present a data prefetching and caching scheme, designed to reduce the query response time. The performance of this scheme is investigated in relation to various environmental variables, such as the distributions of the data objects, the average speed of the clients, and the size of the service area.

Design and Evaluation of an Adaptive Reservation-based Batching Polity for Popular Videos (인기 있는 비디오를 위한 적응적 예약기반 일괄처리 정책의 설계 및 평가)

  • Lee, Gyeong-Suk;Bae, In-Han
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.10
    • /
    • pp.2790-2796
    • /
    • 1999
  • In video-on-demand systems, the I.O bandwidth of video servers is the critical resource which contributes to increase in latency. Several approaches: bridging, piggybacking are used to reduce the I/O demand on the video server through sharing. Batching delays the requests for the different videos for a batching window so that more requests for the same video arriving during the current batching window may be served using the same stream. In this paper, we propose an adaptive reservation-based batching policy which dynamically reserves video server capacity for popoular videos according to video server loads. The performance of the proposed policy is evaluated through a simulation, and is compared with simple batching and static reservation-based batching policies. As the result, we know that the adaptive reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching polices.

  • PDF

An Exponential Indexing Scheme for Broadcast Disk Program in a Single Wireless Channel (단일 무선 채널에서 브로드캐스트 디스크 프로그램을 위한 지수 인덱스 기법)

  • Park, Ki-Young;Jung, Sung-Won
    • Journal of KIISE:Databases
    • /
    • v.35 no.6
    • /
    • pp.518-532
    • /
    • 2008
  • Broadcast scheme has been widely researched for efficient data delivery in the mobile environment because the downlink capacity of a mobile client is much greater than the uplink capacity, and the power of a mobile client is limited. In the proposed scheme, the index lets the client know when data items would be broadcasted and enables the client to minimize the tuning time and power consumption. Single channel index schemes are fit to flat broadcast that performs well when all the broadcasted data items are accessed with the same probability whereas the multi-disk broadcast scheme is proper when the data access distribution is skewed. The existing index schemes, however, cannot work on the Multi-disk broadcast scheme because they cannot point the replicating data items in a broadcast cycle. This paper proposes a Multi-disk Exponential Index (MDEI) which is a single channel index scheme fit to Multi-disk broadcast scheme. Because MDEI scheme organizes a separate index for each disk, it functions with multi-disk broadcast, resulting in a greater reduction of average access latency than that of other flat-broadcast index schemes when the data access distribution is skewed. The performance evaluation showed that MDEI has a good performance when data access distribution is skewed. MDEI has short average access latency and not much average tuning time when the data access distribution is skewed.

Implementation of a Mesh Router Supporting Multi-path Routing based on IEEE 802.11s (다중 경로 라우팅을 지원하는 IEEE 802.11s기반 메쉬 라우터 구현)

  • Kim, Jeong-Soo;Chung, Sang-Hwa;Choi, Hee-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.12A
    • /
    • pp.950-958
    • /
    • 2011
  • This paper focuses in the implementation of mesh router supporting multi-path routing based on IEEE 802.11s. In HWMP of IEEE 802.11s, the single path routing just was defined. So, in this work, we implemented not only the single path routing defined in IEEE 802.11s, but also a multipath routing based on AOMDV which extended the standard. A multi-channel multi-interface technology that can transmit and receive simultaneously and lower bandwidth reduction caused by interferences than a single-channel single-interface was implemented in our mesh router. We also developed an outdoor test bed with the mesh routers. The bandwidth of the mesh router and a real-time video streaming service were verified using the test bed. And, the single path and multipath routing algorithms are also compared. In this test bed, The average TCP bandwidth was 23.77 Mbps and the latency was 2.4 ms in five hops. The test bed could service real-time streaming with an average jitter of 0.547 ms in five hops. The mesh router that used the multipath routing path reduced the path recovery time by 12.73% on average.

LDF-CLOCK: The Least-Dirty-First CLOCK Replacement Policy for PCM-based Swap Devices

  • Yoo, Seunghoon;Lee, Eunji;Bahn, Hyokyung
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.15 no.1
    • /
    • pp.68-76
    • /
    • 2015
  • Phase-change memory (PCM) is a promising technology that is anticipated to be used in the memory hierarchy of future computer systems. However, its access time is relatively slower than DRAM and it has limited endurance cycle. Due to this reason, PCM is being considered as a high-speed storage medium (like swap device) or long-latency memory. In this paper, we adopt PCM as a virtual memory swap device and present a new page replacement policy that considers the characteristics of PCM. Specifically, we aim to reduce the write traffic to PCM by considering the dirtiness of pages when making a replacement decision. The proposed replacement policy tracks the dirtiness of a page at the granularity of a sub-page and replaces the least dirty page among pages not recently used. Experimental results with various workloads show that the proposed policy reduces the amount of data written to PCM by 22.9% on average and up to 73.7% compared to CLOCK. It also extends the lifespan of PCM by 49.0% and reduces the energy consumption of PCM by 3.0% on average.

Toward a Key-frame Extraction Framework for Video Storyboard Surrogates Based on Users' EEG Signals (이용자 기반의 비디오 키프레임 자동 추출을 위한 뇌파측정기술(EEG) 적용)

  • Kim, Hyun-Hee;Kim, Yong-Ho
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.49 no.1
    • /
    • pp.443-464
    • /
    • 2015
  • This study examined the feasibility of using EEG signals and ERP P3b for extracting video key-frames based on users' cognitive responses. Twenty participants were used to collect EEG signals. This research found that the average amplitude of right parietal lobe is higher than that of left parietal lobe when relevant images were shown to participants; there is a significant difference between the average amplitudes of both parietal lobes. On the other hand, the average amplitude of left parietal lobe in the case of non-relevant images is lower than that in the case of relevant images. Moreover, there is no significant difference between the average amplitudes of both parietal lobes in the case of non-relevant images. Additionally, the latency of MGFP1 and channel coherence can be also used as criteria to extract key-frames.

Storage Assignment for Variables Considering Efficient Memory Access in Embedded System Design (임베디드 시스템 설계에서 효율적인 메모리 접근을 고려한 변수 저장 방법)

  • Choi Yoonseo;Kim Taewhan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.2
    • /
    • pp.85-94
    • /
    • 2005
  • It has been reported and verified in many design experiences that a judicious utilization of the page and burst access modes supported by DRAMs contributes a great reduction in not only the DRAM access latency but also DRAM's energy consumption. Recently, researchers showed that a careful arrangement of data variables in memory directly leads to a maximum utilization of the page and burst access modes for the variable accesses, but unfortunately, found that the problems are not tractable, consequently, resorting to simple (e.g., greedy) heuristic solutions to the problems. In this parer, to improve the quality of existing solutions, we propose 0-1 ILP-based techniques which produce optimal or near-optimal solution depending on the formulation parameters. It is shown that the proposed techniques use on average 32.2%, l5.1% and 3.5% more page accesses, and 84.0%, 113.5% and 10.1% more burst accesses compared to OFU (the order of first use) and the technique in [l, 2] and the technique in [3], respectively.