• Title/Summary/Keyword: Information Delay

Search Result 5,535, Processing Time 0.029 seconds

Self-management levels of diet and metabolic risk factors according to disease duration in patients with type 2 diabetes

  • Cho, Sukyung;Kim, Minkyeong;Park, Kyong
    • Nutrition Research and Practice
    • /
    • v.12 no.1
    • /
    • pp.69-77
    • /
    • 2018
  • BACKGROUND/OBJECTIVES: Metabolic risk factors should be managed effectively in patients with type 2 diabetes mellitus (T2DM) to prevent or delay diabetic complications. This study aimed to compare the self-management levels of diet and metabolic risk factors in patients with T2DM, according to the duration of illness, and to examine the trends in self-management levels during the recent decades. SUBJECTS/METHODS: Data were collected from the Korea National Health and Nutrition Examination Surveys (KNHANES, 1998-2014). In our analysis, 4,148 patients with T2DM, aged ${\geq}30years$, were categorized according to the duration of their illness (< 5 years, 5-9 years, and ${\geq}10years$). Demographic and lifestyle information was assessed through self-administered questionnaires, and biomarker levels (e.g., fasting glucose level, blood pressure, or lipid level) were obtained from a health examination. Dietary intake was assessed by a 24-recall, and adherence level to dietary guidelines (meal patterns and intake levels of calories, carbohydrates, vegetable/seaweed, sodium, and alcohol) were assessed. Multivariable generalized linear regression and unconditional logistic regression models were used to compare the prevalence rates of hyperglycemia, dyslipidemia, and hypertension according to the duration of patients' illness, accounting for the complex survey design of the KNHANES. RESULTS: In the multivariable adjusted models, patients with a longer duration (${\geq}10years$) of T2DM had a higher prevalence of hyperglycemia than those with a shorter duration of T2DM (< 5 years) (odds ratio 2.20, 95% confidence interval 1.61-3.01, P for trend < 0.001). We did not observe any associations of disease duration with the prevalence of hypertension and dyslipidemia. In addition, the adherence levels to dietary recommendations did not significantly differ according to disease duration, except adherence to moderate alcohol consumption. There were significant decreasing trends in the prevalence of hyperglycemia in patients with a duration of illness ${\geq}10years$ (P for trend = 0.004). CONCLUSION: Although the proportion of patients with adequate control of glucose levels has improved in recent decades, poorer self-management has been found in those with a longer disease duration. These findings suggest the need for well-planned and individualized patient education programs to improve self-management levels and quality of life by preventing or delaying diabetic complications.

Load-Balancing and Fairness Support Mechanisms in Mobile Ad Hoc Networks (이동 애드혹 네트워크에서의 부하 균등화 및 공평성 지원 방법)

  • Ahn Sanghyun;Yoo Younghwan;Lim Yujin
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.889-894
    • /
    • 2004
  • Most ad-hoc routing protocols such as AODV(Ad Hoc On-Demand Distance Vector) and DSR(Dynamic Source Routing) do not try to search for new routes if the network topology does not change. Hence, with low node mobility, traffic may be concentrated on several nodes, which results in long end-to-end delay due to congestion at the nodes. Furthermore, since some specific nodes are continuously used for long duration, their battery power may be rapidly exhausted. Expiration of nodes causes connections traversing the nodes to be disrupted and makes many routing requests be generated at the same time. Therefore, we propose a load balancing approach called Simple Load-balancing Approach (SLA), which resolves the traffic concentration problem by allowing each node to drop RREQ (Route Request Packet) or to give up packet forwarding depending on its own traffic load. Meanwhile, mobile nodes nay deliberately give up forwarding packets to save their own energy. To make nodes volunteer in packet forwarding. we also suggest a payment scheme called Protocol-Independent Fairness Algorithm (PIEA) for packet forwarding. To evaluate the performance of SLA, we compare two cases where AODV employs SLA or not. Simulation results show that SLA can distribute traffic load well and improve performance of entire ad-hoc networks.

An Architecture for User Level End-to-end QoS using Overlay in NGN (NGN에서 오버레이를 이용한 사용자 관점의 End-to-end QoS 지원 구조)

  • Lee Jihyun;Lim Kyungshik;Oh Hangseok;Nam Taekyong
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.781-792
    • /
    • 2005
  • This study proposes an Architecture for user level End-to-end Quality of Service(QoS) using overlay In Next Generation Network(NGN). Inexisting NGNs, the IMS of a control plane provides user QoS through direct traffic control and resource-reservation over the IP packet transport network of a user plane. Further, a set of torrent studies are ongoing not only to maximize the QoS for users, but also to minimize the quality deterioration for supporting the user End-to-end QoS. Along with that, an extended QoS in user level must be considered, for Instance, differentiating service quality to support users' expectation, providing optimized contents by users' equipments, and so forth. Accordingly, the Overlay Service Network Architecture proposed by this study provides protocol adaptation for maximum throughput on transport layer by using the most efficient transport layer protocol to various network circumstances. Also, the Overlay Service Network Architecture on application layer distributes processing delay from the data transformation process of the user equipment to the network, and it is capable of intermediate processing depending on user service level. application service feature, and equipment circumstance as well. Thus, this study mainly proposes the Overlay Service Network Architecture for user level end-to-end QoS in NGN with the quality control features both on the transport layer and the application layer, an internal component feature, and a service scenario providing the QoS linking with 3GPP.

Update Frequency Cache Consistency for Reducing Wait Time in Mobile Computing (이동 컴퓨팅 환경에서 대기 시간을 감소시키는 갱신 빈도 캐쉬 일관성 기법)

  • Lee, Chan-Seob;Kim, Dong-Hyuk;Baek, Joo-Hyun;Choi, Eui-In
    • The KIPS Transactions:PartD
    • /
    • v.9D no.6
    • /
    • pp.1017-1024
    • /
    • 2002
  • According as mobile computing environment is generalized by development of wireless networking technology and communication device, mobile host uses local cache for extensibility and early response time. and reduction of limited bandwidth. This time, between mobile host and mobile support station cache need consistency interested person of done data accordingly much techniqueses propose. Existent consistency techniques because detection based techniqueses are used mainly and broadcast periodic invalid message considering frequent disconnection. However, these techniqueses increase abort step through increase or delay of transmission message number by accuracy examination of data. Therefore, because mobile host deletes cached data, and extensity are decreased. Techniques that is proposed in this paper did to perform refering update frequency about object that page request or when complete update operation happens to solve these problem. Therefore, have advantage that response is fast because could run write intention declaration or update by update frequency electively asynchronously when update operation consists and abort step decreases. Also, improved extensity running delete or propagation electively according to update frequency about periodic invalid message gone since disconnection.

Compact Field Remapping for Dynamically Allocated Structures (동적으로 할당된 구조체를 위한 압축된 필드 재배치)

  • Kim, Jeong-Eun;Han, Hwan-Soo
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.10
    • /
    • pp.1003-1012
    • /
    • 2005
  • The most significant difference of embedded systems from general purpose systems is that embedded systems are allowed to use only limited resources including battery and memory. Especially, the number of applications increases which deal with multimedia data. In those systems with high data computations, the delay of memory access is one of the major bottlenecks hurting the system performance. As a result, many researchers have investigated various techniques to reduce the memory access cost. Most programs generally have locality in memory references. Temporal locality of references means that a resource accessed at one point will be used again in the near future. Spatial locality of references is that likelihood of using a resource gets higher if resources near it were just accessed. The latest embedded processors usually adapt cache memory to exploit these two types of localities. Processors access faster cache memory than off-chip memory, reducing the latency. In this paper we will propose the enhanced dynamic allocation technique for structure-type data in order to eliminate unused memory space and to reduce both the cache miss rate and the application execution time. The proposed approach aggregates fields from multiple records dynamically allocated and consecutively remaps them on the memory space. Experiments on Olden benchmarks show $13.9\%$ L1 cache miss rate drop and $15.9\%$ L2 cache miss drop on average, compared to the previously proposed techniques. We also find execution time reduced by $10.9\%$ on average, compared to the previous work.

Energy-efficient Correlated Data Placement Techniques for Multi-disk-based Mobile Systems (다중 디스크 기반 모바일 시스템 대상의 에너지 효율적인 연관 데이타 배치 기법)

  • Kim, Young-Jin;Kwon, Kwon-Taek;Kim, Ji-Hong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.3
    • /
    • pp.101-112
    • /
    • 2007
  • Hard disks have been the most prevalent secondary storage devices and these days their usage is becoming more important in mobile computing systems due to I/O intensive applications such as multimedia applications and games. However, significant power consumption in the disk drives still limits battery lifetimes of mobile systems critically. In this paper, we show that using several smaller disks (instead of one large disk) can be an energy-efficient secondary storage solution on typical mobile platforms without a significant performance delay. Also, we propose a novel energy-efficient technique, which clusters related data into groups and migrates the correlated groups to the same disk. We compare this method with the existing data concentration scheme, and also combine them. The experiments show that our technique saves the energy consumption up to 34% when a pair of 1.8' disks is used instead of a single 2.5' disk with a negligible increase in the average response time. The results also show that our method also saves up to 14.8% of disk energy consumption and improve the average I/O response time by up to 10 times over the existing scheme.

Construction of a WAP Proxy and its Improvement for Wireless Communication Efficiency (WAP 프록시의 구축 및 무선통신 효율을 위한 개선)

  • Park, Kee-Hyun;Synn, Yang-Mo;Ju, Hong-Taek
    • The KIPS Transactions:PartC
    • /
    • v.11C no.3
    • /
    • pp.379-386
    • /
    • 2004
  • The WAP 2.0 system is a newly proposed wireless communication system by the WAP Forum for interoperability across Internet environment and the system takes charge of communication between WAP terminals and existing origin Web servers. The purpose of this paper is 1) to construct a WAP 2.0 proxy proposed by the WAP Forum and 2) to improve the WAP Proxy in order to increase communication efficiency between wired and wireless communication objects. The Improved WAP proxy constructed in this study provides links between wired and wireless communication environments using the split-TCP concept. However, unlike the split-TCP connection, The improved WAP proxy maintains TCP's end-to-end semantics and reduces overhead by avoiding operations as much as possible on the upper protocol layer. In addition, The improved WAP proxy supports SACK(Selective Acknowledgement ) option and Timestamp option for speedy re-transmission which leads to reduction of performance degradation. After constructing the improved WAP proxy under Linux environment, experiments have been taken. The experimental results show that, compared with the experiments when a WAP proxy proposed by the WAP Forum is used, both data transmission delay time and data transmission size decrease to show that communication efficiency is increased. In particular, as packet missing ratio Increases, data transmission size decreases, which demonstrates that the improved WAP proxy is very effective for performance improvement in wireless communication environment.

Temperature-Aware Microprocessor Design for Floating-Point Applications (부동소수점 응용을 위한 저온도 마이크로프로세서 설계)

  • Lee, Byeong-Seok;Kim, Cheol-Hong;Lee, Jeong-A
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.6
    • /
    • pp.532-542
    • /
    • 2009
  • Dynamic Thermal Management (DTM) technique is generally used for reducing the peak temperature (hotspot) in the microprocessors. Despite the advantages of lower cooling cost and improved stability, the DTM technique inevitably suffers from performance loss. This paper proposes the DualFloating-Point Adders Architecture to minimize the performance loss due to thermal problem when the floating-point applications are executed. During running floating-point applications, only one of two floating-point adders is used selectively in the proposed architecture, leading to reduced peak temperature in the processor. We also propose a new floorplan technique, which creates Space for Heat Transfer Delay in the processor for solving the thermal problem due to heat transfer between adjacent hot units. As a result, the peak temperature drops by $5.3^{\circ}C$ on the average (maximum $10.8^{\circ}C$ for the processor where the DTM is adopted, consequently giving a solution to the thermal problem. Moreover, the processor performance is improved by 41% on the average by reducing the stall time due to the DTM.

A Policy of Page Management Using Double Cache for NAND Flash Memory File System (NAND 플래시 메모리 파일 시스템을 위한 더블 캐시를 활용한 페이지 관리 정책)

  • Park, Myung-Kyu;Kim, Sung-Jo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.5
    • /
    • pp.412-421
    • /
    • 2009
  • Due to the physical characteristics of NAND flash memory, overwrite operations are not permitted at the same location, and therefore erase operations are required prior to rewriting. These extra operations cause performance degradation of NAND flash memory file system. Since it also has an upper limit to the number of erase operations for a specific location, frequent erases should reduce the lifetime of NAND flash memory. These problems can be resolved by delaying write operations in order to improve I/O performance: however, it will lower the cache hit ratio. This paper proposes a policy of page management using double cache for NAND flash memory file system. Double cache consists of Real cache and Ghost cache to analyze page reference patterns. This policy attempts to delay write operations in Ghost cache to maintain the hit ratio in Real cache. It can also improve write performance by reducing the search time for dirty pages, since Ghost cache consists of Dirty and Clean list. We find that the hit ratio and I/O performance of our policy are improved by 20.57% and 20.59% in average, respectively, when comparing them with the existing policies. The number of write operations is also reduced by 30.75% in average, compared with of the existing policies.

Boosting up the Mount Latency of NAND Flash File System using Byte-addressable NVRAM (바이트 접근성을 가지는 비휘발성 메모리 소자를 이용한 낸드 플래시 파일 시스템의 부팅시간 개선 기법)

  • Jeon, Byeong-Gil;Kim, Eun-Ki;Shin, Hyung-Jong;Han, Seok-Hee;Won, Yoo-Jip
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.3
    • /
    • pp.256-260
    • /
    • 2008
  • This paper describes an improvement of mount-time delay in NAND Flash file systems. To improve file system mount performance, this work configures a hierarchical storage system with byte-addressable NVRAM and NAND Flash memory, and let the meta data of a file system allocated in the NVRAM. Since the meta data are stored in NVRAM supporting data integrity some of the items, which are stored in Spare area and Object Header area of NAND Flash memory to control meta data of NAND Flash file system, could be eliminated. And also, this work eliminates the scanning operation of the Object Header area of previous work FRASH1.0. The scanning operation is definitely required to find out the empty Object Header address for storing the Object Header data and provokes a certain amount of performance loss in file generation and deletion. In this work, an implemented file system, so-called FRASH1.5, is demonstrated, featuring new data structures and new algorithms. The mount time of FRASH1.5 becomes twice as fast as that of the FRASH1.0. The performance in file generation gets improved by about $3{\sim}8%$. In particular, for most large-size files, the FRASH1.5 has 8 times faster mount time than YAFFS, without any performance loss as seen in the file generation.