• Title/Summary/Keyword: time window constraints

Search Result 42, Processing Time 0.021 seconds

A New Cross-Layer QoS-Provisioning Architecture in Wireless Multimedia Sensor Networks

  • Sohn, Kyungho;Kim, Young Yong;Saxena, Navrati
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5286-5306
    • /
    • 2016
  • Emerging applications in automation, medical imaging, traffic monitoring and surveillance need real-time data transmission over Wireless Sensor Networks (WSNs). Guaranteeing Quality of Service (QoS) for real-time traffic over WSNs creates new challenges. Rapid penetration of smart devices, standardization of Machine Type Communications (MTC) in next generation 5G wireless networks have added new dimensions in these challenges. In order to satisfy such precise QoS constraints, in this paper, we propose a new cross-layer QoS-provisioning strategy in Wireless Multimedia Sensor Networks (WMSNs). The network layer performs statistical estimation of sensory QoS parameters. Identifying QoS-routing problem with multiple objectives as NP-complete, it discovers near-optimal QoS-routes by using evolutionary genetic algorithms. Subsequently, the Medium Access Control (MAC) layer classifies the packets, automatically adapts the contention window, based on QoS requirements and transmits the data by using routing information obtained by the network layer. Performance analysis is carried out to get an estimate of the overall system. Through the simulation results, it is manifested that the proposed strategy is able to achieve better throughput and significant lower delay, at the expense of negligible energy consumption, in comparison to existing WMSN QoS protocols.

Gesture Recognition by Analyzing a Trajetory on Spatio-Temporal Space (시공간상의 궤적 분석에 의한 제스쳐 인식)

  • 민병우;윤호섭;소정;에지마 도시야끼
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.1
    • /
    • pp.157-157
    • /
    • 1999
  • Researches on the gesture recognition have become a very interesting topic in the computer vision area, Gesture recognition from visual images has a number of potential applicationssuch as HCI (Human Computer Interaction), VR(Virtual Reality), machine vision. To overcome thetechnical barriers in visual processing, conventional approaches have employed cumbersome devicessuch as datagloves or color marked gloves. In this research, we capture gesture images without usingexternal devices and generate a gesture trajectery composed of point-tokens. The trajectory Is spottedusing phase-based velocity constraints and recognized using the discrete left-right HMM. Inputvectors to the HMM are obtained by using the LBG clustering algorithm on a polar-coordinate spacewhere point-tokens on the Cartesian space .are converted. A gesture vocabulary is composed oftwenty-two dynamic hand gestures for editing drawing elements. In our experiment, one hundred dataper gesture are collected from twenty persons, Fifty data are used for training and another fifty datafor recognition experiment. The recognition result shows about 95% recognition rate and also thepossibility that these results can be applied to several potential systems operated by gestures. Thedeveloped system is running in real time for editing basic graphic primitives in the hardwareenvironments of a Pentium-pro (200 MHz), a Matrox Meteor graphic board and a CCD camera, anda Window95 and Visual C++ software environment.

Performance Study of Multicore Digital Signal Processor Architectures (멀티코어 디지털 신호처리 프로세서의 성능 연구)

  • Lee, Jongbok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.4
    • /
    • pp.171-177
    • /
    • 2013
  • Due to the demand for high speed 3D graphic rendering, video file format conversion, compression, encryption and decryption technologies, the importance of digital signal processor system is growing rapidly. In order to satisfy the real-time constraints, high performance digital signal processor is required. Therefore, as in general purpose computer systems, digital signal processor should be designed as multicore architecture as well. Using UTDSP benchmarks as input, the trace-driven simulation has been performed and analyzed for the 2 to 16-core digital signal processor architectures with the cores from simple RISC to in-order and out-of-order superscalar processors for the various window sizes, extensively.

Wireless LAN with Medical-Grade QoS for E-Healthcare

  • Lee, Hyung-Ho;Park, Kyung-Joon;Ko, Young-Bae;Choi, Chong-Ho
    • Journal of Communications and Networks
    • /
    • v.13 no.2
    • /
    • pp.149-159
    • /
    • 2011
  • In this paper, we study the problem of how to design a medical-grade wireless local area network (WLAN) for healthcare facilities. First, unlike the IEEE 802.11e MAC, which categorizes traffic primarily by their delay constraints, we prioritize medical applications according to their medical urgency. Second, we propose a mechanism that can guarantee absolute priority to each traffic category, which is critical for medical-grade quality of service (QoS), while the conventional 802.11e MAC only provides relative priority to each traffic category. Based on absolute priority, we focus on the performance of real-time patient monitoring applications, and derive the optimal contention window size that can significantly improve the throughput performance. Finally, for proper performance evaluation from a medical viewpoint, we introduce the weighted diagnostic distortion (WDD) as a medical QoS metric to effectively measure the medical diagnosability by extracting the main diagnostic features of medical signal. Our simulation result shows that the proposed mechanism, together with medical categorization using absolute priority, can significantly improve the medical-grade QoS performance over the conventional IEEE 802.11e MAC.

Optimal Spatial Scale for Land Use Change Modelling : A Case Study in a Savanna Landscape in Northern Ghana (지표피복변화 연구에서 최적의 공간스케일의 문제 : 가나 북부지역의 사바나 지역을 사례로)

  • Nick van de Giesen;Paul L. G. Vlek;Park Soo Jin
    • Journal of the Korean Geographical Society
    • /
    • v.40 no.2 s.107
    • /
    • pp.221-241
    • /
    • 2005
  • Land Use and Land Cover Changes (LUCC) occur over a wide range of space and time scales, and involve complex natural, socio-economic, and institutional processes. Therefore, modelling and predicting LUCC demands an understanding of how various measured properties behave when considered at different scales. Understanding spatial and temporal variability of driving forces and constraints on LUCC is central to understanding the scaling issues. This paper aims to 1) assess the heterogeneity of land cover change processes over the landscape in northern Ghana, where intensification of agricultural activities has been the dominant land cover change process during the past 15 years, 2) characterise dominant land cover change mechanisms for various spatial scales, and 3) identify the optimal spatial scale for LUCC modelling in a savanna landscape. A multivariate statistical method was first applied to identify land cover change intensity (LCCI), using four time-sequenced NDVI images derived from LANDSAT scenes. Three proxy land use change predictors: distance from roads, distance from surface water bodies, and a terrain characterisation index, were regressed against the LCCI using a multi-scale hierarchical adaptive model to identify scale dependency and spatial heterogeneity of LUCC processes. High spatial associations between the LCCI and land use change predictors were mostly limited to moving windows smaller than 10$\times$10km. With increasing window size, LUCC processes within the window tend to be too diverse to establish clear trends, because changes in one part of the window are compensated elsewhere. This results in a reduced correlation between LCCI and land use change predictors at a coarser spatial extent. The spatial coverage of 5-l0km is incidentally equivalent to a village or community area in the study region. In order to reduce spatial variability of land use change processes for regional or national level LUCC modelling, we suggest that the village level is the optimal spatial investigation unit in this savanna landscape.

An Improved Particle Swarm Optimization Algorithm for Care Worker Scheduling

  • Akjiratikarl, Chananes;Yenradee, Pisal;Drake, Paul R.
    • Industrial Engineering and Management Systems
    • /
    • v.7 no.2
    • /
    • pp.171-181
    • /
    • 2008
  • Home care, known also as domiciliary care, is part of the community care service that is a responsibility of the local government authorities in the UK as well as many other countries around the world. The aim is to provide the care and support needed to assist people, particularly older people, people with physical or learning disabilities and people who need assistance due to illness to live as independently as possible in their own homes. It is performed primarily by care workers visiting clients' homes where they provide help with daily activities. This paper is concerned with the dispatching of care workers to clients in an efficient manner. The optimized routine for each care worker determines a schedule to achieve the minimum total cost (in terms of distance traveled) without violating the capacity and time window constraints. A collaborative population-based meta-heuristic called Particle Swarm Optimization (PSO) is applied to solve the problem. A particle is defined as a multi-dimensional point in space which represents the corresponding schedule for care workers and their clients. Each dimension of a particle represents a care activity and the corresponding, allocated care worker. The continuous position value of each dimension determines the care worker to be assigned and also the assignment priority. A heuristic assignment scheme is specially designed to transform the continuous position value to the discrete job schedule. This job schedule represents the potential feasible solution to the problem. The Earliest Start Time Priority with Minimum Distance Assignment (ESTPMDA) technique is developed for generating an initial solution which guides the search direction of the particle. Local improvement procedures (LIP), insertion and swap, are embedded in the PSO algorithm in order to further improve the quality of the solution. The proposed methodology is implemented, tested, and compared with existing solutions for some 'real' problem instances.

A Study on the Allocation and Engagement Scheduling of Air Defense Missiles by Using Mixed Integer Programming (혼합정수계획법을 이용한 요격미사일의 할당 및 교전 일정계획에 관한 연구)

  • Lee, Dae Ryeock;Yang, Jaehwan
    • Korean Management Science Review
    • /
    • v.32 no.4
    • /
    • pp.109-133
    • /
    • 2015
  • This paper considers the allocation and engagement scheduling of air defense missiles by using MIP (mixed integer programming). Specifically, it focuses on developing a realistic MIP model for a real battle situation where multiple enemy missiles are headed toward valuable defended assets and there exist multiple air defense missiles to counteract the threats. In addition to the conventional objective such as the minimization of surviving target value, the maximization of total intercept altitude is introduced as a new objective. The intercept altitude of incoming missiles is important in order to minimize damages from debris of the intercepted missiles and moreover it can be critical if the enemy warhead contains an atomic or chemical bomb. The concept of so called the time window is used to model the engagement situation and a continuous time is assumed for flying times of the both missiles. Lastly, the model is extended to simulate the situation where the guidance radar, which guides a defense missile to its target, has the maximum guidance capacity. The initial mathematical model developed contains several non-linear constraints and a non-linear objective function. Hence, the linearization of those terms is performed before it is solved by a commercially available software. Then to thoroughly examine the MIP model, the model is empirically evaluated with several test problems. Specifically, the models with different objective functions are compared and several battle scenarios are generated to evaluate performance of the models including the extended one. The results indicate that the new model consistently presents better and more realistic results than the compared models.

GRASP Algorithm for Dynamic Weapon-Target Assignment Problem (동적 무장할당 문제에서의 GRASP 알고리즘 연구)

  • Park, Kuk-Kwon;Kang, Tae Young;Ryoo, Chang-Kyung;Jung, YoungRan
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.47 no.12
    • /
    • pp.856-864
    • /
    • 2019
  • The weapon-target assignment (WTA) problem is a matter of effectively allocating weapons to a number of threats. The WTA in a rapidly changing dynamic environment of engagement must take into account both of properties of the threat and the weapon and the effect of the previous decision. We propose a method of applying the Greedy Randomized Adaptive Search Procedure (GRASP) algorithm, a kind of meta-heuristic method, to derive optimal solution for a dynamic WTA problem. Firstly, we define a dynamic WTA problem and formulate a mathematical model for applying the algorithm. For the purpose of the assignment strategy, the objective function is defined and time-varying constraints are considered. The dynamic WTA problem is then solved by applying the GRASP algorithm. The optimal solution characteristics of the formalized dynamic WTA problem are analyzed through the simulation, and the algorithm performance is verified via the Monte-Carlo simulation.

Scheduling Method of Real-Time Mobile Transaction Manager considering Value of Transactions and Validity of Real-Time Data (트랜잭션의 중요도와 데이터의 유효성을 고려한 실시간 이동 트랜잭션 관리자의 스케줄링 기법)

  • Jo, Suk-Gyeong;Kim, Gyeong-Bae;Lee, Sun-Jo;Bae, Hae-Yeong
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.533-542
    • /
    • 2001
  • In this paper, we present a scheduling method for real-time mobile transaction manager in mobile computing environment. The proposed method checks whether a transaction is executable or not. It is able to by considering not only the deadline of real-time data in mobile hosts. And then, it schedules the real-time mobile transactions by making optimal execution window based on the priority queue, while considering transaction value and deadline. Disconnection with mobile hosts is monitored in selecting the transaction for execution. Using the proposed method reduces the number of restarting times after transaction aborts which is caused by the violation of the validity constraints of real-time data. And in has merits of maximizing the sum of values of real-time mobile transactions which meet the deadline. The performance evaluation demonstrates that the number of committed real-time transactions within the deadline is improved by 20%. This method can be used in real-time mobile transaction manager is such environments as cellular communications, emergency medicine information system and so on.

  • PDF

Development of Radiation Free Soft X-Ray Ionizer with Ion Control (완전차폐 및 이온조절형 연X선식 정전기제거장치의 개발)

  • Jeong, Phil Hoon;Lee, Dong Hoon
    • Journal of the Korean Society of Safety
    • /
    • v.31 no.5
    • /
    • pp.22-27
    • /
    • 2016
  • The Electrostatic Charge Prevention Technology is a core factor that highly influences the yield of Ultra High Resolution Flat Panel Display and high-integrated semiconductor manufacturing processes. The corona or x-ray ionizations are commonly used in order to eliminate static charges during manufacturing processes. To develop such a revolutionary x-ray ionizer that is free of x-ray radiation and has function to control the volume of ion formation simultaneously is a goal of this research and it absolutely overcomes the current risks of x-ray ionization. Under the International Commission on Radiological Protection, it must have a leakage radiation level that should be lower than a recommended level that is $1{\mu}Sv/hour$. In this research, the new generation of x-ray ionizer can easily control both the volume of ion formation and the leakage radiation level at the same time. In the research, the test constraints were set and the descriptions are as below; First, In order not to leak x-ray radiation while testing, the shielding box was fully installed around the test equipment area. Second, Implement the metallic Ring Electrode along a tube window and applied zero to ${\pm}8kV$ with respect to manage the positive and negative ions formation. Lastly, the ion duty ratio was able to be controlled in different test set-ups along with a free x-ray leakage through the metallic Ring Electrode. In the result of experiment, the maximum x-ray radiation leakage was $0.2{\mu}Sv/h$. These outcome is lower than the ICRP 103 recommended value, which is $1{\mu}Sv/h$. When applying voltage to the metallic ring electrode, the positive decay time was 2.18s at the distance of 300 mm and its slope was 0.272. In addition, the negative decay time was 2.1s at the distance of 300 mm and its slope was 0.262. At the distance of 200 mm, the positive decay time was 2.29s and its slope was 0.286. The negative decay time was 2.35s and its slope was 0.293. At the distance of 100 mm, the positive decay time was 2.71s and its slope was 0.338. The negative decay time was 3.07s and its slope was 0.383. According to these research, the observation was shown that these new concept of ionizer is able to minimize the leakage radiation level and to control the positive and negative ion duty ratio while ionization.