• Title/Summary/Keyword: adaptive control technique

Search Result 513, Processing Time 0.031 seconds

An Adaptive Buffer Tuning Mechanism for striped transport layer connection on multi-homed mobile host (멀티홈 모바일 호스트상에서 스트라이핑 전송계층 연결을 위한 적응형 버퍼튜닝기법)

  • Khan, Faraz-Idris;Huh, Eui-Nam
    • Journal of Internet Computing and Services
    • /
    • v.10 no.4
    • /
    • pp.199-211
    • /
    • 2009
  • Recent advancements in wireless networks have enabled support for mobile applications to transfer data over heterogeneous wireless paths in parallel using data striping technique [2]. Traditionally, high performance data transfer requires tuning of multiple TCP sockets, at sender's end, based on bandwidth delay product (BDP). Moreover, traditional techniques like Automatic TCP Buffer Tuning (ATBT), which balance memory and fulfill network demand, is designed for wired infrastructure assuming single flow on a single socket. Hence, in this paper we propose a buffer tuning technique at senders end designed to ensure high performance data transfer by striping data at transport layer across heterogeneous wireless paths. Our mechanism has the capability to become a resource management system for transport layer connections running on multi-homed mobile host supporting features for wireless link i.e. mobility, bandwidth fluctuations, link level losses. We show that our proposed mechanism performs better than ATBT, in efficiently utilizing memory and achieving aggregate throughput.

  • PDF

APC: An Adaptive Page Prefetching Control Scheme in Virtual Memory System (APC: 가상 메모리 시스템에서 적응적 페이지 선반입 제어 기법)

  • Ahn, Woo-Hyun;Yang, Jong-Cheol;Oh, Jae-Won
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.3
    • /
    • pp.172-183
    • /
    • 2010
  • Virtual memory systems (VM) reduce disk I/Os caused by page faults using page prefetching, which reads pages together with a desired page at a page fault in a single disk I/O. Operating systems including 4.4BSD attempt to prefetch as many pages as possible at a page fault regardless of page access patterns of applications. However, such an approach increases a disk access time taken to service a page fault when a high portion of the prefetched pages is not referenced. More seriously, the approach can cause the memory pollution, a problem that prefetched pages not to be accessed evict another pages that will be referenced soon. To solve these problems, we propose an adaptive page prefetching control scheme (APC), which periodically monitors access patterns of prefetched pages in a process unit. Such a pattern is represented as the ratio of referenced pages among prefetched ones before they are evicted from memory. Then APC uses the ratio to adjust the number of pages that 4.4BSD VM intends to prefetch at a page fault. Thus APC allows 4.4BSD VM to prefetch a proper number of pages to have a better effect on reducing disk I/Os, though page access patterns of an application vary in runtime. The experiment of our technique implemented in FreeBSD 6.2 shows that APC improves the execution times of SOR, SMM, and FFT benchmarks over 4.4BSD VM by up to 57%.

Lifetime Maximization of Wireless Video Sensor Network Node by Dynamically Resizing Communication Buffer

  • Choi, Kang-Woo;Yi, Kang;Kyung, Chong Min
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.5149-5167
    • /
    • 2017
  • Reducing energy consumption in a wireless video sensor network (WVSN) is a crucial problem because of the high video data volume and severe energy constraints of battery-powered WVSN nodes. In this paper, we present an adaptive dynamic resizing approach for a SRAM communication buffer in a WVSN node in order to reduce the energy consumption and thereby, to maximize the lifetime of the WVSN nodes. To reduce the power consumption of the communication part, which is typically the most energy-consuming component in the WVSN nodes, the radio needs to remain turned off during the data buffer-filling period as well as idle period. As the radio ON/OFF transition incurs extra energy consumption, we need to reduce the ON/OFF transition frequency, which requires a large-sized buffer. However, a large-sized SRAM buffer results in more energy consumption because SRAM power consumption is proportional to the memory size. We can dynamically adjust any active buffer memory size by utilizing a power-gating technique to reflect the optimal control on the buffer size. This paper aims at finding the optimal buffer size, based on the trade-off between the respective energy consumption ratios of the communication buffer and the radio part, respectively. We derive a formula showing the relationship between control variables, including active buffer size and total energy consumption, to mathematically determine the optimal buffer size for any given conditions to minimize total energy consumption. Simulation results show that the overall energy reduction, using our approach, is up to 40.48% (26.96% on average) compared to the conventional wireless communication scheme. In addition, the lifetime of the WVSN node has been extended by 22.17% on average, compared to the existing approaches.

Effective Iterative Control Method to Reduce the Decoding Delay for Turbo TCM Decoder (터보 TCM 디코더의 복호 지연을 감소시키기 위한 효율적인 반복복호 제어기법)

  • 김순영;김정수;장진수;이문호
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.8
    • /
    • pp.816-822
    • /
    • 2003
  • In this paper, we propose an efficient iteration control method with low complexity for Turbo TCM(Turbo Trellis Coded Modulation) decoding which will be used fur power-limited environment. As the decoding approaches the performance limit of a given turbo code, any further iteration results in very little improvement. Therefore, it is important to devise an efficient criterion to stop the iteration process and prevent unnecessary computations and decoding delay. This paper presents an efficient algorithm for turbo TCM decoding that can greatly reduce the delay and iteration number. The proposed method use adaptive iteration number according to the criterion using the extrinsic information variance parameter in turbo TCM decoding process. The simulation results show that the proposed technique effectively can reduce the decoding delay and computation with very little performance degradation.

Salt-induced Differential Gene Expression in Italian Ryegrass (Lolium multiflorum Lam.) Revealed by Annealing Control Primer Based GeneFishing approach

  • Lee, Ki-Won;Lee, Sang-Hoon;Choi, Gi Jun;Ji, Hee Jung;Hwang, Tae Young;Kim, Won Ho;Rahman, Md. Atikur
    • Journal of The Korean Society of Grassland and Forage Science
    • /
    • v.37 no.3
    • /
    • pp.231-236
    • /
    • 2017
  • Salt stress is one of the most limiting factors that reduce plant growth, development and yield. However, identification of salt-inducible genes is an initial step for understanding the adaptive response of plants to salt stress. In this study, we used an annealing control primer (ACP) based GeneFishing technique to identify differentially expressed genes (DEGs) in Italian ryegrass seedlings under salt stress. Ten-day-old seedlings were exposed to 100 mM NaCl for 6 h. Using 60 ACPs, a total 8 up-regulated genes were identified and sequenced. We identified several promising genes encoding alpha-glactosidase b, light harvesting chlorophyll a/b binding protein, metallothionein-like protein 3B-like, translation factor SUI, translation initiation factor eIF1, glyceraldehyde-3-phosphate dehydrogenase 2 and elongation factor 1-alpha. These genes were mostly involved in plant development, signaling, ROS detoxification and salt acclimation. However, this study provides new molecular information of several genes to understand the salt stress response. These genes would be useful for the enhancement of salt stress tolerance in plants.

Stochastic Radar Beam Scheduling Using Simulated Annealing (Simulated Annealing을 이용한 추계적 레이더 빔 스케줄링 알고리즘)

  • Roh, Ji-Eun;Ahn, Chang-Soo;Kim, Seon-Joo;Jang, Dae-Sung;Choi, Han-Lim
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.2
    • /
    • pp.196-206
    • /
    • 2012
  • AESA radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability, compared with mechanically scanned array radar. AESA radar brings a new challenges, radar resource management(RRM), which is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. Especially radar beam scheduling is the most critical component for the success of RRM. In this paper, we proposed stochastic radar beam scheduling algorithm using simulated annealing(SA), and evaluated the performance on the multi-function radar scenario. As a result, we showed that our proposed algorithm is superior to previous dispatching rule based scheduling algorithm from the viewpoint of beam processing latency and the number of scheduled beams, with real time capability.

Feasibility of Shrinking Field Radiation Therapy through 18F-FDG PET/CT after 40 Gy for Stage III Non-Small Cell Lung Cancers

  • Ding, Xiu-Ping;Zhang, Jian;Li, Bao-Sheng;Li, Hong-Sheng;Wang, Zhong-Tang;Yi, Yan;Sun, Hong-Fu;Wang, Dong-Qing
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.13 no.1
    • /
    • pp.319-323
    • /
    • 2012
  • Objective: To explore the feasibility of shrinking field technique after 40 Gy radiation through 18F-FDG PET/CT during treatment for patients with stage III non-small cell lung cancer (NSCLC). Methods: In 66 consecutive patients with local-advanced NSCLC, 18F-FDG PET/CT scanning was performed prior to treatment and repeated after 40 Gy. Conventionally fractionated IMRT or CRT plans to a median total dose of 66Gy (range, 60-78Gy) were generated. The target volumes were delineated in composite images of CT and PET. Plan 1 was designed for 40 Gy to the initial planning target volume (PTV) with a subsequent 20-28 Gy-boost to the shrunken PTV. Plan 2 was delivering the same dose to the initial PTV without shrinking field. Accumulated doses of normal tissues were calculated using deformable image registration during the treatment course. Results: The median GTV and PTV reduction were 35% and 30% after 40 Gy treatment. Target volume reduction was correlated with chemotherapy and sex. In plan 2, delivering the same dose to the initial PTV could have only been achieved in 10 (15.2%) patients. Significant differences (p<0.05) were observed regarding doses to the lung, spinal cord, esophagus and heart. Conclusions: Radiotherapy adaptive to tumor shrinkage determined by repeated 18F-FDG PET/CT after 40 Gy during treatment course might be feasible to spare more normal tissues, and has the potential to allow dose escalation and increased local control.

Design and Implementation of Radar Resource Management Algorithms for Airborne AESA Radar (항공기 탑재 능동 위상배열 레이더의 자원관리 알고리즘 설계 및 구현)

  • Roh, Ji-Eun;Chon, Sang-Mi;Ahn, Chang-Soo;Jang, Seong-Hoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.24 no.12
    • /
    • pp.1190-1197
    • /
    • 2013
  • AESA(Active Electronically Scanned Array radar) radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability. For this reason, radar resource management(RRM) becomes new challenging issue. RRM is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. This paper deals with a design of radar resource management algorithms and simulator implemented main algorithms for development of airborne AESA radar. In addition, evaluation results show that developed radar system satisfies a main requirement about simultaneous multiple target tracking and detection by adopting proposed algorithms.

Night Time Leading Vehicle Detection Using Statistical Feature Based SVM (통계적 특징 기반 SVM을 이용한 야간 전방 차량 검출 기법)

  • Joung, Jung-Eun;Kim, Hyun-Koo;Park, Ju-Hyun;Jung, Ho-Youl
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.7 no.4
    • /
    • pp.163-172
    • /
    • 2012
  • A driver assistance system is critical to improve a convenience and stability of vehicle driving. Several systems have been already commercialized such as adaptive cruise control system and forward collision warning system. Efficient vehicle detection is very important to improve such driver assistance systems. Most existing vehicle detection systems are based on a radar system, which measures distance between a host and leading (or oncoming) vehicles under various weather conditions. However, it requires high deployment cost and complexity overload when there are many vehicles. A camera based vehicle detection technique is also good alternative method because of low cost and simple implementation. In general, night time vehicle detection is more complicated than day time vehicle detection, because it is much more difficult to distinguish the vehicle's features such as outline and color under the dim environment. This paper proposes a method to detect vehicles at night time using analysis of a captured color space with reduction of reflection and other light sources in images. Four colors spaces, namely RGB, YCbCr, normalized RGB and Ruta-RGB, are compared each other and evaluated. A suboptimal threshold value is determined by Otsu algorithm and applied to extract candidates of taillights of leading vehicles. Statistical features such as mean, variance, skewness, kurtosis, and entropy are extracted from the candidate regions and used as feature vector for SVM(Support Vector Machine) classifier. According to our simulation results, the proposed statistical feature based SVM provides relatively high performances of leading vehicle detection with various distances in variable nighttime environments.

Effects of LDPCA Frame Size for Parity Bit Estimation Methods in Fast Distributed Video Decoding Scheme (고속 분산 비디오 복호화 기법에서 패리티 비트 예측방식에 대한 LDPCA 프레임 크기 효과)

  • Kim, Man-Jae;Kim, Jin-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.8
    • /
    • pp.1675-1685
    • /
    • 2012
  • DVC (Distributed Video Coding) technique plays an essential role in providing low-complexity video encoder. But, in order to achieve the better rate-distortion performances, most DVC systems need feedback channel for parity bit control. This causes the DVC-based system to have high decoding latency and becomes as one of the most critical problems to overcome for a real implementation. In order to overcome this problem and to accelerate the commercialization of the DVC applications, this paper analyzes an effect of LDPCA frame size for adaptive LDPCA frame-based parity bit request estimations. First, this paper presents the LDPCA segmentation method in pixel-domain and explains the temporal-based bit request estimation method and the spatial-based bit request estimation method using the statistical characteristics between adjacent LDPCA frames. Through computer simulations, it is shown that the better performance and fast decoding is observed specially when the LDPCA frame size is 3168 in QCIF resolution.