A Work-Demand Analysis Compatible with Preemption-Aware Scheduling for Power-Aware Real-Time Tasks

Directory of Open Access Journals (Sweden)

Da-Ren Chen

2013-01-01

Full Text Available Due to the importance of slack time utilization for power-aware scheduling algorithms,we propose a work-demand analysis method called parareclamation algorithm (PRA to increase slack time utilization of the existing real-time DVS algorithms. PRA is an online scheduling for power-aware real-time tasks under rate-monotonic (RM policy. It can be implemented and fully compatible with preemption-aware or transition-aware scheduling algorithms without increasing their computational complexities. The key technique of the heuristics method doubles the analytical interval and turns the deferrable workload out the potential slack time. Theoretical proofs show that PRA guarantees the task deadlines in a feasible RM schedule and takes linear time and space complexities. Experimental results indicate that the proposed method combining the preemption-aware methods seamlessly reduces the energy consumption by 14% on average over their original algorithms.

Continuity-Aware Scheduling Algorithm for Scalable Video Streaming

Directory of Open Access Journals (Sweden)

Atinat Palawan

2016-05-01

Full Text Available The consumer demand for retrieving and delivering visual content through consumer electronic devices has increased rapidly in recent years. The quality of video in packet networks is susceptible to certain traffic characteristics: average bandwidth availability, loss, delay and delay variation (jitter. This paper presents a scheduling algorithm that modifies the stream of scalable video to combat jitter. The algorithm provides unequal look-ahead by safeguarding the base layer (without the need for overhead of the scalable video. The results of the experiments show that our scheduling algorithm reduces the number of frames with a violated deadline and significantly improves the continuity of the video stream without compromising the average Y Peek Signal-to-Noise Ratio (PSNR.

Applying dynamic priority scheduling scheme to static systems of pinwheel task model in power-aware scheduling.

Science.gov (United States)

Seol, Ye-In; Kim, Young-Kuk

2014-01-01

Power-aware scheduling reduces CPU energy consumption in hard real-time systems through dynamic voltage scaling (DVS). In this paper, we deal with pinwheel task model which is known as static and predictable task model and could be applied to various embedded or ubiquitous systems. In pinwheel task model, each task's priority is static and its execution sequence could be predetermined. There have been many static approaches to power-aware scheduling in pinwheel task model. But, in this paper, we will show that the dynamic priority scheduling results in power-aware scheduling could be applied to pinwheel task model. This method is more effective than adopting the previous static priority scheduling methods in saving energy consumption and, for the system being still static, it is more tractable and applicable to small sized embedded or ubiquitous computing. Also, we introduce a novel power-aware scheduling algorithm which exploits all slacks under preemptive earliest-deadline first scheduling which is optimal in uniprocessor system. The dynamic priority method presented in this paper could be applied directly to static systems of pinwheel task model. The simulation results show that the proposed algorithm with the algorithmic complexity of O(n) reduces the energy consumption by 10-80% over the existing algorithms.

Quality-aware scheduling for key-value data stores

CERN Document Server

Xu, Chen

2015-01-01

This book comprehensively illustrates quality-ware scheduling in key-value stores. In addition, it provides scheduling strategies and a prototype framework of quality-aware scheduler as well as a demonstration of online applications. The book offers a rich blend of theory and practice which is suitable for students, researchers and practitioners interested in distributed systems, NoSQL key-value stores and scheduling.

Schedule-Aware Workflow Management Systems

Science.gov (United States)

Mans, Ronny S.; Russell, Nick C.; van der Aalst, Wil M. P.; Moleman, Arnold J.; Bakker, Piet J. M.

Contemporary workflow management systems offer work-items to users through specific work-lists. Users select the work-items they will perform without having a specific schedule in mind. However, in many environments work needs to be scheduled and performed at particular times. For example, in hospitals many work-items are linked to appointments, e.g., a doctor cannot perform surgery without reserving an operating theater and making sure that the patient is present. One of the problems when applying workflow technology in such domains is the lack of calendar-based scheduling support. In this paper, we present an approach that supports the seamless integration of unscheduled (flow) and scheduled (schedule) tasks. Using CPN Tools we have developed a specification and simulation model for schedule-aware workflow management systems. Based on this a system has been realized that uses YAWL, Microsoft Exchange Server 2007, Outlook, and a dedicated scheduling service. The approach is illustrated using a real-life case study at the AMC hospital in the Netherlands. In addition, we elaborate on the experiences obtained when developing and implementing a system of this scale using formal techniques.

An Interference-Aware Traffic-Priority-Based Link Scheduling Algorithm for Interference Mitigation in Multiple Wireless Body Area Networks

Directory of Open Access Journals (Sweden)

Thien T. T. Le

2016-12-01

Full Text Available Currently, wireless body area networks (WBANs are effectively used for health monitoring services. However, in cases where WBANs are densely deployed, interference among WBANs can cause serious degradation of network performance and reliability. Inter-WBAN interference can be reduced by scheduling the communication links of interfering WBANs. In this paper, we propose an interference-aware traffic-priority-based link scheduling (ITLS algorithm to overcome inter-WBAN interference in densely deployed WBANs. First, we model a network with multiple WBANs as an interference graph where node-level interference and traffic priority are taken into account. Second, we formulate link scheduling for multiple WBANs as an optimization model where the objective is to maximize the throughput of the entire network while ensuring the traffic priority of sensor nodes. Finally, we propose the ITLS algorithm for multiple WBANs on the basis of the optimization model. High spatial reuse is also achieved in the proposed ITLS algorithm. The proposed ITLS achieves high spatial reuse while considering traffic priority, packet length, and the number of interfered sensor nodes. Our simulation results show that the proposed ITLS significantly increases spatial reuse and network throughput with lower delay by mitigating inter-WBAN interference.

NUMA-Aware Thread Scheduling for Big Data Transfers over Terabits Network Infrastructure

Directory of Open Access Journals (Sweden)

Taeuk Kim

2018-01-01

Full Text Available The evergrowing trend of big data has led scientists to share and transfer the simulation and analytical data across the geodistributed research and computing facilities. However, the existing data transfer frameworks used for data sharing lack the capability to adopt the attributes of the underlying parallel file systems (PFS. LADS (Layout-Aware Data Scheduling is an end-to-end data transfer tool optimized for terabit network using a layout-aware data scheduling via PFS. However, it does not consider the NUMA (Nonuniform Memory Access architecture. In this paper, we propose a NUMA-aware thread and resource scheduling for optimized data transfer in terabit network. First, we propose distributed RMA buffers to reduce memory controller contention in CPU sockets and then schedule the threads based on CPU socket and NUMA nodes inside CPU socket to reduce memory access latency. We design and implement the proposed resource and thread scheduling in the existing LADS framework. Experimental results showed from 21.7% to 44% improvement with memory-level optimizations in the LADS framework as compared to the baseline without any optimization.

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH.

Science.gov (United States)

Oh, Sukho; Hwang, DongYeop; Kim, Ki-Hyung; Kim, Kangseok

2018-04-16

Time Slotted Channel Hopping (TSCH) is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology.

Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH

Directory of Open Access Journals (Sweden)

Sukho Oh

2018-04-01

Full Text Available Time Slotted Channel Hopping (TSCH is widely used in the industrial wireless sensor networks due to its high reliability and energy efficiency. Various timeslot and channel scheduling schemes have been proposed for achieving high reliability and energy efficiency for TSCH networks. Recently proposed autonomous scheduling schemes provide flexible timeslot scheduling based on the routing topology, but do not take into account the network traffic and packet forwarding delays. In this paper, we propose an autonomous scheduling scheme for convergecast in TSCH networks with RPL as a routing protocol, named Escalator. Escalator generates a consecutive timeslot schedule along the packet forwarding path to minimize the packet transmission delay. The schedule is generated autonomously by utilizing only the local routing topology information without any additional signaling with other nodes. The generated schedule is guaranteed to be conflict-free, in that all nodes in the network could transmit packets to the sink in every slotframe cycle. We implement Escalator and evaluate its performance with existing autonomous scheduling schemes through a testbed and simulation. Experimental results show that the proposed Escalator has lower end-to-end delay and higher packet delivery ratio compared to the existing schemes regardless of the network topology.

MPEG-compliant joint source/channel coding using discrete cosine transform and substream scheduling for visual communication over packet networks

Science.gov (United States)

Kim, Seong-Whan; Suthaharan, Shan; Lee, Heung-Kyu; Rao, K. R.

2001-01-01

Quality of Service (QoS)-guarantee in real-time communication for multimedia applications is significantly important. An architectural framework for multimedia networks based on substreams or flows is effectively exploited for combining source and channel coding for multimedia data. But the existing frame by frame approach which includes Moving Pictures Expert Group (MPEG) cannot be neglected because it is a standard. In this paper, first, we designed an MPEG transcoder which converts an MPEG coded stream into variable rate packet sequences to be used for our joint source/channel coding (JSCC) scheme. Second, we designed a classification scheme to partition the packet stream into multiple substreams which have their own QoS requirements. Finally, we designed a management (reservation and scheduling) scheme for substreams to support better perceptual video quality such as the bound of end-to-end jitter. We have shown that our JSCC scheme is better than two other two popular techniques by simulation and real video experiments on the TCP/IP environment.

Wake-on-a-Schedule: Energy-aware Communication in Wi-Fi Networks

Directory of Open Access Journals (Sweden)

PERKOVIC, T.

2014-02-01

Full Text Available Excessive energy consumption of mobile device Wi-Fi (IEEE 802.11x interface is limiting its operational time on batteries, and impacts total energy consumption of electronic devices. In recent years research community has invested great effort in better efficiency of energy consumption. However, there is still a space for improvement. Wi-Fi devices connected to the single AP (Access Point compete for the medium during data exchange. However, due to the performance anomaly in 802.11 networks, a low data rate device will force all other devices connected to the AP to communicate at low rate, which will increase the total energy consumption of these devices. Wake-on-a-Schedule algorithm is proposed reducing the energy consumption of devices placed in the area with the weaker signal by scheduling the data packets for each client on the server side which will not allow clients to compete for the Wi-Fi medium. Through extensive measurements we show that our algorithm can save up to 60% of energy consumption on the client side.

Locality-Aware Task Scheduling and Data Distribution for OpenMP Programs on NUMA Systems and Manycore Processors

Directory of Open Access Journals (Sweden)

Ananya Muddukrishna

2015-01-01

Full Text Available Performance degradation due to nonuniform data access latencies has worsened on NUMA systems and can now be felt on-chip in manycore processors. Distributing data across NUMA nodes and manycore processor caches is necessary to reduce the impact of nonuniform latencies. However, techniques for distributing data are error-prone and fragile and require low-level architectural knowledge. Existing task scheduling policies favor quick load-balancing at the expense of locality and ignore NUMA node/manycore cache access latencies while scheduling. Locality-aware scheduling, in conjunction with or as a replacement for existing scheduling, is necessary to minimize NUMA effects and sustain performance. We present a data distribution and locality-aware scheduling technique for task-based OpenMP programs executing on NUMA systems and manycore processors. Our technique relieves the programmer from thinking of NUMA system/manycore processor architecture details by delegating data distribution to the runtime system and uses task data dependence information to guide the scheduling of OpenMP tasks to reduce data stall times. We demonstrate our technique on a four-socket AMD Opteron machine with eight NUMA nodes and on the TILEPro64 processor and identify that data distribution and locality-aware task scheduling improve performance up to 69% for scientific benchmarks compared to default policies and yet provide an architecture-oblivious approach for programmers.

Biological Diversity. Global Issues Education Packet.

Science.gov (United States)

Holm, Amy E.

Biological diversity, also commonly called genetic diversity, refers to the variety of organisms on Earth. Scientists are concerned that many species will become extinct because of extensive development in the tropical regions. This packet is designed to increase student's awareness about direct and indirect causes of extinction, endangered…

Scalable and Media Aware Adaptive Video Streaming over Wireless Networks

Directory of Open Access Journals (Sweden)

Béatrice Pesquet-Popescu

2008-07-01

Full Text Available This paper proposes an advanced video streaming system based on scalable video coding in order to optimize resource utilization in wireless networks with retransmission mechanisms at radio protocol level. The key component of this system is a packet scheduling algorithm which operates on the different substreams of a main scalable video stream and which is implemented in a so-called media aware network element. The concerned type of transport channel is a dedicated channel subject to parameters (bitrate, loss rate variations on the long run. Moreover, we propose a combined scalability approach in which common temporal and SNR scalability features can be used jointly with a partitioning of the image into regions of interest. Simulation results show that our approach provides substantial quality gain compared to classical packet transmission methods and they demonstrate how ROI coding combined with SNR scalability allows to improve again the visual quality.

Context-aware distributed cloud computing using CloudScheduler

Science.gov (United States)

Seuster, R.; Leavett-Brown, CR; Casteels, K.; Driemel, C.; Paterson, M.; Ring, D.; Sobie, RJ; Taylor, RP; Weldon, J.

2017-10-01

The distributed cloud using the CloudScheduler VM provisioning service is one of the longest running systems for HEP workloads. It has run millions of jobs for ATLAS and Belle II over the past few years using private and commercial clouds around the world. Our goal is to scale the distributed cloud to the 10,000-core level, with the ability to run any type of application (low I/O, high I/O and high memory) on any cloud. To achieve this goal, we have been implementing changes that utilize context-aware computing designs that are currently employed in the mobile communication industry. Context-awareness makes use of real-time and archived data to respond to user or system requirements. In our distributed cloud, we have many opportunistic clouds with no local HEP services, software or storage repositories. A context-aware design significantly improves the reliability and performance of our system by locating the nearest location of the required services. We describe how we are collecting and managing contextual information from our workload management systems, the clouds, the virtual machines and our services. This information is used not only to monitor the system but also to carry out automated corrective actions. We are incrementally adding new alerting and response services to our distributed cloud. This will enable us to scale the number of clouds and virtual machines. Further, a context-aware design will enable us to run analysis or high I/O application on opportunistic clouds. We envisage an open-source HTTP data federation (for example, the DynaFed system at CERN) as a service that would provide us access to existing storage elements used by the HEP experiments.

Energy-aware scheduling of surveillance in wireless multimedia sensor networks.

Science.gov (United States)

Wang, Xue; Wang, Sheng; Ma, Junjie; Sun, Xinyao

2010-01-01

Wireless sensor networks involve a large number of sensor nodes with limited energy supply, which impacts the behavior of their application. In wireless multimedia sensor networks, sensor nodes are equipped with audio and visual information collection modules. Multimedia contents are ubiquitously retrieved in surveillance applications. To solve the energy problems during target surveillance with wireless multimedia sensor networks, an energy-aware sensor scheduling method is proposed in this paper. Sensor nodes which acquire acoustic signals are deployed randomly in the sensing fields. Target localization is based on the signal energy feature provided by multiple sensor nodes, employing particle swarm optimization (PSO). During the target surveillance procedure, sensor nodes are adaptively grouped in a totally distributed manner. Specially, the target motion information is extracted by a forecasting algorithm, which is based on the hidden Markov model (HMM). The forecasting results are utilized to awaken sensor node in the vicinity of future target position. According to the two properties, signal energy feature and residual energy, the sensor nodes decide whether to participate in target detection separately with a fuzzy control approach. Meanwhile, the local routing scheme of data transmission towards the observer is discussed. Experimental results demonstrate the efficiency of energy-aware scheduling of surveillance in wireless multimedia sensor network, where significant energy saving is achieved by the sensor awakening approach and data transmission paths are calculated with low computational complexity.

Analysis of Sleep-Mode Downlink Scheduling Operations in EPON Systems

OpenAIRE

Yan, Ying; Dittmann, Lars

2011-01-01

Energy management strategy has been considered as an important component in the future Ethernet Passive Optical Networks (EPONs). In this paper, a sleeping mode operation is studied, and a downlink packet scheduling scheme is analyzed to preserve energy consumption and maintain the required QoS. This paper proposes a novel sleep-mode downlink packet scheduling scheme in order to enhance the sleep control function. Simulation results confirm that the proposed approach offers effective power ma...

A Low-Jitter Wireless Transmission Based on Buffer Management in Coding-Aware Routing

Directory of Open Access Journals (Sweden)

Cunbo Lu

2015-08-01

Full Text Available It is significant to reduce packet jitter for real-time applications in a wireless network. Existing coding-aware routing algorithms use the opportunistic network coding (ONC scheme in a packet coding algorithm. The ONC scheme never delays packets to wait for the arrival of a future coding opportunity. The loss of some potential coding opportunities may degrade the contribution of network coding to jitter performance. In addition, most of the existing coding-aware routing algorithms assume that all flows participating in the network have equal rate. This is unrealistic, since multi-rate environments often appear. To overcome the above problem and expand coding-aware routing to multi-rate scenarios, from the view of data transmission, we present a low-jitter wireless transmission algorithm based on buffer management (BLJCAR, which decides packets in coding node according to the queue-length based threshold policy instead of the regular ONC policy as used in existing coding-aware routing algorithms. BLJCAR is a unified framework to merge the single rate case and multiple rate case. Simulations results show that the BLJCAR algorithm embedded in coding-aware routing outperforms the traditional ONC policy in terms of jitter, packet delivery delay, packet loss ratio and network throughput in network congestion in any traffic rates.

Exploring a QoS Driven Scheduling Approach for Peer-to-Peer Live Streaming Systems with Network Coding

Science.gov (United States)

Cui, Laizhong; Lu, Nan; Chen, Fu

2014-01-01

Most large-scale peer-to-peer (P2P) live streaming systems use mesh to organize peers and leverage pull scheduling to transmit packets for providing robustness in dynamic environment. The pull scheduling brings large packet delay. Network coding makes the push scheduling feasible in mesh P2P live streaming and improves the efficiency. However, it may also introduce some extra delays and coding computational overhead. To improve the packet delay, streaming quality, and coding overhead, in this paper are as follows. we propose a QoS driven push scheduling approach. The main contributions of this paper are: (i) We introduce a new network coding method to increase the content diversity and reduce the complexity of scheduling; (ii) we formulate the push scheduling as an optimization problem and transform it to a min-cost flow problem for solving it in polynomial time; (iii) we propose a push scheduling algorithm to reduce the coding overhead and do extensive experiments to validate the effectiveness of our approach. Compared with previous approaches, the simulation results demonstrate that packet delay, continuity index, and coding ratio of our system can be significantly improved, especially in dynamic environments. PMID:25114968

Packets distribution in a tree-based topology wireless sensor networks

CSIR Research Space (South Africa)

Akpakwu, GA

2016-07-01

Full Text Available The concept of data distribution within cluster of sensor nodes to the source sink has resulted to intense research in Wireless Sensor Networks (WSNs). In this paper, in order to determine the scheduling length of packet distribution, a tree...

Parallel-aware, dedicated job co-scheduling within/across symmetric multiprocessing nodes

Science.gov (United States)

Jones, Terry R.; Watson, Pythagoras C.; Tuel, William; Brenner, Larry; ,Caffrey, Patrick; Fier, Jeffrey

2010-10-05

In a parallel computing environment comprising a network of SMP nodes each having at least one processor, a parallel-aware co-scheduling method and system for improving the performance and scalability of a dedicated parallel job having synchronizing collective operations. The method and system uses a global co-scheduler and an operating system kernel dispatcher adapted to coordinate interfering system and daemon activities on a node and across nodes to promote intra-node and inter-node overlap of said interfering system and daemon activities as well as intra-node and inter-node overlap of said synchronizing collective operations. In this manner, the impact of random short-lived interruptions, such as timer-decrement processing and periodic daemon activity, on synchronizing collective operations is minimized on large processor-count SPMD bulk-synchronous programming styles.

Analysis of Sleep-Mode Downlink Scheduling Operations in EPON Systems

DEFF Research Database (Denmark)

Yan, Ying; Dittmann, Lars

2011-01-01

Energy management strategy has been considered as an important component in the future Ethernet Passive Optical Networks (EPONs). In this paper, a sleeping mode operation is studied, and a downlink packet scheduling scheme is analyzed to preserve energy consumption and maintain the required Qo......S. This paper proposes a novel sleep-mode downlink packet scheduling scheme in order to enhance the sleep control function. Simulation results confirm that the proposed approach offers effective power management on the basis of the traffic conditions. The trade-off between network performances and the power...

Analisis Performansi Algoritma Penjadwalan Log Rule dan Frame Level Schedule Skenario Multicell Pada Layer Mac LTE

Directory of Open Access Journals (Sweden)

Ridwan

2016-03-01

Full Text Available Mobile telecommunications technology gradually evolved to support better services such as voice, data, and video to users of telecommunications services. LTE (Long Term Evolution is a network based on Internet Protocol (IP standardized by 3rd Generation Partnership Project (3GPP. To support it, LTE requires a mechanism that can support. One of them by applying methods of scheduling packets in each service. Scheduling is a different treatment to packets that come in accordance with the priorities of the scheduling algorithm. In this research, to analyze the performance of LTE with paramater delay, packet loss ratio, throughput and fairness index uses a scheduling algorithms Frame Level Schedule (FLS and Log Rule on LTE-Simulator with scenarios using Voip traffic, Video and Best Effort (BE. The results is scheduling algorithms FLS is better than log rule in term of throughput values, while of scheduling algorithms log rule is better than FLS in terms of delay based on the number and speed of the users. This indicates that both scheduling algorithms suitable for use in LTE networks within conditions of traffic real time services, but not for non real time services such as BE.

Avoiding Biased-Feeding in the Scheduling of Collaborative Multipath TCP.

Directory of Open Access Journals (Sweden)

Meng-Hsun Tsai

Full Text Available Smartphones have become the major communication and portable computing devices that access the Internet through Wi-Fi or mobile networks. Unfortunately, users without a mobile data subscription can only access the Internet at limited locations, such as hotspots. In this paper, we propose a collaborative bandwidth sharing protocol (CBSP built on top of MultiPath TCP (MPTCP. CBSP enables users to buy bandwidth on demand from neighbors (called Helpers and uses virtual interfaces to bind the subflows of MPTCP to avoid modifying the implementation of MPTCP. However, although MPTCP provides the required multi-homing functionality for bandwidth sharing, the current packet scheduling in collaborative MPTCP (e.g., Co-MPTCP leads to the so-called biased-feeding problem. In this problem, the fastest link might always be selected to send packets whenever it has available cwnd, which results in other links not being fully utilized. In this work, we set out to design an algorithm, called Scheduled Window-based Transmission Control (SWTC, to improve the performance of packet scheduling in MPTCP, and we perform extensive simulations to evaluate its performance.

Avoiding Biased-Feeding in the Scheduling of Collaborative Multipath TCP.

Science.gov (United States)

Tsai, Meng-Hsun; Chou, Chien-Ming; Lan, Kun-Chan

2016-01-01

Smartphones have become the major communication and portable computing devices that access the Internet through Wi-Fi or mobile networks. Unfortunately, users without a mobile data subscription can only access the Internet at limited locations, such as hotspots. In this paper, we propose a collaborative bandwidth sharing protocol (CBSP) built on top of MultiPath TCP (MPTCP). CBSP enables users to buy bandwidth on demand from neighbors (called Helpers) and uses virtual interfaces to bind the subflows of MPTCP to avoid modifying the implementation of MPTCP. However, although MPTCP provides the required multi-homing functionality for bandwidth sharing, the current packet scheduling in collaborative MPTCP (e.g., Co-MPTCP) leads to the so-called biased-feeding problem. In this problem, the fastest link might always be selected to send packets whenever it has available cwnd, which results in other links not being fully utilized. In this work, we set out to design an algorithm, called Scheduled Window-based Transmission Control (SWTC), to improve the performance of packet scheduling in MPTCP, and we perform extensive simulations to evaluate its performance.

An Efficient Downlink Scheduling Strategy Using Normal Graphs for Multiuser MIMO Wireless Systems

Science.gov (United States)

Chen, Jung-Chieh; Wu, Cheng-Hsuan; Lee, Yao-Nan; Wen, Chao-Kai

Inspired by the success of the low-density parity-check (LDPC) codes in the field of error-control coding, in this paper we propose transforming the downlink multiuser multiple-input multiple-output scheduling problem into an LDPC-like problem using the normal graph. Based on the normal graph framework, soft information, which indicates the probability that each user will be scheduled to transmit packets at the access point through a specified angle-frequency sub-channel, is exchanged among the local processors to iteratively optimize the multiuser transmission schedule. Computer simulations show that the proposed algorithm can efficiently schedule simultaneous multiuser transmission which then increases the overall channel utilization and reduces the average packet delay.

Green partial packet recovery in wireless sensor networks

KAUST Repository

Daghistani, Anas

2015-08-18

Partial packet recovery is well known for increasing network throughput and reducing frame retransmissions. However, partial packet recovery methods in the literature are not energy-aware and hence they are not suitable for the battery powered wireless sensor motes. We propose Green-Frag, a novel adaptive partial packet recovery mechanism that is energy friendly. It can help prolonging the battery life of wireless sensor motes that are usually resource constrained. It dynamically partitions the frame into smaller blocks to avoid dropping the whole frame due to a single bit error. Also, Green-Frag is able to tolerate high interference and save energy by varying the transmit power based on channel quality and interference pattern. We experimentally evaluate the energy efficiency as well as goodput and delay of Green-Frag using our TelosB sensor mote testbed. We find that Green-Frag reduces energy consumption by 33% on average compared to the state of the art partial packet recovery scheme in the literature in the presence of Wi-Fi interference. In the worst case, this reduction in energy consumption comes at the cost of 10% reduction in goodput. Finally, Green-Frag reduces the latency by 22% on average compared to other static frame fragmentation schemes.

Channel access delay and buffer distribution of two-user opportunistic scheduling schemes in wireless networks

KAUST Repository

Hossain, Md Jahangir

2010-07-01

In our earlier works, we proposed rate adaptive hierarchical modulation-assisted two-best user opportunistic scheduling (TBS) and hybrid two-user scheduling (HTS) schemes. The proposed schemes are innovative in the sense that they include a second user in the transmission opportunistically using hierarchical modulations. As such the frequency of information access of the users increases without any degradation of the system spectral efficiency (SSE) compared to the classical opportunistic scheduling scheme. In this paper, we analyze channel access delay of an incoming packet at the base station (BS) buffer when our proposed TBS and HTS schemes are employed at the BS. Specifically, using a queuing analytic model we derive channel access delay as well as buffer distribution of the packets that wait at BS buffer for down-link (DL) transmission. We compare performance of the TBS and HTS schemes with that of the classical single user opportunistic schemes namely, absolute carrier-to-noise ratio (CNR)-based single user scheduling (ASS) and normalized CNR-based single user scheduling (NSS). For an independent and identically distributed (i.i.d.) fading environment, our proposed scheme can improve packet\\'s access delay performance compared to the ASS. Selected numerical results in an independent but non-identically distributed (i.n.d.) fading environment show that our proposed HTS achieves overall good channel access delay performance. © 2010 IEEE.

Highly Efficient Multi Channel Packet Forwarding with Round Robin Intermittent Periodic Transmit for Multihop Wireless Backhaul Networks

Science.gov (United States)

Furukawa, Hiroshi

2017-01-01

Round Robin based Intermittent Periodic Transmit (RR-IPT) has been proposed which achieves highly efficient multi-hop relays in multi-hop wireless backhaul networks (MWBN) where relay nodes are 2-dimensionally deployed. This paper newly investigates multi-channel packet scheduling and forwarding scheme for RR-IPT. Downlink traffic is forwarded by RR-IPT via one of the channels, while uplink traffic and part of downlink are accommodated in the other channel. By comparing IPT and carrier sense multiple access with collision avoidance (CSMA/CA) for uplink/downlink packet forwarding channel, IPT is more effective in reducing packet loss rate whereas CSMA/CA is better in terms of system throughput and packet delay improvement. PMID:29137164

Neighboring and Connectivity-Aware Routing in VANETs

Directory of Open Access Journals (Sweden)

Huma Ghafoor

2014-01-01

Full Text Available A novel position-based routing protocol anchor-based connectivity-aware routing (ACAR for vehicular ad hoc networks (VANETs is proposed in this paper to ensure connectivity of routes with more successfully delivered packets. Both buses and cars are considered as vehicular nodes running in both clockwise and anticlockwise directions in a city scenario. Both directions are taken into account for faster communication. ACAR is a hybrid protocol, using both the greedy forwarding approach and the store-carry-and-forward approach to minimize the packet drop rate on the basis of certain assumptions. Our solution to situations that occur when the network is sparse and when any (source or intermediate node has left its initial position makes this protocol different from those existing in the literature. We consider only vehicle-to-vehicle (V2V communication in which both the source and destination nodes are moving vehicles. Also, no road-side units are considered. Finally, we compare our protocol with A-STAR (a plausible connectivity-aware routing protocol for city environments, and simulation results in NS-2 show improvement in the number of packets delivered to the destination using fewer hops. Also, we show that ACAR has more successfully-delivered long-distance packets with reasonable packet delay than A-STAR.

Error Detection and Error Classification: Failure Awareness in Data Transfer Scheduling

Energy Technology Data Exchange (ETDEWEB)

Louisiana State University; Balman, Mehmet; Kosar, Tevfik

2010-10-27

Data transfer in distributed environment is prone to frequent failures resulting from back-end system level problems, like connectivity failure which is technically untraceable by users. Error messages are not logged efficiently, and sometimes are not relevant/useful from users point-of-view. Our study explores the possibility of an efficient error detection and reporting system for such environments. Prior knowledge about the environment and awareness of the actual reason behind a failure would enable higher level planners to make better and accurate decisions. It is necessary to have well defined error detection and error reporting methods to increase the usability and serviceability of existing data transfer protocols and data management systems. We investigate the applicability of early error detection and error classification techniques and propose an error reporting framework and a failure-aware data transfer life cycle to improve arrangement of data transfer operations and to enhance decision making of data transfer schedulers.

Context-Aware Elevator Scheduling

OpenAIRE

Strang, Thomas; Bauer, Christian

2007-01-01

Research on context-aware systems is usually user-centric and thus focussed on the context of a specific user to serve his or her needs in an optimized way. In this paper, we want to apply core concepts developed in research on context-awareness in a system-centric way, namely to elevator systems. We show with three different examples that the performance of an elevator system can be significantly improved if the elevator control has access to contextual knowledge. The first example demons...

Extensible packet processing architecture

Science.gov (United States)

Robertson, Perry J.; Hamlet, Jason R.; Pierson, Lyndon G.; Olsberg, Ronald R.; Chun, Guy D.

2013-08-20

A technique for distributed packet processing includes sequentially passing packets associated with packet flows between a plurality of processing engines along a flow through data bus linking the plurality of processing engines in series. At least one packet within a given packet flow is marked by a given processing engine to signify by the given processing engine to the other processing engines that the given processing engine has claimed the given packet flow for processing. A processing function is applied to each of the packet flows within the processing engines and the processed packets are output on a time-shared, arbitered data bus coupled to the plurality of processing engines.

E-Token Energy-Aware Proportionate Sharing Scheduling Algorithm for Multiprocessor Systems

Directory of Open Access Journals (Sweden)

Pasupuleti Ramesh

2017-01-01

Full Text Available WSN plays vital role from small range healthcare surveillance systems to largescale environmental monitoring. Its design for energy constrained applications is a challenging issue. Sensors in WSNs are projected to run separately for longer periods. It is of excessive cost to substitute exhausted batteries which is not even possible in antagonistic situations. Multiprocessors are used in WSNs for high performance scientific computing, where each processor is assigned the same or different workload. When the computational demands of the system increase then the energy efficient approaches play an important role to increase system lifetime. Energy efficiency is commonly carried out by using proportionate fair scheduler. This introduces abnormal overloading effect. In order to overcome the existing problems E-token Energy-Aware Proportionate Sharing (EEAPS scheduling is proposed here. The power consumption for each thread/task is calculated and the tasks are allotted to the multiple processors through the auctioning mechanism. The algorithm is simulated by using the real-time simulator (RTSIM and the results are tested.

On QoS guarantee in MPLS network with software deadline awareness

Science.gov (United States)

Gao, Yu; Jin, Yaohui; Cheng, Hong; Yu, Yingdi; Sun, Weiqiang; Guo, Wei; Hu, Weisheng

2007-11-01

With the increasing number of internet users, more and more real-time services are added into the network, such as IPTV, online-video, Voice over IP, etc. As we know, throughput is a highly important performance criterion for scheduling algorithms of networks. Besides throughput, these growing real-time services are very sensitive to delay variance termed as jitter. Therefore, high performance scheduling algorithm should achieve good performance in terms of throughput, delay, jitter and fairness together. Scheduling algorithm with deadline-awareness employed in packet switching plays a key role in QoS guarantees. Although traditional hard-deadline can provide guarantee on in-node delay-deadline criteria, the end-to-end delay-deadline criteria cannot be guaranteed due to the characteristic of hard-deadline, while the delay-deadline guaranteed throughput is low. Thus, soft-deadline scheduling algorithm has been proposed. In this paper, we investigate and compare the classical hard-deadline and soft-deadline switching algorithm. A new scheme "Bonus System" is proposed in order to realize the idea of soft-deadline switching algorithm. Bonus System based on soft-deadline is compared with classical Early-Deadline First scheme based on hard-deadline, which shows that Bonus System has better performance in End-to-End deadline guarantee.

Exact analysis of Packet Reversed Packet Combining Scheme and Modified Packet Combining Scheme; and a combined scheme

International Nuclear Information System (INIS)

Bhunia, C.T.

2007-07-01

Packet combining scheme is a well defined simple error correction scheme for the detection and correction of errors at the receiver. Although it permits a higher throughput when compared to other basic ARQ protocols, packet combining (PC) scheme fails to correct errors when errors occur in the same bit locations of copies. In a previous work, a scheme known as Packet Reversed Packet Combining (PRPC) Scheme that will correct errors which occur at the same bit location of erroneous copies, was studied however PRPC does not handle a situation where a packet has more than 1 error bit. The Modified Packet Combining (MPC) Scheme that can correct double or higher bit errors was studied elsewhere. Both PRPC and MPC schemes are believed to offer higher throughput in previous studies, however neither adequate investigation nor exact analysis was done to substantiate this claim of higher throughput. In this work, an exact analysis of both PRPC and MPC is carried out and the results reported. A combined protocol (PRPC and MPC) is proposed and the analysis shows that it is capable of offering even higher throughput and better error correction capability at high bit error rate (BER) and larger packet size. (author)

Energy-Aware Real-Time Task Scheduling for Heterogeneous Multiprocessors with Particle Swarm Optimization Algorithm

Directory of Open Access Journals (Sweden)

Weizhe Zhang

2014-01-01

Full Text Available Energy consumption in computer systems has become a more and more important issue. High energy consumption has already damaged the environment to some extent, especially in heterogeneous multiprocessors. In this paper, we first formulate and describe the energy-aware real-time task scheduling problem in heterogeneous multiprocessors. Then we propose a particle swarm optimization (PSO based algorithm, which can successfully reduce the energy cost and the time for searching feasible solutions. Experimental results show that the PSO-based energy-aware metaheuristic uses 40%–50% less energy than the GA-based and SFLA-based algorithms and spends 10% less time than the SFLA-based algorithm in finding the solutions. Besides, it can also find 19% more feasible solutions than the SFLA-based algorithm.

Packet reversed packet combining scheme

International Nuclear Information System (INIS)

Bhunia, C.T.

2006-07-01

The packet combining scheme is a well defined simple error correction scheme with erroneous copies at the receiver. It offers higher throughput combined with ARQ protocols in networks than that of basic ARQ protocols. But packet combining scheme fails to correct errors when the errors occur in the same bit locations of two erroneous copies. In the present work, we propose a scheme that will correct error if the errors occur at the same bit location of the erroneous copies. The proposed scheme when combined with ARQ protocol will offer higher throughput. (author)

Smokers' recall of Australian graphic cigarette packet warnings & awareness of associated health effects, 2005-2008

Directory of Open Access Journals (Sweden)

Quester Pascale G

2011-04-01

Full Text Available Abstract Background In 2006, Australia introduced graphic cigarette packet warnings. The new warnings include one of 14 pictures, many depicting tobacco-related pathology. The warnings were introduced in two sets; Set A in March and Set B from November. This study explores their impact on smokers' beliefs about smoking related illnesses. This study also examines the varying impact of different warnings, to see whether warnings with visceral images have greater impact on smokers' beliefs than other images. Methods Representative samples of South Australian smokers were interviewed in four independent cross-sectional omnibus surveys; in 2005 (n = 504, 2006 (n = 525, 2007 (n = 414 and 2008 (n = 464. Results Unprompted recall of new graphic cigarette warnings was high in the months following their introduction, demonstrating that smokers' had been exposed to them. Smokers also demonstrated an increase in awareness about smoking-related diseases specific to the warning messages. Warnings that conveyed new information and had emotive images demonstrated greater impact on recall and smokers' beliefs than more familiar information and less emotive images. Conclusions Overall graphic pack warnings have had the intended impact on smokers. Some have greater impact than others. The implications for policy makers in countries introducing similar warnings are that fresh messaging and visceral images have the greatest impact.

Packet telemetry and packet telecommand - The new generation of spacecraft data handling techniques

Science.gov (United States)

Hooke, A. J.

1983-01-01

Because of rising costs and reduced reliability of spacecraft and ground network hardware and software customization, standardization Packet Telemetry and Packet Telecommand concepts are emerging as viable alternatives. Autonomous packets of data, within each concept, which are created within ground and space application processes through the use of formatting techniques, are switched end-to-end through the space data network to their destination application processes through the use of standard transfer protocols. This process may result in facilitating a high degree of automation and interoperability because of completely mission-independent-designed intermediate data networks. The adoption of an international guideline for future space telemetry formatting of the Packet Telemetry concept, and the advancement of the NASA-ESA Working Group's Packet Telecommand concept to a level of maturity parallel to the of Packet Telemetry are the goals of the Consultative Committee for Space Data Systems. Both the Packet Telemetry and Packet Telecommand concepts are reviewed.

Survival of the Fittest: An Active Queue Management Technique for Noisy Packet Flows

Directory of Open Access Journals (Sweden)

Shirish S. Karande

2007-01-01

Full Text Available We present a novel active queue management (AQM technique to demonstrate the efficacy of practically harnessing the predictive utility of SSR indications for improved video communication. We consider a network within which corrupted packets are relayed over multiple hops, but a certain percentage of packets needs to be dropped at an intermediate node due to congestion. We propose an AQM technique, survival of the fittest (SOTF, to be employed at the relay node, within which we use packet state information, available from SSR indications and checksums, to drop packets with the highest corruption levels. On the basis of actual 802.11b measurements we show that such a side information (SI aware processing within the network can provide significant performance benefits over an SI-unaware scheme, random queue management (RQM, which is forced to randomly discard packets. With trace-based simulations, we show the utility of the proposed AQM technique in improving the error recovery performance of cross-layer FEC schemes. Finally, with the help of H.264-based video simulations these improvements are shown to translate into a significant improvement in video quality.

LTE uplink scheduling - flow level analysis

NARCIS (Netherlands)

Dimitrova, D.C.; van den Berg, J.L.; Heijenk, G.; Litjens, R.; Sacchi, Claudio; Bellalta, Boris; Vinel, Alexey; Schlegel, Christian; Granelli, Fabrizio; Zhang, Yan

Long Term Evolution (LTE) is a cellular technology foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which is in charge of allocating resources to active flows in both the frequency and

LTE uplink scheduling - Flow level analysis

NARCIS (Netherlands)

Dimitrova, D.C.; Berg, J.L. van den; Heijenk, G.; Litjens, R.

2011-01-01

Long Term Evolution (LTE) is a cellular technology foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which is in charge of allocating resources to active flows in both the frequency and

Revivals of Rydberg wave packets

International Nuclear Information System (INIS)

Bluhm, R.; Kostelecky, V.A.; Tudose, B.

1998-01-01

We examine the revival structure of Rydberg wave packets. These wave packets exhibit initial classical periodic motion followed by a sequence of collapse, fractional (or full) revivals, and fractional (or full) superrevivals. The effects of quantum defects on wave packets in alkali-metal atoms and a squeezed-state description of the initial wave packets are also considered. We then examine the revival structure of Rydberg wave packets in the presence of an external electric field - that is, the revival structure of Stark wave packets. These wave packets have energies that depend on two quantum numbers and exhibit new types of interference behavior

revivals of Rydberg wave packets

International Nuclear Information System (INIS)

Bluhm, R.; Kostelecky, V.A.; Tudose, B.

1998-01-01

We examine the revival structure of Rydberg wave packets. The effects of quantum defects on wave packets in alkali-metal atoms and a squeezed-state description of the initial wave packets are also described. We then examine the revival structure of Rydberg wave packets in the presence of an external electric field, i.e., the revival structure of Stark wave packets. These wave packets have energies that depend on two quantum numbers and exhibit new types of interference behaviour

An Adaptive Power Efficient Packet Scheduling Algorithm for Wimax Networks

OpenAIRE

R Murali Prasad; P. Satish Kumar

2010-01-01

Admission control schemes and scheduling algorithms are designed to offer QoS services in 802.16/802.16e networks and a number of studies have investigated these issues. But the channel condition and priority of traffic classes are very rarely considered in the existing scheduling algorithms. Although a number of energy saving mechanisms have been proposed for the IEEE 802.16e, to minimize the power consumption of IEEE 802.16e mobile stations with multiple real-time connections has not yet be...

Maritime wideband communication networks video transmission scheduling

CERN Document Server

Yang, Tingting

2014-01-01

This Springer Brief covers emerging maritime wideband communication networks and how they facilitate applications such as maritime distress, urgency, safety and general communications. It provides valuable insight on the data transmission scheduling and protocol design for the maritime wideband network. This brief begins with an introduction to maritime wideband communication networks including the architecture, framework, operations and a comprehensive survey on current developments. The second part of the brief presents the resource allocation and scheduling for video packet transmission wit

Data location-aware job scheduling in the grid. Application to the GridWay metascheduler

International Nuclear Information System (INIS)

Delgado Peris, Antonio; Hernandez, Jose; Huedo, Eduardo; Llorente, Ignacio M

2010-01-01

Grid infrastructures constitute nowadays the core of the computing facilities of the biggest LHC experiments. These experiments produce and manage petabytes of data per year and run thousands of computing jobs every day to process that data. It is the duty of metaschedulers to allocate the tasks to the most appropriate resources at the proper time. Our work reviews the policies that have been proposed for the scheduling of grid jobs in the context of very data-intensive applications. We indicate some of the practical problems that such models will face and describe what we consider essential characteristics of an optimum scheduling system: aim to minimise not only job turnaround time but also data replication, flexibility to support different virtual organisation requirements and capability to coordinate the tasks of data placement and job allocation while keeping their execution decoupled. These ideas have guided the development of an enhanced prototype for GridWay, a general purpose metascheduler, part of the Globus Toolkit and member of the EGEE's RESPECT program. Current GridWay's scheduling algorithm is unaware of data location. Our prototype makes it possible for job requests to set data needs not only as absolute requirements but also as functions for resource ranking. As our tests show, this makes it more flexible than currently used resource brokers to implement different data-aware scheduling algorithms.

Analysis of the packet formation process in packet-switched networks

Science.gov (United States)

Meditch, J. S.

Two new queueing system models for the packet formation process in packet-switched telecommunication networks are developed, and their applications in process stability, performance analysis, and optimization studies are illustrated. The first, an M/M/1 queueing system characterization of the process, is a highly aggregated model which is useful for preliminary studies. The second, a marked extension of an earlier M/G/1 model, permits one to investigate stability, performance characteristics, and design of the packet formation process in terms of the details of processor architecture, and hardware and software implementations with processor structure and as many parameters as desired as variables. The two new models together with the earlier M/G/1 characterization span the spectrum of modeling complexity for the packet formation process from basic to advanced.

"Ms. B changes doctors": using a comic and patient transition packet to engineer patient-oriented clinic handoffs (EPOCH).

Science.gov (United States)

Pincavage, Amber T; Lee, Wei Wei; Venable, Laura Ruth; Prochaska, Megan; Staisiunas, Daina D; Beiting, Kimberly J; Czerweic, M K; Oyler, Julie; Vinci, Lisa M; Arora, Vineet M

2015-02-01

Few patient-centered interventions exist to improve year-end residency clinic handoffs. Our purpose was to assess the impact of a patient-centered transition packet and comic on clinic handoff outcomes. The study was conducted at an academic medicine residency clinic. Participants were patients undergoing resident clinic handoff 2011-2013 PROGRAM DESCRIPTION: Two months before the 2012 handoff, patients received a "transition packet" incorporating patient-identified solutions (i.e., a new primary care provider (PCP) welcome letter with photo, certificate of recognition, and visit preparation tool). In 2013, a comic was incorporated to stress the importance of follow-up. Patients were interviewed by phone with response rates of 32 % in 2011, 43 % in 2012 and 36 % in 2013. Most patients who were interviewed were aware of the handoff post-packet (95 %). With the comic, more patients recalled receiving the packet (44 % 2012 vs. 64 % 2013, pcomic was associated with increased packet recall and improved follow-up rates.

Rotating quantum Gaussian packets

International Nuclear Information System (INIS)

Dodonov, V V

2015-01-01

We study two-dimensional quantum Gaussian packets with a fixed value of mean angular momentum. This value is the sum of two independent parts: the ‘external’ momentum related to the motion of the packet center and the ‘internal’ momentum due to quantum fluctuations. The packets minimizing the mean energy of an isotropic oscillator with the fixed mean angular momentum are found. They exist for ‘co-rotating’ external and internal motions, and they have nonzero correlation coefficients between coordinates and momenta, together with some (moderate) amount of quadrature squeezing. Variances of angular momentum and energy are calculated, too. Differences in the behavior of ‘co-rotating’ and ‘anti-rotating’ packets are shown. The time evolution of rotating Gaussian packets is analyzed, including the cases of a charge in a homogeneous magnetic field and a free particle. In the latter case, the effect of initial shrinking of packets with big enough coordinate-momentum correlation coefficients (followed by the well known expansion) is discovered. This happens due to a competition of ‘focusing’ and ‘de-focusing’ in the orthogonal directions. (paper)

Thermal-Aware Scheduling for Future Chip Multiprocessors

Directory of Open Access Journals (Sweden)

Pedro Trancoso

2007-04-01

Full Text Available The increased complexity and operating frequency in current single chip microprocessors is resulting in a decrease in the performance improvements. Consequently, major manufacturers offer chip multiprocessor (CMP architectures in order to keep up with the expected performance gains. This architecture is successfully being introduced in many markets including that of the embedded systems. Nevertheless, the integration of several cores onto the same chip may lead to increased heat dissipation and consequently additional costs for cooling, higher power consumption, decrease of the reliability, and thermal-induced performance loss, among others. In this paper, we analyze the evolution of the thermal issues for the future chip multiprocessor architectures and show that as the number of on-chip cores increases, the thermal-induced problems will worsen. In addition, we present several scenarios that result in excessive thermal stress to the CMP chip or significant performance loss. In order to minimize or even eliminate these problems, we propose thermal-aware scheduler (TAS algorithms. When assigning processes to cores, TAS takes their temperature and cooling ability into account in order to avoid thermal stress and at the same time improve the performance. Experimental results have shown that a TAS algorithm that considers also the temperatures of neighboring cores is able to significantly reduce the temperature-induced performance loss while at the same time, decrease the chip's temperature across many different operation and configuration scenarios.

Traffic Scheduling in WDM Passive Optical Network with Delay Guarantee

Institute of Scientific and Technical Information of China (English)

无

2005-01-01

WDM passive optical network becomes more favorable as the required bandwidth increases, but currently few media access control algorithms adapted to WDM access network. This paper presented a new scheduling algorithm for bandwidth sharing in WDM passive optical networks, which provides per-flow delay guarantee and supports variable-length packets scheduling. Through theoretical analysis and simulation, the end-to-end delay bound and throughput fairness of the algorithm was demonstrated.

Optical packet switched networks

DEFF Research Database (Denmark)

Hansen, Peter Bukhave

1999-01-01

Optical packet switched networks are investigated with emphasis on the performance of the packet switch blocks. Initially, the network context of the optical packet switched network is described showing that a packet network will provide transparency, flexibility and bridge the granularity gap...... in interferometric wavelength converters is investigated showing that a 10 Gbit/s 19 4x4 swich blocks can be cascaded at a BER of 10-14. An analytical traffic model enables the calculation of the traffice performance of a WDM packet network. Hereby the importance of WDM and wavelegth conversion in the switch blocks...... is established as a flexible means to reduce the optical buffer, e.g., the number of fibre delay lines for a 16x16 switch block is reduced from 23 to 6 by going from 2 to 8 wavelength channels pr. inlet. Additionally, a component count analysis is carried out to illustrate the trade-offs in the switch block...

Modified Aggressive Packet Combining Scheme

International Nuclear Information System (INIS)

Bhunia, C.T.

2010-06-01

In this letter, a few schemes are presented to improve the performance of aggressive packet combining scheme (APC). To combat error in computer/data communication networks, ARQ (Automatic Repeat Request) techniques are used. Several modifications to improve the performance of ARQ are suggested by recent research and are found in literature. The important modifications are majority packet combining scheme (MjPC proposed by Wicker), packet combining scheme (PC proposed by Chakraborty), modified packet combining scheme (MPC proposed by Bhunia), and packet reversed packet combining (PRPC proposed by Bhunia) scheme. These modifications are appropriate for improving throughput of conventional ARQ protocols. Leung proposed an idea of APC for error control in wireless networks with the basic objective of error control in uplink wireless data network. We suggest a few modifications of APC to improve its performance in terms of higher throughput, lower delay and higher error correction capability. (author)

Adaptive Control of the Packet Transmission Period with Solar Energy Harvesting Prediction in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Kideok Kwon

2015-04-01

Full Text Available A number of research works has studied packet scheduling policies in energy scavenging wireless sensor networks, based on the predicted amount of harvested energy. Most of them aim to achieve energy neutrality, which means that an embedded system can operate perpetually while meeting application requirements. Unlike other renewable energy sources, solar energy has the feature of distinct periodicity in the amount of harvested energy over a day. Using this feature, this paper proposes a packet transmission control policy that can enhance the network performance while keeping sensor nodes alive. Furthermore, this paper suggests a novel solar energy prediction method that exploits the relation between cloudiness and solar radiation. The experimental results and analyses show that the proposed packet transmission policy outperforms others in terms of the deadline miss rate and data throughput. Furthermore, the proposed solar energy prediction method can predict more accurately than others by 6.92%.

Adaptive control of the packet transmission period with solar energy harvesting prediction in wireless sensor networks.

Science.gov (United States)

Kwon, Kideok; Yang, Jihoon; Yoo, Younghwan

2015-04-24

A number of research works has studied packet scheduling policies in energy scavenging wireless sensor networks, based on the predicted amount of harvested energy. Most of them aim to achieve energy neutrality, which means that an embedded system can operate perpetually while meeting application requirements. Unlike other renewable energy sources, solar energy has the feature of distinct periodicity in the amount of harvested energy over a day. Using this feature, this paper proposes a packet transmission control policy that can enhance the network performance while keeping sensor nodes alive. Furthermore, this paper suggests a novel solar energy prediction method that exploits the relation between cloudiness and solar radiation. The experimental results and analyses show that the proposed packet transmission policy outperforms others in terms of the deadline miss rate and data throughput. Furthermore, the proposed solar energy prediction method can predict more accurately than others by 6.92%.

Scheduling strategies for LTE uplink with flow behaviour analysis

OpenAIRE

Dimitrova, D.C.; Berg, J.L. van den; Litjens, R.; Heijenk, G.

2010-01-01

Long Term Evolution (LTE) is a cellular technology developed to support diversity of data traffic at potentially high rates. It is foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which is in charge of allocating resources to active flows in both the frequency and time dimension. In this paper we present a performance comparison of two distinct scheduling schemes for LTE uplink (fa...

Revivals of Quantum Wave Packets

OpenAIRE

Bluhm, Robert; Kostelecky, Alan; Porter, James; Tudose, Bogdan

1997-01-01

We present a generic treatment of wave-packet revivals for quantum-mechanical systems. This treatment permits a classification of certain ideal revival types. For example, wave packets for a particle in a one-dimensional box are shown to exhibit perfect revivals. We also examine the revival structure of wave packets for quantum systems with energies that depend on two quantum numbers. Wave packets in these systems exhibit quantum beats in the initial motion as well as new types of long-term r...

Scheduling strategies for LTE uplink with flow behaviour analysis

NARCIS (Netherlands)

Dimitrova, D.C.; Berg, J.L. van den; Litjens, R.; Heijenk, G.

2010-01-01

Long Term Evolution (LTE) is a cellular technology developed to support diversity of data traffic at potentially high rates. It is foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which

Scheduling strategies for LTE uplink with flow behaviour analysis

NARCIS (Netherlands)

Dimitrova, D.C.; van den Berg, Hans Leo; Litjens, R.; Brogle, Marc; Osipov, Evgeny; Heijenk, Gerhard J.

Long Term Evolution (LTE) is a cellular technology developed to support diversity of data traffic at potentially high rates. It is foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which

Effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks

Science.gov (United States)

Jiang, Zhong-Yuan; Ma, Jian-Feng

Existing routing strategies such as the global dynamic routing [X. Ling, M. B. Hu, R. Jiang and Q. S. Wu, Phys. Rev. E 81, 016113 (2010)] can achieve very high traffic capacity at the cost of extremely long packet traveling delay. In many real complex networks, especially for real-time applications such as the instant communication software, extremely long packet traveling time is unacceptable. In this work, we propose to assign a finite Time-to-Live (TTL) parameter for each packet. To guarantee every packet to arrive at its destination within its TTL, we assume that a packet is retransmitted by its source once its TTL expires. We employ source routing mechanisms in the traffic model to avoid the routing-flaps induced by the global dynamic routing. We compose extensive simulations to verify our proposed mechanisms. With small TTL, the effects of packet retransmission on network traffic capacity are obvious, and the phase transition from flow free state to congested state occurs. For the purpose of reducing the computation frequency of the routing table, we employ a computing cycle Tc within which the routing table is recomputed once. The simulation results show that the traffic capacity decreases with increasing Tc. Our work provides a good insight into the understanding of effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks.

Packet Tracer network simulator

CERN Document Server

Jesin, A

2014-01-01

A practical, fast-paced guide that gives you all the information you need to successfully create networks and simulate them using Packet Tracer.Packet Tracer Network Simulator is aimed at students, instructors, and network administrators who wish to use this simulator to learn how to perform networking instead of investing in expensive, specialized hardware. This book assumes that you have a good amount of Cisco networking knowledge, and it will focus more on Packet Tracer rather than networking.

Nondispersive Wave Packets.

Science.gov (United States)

Shaarawi, Amr Mohamed

In this work, nondispersive wavepacket solutions to linear partial differential equations are investigated. These solutions are characterized by infinite energy content; otherwise they are continuous, nonsingular and propagate in free space without spreading out. Examples of such solutions are Berry and Balazs' Airy packet, MacKinnon's wave packet and Brittingham's Focus Wave Mode (FWM). It is demonstrated in this thesis that the infinite energy content is not a basic problem per se and that it can be dealt with in two distinct ways. First these wave packets can be used as bases to construct highly localized, slowly decaying, time-limited pulsed solutions. In the case of the FWMs, this path leads to the formulation of the bidirectional representation, a technique that provides the most natural basis for synthesizing Brittingham-like solutions. This representation is used to derive new exact solutions to the 3-D scalar wave equation. It is also applied to problems involving boundaries, in particular to the propagation of a localized pulse in a infinite acoustic waveguide and to the launchability of such a pulse from the opening of a semi-infinite waveguide. The second approach in dealing with the infinite energy content utilizes the bump-like structure of nondispersive solutions. With an appropriate choice of parameters, these bump fields have very large amplitudes around the centers, in comparison to their tails. In particular, the FWM solutions are used to model massless particles and are capable of providing an interesting interpretation to the results of Young's two slit experiment and to the wave-particle duality of light. The bidirectional representation provides, also, a systematic way of deriving packet solutions to the Klein-Gordon, the Schrodinger and the Dirac equations. Nondispersive solutions of the former two equations are compared to previously derived ones, e.g., the Airy packet and MacKinnon's wave packet.

Optimal Algorithms and a PTAS for Cost-Aware Scheduling

NARCIS (Netherlands)

L. Chen; N. Megow; R. Rischke; L. Stougie (Leen); J. Verschae

2015-01-01

htmlabstractWe consider a natural generalization of classical scheduling problems in which using a time unit for processing a job causes some time-dependent cost which must be paid in addition to the standard scheduling cost. We study the scheduling objectives of minimizing the makespan and the

Teen PACK: Population Awareness Campaign Kit.

Science.gov (United States)

Zero Population Growth, Inc., Washington, DC.

This packet of instructional materials is designed to teach teenagers about the effects of overpopulation on the world and on the individual. Information is presented in three related booklets. The first of the three parts of the "Teen Population Awareness Campaign Kit," illustrates overpopulation through profiles of teens living in…

Stability-Aware Geographic Routing in Energy Harvesting Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Tran Dinh Hieu

2016-05-01

Full Text Available A new generation of wireless sensor networks that harvest energy from environmental sources such as solar, vibration, and thermoelectric to power sensor nodes is emerging to solve the problem of energy limitation. Based on the photo-voltaic model, this research proposes a stability-aware geographic routing for reliable data transmissions in energy-harvesting wireless sensor networks (EH-WSNs to provide a reliable routes selection method and potentially achieve an unlimited network lifetime. Specifically, the influences of link quality, represented by the estimated packet reception rate, on network performance is investigated. Simulation results show that the proposed method outperforms an energy-harvesting-aware method in terms of energy consumption, the average number of hops, and the packet delivery ratio.

Scattering of accelerated wave packets

Science.gov (United States)

Longhi, S.; Horsley, S. A. R.; Della Valle, G.

2018-03-01

Wave-packet scattering from a stationary potential is significantly modified when the wave packet is subject to an external time-dependent force during the interaction. In the semiclassical limit, wave-packet motion is simply described by Newtonian equations, and the external force can, for example, cancel the potential force, making a potential barrier transparent. Here we consider wave-packet scattering from reflectionless potentials, where in general the potential becomes reflective when probed by an accelerated wave packet. In the particular case of the recently introduced class of complex Kramers-Kronig potentials we show that a broad class of time-dependent forces can be applied without inducing any scattering, while there is a breakdown of the reflectionless property when there is a broadband distribution of initial particle momentum, involving both positive and negative components.

Service-Aware Retransmission Control in Cellular Networks

Directory of Open Access Journals (Sweden)

Nadhir Ben Halima

2010-01-01

Full Text Available This paper proposes a service-aware cross-layer approach between application/transport layers on the mobile terminal and link layer on the wireless base station to enable dynamic control on the level of per-packet error protection for multimedia data streams. Specifically, in the context of cellular networks, the proposed scheme enables the mobile terminal to specify to the base station the desired level of Hybrid ARQ (HARQ protection by using an in-band control feedback channel. Such protection is dynamically adapted on a per-packet basis and depends on the perceptual importance of different packets as well as on the reception history of the flow. Experimental results demonstrate the potential benefits deriving from the proposed strategy either for audio and video real-time streams as well as for TCP-based data transfers.

Deep Packet/Flow Analysis using GPUs

Energy Technology Data Exchange (ETDEWEB)

Gong, Qian [Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States); Wu, Wenji [Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States); DeMar, Phil [Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States)

2017-11-12

Deep packet inspection (DPI) faces severe performance challenges in high-speed networks (40/100 GE) as it requires a large amount of raw computing power and high I/O throughputs. Recently, researchers have tentatively used GPUs to address the above issues and boost the performance of DPI. Typically, DPI applications involve highly complex operations in both per-packet and per-flow data level, often in real-time. The parallel architecture of GPUs fits exceptionally well for per-packet network traffic processing. However, for stateful network protocols such as TCP, their data stream need to be reconstructed in a per-flow level to deliver a consistent content analysis. Since the flow-centric operations are naturally antiparallel and often require large memory space for buffering out-of-sequence packets, they can be problematic for GPUs, whose memory is normally limited to several gigabytes. In this work, we present a highly efficient GPU-based deep packet/flow analysis framework. The proposed design includes a purely GPU-implemented flow tracking and TCP stream reassembly. Instead of buffering and waiting for TCP packets to become in sequence, our framework process the packets in batch and uses a deterministic finite automaton (DFA) with prefix-/suffix- tree method to detect patterns across out-of-sequence packets that happen to be located in different batches. In conclusion, evaluation shows that our code can reassemble and forward tens of millions of packets per second and conduct a stateful signature-based deep packet inspection at 55 Gbit/s using an NVIDIA K40 GPU.

Performance of Downlink Frequency Domain Packet Scheduling for the UTRAN Long Term Evolution

DEFF Research Database (Denmark)

Pokhariyal, Akhilesh; Kolding, Troels E.; Mogensen, Preben

2006-01-01

-blind, but time-opportunistic scheduling, FDPS shows gain in both average system capacity and cell-edge data rates on the order of 40%. However, FDPS performance is shown to depend significantly on the frequency-domain scheduling resolution as well as the accuracy of the channel state reports. Assuming Typical...... Urban channel profile, studies show that the scheduling resolution should preferably be as low as 375 kHz to yield significant FDPS gain and the std. of the error of radio state reports need to be kept within 1.5-2 dB....

Data Aggregation and Packet Bundling of Uplink Small Packets for Monitoring Applications in LTE

DEFF Research Database (Denmark)

Kim, Dong Min; Sørensen, René Brandborg; Mahmood, Kashif

2017-01-01

topic. In this article we analyze the deployment scenarios in which aggregators can perform cellular access on behalf of multiple MTC devices. We study the effect of packet bundling at the aggregator, which alleviates overhead and resource waste when sending small packets. The aggregators give rise...... of aggregators and packet bundle size. Our results show that, in general, data aggregation can benefit the uplink massive MTC in LTE by reducing the signaling overhead....

Technology Corner: Internet Packet Sniffers

Directory of Open Access Journals (Sweden)

Nick Flor

2011-03-01

Full Text Available A packet sniffer is a piece of software that allows a person to eavesdrop on computer communications over the internet.  A packet sniffer can be used as a diagnostic tool by network administrators or as a spying tool by hackers who can use it to steal passwords and other private information from computer users.  Whether you are a network administrator or information assurance specialist, it helps to have a detailed understanding of how packet sniffers work.  And one of the best ways to acquire such an understanding is to build and modify an actual packet sniffer.

Efficient Hybrid Genetic Based Multi Dimensional Host Load Aware Algorithm for Scheduling and Optimization of Virtual Machines

OpenAIRE

Thiruvenkadam, T; Karthikeyani, V

2014-01-01

Mapping the virtual machines to the physical machines cluster is called the VM placement. Placing the VM in the appropriate host is necessary for ensuring the effective resource utilization and minimizing the datacenter cost as well as power. Here we present an efficient hybrid genetic based host load aware algorithm for scheduling and optimization of virtual machines in a cluster of Physical hosts. We developed the algorithm based on two different methods, first initial VM packing is done by...

Downlink Radio Resource Management for QoS Provisioning in OFDMA Systems

DEFF Research Database (Denmark)

Monghal, Guillaume Damien

Admission Control solution for a realistic OFDMA based system in downlink where LTE is taken as a case study. In the frame of the thesis work, a detailed system model of LTE dedicated to Radio Resource Management study has been developed and implemented in a semi-static system level simulator. In a first...... phase, the study focuses on the dual time / frequency domain packet scheduling concept which allows a linear complexity. Fundamental design principles for throughput control are highlighted. Using those principles, the design of a complete Quality of Service aware packet scheduling algorithm based...

Quantum wave packet revivals

International Nuclear Information System (INIS)

Robinett, R.W.

2004-01-01

The numerical prediction, theoretical analysis, and experimental verification of the phenomenon of wave packet revivals in quantum systems has flourished over the last decade and a half. Quantum revivals are characterized by initially localized quantum states which have a short-term, quasi-classical time evolution, which then can spread significantly over several orbits, only to reform later in the form of a quantum revival in which the spreading reverses itself, the wave packet relocalizes, and the semi-classical periodicity is once again evident. Relocalization of the initial wave packet into a number of smaller copies of the initial packet ('minipackets' or 'clones') is also possible, giving rise to fractional revivals. Systems exhibiting such behavior are a fundamental realization of time-dependent interference phenomena for bound states with quantized energies in quantum mechanics and are therefore of wide interest in the physics and chemistry communities. We review the theoretical machinery of quantum wave packet construction leading to the existence of revivals and fractional revivals, in systems with one (or more) quantum number(s), as well as discussing how information on the classical period and revival time is encoded in the energy eigenvalue spectrum. We discuss a number of one-dimensional model systems which exhibit revival behavior, including the infinite well, the quantum bouncer, and others, as well as several two-dimensional integrable quantum billiard systems. Finally, we briefly review the experimental evidence for wave packet revivals in atomic, molecular, and other systems, and related revival phenomena in condensed matter and optical systems

Sleep/wake scheduling scheme for minimizing end-to-end delay in multi-hop wireless sensor networks

Directory of Open Access Journals (Sweden)

Madani Sajjad

2011-01-01

Full Text Available Abstract We present a sleep/wake schedule protocol for minimizing end-to-end delay for event driven multi-hop wireless sensor networks. In contrast to generic sleep/wake scheduling schemes, our proposed algorithm performs scheduling that is dependent on traffic loads. Nodes adapt their sleep/wake schedule based on traffic loads in response to three important factors, (a the distance of the node from the sink node, (b the importance of the node's location from connectivity's perspective, and (c if the node is in the proximity where an event occurs. Using these heuristics, the proposed scheme reduces end-to-end delay and maximizes the throughput by minimizing the congestion at nodes having heavy traffic load. Simulations are carried out to evaluate the performance of the proposed protocol, by comparing its performance with S-MAC and Anycast protocols. Simulation results demonstrate that the proposed protocol has significantly reduced the end-to-end delay, as well as has improved the other QoS parameters, like average energy per packet, average delay, packet loss ratio, throughput, and coverage lifetime.

Asymmetric Propagation Delay-Aware TDMA MAC Protocol for Mobile Underwater Acoustic Sensor Networks

Directory of Open Access Journals (Sweden)

A-Ra Cho

2018-06-01

Full Text Available The propagation delay in mobile underwater acoustic sensor network (MUASN is asymmetric because of its low sound propagation speed, and this asymmetry grows with the increase in packet travel time, which damages the collision avoidance mechanism of the spatial reuse medium access control (MAC protocols for MUASN. We propose an asymmetric propagation delay-aware time division multiple access (APD-TDMA for a MUASN in which periodic data packet transmission is required for a sink node (SN. Collisions at the SN are avoided by deferring data packet transmission after reception of a beacon packet from the SN, and data packets are arrived at the SN in a packet-train manner. The time-offset, which is the time for a node to wait before the transmission of a data packet after reception of a beacon packet, is determined by estimating the propagation delay over two consecutive cycles such that the idle interval at the SN is minimized, and this time-offset is announced by the beacon packet. Simulation results demonstrate that the APD-TDMA improves the channel access delay and the channel utilization by approximately 20% and 30%, respectively, compared with those of the block time bounded TDMA under the given network conditions.

Search-Tree Based Uplink Channel Aware Packet Scheduling for UTRAN LTE

DEFF Research Database (Denmark)

Calabrese, Francesco Davide; Michaelsen, Per-Henrik; Rosa, Claudio

2008-01-01

UTRAN Long Term Evolution is currently under standardization within 3GPP with the aim of providing a spectral efficiency 2 to 4 times higher than its predecessor HSUPA/HSDPA. Single Carrier FDMA has been selected as multiple access for the uplink. This technology requires the subcarriers allocate...... distributions. It is shown that, despite measurement errors and high inter-cell interference variability, the proposed algorithm can increase the uplink capacity by more than 26%....

Data analysis with the DIANA meta-scheduling approach

International Nuclear Information System (INIS)

Anjum, A; McClatchey, R; Willers, I

2008-01-01

The concepts, design and evaluation of the Data Intensive and Network Aware (DIANA) meta-scheduling approach for solving the challenges of data analysis being faced by CERN experiments are discussed in this paper. Our results suggest that data analysis can be made robust by employing fault tolerant and decentralized meta-scheduling algorithms supported in our DIANA meta-scheduler. The DIANA meta-scheduler supports data intensive bulk scheduling, is network aware and follows a policy centric meta-scheduling. In this paper, we demonstrate that a decentralized and dynamic meta-scheduling approach is an effective strategy to cope with increasing numbers of users, jobs and datasets. We present 'quality of service' related statistics for physics analysis through the application of a policy centric fair-share scheduling model. The DIANA meta-schedulers create a peer-to-peer hierarchy of schedulers to accomplish resource management that changes with evolving loads and is dynamic and adapts to the volatile nature of the resources

A NEURAL NETWORK BASED TRAFFIC-AWARE FORWARDING STRATEGY IN NAMED DATA NETWORKING

Directory of Open Access Journals (Sweden)

Parisa Bazmi

2016-11-01

Full Text Available Named Data Networking (NDN is a new Internet architecture which has been proposed to eliminate TCP/IP Internet architecture restrictions. This architecture is abstracting away the notion of host and working based on naming datagrams. However, one of the major challenges of NDN is supporting QoS-aware forwarding strategy so as to forward Interest packets intelligently over multiple paths based on the current network condition. In this paper, Neural Network (NN Based Traffic-aware Forwarding strategy (NNTF is introduced in order to determine an optimal path for Interest forwarding. NN is embedded in NDN routers to select next hop dynamically based on the path overload probability achieved from the NN. This solution is characterized by load balancing and QoS-awareness via monitoring the available path and forwarding data on the traffic-aware shortest path. The performance of NNTF is evaluated using ndnSIM which shows the efficiency of this scheme in terms of network QoS improvementof17.5% and 72% reduction in network delay and packet drop respectively.

Improved Channel Allocation and RLC block scheduling for Downlink traffic in GPRS

DEFF Research Database (Denmark)

Wang, Haibo; Devendra, Devendra; Zhou, Xin

This paper investigates the Radio Resource Management (RRM) approaches for GSM/GPRS networks. The effort was put on Access Control(AC), Time-Slot (TS) allocation, and Radio Link Control (RLC) packet scheduling for down-link performance enhancement. A new credit-based algorithm was proposed...

Three-dimensional electromagnetic strong turbulence. II. Wave packet collapse and structure of wave packets during strong turbulence

International Nuclear Information System (INIS)

Graham, D. B.; Robinson, P. A.; Cairns, Iver H.; Skjaeraasen, O.

2011-01-01

Large-scale simulations of wave packet collapse are performed by numerically solving the three-dimensional (3D) electromagnetic Zakharov equations, focusing on individual wave packet collapses and on wave packets that form in continuously driven strong turbulence. The collapse threshold is shown to decrease as the electron thermal speed ν e /c increases and as the temperature ratio T i /T e of ions to electrons decreases. Energy lost during wave packet collapse and dissipation is shown to depend on ν e /c. The dynamics of density perturbations after collapse are studied in 3D electromagnetic strong turbulence for a range of T i /T e . The structures of the Langmuir, transverse, and total electric field components of wave packets during strong turbulence are investigated over a range of ν e /c. For ν e /c e /c > or approx. 0.17, transverse modes become trapped in density wells and contribute significantly to the structure of the total electric field. At all ν e /c, the Langmuir energy density contours of wave packets are predominantly oblate (pancake shaped). The transverse energy density contours of wave packets are predominantly prolate (sausage shaped), with the major axis being perpendicular to the major axes of the Langmuir component. This results in the wave packet becoming more nearly spherical as ν e /c increases, and in turn generates more spherical density wells during collapse. The results obtained are compared with previous 3D electrostatic results and 2D electromagnetic results.

Feasibility of Optical Packet Switched WDM Networks without Packet Synchronisation Under Bursty Traffic Conditions

DEFF Research Database (Denmark)

Fjelde, Tina; Hansen, Peter Bukhave; Kloch, Allan

1999-01-01

We show that complex packet synchronisation may be avoided in optical packetswitched networks. Detailed traffic analysis demonstrates that packet lossratios of 1e-10 are feasible under bursty traffic conditions for a highcapacity network consisting of asynchronously operated add-drop switch...

On the theory of wave packets

International Nuclear Information System (INIS)

Naumov, D.V.

2013-01-01

In this paper we discuss some aspects of the theory of wave packets. We consider a popular non-covariant Gaussian model used in various applications and show that it predicts too slow a longitudinal dispersion rate for relativistic particles. We revise this approach by considering a covariant model of Gaussian wave packets, and examine our results by inspecting a wave packet of an arbitrary form. A general formula for the time dependence of the dispersion of a wave packet of an arbitrary form is found. Finally, we give a transparent interpretation of the disappearance of the wave function over time due to the dispersion - a feature often considered undesirable, but which is unavoidable for wave packets. We find, starting with simple examples, proceeding with their generalizations and finally by considering the continuity equation, that the integral over time of both the flux and probability densities is asymptotically proportional to the factor 1/|x| 2 in the rest frame of the wave packet, just as in the case of an ensemble of classical particles

Design of Packet-Based Block Codes with Shift Operators

Directory of Open Access Journals (Sweden)

Ilow Jacek

2010-01-01

Full Text Available This paper introduces packet-oriented block codes for the recovery of lost packets and the correction of an erroneous single packet. Specifically, a family of systematic codes is proposed, based on a Vandermonde matrix applied to a group of information packets to construct redundant packets, where the elements of the Vandermonde matrix are bit-level right arithmetic shift operators. The code design is applicable to packets of any size, provided that the packets within a block of information packets are of uniform length. In order to decrease the overhead associated with packet padding using shift operators, non-Vandermonde matrices are also proposed for designing packet-oriented block codes. An efficient matrix inversion procedure for the off-line design of the decoding algorithm is presented to recover lost packets. The error correction capability of the design is investigated as well. The decoding algorithm, based on syndrome decoding, to correct a single erroneous packet in a group of received packets is presented. The paper is equipped with examples of codes using different parameters. The code designs and their performance are tested using Monte Carlo simulations; the results obtained exhibit good agreement with the corresponding theoretical results.

Aviation Career Awareness Program [and Related Materials].

Science.gov (United States)

Petrie, Edwin T.

The learning packet focuses on general aviation and is to be used in career awareness programs at the elementary level. It includes a document which presents a group of units on general aviation and its related careers. The units include the following: (1) aircraft manufacturing, (2) instruments and controls, (3) how airplanes fly, (4) flight…

A study of artificial speech quality assessors of VoIP calls subject to limited bursty packet losses

Directory of Open Access Journals (Sweden)

Jelassi Sofiene

2011-01-01

Full Text Available Abstract A revolutionary feature of emerging media services over the Internet is their ability to account for human perception during service delivery processes, which surely increases their popularity and incomes. In such a situation, it is necessary to understand the users' perception, what should obviously be done using standardized subjective experiences. However, it is also important to develop artificial quality assessors that enable to automatically quantify the perceived quality. This efficiently helps performing optimal network and service management at the core and edges of the delivery systems. In our article, we explore the behavior rating of new emerging artificial speech quality assessors of VoIP calls subject to moderately bursty packet loss processes. The examined Speech Quality Assessment (SQA algorithms are able to estimate speech quality of live VoIP calls at run-time using control information extracted from header content of received packets. They are especially designed to be sensitive to packet loss burstiness. The performance evaluation study is performed using a dedicated set-up software-based SQA framework. It offers a specialized packet killer and includes the implementation of four SQA algorithms. A speech quality database, which covers a wide range of bursty packet loss conditions, has been created and then thoroughly analyzed. Our main findings are the following: (1 all examined automatic bursty-loss aware speech quality assessors achieve a satisfactory correlation under upper (> 20% and lower (< 10% ranges of packet loss processes; (2 they exhibit a clear weakness to assess speech quality under a moderated packet loss process; (3 the accuracy of sequence-by-sequence basis of examined SQA algorithms should be addressed in detail for further precision.

An On-Demand Emergency Packet Transmission Scheme for Wireless Body Area Networks.

Science.gov (United States)

Al Ameen, Moshaddique; Hong, Choong Seon

2015-12-04

The rapid developments of sensor devices that can actively monitor human activities have given rise to a new field called wireless body area network (BAN). A BAN can manage devices in, on and around the human body. Major requirements of such a network are energy efficiency, long lifetime, low delay, security, etc. Traffic in a BAN can be scheduled (normal) or event-driven (emergency). Traditional media access control (MAC) protocols use duty cycling to improve performance. A sleep-wake up cycle is employed to save energy. However, this mechanism lacks features to handle emergency traffic in a prompt and immediate manner. To deliver an emergency packet, a node has to wait until the receiver is awake. It also suffers from overheads, such as idle listening, overhearing and control packet handshakes. An external radio-triggered wake up mechanism is proposed to handle prompt communication. It can reduce the overheads and improve the performance through an on-demand scheme. In this work, we present a simple-to-implement on-demand packet transmission scheme by taking into considerations the requirements of a BAN. The major concern is handling the event-based emergency traffic. The performance analysis of the proposed scheme is presented. The results showed significant improvements in the overall performance of a BAN compared to state-of-the-art protocols in terms of energy consumption, delay and lifetime.

An On-Demand Emergency Packet Transmission Scheme for Wireless Body Area Networks

Directory of Open Access Journals (Sweden)

Moshaddique Al Ameen

2015-12-01

Full Text Available The rapid developments of sensor devices that can actively monitor human activities have given rise to a new field called wireless body area network (BAN. A BAN can manage devices in, on and around the human body. Major requirements of such a network are energy efficiency, long lifetime, low delay, security, etc. Traffic in a BAN can be scheduled (normal or event-driven (emergency. Traditional media access control (MAC protocols use duty cycling to improve performance. A sleep-wake up cycle is employed to save energy. However, this mechanism lacks features to handle emergency traffic in a prompt and immediate manner. To deliver an emergency packet, a node has to wait until the receiver is awake. It also suffers from overheads, such as idle listening, overhearing and control packet handshakes. An external radio-triggered wake up mechanism is proposed to handle prompt communication. It can reduce the overheads and improve the performance through an on-demand scheme. In this work, we present a simple-to-implement on-demand packet transmission scheme by taking into considerations the requirements of a BAN. The major concern is handling the event-based emergency traffic. The performance analysis of the proposed scheme is presented. The results showed significant improvements in the overall performance of a BAN compared to state-of-the-art protocols in terms of energy consumption, delay and lifetime.

Design of Packet-Based Block Codes with Shift Operators

Directory of Open Access Journals (Sweden)

Jacek Ilow

2010-01-01

Full Text Available This paper introduces packet-oriented block codes for the recovery of lost packets and the correction of an erroneous single packet. Specifically, a family of systematic codes is proposed, based on a Vandermonde matrix applied to a group of k information packets to construct r redundant packets, where the elements of the Vandermonde matrix are bit-level right arithmetic shift operators. The code design is applicable to packets of any size, provided that the packets within a block of k information packets are of uniform length. In order to decrease the overhead associated with packet padding using shift operators, non-Vandermonde matrices are also proposed for designing packet-oriented block codes. An efficient matrix inversion procedure for the off-line design of the decoding algorithm is presented to recover lost packets. The error correction capability of the design is investigated as well. The decoding algorithm, based on syndrome decoding, to correct a single erroneous packet in a group of n=k+r received packets is presented. The paper is equipped with examples of codes using different parameters. The code designs and their performance are tested using Monte Carlo simulations; the results obtained exhibit good agreement with the corresponding theoretical results.

Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit

DEFF Research Database (Denmark)

Nagahara, Masaaki; Quevedo, Daniel; Østergaard, Jan

2012-01-01

We study packetized predictive control, known to be robust against packet dropouts in networked systems. To obtain sparse packets for rate-limited networks, we design control packets via an ℓ0 optimization, which can be eectively solved by orthogonal matching pursuit. Our formulation ensures...

Architecture for WSN Nodes Integration in Context Aware Systems Using Semantic Messages

Science.gov (United States)

Larizgoitia, Iker; Muguira, Leire; Vazquez, Juan Ignacio

Wireless sensor networks (WSN) are becoming extremely popular in the development of context aware systems. Traditionally WSN have been focused on capturing data, which was later analyzed and interpreted in a server with more computational power. In this kind of scenario the problem of representing the sensor information needs to be addressed. Every node in the network might have different sensors attached; therefore their correspondent packet structures will be different. The server has to be aware of the meaning of every single structure and data in order to be able to interpret them. Multiple sensors, multiple nodes, multiple packet structures (and not following a standard format) is neither scalable nor interoperable. Context aware systems have solved this problem with the use of semantic technologies. They provide a common framework to achieve a standard definition of any domain. Nevertheless, these representations are computationally expensive, so a WSN cannot afford them. The work presented in this paper tries to bridge the gap between the sensor information and its semantic representation, by defining a simple architecture that enables the definition of this information natively in a semantic way, achieving the integration of the semantic information in the network packets. This will have several benefits, the most important being the possibility of promoting every WSN node to a real semantic information source.

Ising model for packet routing control

International Nuclear Information System (INIS)

Horiguchi, Tsuyoshi; Takahashi, Hideyuki; Hayashi, Keisuke; Yamaguchi, Chiaki

2004-01-01

For packet routing control in computer networks, we propose an Ising model which is defined in order to express competition among a queue length and a distance from a node with a packet to its destination node. By introducing a dynamics for a mean-field value of an Ising spin, we show by computer simulations that effective control of packet routing through priority links is possible

Architectures of electro-optical packet switched networks

DEFF Research Database (Denmark)

Berger, Michael Stubert

2004-01-01

and examines possible architectures for future high capacity networks with high capacity nodes. It is assumed that optics will play a key role in this scenario, and in this respect, the European IST research project DAVID aimed at proposing viable architectures for optical packet switching, exploiting the best...... from optics and electronics. An overview of the DAVID network architecture is given, focusing on the MAN and WAN architecture as well as the MPLS based network hierarchy. A statistical model of the optical slot generation process is presented and utilised to evaluate delay vs. efficiency. Furthermore...... architecture for a buffered crossbar switch is presented. The architecture uses two levels of backpressure (flow control) with different constraints on round trip time. No additional scheduling complexity is introduced, and for the actual example shown, a reduction in memory of 75% was obtained at the cost...

Comparison of Ring-Buffer-Based Packet Capture Solutions

Energy Technology Data Exchange (ETDEWEB)

Barker, Steven Andrew [Sandia National Lab. (SNL-CA), Livermore, CA (United States)

2015-10-01

Traditional packet-capture solutions using commodity hardware incur a large amount of overhead as packets are copied multiple times by the operating system. This overhead slows sensor systems to a point where they are unable to keep up with high bandwidth traffic, resulting in dropped packets. Incomplete packet capture files hinder network monitoring and incident response efforts. While costly commercial hardware exists to capture high bandwidth traffic, several software-based approaches exist to improve packet capture performance using commodity hardware.

Two-Step Fair Scheduling of Continuous Media Streams over Error-Prone Wireless Channels

Science.gov (United States)

Oh, Soohyun; Lee, Jin Wook; Park, Taejoon; Jo, Tae-Chang

In wireless cellular networks, streaming of continuous media (with strict QoS requirements) over wireless links is challenging due to their inherent unreliability characterized by location-dependent, bursty errors. To address this challenge, we present a two-step scheduling algorithm for a base station to provide streaming of continuous media to wireless clients over the error-prone wireless links. The proposed algorithm is capable of minimizing the packet loss rate of individual clients in the presence of error bursts, by transmitting packets in the round-robin manner and also adopting a mechanism for channel prediction and swapping.

Low-Bandwidth Channel Quality Indication for OFDMA Frequency Domain Packet Scheduling

DEFF Research Database (Denmark)

Kolding, Troels E.; Frederiksen, Frank; Pokhariyal, Akhilesh

2007-01-01

-relevant information in the CQI. We find that a 60-70% CQI bandwidth reduction is possible with less than 5-10% impact on scheduling performance. Further, we consider the impact of lowering the CQI reporting rate on both mobility performance and increased measuring accuracy due to longer averaging interval. We find...

Trade Related Reading Packets for Disabled Readers.

Science.gov (United States)

Davis, Beverly; Woodruff, Nancy S.

Six trade-related reading packets for disabled readers are provided for these trades: assemblers, baking, building maintenance, data entry, interior landscaping, and warehousing. Each packet stresses from 9 to 14 skills. Those skills common to most packets include context clues, fact or opinion, details, following directions, main idea,…

Time evolution of wave packets on nanostructures

International Nuclear Information System (INIS)

Prunele, E de

2005-01-01

Time evolution of wave packets on nanostructures is studied on the basis of a three-dimensional solvable model with singular interactions (de Prunele 1997 J. Phys. A: Math. Gen. 30 7831). In particular, methods and tools are provided to determine time independent upper bounds for the overlap of the normalized time-dependent wave packet with the time independent normalized wave packet concentrated at an arbitrarily chosen vertex of the nanosystem. The set of upper bounds referring to all initial positions of the wave packet and all overlaps are summarized in a matrix. The analytical formulation allows a detailed study for arbitrary geometrical configurations. Time evolution on truncated quasicrystalline systems has been found to be site selective, depending on the position of the initial wave packet

Dynamics of quantum wave packets

International Nuclear Information System (INIS)

Gosnell, T.R.; Taylor, A.J.; Rodriguez, G.; Clement, T.S.

1998-01-01

This is the final report of a three-year, Laboratory Directed Research and Development (LDRD) project at the Los Alamos National Laboratory (LANL). The objective of this project was to develop ultrafast laser techniques for the creation and measurement of quantum vibrational wave packets in gas phase diatomic molecules. Moreover, the authors sought to manipulate the constitution of these wave packets in terms of harmonic-oscillator basis wavefunctions by manipulating the time-dependent amplitude and phase of the incident ultrashort laser pulse. They specifically investigated gaseous diatomic potassium (K 2 ), and discovered variations in the shape of the wave packets as a result of changing the linear chirp in the ultrashort preparation pulse. In particular, they found evidence for wave-packet compression for a specific degree of chirp. Important ancillary results include development of new techniques for denoising and deconvolution of femtosecond time traces and techniques for diagnosing the phase and amplitude of the electric field of femtosecond laser pulses

A novel downlink scheduling strategy for traffic communication system based on TD-LTE technology.

Science.gov (United States)

Chen, Ting; Zhao, Xiangmo; Gao, Tao; Zhang, Licheng

2016-01-01

There are many existing classical scheduling algorithms which can obtain better system throughput and user equality, however, they are not designed for traffic transportation environment, which cannot consider whether the transmission performance of various information flows could meet comprehensive requirements of traffic safety and delay tolerance. This paper proposes a novel downlink scheduling strategy for traffic communication system based on TD-LTE technology, which can perform two classification mappings for various information flows in the eNodeB: firstly, associate every information flow packet with traffic safety importance weight according to its relevance to the traffic safety; secondly, associate every traffic information flow with service type importance weight according to its quality of service (QoS) requirements. Once the connection is established, at every scheduling moment, scheduler would decide the scheduling order of all buffers' head of line packets periodically according to the instant value of scheduling importance weight function, which calculated by the proposed algorithm. From different scenario simulations, it can be verified that the proposed algorithm can provide superior differentiated transmission service and reliable QoS guarantee to information flows with different traffic safety levels and service types, which is more suitable for traffic transportation environment compared with the existing popularity PF algorithm. With the limited wireless resource, information flow closed related to traffic safety will always obtain priority scheduling right timely, which can help the passengers' journey more safe. Moreover, the proposed algorithm cannot only obtain good flow throughput and user fairness which are almost equal to those of the PF algorithm without significant differences, but also provide better realtime transmission guarantee to realtime information flow.

Spreading of a relativistic wave packet

International Nuclear Information System (INIS)

Almeida, C.; Jabs, A.

1983-01-01

A simple general proof that the spreading velocity of a relativistic free wave packet of the Broglie waves is limited is presented. For a wide class of packets it is confirmed that the limit is the velocity of light, and it is shown how this limit is approached when the width Δp of the wave packet in momentum space tends to infinity and the minimum width σ(t=o) in ordinary space tends to zero. (Author) [pt

High Angular Momentum Rydberg Wave Packets

Science.gov (United States)

Wyker, Brendan

2011-12-01

High angular momentum Rydberg wave packets are studied. Application of carefully tailored electric fields to low angular momentum, high- n (n ˜ 300) Rydberg atoms creates coherent superpositions of Stark states with near extreme values of angular momentum, ℓ. Wave packet components orbit the parent nucleus at rates that depend on their energy, leading to periods of localization and delocalization as the components come into and go out of phase with each other. Monitoring survival probability signals in the presence of position dependent probing leads to observation of characteristic oscillations based on the composition of the wave packet. The discrete nature of electron energy levels is observed through the measurement of quantum revivals in the wave packet localization signal. Time-domain spectroscopy of these signals allows determination of both the population and phase of individual superposition components. Precise manipulation of wave packets is achieved through further application of pulsed electric fields. Decoherence effects due to background gas collisions and electrical noise are also detailed. Quantized classical trajectory Monte-Carlo simulations are introduced and agree remarkably well with experimental results.

TCP Packet Trace Analysis. M.S. Thesis

Science.gov (United States)

Shepard, Timothy J.

1991-01-01

Examination of a trace of packets collected from the network is often the only method available for diagnosing protocol performance problems in computer networks. This thesis explores the use of packet traces to diagnose performance problems of the transport protocol TCP. Unfortunately, manual examination of these traces can be so tedious that effective analysis is not possible. The primary contribution of this thesis is a graphical method of displaying the packet trace which greatly reduce, the tediousness of examining a packet trace. The graphical method is demonstrated by the examination of some packet traces of typical TCP connections. The performance of two different implementations of TCP sending data across a particular network path is compared. Traces many thousands of packets long are used to demonstrate how effectively the graphical method simplifies examination of long complicated traces. In the comparison of the two TCP implementations, the burstiness of the TCP transmitter appeared to be related to the achieved throughput. A method of quantifying this burstiness is presented and its possible relevance to understanding the performance of TCP is discussed.

Certain problems concerning wavelets and wavelets packets

Energy Technology Data Exchange (ETDEWEB)

Siddiqi, A H

1995-09-01

Wavelets is the outcome of the synthesis of ideas that have emerged in different branches of science and technology, mainly in the last decade. The concept of wavelet packets, which are superpositions of wavelets, has been introduced a couple of years ago. They form bases which retain many properties of wavelets like orthogonality, smoothness and localization. The Walsh orthornomal system is a special case of wavelet packet. The wavelet packets provide at our disposal a library of orthonormal bases, each of which can be used to analyze a given signal of finite energy. The optimal choice is decided by the entropy criterion. In the present paper we discuss results concerning convergence, coefficients, and approximation of wavelet packets series in general and wavelets series in particular. Wavelet packet techniques for solutions of differential equations are also mentioned. (author). 117 refs.

Certain problems concerning wavelets and wavelets packets

International Nuclear Information System (INIS)

Siddiqi, A.H.

1995-09-01

Wavelets is the outcome of the synthesis of ideas that have emerged in different branches of science and technology, mainly in the last decade. The concept of wavelet packets, which are superpositions of wavelets, has been introduced a couple of years ago. They form bases which retain many properties of wavelets like orthogonality, smoothness and localization. The Walsh orthornomal system is a special case of wavelet packet. The wavelet packets provide at our disposal a library of orthonormal bases, each of which can be used to analyze a given signal of finite energy. The optimal choice is decided by the entropy criterion. In the present paper we discuss results concerning convergence, coefficients, and approximation of wavelet packets series in general and wavelets series in particular. Wavelet packet techniques for solutions of differential equations are also mentioned. (author). 117 refs

Tropical Animal Tour Packet. Metro.

Science.gov (United States)

Metro Washington Park Zoo, Portland, OR. Educational Services Div.

This packet is designed to assist teachers in creating a tropical animals lesson plan that centers around a visit to the zoo. A teacher packet is divided into eight parts: (1) goals and objectives; (2) what to expect at the zoo; (3) student activities (preparatory activities, on-site activities, and follow-up activities); (4) background…

Cache-aware network-on-chip for chip multiprocessors

Science.gov (United States)

Tatas, Konstantinos; Kyriacou, Costas; Dekoulis, George; Demetriou, Demetris; Avraam, Costas; Christou, Anastasia

2009-05-01

This paper presents the hardware prototype of a Network-on-Chip (NoC) for a chip multiprocessor that provides support for cache coherence, cache prefetching and cache-aware thread scheduling. A NoC with support to these cache related mechanisms can assist in improving systems performance by reducing the cache miss ratio. The presented multi-core system employs the Data-Driven Multithreading (DDM) model of execution. In DDM thread scheduling is done according to data availability, thus the system is aware of the threads to be executed in the near future. This characteristic of the DDM model allows for cache aware thread scheduling and cache prefetching. The NoC prototype is a crossbar switch with output buffering that can support a cache-aware 4-node chip multiprocessor. The prototype is built on the Xilinx ML506 board equipped with a Xilinx Virtex-5 FPGA.

Random access with adaptive packet aggregation in LTE/LTE-A.

Science.gov (United States)

Zhou, Kaijie; Nikaein, Navid

While random access presents a promising solution for efficient uplink channel access, the preamble collision rate can significantly increase when massive number of devices simultaneously access the channel. To address this issue and improve the reliability of the random access, an adaptive packet aggregation method is proposed. With the proposed method, a device does not trigger a random access for every single packet. Instead, it starts a random access when the number of aggregated packets reaches a given threshold. This method reduces the packet collision rate at the expense of an extra latency, which is used to accumulate multiple packets into a single transmission unit. Therefore, the tradeoff between packet loss rate and channel access latency has to be carefully selected. We use semi-Markov model to derive the packet loss rate and channel access latency as functions of packet aggregation number. Hence, the optimal amount of aggregated packets can be found, which keeps the loss rate below the desired value while minimizing the access latency. We also apply for the idea of packet aggregation for power saving, where a device aggregates as many packets as possible until the latency constraint is reached. Simulations are carried out to evaluate our methods. We find that the packet loss rate and/or power consumption are significantly reduced with the proposed method.

Length-Bounded Hybrid CPU/GPU Pattern Matching Algorithm for Deep Packet Inspection

Directory of Open Access Journals (Sweden)

Yi-Shan Lin

2017-01-01

Full Text Available Since frequent communication between applications takes place in high speed networks, deep packet inspection (DPI plays an important role in the network application awareness. The signature-based network intrusion detection system (NIDS contains a DPI technique that examines the incoming packet payloads by employing a pattern matching algorithm that dominates the overall inspection performance. Existing studies focused on implementing efficient pattern matching algorithms by parallel programming on software platforms because of the advantages of lower cost and higher scalability. Either the central processing unit (CPU or the graphic processing unit (GPU were involved. Our studies focused on designing a pattern matching algorithm based on the cooperation between both CPU and GPU. In this paper, we present an enhanced design for our previous work, a length-bounded hybrid CPU/GPU pattern matching algorithm (LHPMA. In the preliminary experiment, the performance and comparison with the previous work are displayed, and the experimental results show that the LHPMA can achieve not only effective CPU/GPU cooperation but also higher throughput than the previous method.

Scheduler-dependent inter-cell interference and its impact on LTE uplink performance at flow level

NARCIS (Netherlands)

Dimitrova, D.C.; Heijenk, G.; Berg, J.L. van den; Yankov, S.

2011-01-01

The Long Term Evolution (LTE) cellular technology is expected to extend the capacity and improve the performance of current 3G cellular networks. Among the key mechanisms in LTE responsible for traffic management is the packet scheduler, which handles the allocation of resources to active flows in

Collaborative Distributed Scheduling Approaches for Wireless Sensor Network

Science.gov (United States)

Niu, Jianjun; Deng, Zhidong

2009-01-01

Energy constraints restrict the lifetime of wireless sensor networks (WSNs) with battery-powered nodes, which poses great challenges for their large scale application. In this paper, we propose a family of collaborative distributed scheduling approaches (CDSAs) based on the Markov process to reduce the energy consumption of a WSN. The family of CDSAs comprises of two approaches: a one-step collaborative distributed approach and a two-step collaborative distributed approach. The approaches enable nodes to learn the behavior information of its environment collaboratively and integrate sleep scheduling with transmission scheduling to reduce the energy consumption. We analyze the adaptability and practicality features of the CDSAs. The simulation results show that the two proposed approaches can effectively reduce nodes' energy consumption. Some other characteristics of the CDSAs like buffer occupation and packet delay are also analyzed in this paper. We evaluate CDSAs extensively on a 15-node WSN testbed. The test results show that the CDSAs conserve the energy effectively and are feasible for real WSNs. PMID:22408491

A novel lost packets recovery scheme based on visual secret sharing

Science.gov (United States)

Lu, Kun; Shan, Hong; Li, Zhi; Niu, Zhao

2017-08-01

In this paper, a novel lost packets recovery scheme which encrypts the effective parts of an original packet into two shadow packets based on (2, 2)-threshold XOR-based visual Secret Sharing (VSS) is proposed. The two shadow packets used as watermarks would be embedded into two normal data packets with digital watermarking embedding technology and then sent from one sensor node to another. Each shadow packet would reveal no information of the original packet, which can improve the security of original packet delivery greatly. The two shadow packets which can be extracted from the received two normal data packets delivered from a sensor node can recover the original packet lossless based on XOR-based VSS. The Performance analysis present that the proposed scheme provides essential services as long as possible in the presence of selective forwarding attack. The proposed scheme would not increase the amount of additional traffic, namely, lower energy consumption, which is suitable for Wireless Sensor Network (WSN).

Packet Guide to Routing and Switching

CERN Document Server

Hartpence, Bruce

2011-01-01

Go beyond layer 2 broadcast domains with this in-depth tour of advanced link and internetwork layer protocols, and learn how they enable you to expand to larger topologies. An ideal follow-up to Packet Guide to Core Network Protocols, this concise guide dissects several of these protocols to explain their structure and operation. This isn't a book on packet theory. Author Bruce Hartpence built topologies in a lab as he wrote this guide, and each chapter includes several packet captures. You'll learn about protocol classification, static vs. dynamic topologies, and reasons for installing a pa

An Autonomous Self-Aware and Adaptive Fault Tolerant Routing Technique for Wireless Sensor Networks.

Science.gov (United States)

Abba, Sani; Lee, Jeong-A

2015-08-18

We propose an autonomous self-aware and adaptive fault-tolerant routing technique (ASAART) for wireless sensor networks. We address the limitations of self-healing routing (SHR) and self-selective routing (SSR) techniques for routing sensor data. We also examine the integration of autonomic self-aware and adaptive fault detection and resiliency techniques for route formation and route repair to provide resilience to errors and failures. We achieved this by using a combined continuous and slotted prioritized transmission back-off delay to obtain local and global network state information, as well as multiple random functions for attaining faster routing convergence and reliable route repair despite transient and permanent node failure rates and efficient adaptation to instantaneous network topology changes. The results of simulations based on a comparison of the ASAART with the SHR and SSR protocols for five different simulated scenarios in the presence of transient and permanent node failure rates exhibit a greater resiliency to errors and failure and better routing performance in terms of the number of successfully delivered network packets, end-to-end delay, delivered MAC layer packets, packet error rate, as well as efficient energy conservation in a highly congested, faulty, and scalable sensor network.

Scheduler-dependent inter-cell interference and its impact on LTE uplink performance at flow level

NARCIS (Netherlands)

Dimitrova, D.C.; Heijenk, Geert; van den Berg, Hans Leo; Yankov, S.; Masip Bruin, Xavier; Verchere, Dominique; Tsaoussidis, Vassilis; Yannuzzi, Marcelo

The Long Term Evolution (LTE) cellular technology is ex- pected to extend the capacity and improve the performance of current 3G cellular networks. Among the key mechanisms in LTE responsible for traffic management is the packet scheduler, which handles the al- location of resources to active flows

Development of optical packet and circuit integrated ring network testbed.

Science.gov (United States)

Furukawa, Hideaki; Harai, Hiroaki; Miyazawa, Takaya; Shinada, Satoshi; Kawasaki, Wataru; Wada, Naoya

2011-12-12

We developed novel integrated optical packet and circuit switch-node equipment. Compared with our previous equipment, a polarization-independent 4 × 4 semiconductor optical amplifier switch subsystem, gain-controlled optical amplifiers, and one 100 Gbps optical packet transponder and seven 10 Gbps optical path transponders with 10 Gigabit Ethernet (10GbE) client-interfaces were newly installed in the present system. The switch and amplifiers can provide more stable operation without equipment adjustments for the frequent polarization-rotations and dynamic packet-rate changes of optical packets. We constructed an optical packet and circuit integrated ring network testbed consisting of two switch nodes for accelerating network development, and we demonstrated 66 km fiber transmission and switching operation of multiplexed 14-wavelength 10 Gbps optical paths and 100 Gbps optical packets encapsulating 10GbE frames. Error-free (frame error rate optical packets of various packet lengths and packet rates, and stable operation of the network testbed was confirmed. In addition, 4K uncompressed video streaming over OPS links was successfully demonstrated. © 2011 Optical Society of America

Revivals of quantum wave packets in graphene

International Nuclear Information System (INIS)

Krueckl, Viktor; Kramer, Tobias

2009-01-01

We investigate the propagation of wave packets on graphene in a perpendicular magnetic field and the appearance of collapses and revivals in the time evolution of an initially localized wave packet. The wave-packet evolution in graphene differs drastically from the one in an electron gas and shows a rich revival structure similar to the dynamics of highly excited Rydberg states. We present a novel numerical wave-packet propagation scheme in order to solve the effective single-particle Dirac-Hamiltonian of graphene and show how the collapse and revival dynamics is affected by the presence of disorder. Our effective numerical method is of general interest for the solution of the Dirac equation in the presence of potentials and magnetic fields.

Interference-Aware Radio Resource Management for Local Area Wireless Networks

Directory of Open Access Journals (Sweden)

Ribeiro CássioB

2011-01-01

Full Text Available Interference-aware multiple access is an enabler to cost-efficient and reliable high data-rate local area wireless access. In this paper, we propose an interference-aware radio resource management scheme where receivers inform about their throughput, interference, and signal levels by means of broadcast messages tied to data reception. In the proposed scheme, the conventional scheduler is extended to interference-aware operation where individual scheduling decisions are based on estimated change in system-level performance. The performance of the proposed scheme is evaluated in system simulations where it is compared to a conventional scheduler and a centralized scheduler (global optimum. The convergence of the proposed scheduler is analyzed and signaling overhead of an example implementation is characterized. The results demonstrate that the proposed scheme enables fair and efficient wireless access in challenging interference scenarios, for example, multiple networks deployed in the same geographical area and sharing a common band.

Cost-effective handoff scheme based on mobility-aware dual pointer forwarding in proxy mobile IPv6 networks.

Science.gov (United States)

Son, Seungsik; Jeong, Jongpil

2014-01-01

In this paper, a mobility-aware Dual Pointer Forwarding scheme (mDPF) is applied in Proxy Mobile IPv6 (PMIPv6) networks. The movement of a Mobile Node (MN) is classified as intra-domain and inter-domain handoff. When the MN moves, this scheme can reduce the high signaling overhead for intra-handoff/inter-handoff, because the Local Mobility Anchor (LMA) and Mobile Access Gateway (MAG) are connected by pointer chains. In other words, a handoff is aware of low mobility between the previously attached MAG (pMAG) and newly attached MAG (nMAG), and another handoff between the previously attached LMA (pLMA) and newly attached LMA (nLMA) is aware of high mobility. Based on these mobility-aware binding updates, the overhead of the packet delivery can be reduced. Also, we analyse the binding update cost and packet delivery cost for route optimization, based on the mathematical analytic model. Analytical results show that our mDPF outperforms the PMIPv6 and the other pointer forwarding schemes, in terms of reducing the total cost of signaling.

A NEURAL NETWORK BASED TRAFFIC-AWARE FORWARDING STRATEGY IN NAMED DATA NETWORKING

OpenAIRE

Parisa Bazmi; Manijeh Keshtgary

2016-01-01

Named Data Networking (NDN) is a new Internet architecture which has been proposed to eliminate TCP/IP Internet architecture restrictions. This architecture is abstracting away the notion of host and working based on naming datagrams. However, one of the major challenges of NDN is supporting QoS-aware forwarding strategy so as to forward Interest packets intelligently over multiple paths based on the current network condition. In this paper, Neural Network (NN) Based Traffic-aware Forwarding ...

Human Performance-Aware Scheduling and Routing of a Multi-Skilled Workforce

Directory of Open Access Journals (Sweden)

Maikel L. van Eck

2017-10-01

Full Text Available Planning human activities within business processes often happens based on the same methods and algorithms as are used in the area of manufacturing systems. However, human behaviour is quite different from machine behaviour. Their performance depends on a number of factors, including workload, stress, personal preferences, etc. In this article we describe an approach for scheduling activities of people that takes into account business rules and dynamic human performance in order to optimise the schedule. We formally describe the scheduling problem we address and discuss how it can be constructed from inputs in the form of business process models and performance measurements. Finally, we discuss and evaluate an implementation for our planning approach to show the impact of considering dynamic human performance in scheduling.

Attosecond electron wave packet interferometry

International Nuclear Information System (INIS)

Remetter, T.; Ruchon, T.; Johnsson, P.; Varju, K.; Gustafsson, E.

2006-01-01

Complete test of publication follows. The well controlled generation and characterization of attosecond XUV light pulses provide an unprecedented tool to study electron wave packets (EWPs). Here a train of attosecond pulses is used to create and study the phase of an EWP in momentum space. There is a clear analogy between electronic wave functions and optical fields. In optics, methods like SPIDER or wave front shearing interferometry, allow to measure the spectral or spatial phase of a light wave. These two methods are based on the same principle: an interferogram is produced when recombining two sheared replica of a light pulse, spectrally (SPIDER) or spatially (wave front shearing interferometry). This enables the comparison of two neighbouring different spectral or spatial slices of the original wave packet. In the experiment, a train of attosecond pulses is focused in an Argon atomic gas jet. EWPs are produced from the single XUV photon ionization of Argon atoms. If an IR beam is synchronized to the EWPs, it is possible to introduce a shear in momentum space between two consecutive s wave packets. A Velocity Map Imaging Spectrometer (VMIS) enables us to detect the interference pattern. An analysis of the interferograms will be presented leading to a conclusion about the symmetry of the studied wave packet.

Schedule Matters: Understanding the Relationship between Schedule Delays and Costs on Overruns

Science.gov (United States)

Majerowicz, Walt; Shinn, Stephen A.

2016-01-01

This paper examines the relationship between schedule delays and cost overruns on complex projects. It is generally accepted by many project practitioners that cost overruns are directly related to schedule delays. But what does "directly related to" actually mean? Some reasons or root causes for schedule delays and associated cost overruns are obvious, if only in hindsight. For example, unrealistic estimates, supply chain difficulties, insufficient schedule margin, technical problems, scope changes, or the occurrence of risk events can negatively impact schedule performance. Other factors driving schedule delays and cost overruns may be less obvious and more difficult to quantify. Examples of these less obvious factors include project complexity, flawed estimating assumptions, over-optimism, political factors, "black swan" events, or even poor leadership and communication. Indeed, is it even possible the schedule itself could be a source of delay and subsequent cost overrun? Through literature review, surveys of project practitioners, and the authors' own experience on NASA programs and projects, the authors will categorize and examine the various factors affecting the relationship between project schedule delays and cost growth. The authors will also propose some ideas for organizations to consider to help create an awareness of the factors which could cause or influence schedule delays and associated cost growth on complex projects.

1×4 Optical packet switching of variable length 640 Gbit/s data packets using in-band optical notch-filter labeling

DEFF Research Database (Denmark)

Medhin, Ashenafi Kiros; Kamchevska, Valerija; Galili, Michael

2014-01-01

We experimentally perform 1×4 optical packet switching of variable length 640 Gbit/s OTDM data packets using in-band notch-filter labeling with only 2.7-dB penalty. Up to 8 notches are employed to demonstrate scalability of the labeling scheme to 1×256 switching operation.......We experimentally perform 1×4 optical packet switching of variable length 640 Gbit/s OTDM data packets using in-band notch-filter labeling with only 2.7-dB penalty. Up to 8 notches are employed to demonstrate scalability of the labeling scheme to 1×256 switching operation....

Grooming. Instructor's Packet. Learning Activity Package.

Science.gov (United States)

Stark, Pamela

This instructor's packet accompanies the learning activity package (LAP) on grooming. Contents included in the packet are a time sheet, suggested uses for the LAP, an instruction sheet, final LAP reviews, a final LAP review answer key, suggested activities, an additional resources list, and student completion cards to issue to students as an…

Multi-Objective Approach for Energy-Aware Workflow Scheduling in Cloud Computing Environments

Directory of Open Access Journals (Sweden)

Sonia Yassa

2013-01-01

Full Text Available We address the problem of scheduling workflow applications on heterogeneous computing systems like cloud computing infrastructures. In general, the cloud workflow scheduling is a complex optimization problem which requires considering different criteria so as to meet a large number of QoS (Quality of Service requirements. Traditional research in workflow scheduling mainly focuses on the optimization constrained by time or cost without paying attention to energy consumption. The main contribution of this study is to propose a new approach for multi-objective workflow scheduling in clouds, and present the hybrid PSO algorithm to optimize the scheduling performance. Our method is based on the Dynamic Voltage and Frequency Scaling (DVFS technique to minimize energy consumption. This technique allows processors to operate in different voltage supply levels by sacrificing clock frequencies. This multiple voltage involves a compromise between the quality of schedules and energy. Simulation results on synthetic and real-world scientific applications highlight the robust performance of the proposed approach.

Multi-Objective Approach for Energy-Aware Workflow Scheduling in Cloud Computing Environments

Science.gov (United States)

Kadima, Hubert; Granado, Bertrand

2013-01-01

We address the problem of scheduling workflow applications on heterogeneous computing systems like cloud computing infrastructures. In general, the cloud workflow scheduling is a complex optimization problem which requires considering different criteria so as to meet a large number of QoS (Quality of Service) requirements. Traditional research in workflow scheduling mainly focuses on the optimization constrained by time or cost without paying attention to energy consumption. The main contribution of this study is to propose a new approach for multi-objective workflow scheduling in clouds, and present the hybrid PSO algorithm to optimize the scheduling performance. Our method is based on the Dynamic Voltage and Frequency Scaling (DVFS) technique to minimize energy consumption. This technique allows processors to operate in different voltage supply levels by sacrificing clock frequencies. This multiple voltage involves a compromise between the quality of schedules and energy. Simulation results on synthetic and real-world scientific applications highlight the robust performance of the proposed approach. PMID:24319361

German Cultural Packets 13 and 14.

Science.gov (United States)

Atlanta Public Schools, GA.

These German culture packets are designed to accompany A-LM Level II and include a statement of the rationale behind the unit, the objectives of the packet, the activities themselves, and a brief evaluation by the student. The activities involve the use of the basic text, the student workbook, corresponding tapes, and fellow students as partners…

All-optical signal processing for optical packet switching networks

NARCIS (Netherlands)

Liu, Y.; Hill, M.T.; Calabretta, N.; Tangdiongga, E.; Geldenhuys, R.; Zhang, S.; Li, Z.; Waardt, de H.; Khoe, G.D.; Dorren, H.J.S.; Iftekharuddin, K.M.; awwal, A.A.S.

2005-01-01

We discuss how all-optical signal processing might play a role in future all-optical packet switched networks. We introduce a concept of optical packet switches that employ entirely all-optical signal processing technology. The optical packet switch is made out of three functional blocks: the

Sampled-Data Consensus of Linear Multi-agent Systems With Packet Losses.

Science.gov (United States)

Zhang, Wenbing; Tang, Yang; Huang, Tingwen; Kurths, Jurgen

In this paper, the consensus problem is studied for a class of multi-agent systems with sampled data and packet losses, where random and deterministic packet losses are considered, respectively. For random packet losses, a Bernoulli-distributed white sequence is used to describe packet dropouts among agents in a stochastic way. For deterministic packet losses, a switched system with stable and unstable subsystems is employed to model packet dropouts in a deterministic way. The purpose of this paper is to derive consensus criteria, such that linear multi-agent systems with sampled-data and packet losses can reach consensus. By means of the Lyapunov function approach and the decomposition method, the design problem of a distributed controller is solved in terms of convex optimization. The interplay among the allowable bound of the sampling interval, the probability of random packet losses, and the rate of deterministic packet losses are explicitly derived to characterize consensus conditions. The obtained criteria are closely related to the maximum eigenvalue of the Laplacian matrix versus the second minimum eigenvalue of the Laplacian matrix, which reveals the intrinsic effect of communication topologies on consensus performance. Finally, simulations are given to show the effectiveness of the proposed results.In this paper, the consensus problem is studied for a class of multi-agent systems with sampled data and packet losses, where random and deterministic packet losses are considered, respectively. For random packet losses, a Bernoulli-distributed white sequence is used to describe packet dropouts among agents in a stochastic way. For deterministic packet losses, a switched system with stable and unstable subsystems is employed to model packet dropouts in a deterministic way. The purpose of this paper is to derive consensus criteria, such that linear multi-agent systems with sampled-data and packet losses can reach consensus. By means of the Lyapunov function

Joint Scheduling for Dual-Hop Block-Fading Broadcast Channels

KAUST Repository

Zafar, Ammar

2012-09-16

In this paper, we propose joint user-and-hop scheduling over dual-hop block-fading broadcast channels in order to exploit multi-user diversity gains and multi-hop diversity gains all together. To achieve this objective, the first and second hops are scheduled opportunistically based on the channel state information and as a prerequisite we assume that the relay, which is half-duplex and operates using decode-and-forward, is capable of storing the received packets from the source until the channel condition of the destined user becomes good to be scheduled. We formulate the joint scheduling problem as maximizing the weighted sum of the long term achievable rates by the users under a stability constraint, which means that on the long term the rate received by the relay should equal the rate transmitted by it, in addition to constant or variable power constraints. We show that this problem is equivalent to a single-hop broadcast channel by treating the source as a virtual user with an optimal priority weight that maintains the stability constraint. We show how to obtain the source weight either off-line based on channel statistics or on real-time based on channel measurements. Furthermore, we consider special cases including the maximum sum rate scheduler and the proportional fair scheduler. We demonstrate via numerical results that our proposed joint scheduling scheme enlarges the rate region as compared with a scheme that employs multi-user scheduling alone.

An Autonomous Self-Aware and Adaptive Fault Tolerant Routing Technique for Wireless Sensor Networks

Science.gov (United States)

Abba, Sani; Lee, Jeong-A

2015-01-01

We propose an autonomous self-aware and adaptive fault-tolerant routing technique (ASAART) for wireless sensor networks. We address the limitations of self-healing routing (SHR) and self-selective routing (SSR) techniques for routing sensor data. We also examine the integration of autonomic self-aware and adaptive fault detection and resiliency techniques for route formation and route repair to provide resilience to errors and failures. We achieved this by using a combined continuous and slotted prioritized transmission back-off delay to obtain local and global network state information, as well as multiple random functions for attaining faster routing convergence and reliable route repair despite transient and permanent node failure rates and efficient adaptation to instantaneous network topology changes. The results of simulations based on a comparison of the ASAART with the SHR and SSR protocols for five different simulated scenarios in the presence of transient and permanent node failure rates exhibit a greater resiliency to errors and failure and better routing performance in terms of the number of successfully delivered network packets, end-to-end delay, delivered MAC layer packets, packet error rate, as well as efficient energy conservation in a highly congested, faulty, and scalable sensor network. PMID:26295236

Predictive scheduling approach in Inter-piconet communications

DEFF Research Database (Denmark)

Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun

2001-01-01

mobile devices. Originally it was developed as cable replacement. For the time being, it has been used as a mobile ad hoc network, which is intended for both voice and data communications, e.g. voice traffics, TCP/IP data traffics.. . Knowledge on mobile ad hoc network will be in need of studying...... delivered to end users in Bluetooth networks depends on large number of parameters at different levels, e.g. link capacity, packet delays.., which require various control and optimization methods. In this pa-per, an important part of inter-connected communications, inter-piconet scheduling, is mentioned...

Predictive scheduling approach in Inter-piconet communications

DEFF Research Database (Denmark)

Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun

mobile devices. Originally it was developed as cable replacement. For the time being, it has been used as a mobile ad hoc network, which is intended for both voice and data communications, e.g. voice traffics, TCP/IP data traffics.. . Knowledge on mobile ad hoc network will be in need of studying...... delivered to end users in Bluetooth networks depends on large number of parameters at different levels, e.g. link capacity, packet delays.., which require various control and optimization methods. In this pa-per, an important part of inter-connected communications, inter-piconet scheduling, is mentioned...

All-optical devices for ultrafast packet switching

DEFF Research Database (Denmark)

Dorren, H.J.S.; HerreraDorren, J.; Raz, O.

2007-01-01

We discuss integrated devices for all-optical packet switching. We focus on monolithically integrated all-optical flip-flops, ultra-fast semiconductor based wavelength converters and explain the operation principles. Finally, a 160 Gb/s all-optical packet switching experiment over 110 km of field...

Collaborative Distributed Scheduling Approaches for Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Zhidong Deng

2009-10-01

Full Text Available Energy constraints restrict the lifetime of wireless sensor networks (WSNs with battery-powered nodes, which poses great challenges for their large scale application. In this paper, we propose a family of collaborative distributed scheduling approaches (CDSAs based on the Markov process to reduce the energy consumption of a WSN. The family of CDSAs comprises of two approaches: a one-step collaborative distributed approach and a two-step collaborative distributed approach. The approaches enable nodes to learn the behavior information of its environment collaboratively and integrate sleep scheduling with transmission scheduling to reduce the energy consumption. We analyze the adaptability and practicality features of the CDSAs. The simulation results show that the two proposed approaches can effectively reduce nodes’ energy consumption. Some other characteristics of the CDSAs like buffer occupation and packet delay are also analyzed in this paper. We evaluate CDSAs extensively on a 15-node WSN testbed. The test results show that the CDSAs conserve the energy effectively and are feasible for real WSNs.

160 Gbit/s optical packet switching using a silicon chip

DEFF Research Database (Denmark)

Hu, Hao; Ji, Hua; Galili, Michael

2012-01-01

We have successfully demonstrated 160 Gbit/s all-optical packet switching based on cross-phase modulation using a silicon chip. Error free performance is achieved for the 4-to-1 switched 160 Gbit/s packet.......We have successfully demonstrated 160 Gbit/s all-optical packet switching based on cross-phase modulation using a silicon chip. Error free performance is achieved for the 4-to-1 switched 160 Gbit/s packet....

Effects of wireless packet loss in industrial process control systems.

Science.gov (United States)

Liu, Yongkang; Candell, Richard; Moayeri, Nader

2017-05-01

controller to the burstiness of packet loss is also characterized in different process stages. The performance results indicate that wireless links with redundant bandwidth reservation can meet the requirements of the TE process model under normal operational conditions. When disturbances are introduced in the TE plant model, wireless packet loss during transitions between process stages need further protection in severely impaired links. Techniques such as retransmission scheduling, multipath routing and enhanced physical layer design are discussed and the latest industrial wireless protocols are compared. Published by Elsevier Ltd.

High-speed packet filtering utilizing stream processors

Science.gov (United States)

Hummel, Richard J.; Fulp, Errin W.

2009-04-01

Parallel firewalls offer a scalable architecture for the next generation of high-speed networks. While these parallel systems can be implemented using multiple firewalls, the latest generation of stream processors can provide similar benefits with a significantly reduced latency due to locality. This paper describes how the Cell Broadband Engine (CBE), a popular stream processor, can be used as a high-speed packet filter. Results show the CBE can potentially process packets arriving at a rate of 1 Gbps with a latency less than 82 μ-seconds. Performance depends on how well the packet filtering process is translated to the unique stream processor architecture. For example the method used for transmitting data and control messages among the pseudo-independent processor cores has a significant impact on performance. Experimental results will also show the current limitations of a CBE operating system when used to process packets. Possible solutions to these issues will be discussed.

Microwave Ionization of an Atomic Electron Wave Packet

International Nuclear Information System (INIS)

Noel, Michael W.; Ko, Lung; Gallagher, T. F.

2001-01-01

A short microwave pulse is used to ionize a lithium Rydberg wave packet launched from the core at a well-defined phase of the field. We observe a strong dependence on the relative phase between the motion of the wave packet and the oscillations of the field. This phase dependent ionization is also studied as a function of the relative frequency. Our experimental observations are in good qualitative agreement with a one-dimensional classical model of wave packet ionization

Modeling a content-aware LTE MAC downlink scheduler with heterogeneous traffic

DEFF Research Database (Denmark)

Artuso, Matteo; Christiansen, Henrik Lehrmann

2013-01-01

The scheduling policy adopted in the LTE (Long Term Evolution) MAC layer is the most valuable degree of freedom left from the 3GPP (3rd Generation Partnership Project) consortium to the industry and the research community . This paper presents an OPNET model of the downlink scheduling in a one...

Oral Hygiene. Instructor's Packet. Learning Activity Package.

Science.gov (United States)

Hime, Kirsten

This instructor's packet accompanies the learning activity package (LAP) on oral hygiene. Contents included in the packet are a time sheet, suggested uses for the LAP, an instruction sheet, final LAP reviews, a final LAP review answer key, suggested activities, additional resources (student handouts), student performance checklists for both…

Disk Operating System--DOS. Teacher Packet. Learning Activity Packets.

Science.gov (United States)

Oklahoma State Dept. of Vocational and Technical Education, Stillwater. Curriculum and Instructional Materials Center.

The Learning Activity Packets (LAPs) contained in this manual are designed to assist the beginning user in understanding DOS (Disk Operating System). LAPs will not work with any version below DOS Version 3.0 and do not address the enhanced features of versions 4.0 or higher. These elementary activities cover only the DOS commands necessary to…

Dynamic scheduling and analysis of real time systems with multiprocessors

Directory of Open Access Journals (Sweden)

M.D. Nashid Anjum

2016-08-01

Full Text Available This research work considers a scenario of cloud computing job-shop scheduling problems. We consider m realtime jobs with various lengths and n machines with different computational speeds and costs. Each job has a deadline to be met, and the profit of processing a packet of a job differs from other jobs. Moreover, considered deadlines are either hard or soft and a penalty is applied if a deadline is missed where the penalty is considered as an exponential function of time. The scheduling problem has been formulated as a mixed integer non-linear programming problem whose objective is to maximize net-profit. The formulated problem is computationally hard and not solvable in deterministic polynomial time. This research work proposes an algorithm named the Tube-tap algorithm as a solution to this scheduling optimization problem. Extensive simulation shows that the proposed algorithm outperforms existing solutions in terms of maximizing net-profit and preserving deadlines.

A Novel Energy Efficient Topology Control Scheme Based on a Coverage-Preserving and Sleep Scheduling Model for Sensor Networks

OpenAIRE

Shi, Binbin; Wei, Wei; Wang, Yihuai; Shu, Wanneng

2016-01-01

In high-density sensor networks, scheduling some sensor nodes to be in the sleep mode while other sensor nodes remain active for monitoring or forwarding packets is an effective control scheme to conserve energy. In this paper, a Coverage-Preserving Control Scheduling Scheme (CPCSS) based on a cloud model and redundancy degree in sensor networks is proposed. Firstly, the normal cloud model is adopted for calculating the similarity degree between the sensor nodes in terms of their historical d...

A multi-ring optical packet and circuit integrated network with optical buffering.

Science.gov (United States)

Furukawa, Hideaki; Shinada, Satoshi; Miyazawa, Takaya; Harai, Hiroaki; Kawasaki, Wataru; Saito, Tatsuhiko; Matsunaga, Koji; Toyozumi, Tatuya; Wada, Naoya

2012-12-17

We newly developed a 3 × 3 integrated optical packet and circuit switch-node. Optical buffers and burst-mode erbium-doped fiber amplifiers with the gain flatness are installed in the 3 × 3 switch-node. The optical buffer can prevent packet collisions and decrease packet loss. We constructed a multi-ring optical packet and circuit integrated network testbed connecting two single-ring networks and a client network by the 3 × 3 switch-node. For the first time, we demonstrated 244 km fiber transmission and 5-node hopping of multiplexed 14-wavelength 10 Gbps optical paths and 100 Gbps optical packets encapsulating 10 Gigabit Ethernet frames on the testbed. Error-free (frame error rate optical packets of various packet lengths. In addition, successful avoidance of packet collisions by optical buffers was confirmed.

41 CFR 101-39.306 - Operator's packet.

Science.gov (United States)

2010-07-01

...-INTERAGENCY FLEET MANAGEMENT SYSTEMS 39.3-Use and Care of GSA Interagency Fleet Management System Vehicles § 101-39.306 Operator's packet. The GSA Interagency Fleet Management System (IFMS) will provide each... 41 Public Contracts and Property Management 2 2010-07-01 2010-07-01 true Operator's packet. 101-39...

A Heuristic Task Scheduling Algorithm for Heterogeneous Virtual Clusters

Directory of Open Access Journals (Sweden)

Weiwei Lin

2016-01-01

Full Text Available Cloud computing provides on-demand computing and storage services with high performance and high scalability. However, the rising energy consumption of cloud data centers has become a prominent problem. In this paper, we first introduce an energy-aware framework for task scheduling in virtual clusters. The framework consists of a task resource requirements prediction module, an energy estimate module, and a scheduler with a task buffer. Secondly, based on this framework, we propose a virtual machine power efficiency-aware greedy scheduling algorithm (VPEGS. As a heuristic algorithm, VPEGS estimates task energy by considering factors including task resource demands, VM power efficiency, and server workload before scheduling tasks in a greedy manner. We simulated a heterogeneous VM cluster and conducted experiment to evaluate the effectiveness of VPEGS. Simulation results show that VPEGS effectively reduced total energy consumption by more than 20% without producing large scheduling overheads. With the similar heuristic ideology, it outperformed Min-Min and RASA with respect to energy saving by about 29% and 28%, respectively.

A IEEE 802.11e HCCA Scheduler with a Reclaiming Mechanism for Multimedia Applications

Directory of Open Access Journals (Sweden)

Anna Lina Ruscelli

2014-01-01

Full Text Available The QoS offered by the IEEE 802.11e reference scheduler is satisfactory in the case of Constant Bit Rate traffic streams, but not yet in the case of Variable Bit Rate traffic streams, whose variations stress its scheduling behavior. Despite the numerous proposed alternative schedulers with QoS, multimedia applications are looking for refined methods suitable to ensure service differentiation and dynamic update of protocol parameters. In this paper a scheduling algorithm, Unused Time Shifting Scheduler (UTSS, is deeply analyzed. It is designed to cooperate with a HCCA centralized real-time scheduler through the integration of a bandwidth reclaiming scheme, suitable to recover nonexhausted transmission time and assign that to the next polled stations. UTSS dynamically computes with an O(1 complexity transmission time providing an instantaneous resource overprovisioning. The theoretical analysis and the simulation results highlight that this injection of resources does not affect the admission control nor the centralized scheduler but is suitable to improve the performance of the centralized scheduler in terms of mean access delay, transmission queues length, bursts of traffic management, and packets drop rate. These positive effects are more relevant for highly variable bit rate traffic.

A time-frequency analysis of wave packet fractional revivals

International Nuclear Information System (INIS)

Ghosh, Suranjana; Banerji, J

2007-01-01

We show that the time-frequency analysis of the autocorrelation function is, in many ways, a more appropriate tool to resolve fractional revivals of a wave packet than the usual time-domain analysis. This advantage is crucial in reconstructing the initial state of the wave packet when its coherent structure is short-lived and decays before it is fully revived. Our calculations are based on the model example of fractional revivals in a Rydberg wave packet of circular states. We end by providing an analytical investigation which fully agrees with our numerical observations on the utility of time-frequency analysis in the study of wave packet fractional revivals

Wave-packet revivals for quantum systems with nondegenerate energies

International Nuclear Information System (INIS)

Bluhm, R.; Tudose, B.

1996-01-01

The revival structure of wave packets is examined for quantum systems having energies that depend on two nondegenerate quantum numbers. For such systems, the evolution of the wave packet is controlled by two classical periods and three revival times. These wave packets exhibit quantum beats in the initial motion as well as new types of long-term revivals. The issue of whether fractional revivals can form is addressed. We present an analytical proof showing that at certain times equal to rational fractions of the revival times the wave packet can reform as a sum of subsidiary waves and that both conventional and new types of fractional revivals can occur. (orig.)

The School Schedule--Servant or Mistress?

Science.gov (United States)

Holmes, Mark

1984-01-01

Pointing out that time is a dimension of school wealth, the author explores its use in school schedules. Administrators need to be aware of the relationship between time allocation and learning consequences. (MD)

Dispersionless wave packets in Dirac materials

International Nuclear Information System (INIS)

Jakubský, Vít; Tušek, Matěj

2017-01-01

We show that a wide class of quantum systems with translational invariance can host dispersionless, soliton-like, wave packets. We focus on the setting where the effective, two-dimensional Hamiltonian acquires the form of the Dirac operator. The proposed framework for construction of the dispersionless wave packets is illustrated on silicene-like systems with topologically nontrivial effective mass. Our analytical predictions are accompanied by a numerical analysis and possible experimental realizations are discussed.

Dance Theatre of Harlem--Theater Activity Packet.

Science.gov (United States)

New York City Board of Education, Brooklyn, NY. Div. of Curriculum and Instruction.

Intended to complement the New York City communication arts curriculum, this packet introduces young students, guided by the classroom teacher, to a dress rehearsal performance of the Dance Theatre of Harlem ballet company. The packet is one of a series in the "Early Stages" program, a joint effort of the Mayor's Office of Film, Theater…

Random linear network coding for streams with unequally sized packets

DEFF Research Database (Denmark)

Taghouti, Maroua; Roetter, Daniel Enrique Lucani; Pedersen, Morten Videbæk

2016-01-01

State of the art Random Linear Network Coding (RLNC) schemes assume that data streams generate packets with equal sizes. This is an assumption that results in the highest efficiency gains for RLNC. A typical solution for managing unequal packet sizes is to zero-pad the smallest packets. However, ...

Coulomb Final State Interactions for Gaussian Wave Packets

CERN Document Server

Wiedemann, Urs Achim; Heinz, Ulrich W

1999-01-01

Two-particle like-sign and unlike-sign correlations including Coulomb final state interactions are calculated for Gaussian wave packets emitted from a Gaussian source. We show that the width of the wave packets can be fully absorbed into the spatial and momentum space widths of an effective emission function for plane wave states, and that Coulomb final state interaction effects are sensitive only to the latter, but not to the wave packet width itself. Results from analytical and numerical calculations are compared with recently published work by other authors.

Aeroacoustic directivity via wave-packet analysis of mean or base flows

Science.gov (United States)

Edstrand, Adam; Schmid, Peter; Cattafesta, Louis

2017-11-01

Noise pollution is an ever-increasing problem in society, and knowledge of the directivity patterns of the sound radiation is required for prediction and control. Directivity is frequently determined through costly numerical simulations of the flow field combined with an acoustic analogy. We introduce a new computationally efficient method of finding directivity for a given mean or base flow field using wave-packet analysis (Trefethen, PRSA 2005). Wave-packet analysis approximates the eigenvalue spectrum with spectral accuracy by modeling the eigenfunctions as wave packets. With the wave packets determined, we then follow the method of Obrist (JFM, 2009), which uses Lighthill's acoustic analogy to determine the far-field sound radiation and directivity of wave-packet modes. We apply this method to a canonical jet flow (Gudmundsson and Colonius, JFM 2011) and determine the directivity of potentially unstable wave packets. Furthermore, we generalize the method to consider a three-dimensional flow field of a trailing vortex wake. In summary, we approximate the disturbances as wave packets and extract the directivity from the wave-packet approximation in a fraction of the time of standard aeroacoustic solvers. ONR Grant N00014-15-1-2403.

Electron Rydberg wave packets in one-dimensional atoms

Indian Academy of Sciences (India)

produced by the application of a single impulsive kick was explicitly demonstrated. The undulation of ..... In this context, let us divide the wave packet .... wave packet with special attention to the time evolution of its components associ- ated with ...

A multi-function IEC 61850 packet generator based on FPGA

International Nuclear Information System (INIS)

Wei, Wei; Li, Hong-bin; Cheng, Han-miao

2016-01-01

An IEC 61850 packet generator is used to produce IEC 61850-9-2 packets by simulating the merging unit and testing the IEC 61850 digital device. While the existing IEC packet generator can produce ideal digital without any noise, it does not take into account the fact that the merging unit output signal packets will be inevitably superimposed with noise. Since the International Electrical Commission standard of the electronic current transformer specifies the minimum output signal-to-noise ratio of the merging unit to be 30 dB, and the signal superimposed with noise will influence the operation performance of the digital device, it is necessary to design a multi-function IEC 61850-9-2 packet generator for a digital device test. Therefore, in this paper, a multi-function IEC 61850 packet generator has been developed, which not only can output various IEC 61850-9-2 packets, but also can add white Gaussian noise to the signal for digital device testing. By testing three digital electricity meters from different manufacturers, we showed that the error of the digital electricity meter is significantly larger when the signal packet is superimposed with noise. Also when the signal-to-noise ration is 30 dB, the error of one of the meters exceeds the allowed range of the accuracy class. This indicates that the noise testing and the noise setting function of the system has an important role in the testing of a digital device. (paper)

Label-controlled optical packet routing technologies and applications

DEFF Research Database (Denmark)

Koonen, A.M.J.; Yan, N.; Vegas Olmos, Juan José

2007-01-01

An overview is given of various optical packet labeling techniques. The architecture and technologies are discussed for optical packet routing nodes using orthogonal labeling with optoelectronic label processing, and for nodes using time-serial labeling with all-optical time-serial label processing...

Hierarchy Bayesian model based services awareness of high-speed optical access networks

Science.gov (United States)

Bai, Hui-feng

2018-03-01

As the speed of optical access networks soars with ever increasing multiple services, the service-supporting ability of optical access networks suffers greatly from the shortage of service awareness. Aiming to solve this problem, a hierarchy Bayesian model based services awareness mechanism is proposed for high-speed optical access networks. This approach builds a so-called hierarchy Bayesian model, according to the structure of typical optical access networks. Moreover, the proposed scheme is able to conduct simple services awareness operation in each optical network unit (ONU) and to perform complex services awareness from the whole view of system in optical line terminal (OLT). Simulation results show that the proposed scheme is able to achieve better quality of services (QoS), in terms of packet loss rate and time delay.

Multiwavelet packets and frame packets of L2( d)

Indian Academy of Sciences (India)

Springer Verlag Heidelberg #4 2048 1996 Dec 15 10:16:45

For a nice exposition of wavelet packets of L2( ) with dilation 2, see [11]. ..... p∈ d hr lm(ξ)cjp. {. ∑ q∈ d. ˆϕm(ξ + 2qπ) ˆϕj (ξ + 2qπ). } ·e−i〈k,Bξ〉 e i〈p, ξ〉 dξ ...... [14] Rudin W, Fourier Analysis on Groups (New York: John Wiley and Sons) (1962).

Compressed Domain Packet Loss Concealment of Sinusoidally Coded Speech

DEFF Research Database (Denmark)

Rødbro, Christoffer A.; Christensen, Mads Græsbøll; Andersen, Søren Vang

2003-01-01

We consider the problem of packet loss concealment for voice over IP (VoIP). The speech signal is compressed at the transmitter using a sinusoidal coding scheme working at 8 kbit/s. At the receiver, packet loss concealment is carried out working directly on the quantized sinusoidal parameters......, based on time-scaling of the packets surrounding the missing ones. Subjective listening tests show promising results indicating the potential of sinusoidal speech coding for VoIP....

Controlled Quantum Packets

Science.gov (United States)

DeMartino, Salvatore; DeSiena, Silvio

1996-01-01

We look at time evolution of a physical system from the point of view of dynamical control theory. Normally we solve motion equation with a given external potential and we obtain time evolution. Standard examples are the trajectories in classical mechanics or the wave functions in Quantum Mechanics. In the control theory, we have the configurational variables of a physical system, we choose a velocity field and with a suited strategy we force the physical system to have a well defined evolution. The evolution of the system is the 'premium' that the controller receives if he has adopted the right strategy. The strategy is given by well suited laboratory devices. The control mechanisms are in many cases non linear; it is necessary, namely, a feedback mechanism to retain in time the selected evolution. Our aim is to introduce a scheme to obtain Quantum wave packets by control theory. The program is to choose the characteristics of a packet, that is, the equation of evolution for its centre and a controlled dispersion, and to give a building scheme from some initial state (for example a solution of stationary Schroedinger equation). It seems natural in this view to use stochastic approach to Quantum Mechanics, that is, Stochastic Mechanics [S.M.]. It is a quantization scheme different from ordinary ones only formally. This approach introduces in quantum theory the whole mathematical apparatus of stochastic control theory. Stochastic Mechanics, in our view, is more intuitive when we want to study all the classical-like problems. We apply our scheme to build two classes of quantum packets both derived generalizing some properties of coherent states.

Wave packet construction in three-dimensional quantum billiards

Indian Academy of Sciences (India)

We examine the dynamical evolution of wave packets in a cubical billiard where three quantum numbers (, , ) determine its energy spectrum and consequently its dynamical behaviour. We have constructed the wave packet in the cubical billiard and have observed its time evolution for various closed orbits.

Quantum wave-packet revivals in circular billiards

International Nuclear Information System (INIS)

Robinett, R.W.; Heppelmann, S.

2002-01-01

We examine the long-term time dependence of Gaussian wave packets in a circular infinite well (billiard) system and find that there are approximate revivals. For the special case of purely m=0 states (central wave packets with no momentum) the revival time is T rev (m=0) =8μR 2 /(ℎ/2π)π, where μ is the mass of the particle, and the revivals are almost exact. For all other wave packets, we find that T rev (m≠0) =(π 2 /2)T rev (m=0) ≅5T rev (m=0) and the nature of the revivals becomes increasingly approximate as the average angular momentum or number of m≠0 states is increased. The dependence of the revival structure on the initial position, energy, and angular momentum of the wave packet and the connection to the energy spectrum is discussed in detail. The results are also compared to two other highly symmetrical two-dimensional infinite well geometries with exact revivals, namely, the square and equilateral triangle billiards. We also show explicitly how the classical periodicity for closed orbits in a circular billiard arises from the energy eigenvalue spectrum, using a WKB analysis

Exact wave packet decoherence dynamics in a discrete spectrum environment

International Nuclear Information System (INIS)

Tu, Matisse W Y; Zhang Weimin

2008-01-01

We find an exact analytical solution of the reduced density matrix from the Feynman-Vernon influence functional theory for a wave packet in an environment containing a few discrete modes. We obtain two intrinsic energy scales relating to the time scales of the system and the environment. The different relationship between these two scales alters the overall form of the solution of the system. We also introduce a decoherence measure for a single wave packet which is defined as the ratio of Schroedinger uncertainty over the delocalization extension of the wave packet and characterizes the time-evolution behaviour of the off-diagonal reduced density matrix element. We utilize the exact solution and the decoherence measure to study the wave packet decoherence dynamics. We further demonstrate how the dynamical diffusion of the wave packet leads to non-Markovian decoherence in such a microscopic environment.

Physical Watermarking for Securing Cyber-Physical Systems via Packet Drop Injections

Energy Technology Data Exchange (ETDEWEB)

Ozel, Omur [Carnegie Mellon Univ., Pittsburgh, PA (United States); Weekrakkody, Sean [Carnegie Mellon Univ., Pittsburgh, PA (United States); Sinopoli, Bruno [Carnegie Mellon Univ., Pittsburgh, PA (United States)

2017-10-23

Physical watermarking is a well known solution for detecting integrity attacks on Cyber-Physical Systems (CPSs) such as the smart grid. Here, a random control input is injected into the system in order to authenticate physical dynamics and sensors which may have been corrupted by adversaries. Packet drops may naturally occur in a CPS due to network imperfections. To our knowledge, previous work has not considered the role of packet drops in detecting integrity attacks. In this paper, we investigate the merit of injecting Bernoulli packet drops into the control inputs sent to actuators as a new physical watermarking scheme. With the classical linear quadratic objective function and an independent and identically distributed packet drop injection sequence, we study the effect of packet drops on meeting security and control objectives. Our results indicate that the packet drops could act as a potential physical watermark for attack detection in CPSs.

Performance Analysis and Optimization for Cognitive Radio Networks with Classified Secondary Users and Impatient Packets

Directory of Open Access Journals (Sweden)

Yuan Zhao

2017-01-01

Full Text Available A cognitive radio network with classified Secondary Users (SUs is considered. There are two types of SU packets, namely, SU1 packets and SU2 packets, in the system. The SU1 packets have higher priority than the SU2 packets. Considering the diversity of the SU packets and the real-time need of the interrupted SU packets, a novel spectrum allocation strategy with classified SUs and impatient packets is proposed. Based on the number of PU packets, SU1 packets, and SU2 packets in the system, by modeling the queue dynamics of the networks users as a three-dimensional discrete-time Markov chain, the transition probability matrix of the Markov chain is given. Then with the steady-state analysis, some important performance measures of the SU2 packets are derived to show the system performance with numerical results. Specially, in order to optimize the system actions of the SU2 packets, the individually optimal strategy and the socially optimal strategy for the SU2 packets are demonstrated. Finally, a pricing mechanism is provided to oblige the SU2 packets to follow the socially optimal strategy.

Analytical Evaluation of the Performance of Proportional Fair Scheduling in OFDMA-Based Wireless Systems

Directory of Open Access Journals (Sweden)

Mohamed H. Ahmed

2012-01-01

Full Text Available This paper provides an analytical evaluation of the performance of proportional fair (PF scheduling in Orthogonal Frequency-Division Multiple Access (OFDMA wireless systems. OFDMA represents a promising multiple access scheme for transmission over wireless channels, as it combines the orthogonal frequency division multiplexing (OFDM modulation and subcarrier allocation. On the other hand, the PF scheduling is an efficient resource allocation scheme with good fairness characteristics. Consequently, OFDMA with PF scheduling represents an attractive solution to deliver high data rate services to multiple users simultaneously with a high degree of fairness. We investigate a two-dimensional (time slot and frequency subcarrier PF scheduling algorithm for OFDMA systems and evaluate its performance analytically and by simulations. We derive approximate closed-form expressions for the average throughput, throughput fairness index, and packet delay. Computer simulations are used for verification. The analytical results agree well with the results from simulations, which show the good accuracy of the analytical expressions.

MODELLING AND VERIFICATION OF KITSAT PACKET COMMUNICATION PROTOCOLS

Directory of Open Access Journals (Sweden)

Young-Ro Lee

1996-06-01

Full Text Available In this paper, in order to verify KITSAT 1/2 packet communication protocols, we model the AX.25 protocol and PACSAT protocol by using an extended Petri net and then verify the correctness, boundedness, liveness and deadlock freeness of packet protocols by utilizing reachability trees.

Do Free Quantum-Mechanical Wave Packets Always Spread?

Science.gov (United States)

Klein, James R.

1980-01-01

The spreading or shrinking of free three-dimensional quantum-mechanical wave packets is addressed. A seeming paradox concerning the time evolution operator and nonspreading wave packets is discussed, and the necessity of taking into account the appropriate mathematical structure of quantum mechanics is emphasized. Teaching implications are given.…

Transfer of a wave packet in double-well potential

Science.gov (United States)

Yang, Hai-Feng; Hu, Yao-Hua; Tan, Yong-Gang

2018-04-01

Energy potentials with double-well structures are typical in atoms and molecules systems. A manipulation scheme using Half Cycles Pulses (HCPs) is proposed to transfer a Gaussian wave packet between the two wells. On the basis of quantum mechanical simulations, the time evolution and the energy distribution of the wave packet are evaluated. The effect of time parameters, amplitude, and number of HCPs on spatial and energy distribution of the final state and transfer efficiency are investigated. After a carefully tailored HCPs sequence is applied to the initial wave packet localized in one well, the final state is a wave packet localized in the other well and populated at the lower energy levels with narrower distribution. The present scheme could be used to control molecular reactions and to prepare atoms with large dipole moments.

Joint Connection and Packet level Analysis in W-CDMA Radio Interface

DEFF Research Database (Denmark)

Benetis, Vilius; Popova, Larissa; Iversen, Villy Bæk

2007-01-01

algorithm which defines the feasible state space at packet level. At packet level we take into consideration wireless interference (soft blocking). The traffic is modeled as multi-rate Binomial-Poisson-Pascal (BPP-) traffic at connection level and on-off traffic at packet level. We obtain individual...

Planning and scheduling - A schedule's performance

International Nuclear Information System (INIS)

Whitman, N.M.

1993-01-01

Planning and scheduling is a process whose time has come to PSI Energy. With an awareness of the challenges ahead, individuals must look for ways to enhance the corporate competitiveness. Working toward this goal means that each individual has to dedicate themselves to this more competitive corporate environment. Being competitive may be defined as the ability of each employee to add value to the corporation's economic well being. The timely and successful implementation of projects greatly enhances competitiveness. Those projects that do not do well often suffer from lack of proper execution - not for lack of talent or strategic vision. Projects are consumers of resources such as cash and people. They produce a return when completed and will generate a better return when properly completed utilizing proven project management techniques. Completing projects on time, within budget and meeting customer expectations is the way a corporation builds it's future. This paper offers suggestions on implementing planning and scheduling and provides a review of results in the form of management reports

An investigation of low ergonomics risk awareness, among staffs at early product development phase in Malaysia automotive industries

Science.gov (United States)

Aziz, Fazilah Abdul; Razali, Noraini; Najmiyah Jaafar, Nur

2016-02-01

Currently there are many automotive companies still unable to effectively prevent consequences of poor ergonomics in their manufacturing processes. This study purpose is to determine the surrounding factors that influence low ergonomics risk awareness among staffs at early product development phase in Malaysia automotive industry. In this study there are four variables, low ergonomic risk awareness, inappropriate method and tools, tight development schedule and lack of management support. The survey data were gathered from 245 respondents of local automotive companies in Malaysia. The data was analysed through multiple regression and moderated regression using the IBM SPSS software. Study results revealed that low ergonomic risk awareness has influenced by inappropriate method and tool, and tight development schedule. There were positive linear relationships between low ergonomic risk awareness and inappropriate method and tools, and tight development schedule. The more inappropriate method and tools applied; the lower their ergonomic risk awareness. The more tight development schedule is the lower ergonomic risk awareness. The relationship between low ergonomic risk awareness and inappropriate method and tools depends on staff's age, and education level. Furthermore the relationship between low ergonomic risk awareness and tight development schedule depends on staff's working experience and number of project involvement. The main contribution of this paper was identified the number of factors of low ergonomics risk awareness and offers better understanding on ergonomics among researchers and automotive manufacturer's employees during product development process.

Energy Efficient Medium Access Control Protocol for Clustered Wireless Sensor Networks with Adaptive Cross-Layer Scheduling.

Science.gov (United States)

Sefuba, Maria; Walingo, Tom; Takawira, Fambirai

2015-09-18

This paper presents an Energy Efficient Medium Access Control (MAC) protocol for clustered wireless sensor networks that aims to improve energy efficiency and delay performance. The proposed protocol employs an adaptive cross-layer intra-cluster scheduling and an inter-cluster relay selection diversity. The scheduling is based on available data packets and remaining energy level of the source node (SN). This helps to minimize idle listening on nodes without data to transmit as well as reducing control packet overhead. The relay selection diversity is carried out between clusters, by the cluster head (CH), and the base station (BS). The diversity helps to improve network reliability and prolong the network lifetime. Relay selection is determined based on the communication distance, the remaining energy and the channel quality indicator (CQI) for the relay cluster head (RCH). An analytical framework for energy consumption and transmission delay for the proposed MAC protocol is presented in this work. The performance of the proposed MAC protocol is evaluated based on transmission delay, energy consumption, and network lifetime. The results obtained indicate that the proposed MAC protocol provides improved performance than traditional cluster based MAC protocols.

Angular momentum transport with twisted exciton wave packets

Science.gov (United States)

Zang, Xiaoning; Lusk, Mark T.

2017-10-01

A chain of cofacial molecules with CN or CN h symmetry supports excitonic states with a screwlike structure. These can be quantified with the combination of an axial wave number and an azimuthal winding number. Combinations of these states can be used to construct excitonic wave packets that spiral down the chain with well-determined linear and angular momenta. These twisted exciton wave packets can be created and annihilated using laser pulses, and their angular momentum can be optically modified during transit. This allows for the creation of optoexcitonic circuits in which information, encoded in the angular momentum of light, is converted into excitonic wave packets that can be manipulated, transported, and then reemitted. A tight-binding paradigm is used to demonstrate the key ideas. The approach is then extended to quantify the evolution of twisted exciton wave packets in a many-body, multilevel time-domain density functional theory setting. In both settings, numerical methods are developed that allow the site-to-site transfer of angular momentum to be quantified.

Packet Classification by Multilevel Cutting of the Classification Space: An Algorithmic-Architectural Solution for IP Packet Classification in Next Generation Networks

Directory of Open Access Journals (Sweden)

Motasem Aldiab

2008-01-01

Full Text Available Traditionally, the Internet provides only a “best-effort” service, treating all packets going to the same destination equally. However, providing differentiated services for different users based on their quality requirements is increasingly becoming a demanding issue. For this, routers need to have the capability to distinguish and isolate traffic belonging to different flows. This ability to determine the flow each packet belongs to is called packet classification. Technology vendors are reluctant to support algorithmic solutions for classification due to their nondeterministic performance. Although content addressable memories (CAMs are favoured by technology vendors due to their deterministic high-lookup rates, they suffer from the problems of high-power consumption and high-silicon cost. This paper provides a new algorithmic-architectural solution for packet classification that mixes CAMs with algorithms based on multilevel cutting of the classification space into smaller spaces. The provided solution utilizes the geometrical distribution of rules in the classification space. It provides the deterministic performance of CAMs, support for dynamic updates, and added flexibility for system designers.

MDTM: Optimizing Data Transfer using Multicore-Aware I/O Scheduling

Energy Technology Data Exchange (ETDEWEB)

Zhang, Liang [Fermilab; Demar, Phil [Fermilab; Wu, Wenji [Fermilab; Kim, Bockjoo [Florida U.

2017-05-09

Bulk data transfer is facing significant challenges in the coming era of big data. There are multiple performance bottlenecks along the end-to-end path from the source to destination storage system. The limitations of current generation data transfer tools themselves can have a significant impact on end-to-end data transfer rates. In this paper, we identify the issues that lead to underperformance of these tools, and present a new data transfer tool with an innovative I/O scheduler called MDTM. The MDTM scheduler exploits underlying multicore layouts to optimize throughput by reducing delay and contention for I/O reading and writing operations. With our evaluations, we show how MDTM successfully avoids NUMA-based congestion and significantly improves end-to-end data transfer rates across high-speed wide area networks.

MDTM: Optimizing Data Transfer using Multicore-Aware I/O Scheduling

Energy Technology Data Exchange (ETDEWEB)

Zhang, Liang [Fermilab; Demar, Phil [Fermilab; Wu, Wenji [Fermilab; Kim, Bockjoo [Florida U.

2017-01-01

Bulk data transfer is facing significant challenges in the coming era of big data. There are multiple performance bottlenecks along the end-to-end path from the source to destination storage system. The limitations of current generation data transfer tools themselves can have a significant impact on end-to-end data transfer rates. In this paper, we identify the issues that lead to underperformance of these tools, and present a new data transfer tool with an innovative I/O scheduler called MDTM. The MDTM scheduler exploits underlying multicore layouts to optimize throughput by reducing delay and contention for I/O reading and writing operations. With our evaluations, we show how MDTM successfully avoids NUMA-based congestion and significantly improves end-to-end data transfer rates across high-speed wide area networks.

Self-Awareness of Cloud Applications

NARCIS (Netherlands)

Iosup, Alexandru; Zhu, Xiaoyun; Merchant, Arif; Kalyvianaki, Eva; Maggio, Martina; Spinner, Simon; Abdelzaher, Tarek; Mengshoel, Ole; Bouchenak, Sara

2016-01-01

Cloud applications today deliver an increasingly larger portion of the Information and Communication Technology (ICT) services. To address the scale, growth, and reliability of cloud applications, self-aware management and scheduling are becoming commonplace. How are they used in practice? In this

Adaptive Subframe Partitioning and Efficient Packet Scheduling in OFDMA Cellular System with Fixed Decode-and-Forward Relays

Science.gov (United States)

Wang, Liping; Ji, Yusheng; Liu, Fuqiang

The integration of multihop relays with orthogonal frequency-division multiple access (OFDMA) cellular infrastructures can meet the growing demands for better coverage and higher throughput. Resource allocation in the OFDMA two-hop relay system is more complex than that in the conventional single-hop OFDMA system. With time division between transmissions from the base station (BS) and those from relay stations (RSs), fixed partitioning of the BS subframe and RS subframes can not adapt to various traffic demands. Moreover, single-hop scheduling algorithms can not be used directly in the two-hop system. Therefore, we propose a semi-distributed algorithm called ASP to adjust the length of every subframe adaptively, and suggest two ways to extend single-hop scheduling algorithms into multihop scenarios: link-based and end-to-end approaches. Simulation results indicate that the ASP algorithm increases system utilization and fairness. The max carrier-to-interference ratio (Max C/I) and proportional fairness (PF) scheduling algorithms extended using the end-to-end approach obtain higher throughput than those using the link-based approach, but at the expense of more overhead for information exchange between the BS and RSs. The resource allocation scheme using ASP and end-to-end PF scheduling achieves a tradeoff between system throughput maximization and fairness.

E-model MOS Estimate Improvement through Jitter Buffer Packet Loss Modelling

Directory of Open Access Journals (Sweden)

Adrian Kovac

2011-01-01

Full Text Available Proposed article analyses dependence of MOS as a voice call quality (QoS measure estimated through ITU-T E-model under real network conditions with jitter. In this paper, a method of jitter effect is proposed. Jitter as voice packet time uncertainty appears as increased packet loss caused by jitter memory buffer under- or overflow. Jitter buffer behaviour at receiver’s side is modelled as Pareto/D/1/K system with Pareto-distributed packet interarrival times and its performance is experimentally evaluated by using statistic tools. Jitter buffer stochastic model is then incorporated into E-model in an additive manner accounting for network jitter effects via excess packet loss complementing measured network packet loss. Proposed modification of E-model input parameter adds two degrees of freedom in modelling: network jitter and jitter buffer size.

Observation of moving wave packets reveals their quantum state

International Nuclear Information System (INIS)

Leonhardt, U.; Raymer, M.G.

1996-01-01

We show how to infer the quantum state of a wave packet from position probability distributions measured during the packet close-quote s motion in an arbitrary potential. We assume a nonrelativistic one-dimensional or radial wave packet. Temporal Fourier transformation and spatial sampling with respect to a newly found set of functions project the density-matrix elements out of the probability distributions. The sampling functions are derivatives of products of regular and irregular wave functions. We note that the ability to infer quantum states in this way depends on the structure of the Schroedinger equation. copyright 1996 The American Physical Society

The Evolution and Revival Structure of Localized Quantum Wave Packets

OpenAIRE

Bluhm, Robert; Kostelecky, Alan; Porter, James

1995-01-01

Localized quantum wave packets can be produced in a variety of physical systems and are the subject of much current research in atomic, molecular, chemical, and condensed-matter physics. They are particularly well suited for studying the classical limit of a quantum-mechanical system. The motion of a localized quantum wave packet initially follows the corresponding classical motion. However, in most cases the quantum wave packet spreads and undergoes a series of collapses and revivals. We pre...

Systematic Sampling and Cluster Sampling of Packet Delays

OpenAIRE

Lindh, Thomas

2006-01-01

Based on experiences of a traffic flow performance meter this papersuggests and evaluates cluster sampling and systematic sampling as methods toestimate average packet delays. Systematic sampling facilitates for exampletime analysis, frequency analysis and jitter measurements. Cluster samplingwith repeated trains of periodically spaced sampling units separated by randomstarting periods, and systematic sampling are evaluated with respect to accuracyand precision. Packet delay traces have been ...

Cross-Layer Scheduling and Resource Allocation for Heterogeneous Traffic in 3G LTE

Directory of Open Access Journals (Sweden)

Richard Musabe

2014-01-01

Full Text Available 3G long term evolution (LTE introduces stringent needs in order to provide different kinds of traffic with Quality of Service (QoS characteristics. The major problem with this nature of LTE is that it does not have any paradigm scheduling algorithm that will ideally control the assignment of resources which in turn will improve the user satisfaction. This has become an open subject and different scheduling algorithms have been proposed which are quite challenging and complex. To address this issue, in this paper, we investigate how our proposed algorithm improves the user satisfaction for heterogeneous traffic, that is, best-effort traffic such as file transfer protocol (FTP and real-time traffic such as voice over internet protocol (VoIP. Our proposed algorithm is formulated using the cross-layer technique. The goal of our proposed algorithm is to maximize the expected total user satisfaction (total-utility under different constraints. We compared our proposed algorithm with proportional fair (PF, exponential proportional fair (EXP-PF, and U-delay. Using simulations, our proposed algorithm improved the performance of real-time traffic based on throughput, VoIP delay, and VoIP packet loss ratio metrics while PF improved the performance of best-effort traffic based on FTP traffic received, FTP packet loss ratio, and FTP throughput metrics.

Long-term evolution and revival structure of Rydberg wave packets

International Nuclear Information System (INIS)

Bluhm, R.

1995-01-01

It is known that, after formation, a Rydberg wave packet undergoes a series of collapses and revivals within a time period called the revival time, t rev , at the end of which it is close to its original shape. We study the behavior of Rydberg wave packets on time scales much greater than t rev . We show that after a few revival cycles the wave packet ceases to reform at multiples of the revival time. Instead, a new series of collapses and revivals commences, culminating after a time period t sr >>t rev with the formation of a wave packet that more closely resembles the initial packet than does the full revival at time t rev . Furthermore, at times that are rational fractions of t sr , the square of the autocorrelation function exhibits large peaks with periodicities that can be expressed as fractions of the revival time t rev . These periodicities indicate a new type of fractional revival occurring for times much greater than t rev . A theoretical explanation of these effects is outlined. ((orig.))

Phase Structure of Strong-Field Tunneling Wave Packets from Molecules.

Science.gov (United States)

Liu, Ming-Ming; Li, Min; Wu, Chengyin; Gong, Qihuang; Staudte, André; Liu, Yunquan

2016-04-22

We study the phase structure of the tunneling wave packets from strong-field ionization of molecules and present a molecular quantum-trajectory Monte Carlo model to describe the laser-driven dynamics of photoelectron momentum distributions of molecules. Using our model, we reproduce and explain the alignment-dependent molecular frame photoelectron spectra of strong-field tunneling ionization of N_{2} reported by M. Meckel et al. [Nat. Phys. 10, 594 (2014)]. In addition to modeling the low-energy photoelectron angular distributions quantitatively, we extract the phase structure of strong-field molecular tunneling wave packets, shedding light on its physical origin. The initial phase of the tunneling wave packets at the tunnel exit depends on both the initial transverse momentum distribution and the molecular internuclear distance. We further show that the ionizing molecular orbital has a critical effect on the initial phase of the tunneling wave packets. The phase structure of the photoelectron wave packet is a key ingredient for modeling strong-field molecular photoelectron holography, high-harmonic generation, and molecular orbital imaging.

Numerical simulation of the nonlinear dynamics of packets of spiral density waves

International Nuclear Information System (INIS)

Korchagin, V.I.

1987-01-01

In a numerical experiment, the behavior of nonlinear packets of spiral density waves in a gas disk has been investigated for different initial wave amplitudes. If the amplitude of the density perturbations is small (<5%), the wave packet is drawn toward the center or toward the periphery of the disk in accordance with the linear theory. The behavior of linear packets of waves with wavelength comparable to the disk radius (R/sub d//lambda = 4) exhibits good agreement with the conclusions of the linear theory of tightly wound spiral waves. The dynamics of wave packets with initial density amplitudes 16, 30, 50% demonstrates the nonlinear nature of the behavior. THe behavior is governed by whether or not the nonlinear effects of higher than third order in the wave amplitude play a part. If the wave packet dynamics is determined by the cubic nonlinearity, the results of the numerical experiment are in qualitative and quantitative agreement with the nonlinear theory of short waves, although the characteristic scale of the packet and the wavelength are of the order of the disk radius. In the cases when the nonlinear effects of higher orders in the amplitude play an important part, the behavior of a packet does not differ qualitatively from the behavior predicted by the theory of cubic nonlinearity, but the nonlinear spreading of the packet takes place more rapidly

Standard services for the capture, processing, and distribution of packetized telemetry data

Science.gov (United States)

Stallings, William H.

1989-01-01

Standard functional services for the capture, processing, and distribution of packetized data are discussed with particular reference to the future implementation of packet processing systems, such as those for the Space Station Freedom. The major functions are listed under the following major categories: input processing, packet processing, and output processing. A functional block diagram of a packet data processing facility is presented, showing the distribution of the various processing functions as well as the primary data flow through the facility.

Analysis Of Packets Delay In Wireless Data Networks

Directory of Open Access Journals (Sweden)

Krivchenkov Aleksandr

2015-12-01

Full Text Available The networks with wireless links for automation control applications traffic transmission when packets have small size and application payload is predictable are under consideration. Analytical model for packets delay on their propagation path through the network is proposed. Estimations for network architectures based on WiFi and Bluetooth wireless technologies are made. The specifications for physical layer 802.11 a/b/g/n and 802.15.1 are under consideration. Analytical and experimental results for delivered network bandwidth for different network architecture, traffic structure and wireless technologies were compared to validate that basic mechanisms are correctly taken into account in the model. It is shown that basic effects are taken into account and further accuracy “improvement” of the model will give not more than 5%. As a result that is important for automation control applications we have reliably received the lowest possible level for packets delay in one wireless link. For 802.11 it is of order of 0.2 ms, for 802.15.1 it is 1.25 ms and is true when application packet can be transferred by one data frame.

Mesoscopic states in graphene in magnetic field: collapse and revival of wave packets

International Nuclear Information System (INIS)

Demikhovskij, V.Ya.; Telezhnikov, A.V.; Frolova, E.V.; Kravets, N.A.

2013-01-01

The effects of wave packet collapse and revival in monolayer and bilayer graphene at an external perpendicular magnetic field are described. The evolution of electron wave packets, which are a superposition of the states with quantum numbers n around that of some Landau level n 0 was studied. The probability densities as well as average velocities of the packet center were calculated analytically and then visualized. The initial wave packet consisting only of positive energy decomposed into several subpackets at the moments t = (m/n)T R , where T R is the revival time and m, n are the mutually prime integers. Besides, it is shown that the behavior of a wave packet containing the states of both energy bands (with E n > 0 and E n < 0) is more complicated. Such packet splits into two parts, which rotate with a cyclotron frequency in the opposite directions, and then experience collapse and revival. The structure of multipole electromagnetic radiation of these packets is analyzed.

Novel approach for all-optical packet switching in wide-area networks

Science.gov (United States)

Chlamtac, Imrich; Fumagalli, Andrea F.; Wedzinga, Gosse

1998-09-01

All-optical Wavelength Division Multiplexing (WDM) networks are believed to be a fundamental component in future high speed backbones. However, while wavelength routing made circuit switching in WDM feasible the reality of extant optical technology does not yet provide the necessary devices to achieve individual optical packet switching. This paper proposes to achieve all-optical packet switching in WDM Wide Area Networks (WANs) via a novel technique, called slot routing. Using slot routing, entire slots, each carrying multiple packets on distinct wavelengths, are switched transparently and individually. As a result packets can be optically transmitted and switched in the network using available fast and wavelength non-sensitive devices. The proposed routing technique leads to an optical packet switching solution, that is simple, practical, and unique as it makes it possible to build a WDM all-optical WAN with optical devices based on proven technologies.

Multiwavelet packet entropy and its application in transmission line fault recognition and classification.

Science.gov (United States)

Liu, Zhigang; Han, Zhiwei; Zhang, Yang; Zhang, Qiaoge

2014-11-01

Multiwavelets possess better properties than traditional wavelets. Multiwavelet packet transformation has more high-frequency information. Spectral entropy can be applied as an analysis index to the complexity or uncertainty of a signal. This paper tries to define four multiwavelet packet entropies to extract the features of different transmission line faults, and uses a radial basis function (RBF) neural network to recognize and classify 10 fault types of power transmission lines. First, the preprocessing and postprocessing problems of multiwavelets are presented. Shannon entropy and Tsallis entropy are introduced, and their difference is discussed. Second, multiwavelet packet energy entropy, time entropy, Shannon singular entropy, and Tsallis singular entropy are defined as the feature extraction methods of transmission line fault signals. Third, the plan of transmission line fault recognition using multiwavelet packet entropies and an RBF neural network is proposed. Finally, the experimental results show that the plan with the four multiwavelet packet energy entropies defined in this paper achieves better performance in fault recognition. The performance with SA4 (symmetric antisymmetric) multiwavelet packet Tsallis singular entropy is the best among the combinations of different multiwavelet packets and the four multiwavelet packet entropies.

A USER－DEPENDENT PERFECT－SCHEDULING MULTIPLE ACCESS PROTOCOL FOR VOICE－DATA INTEGRATION IN WIRELESS NETWORKDS

Institute of Scientific and Technical Information of China (English)

无

2002-01-01

A novel Multiple Access Control(MAC) protocol-User-dependent Perfect-scheduling Multiple Access(UPMA) protocol,which supports joint transmission of voice and data packets,is proposed.By this protocol,the bandwidth can be allocated dynamically to the uplink and downlink traffic with on-demand assignment and the transmission of Mobile Terminals(MTs) can be perfectly scheduled by means of polling.Meanwhile.a unique frame stucture is designed to guarantee Quality of Service(QoS) in voice traffic supporting.An effective colision resolution algorthm is also proposed to guarantee rapid channel access for activated MTs.Finally,performance of UPMA protocol is evaluated by simulation and compared with MPRMA protocol.Simulation results show that UPMA protocol has better performance.

A USER-DEPENDENT PERFECT-SCHEDULING MULTIPLE ACCESS PROTOCOL FOR VOICE-DATA INTEGRATION IN WIRELESS NETWORKS

Institute of Scientific and Technical Information of China (English)

Zhou Yajian; Li Jiandong; Liu Kai

2002-01-01

A novel Multiple Access Control (MAC) protocol - User-dependent Perfect-scheduling Multiple Access (UPMA) protocol, which supports joint transmission of voice and data packets,is proposed. By this protocol, the bandwidth can be allocated dynamically to the uplink and downlink traffic with on-demand assignment and the transmission of Mobile Terminals (MTs)can be perfectly scheduled by means of polling. Meanwhile, a unique frame structure is designed to guarantee Quality of Service (QoS) in voice traffic supporting. An effective collision resolution algorithm is also proposed to guarantee rapid channel access for activated MTs. Finally, performance of UPMA protocol is evaluated by simulation and compared with MPRMA protocol.Simulation results show that UPMA protocol has better performance.

Further Results on Extended Delivery Time for Secondary Packet Transmission

KAUST Repository

Usman, Muneer

2017-07-10

Cognitive radio transceiver can opportunistically access the underutilized spectrum resource of primary systems for new wireless services. With interweave cognitive implementation, secondary transmission may be interrupted by primary transmission. To facilitate the packet delay analysis of such secondary transmission, we study the extended delivery time of secondary packet transmission. In particular, we derive the exact distribution function of extended delivery time of a fixed-size secondary packet with non-work-preserving strategy, where interrupted packets must be repeated. We also analyze the effect of imperfect periodic sensing, i.e., the secondary user periodically senses the spectrum for availability, with a chance of missing an available channel on a certain sensing attempt. These results complement previous work on work-preserving strategy with perfect sensing. Selected numerical and simulation results are presented for verifying the mathematical formulation.

Digital transceiver implementation for wavelet packet modulation

Science.gov (United States)

Lindsey, Alan R.; Dill, Jeffrey C.

1998-03-01

Current transceiver designs for wavelet-based communication systems are typically reliant on analog waveform synthesis, however, digital processing is an important part of the eventual success of these techniques. In this paper, a transceiver implementation is introduced for the recently introduced wavelet packet modulation scheme which moves the analog processing as far as possible toward the antenna. The transceiver is based on the discrete wavelet packet transform which incorporates level and node parameters for generalized computation of wavelet packets. In this transform no particular structure is imposed on the filter bank save dyadic branching, and a maximum level which is specified a priori and dependent mainly on speed and/or cost considerations. The transmitter/receiver structure takes a binary sequence as input and, based on the desired time- frequency partitioning, processes the signal through demultiplexing, synthesis, analysis, multiplexing and data determination completely in the digital domain - with exception of conversion in and out of the analog domain for transmission.

Airy Wave Packets Accelerating in Space-Time

Science.gov (United States)

Kondakci, H. Esat; Abouraddy, Ayman F.

2018-04-01

Although diffractive spreading is an unavoidable feature of all wave phenomena, certain waveforms can attain propagation invariance. A lesser-explored strategy for achieving optical self-similar propagation exploits the modification of the spatiotemporal field structure when observed in reference frames moving at relativistic speeds. For such an observer, it is predicted that the associated Lorentz boost can bring to a halt the axial dynamics of a wave packet of an arbitrary profile. This phenomenon is particularly striking in the case of a self-accelerating beam—such as an Airy beam—whose peak normally undergoes a transverse displacement upon free propagation. Here we synthesize an acceleration-free Airy wave packet that travels in a straight line by deforming its spatiotemporal spectrum to reproduce the impact of a Lorentz boost. The roles of the axial spatial coordinate and time are swapped, leading to "time diffraction" manifested in self-acceleration observed in the propagating Airy wave-packet frame.

Scalable In-Band Optical Notch-Filter Labeling for Ultrahigh Bit Rate Optical Packet Switching

DEFF Research Database (Denmark)

Medhin, Ashenafi Kiros; Galili, Michael; Oxenløwe, Leif Katsuo

2014-01-01

We propose a scalable in-band optical notch-filter labeling scheme for optical packet switching of high-bit-rate data packets. A detailed characterization of the notch-filter labeling scheme and its effect on the quality of the data packet is carried out in simulation and verified by experimental...... demonstrations. The scheme is able to generate more than 91 different labels that can be applied to 640-Gb/s optical time division multiplexed packets causing an eye opening penalty of $1.2-dB. Experimental demonstration shows that up to 256 packets can be uniquely labeled by employing up to eight notch filters...... with only 0.9-dB power penalty to achieve BER of 1E-9. Using the proposed labeling scheme, optical packet switching of 640 Gb/s data packets is experimentally demonstrated in which two data packets are labeled by making none and one spectral hole using a notch filter and are switched using a LiNbO$_3...

Nontraditional work schedules for pharmacists.

Science.gov (United States)

Mahaney, Lynnae; Sanborn, Michael; Alexander, Emily

2008-11-15

Nontraditional work schedules for pharmacists at three institutions are described. The demand for pharmacists and health care in general continues to increase, yet significant material changes are occurring in the pharmacy work force. These changing demographics, coupled with historical vacancy rates and turnover trends for pharmacy staff, require an increased emphasis on workplace changes that can improve staff recruitment and retention. At William S. Middleton Memorial Veterans Affairs Hospital in Madison, Wisconsin, creative pharmacist work schedules and roles are now mainstays to the recruitment and retention of staff. The major challenge that such scheduling presents is the 8 hours needed to prepare a six-week schedule. Baylor Medical Center at Grapevine in Dallas, Texas, has a total of 45 pharmacy employees, and slightly less than half of the 24.5 full-time-equivalent staff work full-time, with most preferring to work one, two, or three days per week. As long as the coverage needs of the facility are met, Envision Telepharmacy in Alpine, Texas, allows almost any scheduling arrangement preferred by individual pharmacists or the pharmacist group covering the facility. Staffing involves a great variety of shift lengths and intervals, with shifts ranging from 2 to 10 hours. Pharmacy leaders must be increasingly aware of opportunities to provide staff with unique scheduling and operational enhancements that can provide for a better work-life balance. Compressed workweeks, job-sharing, and team scheduling were the most common types of alternative work schedules implemented at three different institutions.

An improved packet structure

KAUST Repository

Bader, Ahmed

2014-01-01

A multihop network transmits a packet including a RACH area and a hop number. The RACH area includes a list of subcarriers. A source node in the network dynamically determines the size of the RACH area. A node in the network performs an open-loop transmit power control.

An improved packet structure

KAUST Repository

Bader, Ahmed

2014-05-22

A multihop network transmits a packet including a RACH area and a hop number. The RACH area includes a list of subcarriers. A source node in the network dynamically determines the size of the RACH area. A node in the network performs an open-loop transmit power control.

A real-time architecture for time-aware agents.

Science.gov (United States)

Prouskas, Konstantinos-Vassileios; Pitt, Jeremy V

2004-06-01

This paper describes the specification and implementation of a new three-layer time-aware agent architecture. This architecture is designed for applications and environments where societies of humans and agents play equally active roles, but interact and operate in completely different time frames. The architecture consists of three layers: the April real-time run-time (ART) layer, the time aware layer (TAL), and the application agents layer (AAL). The ART layer forms the underlying real-time agent platform. An original online, real-time, dynamic priority-based scheduling algorithm is described for scheduling the computation time of agent processes, and it is shown that the algorithm's O(n) complexity and scalable performance are sufficient for application in real-time domains. The TAL layer forms an abstraction layer through which human and agent interactions are temporally unified, that is, handled in a common way irrespective of their temporal representation and scale. A novel O(n2) interaction scheduling algorithm is described for predicting and guaranteeing interactions' initiation and completion times. The time-aware predicting component of a workflow management system is also presented as an instance of the AAL layer. The described time-aware architecture addresses two key challenges in enabling agents to be effectively configured and applied in environments where humans and agents play equally active roles. It provides flexibility and adaptability in its real-time mechanisms while placing them under direct agent control, and it temporally unifies human and agent interactions.

Cooperative Position Aware Mobility Pattern of AUVs for Avoiding Void Zones in Underwater WSNs.

Science.gov (United States)

Javaid, Nadeem; Ejaz, Mudassir; Abdul, Wadood; Alamri, Atif; Almogren, Ahmad; Niaz, Iftikhar Azim; Guizani, Nadra

2017-03-13

In this paper, we propose two schemes; position-aware mobility pattern (PAMP) and cooperative PAMP (Co PAMP). The first one is an optimization scheme that avoids void hole occurrence and minimizes the uncertainty in the position estimation of glider's. The second one is a cooperative routing scheme that reduces the packet drop ratio by using the relay cooperation. Both techniques use gliders that stay at sojourn positions for a predefined time, at sojourn position self-confidence (s-confidence) and neighbor-confidence (n-confidence) regions that are estimated for balanced energy consumption. The transmission power of a glider is adjusted according to those confidence regions. Simulation results show that our proposed schemes outperform the compared existing one in terms of packet delivery ratio, void zones and energy consumption.

Quantum chaos induced by nonadiabatic coupling in wave-packet dynamics

International Nuclear Information System (INIS)

Higuchi, Hisashi; Takatsuka, Kazuo

2002-01-01

The effect of nonadiabatic coupling due to breakdown of the Born-Oppenheimer approximation on chaos is investigated. A couple of measures (indicators) that detect the extent of chaos in wave-packet dynamics on coupled potential functions are devised. Using them, we show that chaos is indeed induced by a nonadiabatic coupling in individual time-dependent wave-packet dynamics. This chaos is genuinely of quantum nature, since it arises from bifurcation and merging of a wave packet at the quasicrossing region of two coupled potential functions

Packet Header Compression for the Internet of Things

Directory of Open Access Journals (Sweden)

Pekka KOSKELA

2016-01-01

Full Text Available Due to the extensive growth of Internet of Things (IoT, the number of wireless devices connected to the Internet is forecasted to grow to 26 billion units installed in 2020. This will challenge both the energy efficiency of wireless battery powered devices and the bandwidth of wireless networks. One solution for both challenges could be to utilize packet header compression. This paper reviews different packet compression, and especially packet header compression, methods and studies the performance of Robust Header Compression (ROHC in low speed radio networks such as XBEE, and in high speed radio networks such as LTE and WLAN. In all networks, the compressing and decompressing processing causes extra delay and power consumption, but in low speed networks, energy can still be saved due to the shorter transmission time.

Strongly nonlinear evolution of low-frequency wave packets in a dispersive plasma

Science.gov (United States)

Vasquez, Bernard J.

1993-01-01

The evolution of strongly nonlinear, strongly modulated wave packets is investigated in a dispersive plasma using a hybrid numerical code. These wave packets have amplitudes exceeding the strength of the external magnetic field, along which they propagate. Alfven (left helicity) wave packets show strong steepening for p Schrodinger (DNLS) equation.

Application of Cisco Packet Trace in the Inter-VLAN Communication Teaching%浅析Cisco Packet Tracer在Vlan间通信教学的应用

Institute of Scientific and Technical Information of China (English)

郑耿凡

2014-01-01

Cisco Packet Tracer is a network simulation platform developed by Cisco Company. And Cisco packet tracer 5.3 allows three layer switch vlan communication in the experimental teaching. Real equipment is replaced by the analog simulation software, which solves the problem of lacking teaching experimental equipment in practice and im-proves the quality of teaching.%Cisco packet tracer是由思科公司开发的一个网络模拟辅助平台，在实验教学中可以借助Cisco packet tracer5.3实现三层交换机Vlan间通信，通过模拟防真软件来代替现实的设备，以解决在实践教学中实验设备缺乏的问题，提高教学质量。

Low-Rate DDoS Attack Detection Using Expectation of Packet Size

Directory of Open Access Journals (Sweden)

Lu Zhou

2017-01-01

Full Text Available Low-rate Distributed Denial-of-Service (low-rate DDoS attacks are a new challenge to cyberspace, as the attackers send a large amount of attack packets similar to normal traffic, to throttle legitimate flows. In this paper, we propose a measurement—expectation of packet size—that is based on the distribution difference of the packet size to distinguish two typical low-rate DDoS attacks, the constant attack and the pulsing attack, from legitimate traffic. The experimental results, obtained using a series of real datasets with different times and different tolerance factors, are presented to demonstrate the effectiveness of the proposed measurement. In addition, extensive experiments are performed to show that the proposed measurement can detect the low-rate DDoS attacks not only in the short and long terms but also for low packet rates and high packet rates. Furthermore, the false-negative rates and the adjudication distance can be adjusted based on the detection sensitivity requirements.

160 Gb/s all-optical packet switching field experiment

DEFF Research Database (Denmark)

Dorren, H.J.S.; Herrera, J.; Raz, O.

2007-01-01

We discus an all-optical packet switching experiment over 110 km of field installed optical fiber. The switching node is controlled by solely photonic control circuits.......We discus an all-optical packet switching experiment over 110 km of field installed optical fiber. The switching node is controlled by solely photonic control circuits....

Comparison of a noncausal with a causal relativistic wave-packet evolution

International Nuclear Information System (INIS)

Castro, A.N. de; Jabs, A.

1991-01-01

In order to study causality violation in more detail we contrast the Klein-Gordon wave packet of Rosenstein und Usher with the Dirac wave packet of Bakke and Wergeland. Both packets are initially localized with exponentially bounded tails but just outside the condition of the general Hegerfeldt theorem for causality violation. It turns out that the wave packet of Bakke and Wergeland exhibits all the features investigated by Rosenstein and Usher, except that it never violates relativistic causality. Thus none of those features, in particular the back- and forerunners emerging from the light cone, can be held responsible for causality violation, and the Ruijsenaars integral is not necessarily a measure of the amount of causality violation. (orig.)

IP Traceback through modified Probabilistic Packet Marking algorithm using Chinese Remainder Theorem

Directory of Open Access Journals (Sweden)

Y. Bhavani

2015-06-01

Full Text Available Probabilistic Packet Marking algorithm suggests a methodology to identify all the participated routers of the attack path by probabilistically marking the packets. In this approach, these marked packets contain partial information regarding the routers of the attack path. At receiver, to get the complete information of every router, it requires more number of marked packets and hence more combinations and more false positives. To overcome this drawback we have presented a novel idea in finding the exact IP address of the routers in the attack path by applying Chinese Remainder Theorem. The result of our implementation reveals that our idea requires less number of marked packets and takes no time in constructing the attack path. The same idea is true even in the case of multiple attackers.

Magnetic Helicity Conservation and Inverse Energy Cascade in Electron Magnetohydrodynamic Wave Packets

International Nuclear Information System (INIS)

Cho, Jungyeon

2011-01-01

Electron magnetohydrodynamics (EMHD) provides a fluidlike description of small-scale magnetized plasmas. An EMHD wave propagates along magnetic field lines. The direction of propagation can be either parallel or antiparallel to the magnetic field lines. We numerically study propagation of three-dimensional (3D) EMHD wave packets moving in one direction. We obtain two major results. (1) Unlike its magnetohydrodynamic (MHD) counterpart, an EMHD wave packet is dispersive. Because of this, EMHD wave packets traveling in one direction create opposite-traveling wave packets via self-interaction and cascade energy to smaller scales. (2) EMHD wave packets traveling in one direction clearly exhibit inverse energy cascade. We find that the latter is due to conservation of magnetic helicity. We compare inverse energy cascade in 3D EMHD turbulence and two-dimensional (2D) hydrodynamic turbulence.

Magnetic helicity conservation and inverse energy cascade in electron magnetohydrodynamic wave packets.

Science.gov (United States)

Cho, Jungyeon

2011-05-13

Electron magnetohydrodynamics (EMHD) provides a fluidlike description of small-scale magnetized plasmas. An EMHD wave propagates along magnetic field lines. The direction of propagation can be either parallel or antiparallel to the magnetic field lines. We numerically study propagation of three-dimensional (3D) EMHD wave packets moving in one direction. We obtain two major results. (1) Unlike its magnetohydrodynamic (MHD) counterpart, an EMHD wave packet is dispersive. Because of this, EMHD wave packets traveling in one direction create opposite-traveling wave packets via self-interaction and cascade energy to smaller scales. (2) EMHD wave packets traveling in one direction clearly exhibit inverse energy cascade. We find that the latter is due to conservation of magnetic helicity. We compare inverse energy cascade in 3D EMHD turbulence and two-dimensional (2D) hydrodynamic turbulence.

SDRAM-based packet buffer model for high speed switches

DEFF Research Database (Denmark)

Rasmussen, Anders; Ruepp, Sarah Renée; Berger, Michael Stübert

2011-01-01

based on the specifications of a real-life DDR3-SDRAM chip. Based on this model the performance of different schemes for optimizing the performance of such a packet buffer can be evaluated. The purpose of this study is to find efficient schemes for memory mapping of the packet queues and I/O traffic...

An integrated circuit/packet switched video conferencing system

Energy Technology Data Exchange (ETDEWEB)

Kippenhan Junior, H.A.; Lidinsky, W.P.; Roediger, G.A. [Fermi National Accelerator Lab., Batavia, IL (United States). HEP Network Resource Center; Waits, T.A. [Rutgers Univ., Piscataway, NJ (United States). Dept. of Physics and Astronomy

1996-07-01

The HEP Network Resource Center (HEPNRC) at Fermilab and the Collider Detector Facility (CDF) collaboration have evolved a flexible, cost-effective, widely accessible video conferencing system for use by high energy physics collaborations and others wishing to use video conferencing. No current systems seemed to fully meet the needs of high energy physics collaborations. However, two classes of video conferencing technology: circuit-switched and packet-switched, if integrated, might encompass most of HEPS's needs. It was also realized that, even with this integration, some additional functions were needed and some of the existing functions were not always wanted. HEPNRC with the help of members of the CDF collaboration set out to develop such an integrated system using as many existing subsystems and components as possible. This system is called VUPAC (Video conferencing Using Packets and Circuits). This paper begins with brief descriptions of the circuit-switched and packet-switched video conferencing systems. Following this, issues and limitations of these systems are considered. Next the VUPAC system is described. Integration is accomplished primarily by a circuit/packet video conferencing interface. Augmentation is centered in another subsystem called MSB (Multiport MultiSession Bridge). Finally, there is a discussion of the future work needed in the evolution of this system. (author)

An integrated circuit/packet switched video conferencing system

International Nuclear Information System (INIS)

Kippenhan Junior, H.A.; Lidinsky, W.P.; Roediger, G.A.; Waits, T.A.

1996-01-01

The HEP Network Resource Center (HEPNRC) at Fermilab and the Collider Detector Facility (CDF) collaboration have evolved a flexible, cost-effective, widely accessible video conferencing system for use by high energy physics collaborations and others wishing to use video conferencing. No current systems seemed to fully meet the needs of high energy physics collaborations. However, two classes of video conferencing technology: circuit-switched and packet-switched, if integrated, might encompass most of HEPS's needs. It was also realized that, even with this integration, some additional functions were needed and some of the existing functions were not always wanted. HEPNRC with the help of members of the CDF collaboration set out to develop such an integrated system using as many existing subsystems and components as possible. This system is called VUPAC (Video conferencing Using Packets and Circuits). This paper begins with brief descriptions of the circuit-switched and packet-switched video conferencing systems. Following this, issues and limitations of these systems are considered. Next the VUPAC system is described. Integration is accomplished primarily by a circuit/packet video conferencing interface. Augmentation is centered in another subsystem called MSB (Multiport MultiSession Bridge). Finally, there is a discussion of the future work needed in the evolution of this system. (author)

Election '88: Teacher Packet.

Science.gov (United States)

North Carolina State Dept. of Public Instruction, Raleigh. Div. of Social Studies Education.

This materials packet contains information on teaching about the electoral process and the elections of 1988, and on participation in a mock election for students whose schools would take part in the 1988 North Carolina Mock Election. Suggestions for teachers' preparations are given, including a classroom skit and a mock candidates' election…

WEAMR — A Weighted Energy Aware Multipath Reliable Routing Mechanism for Hotline-Based WSNs

Directory of Open Access Journals (Sweden)

Ki-Hyung Kim

2013-05-01

Full Text Available Reliable source to sink communication is the most important factor for an efficient routing protocol especially in domains of military, healthcare and disaster recovery applications. We present weighted energy aware multipath reliable routing (WEAMR, a novel energy aware multipath routing protocol which utilizes hotline-assisted routing to meet such requirements for mission critical applications. The protocol reduces the number of average hops from source to destination and provides unmatched reliability as compared to well known reactive ad hoc protocols i.e., AODV and AOMDV. Our protocol makes efficient use of network paths based on weighted cost calculation and intelligently selects the best possible paths for data transmissions. The path cost calculation considers end to end number of hops, latency and minimum energy node value in the path. In case of path failure path recalculation is done efficiently with minimum latency and control packets overhead. Our evaluation shows that our proposal provides better end-to-end delivery with less routing overhead and higher packet delivery success ratio compared to AODV and AOMDV. The use of multipath also increases overall life time of WSN network using optimum energy available paths between sender and receiver in WDNs.

Disallowing Same-program Co-schedules to Improve Efficiency in Quad-core Servers

OpenAIRE

de Blanche, Andreas; Lundqvist, Thomas

2017-01-01

Programs running on different cores in a multicore server are often forced to share resources like off-chip memory, caches, I/O devices, etc. This resource sharing often leads to degraded performance, a slowdown, for the programs that share the resources. A job scheduler can improve performance by co-scheduling programs that use different resources on the same server. The most common approach to solve this co-scheduling problem has been to make job-schedulers resource aware, finding ways to c...

Performance of VoIP on HSDPA

DEFF Research Database (Denmark)

Wang, Bang; Pedersen, Klaus I.; Kolding, Troels E.

2005-01-01

This paper provides packet scheduler design and performance simulations for running VoIP services over high-speed downlink packet access (HSDPA) in WCDMA. The main challenge of supporting VoIP service on HSDPA is the tight delay requirement combined with the small VoIP packet size. A packet...... scheduler design incorporating VoIP packet aggregation and user multiplexing is proposed and the VoIP capacity is studied for a macro-cellular environment. Results are obtained for different delay budgets and packet scheduling settings, using either blind round robin or a slightly modified version...... of proportional fair scheduling. For proportional fair scheduling with code-multiplexing of 4-users, the downlink VoIP cell capacity on HSDPA is found to be in the range 72-104 users depending on whether the delay budget for the Node-B scheduling and user reception equals 80 ms or 150 ms, respectively....

Packet throughput performance of multiservice, multirate OCDMA in elastic networks

DEFF Research Database (Denmark)

Raddo, Thiago R.; Sanches, Anderson L.; Tafur Monroy, Idelfonso

2016-01-01

the multiple-access interference (MAI) as binomially distributed. The packet throughput expression, by its turn, is derived considering a Poisson distribution for the composite packet arrivals. Numerical results show that the multicode technique is a good candidate for future multiservice, multirate OCDMA...

Packet loss replacement in voip using a recursive low-order autoregressive modelbased speech

International Nuclear Information System (INIS)

Miralavi, Seyed Reza; Ghorshi, Seyed; Mortazavi, Mohammad; Choupan, Jeiran

2011-01-01

In real-time packet-based communication systems one major problem is misrouted or delayed packets which results in degraded perceived voice quality. When some speech packets are not available on time, the packet is known as lost packet in real-time communication systems. The easiest task of a network terminal receiver is to replace silence for the duration of lost speech segments. In a high quality communication system in order to avoid quality reduction due to packet loss a suitable method and/or algorithm is needed to replace the missing segments of speech. In this paper, we introduce a recursive low order autoregressive (AR) model for replacement of lost speech segment. The evaluation results show that this method has a lower mean square error (MSE) and low complexity compared to the other efficient methods like high-order AR model without any substantial degradation in perceived voice quality.

Final Report - Dynamic Path Scheduling through Extensions to Generalized Multiprotocol Label Switching (GMPLS)

Energy Technology Data Exchange (ETDEWEB)

Principal Investigator: Dr. Abdella Battou

2009-05-22

The major accomplishments of the project are the successful software implementation of the Phase I scheduling algorithms for GMPLS Label Switched Paths (LSPs) and the extension of the IETF Path Computation Element (PCE) Protocol to support scheduling extensions. In performing this work, we have demonstrated the theoretical work of Phase I, analyzed key issues, and made relevant extensions. Regarding the software implementation, we developed a proof of concept prototype as part of our Algorithm Evaluation System (AES). This implementation uses the Linux operating system to provide software portability and will be the foundation for our commercial software. To demonstrate proof of concept, we have implemented LSP scheduling algorithms to support two of the key GMPLS switching technologies (Lambda and Packet) and support both Fixed Path (FP) and Switched Path (SP) routing. We chose Lambda and Packet because we felt it was essential to include both circuit and packet switching technologies as well as to address all-optical switching in the study. As conceptualized in Phase I, the FP algorithms use a traditional approach where the LSP uses the same physical path for the entire service duration while the innovative SP algorithms allow the physical path to vary during the service duration. As part of this study, we have used the AES to conduct a performance analysis using metro size networks (up to 32 nodes) that showed that these algorithms are suitable for commercial implementation. Our results showed that the CPU time required to compute an LSP schedule was small compared to expected inter-arrival time between LSP requests. Also, when the network size increased from 7 to 15 to 32 nodes with 10, 26, and 56 TE links, the CPU processing time showed excellent scaling properties. When Fixed Path and Switched Path routing were compared, SP provided only modestly better performance with respect to LSP completion rate, service duration, path length, and start time deviation

Dynamics of Number of Packets in Transit in Free Flow State of Data Network

International Nuclear Information System (INIS)

Shengkun Xie; Lawniczak, A.T.

2011-01-01

We study how the dynamics of Number of Packets in Transit (NPT) is affected by the coupling of a routing type with a volume of incoming packet traffic in a data network model of packet switching type. The NPT is a network performance indicator of an aggregate type that measures in '' real time '', how many packets are in the network on their routes to their destinations. We conduct our investigation using a time-discrete simulation model that is an abstraction of the Network Layer of the ISO OSI Seven Layer Reference Model. This model focuses on packets and their routing. We consider a static routing and two different types of dynamic routings coupled with different volumes of incoming packet traffic in the network free flow state. Our study shows that the order of the values of the NPT mean value time series depends on the coupling of a routing type with a volume of incoming packet traffic and changes when the volume of incoming packet traffic increases and is closed to the critical source load values, i.e. when it is closed to the phase transition points from the network free flow state to its congested states. (authors)

Trajectory description of the quantum–classical transition for wave packet interference

Energy Technology Data Exchange (ETDEWEB)

Chou, Chia-Chun, E-mail: ccchou@mx.nthu.edu.tw

2016-08-15

The quantum–classical transition for wave packet interference is investigated using a hydrodynamic description. A nonlinear quantum–classical transition equation is obtained by introducing a degree of quantumness ranging from zero to one into the classical time-dependent Schrödinger equation. This equation provides a continuous description for the transition process of physical systems from purely quantum to purely classical regimes. In this study, the transition trajectory formalism is developed to provide a hydrodynamic description for the quantum–classical transition. The flow momentum of transition trajectories is defined by the gradient of the action function in the transition wave function and these trajectories follow the main features of the evolving probability density. Then, the transition trajectory formalism is employed to analyze the quantum–classical transition of wave packet interference. For the collision-like wave packet interference where the propagation velocity is faster than the spreading speed of the wave packet, the interference process remains collision-like for all the degree of quantumness. However, the interference features demonstrated by transition trajectories gradually disappear when the degree of quantumness approaches zero. For the diffraction-like wave packet interference, the interference process changes continuously from a diffraction-like to collision-like case when the degree of quantumness gradually decreases. This study provides an insightful trajectory interpretation for the quantum–classical transition of wave packet interference.

An On-Time Power-Aware Scheduling Scheme for Medical Sensor SoC-Based WBAN Systems

Science.gov (United States)

Hwang, Tae-Ho; Kim, Dong-Sun; Kim, Jung-Guk

2013-01-01

The focus of many leading technologies in the field of medical sensor systems is on low power consumption and robust data transmission. For example, the implantable cardioverter-defibrillator (ICD), which is used to maintain the heart in a healthy state, requires a reliable wireless communication scheme with an extremely low duty-cycle, high bit rate, and energy-efficient media access protocols. Because such devices must be sustained for over 5 years without access to battery replacement, they must be designed to have extremely low power consumption in sleep mode. Here, an on-time, energy-efficient scheduling scheme is proposed that performs power adjustments to minimize the sleep-mode current. The novelty of this scheduler is that it increases the determinacy of power adjustment and the predictability of scheduling by employing non-pre-emptible dual priority scheduling. This predictable scheduling also guarantees the punctuality of important periodic tasks based on their serialization, by using their worst case execution time) and the power consumption optimization. The scheduler was embedded into a system on chip (SoC) developed to support the wireless body area network—a wakeup-radio and wakeup-timer for implantable medical devices. This scheduling system is validated by the experimental results of its performance when used with life-time extensions of ICD devices. PMID:23271602

An on-time power-aware scheduling scheme for medical sensor SoC-based WBAN systems.

Science.gov (United States)

Hwang, Tae-Ho; Kim, Dong-Sun; Kim, Jung-Guk

2012-12-27

The focus of many leading technologies in the field of medical sensor systems is on low power consumption and robust data transmission. For example, the implantable cardioverter-defibrillator (ICD), which is used to maintain the heart in a healthy state, requires a reliable wireless communication scheme with an extremely low duty-cycle, high bit rate, and energy-efficient media access protocols. Because such devices must be sustained for over 5 years without access to battery replacement, they must be designed to have extremely low power consumption in sleep mode. Here, an on-time, energy-efficient scheduling scheme is proposed that performs power adjustments to minimize the sleep-mode current. The novelty of this scheduler is that it increases the determinacy of power adjustment and the predictability of scheduling by employing non-pre-emptible dual priority scheduling. This predictable scheduling also guarantees the punctuality of important periodic tasks based on their serialization, by using their worst case execution time) and the power consumption optimization. The scheduler was embedded into a system on chip (SoC) developed to support the wireless body area network-a wakeup-radio and wakeup-timer for implantable medical devices. This scheduling system is validated by the experimental results of its performance when used with life-time extensions of ICD devices.

New hybrid frequency reuse method for packet loss minimization in LTE network.

Science.gov (United States)

Ali, Nora A; El-Dakroury, Mohamed A; El-Soudani, Magdi; ElSayed, Hany M; Daoud, Ramez M; Amer, Hassanein H

2015-11-01

This paper investigates the problem of inter-cell interference (ICI) in Long Term Evolution (LTE) mobile systems, which is one of the main problems that causes loss of packets between the base station and the mobile station. Recently, different frequency reuse methods, such as soft and fractional frequency reuse, have been introduced in order to mitigate this type of interference. In this paper, minimizing the packet loss between the base station and the mobile station is the main concern. Soft Frequency Reuse (SFR), which is the most popular frequency reuse method, is examined and the amount of packet loss is measured. In order to reduce packet loss, a new hybrid frequency reuse method is implemented. In this method, each cell occupies the same bandwidth of the SFR, but the total system bandwidth is greater than in SFR. This will provide the new method with a lot of new sub-carriers from the neighboring cells to reduce the ICI which represents a big problem in many applications and causes a lot of packets loss. It is found that the new hybrid frequency reuse method has noticeable improvement in the amount of packet loss compared to SFR method in the different frequency bands. Traffic congestion management in Intelligent Transportation system (ITS) is one of the important applications that is affected by the packet loss due to the large amount of traffic that is exchanged between the base station and the mobile node. Therefore, it is used as a studied application for the proposed frequency reuse method and the improvement in the amount of packet loss reached 49.4% in some frequency bands using the new hybrid frequency reuse method.

Computationally Efficient Neural Network Intrusion Security Awareness

Energy Technology Data Exchange (ETDEWEB)

Todd Vollmer; Milos Manic

2009-08-01

An enhanced version of an algorithm to provide anomaly based intrusion detection alerts for cyber security state awareness is detailed. A unique aspect is the training of an error back-propagation neural network with intrusion detection rule features to provide a recognition basis. Network packet details are subsequently provided to the trained network to produce a classification. This leverages rule knowledge sets to produce classifications for anomaly based systems. Several test cases executed on ICMP protocol revealed a 60% identification rate of true positives. This rate matched the previous work, but 70% less memory was used and the run time was reduced to less than 1 second from 37 seconds.

Cooperative Position Aware Mobility Pattern of AUVs for Avoiding Void Zones in Underwater WSNs

Science.gov (United States)

Javaid, Nadeem; Ejaz, Mudassir; Abdul, Wadood; Alamri, Atif; Almogren, Ahmad; Niaz, Iftikhar Azim; Guizani, Nadra

2017-01-01

In this paper, we propose two schemes; position-aware mobility pattern (PAMP) and cooperative PAMP (Co PAMP). The first one is an optimization scheme that avoids void hole occurrence and minimizes the uncertainty in the position estimation of glider’s. The second one is a cooperative routing scheme that reduces the packet drop ratio by using the relay cooperation. Both techniques use gliders that stay at sojourn positions for a predefined time, at sojourn position self-confidence (s-confidence) and neighbor-confidence (n-confidence) regions that are estimated for balanced energy consumption. The transmission power of a glider is adjusted according to those confidence regions. Simulation results show that our proposed schemes outperform the compared existing one in terms of packet delivery ratio, void zones and energy consumption. PMID:28335377

Cooperative Position Aware Mobility Pattern of AUVs for Avoiding Void Zones in Underwater WSNs

Directory of Open Access Journals (Sweden)

Nadeem Javaid

2017-03-01

Full Text Available In this paper, we propose two schemes; position-aware mobility pattern (PAMP and cooperative PAMP (Co PAMP. The first one is an optimization scheme that avoids void hole occurrence and minimizes the uncertainty in the position estimation of glider’s. The second one is a cooperative routing scheme that reduces the packet drop ratio by using the relay cooperation. Both techniques use gliders that stay at sojourn positions for a predefined time, at sojourn position self-confidence (s-confidence and neighbor-confidence (n-confidence regions that are estimated for balanced energy consumption. The transmission power of a glider is adjusted according to those confidence regions. Simulation results show that our proposed schemes outperform the compared existing one in terms of packet delivery ratio, void zones and energy consumption.

Personal Skills. Facilitator's Skill Packets 1-7. Social Skills Training.

Science.gov (United States)

Model Classrooms, Bellevue, WA.

This document contains the following seven facilitators' skill packets on personal skills: (1) personal hygiene; (2) personal appearance; (3) locker hygiene; (4) dorm cleanliness; (5) punctuality and attendance; (6) responding to supervision; and (7) teamwork. Each packet contains the following sections: definition of personal skills; objective;…

Packetized Predictive Control for Rate-Limited Networks via Sparse Representation

DEFF Research Database (Denmark)

Nagahara, Masaaki; Quevedo, Daniel; Østergaard, Jan

2012-01-01

controller and the plant input. To achieve robustness with respect to dropouts, the controller transmits data packets containing plant input predictions, which minimize a finite horizon cost function. In our formulation, we design sparse packets for rate-limited networks, by adopting an an ℓ0 optimization...

Wave packet formulation of the boomerang model for resonant electron--molecule scattering

International Nuclear Information System (INIS)

McCurdy, C.W.; Turner, J.L.

1983-01-01

A time-dependent formulation of the boomerang model for resonant electron--molecule scattering is presented in terms of a wave packet propagating on the complex potential surface of the metastable anion. The results of calculations using efficient semiclassical techniques for propagating the wave packet are found to be in excellent agreement with full quantum-mechanical calculations of vibrational excitation cross sections in e - --N 2 scattering. The application of the wave packet formulation as a computational and conceptual approach to the problem of resonant collisions with polyatomic molecules is discussed in the light of recent wave packet calculations on polyatomic photodissociation and Raman spectra

SIMULASI JARINGAN KOMPUTER MENGGUNAKAN CISCO PACKET TRACER

Directory of Open Access Journals (Sweden)

M Mufadhol

2012-01-01

Full Text Available Perkembangan jaringan komputer saat ini begitu pesat, monitoring jaringan komputer akan menjadi suatu hal yang sulit dan rumit. Koneksi jaringan komputer merupakan suatu hal yang mendasar dalam suatu jaringan, karena bila koneksi itu bermasalah maka semua jenis aplikasi yang dijalankan melalui jaringan komputer tidak dapat digunakan. Cisco packet tracer dapat digunakan untuk simulasi yang mencerminkan arsitektur dan juga model dari jaringan komputer pada sistem jaringan yang digunakan. Dengan menggunakan aplikasi cisco packet tracer, simulasi mengenai jaringan dapat dimanfaatkan menjadi informasi tentang keadaan koneksi komputer dalam suatu jaringan.

Controlling the spreading of wave packets of a dissociating molecule

DEFF Research Database (Denmark)

Tiwari, Ashwani Kumar; Møller, Klaus Braagaard; Henriksen, Niels Engholm

2007-01-01

A first-order perturbation theoretic approach within the electric-dipole approximation is used to study the time evolution of wave packets created by linearly chirped laser pulses on a repulsive potential of Br-2. Our calculations show that negatively chirped pulses focus the wave packet in the F...

A Heuristic Task Scheduling Algorithm for Heterogeneous Virtual Clusters

OpenAIRE

Weiwei Lin; Wentai Wu; James Z. Wang

2016-01-01

Cloud computing provides on-demand computing and storage services with high performance and high scalability. However, the rising energy consumption of cloud data centers has become a prominent problem. In this paper, we first introduce an energy-aware framework for task scheduling in virtual clusters. The framework consists of a task resource requirements prediction module, an energy estimate module, and a scheduler with a task buffer. Secondly, based on this framework, we propose a virtual ...

Scalable Packet Classification with Hash Tables

Science.gov (United States)

Wang, Pi-Chung

In the last decade, the technique of packet classification has been widely deployed in various network devices, including routers, firewalls and network intrusion detection systems. In this work, we improve the performance of packet classification by using multiple hash tables. The existing hash-based algorithms have superior scalability with respect to the required space; however, their search performance may not be comparable to other algorithms. To improve the search performance, we propose a tuple reordering algorithm to minimize the number of accessed hash tables with the aid of bitmaps. We also use pre-computation to ensure the accuracy of our search procedure. Performance evaluation based on both real and synthetic filter databases shows that our scheme is effective and scalable and the pre-computation cost is moderate.

An On-Time Power-Aware Scheduling Scheme for Medical Sensor SoC-Based WBAN Systems

Directory of Open Access Journals (Sweden)

Jung-Guk Kim

2012-12-01

Full Text Available The focus of many leading technologies in the field of medical sensor systems is on low power consumption and robust data transmission. For example, the implantable cardioverter-defibrillator (ICD, which is used to maintain the heart in a healthy state, requires a reliable wireless communication scheme with an extremely low duty-cycle, high bit rate, and energy-efficient media access protocols. Because such devices must be sustained for over 5 years without access to battery replacement, they must be designed to have extremely low power consumption in sleep mode. Here, an on-time, energy-efficient scheduling scheme is proposed that performs power adjustments to minimize the sleep-mode current. The novelty of this scheduler is that it increases the determinacy of power adjustment and the predictability of scheduling by employing non-pre-emptible dual priority scheduling. This predictable scheduling also guarantees the punctuality of important periodic tasks based on their serialization, by using their worst case execution time and the power consumption optimization. The scheduler was embedded into a system on chip (SoC developed to support the wireless body area network—a wakeup-radio and wakeup-timer for implantable medical devices. This scheduling system is validated by the experimental results of its performance when used with life-time extensions of ICD devices.

Non-intrusive Packet-Layer Model for Monitoring Video Quality of IPTV Services

Science.gov (United States)

Yamagishi, Kazuhisa; Hayashi, Takanori

Developing a non-intrusive packet-layer model is required to passively monitor the quality of experience (QoE) during service. We propose a packet-layer model that can be used to estimate the video quality of IPTV using quality parameters derived from transmitted packet headers. The computational load of the model is lighter than that of the model that takes video signals and/or video-related bitstream information such as motion vectors as input. This model is applicable even if the transmitted bitstream information is encrypted because it uses transmitted packet headers rather than bitstream information. For developing the model, we conducted three extensive subjective quality assessments for different encoders and decoders (codecs), and video content. Then, we modeled the subjective video quality assessment characteristics based on objective features affected by coding and packet loss. Finally, we verified the model's validity by applying our model to unknown data sets different from training data sets used above.

Foreign Material in the Gastrointestinal Tract: Cocaine Packets

Directory of Open Access Journals (Sweden)

Nurten Turkel Kucukmetin

2014-01-01

Full Text Available Smuggling drugs by swallowing or inserting into a body cavity is not only a serious and growing international crime, but can also lead to lethal medical complications. The most common cause of death in ‘body packers', people transporting drugs by ingesting a packet into the gastrointestinal tract, is acute drug toxicity from a ruptured packet. However, more than 30 years after the initial report of body packing, there is still no definitive treatment protocol for the management of this patient group. The treatment strategy is determined according to the particular condition of the patient and the clinical experience of the treatment center. Surgical intervention is also less common now, due to both the use of improved packaging materials among smugglers and a shift towards a more conservative medical approach. Herein, we report a case of toxicity from ingested packets of cocaine that leaked and, despite surgery, resulted in exitus of the patient.

Runge-Lenz wave packet in multichannel Stark photoionization

International Nuclear Information System (INIS)

Texier, F.

2005-01-01

In a previous slow photoionization experiment, modulations of ionization rings were manifested for Xe in a constant electric field. The present quantum calculation reveals that the modulation is an effect of the multichannel core scattering and of tunneling waves through the Coulomb-Stark potential barrier: the barrier reduces the number of oscillations that is observed relatively to the number of oscillations of the short range wave functions, and the nonhydrogenic core phase shifts modify the position of the ionization rings. We find a hidden difference, in the ionization process, for two close values of the energy depending on the resonance with the barrier. The ionization intensity is interpreted as a Runge-Lenz wave packet; thus, we can relate the quantum modulation to the classical Coulomb-Stark trajectories. The Runge-Lenz wave packet differs from a usual temporal wave packet because its components are eigenstates of the Runge-Lenz vector z projection and its evolution is not temporal but spatial

Uncertainty Margin of Void Packet Determination for Ultrasonic Test in NPP

International Nuclear Information System (INIS)

Lee, Seungchan; Sung, Jejung; Lee, Jongchan; Kim, Jonguk

2014-01-01

In this study, the uncertainty of the void packet determination is estimated and the conservatism is reviewed by comparing with realistic uncertainty of Heckle's uncertainty. The methodology of ISO GUM is fully applied to calculate uncertainty, combined uncertainty and effective degree of freedom. Here some results are achieved as below: Combined uncertainty(UT) : 4.98%, Combined uncertainty(Heckle) : 1.44%, Degree of freedom: 5 ∼ 15, Effective degree of freedom(UT): 24.11, Effective degree of freedom(Heckle): 28.54, K value of t-distribution(UT): 2.042, K value of t-distribution(Heckle): 2.04, The uncertainty of this study using UT is enough in the case of achieving conservatism when the void packet determination of the safety related system is determined. As result of this study, UT uncertainty is more conservative than the Heckle's realistic uncertainty. From these results, it is shown that UT method has the great safety margin in determining the void packet. In comparing UT uncertainty with realistic uncertainty, this study (UT) has the conservatism of more than 3.4 times. UT method is good method to determine the void packet of ECCS pipe and to achieve the safety margin. In a safety related system, a void packet determination is issued by US NRC through the Generic Letter 2008-01. In case of the safety function, ECCS, CSS, and RHR systems are affected by the void packet. The related study has been being carried out by KHNP since 2012. In this study, the void packet determination using a ultra sonic test method has been carried out in some sites. This paper shows the uncertainty of the method using the ultra sonic test. The key parameters are introduced and estimated. Specially, the measurement conservatism for NPP is introduced to show the uncertainty margin

Uncertainty Margin of Void Packet Determination for Ultrasonic Test in NPP

Energy Technology Data Exchange (ETDEWEB)

Lee, Seungchan; Sung, Jejung [Korea Hydro Nuclear Power Electricity Co., Daejeon (Korea, Republic of); Lee, Jongchan; Kim, Jonguk [FNC Technology Co., LTD., Yongin (Korea, Republic of)

2014-05-15

In this study, the uncertainty of the void packet determination is estimated and the conservatism is reviewed by comparing with realistic uncertainty of Heckle's uncertainty. The methodology of ISO GUM is fully applied to calculate uncertainty, combined uncertainty and effective degree of freedom. Here some results are achieved as below: Combined uncertainty(UT) : 4.98%, Combined uncertainty(Heckle) : 1.44%, Degree of freedom: 5 ∼ 15, Effective degree of freedom(UT): 24.11, Effective degree of freedom(Heckle): 28.54, K value of t-distribution(UT): 2.042, K value of t-distribution(Heckle): 2.04, The uncertainty of this study using UT is enough in the case of achieving conservatism when the void packet determination of the safety related system is determined. As result of this study, UT uncertainty is more conservative than the Heckle's realistic uncertainty. From these results, it is shown that UT method has the great safety margin in determining the void packet. In comparing UT uncertainty with realistic uncertainty, this study (UT) has the conservatism of more than 3.4 times. UT method is good method to determine the void packet of ECCS pipe and to achieve the safety margin. In a safety related system, a void packet determination is issued by US NRC through the Generic Letter 2008-01. In case of the safety function, ECCS, CSS, and RHR systems are affected by the void packet. The related study has been being carried out by KHNP since 2012. In this study, the void packet determination using a ultra sonic test method has been carried out in some sites. This paper shows the uncertainty of the method using the ultra sonic test. The key parameters are introduced and estimated. Specially, the measurement conservatism for NPP is introduced to show the uncertainty margin.

Detection of ingested cocaine-filled packets-Diagnostic value of unenhanced CT

International Nuclear Information System (INIS)

Schmidt, Sabine; Hugli, Olivier; Rizzo, Elena; Lepori, Domenico; Gudinchet, F.; Yersin, Bertrand; Schnyder, Pierre; Meuwly, Jean-Yves

2008-01-01

Purpose: Emergency departments are facing nowadays an increasing number of illegal drug-related health problems, associated with medicolegal and/or social consequences. Body stuffers are street cocaine dealers, who either store wrapped packets of drugs in their rectum or hastily swallow them, prompted by fear of police's arrest. These packets can be life threatening in case of leakage. We evaluate the diagnostic value of unenhanced multidetector CT (MDCT) for detection of cocaine-filled packets (CFP) ingested by body stuffers in a phantom model. Materials and methods: Our phantom simulated normal bowel contents in which a varying number of true and false CFP were randomly mixed. Both only differ in radiological density. During 18 different reading sessions, four radiologists independently evaluated the presence and number of true and false CFP. Interobserver agreement, sensitivity, specificity, positive and negative predictive value were calculated. Results: Interobserver agreement for detection of any packets, for visualization of true, and false CFP was good (κ = 0.63, 0.74 and 0.58, respectively). Sensitivity, specificity, positive and negative predictive value for detection of any packets was 95.6%, 100%, 100% and 62.5%, respectively; for visualization of the true CFP 86.5%, 100%, 100% and 77.6%, respectively; and for the false packets 98.1%, 65%, 88.6% and 87.5%, respectively. Conclusion: Unenhanced MDCT without bowel preparation is a fast, reliable and easily reproducible imaging modality for the immediate detection of ingested CFP, thus facilitating medicolegal management of body stuffers

SECURE SERVICE DISCOVERY BASED ON PROBE PACKET MECHANISM FOR MANETS

Directory of Open Access Journals (Sweden)

S. Pariselvam

2015-03-01

Full Text Available In MANETs, Service discovery process is always considered to be crucial since they do not possess a centralized infrastructure for communication. Moreover, different services available through the network necessitate varying categories. Hence, a need arises for devising a secure probe based service discovery mechanism to reduce the complexity in providing the services to the network users. In this paper, we propose a Secure Service Discovery Based on Probe Packet Mechanism (SSDPPM for identifying the DoS attack in MANETs, which depicts a new approach for estimating the level of trust present in each and every routing path of a mobile ad hoc network by using probe packets. Probing based service discovery mechanisms mainly identifies a mobile node’s genuineness using a test packet called probe that travels the entire network for the sake of computing the degree of trust maintained between the mobile nodes and it’s attributed impact towards the network performance. The performance of SSDPPM is investigated through a wide range of network related parameters like packet delivery, throughput, Control overhead and total overhead using the version ns-2.26 network simulator. This mechanism SSDPPM, improves the performance of the network in an average by 23% and 19% in terms of packet delivery ratio and throughput than the existing service discovery mechanisms available in the literature.

A Hybrid CPU/GPU Pattern-Matching Algorithm for Deep Packet Inspection.

Directory of Open Access Journals (Sweden)

Chun-Liang Lee

Full Text Available The large quantities of data now being transferred via high-speed networks have made deep packet inspection indispensable for security purposes. Scalable and low-cost signature-based network intrusion detection systems have been developed for deep packet inspection for various software platforms. Traditional approaches that only involve central processing units (CPUs are now considered inadequate in terms of inspection speed. Graphic processing units (GPUs have superior parallel processing power, but transmission bottlenecks can reduce optimal GPU efficiency. In this paper we describe our proposal for a hybrid CPU/GPU pattern-matching algorithm (HPMA that divides and distributes the packet-inspecting workload between a CPU and GPU. All packets are initially inspected by the CPU and filtered using a simple pre-filtering algorithm, and packets that might contain malicious content are sent to the GPU for further inspection. Test results indicate that in terms of random payload traffic, the matching speed of our proposed algorithm was 3.4 times and 2.7 times faster than those of the AC-CPU and AC-GPU algorithms, respectively. Further, HPMA achieved higher energy efficiency than the other tested algorithms.

Automating Information Assurance for Cyber Situational Awareness within a Smart Cloud System of Systems

Science.gov (United States)

2014-03-01

monitoring and protection of data such as Transport Layer Security ( TLS ), Secure Sockets Layer ( SSL ), and Internet Protocol Security (IPsec) protocols...and usage of data loss prevention software. Protocols such as TLS , SSL , and IPsec encrypt data packets for secure transportation and decryption by...Representational State Transfer RSS rich site summary SA situational awareness SAF Singapore Armed Forces SoS system of systems SSL secure sockets layer S

Coherent wave packet dynamics in a double-well potential in cavity

Science.gov (United States)

Zheng, Li; Li, Gang; Ding, Ming-Song; Wang, Yong-Liang; Zhang, Yun-Cui

2018-02-01

We investigate the coherent wave packet dynamics of a two-level atom trapped in a symmetric double-well potential in a near-resonance cavity. Prepared on one side of the double-well potential, the atom wave packet oscillates between the left and right wells, while recoil induced by the emitted photon from the atom entangles the atomic internal and external degrees of freedom. The collapse and revival of the tunneling occurs. Adjusting the width of the wave packets, one can modify the tunneling frequency and suppress the tunneling.

Turbulent Spot Pressure Fluctuation Wave Packet Model

Energy Technology Data Exchange (ETDEWEB)

Dechant, Lawrence J. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2017-05-01

Wave packet analysis provides a connection between linear small disturbance theory and subsequent nonlinear turbulent spot flow behavior. The traditional association between linear stability analysis and nonlinear wave form is developed via the method of stationary phase whereby asymptotic (simplified) mean flow solutions are used to estimate dispersion behavior and stationary phase approximation are used to invert the associated Fourier transform. The resulting process typically requires nonlinear algebraic equations inversions that can be best performed numerically, which partially mitigates the value of the approximation as compared to a more complete, e.g. DNS or linear/nonlinear adjoint methods. To obtain a simpler, closed-form analytical result, the complete packet solution is modeled via approximate amplitude (linear convected kinematic wave initial value problem) and local sinusoidal (wave equation) expressions. Significantly, the initial value for the kinematic wave transport expression follows from a separable variable coefficient approximation to the linearized pressure fluctuation Poisson expression. The resulting amplitude solution, while approximate in nature, nonetheless, appears to mimic many of the global features, e.g. transitional flow intermittency and pressure fluctuation magnitude behavior. A low wave number wave packet models also recover meaningful auto-correlation and low frequency spectral behaviors.

An Energy-Aware Hybrid ARQ Scheme with Multi-ACKs for Data Sensing Wireless Sensor Networks.

Science.gov (United States)

Zhang, Jinhuan; Long, Jun

2017-06-12

Wireless sensor networks (WSNs) are one of the important supporting technologies of edge computing. In WSNs, reliable communications are essential for most applications due to the unreliability of wireless links. In addition, network lifetime is also an important performance metric and needs to be considered in many WSN studies. In the paper, an energy-aware hybrid Automatic Repeat-reQuest protocol (ARQ) scheme is proposed to ensure energy efficiency under the guarantee of network transmission reliability. In the scheme, the source node sends data packets continuously with the correct window size and it does not need to wait for the acknowledgement (ACK) confirmation for each data packet. When the destination receives K data packets, it will return multiple copies of one ACK for confirmation to avoid ACK packet loss. The energy consumption of each node in flat circle network applying the proposed scheme is statistical analyzed and the cases under which it is more energy efficiency than the original scheme is discussed. Moreover, how to select parameters of the scheme is addressed to extend the network lifetime under the constraint of the network reliability. In addition, the energy efficiency of the proposed schemes is evaluated. Simulation results are presented to demonstrate that a node energy consumption reduction could be gained and the network lifetime is prolonged.

H-Infinity Control Design Considering Packet Loss as a Disturbance for Networked Control Systems

OpenAIRE

OGURA, Takashi; KOBAYASHI, Kentaro; OKADA, Hiraku; KATAYAMA, Masaaki

2017-01-01

This paper studies H∞ control for networked control systems with packet loss. In networked control systems, packet loss is one of major weakness because the control performance deteriorates due to packet loss. H∞ control, which is one of robust control, can design a controller to reduce the influence of disturbances acting on the controlled object. This paper proposes an H∞ control design that considers packet loss as a disturbance. Numerical examples show that the proposed H∞ control design ...

Novel Scheme for Packet Forwarding without Header Modifications in Optical Networks

DEFF Research Database (Denmark)

Wessing, Henrik; Christiansen, Henrik Lehrmann; Fjelde, Tina

2002-01-01

We present a novel scheme for packet forwarding in optical packet-switched networks and we further demonstrate its good scalability through simulations. The scheme requires neither header modification nor any label distribution protocol, thus reducing component cost while simplifying network...

Position-Based Packet Forwarding for Vehicular Ad-Hoc Networks

OpenAIRE

Füßler, Holger

2007-01-01

Mobile Ad-Hoc Networks, or MANETs, are data communication networks between (potentially) mobile computer systems equipped with wireless communication devices and — in their purest form — in complete absence of communication infrastructure. Usage scenarios for these systems include communication during disaster recovery or battlefield communications. One of the great research challenges concerning MANETs is the Packet Forwarding Problem, i.e., the question to which neighbor node a data packet ...

Zeno dynamics in wave-packet diffraction spreading

Energy Technology Data Exchange (ETDEWEB)

Porras, Miguel A. [Departamento de Fisica Aplicada, Universidad Politecnica de Madrid, Rios Rosas 21, ES-28003 Madrid (Spain); Luis, Alfredo; Gonzalo, Isabel [Departamento de Optica, Facultad de Ciencias Fisicas, Universidad Complutense, ES-28040 Madrid (Spain); Sanz, Angel S. [Instituto de Fisica Fundamental-CSIC, Serrano 123, ES-28006 Madrid (Spain)

2011-11-15

We analyze a simple and feasible practical scheme displaying Zeno, anti-Zeno, and inverse-Zeno effects in the observation of wave-packet spreading caused by free evolution. The scheme is valid both in spatial diffraction of classical optical waves and in time diffraction of a quantum wave packet. In the optical realization, diffraction spreading is observed by placing slits between a light source and a light-power detector. We show that the occurrence of Zeno or anti-Zeno effects depends just on the frequency of observations between the source and detector. These effects are seen to be related to the diffraction mode theory in Fabry-Perot resonators.

Estimation of Frame Independent and Enhancement Components for Speech Communication over Packet Networks

DEFF Research Database (Denmark)

Giacobello, Daniele; Murthi, Manohar N.; Christensen, Mads Græsbøll

2010-01-01

In this paper, we describe a new approach to cope with packet loss in speech coders. The idea is to split the information present in each speech packet into two components, one to independently decode the given speech frame and one to enhance it by exploiting interframe dependencies. The scheme...... is based on sparse linear prediction and a redefinition of the analysis-by-synthesis process. We present Mean Opinion Scores for the presented coder with different degrees of packet loss and show that it performs similarly to frame dependent coders for low packet loss probability and similarly to frame...

Langston Hughes Curriculum Packet: Dig and Be Dug in Return.

Science.gov (United States)

Danielson, Susan

Designed in a flexible format for use by college instructors, high school teachers, and community education workers, this curriculum packet serves as an introduction to the life and works of black poet Langston Hughes. The major component of the packet is a critical essay that explores the thematic highlights of Hughes's career. The remaining…

Manifestations of wave packet revivals in the moments of observables

International Nuclear Information System (INIS)

Sudheesh, C.; Lakshmibala, S.; Balakrishnan, V.

2004-01-01

Using a generic Hamiltonian that models wave packet propagation in a Kerr-like medium, matter wave field dynamics in Bose-Einstein condensation, etc., we show that distinctive signatures of wave packet revivals and fractional revivals are displayed by the time evolution of the expectation values of appropriate observables, enabling selective identification of different fractional revivals

Optimization and Assessment of Wavelet Packet Decompositions with Evolutionary Computation

Directory of Open Access Journals (Sweden)

Schell Thomas

2003-01-01

Full Text Available In image compression, the wavelet transformation is a state-of-the-art component. Recently, wavelet packet decomposition has received quite an interest. A popular approach for wavelet packet decomposition is the near-best-basis algorithm using nonadditive cost functions. In contrast to additive cost functions, the wavelet packet decomposition of the near-best-basis algorithm is only suboptimal. We apply methods from the field of evolutionary computation (EC to test the quality of the near-best-basis results. We observe a phenomenon: the results of the near-best-basis algorithm are inferior in terms of cost-function optimization but are superior in terms of rate/distortion performance compared to EC methods.

160-Gb/s Silicon All-Optical Packet Switch for Buffer-less Optical Burst Switching

DEFF Research Database (Denmark)

Hu, Hao; Ji, Hua; Pu, Minhao

2015-01-01

We experimentally demonstrate a 160-Gb/s Ethernet packet switch using an 8.6-mm-long silicon nanowire for optical burst switching, based on cross phase modulation in silicon. One of the four packets at the bit rate of 160 Gb/s is switched by an optical control signal using a silicon based 1 × 1 all......-optical packet switch. Error free performance (BER silicon packet switch based optical burst switching, which might be desirable for high-speed interconnects within a short...

Attosecond Electron Wave Packet Dynamics in Strong Laser Fields

International Nuclear Information System (INIS)

Johnsson, P.; Remetter, T.; Varju, K.; L'Huillier, A.; Lopez-Martens, R.; Valentin, C.; Balcou, Ph.; Kazamias, S.; Mauritsson, J.; Gaarde, M. B.; Schafer, K. J.; Mairesse, Y.; Wabnitz, H.; Salieres, P.

2005-01-01

We use a train of sub-200 attosecond extreme ultraviolet (XUV) pulses with energies just above the ionization threshold in argon to create a train of temporally localized electron wave packets. We study the energy transfer from a strong infrared (IR) laser field to the ionized electrons as a function of the delay between the XUV and IR fields. When the wave packets are born at the zero crossings of the IR field, a significant amount of energy (∼20 eV) is transferred from the field to the electrons. This results in dramatically enhanced above-threshold ionization in conditions where the IR field alone does not induce any significant ionization. Because both the energy and duration of the wave packets can be varied independently of the IR laser, they are valuable tools for studying and controlling strong-field processes

Job schedulers for Big data processing in Hadoop environment: testing real-life schedulers using benchmark programs

Directory of Open Access Journals (Sweden)

Mohd Usama

2017-11-01

Full Text Available At present, big data is very popular, because it has proved to be much successful in many fields such as social media, E-commerce transactions, etc. Big data describes the tools and technologies needed to capture, manage, store, distribute, and analyze petabyte or larger-sized datasets having different structures with high speed. Big data can be structured, unstructured, or semi structured. Hadoop is an open source framework that is used to process large amounts of data in an inexpensive and efficient way, and job scheduling is a key factor for achieving high performance in big data processing. This paper gives an overview of big data and highlights the problems and challenges in big data. It then highlights Hadoop Distributed File System (HDFS, Hadoop MapReduce, and various parameters that affect the performance of job scheduling algorithms in big data such as Job Tracker, Task Tracker, Name Node, Data Node, etc. The primary purpose of this paper is to present a comparative study of job scheduling algorithms along with their experimental results in Hadoop environment. In addition, this paper describes the advantages, disadvantages, features, and drawbacks of various Hadoop job schedulers such as FIFO, Fair, capacity, Deadline Constraints, Delay, LATE, Resource Aware, etc, and provides a comparative study among these schedulers.

Review of Rateless-Network-Coding-Based Packet Protection in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

A. S. Abdullah

2015-01-01

Full Text Available In recent times, there have been many developments in wireless sensor network (WSN technologies using coding theory. Fast and efficient protection schemes for data transfer over the WSN are some of the issues in coding theory. This paper reviews the issues related to the application of the joint rateless-network coding (RNC within the WSN in the context of packet protection. The RNC is a method in which any node in the network is allowed to encode and decode the transmitted data in order to construct a robust network, improve network throughput, and decrease delays. To the best of our knowledge, there has been no comprehensive discussion about RNC. To begin with, this paper briefly describes the concept of packet protection using network coding and rateless codes. We therefore discuss the applications of RNC for improving the capability of packet protection. Several works related to this issue are discussed. Finally, the paper concludes that the RNC-based packet protection scheme is able to improve the packet reception rate and suggests future studies to enhance the capability of RNC protection.

VM Capacity-Aware Scheduling within Budget Constraints in IaaS Clouds.

Directory of Open Access Journals (Sweden)

Vasileios Thanasias

Full Text Available Recently, cloud computing has drawn significant attention from both industry and academia, bringing unprecedented changes to computing and information technology. The infrastructure-as-a-Service (IaaS model offers new abilities such as the elastic provisioning and relinquishing of computing resources in response to workload fluctuations. However, because the demand for resources dynamically changes over time, the provisioning of resources in a way that a given budget is efficiently utilized while maintaining a sufficing performance remains a key challenge. This paper addresses the problem of task scheduling and resource provisioning for a set of tasks running on IaaS clouds; it presents novel provisioning and scheduling algorithms capable of executing tasks within a given budget, while minimizing the slowdown due to the budget constraint. Our simulation study demonstrates a substantial reduction up to 70% in the overall task slowdown rate by the proposed algorithms.

VM Capacity-Aware Scheduling within Budget Constraints in IaaS Clouds.

Science.gov (United States)

Thanasias, Vasileios; Lee, Choonhwa; Hanif, Muhammad; Kim, Eunsam; Helal, Sumi

2016-01-01

Recently, cloud computing has drawn significant attention from both industry and academia, bringing unprecedented changes to computing and information technology. The infrastructure-as-a-Service (IaaS) model offers new abilities such as the elastic provisioning and relinquishing of computing resources in response to workload fluctuations. However, because the demand for resources dynamically changes over time, the provisioning of resources in a way that a given budget is efficiently utilized while maintaining a sufficing performance remains a key challenge. This paper addresses the problem of task scheduling and resource provisioning for a set of tasks running on IaaS clouds; it presents novel provisioning and scheduling algorithms capable of executing tasks within a given budget, while minimizing the slowdown due to the budget constraint. Our simulation study demonstrates a substantial reduction up to 70% in the overall task slowdown rate by the proposed algorithms.

Optical packet networks - conclusions from the IST DAVID project

DEFF Research Database (Denmark)

Dittmann, Lars

2004-01-01

This work outlines the result from the European research project DAVID working with optical packet switch solutions for both WAN and MAN. The project started July 2000 and has been completed successfully by the end of 2003.......This work outlines the result from the European research project DAVID working with optical packet switch solutions for both WAN and MAN. The project started July 2000 and has been completed successfully by the end of 2003....

Packetized Media Streaming with Comprehensive Exploitation of Feedback Information

OpenAIRE

De Vleeschouwer, C.; Frossard, P.

2005-01-01

This paper addresses the problem of streaming packetized media over a lossy packet network, with sender-driven (re)transmission using acknowledgement feedback. The different transmission scenarios associated to a group of interdependent media data units are abstracted in terms of a finite alphabet of policies, for each single data unit. A rate-distortion optimized markovian framework is proposed, which supports the use of comprehensive feedback information. Contrarily to previous works in rat...

On wave-packet dynamics in a decaying quadratic potential

DEFF Research Database (Denmark)

Møller, Klaus Braagaard; Henriksen, Niels Engholm

1997-01-01

We consider the time-dependent Schrodinger equation for a quadratic potential with an exponentially decaying force constant. General analytical solutions are presented and we highlight in particular, the signatures of classical mechanics in the wave packet dynamics.......We consider the time-dependent Schrodinger equation for a quadratic potential with an exponentially decaying force constant. General analytical solutions are presented and we highlight in particular, the signatures of classical mechanics in the wave packet dynamics....

Hidden Markov Model-based Packet Loss Concealment for Voice over IP

DEFF Research Database (Denmark)

Rødbro, Christoffer A.; Murthi, Manohar N.; Andersen, Søren Vang

2006-01-01

As voice over IP proliferates, packet loss concealment (PLC) at the receiver has emerged as an important factor in determining voice quality of service. Through the use of heuristic variations of signal and parameter repetition and overlap-add interpolation to handle packet loss, conventional PLC...

Evolution of a wave packet scattered by a one-dimensional potential

International Nuclear Information System (INIS)

Khachatrian, A Zh; Alexanyan, Al G; Khoetsyan, V A; Alexanyan, N A

2013-01-01

We consider the evolution of a wave packet that is made up of a group of the wave functions describing the stationary scattering process and tunnels through a one-dimensional potential of arbitrary form. As the main characteristics of the time difference of the tunnelling process, use is made of the propagation speed of the wave-packet maximum. We show that the known Hartman formula for the tunnelling time corresponds to the wave packet with a wavenumber-uniform spectral composition in the case, when the phase and transmission coefficient modulus dispersions are taken into account only in the linear approximation. The amplitude of the main peak of the transmitted wave intensity is proven to be independent of the tunnelling time and is determined by the transmission coefficient of the spectral component at the carrier frequency and the spectral width of the wave packet. In the limit of an infinitely wide potential barrier the amplitude of the wave-packet maximum is shown to tend to zero slower than the tunnelling time tends to its asymptotic value, i.e., indeed we deal with the paradox of an infinitely large propagation speed of a wave disturbance through the barrier. (propagation of wave fronts)

Evolution of a wave packet scattered by a one-dimensional potential

Energy Technology Data Exchange (ETDEWEB)

Khachatrian, A Zh; Alexanyan, Al G; Khoetsyan, V A; Alexanyan, N A

2013-06-30

We consider the evolution of a wave packet that is made up of a group of the wave functions describing the stationary scattering process and tunnels through a one-dimensional potential of arbitrary form. As the main characteristics of the time difference of the tunnelling process, use is made of the propagation speed of the wave-packet maximum. We show that the known Hartman formula for the tunnelling time corresponds to the wave packet with a wavenumber-uniform spectral composition in the case, when the phase and transmission coefficient modulus dispersions are taken into account only in the linear approximation. The amplitude of the main peak of the transmitted wave intensity is proven to be independent of the tunnelling time and is determined by the transmission coefficient of the spectral component at the carrier frequency and the spectral width of the wave packet. In the limit of an infinitely wide potential barrier the amplitude of the wave-packet maximum is shown to tend to zero slower than the tunnelling time tends to its asymptotic value, i.e., indeed we deal with the paradox of an infinitely large propagation speed of a wave disturbance through the barrier. (propagation of wave fronts)

Dynamics of electron wave packet in a disordered chain with delayed nonlinear response

International Nuclear Information System (INIS)

Zhu Hongjun; Xiong Shijie

2010-01-01

We investigate the dynamics of one electron wave packet in a linear chain with random on-site energies and a nonadiabatic electron-phonon interaction which is described by a delayed cubic nonlinear term in the time-dependent Schroedinger equation. We show that in the regime where the wave packet is delocalized in the case with only the delayed nonlinearity, the wave packet becomes localized when the disorder is added and the localization is enhanced by increasing the disorder. In the regime where the self-trapping phenomenon occurs in the case with only the delayed nonlinearity, by adding the disorder the general dynamical features of the wave packet do not change if the nonlinearity parameter is small, but the dynamics shows the subdiffusive behavior if the nonlinearity parameter is large. The numerical results demonstrate complicated wave packet dynamics of systems with both the disorder and nonlinearity.

Lightweight context aware routing in wireless sensor networks for environments

International Nuclear Information System (INIS)

Aijaz, S.

2015-01-01

Design and implementation of a WSN (Wireless Sensor Network) that can efficiently work for a longer time period must include identification of the deployment environment context and to conform to the behavior of the sensor nodes. The context information when treated with evaluation factor becomes a process of context awareness and the evaluation factor is called the context attribute. In this paper, we consider the context factor of energy. The paper identifies analyses and evaluates efficiency of two when used in a context aware environment. Furthermore, the study also highlights the strengths and weaknesses of sensor SPIN (Sensor Protocol for Information via Negotiation) and LEACH (Low Energy Adaptive Clustering Hierarchy) protocols with respect to the support for WSN with heavy network traffic conditions. The performance has been evaluated in terms of energy efficiency, data packet transmission, network status, data management, reliability, etc. (author)

Antisymmetrized molecular dynamics of wave packets with stochastic incorporation of Vlasov equation

International Nuclear Information System (INIS)

Ono, Akira; Horiuchi, Hisashi.

1996-01-01

The first purpose of this report is to present an extended AMD model which can generally describe such minor branching processes by removing the restriction on the one-body distribution function. This is done not by generalizing the wave packets to arbitrary single-particle wave functions but by representing the diffused and/or deformed wave packet as an ensemble of Gaussian wave packets. In other words, stochastic displacements are given to the wave packets in phase space so that the ensemble-average of the time evolution of the one-body distribution function is essentially equivalent to the solution of Vlasov equation which does not have any restriction on the shape of wave packets. This new model is called AMD-V. Although AMD-V is equivalent to Vlasov equation in the instantaneous time evolution of the one-body distribution function for an AMD wave function, AMD-V describes the branching into channels and the fluctuation of the mean field which are caused by the spreading or the splitting of the single-particle wave function. The second purpose of this report is to show the drastic effect of this new stochastic process of wave packet splitting on the dynamics of heavy ion collisions, especially in the fragmentation mechanism. We take the 40 Ca + 40 Ca system at the incident energy 35 MeV/nucleon. It will be shown that the reproduction of data by the AMD-V calculation is surprisingly good. We will see that the effect of the wave packet diffusion is crucially important to remove the spurious binary feature of the AMD calculation and to enable the multi-fragment final state. (J.P.N.)

Energy-Aware Synthesis of Fault-Tolerant Schedules for Real-Time Distributed Embedded Systems

DEFF Research Database (Denmark)

Poulsen, Kåre Harbo; Pop, Paul; Izosimov, Viacheslav

2007-01-01

This paper presents a design optimisation tool for distributed embedded real-time systems that 1) decides mapping, fault-tolerance policy and generates a fault-tolerant schedule, 2) is targeted for hard real-time, 3) has hard reliability goal, 4) generates static schedule for processes and messages......, 5) provides fault-tolerance for k transient/soft faults, 6) optimises for minimal energy consumption, while considering impact of lowering voltages on the probability of faults, 7) uses constraint logic programming (CLP) based implementation....

Optical frame synchronizer for 10 G Ethernet packets aiming at 1 Tb/s OTDM Ethernet

DEFF Research Database (Denmark)

Hu, Hao; Palushani, Evarist; Laguardia Areal, Janaina

2010-01-01

Synchronization of 10 G Ethernet packets to a local clock was demonstrated using a phase modulator and a SMF as retiming elements. Error free performances for the synchronized packets with different lengths were achieved.......Synchronization of 10 G Ethernet packets to a local clock was demonstrated using a phase modulator and a SMF as retiming elements. Error free performances for the synchronized packets with different lengths were achieved....

Nonspreading Wave Packets for Rydberg Electrons in Rotating Molecules with Electric Dipole Moments

International Nuclear Information System (INIS)

Bialynicki-Birula, I.; Bialynicka-Birula, Z.

1996-01-01

Nonspreading wave packets for Rydberg electrons are predicted in rotating molecules with electric dipole moments. We have named them the Trojan wave packets since their stability is due to the same mechanism that governs the motion of the Trojan asteroids in the Sun-Jupiter system. Unlike all previously predicted Trojan wave packets in atoms, molecular Trojan states do not require external fields for their existence

Square-integrable wave packets from the Volkov solutions

International Nuclear Information System (INIS)

Zakowicz, Stephan

2005-01-01

Rigorous mathematical proofs of some properties of the Volkov solutions are presented, which describe the motion of a relativistic charged Dirac particle in a classical, plane electromagnetic wave. The Volkov solutions are first rewritten in a convenient form, which clearly reveals some of the symmetries of the underlying Dirac equation. Assuming continuity and boundedness of the electromagnetic vector potential, it is shown how one may construct square-integrable wave packets from momentum distributions in the space C 0 ∞ (R 3 ) 4 . If, in addition, the vector potential is C 1 and the derivative is bounded, these wave packets decay in space faster than any polynomial and fulfill the Dirac equation. The mapping which takes momentum distributions into wave packets is shown to be isometric with respect to the L 2 (R 3 ) 4 norm and may therefore be continuously extended to a mapping from L 2 (R 3 ) 4 . For a momentum function in L 1 (R 3 ) 4 intersection L 2 (R 3 ) 4 , an integral representation of this extension is presented

Square-Integrable Wave Packets from the Volkov Solutions

CERN Document Server

Zakowicz, S

2004-01-01

Rigorous mathematical proofs of some properties of the Volkov solutions are presented, which describe the motion of a relativistic charged Dirac particle in a classical, plane electromagnetic wave. The Volkov solutions are first rewritten in a convenient form, which clearly reveals some of the symmetries of the underlying Dirac equation. Assuming continuity and boundedness of the electromagnetic vector potential, it is shown how one may construct square-integrable wave packets from momentum distributions in the space $\\mathcal{C}^{\\infty}_0(\\mathbb{R}^3)^4$. If, in addition, the vector potential is $\\mathcal{C}^1$ and the derivative is bounded, these wave packets decay in space faster than any polynomial and fulfill the Dirac equation. The mapping which takes momentum distributions into wave packets is shown to be isometric with respect to the $L^2(\\mathbb{R}^3)^4$ norm and may therefore be continuously extended to a mapping from $L^2(\\mathbb{R}^3)^4$. For a momen! tum function in $L^1(\\mathbb{R}^3)^4 \\cap L^...

Source Authentication for Code Dissemination Supporting Dynamic Packet Size in Wireless Sensor Networks.

Science.gov (United States)

Kim, Daehee; Kim, Dongwan; An, Sunshin

2016-07-09

Code dissemination in wireless sensor networks (WSNs) is a procedure for distributing a new code image over the air in order to update programs. Due to the fact that WSNs are mostly deployed in unattended and hostile environments, secure code dissemination ensuring authenticity and integrity is essential. Recent works on dynamic packet size control in WSNs allow enhancing the energy efficiency of code dissemination by dynamically changing the packet size on the basis of link quality. However, the authentication tokens attached by the base station become useless in the next hop where the packet size can vary according to the link quality of the next hop. In this paper, we propose three source authentication schemes for code dissemination supporting dynamic packet size. Compared to traditional source authentication schemes such as μTESLA and digital signatures, our schemes provide secure source authentication under the environment, where the packet size changes in each hop, with smaller energy consumption.

Throughput performance analysis of multirate, multiclass S-ALOHA OFFH-CDMA packet networks

DEFF Research Database (Denmark)

Raddo, Thiago R.; Sanches, Anderson L.; Borges, Ben Hur V

2015-01-01

In this paper, we propose a new throughput expression for multirate, multiclass slotted-ALOHA optical fast frequency hopping code-division multiple-access (OFFH-CDMA) packet networks considering a Poisson distribution for packet composite arrivals. We analyze the packet throughput performance...... of a three-class OFFH-CDMA network, where multirate transmissions are achieved via manipulation of the user's code parameters. It is shown that users transmitting at low rates interfere considerably in the performance of high rate users. Finally, we perform a validation procedure to demonstrate...

Quality-aware media scheduling on MPSoC platforms

DEFF Research Database (Denmark)

Gangadharan, Deepak; Chakraborty, Samarjit; Zimmermann, Roger

2013-01-01

and personal computers by providing maximum quality of service to the multiple streams, it is a difficult task in devices with resource constraints. In order to efficiently utilize the resources, it is essential to derive the necessary processor cycles for multiple video streams such that they are displayed...... be scheduled such that a prespecified quality constraint is satisfied with the available service. We present this framework in the context of a PiP application, but it is applicable in general for multiple media streams. The results obtained using the formal framework were further verified using experiments......Applications that stream multiple video/audio or video+audio clips are being implemented in embedded devices. A Picture-in-Picture (PiP) application is one such application scenario, where two videos are played simultaneously. Although the PiP application is very efficiently handled in televisions...

Packets of resonant modes in the Fermi–Pasta–Ulam system

International Nuclear Information System (INIS)

Genta, Tommaso; Giorgilli, Antonio; Paleari, Simone; Penati, Tiziano

2012-01-01

We reconsider the phenomenon of localization of energy in low frequency modes in the FPU system, exploiting the resonances in the lower part of the spectrum. Using the resonant normal form of Birkhoff we construct some candidates of approximate first integrals which we put in correspondence to packets of low frequency modes. By numerical calculation we show that the packet associated to the best quasi-integral involves all modes up to a frequency ω ⁎ (ε), where ε is the specific energy. The phenomenon disappears when the specific energy is bigger than a threshold value. The dependence of the relevant quantities on the number N of particles is also investigated. A final section is devoted to a first comparison with the Toda model. -- Highlights: ► We study the role of resonances for energy localization and metastability in the FPU model. ► We construct an approximated first integral associated to the metastable state. ► We propose to identify the metastable state as a packet of resonant modes. ► The packet extend up to a frequency ω ⁎ (ε), which depends only on the specific energy ε.

Packets of resonant modes in the Fermi–Pasta–Ulam system

Energy Technology Data Exchange (ETDEWEB)

Genta, Tommaso, E-mail: tomgenta@gmail.com [Università degli Studi di Milano, Corso di Laurea in Matematica, Via C. Saldini 50, 20133 Milano (Italy); Giorgilli, Antonio, E-mail: antonio.giorgilli@unimi.it [Università degli Studi di Milano, Dipartimento di Matematica, Via C. Saldini 50, 20133 Milano (Italy); Paleari, Simone, E-mail: simone.paleari@unimi.it [Università degli Studi di Milano, Dipartimento di Matematica, Via C. Saldini 50, 20133 Milano (Italy); Penati, Tiziano, E-mail: tiziano.penati@unimi.it [Università degli Studi di Milano, Dipartimento di Matematica, Via C. Saldini 50, 20133 Milano (Italy)

2012-06-04

We reconsider the phenomenon of localization of energy in low frequency modes in the FPU system, exploiting the resonances in the lower part of the spectrum. Using the resonant normal form of Birkhoff we construct some candidates of approximate first integrals which we put in correspondence to packets of low frequency modes. By numerical calculation we show that the packet associated to the best quasi-integral involves all modes up to a frequency ω{sup ⁎}(ε), where ε is the specific energy. The phenomenon disappears when the specific energy is bigger than a threshold value. The dependence of the relevant quantities on the number N of particles is also investigated. A final section is devoted to a first comparison with the Toda model. -- Highlights: ► We study the role of resonances for energy localization and metastability in the FPU model. ► We construct an approximated first integral associated to the metastable state. ► We propose to identify the metastable state as a packet of resonant modes. ► The packet extend up to a frequency ω{sup ⁎}(ε), which depends only on the specific energy ε.

Synchronous Ethernet- Considerations and Implementation of the Packet Network Management Scheme

Science.gov (United States)

Gundale, A. S.; Aradhye, Ashwini

2010-11-01

Packet technologies were designed to work in asynchronous mode, where the oscillators in the equipment are free running. Although this allows the underlying infrastructure to operate, many applications exist that require frequency synchronization. Also, the ability to distribute synchronization from center to edge of network declines as infrastructure evolves toward a packet-based architecture. Synchronous Ethernet (SyncE) is a key development of the evolution of Ethernet into a carrier grade technology suitable for the WAN environment where frequency synchronization is required. The time of the day distribution in synchronized network at the physical layer enables many useful propositions in packet handling policies and other network management aspects.

An analytical model for perpetual network codes in packet erasure channels

DEFF Research Database (Denmark)

Pahlevani, Peyman; Crisostomo, Sergio; Roetter, Daniel Enrique Lucani

2016-01-01

is highly dependent on a parameter called the width (ωω), which represents the number of consecutive non-zero coding coefficient present in each coded packet after a pivot element. We provide a mathematical analysis based on the width of the coding vector for the number of transmitted packets and validate...

System and method for optimal load and source scheduling in context aware homes

Science.gov (United States)

Shetty, Pradeep; Foslien Graber, Wendy; Mangsuli, Purnaprajna R.; Kolavennu, Soumitri N.; Curtner, Keith L.

2018-01-23

A controller for controlling energy consumption in a home includes a constraints engine to define variables for multiple appliances in the home corresponding to various home modes and persona of an occupant of the home. A modeling engine models multiple paths of energy utilization of the multiple appliances to place the home into a desired state from a current context. An optimal scheduler receives the multiple paths of energy utilization and generates a schedule as a function of the multiple paths and a selected persona to place the home in a desired state.

Parametric Packet-Layer Model for Evaluation Audio Quality in Multimedia Streaming Services

Science.gov (United States)

Egi, Noritsugu; Hayashi, Takanori; Takahashi, Akira

We propose a parametric packet-layer model for monitoring audio quality in multimedia streaming services such as Internet protocol television (IPTV). This model estimates audio quality of experience (QoE) on the basis of quality degradation due to coding and packet loss of an audio sequence. The input parameters of this model are audio bit rate, sampling rate, frame length, packet-loss frequency, and average burst length. Audio bit rate, packet-loss frequency, and average burst length are calculated from header information in received IP packets. For sampling rate, frame length, and audio codec type, the values or the names used in monitored services are input into this model directly. We performed a subjective listening test to examine the relationships between these input parameters and perceived audio quality. The codec used in this test was the Advanced Audio Codec-Low Complexity (AAC-LC), which is one of the international standards for audio coding. On the basis of the test results, we developed an audio quality evaluation model. The verification results indicate that audio quality estimated by the proposed model has a high correlation with perceived audio quality.

Identification of speech transients using variable frame rate analysis and wavelet packets.

Science.gov (United States)

Rasetshwane, Daniel M; Boston, J Robert; Li, Ching-Chung

2006-01-01

Speech transients are important cues for identifying and discriminating speech sounds. Yoo et al. and Tantibundhit et al. were successful in identifying speech transients and, emphasizing them, improving the intelligibility of speech in noise. However, their methods are computationally intensive and unsuitable for real-time applications. This paper presents a method to identify and emphasize speech transients that combines subband decomposition by the wavelet packet transform with variable frame rate (VFR) analysis and unvoiced consonant detection. The VFR analysis is applied to each wavelet packet to define a transitivity function that describes the extent to which the wavelet coefficients of that packet are changing. Unvoiced consonant detection is used to identify unvoiced consonant intervals and the transitivity function is amplified during these intervals. The wavelet coefficients are multiplied by the transitivity function for that packet, amplifying the coefficients localized at times when they are changing and attenuating coefficients at times when they are steady. Inverse transform of the modified wavelet packet coefficients produces a signal corresponding to speech transients similar to the transients identified by Yoo et al. and Tantibundhit et al. A preliminary implementation of the algorithm runs more efficiently.

Scheduling in Heterogeneous Grid Environments: The Effects of DataMigration

Energy Technology Data Exchange (ETDEWEB)

Oliker, Leonid; Biswas, Rupak; Shan, Hongzhang; Smith, Warren

2004-01-01

Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must be overcome before this goal can be fully realized. One problem critical to the effective utilization of computational grids is efficient job scheduling. Our prior work addressed this challenge by defining a grid scheduling architecture and several job migration strategies. The focus of this study is to explore the impact of data migration under a variety of demanding grid conditions. We evaluate our grid scheduling algorithms by simulating compute servers, various groupings of servers into sites, and inter-server networks, using real workloads obtained from leading supercomputing centers. Several key performance metrics are used to compare the behavior of our algorithms against reference local and centralized scheduling schemes. Results show the tremendous benefits of grid scheduling, even in the presence of input/output data migration - while highlighting the importance of utilizing communication-aware scheduling schemes.

Dynamical behavior of the wave packets on adiabatic potential surfaces observed by femtosecond luminescence spectroscopy

International Nuclear Information System (INIS)

Suemoto, Tohru; Nakajima, Makoto; Matsuoka, Taira; Yasukawa, Keizo; Koyama, Takeshi

2007-01-01

The wave packet dynamics on adiabatic potential surfaces studied by means of time-resolved luminescence spectroscopy is reviewed and the advantages of this method are discussed. In quasi-one-dimensional bromine-bridged platinum complexes, a movie representing the time evolution of the wave packet motion and shape was constructed. A two-dimensional Lissajous-like motion of the wave packet was suggested in the same material at low temperature. In F-centers in KI, evidence for tunneling of the wave packet between the adjacent adiabatic potential surfaces was found. Selective observation of the wave packet motion on the excited state was demonstrated for F-centers in KBr and compared with the results from pump-and-probe experiments in literature

A Novel LTE Scheduling Algorithm for Green Technology in Smart Grid

Science.gov (United States)

Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid

2015-01-01

Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application’s priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively. PMID:25830703

A novel LTE scheduling algorithm for green technology in smart grid.

Directory of Open Access Journals (Sweden)

Mohammad Nour Hindia

Full Text Available Smart grid (SG application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA, distributed energy system-storage (DER and electrical vehicle (EV, are investigated in order to study their suitability in Long Term Evolution (LTE network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application's priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule, modified-largest weighted delay first (M-LWDF and exponential/PF (EXP/PF, respectively.

A novel LTE scheduling algorithm for green technology in smart grid.

Science.gov (United States)

Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid

2015-01-01

Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application's priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively.

An NMR log echo data de-noising method based on the wavelet packet threshold algorithm

International Nuclear Information System (INIS)

Meng, Xiangning; Xie, Ranhong; Li, Changxi; Hu, Falong; Li, Chaoliu; Zhou, Cancan

2015-01-01

To improve the de-noising effects of low signal-to-noise ratio (SNR) nuclear magnetic resonance (NMR) log echo data, this paper applies the wavelet packet threshold algorithm to the data. The principle of the algorithm is elaborated in detail. By comparing the properties of a series of wavelet packet bases and the relevance between them and the NMR log echo train signal, ‘sym7’ is found to be the optimal wavelet packet basis of the wavelet packet threshold algorithm to de-noise the NMR log echo train signal. A new method is presented to determine the optimal wavelet packet decomposition scale; this is within the scope of its maximum, using the modulus maxima and the Shannon entropy minimum standards to determine the global and local optimal wavelet packet decomposition scales, respectively. The results of applying the method to the simulated and actual NMR log echo data indicate that compared with the wavelet threshold algorithm, the wavelet packet threshold algorithm, which shows higher decomposition accuracy and better de-noising effect, is much more suitable for de-noising low SNR–NMR log echo data. (paper)

Efficient incremental relaying for packet transmission over fading channels

KAUST Repository

Fareed, Muhammad Mehboob

2014-07-01

In this paper, we propose a novel relaying scheme for packet transmission over fading channels, which improves the spectral efficiency of cooperative diversity systems by utilizing limited feedback from the destination. Our scheme capitalizes on the fact that relaying is only required when direct transmission suffers deep fading. We calculate the packet error rate for the proposed efficient incremental relaying (EIR) scheme with both amplify and forward and decode and forward relaying. We compare the performance of the EIR scheme with the threshold-based incremental relaying (TIR) scheme. It is shown that the efficiency of the TIR scheme is better for lower values of the threshold. However, the efficiency of the TIR scheme for higher values of threshold is outperformed by the EIR. In addition, three new threshold-based adaptive EIR are devised to further improve the efficiency of the EIR scheme. We calculate the packet error rate and the efficiency of these new schemes to provide the analytical insight. © 2014 IEEE.

Hunger and Development [Issue Packet].

Science.gov (United States)

American Freedom from Hunger Foundation, Washington, DC.

A variety of informational materials is compiled in this issue packet concentrating on hunger and development. They have been assembled to understand the issues associated with the facts of world hunger and to try to invent new forms of action and thought necessary to find the possibilities hidden in the hunger issue. Items include: (1) a fact and…

Performance evaluation of packet video transfer over local area networks

OpenAIRE

Lu, Jie

1993-01-01

This research investigates the implementation and performance of packet video transfer over local area networks. A network architecture is defined for packet video such that most of the processing is performed by the higher layers of the Open Systems Interconnection (OSI) reference model, while the lower layers provide real-time services. Implementation methods are discussed for coding schemes, including data compression, the network interface unit, and the underlying local are...

78 FR 10263 - Proposed Collection; Comment Request for ADA Accommodations Request Packet

Science.gov (United States)

2013-02-13

... DEPARTMENT OF THE TREASURY Internal Revenue Service Proposed Collection; Comment Request for ADA... the ADA Accommodations Packet. DATES: Written comments should be received on or before April 15, 2013...: ADA Accommodations Request Packet. OMB Number: 1545-2027. Abstract: Information is collected so that...

Easements in Texas. Teachers Instructional Packet, TIP No. 5, Spring 1985.

Science.gov (United States)

Texas A and M Univ., College Station. Texas Real Estate Research Center.

Part of a series of classroom aids designed for real estate instructors, this instructional packet was developed to help real estate students understand public and private easements, which most commonly entail the right of a person (or the public) to use the land of another in a certain manner. Following an evaluation form for the packet, a…

A Case Study of IPv6 Network Performance: Packet Delay, Loss, and Reordering

Directory of Open Access Journals (Sweden)

Fuliang Li

2017-01-01

Full Text Available Internet Protocol (IP is used to identify and locate computers on the Internet. Currently, IPv4 still routes most Internet traffic. However, with the exhausting of IPv4 addresses, the transition to IPv6 is imminent, because, as the successor of IPv4, IPv6 can provide a larger available address space. Existing studies have addressed the notion that IPv6-centric next generation networks are widely deployed and applied. In order to gain a deep understanding of IPv6, this paper revisits several critical IPv6 performance metrics. Our extensive measurement shows that packet delay and loss rate of IPv6 are similar to IPv4 when the AS-level paths are roughly the same. Specifically, when the link utilization exceeds a threshold, for example, 0.83 in our study, variation of packet delay presents a similar pattern with the variation of link utilization. If packet delay of a path is large, packet-loss rate of that path is more likely to fluctuate. In addition, we conduct a first-ever analysis of packet reordering in IPv6 world. Few IPv6 probe packets are out-of-order and the reordering rate is 2.3⁎10-6, which is much lower than that of 0.79% in IPv4 world. Our analysis consolidates an experimental basis for operators and researchers of IPv6 networks.

Geometrical aspects in optical wave-packet dynamics.

Science.gov (United States)

Onoda, Masaru; Murakami, Shuichi; Nagaosa, Naoto

2006-12-01

We construct a semiclassical theory for propagation of an optical wave packet in a nonconducting medium with a periodic structure of dielectric permittivity and magnetic permeability, i.e., a nonconducting photonic crystal. We employ a quantum-mechanical formalism in order to clarify its link to those of electronic systems. It involves the geometrical phase, i.e., Berry's phase, in a natural way, and describes an interplay between orbital motion and internal rotation. Based on the above theory, we discuss the geometrical aspects of the optical Hall effect. We also consider a reduction of the theory to a system without periodic structure and apply it to the transverse shift of an optical beam at an interface reflection or refraction. For a generic incident beam with an arbitrary polarization, an identical result for the transverse shift of each reflected or transmitted beam is given by the following different approaches: (i) analytic evaluation of wave-packet dynamics, (ii) total angular momentum (TAM) conservation for individual photons, and (iii) numerical simulation of wave-packet dynamics. It is consistent with a result by classical electrodynamics. This means that the TAM conservation for individual photons is already taken into account in wave optics, i.e., classical electrodynamics. Finally, we show an application of our theory to a two-dimensional photonic crystal, and propose an optimal design for the enhancement of the optical Hall effect in photonic crystals.

Customized lifting multiwavelet packet information entropy for equipment condition identification

International Nuclear Information System (INIS)

Chen, Jinglong; Zi, Yanyang; He, Zhengjia; Chen, Xuefeng; Zuo, Ming J; Yuan, Jing

2013-01-01

Condition identification of mechanical equipment from vibration measurement data is significant to avoid economic loss caused by unscheduled breakdowns and catastrophic accidents. However, this task still faces challenges due to the complexity of equipment and the harsh environment. This paper provides a possibility for equipment condition identification by proposing a method called customized lifting multiwavelet packet information entropy. Benefiting from the properties of multi-resolution analysis and multiple wavelet basis functions, the multiwavelet method has advantages in characterizing non-stationary vibration signals. In order to realize the accurate detection and identification of the condition features, a customized lifting multiwavelet packet is constructed via a multiwavelet lifting scheme. Then the vibration signal from the mechanical equipment is processed by the customized lifting multiwavelet packet transform. The relative energy in each frequency band of the multiwavelet packet transform coefficients that equals a percentage of the whole signal energy is taken as the probability. The normalized information entropy is obtained based on the relative energy to describe the condition of a mechanical system. The proposed method is applied to the condition identification of a rolling mill and a demountable disk–drum aero-engine. The results support the feasibility of the proposed method in equipment condition identification. (paper)

Simulation of the collapse and dissipation of Langmuir wave packets

International Nuclear Information System (INIS)

Newman, D.L.; Winglee, R.M.; Robinson, P.A.; Glanz, J.; Goldman, M.V.

1990-01-01

The collapse of isolated Langmuir wave packets is studied numerically in two dimensions using both particle-in-cell (PIC) simulations and by integrating the Zakharov partial differential equations (PDE's). The initial state consists of a localized Langmuir wave packet in an ion background that either is uniform or has a profile representative of the density wells in which wave packets form during strong plasma turbulence. Collapse thresholds are determined numerically and compared to analytical estimates. A model in which Langmuir damping is significantly stronger than Landau damping is constructed which, when included in the PDE simulations, yields good agreement with the collapse dynamics observed in PIC simulations for wave packets with initial wave energy densities small compared to the thermal level. For more intense initial Langmuir fields, collapse is arrested in PIC simulations at lower field strengths than in PDE simulations. Neither nonlinear saturation of the density perturbation nor fluid electron nonlinearities can account for the difference between simulation methods in this regime. However, at these wave levels inhomogeneous electron heating and coherent jets of transit-time accelerated electrons in phase space are observed, resulting in further enhancement of wave damping and the consequent reduction of fields in the PIC simulations

Synchronization, retiming and OTDM of an asynchronous 10 Gigabit Ethernet NRZ packet using a time lens for Terabit Ethernet

DEFF Research Database (Denmark)

Hu, Hao; Laguardia Areal, Janaina; Mulvad, Hans Christian Hansen

2011-01-01

An asynchronous 10G Ethernet packet is synchronized and retimed to a master clock using a time lens. The NRZ packet is converted into an RZ packet and multiplexed with a serial 1.28 Tb/s signal.......An asynchronous 10G Ethernet packet is synchronized and retimed to a master clock using a time lens. The NRZ packet is converted into an RZ packet and multiplexed with a serial 1.28 Tb/s signal....

Unsupervised Ensemble Anomaly Detection Using Time-Periodic Packet Sampling

Science.gov (United States)

Uchida, Masato; Nawata, Shuichi; Gu, Yu; Tsuru, Masato; Oie, Yuji

We propose an anomaly detection method for finding patterns in network traffic that do not conform to legitimate (i.e., normal) behavior. The proposed method trains a baseline model describing the normal behavior of network traffic without using manually labeled traffic data. The trained baseline model is used as the basis for comparison with the audit network traffic. This anomaly detection works in an unsupervised manner through the use of time-periodic packet sampling, which is used in a manner that differs from its intended purpose — the lossy nature of packet sampling is used to extract normal packets from the unlabeled original traffic data. Evaluation using actual traffic traces showed that the proposed method has false positive and false negative rates in the detection of anomalies regarding TCP SYN packets comparable to those of a conventional method that uses manually labeled traffic data to train the baseline model. Performance variation due to the probabilistic nature of sampled traffic data is mitigated by using ensemble anomaly detection that collectively exploits multiple baseline models in parallel. Alarm sensitivity is adjusted for the intended use by using maximum- and minimum-based anomaly detection that effectively take advantage of the performance variations among the multiple baseline models. Testing using actual traffic traces showed that the proposed anomaly detection method performs as well as one using manually labeled traffic data and better than one using randomly sampled (unlabeled) traffic data.

The Optimization of the Data Packet Length in Adaptive Radio Networks

Directory of Open Access Journals (Sweden)

Anatolii P. Voiter

2017-10-01

Full Text Available Background. Development of methods and means of the adaptive management of the radio networks bandwidth with competitive access to the radio channel. Objective. The aim of the paper is to determine the packet length effect on the effective radio networks transmission rate with taking into account the parameters, formats, and procedures of the physical and link levels at using the MAC protocol with a rigid strategy of competitive access to the radio channel. Methods. The goal is achieved by creating and analyzing the mathematical model of the effective transmission rate in radio networks. The model is described by the equation for the effective transmission rate, which is the function of both the probability of the conflict-free transmission of the MAC protocol and the coefficient of the data packet size deviation from the optimal for LLC protocol. Results. It is proved that there is the optimal deviation of the data packet length for each MAC protocol traffic intensity value, which provides the most effective transfer rate. This makes the possibility for adaptive management of the radio bandwidth by applying a pre-calculated deviation of the data packet size in dependence on the traffic intensity. Conclusions. The proposed mathematical model is the tool for calculation of both the radio bandwidth network capacity and the optimal deviation of the data packet length at adaptive management of competitive access to a radio channel with a rigid strategy at conditions of the significant fluctuation in traffic intensity.

Energy and Information Transfer Via Coherent Exciton Wave Packets

Science.gov (United States)

Zang, Xiaoning

Electronic excitons are bound electron-hole states that are generated when light interacts with matter. Such excitations typically entangle with phonons and rapidly decohere; the resulting electronic state dynamics become diffusive as a result. However, if the exciton-phonon coupling can be reduced, it may be possible to construct excitonic wave packets that offer a means of efficiently transmitting information and energy. This thesis is a combined theory/computation investigation to design condensed matter systems which support the requisite coherent transport. Under the idealizing assumption that exciton-phonon entanglement could be completely suppressed, the majority of this thesis focuses on the creation and manipulation of exciton wave packets in quasi-one-dimensional systems. While each site could be a silicon quantum dot, the actual implementation focused on organic molecular assemblies for the sake of computational simplicity, ease of experimental implementation, potential for coherent transport, and promise because of reduced structural uncertainty. A laser design was derived to create exciton wave packets with tunable shape and speed. Quantum interference was then exploited to manipulate these packets to block, pass, and even dissociate excitons based on their energies. These developments allow exciton packets to be considered within the arena of quantum information science. The concept of controllable excitonic wave packets was subsequently extended to consider molecular designs that allow photons with orbital angular momentum to be absorbed to create excitons with a quasi-angular momentum of their own. It was shown that a well-defined measure of topological charge is conserved in such light-matter interactions. Significantly, it was also discovered that such molecules allow photon angular momenta to be combined and later emitted. This amounts to a new way of up/down converting photonic angular momentum without relying on nonlinear optical materials. The

Effective Packet Number for 5G IM WeChat Application at Early Stage Traffic Classification

Directory of Open Access Journals (Sweden)

Muhammad Shafiq

2017-01-01

Full Text Available Accurate network traffic classification at early stage is very important for 5G network applications. During the last few years, researchers endeavored hard to propose effective machine learning model for classification of Internet traffic applications at early stage with few packets. Nevertheless, this essential problem still needs to be studied profoundly to find out effective packet number as well as effective machine learning (ML model. In this paper, we tried to solve the above-mentioned problem. For this purpose, five Internet traffic datasets are utilized. Initially, we extract packet size of 20 packets and then mutual information analysis is carried out to find out the mutual information of each packet on n flow type. Thereafter, we execute 10 well-known machine learning algorithms using crossover classification method. Two statistical analysis tests, Friedman and Wilcoxon pairwise tests, are applied for the experimental results. Moreover, we also apply the statistical tests for classifiers to find out effective ML classifier. Our experimental results show that 13–19 packets are the effective packet numbers for 5G IM WeChat application at early stage network traffic classification. We also find out effective ML classifier, where Random Forest ML classifier is effective classifier at early stage Internet traffic classification.

Squeezing a wave packet with an angular-dependent mass

Energy Technology Data Exchange (ETDEWEB)

Schmidt, Alexandre G M [Departamento de Ciencias Exatas, Universidade Federal Fluminense, Av. dos Trabalhadores 420, Volta Redonda RJ, CEP 27255-125 (Brazil)], E-mail: agmschmidt@gmail.com, E-mail: agmschmidt@pq.cnpq.br

2009-06-19

We present a new effect of position-dependent mass (PDM) systems: the possibility of creating squeezed wave packets at the partial revival times. We solve exactly the PDM Schroedinger equation for the two-dimensional quantum rotor with two effective masses {mu}({theta}), both free and interacting with a uniform electric field, and present their energy eigenvalues and eigenfunctions in terms of Mathieu functions. For the first one, in order to squeeze the wave packet it is necessary to apply an electric field; for the second one such an effect can be achieved without the field.

Squeezing a wave packet with an angular-dependent mass

International Nuclear Information System (INIS)

Schmidt, Alexandre G M

2009-01-01

We present a new effect of position-dependent mass (PDM) systems: the possibility of creating squeezed wave packets at the partial revival times. We solve exactly the PDM Schroedinger equation for the two-dimensional quantum rotor with two effective masses μ(θ), both free and interacting with a uniform electric field, and present their energy eigenvalues and eigenfunctions in terms of Mathieu functions. For the first one, in order to squeeze the wave packet it is necessary to apply an electric field; for the second one such an effect can be achieved without the field

Gabor Wave Packet Method to Solve Plasma Wave Equations

International Nuclear Information System (INIS)

Pletzer, A.; Phillips, C.K.; Smithe, D.N.

2003-01-01

A numerical method for solving plasma wave equations arising in the context of mode conversion between the fast magnetosonic and the slow (e.g ion Bernstein) wave is presented. The numerical algorithm relies on the expansion of the solution in Gaussian wave packets known as Gabor functions, which have good resolution properties in both real and Fourier space. The wave packets are ideally suited to capture both the large and small wavelength features that characterize mode conversion problems. The accuracy of the scheme is compared with a standard finite element approach

Solid Waste Activity Packet for Teachers.

Science.gov (United States)

Illinois Univ., Urbana. Cooperative Extension Service.

This solid waste activity packet introduces students to the solid waste problem in Illinois. Topics explore consumer practices in the market place, packaging, individual and community garbage generation, and disposal practices. The activities provide an integrated approach to incorporating solid waste management issues into subject areas. The…

Interception and modification of network authentication packets with the purpose of allowing alternative authentication modes

Science.gov (United States)

Kent, Alexander Dale [Los Alamos, NM

2008-09-02

Methods and systems in a data/computer network for authenticating identifying data transmitted from a client to a server through use of a gateway interface system which are communicately coupled to each other are disclosed. An authentication packet transmitted from a client to a server of the data network is intercepted by the interface, wherein the authentication packet is encrypted with a one-time password for transmission from the client to the server. The one-time password associated with the authentication packet can be verified utilizing a one-time password token system. The authentication packet can then be modified for acceptance by the server, wherein the response packet generated by the server is thereafter intercepted, verified and modified for transmission back to the client in a similar but reverse process.

A packet switched communications system for GRO

Science.gov (United States)

Husain, Shabu; Yang, Wen-Hsing; Vadlamudi, Rani; Valenti, Joseph

1993-11-01

This paper describes the packet switched Instrumenters Communication System (ICS) that was developed for the Command Management Facility at GSFC to support the Gamma Ray Observatory (GRO) spacecraft. The GRO ICS serves as a vital science data acquisition link to the GRO scientists to initiate commands for their spacecraft instruments. The system is ready to send and receive messages at any time, 24 hours a day and seven days a week. The system is based on X.25 and the International Standard Organization's (ISO) 7-layer Open Systems Interconnection (OSI) protocol model and has client and server components. The components of the GRO ICS are discussed along with how the Communications Subsystem for Interconnection (CSFI) and Network Control Program Packet Switching Interface (NPSI) software are used in the system.

Source Authentication for Code Dissemination Supporting Dynamic Packet Size in Wireless Sensor Networks †

Science.gov (United States)

Kim, Daehee; Kim, Dongwan; An, Sunshin

2016-01-01

Code dissemination in wireless sensor networks (WSNs) is a procedure for distributing a new code image over the air in order to update programs. Due to the fact that WSNs are mostly deployed in unattended and hostile environments, secure code dissemination ensuring authenticity and integrity is essential. Recent works on dynamic packet size control in WSNs allow enhancing the energy efficiency of code dissemination by dynamically changing the packet size on the basis of link quality. However, the authentication tokens attached by the base station become useless in the next hop where the packet size can vary according to the link quality of the next hop. In this paper, we propose three source authentication schemes for code dissemination supporting dynamic packet size. Compared to traditional source authentication schemes such as μTESLA and digital signatures, our schemes provide secure source authentication under the environment, where the packet size changes in each hop, with smaller energy consumption. PMID:27409616

Priority Queues with Fractional Service for Tiered Delay QoS

Directory of Open Access Journals (Sweden)

Gary Chang

2015-12-01

Full Text Available Packet scheduling is key to quality of service (QoS capabilities of broadband wired and wireless networks. In a heterogeneous traffic environment, a comprehensive QoS packet scheduler must strike a balance between flow fairness and access delay. Many advanced packet scheduling solutions have targeted fair bandwidth allocation while protecting delay-constrained traffic by adding priority queue(s on top of a fair bandwidth scheduler. Priority queues are known to cause performance uncertainties and, thus, various modifications have been proposed. In this paper, we present a packet queueing engine dubbed Fractional Service Buffer (FSB, which, when coupled with a configurable flow scheduler, can achieve desired QoS objectives, such as fair throughputs and differentiated delay guarantees. Key performance metrics, such as delay limit and probability of delay limit violation, are derived as a function of key FSB parameters for each delay class in the packet queueing engine using diffusion approximations. OPNET simulations verify these analytical results.

Cross-layer designed adaptive modulation algorithm with packet combining and truncated ARQ over MIMO Nakagami fading channels

KAUST Repository

Aniba, Ghassane

2011-04-01

This paper presents an optimal adaptive modulation (AM) algorithm designed using a cross-layer approach which combines truncated automatic repeat request (ARQ) protocol and packet combining. Transmissions are performed over multiple-input multiple-output (MIMO) Nakagami fading channels, and retransmitted packets are not necessarily modulated using the same modulation format as in the initial transmission. Compared to traditional approach, cross-layer design based on the coupling across the physical and link layers, has proven to yield better performance in wireless communications. However, there is a lack for the performance analysis and evaluation of such design when the ARQ protocol is used in conjunction with packet combining. Indeed, previous works addressed the link layer performance of AM with truncated ARQ but without packet combining. In addition, previously proposed AM algorithms are not optimal and can provide poor performance when packet combining is implemented. Herein, we first show that the packet loss rate (PLR) resulting from the combining of packets modulated with different constellations can be well approximated by an exponential function. This model is then used in the design of an optimal AM algorithm for systems employing packet combining, truncated ARQ and MIMO antenna configurations, considering transmission over Nakagami fading channels. Numerical results are provided for operation with or without packet combining, and show the enhanced performance and efficiency of the proposed algorithm in comparison with existing ones. © 2011 IEEE.

Maximization of the Supportable Number of Sensors in QoS-Aware Cluster-Based Underwater Acoustic Sensor Networks

Directory of Open Access Journals (Sweden)

Thi-Tham Nguyen

2014-03-01

Full Text Available This paper proposes a practical low-complexity MAC (medium access control scheme for quality of service (QoS-aware and cluster-based underwater acoustic sensor networks (UASN, in which the provision of differentiated QoS is required. In such a network, underwater sensors (U-sensor in a cluster are divided into several classes, each of which has a different QoS requirement. The major problem considered in this paper is the maximization of the number of nodes that a cluster can accommodate while still providing the required QoS for each class in terms of the PDR (packet delivery ratio. In order to address the problem, we first estimate the packet delivery probability (PDP and use it to formulate an optimization problem to determine the optimal value of the maximum packet retransmissions for each QoS class. The custom greedy and interior-point algorithms are used to find the optimal solutions, which are verified by extensive simulations. The simulation results show that, by solving the proposed optimization problem, the supportable number of underwater sensor nodes can be maximized while satisfying the QoS requirements for each class.

Study of the Subjective Visibility of Packet Loss Artifacts in Decoded Video Sequences

DEFF Research Database (Denmark)

Korhonen, Jari

2018-01-01

Packet loss is a significant cause of visual impairments in video broadcasting over packet-switched networks. There are several subjective and objective video quality assessment methods focused on the overall perception of video quality. However, less attention has been paid on the visibility...... of packet loss artifacts appearing in spatially and temporally limited regions of a video sequence. In this paper, we present the results of a subjective study, using a methodology where a video sequence is displayed on a touchscreen and the users tap it in the positions where they observe artifacts. We...... also analyze the objective features derived from those artifacts, and propose different models for combining those features into an objective metric for assessing the noticeability of the artifacts. The practical results show that the proposed metric predicts visibility of packet loss impairments...

640 Gbit/s Optical Packet Switching using a Novel In-Band Optical Notch-Filter Labeling Scheme

DEFF Research Database (Denmark)

Medhin, Ashenafi Kiros; Galili, Michael; Oxenløwe, Leif Katsuo

2014-01-01

Optical packet switching of 640 Gbit/s data packets is reported using an in-band optical labeling technique based on notch-filtering of the data spectrum and extracting the label using a bandpass filter. BER 10􀀀9 is achieved.......Optical packet switching of 640 Gbit/s data packets is reported using an in-band optical labeling technique based on notch-filtering of the data spectrum and extracting the label using a bandpass filter. BER 10􀀀9 is achieved....

Generation of attosecond electron packets via conical surface plasmon electron acceleration

Science.gov (United States)

Greig, S. R.; Elezzabi, A. Y.

2016-01-01

We present a method for the generation of high kinetic energy attosecond electron packets via magnetostatic and aperture filtering of conical surface plasmon (SP) accelerated electrons. The conical SP waves are excited by coupling an ultrafast radially polarized laser beam to a conical silica lens coated with an Ag film. Electromagnetic and particle tracking models are employed to characterize the ultrafast electron packets. PMID:26764129

Lightweight Context Aware Routing in Wireless Sensor Networks for Real Environments

Directory of Open Access Journals (Sweden)

Samia Aijaz

2015-07-01

Full Text Available Design and implementation of a WSN (Wireless Sensor Network that can efficiently work for a longer time period must include identification of the deployment environment context and to conform to the behavior of the sensor nodes. The context information when treated with evaluation factor becomes a process of context awareness and the evaluation factor is called the context attribute. In this paper, we consider the context factor of energy. The paper identifies analyses and evaluates efficiency of two when used in a context aware environment. Furthermore, the study also highlights the strengths and weaknesses of sensor SPIN (Sensor Protocol for Information via Negotiation and LEACH (Low Energy Adaptive Clustering Hierarchy protocols with respect to the support for WSN with heavy network traffic conditions. The performance has been evaluated in terms of energy efficiency, data packet transmission, network status, data management, reliability, etc.

Scheduling for energy and reliability management on multiprocessor real-time systems

Science.gov (United States)

Qi, Xuan

Scheduling algorithms for multiprocessor real-time systems have been studied for years with many well-recognized algorithms proposed. However, it is still an evolving research area and many problems remain open due to their intrinsic complexities. With the emergence of multicore processors, it is necessary to re-investigate the scheduling problems and design/develop efficient algorithms for better system utilization, low scheduling overhead, high energy efficiency, and better system reliability. Focusing cluster schedulings with optimal global schedulers, we study the utilization bound and scheduling overhead for a class of cluster-optimal schedulers. Then, taking energy/power consumption into consideration, we developed energy-efficient scheduling algorithms for real-time systems, especially for the proliferating embedded systems with limited energy budget. As the commonly deployed energy-saving technique (e.g. dynamic voltage frequency scaling (DVFS)) will significantly affect system reliability, we study schedulers that have intelligent mechanisms to recuperate system reliability to satisfy the quality assurance requirements. Extensive simulation is conducted to evaluate the performance of the proposed algorithms on reduction of scheduling overhead, energy saving, and reliability improvement. The simulation results show that the proposed reliability-aware power management schemes could preserve the system reliability while still achieving substantial energy saving.

Event-triggered control systems under packet losses

NARCIS (Netherlands)

Dolk, V.S.; Heemels, W.P.M.H.

2017-01-01

Networked control systems (NCSs) offer many benefits in terms of increased flexibility and maintainability but might also suffer from inevitable imperfections such as packet dropouts and limited communications resources. In this paper, (static and dynamic) event-triggered control (ETC) strategies

Satcom access in the Evolved Packet Core

NARCIS (Netherlands)

Cano Soveri, M.D.; Norp, A.H.J.; Popova, M.P.

2011-01-01

Satellite communications (Satcom) networks are increasingly integrating with terrestrial communications networks, namely Next Generation Networks (NGN). In the area of NGN the Evolved Packet Core (EPC) is a new network architecture that can support multiple access technologies. When Satcom is

Satcom access in the evolved packet core

NARCIS (Netherlands)

Cano, M.D.; Norp, A.H.J.; Popova, M.P.

2012-01-01

Satellite communications (Satcom) networks are increasingly integrating with terrestrial communications networks, namely Next Generation Networks (NGN). In the area of NGN the Evolved Packet Core (EPC) is a new network architecture that can support multiple access technologies. When Satcom is

Resonance-assisted decay of nondispersive wave packets

OpenAIRE

Wimberger, S.; Schlagheck, P.; Eltschka, C.; Buchleitner, A.

2006-01-01

We present a quantitative semiclassical theory for the decay of nondispersive electronic wave packets in driven, ionizing Rydberg systems. Statistically robust quantities are extracted combining resonance assisted tunneling with subsequent transport across chaotic phase space and a final ionization step.

On Several Fundamental Problems of Optimization, Estimation, and Scheduling in Wireless Communications

Science.gov (United States)

Gao, Qian

compared with the conventional decoupled system with the same spectrum efficiency to demonstrate the power efficiency. Crucial lighting requirements are included as optimization constraints. To control non-linear distortion, the optical peak-to-average-power ratio (PAPR) of LEDs can be individually constrained. With a SVD-based pre-equalizer designed and employed, our scheme can achieve lower BER than counterparts applying zero-forcing (ZF) or linear minimum-mean-squared-error (LMMSE) based post-equalizers. Besides, a binary switching algorithm (BSA) is applied to improve BER performance. The third part looks into a problem of two-phase channel estimation in a relayed wireless network. The channel estimates in every phase are obtained by the linear minimum mean squared error (LMMSE) method. Inaccurate estimate of the relay to destination (RtD) channel in phase 1 could affect estimate of the source to relay (StR) channel in phase 2, which is made erroneous. We first derive a close-form expression for the averaged Bayesian mean-square estimation error (ABMSE) for both phase estimates in terms of the length of source and relay training slots, based on which an iterative searching algorithm is then proposed that optimally allocates training slots to the two phases such that estimation errors are balanced. Analysis shows how the ABMSE of the StD channel estimation varies with the lengths of relay training and source training slots, the relay amplification gain, and the channel prior information respectively. The last part deals with a transmission scheduling problem in a uplink multiple-input-multiple-output (MIMO) wireless network. Code division multiple access (CDMA) is assumed as a multiple access scheme and pseudo-random codes are employed for different users. We consider a heavy traffic scenario, in which each user always has packets to transmit in the scheduled time slots. If the relay is scheduled for transmission together with users, then it operates in a full

Controllable thousand-port low-latency optical packet switch architecture for short link applications

NARCIS (Netherlands)

Di Lucente, S.; Nazarathy, J.; Raz, O.; Calabretta, N.; Dorren, H.J.S.; Bienstman, P.; Morthier, G.; Roelkens, G.; et al., xx

2011-01-01

The implementation of a low-latency optical packet switch architecture that is controllable while scaling to over thousand ports is investigated in this paper. Optical packet switches with thousand of input/output ports are promising devices to improve the performance of short link applications in

Host based internet protocol (IP) packet analysis to enhance network security

International Nuclear Information System (INIS)

Ahmad, T.; Ahmad, S.Z.; Yasin, M.M.

2007-01-01

Data communication in a computer network environment is facing serious security threats from numerous sources such as viruses, worms, Zombies etc. These threats can be broadly characterized as internal or external security threats. Internal threats are mainly attributed to sneaker-nets, utility modems and unauthorized users, which can be minimized by skillful network administration, password management and optimum usage policy definition. The external threats need more serious attention as these attacks are mostly coming from public networks such as Internet. Frequency and complexity of such attacks is much higher as compared to internal attacks. This paper presents a host based network layer screening of external and internal IP packets for logging, analyzing and real-time detection of possible IP spoofing and Denial of Service attacks. This work can also be used in tuning security rules definition for gateway firewalls. Software has been developed which intercepts IP traffic and analyses it with respect to integrity and origin of I P packet. The received IP packets are parsed and analyzed for possible signs of intrusion. The results show that by watching and categorizing composition of various transport protocol such as TCP, UDP, ICMP and others along with verifying the origin of received IP packet can help in devising real-time firewall rule and blocking possible external attack. This is highly desirable for fighting against zero day attacks and can result in a better Mean Time between Failures (MTBF) to increase the survivability of computer network. Used in a right context, packet screening and filtering can be a useful tool for provision of reliable and stable network services. (author)

Packet Payload Monitoring for Internet Worm Content Detection Using Deterministic Finite Automaton with Delayed Dictionary Compression

Directory of Open Access Journals (Sweden)

Divya Selvaraj

2014-01-01

Full Text Available Packet content scanning is one of the crucial threats to network security and network monitoring applications. In monitoring applications, payload of packets in a network is matched against the set of patterns in order to detect attacks like worms, viruses, and protocol definitions. During network transfer, incoming and outgoing packets are monitored in depth to inspect the packet payload. In this paper, the regular expressions that are basically string patterns are analyzed for packet payloads in detecting worms. Then the grouping scheme for regular expression matching is rewritten using Deterministic Finite Automaton (DFA. DFA achieves better processing speed during regular expression matching. DFA requires more memory space for each state. In order to reduce memory utilization, decompression technique is used. Delayed Dictionary Compression (DDC is applied for achieving better speeds in the communication links. DDC achieves decoding latency during compression of payload packets in the network. Experimental results show that the proposed approach provides better time consumption and memory utilization during detection of Internet worm attacks.

Application of the wavelet packet transform to vibration signals for surface roughness monitoring in CNC turning operations

Science.gov (United States)

García Plaza, E.; Núñez López, P. J.

2018-01-01

The wavelet packet transform method decomposes a time signal into several independent time-frequency signals called packets. This enables the temporary location of transient events occurring during the monitoring of the cutting processes, which is advantageous in monitoring condition and fault diagnosis. This paper proposes the monitoring of surface roughness using a single low cost sensor that is easily implemented in numerical control machine tools in order to make on-line decisions on workpiece surface finish quality. Packet feature extraction in vibration signals was applied to correlate the sensor signals to measured surface roughness. For the successful application of the WPT method, mother wavelets, packet decomposition level, and appropriate packet selection methods should be considered, but are poorly understood aspects in the literature. In this novel contribution, forty mother wavelets, optimal decomposition level, and packet reduction methods were analysed, as well as identifying the effective frequency range providing the best packet feature extraction for monitoring surface finish. The results show that mother wavelet biorthogonal 4.4 in decomposition level L3 with the fusion of the orthogonal vibration components (ax + ay + az) were the best option in the vibration signal and surface roughness correlation. The best packets were found in the medium-high frequency DDA (6250-9375 Hz) and high frequency ADA (9375-12500 Hz) ranges, and the feed acceleration component ay was the primary source of information. The packet reduction methods forfeited packets with relevant features to the signal, leading to poor results for the prediction of surface roughness. WPT is a robust vibration signal processing method for the monitoring of surface roughness using a single sensor without other information sources, satisfactory results were obtained in comparison to other processing methods with a low computational cost.

PcapDB: Search Optimized Packet Capture, Version 0.1.0.0

Energy Technology Data Exchange (ETDEWEB)

2016-11-04

PcapDB is a packet capture system designed to optimize the captured data for fast search in the typical (network incident response) use case. The technology involved in this software has been submitted via the IDEAS system and has been filed as a provisional patent. It includes the following primary components: capture: The capture component utilizes existing capture libraries to retrieve packets from network interfaces. Once retrieved the packets are passed to additional threads for sorting into flows and indexing. The sorted flows and indexes are passed to other threads so that they can be written to disk. These components are written in the C programming language. search: The search components provide a means to find relevant flows and the associated packets. A search query is parsed and represented as a search tree. Various search commands, written in C, are then used resolve this tree into a set of search results. The tree generation and search execution management components are written in python. interface: The PcapDB web interface is written in Python on the Django framework. It provides a series of pages, API's, and asynchronous tasks that allow the user to manage the capture system, perform searches, and retrieve results. Web page components are written in HTML,CSS and Javascript.

Packet models revisited: tandem and priority systems

NARCIS (Netherlands)

M.R.H. Mandjes (Michel)

2004-01-01

textabstractWe examine two extensions of traditional single-node packet-scale queueing models: tandem networks and (strict) priority systems. Two generic input processes are considered: periodic and Poisson arrivals. For the two-node tandem, an exact expression is derived for the joint distribution

Impact of Packet Sampling on Link Dimensioning

NARCIS (Netherlands)

Schmidt, R.D.O.; Sadre, R.; Sperotto, A.; Berg, H. van den; Pras, A.

2015-01-01

Link dimensioning is used by network operators to properly provision the capacity of their network links. Proposed methods for link dimensioning often require statistics, such as traffic variance, that need to be calculated from packet-level measurements. In practice, due to increasing traffic

Impact of packet sampling on link dimensioning

NARCIS (Netherlands)

de Oliveira Schmidt, R.; Stadler, R.; Sadre, R.; Sperotto, Anna; van den Berg, Hans Leo; Pras, Aiko

Link dimensioning is used by network operators to properly provision the capacity of their network links. Proposed methods for link dimensioning often require statistics, such as traffic variance, that need to be calculated from packet-level measurements. In practice, due to increasing traffic

Dynamic optical fiber delivery of Ka-band packet transmissions for wireless access networks

DEFF Research Database (Denmark)

Rodríguez Páez, Juan Sebastián; Madsen, Peter; Tafur Monroy, Idelfonso

2017-01-01

A Reconfigurable Radio Access Unit is presented and experimentally demonstrated. In the unit, an optical switching system is set to dynamically deliver different packets to different points in the network. The packets are transmitted wirelesslty on the Ka-band (26–40 GHz), achieving BER values...

Content-Adaptive Packetization and Streaming of Wavelet Video over IP Networks

Directory of Open Access Journals (Sweden)

Chien-Peng Ho

2007-03-01

Full Text Available This paper presents a framework of content-adaptive packetization scheme for streaming of 3D wavelet-based video content over lossy IP networks. The tradeoff between rate and distortion is controlled by jointly adapting scalable source coding rate and level of forward error correction (FEC protection. A content dependent packetization mechanism with data-interleaving and Reed-Solomon protection for wavelet-based video codecs is proposed to provide unequal error protection. This paper also tries to answer an important question for scalable video streaming systems: given extra bandwidth, should one increase the level of channel protection for the most important packets, or transmit more scalable source data? Experimental results show that the proposed framework achieves good balance between quality of the received video and level of error protection under bandwidth-varying lossy IP networks.

Three Packets of Minerals of the Periodic Table of Chemical Elements and Chemical Compounds

OpenAIRE

Labushev, Mikhail M.

2013-01-01

The concepts of alpha- and beta-packets of the periodic table of chemical elements and chemical compounds are defined. The first of the 47 minerals alpha-packets is composed. In it all minerals are arranged in increasing Iav index of proportionality of atomic weights of composing chemical elements, the same way as chemical elements are located in increasing atomic weights in the Periodic table. The packet includes 93 known minerals and two compounds - N2O5 and CO2 - being actually minerals. B...

The Generation Mechanism of Airy—Bessel Wave Packets in Free Space

International Nuclear Information System (INIS)

Ren Zhi-Jun; Ying Chao-Fu; Fan Chang-Jiang; Wu Qiong

2012-01-01

Localized optical Airy—Bessel configuration wave packets were first generated on the basis of a grating-telescope combination [Nat. Photon. 4(2010) 103]. By studying the spatially induced group velocity dispersion effect of ultrashort pulsed Bessel beams during propagation, we find the universal physical foundation of generating Airy—Bessel wave packets (ABWs) in free space. The research results are expected to open up more common channels for generating stable linear localized ABWs

PERFORMANCE ANALYSIS OF AI BASED QOS SCHEDULER FOR MOBILE WIMAX

Directory of Open Access Journals (Sweden)

D. David Neels Pon Kumar

2012-09-01

Full Text Available Interest in broadband wireless access (BWA has been growing due to increased user mobility and the need for data access at all times. IEEE 802.16e based WiMAX networks promise the best available quality of experience for mobile data service users. WiMAX networks incorporate several Quality of Service (QoS mechanisms at the Media Access Control (MAC level for guaranteed services for multimedia viz. data, voice and video. The problem of assuring QoS is how to allocate available resources among users to meet the QoS criteria such as delay, delay jitter, fairness and throughput requirements. IEEE standard does not include a standard scheduling mechanism and leaves it for various implementer differentiations. Although a lot of the real-time and non real-time packet scheduling schemes has been proposed, it needs to be modified to apply to Mobile WiMAX system that supports five kinds of service classes. In this paper, we propose a novel Priority based Scheduling scheme that uses Artificial Intelligence to support various services by considering the QoS constraints of each class. The simulation results show that slow mobility does not affect the performances and faster mobility and the increment in users beyond a particular load have their say in defining average throughput, average per user throughput, fairness index, average end to end delay and average delay jitter. Nevertheless the results are encouraging that the proposed scheme provides QoS support for each class efficiently.

Wave packet fractional revivals in a one-dimensional Rydberg atom

International Nuclear Information System (INIS)

Veilande, Rita; Bersons, Imants

2007-01-01

We investigate many characteristic features of revival and fractional revival phenomena via derived analytic expressions for an autocorrelation function of a one-dimensional Rydberg atom with weighting probabilities modelled by a Gaussian or a Lorentzian distribution. The fractional revival phenomenon in the ionization probabilities of a one-dimensional Rydberg atom irradiated by two short half-cycle pulses is also studied. When many states are involved in the formation of the wave packet, the revival is lower and broader than the initial wave packet and the fractional revivals overlap and disappear with time

Towards Effective Trust-Based Packet Filtering in Collaborative Network Environments

DEFF Research Database (Denmark)

Meng, Weizhi; Li, Wenjuan; Kwok, Lam-For

2017-01-01

compromised by insider attacks. In this paper, we adopt the existing CIDN framework and aim to apply a collaborative trust-based approach to reduce unwanted packets. More specifically, we develop a collaborative trust-based packet filter, which can be deployed in collaborative networks and be robust against...... typical insider attacks (e.g., betrayal attacks). Experimental results in various simulated and practical environments demonstrate that our filter can perform effectively in reducing unwanted traffic and can defend against insider attacks through identifying malicious nodes in a quick manner, as compared...

Modelling Packet Departure Times using a Known PDF

Directory of Open Access Journals (Sweden)

Stanislav Klucik

2014-01-01

Full Text Available This paper deals with IPTV traffic source modelling and describes a packet generator based on a known probability density function which is measured and formed from a histogram. Histogram based probability density functions destroy an amount of information, because classes used to form the histogram often cover significantly more events than one. In this work, we propose an algorithm to generate far more output states of random variable X than the input probability distribution function is made from. In this generator is assumed that all IPTV packets of the same video stream are the same length. Therefore, only packet times are generated. These times are generated using the measured normalized histogram that is converted to a cumulative distribution function which acts as a finite number of states that can be addressed. To address these states we use an ON/OFF model that is driven by an uniform random number generator in (0, 1. When a state is chosen then the resulting value is equal to a histogram class. To raise the number of possible output states of the random variable X, we propose to use an uniform random number generator that generates numbers within the range of the chosen histogram class. This second uniform random number generator assures that the number of output states is far more larger than the number of histogram classes.

A packet-based dual-rate PID control strategy for a slow-rate sensing Networked Control System.

Science.gov (United States)

Cuenca, A; Alcaina, J; Salt, J; Casanova, V; Pizá, R

2018-05-01

This paper introduces a packet-based dual-rate control strategy to face time-varying network-induced delays, packet dropouts and packet disorder in a Networked Control System. Slow-rate sensing enables to achieve energy saving and to avoid packet disorder. Fast-rate actuation makes reaching the desired control performance possible. The dual-rate PID controller is split into two parts: a slow-rate PI controller located at the remote side (with no permanent communication to the plant) and a fast-rate PD controller located at the local side. The remote side also includes a prediction stage in order to generate the packet of future, estimated slow-rate control actions. These actions are sent to the local side and converted to fast-rate ones to be used when a packet does not arrive at this side due to the network-induced delay or due to occurring dropouts. The proposed control solution is able to approximately reach the nominal (no-delay, no-dropout) performance despite the existence of time-varying delays and packet dropouts. Control system stability is ensured in terms of probabilistic Linear Matrix Inequalities (LMIs). Via real-time control for a Cartesian robot, results clearly reveal the superiority of the control solution compared to a previous proposal by authors. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

A Study of Quality of Service Communication for High-Speed Packet-Switching Computer Sub-Networks

Science.gov (United States)

Cui, Zhenqian

1999-01-01

In this thesis, we analyze various factors that affect quality of service (QoS) communication in high-speed, packet-switching sub-networks. We hypothesize that sub-network-wide bandwidth reservation and guaranteed CPU processing power at endpoint systems for handling data traffic are indispensable to achieving hard end-to-end quality of service. Different bandwidth reservation strategies, traffic characterization schemes, and scheduling algorithms affect the network resources and CPU usage as well as the extent that QoS can be achieved. In order to analyze those factors, we design and implement a communication layer. Our experimental analysis supports our research hypothesis. The Resource ReSerVation Protocol (RSVP) is designed to realize resource reservation. Our analysis of RSVP shows that using RSVP solely is insufficient to provide hard end-to-end quality of service in a high-speed sub-network. Analysis of the IEEE 802.lp protocol also supports the research hypothesis.

Analisis Quality of Service (QoS Jaringan Telekomunikasi High-Speed Downlink Packet Access (HSDPA pada Teknologi 3.5G

Directory of Open Access Journals (Sweden)

Mey Fenny Wati Simanjuntak

2016-01-01

Full Text Available Sejak layanan teknologi 3G pertama kali diperkenalkan, permintaan akan layanan berbasis paket data dari tahun ke tahun mengalami peningkatan yang pesat. Menanggapi hal tersebut, para penyedian jaringan telekomunikasi terus berusaha untuk meningkatkan kemampuan jaringannya. Salah satu solusinya menerapkan teknologi High-Speed Downlink Packet Access yang direkomendasikan oleh 3GPP Release 5. Penelitian ini dikhususkan untuk menganalisis Quality of Service jaringan telekomunikasi High-Speed Downlink Packet Access di Kecamatan Tembalang Kota Semarang. Analisis Quality of Service jaringan telekomunikasi High-Speed Downlink Packet Access pada penelitian ini bertujuan untuk memberikan gambaran kualitas jaringan telekomunikasi High-Speed Downlink Packet Access dari sisi bandwidth, throughput, packet loss dan delay. Metode penelitian yang dibahas dalam penelitian ini yaitu penelitian kualitatif observatif, dimana akan dilakukan pengamatan tentang bagaimana QoS jaringan telekomunikasi High-Speed Downlink Packet Access pada teknologi 3.5G di Kecamatan Tembalang Kota Semarang. Proses pengamatan dalam menganalisis Quality of Service jaringan telekomunikasi High-Speed Downlink Packet Access di Kecamatan Tembalang Kota Semarang berdasarkan 4 parameter diantaranya bandwidth, throughput, packet loss dan delay. Aplikasi yang digunakan yaitu monitoring application Elnus Bandwidth Meter dan Axence NetTools Professional 4.0. Selain itu, Quality of Service jaringan telekomunikasi High- Speed Downlink Packet Access di Kecamatan Tembalang Kota Semarang diamati berdasarkan waktu yaitu harian, mingguan dan bulanan.

Isolated drops from capillary jets by means of Gaussian wave packets

Science.gov (United States)

Garcia, Francisco Javier; Gonzalez, Heliodoro; Castrejon-Pita, Alfonso Arturo; Castrejon-Pita, Jose Rafael; Gomez-Aguilar, Francisco Jose

2017-11-01

The possibility of obtaining isolated drops from a continuous liquid jet through localized velocity perturbations is explored analytically, numerically and experimentally. We show that Gaussian wave packets are appropriate for this goal. A temporal linear analysis predicts the early evolution of these wave packets and provides an estimate of the breakup length of the jet. Non-linear numerical simulations allow us both to corroborate these results and to obtain the shape of the surface of the jet prior to breakup. Finally, we show experimental evidence that stimulating with a Gaussian wave packet can lead to the formation of an isolated drop without disturbing the rest of the jet. The authors acknowledge support from the Spanish Government under Contract No. FIS2014-25161, the Junta de Andalucia under Contract No. P11-FQM-7919, the EPSRC-UK via the Grant EP/P024173/1, and the Royal Society.

EXTENDING THE DEEP PACKET INSPECTION MODEL TO THE GCC/MENA REGION

Directory of Open Access Journals (Sweden)

Alfred H. Miller

2013-12-01

Full Text Available This study seeks to explore extending the technology acceptance model (DPAM from a 2011 quantitative study—Modeling Intention to Use Deep Packet Inspection Technology in the United Arab Emirates, to the cyber security practitioner community of the Gulf Cooperation Council (GCC and greater Middle East North Africa (MENA Region. Analysis of regression between independent variable model factors of computer self efficacy, attitude toward ICT, perceived usefulness of ecommerce, intention to use ecommerce, societal trust and Internet filtration toward the dependent variable intention to use deep packet inspection, to determine parsimony, using confirmatory factor analysis (CFA, multinomial regression to assess correlation of independent and dependent variables, and assessment of the cross-suitability of DPAM across the MENA/GCC states through a MANOVA assessment. A qualitative component of the instrument enables collection of data about specific hardware and software deployed for deep packet inspection and cyber security systems.

Pump-dump iterative squeezing of vibrational wave packets.

Science.gov (United States)

Chang, Bo Y; Sola, Ignacio R

2005-12-22

The free motion of a nonstationary vibrational wave packet in an electronic potential is a source of interesting quantum properties. In this work we propose an iterative scheme that allows continuous stretching and squeezing of a wave packet in the ground or in an excited electronic state, by switching the wave function between both potentials with pi pulses at certain times. Using a simple model of displaced harmonic oscillators and delta pulses, we derive the analytical solution and the conditions for its possible implementation and optimization in different molecules and electronic states. We show that the main constraining parameter is the pulse bandwidth. Although in principle the degree of squeezing (or stretching) is not bounded, the physical resources increase quadratically with the number of iterations, while the achieved squeezing only increases linearly.

Wireless-Uplinks-Based Energy-Efficient Scheduling in Mobile Cloud Computing

Directory of Open Access Journals (Sweden)

Xing Liu

2015-01-01

Full Text Available Mobile cloud computing (MCC combines cloud computing and mobile internet to improve the computational capabilities of resource-constrained mobile devices (MDs. In MCC, mobile users could not only improve the computational capability of MDs but also save operation consumption by offloading the mobile applications to the cloud. However, MCC faces the problem of energy efficiency because of time-varying channels when the offloading is being executed. In this paper, we address the issue of energy-efficient scheduling for wireless uplink in MCC. By introducing Lyapunov optimization, we first propose a scheduling algorithm that can dynamically choose channel to transmit data based on queue backlog and channel statistics. Then, we show that the proposed scheduling algorithm can make a tradeoff between queue backlog and energy consumption in a channel-aware MCC system. Simulation results show that the proposed scheduling algorithm can reduce the time average energy consumption for offloading compared to the existing algorithm.

Peninsula Humane Society Teacher's Packet. Secondary Level.

Science.gov (United States)

Peninsula Humane Society, San Mateo, CA.

Activities in this teacher's packet are designed to familiarize secondary school students with the responsibilities involved in pet ownership. Teaching plans are provided for a total of 12 lessons grouped under social studies, language arts, math, and health sciences. Activities focus on pet overpopulation, expressions of social responses in…

Advanced driver assistance system for AHS over communication links with random packet dropouts

Science.gov (United States)

Srinivasan, Seshadhri; Ayyagari, Ramakalyan

2014-12-01

In this paper, we propose an advanced driver assist system (ADAS) for platoon based automated highway system (AHS) with packet loss in inter-vehicle communication. Using the concept of rigidity, we first show that vehicles in a platoon tend to fall apart in the event of a packet loss among vehicles. To overcome this, we propose an estimation based dynamic platooning algorithm which employs the state estimate to maintain the platoon. Communication among the vehicle is reduced by using minimum spanning tree (MST) in state estimation algorithm. Effectiveness of the proposed ADAS scheme is illustrated by simulation wherein, dynamic platoons of holonomic vehicles with integrator dynamics are considered. Simulation studies indicate that the proposed algorithm maintains the platoon up to a packet loss rate of 48%. State transmission scheme proposed in our algorithm has three significant advantages, they are: (1) it handles packet loss in inter-vehicle communication, (2) reduces the effect of error in measured output, and (3) reduces the inter-vehicle communication. These advantages significantly increase the reliability and safety of the AHS.

A first packet processing subdomain cluster model based on SDN

Science.gov (United States)

Chen, Mingyong; Wu, Weimin

2017-08-01

For the current controller cluster packet processing performance bottlenecks and controller downtime problems. An SDN controller is proposed to allocate the priority of each device in the SDN (Software Defined Network) network, and the domain contains several network devices and Controller, the controller is responsible for managing the network equipment within the domain, the switch performs data delivery based on the load of the controller, processing network equipment data. The experimental results show that the model can effectively solve the risk of single point failure of the controller, and can solve the performance bottleneck of the first packet processing.

Green partial packet recovery in wireless sensor networks

KAUST Repository

Daghistani, Anas; Ben Khalifa, Abderrahman; Showail, Ahmad; Shihada, Basem

2015-01-01

wireless sensor motes. We propose Green-Frag, a novel adaptive partial packet recovery mechanism that is energy friendly. It can help prolonging the battery life of wireless sensor motes that are usually resource constrained. It dynamically partitions

Ripples in Communication : Reconfigurable and Adaptive Wireless Communication Systems based on Wavelet Packet Modulators

NARCIS (Netherlands)

Lakshmanan, M.K.

2011-01-01

Wavelet Packet Modulation (WPM) is a multi-carrier transmission technique that uses orthogonal wavelet packet bases to combine a collection of information bits into a single composite signal. This system can be considered as a viable alternative, for wide-band communication, to the popular

Implementation of Digital Awareness Strategies to Engage Patients and Providers in a Lung Cancer Screening Program: Retrospective Study.

Science.gov (United States)

Jessup, Dana L; Glover Iv, McKinley; Daye, Dania; Banzi, Lynda; Jones, Philip; Choy, Garry; Shepard, Jo-Anne O; Flores, Efrén J

2018-02-15

Lung cancer is the leading cause of cancer-related deaths in the United States. Despite mandated insurance coverage for eligible patients, lung cancer screening rates remain low. Digital platforms, including social media, provide a potentially valuable tool to enhance health promotion and patient engagement related to lung cancer screening (LCS). The aim was to assess the effectiveness of LCS digital awareness campaigns on utilization of low-dose computed tomography (LDCT) and visits to institutional online educational content. A pay-per-click campaign utilizing Google and Facebook targeted adults aged 55 years and older and caregivers aged 18 years and older (eg, spouses, adult children) with LCS content during a 20-week intervention period from May to September 2016. A concurrent pay-per-click campaign using LinkedIn and Twitter targeted health care providers with LCS content. Geographic target radius was within 60 miles of an academic medical center. Social media data included aggregate demographics and click-through rates (CTRs). Primary outcome measures were visits to institutional Web pages and scheduled LDCT exams. Study period was 20 weeks before, during, and after the digital awareness campaigns. Weekly visits to the institutional LCS Web pages were significantly higher during the digital awareness campaigns compared to the 20-week period prior to implementation (mean 823.9, SD 905.8 vs mean 51, SD 22.3, P=.001). The patient digital awareness campaign surpassed industry standard CTRs on Google (5.85%, 1108/18,955 vs 1.8%) and Facebook (2.59%, 47,750/1,846,070 vs 0.8%). The provider digital awareness campaign surpassed industry standard CTR on LinkedIn (1.1%, 630/57,079 vs 0.3%) but not Twitter (0.19%, 1139/587,133 vs 0.25%). Mean scheduled LDCT exam volumes per week before, during, and after the digital awareness campaigns were 17.4 (SD 7.5), 20.4 (SD 5.4), and 26.2 (SD 6.4), respectively, with the difference between the mean number of scheduled exams

Detection Performance of Packet Arrival under Downclocking for Mobile Edge Computing

Directory of Open Access Journals (Sweden)

Zhimin Wang

2018-01-01

Full Text Available Mobile edge computing (MEC enables battery-powered mobile nodes to acquire information technology services at the network edge. These nodes desire to enjoy their service under power saving. The sampling rate invariant detection (SRID is the first downclocking WiFi technique that can achieve this objective. With SRID, a node detects one packet arrival at a downclocked rate. Upon a successful detection, the node reverts to a full-clocked rate to receive the packet immediately. To ensure that a node acquires its service immediately, the detection performance (namely, the miss-detection probability and the false-alarm probability of SRID is of importance. This paper is the first one to theoretically study the crucial impact of SRID attributes (e.g., tolerance threshold, correlation threshold, and energy ratio threshold on the packet detection performance. Extensive Monte Carlo experiments show that our theoretical model is very accurate. This study can help system developers set reasonable system parameters for WiFi downclocking.

The performance analysis of linux networking - packet receiving

Energy Technology Data Exchange (ETDEWEB)

Wu, Wenji; Crawford, Matt; Bowden, Mark; /Fermilab

2006-11-01

The computing models for High-Energy Physics experiments are becoming ever more globally distributed and grid-based, both for technical reasons (e.g., to place computational and data resources near each other and the demand) and for strategic reasons (e.g., to leverage equipment investments). To support such computing models, the network and end systems, computing and storage, face unprecedented challenges. One of the biggest challenges is to transfer scientific data sets--now in the multi-petabyte (10{sup 15} bytes) range and expected to grow to exabytes within a decade--reliably and efficiently among facilities and computation centers scattered around the world. Both the network and end systems should be able to provide the capabilities to support high bandwidth, sustained, end-to-end data transmission. Recent trends in technology are showing that although the raw transmission speeds used in networks are increasing rapidly, the rate of advancement of microprocessor technology has slowed down. Therefore, network protocol-processing overheads have risen sharply in comparison with the time spent in packet transmission, resulting in degraded throughput for networked applications. More and more, it is the network end system, instead of the network, that is responsible for degraded performance of network applications. In this paper, the Linux system's packet receive process is studied from NIC to application. We develop a mathematical model to characterize the Linux packet receiving process. Key factors that affect Linux systems network performance are analyzed.

Scheduling the scheduling task : a time management perspective on scheduling

NARCIS (Netherlands)

Larco Martinelli, J.A.; Wiers, V.C.S.; Fransoo, J.C.

2013-01-01

Time is the most critical resource at the disposal of schedulers. Hence, an adequate management of time from the schedulers may impact positively on the scheduler’s productivity and responsiveness to uncertain scheduling environments. This paper presents a field study of how schedulers make use of

Synchronization, retiming and time-division multiplexing of an asynchronous 10 gigabit NRZ Ethernet packet to Terabit Ethernet

DEFF Research Database (Denmark)

Hu, Hao; Laguardia Areal, Janaina; Mulvad, Hans Christian Hansen

2011-01-01

An asynchronous 10 Gb/s Ethernet packet with maximum packet size of 1518 bytes is synchronized and retimed to a master clock with 200 kHz frequency offset using a time lens. The NRZ packet is simultaneously converted into an RZ packet, then further pulse compressed to a FWHM of 400 fs and finally...... time-division multiplexed with a serial 1.28 Tb/s signal including a vacant time slot, thus forming a 1.29 Tb/s time-division multiplexed serial signal. Error-free performance of synchronizing, retiming, time-division multiplexing to a Terabit data stream and finally demultiplexing back to 10 Gb...

Cherenkov Radiation Control via Self-accelerating Wave-packets.

Science.gov (United States)

Hu, Yi; Li, Zhili; Wetzel, Benjamin; Morandotti, Roberto; Chen, Zhigang; Xu, Jingjun

2017-08-18

Cherenkov radiation is a ubiquitous phenomenon in nature. It describes electromagnetic radiation from a charged particle moving in a medium with a uniform velocity larger than the phase velocity of light in the same medium. Such a picture is typically adopted in the investigation of traditional Cherenkov radiation as well as its counterparts in different branches of physics, including nonlinear optics, spintronics and plasmonics. In these cases, the radiation emitted spreads along a "cone", making it impractical for most applications. Here, we employ a self-accelerating optical pump wave-packet to demonstrate controlled shaping of one type of generalized Cherenkov radiation - dispersive waves in optical fibers. We show that, by tuning the parameters of the wave-packet, the emitted waves can be judiciously compressed and focused at desired locations, paving the way to such control in any physical system.

Adaptive sampling rate control for networked systems based on statistical characteristics of packet disordering.

Science.gov (United States)

Li, Jin-Na; Er, Meng-Joo; Tan, Yen-Kheng; Yu, Hai-Bin; Zeng, Peng

2015-09-01

This paper investigates an adaptive sampling rate control scheme for networked control systems (NCSs) subject to packet disordering. The main objectives of the proposed scheme are (a) to avoid heavy packet disordering existing in communication networks and (b) to stabilize NCSs with packet disordering, transmission delay and packet loss. First, a novel sampling rate control algorithm based on statistical characteristics of disordering entropy is proposed; secondly, an augmented closed-loop NCS that consists of a plant, a sampler and a state-feedback controller is transformed into an uncertain and stochastic system, which facilitates the controller design. Then, a sufficient condition for stochastic stability in terms of Linear Matrix Inequalities (LMIs) is given. Moreover, an adaptive tracking controller is designed such that the sampling period tracks a desired sampling period, which represents a significant contribution. Finally, experimental results are given to illustrate the effectiveness and advantages of the proposed scheme. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

On the definition of the momentum of an Alfven wave packet

International Nuclear Information System (INIS)

Khudik, V.N.

1993-01-01

The different definitions of the momentum of a wave disturbance are considered, corresponding to the invariance of the Lagrangian with respect to different kinds of translation in magnetohydrodynamics. It is shown that the value of the momentum of an Alfven wave packet calculated using the definition accepted in the electrodynamics of continuous media is not the same as the total momentum of the particles in the medium and the electromagnetic field in the region within which the packet is localized. 5 refs., 2 figs

Time-Frequency Distribution of Music based on Sparse Wavelet Packet Representations

DEFF Research Database (Denmark)

Endelt, Line Ørtoft

We introduce a new method for generating time-frequency distributions, which is particularly useful for the analysis of music signals. The method presented here is based on $\\ell1$ sparse representations of music signals in a redundant wavelet packet dictionary. The representations are found using...... the minimization methods basis pursuit and best orthogonal basis. Visualizations of the time-frequency distribution are constructed based on a simplified energy distribution in the wavelet packet decomposition. The time-frequency distributions emphasizes structured musical content, including non-stationary content...

Extracting continuum information from Ψ(t) in time-dependent wave-packet calculations

International Nuclear Information System (INIS)

Madsen, L. B.; Nikolopoulos, L. A. A.; Kjeldsen, T. K.; Fernandez, J.

2007-01-01

The theory of measurement projection operators in grid-based time-dependent wave-packet calculations involving electronic continua in atoms and molecules is discussed. A hierarchy of projection operators relevant in their individual restricted configuration spaces is presented. At asymptotically large distances from the scattering or interaction center the projection operators involve plane waves only. To reach this asymptotic regime, however, large propagation times and large boxes may be required. At somewhat smaller distances from the scattering center, the projection operators are expressed in terms of analytical single-center Coulomb scattering waves with incoming wave boundary conditions. If propagation of the wave packet to these asymptotic regimes is impeded, the projection operators involve the exact scattering states which are not readily available in the wave-packet calculation and hence must be supplied by an additional, typically very demanding, calculation. The present approach suggests an exact way of analyzing the timely problem of the one-electron continuum in nonperturbative calculations. A key feature is that the propagated wave packet includes every interaction of the full Hamiltonian. The practicality of the proposed method is illustrated by the nontrivial example of strong-field ionization of the molecular hydrogen ion. Finally, the extension of the presented ideas to single and double ionization of two-electron systems is discussed

Error and Congestion Resilient Video Streaming over Broadband Wireless

Directory of Open Access Journals (Sweden)

Laith Al-Jobouri

2015-04-01

Full Text Available In this paper, error resilience is achieved by adaptive, application-layer rateless channel coding, which is used to protect H.264/Advanced Video Coding (AVC codec data-partitioned videos. A packetization strategy is an effective tool to control error rates and, in the paper, source-coded data partitioning serves to allocate smaller packets to more important compressed video data. The scheme for doing this is applied to real-time streaming across a broadband wireless link. The advantages of rateless code rate adaptivity are then demonstrated in the paper. Because the data partitions of a video slice are each assigned to different network packets, in congestion-prone wireless networks the increased number of packets per slice and their size disparity may increase the packet loss rate from buffer overflows. As a form of congestion resilience, this paper recommends packet-size dependent scheduling as a relatively simple way of alleviating the buffer-overflow problem arising from data-partitioned packets. The paper also contributes an analysis of data partitioning and packet sizes as a prelude to considering scheduling regimes. The combination of adaptive channel coding and prioritized packetization for error resilience with packet-size dependent packet scheduling results in a robust streaming scheme specialized for broadband wireless and real-time streaming applications such as video conferencing, video telephony, and telemedicine.

Packet-switched data communication system of the Paks Nuclear Power Plant, Hungary

International Nuclear Information System (INIS)

Szuegyi, M.

1991-01-01

Data communication systems are inherent components of the computer network of nuclear power plants. In the PNPP, Hungary, a new packet-switched network has been installed, based on the X25 protocol. It was developed in the framework of the Information Infrastructure Development project of the country. The most important system and software components of the new packet-switched communication system and computer network installed at PNPP are described. (R.P.) 4 refs.; 1 fig

Implementation of fast handover for proxy mobile IPv6: Resolving out-of-order packets.

Science.gov (United States)

Kang, Byungseok; Anh, Khuong Quoc; Choo, Hyunseung

2017-01-01

Mobile IP allows for location-independent routing of IP datagrams on the Internet. Mobile IP specifies how a mobile node (MN) registers with its home agent and how the home agent routes datagrams to the MN through the tunnel. Current Mobile IP protocols have difficulties meeting the stringent handover delay requirements of future wireless networks. Fast handover for Proxy Mobile IPv6 (FPMIPv6) is used to resolve handover latency and packet loss problems that occur in the Proxy Mobile IPv6 (PMIPv6) protocol. However, while implementing the FPMIPv6 scheme in a testbed, we encounter the out-of-order packet (OoOP) problem. The cause of this problem is the existence of two paths for data transmitted from a correspondent node (CN) to an MN. Since the problem affects the quality of service (QoS) of the network and the performance of the MN, we propose a new scheme using the last packet marker and packet buffering to solve this problem in FPMIPv6. The new Mobile Access Gateway (MAG) can control and deliver the data transmitted via the old path or the new path to an MN in order, using the last packet marker to notify the end of the data delivery in the old path and the packet buffering for holding the data delivered in the new path. We implement both the proposed scheme and FPMIPv6 in a testbed as a real network environment to demonstrate the correctness, cost effectiveness, and performance of the proposed scheme. A performance evaluation reveals that the proposed scheme can handle the OoOP problem efficiently.

Implementation of fast handover for proxy mobile IPv6: Resolving out-of-order packets.

Directory of Open Access Journals (Sweden)

Byungseok Kang

Full Text Available Mobile IP allows for location-independent routing of IP datagrams on the Internet. Mobile IP specifies how a mobile node (MN registers with its home agent and how the home agent routes datagrams to the MN through the tunnel. Current Mobile IP protocols have difficulties meeting the stringent handover delay requirements of future wireless networks. Fast handover for Proxy Mobile IPv6 (FPMIPv6 is used to resolve handover latency and packet loss problems that occur in the Proxy Mobile IPv6 (PMIPv6 protocol. However, while implementing the FPMIPv6 scheme in a testbed, we encounter the out-of-order packet (OoOP problem. The cause of this problem is the existence of two paths for data transmitted from a correspondent node (CN to an MN. Since the problem affects the quality of service (QoS of the network and the performance of the MN, we propose a new scheme using the last packet marker and packet buffering to solve this problem in FPMIPv6. The new Mobile Access Gateway (MAG can control and deliver the data transmitted via the old path or the new path to an MN in order, using the last packet marker to notify the end of the data delivery in the old path and the packet buffering for holding the data delivered in the new path. We implement both the proposed scheme and FPMIPv6 in a testbed as a real network environment to demonstrate the correctness, cost effectiveness, and performance of the proposed scheme. A performance evaluation reveals that the proposed scheme can handle the OoOP problem efficiently.

State reconstruction of one-dimensional wave packets

Science.gov (United States)

Krähmer, D. S.; Leonhardt, U.

1997-12-01

We review and analyze the method [U. Leonhardt, M.G. Raymer: Phys. Rev. Lett. 76, 1985 (1996)] for quantum-state reconstruction of one-dimensional non-relativistic wave packets from position observations. We illuminate the theoretical background of the technique and show how to extend the procedure to the continuous part of the spectrum.

Hardware Accelerators Targeting a Novel Group Based Packet Classification Algorithm

Directory of Open Access Journals (Sweden)

O. Ahmed

2013-01-01

Full Text Available Packet classification is a ubiquitous and key building block for many critical network devices. However, it remains as one of the main bottlenecks faced when designing fast network devices. In this paper, we propose a novel Group Based Search packet classification Algorithm (GBSA that is scalable, fast, and efficient. GBSA consumes an average of 0.4 megabytes of memory for a 10 k rule set. The worst-case classification time per packet is 2 microseconds, and the preprocessing speed is 3 M rules/second based on an Xeon processor operating at 3.4 GHz. When compared with other state-of-the-art classification techniques, the results showed that GBSA outperforms the competition with respect to speed, memory usage, and processing time. Moreover, GBSA is amenable to implementation in hardware. Three different hardware implementations are also presented in this paper including an Application Specific Instruction Set Processor (ASIP implementation and two pure Register-Transfer Level (RTL implementations based on Impulse-C and Handel-C flows, respectively. Speedups achieved with these hardware accelerators ranged from 9x to 18x compared with a pure software implementation running on an Xeon processor.

Packet-Based Control Algorithms for Cooperative Surveillance and Reconnaissance

National Research Council Canada - National Science Library

Murray, Richard M

2007-01-01

..., and repeated transmissions. Results include analysis and design of estimation and control algorithms in the presence of packet loss and across multi-hop data networks, distributed estimation and sensor fusion algorithms...

Service time analysis of secondary packet transmission with opportunistic channel access

KAUST Repository

Usman, Muneer; Yang, Hongchuan; Alouini, Mohamed-Slim

2014-01-01

Cognitive radio transceiver can opportunistically access the underutilized channels of primary systems for new wireless services. The secondary transmission may be interrupted by the primary user's transmission. To facilitate the delay analysis of such secondary packet transmission, we study the resulting extended delivery time for a fixed-size secondary packet that includes both transmission time and waiting time. In particular we derive the exact distribution functions of extended delivery time of secondary transmission for both continuous sensing and periodic sensing cases. Selected numerical results are presented for illustrating the mathematical formulation.

Toward Massive, Ultrareliable, and Low-Latency Wireless Communication With Short Packets

DEFF Research Database (Denmark)

Durisi, Giuseppe; Koch, Tobias; Popovski, Petar

2016-01-01

Most of the recent advances in the design of high-speed wireless systems are based on information-theoretic principles that demonstrate how to efficiently transmit long data packets. However, the upcoming wireless systems, notably the fifth-generation (5G) system, will need to support novel traffic...... that should be received with low latency and ultrahigh reliability. Current wireless systems are not designed to support short-packet transmissions. For example, the design of current systems relies on the assumption that the metadata (control information) is of negligible size compared to the actual...

Service time analysis of secondary packet transmission with opportunistic channel access

KAUST Repository

Usman, Muneer

2014-09-01

Cognitive radio transceiver can opportunistically access the underutilized channels of primary systems for new wireless services. The secondary transmission may be interrupted by the primary user\\'s transmission. To facilitate the delay analysis of such secondary packet transmission, we study the resulting extended delivery time for a fixed-size secondary packet that includes both transmission time and waiting time. In particular we derive the exact distribution functions of extended delivery time of secondary transmission for both continuous sensing and periodic sensing cases. Selected numerical results are presented for illustrating the mathematical formulation.

Electromagnetic interference-aware transmission scheduling and power control for dynamic wireless access in hospital environments.

Science.gov (United States)

Phunchongharn, Phond; Hossain, Ekram; Camorlinga, Sergio

2011-11-01

We study the multiple access problem for e-Health applications (referred to as secondary users) coexisting with medical devices (referred to as primary or protected users) in a hospital environment. In particular, we focus on transmission scheduling and power control of secondary users in multiple spatial reuse time-division multiple access (STDMA) networks. The objective is to maximize the spectrum utilization of secondary users and minimize their power consumption subject to the electromagnetic interference (EMI) constraints for active and passive medical devices and minimum throughput guarantee for secondary users. The multiple access problem is formulated as a dual objective optimization problem which is shown to be NP-complete. We propose a joint scheduling and power control algorithm based on a greedy approach to solve the problem with much lower computational complexity. To this end, an enhanced greedy algorithm is proposed to improve the performance of the greedy algorithm by finding the optimal sequence of secondary users for scheduling. Using extensive simulations, the tradeoff in performance in terms of spectrum utilization, energy consumption, and computational complexity is evaluated for both the algorithms.

On the fly all-optical packet switching based on hybrid WDM/OCDMA labeling scheme

Science.gov (United States)

Brahmi, Houssem; Giannoulis, Giannis; Menif, Mourad; Katopodis, Vasilis; Kalavrouziotis, Dimitrios; Kouloumentas, Christos; Groumas, Panos; Kanakis, Giannis; Stamatiadis, Christos; Avramopoulos, Hercules; Erasme, Didier

2014-02-01

We introduce a novel design of an all-optical packet routing node that allows for the selection and forwarding of optical packets based on the routing information contained in hybrid wavelength division multiplexing/optical code division multiple access (WDM/OCDMA) labels. A stripping paradigm of optical code-label is adopted. The router is built around an optical-code gate that consists in an optical flip-flop controlled by two fiber Bragg grating correlators and is combined with a Mach-Zehnder interferometer (MZI)-based forwarding gate. We experimentally verify the proof-of-principle operation of the proposed self-routing node under NRZ and OCDMA packet traffic conditions. The successful switching of elastic NRZ payload at 40 Gb/s controlled by DS-OCDMA coded labels and the forwarding operation of encoded data using EQC codes are presented. Proper auto-correlation functions are obtained with higher than 8.1 dB contrast ratio, suitable to efficiently trigger the latching device with a contrast ratio of 11.6 dB and switching times below 3.8 ns. Error-free operation is achieved with 1.5 dB penalty for 40 Gb/s NRZ data and with 2.1 dB penalty for DS-OCDMA packets. The scheme can further be applied to large-scale optical packet switching networks by exploiting efficient optical coders allocated at different WDM channels.

INTERNET TRAFFIC AND PACKET ROUND TRIP DELAY SELF ...

African Journals Online (AJOL)

object of our interest)- is preserved with respect to scaling in space and/or ... models and the standard models for packet traffic considered in the ... tlle structure of the Internet, but failed to exhaustively ... the vehicle of Sel.fSimilar processes ...

Stochastic ℋ∞ Finite-Time Control of Discrete-Time Systems with Packet Loss

Directory of Open Access Journals (Sweden)

Yingqi Zhang

2012-01-01

Full Text Available This paper investigates the stochastic finite-time stabilization and ℋ∞ control problem for one family of linear discrete-time systems over networks with packet loss, parametric uncertainties, and time-varying norm-bounded disturbance. Firstly, the dynamic model description studied is given, which, if the packet dropout is assumed to be a discrete-time homogenous Markov process, the class of discrete-time linear systems with packet loss can be regarded as Markovian jump systems. Based on Lyapunov function approach, sufficient conditions are established for the resulting closed-loop discrete-time system with Markovian jumps to be stochastic ℋ∞ finite-time boundedness and then state feedback controllers are designed to guarantee stochastic ℋ∞ finite-time stabilization of the class of stochastic systems. The stochastic ℋ∞ finite-time boundedness criteria can be tackled in the form of linear matrix inequalities with a fixed parameter. As an auxiliary result, we also give sufficient conditions on the robust stochastic stabilization of the class of linear systems with packet loss. Finally, simulation examples are presented to illustrate the validity of the developed scheme.

40-Gbps optical backbone network deep packet inspection based on FPGA

Science.gov (United States)

Zuo, Yuan; Huang, Zhiping; Su, Shaojing

2014-11-01

In the era of information, the big data, which contains huge information, brings about some problems, such as high speed transmission, storage and real-time analysis and process. As the important media for data transmission, the Internet is the significant part for big data processing research. With the large-scale usage of the Internet, the data streaming of network is increasing rapidly. The speed level in the main fiber optic communication of the present has reached 40Gbps, even 100Gbps, therefore data on the optical backbone network shows some features of massive data. Generally, data services are provided via IP packets on the optical backbone network, which is constituted with SDH (Synchronous Digital Hierarchy). Hence this method that IP packets are directly mapped into SDH payload is named POS (Packet over SDH) technology. Aiming at the problems of real time process of high speed massive data, this paper designs a process system platform based on ATCA for 40Gbps POS signal data stream recognition and packet content capture, which employs the FPGA as the CPU. This platform offers pre-processing of clustering algorithms, service traffic identification and data mining for the following big data storage and analysis with high efficiency. Also, the operational procedure is proposed in this paper. Four channels of 10Gbps POS signal decomposed by the analysis module, which chooses FPGA as the kernel, are inputted to the flow classification module and the pattern matching component based on TCAM. Based on the properties of the length of payload and net flows, buffer management is added to the platform to keep the key flow information. According to data stream analysis, DPI (deep packet inspection) and flow balance distribute, the signal is transmitted to the backend machine through the giga Ethernet ports on back board. Practice shows that the proposed platform is superior to the traditional applications based on ASIC and NP.

Combined Rate and Power Allocation with Link Scheduling in Wireless Data Packet Relay Networks with Fading Channels

OpenAIRE

Subhrakanti Dey; Minyi Huang

2007-01-01

We consider a joint rate and power control problem in a wireless data traffic relay network with fading channels. The optimization problem is formulated in terms of power and rate selection, and link transmission scheduling. The objective is to seek high aggregate utility of the relay node when taking into account buffer load management and power constraints. The optimal solution for a single transmitting source is computed by a two-layer dynamic programming algorithm which leads to optimal ...

In the Public Interest: Law, Government, and Media. Maryland Women's History Resource Packet--1986.

Science.gov (United States)

Maryland State Commission for Women, Baltimore.

Designed to be used for National Women's History Week (March 2-8), this 1986 Maryland women's history resource packet centers around Maryland women who have made significant volunteer and career contributions in the areas of government, law, and the public interest media. The packet begins with suggested student activity lists and activity sheets…

Wavelet Packet Entropy in Speaker-Independent Emotional State Detection from Speech Signal

OpenAIRE

Mina Kadkhodaei Elyaderani; Seyed Hamid Mahmoodian; Ghazaal Sheikhi

2015-01-01

In this paper, wavelet packet entropy is proposed for speaker-independent emotion detection from speech. After pre-processing, wavelet packet decomposition using wavelet type db3 at level 4 is calculated and Shannon entropy in its nodes is calculated to be used as feature. In addition, prosodic features such as first four formants, jitter or pitch deviation amplitude, and shimmer or energy variation amplitude besides MFCC features are applied to complete the feature vector. Then, Support Vect...

Coherent structural trapping through wave packet dispersion during photoinduced spin state switching

DEFF Research Database (Denmark)

Lemke, Henrik T.; Kjær, Kasper Skov; Hartsock, Robert

2017-01-01

The description of ultrafast nonadiabatic chemical dynamics during molecular photo-transformations remains challenging because electronic and nuclear configurations impact each other and cannot be treated independently. Here we gain experimental insights, beyond the Born-Oppenheimer approximation...... is distinguished from the structural trapping dynamics, which launches a coherent oscillating wave packet (265 fs period), clearly identified as molecular breathing. Throughout the structural trapping, the dispersion of the wave packet along the reaction coordinate reveals details of intramolecular vibronic...

Accelerometer North Finding System Based on the Wavelet Packet De-noising Algorithm and Filtering Circuit

Directory of Open Access Journals (Sweden)

LU Yongle

2014-07-01

Full Text Available This paper demonstrates a method and system for north finding with a low-cost piezoelectricity accelerometer based on the Coriolis acceleration principle. The proposed setup is based on the choice of an accelerometer with residual noise of 35 ng•Hz-1/2. The plane of the north finding system is aligned parallel to the local level, which helps to eliminate the effect of plane error. The Coriolis acceleration caused by the earth’s rotation and the acceleration’s instantaneous velocity is much weaker than the g-sensitivity acceleration. To get a high accuracy and a shorter time for north finding system, in this paper, the Filtering Circuit and the wavelet packet de-nosing algorithm are used as the following. First, the hardware is designed as the alternating currents across by filtering circuit, so the DC will be isolated and the weak AC signal will be amplified. The DC is interfering signal generated by the earth's gravity. Then, we have used a wavelet packet to filter the signal which has been done through the filtering circuit. Finally, compare the north finding results measured by wavelet packet filtering with those measured by a low-pass filter. Wavelet filter de-noise data shows that wavelet packet filtering and wavelet filter measurement have high accuracy. Wavelet Packet filtering has stronger ability to remove burst noise and higher engineering environment adaptability than that of Wavelet filtering. Experimental results prove the effectiveness and project implementation of the accelerometer north finding method based on wavelet packet de-noising algorithm.

Diversity Techniques for Single-Carrier Packet Retransmissions over Frequency-Selective Channels

Directory of Open Access Journals (Sweden)

Assimi Abdel-Nasser

2009-01-01

Full Text Available In data packet communication systems over multipath frequency-selective channels, hybrid automatic repeat request (HARQ protocols are usually used in order to ensure data reliability. For single-carrier packet transmission in slow fading environment, an identical retransmission of the same packet, due to a decoding failure, does not fully exploit the available time diversity in retransmission-based HARQ protocols. In this paper, we compare two transmit diversity techniques, namely, cyclic frequency-shift diversity and bit-interleaving diversity. Both techniques can be integrated in the HARQ scheme in order to improve the performance of the joint detector. Their performance in terms of pairwise error probability is investigated using maximum likelihood detection and decoding. The impact of the channel memory and the modulation order on the performance gain is emphasized. In practice, we use low complexity linear filter-based equalization which can be efficiently implemented in the frequency domain. The use of iterative equalization and decoding is also considered. The performance gain in terms of frame error rate and data throughput is evaluated by numerical simulations.

Fast Packet forwarding Engine Based on Software Circuits

NARCIS (Netherlands)

Makkes, M.X.; Varabanescu, A.; Laat, C. de; Meijer, R.J.

2015-01-01

Forwarding packets is part of the performance critical path of routing devices, and affects the network performance at any scale. This operation is typically performed by dedicated routing boxes, which are fast, but expensive and inflexible. Recent work has shown that in many cases commodity

Voice Quality Measuring Setup with Automatic Voice over IP Call Generator and Lawful Interception Packet Analyzer

Directory of Open Access Journals (Sweden)

PLEVA Matus

Full Text Available This paper describes the packet measuring laboratory setup, which could be used also for lawful interception applications, using professional packet analyzer, Voice over IP call generator, free call server (Asterisk linux setup and appropriate software and hardware described below. This setup was used for measuring the quality of the automatically generated VoIP calls under stressed network conditions, when the call manager server was flooded with high bandwidth traffic, near the bandwidth limit of the connected switch. The call generator realizes 30 calls simultaneously and the packet capturer & analyzercould decode the VoIP traffic, extract RTP session data, automatically analyze the voice quality using standardized MOS (Mean Opinion Score values and describe also the source of the voice degradation (jitter, packet loss, codec, delay, etc..

Scattering of wave packets with phases

Energy Technology Data Exchange (ETDEWEB)

Karlovets, Dmitry V. [Department of Physics, Tomsk State University, Lenina Ave. 36, 634050 Tomsk (Russian Federation)

2017-03-09

A general problem of 2→N{sub f} scattering is addressed with all the states being wave packets with arbitrary phases. Depending on these phases, one deals with coherent states in (3+1) D, vortex particles with orbital angular momentum, the Airy beams, and their generalizations. A method is developed in which a number of events represents a functional of the Wigner functions of such states. Using width of a packet σ{sub p}/〈p〉 as a small parameter, the Wigner functions, the number of events, and a cross section are represented as power series in this parameter, the first non-vanishing corrections to their plane-wave expressions are derived, and generalizations for beams are made. Although in this regime the Wigner functions turn out to be everywhere positive, the cross section develops new specifically quantum features, inaccessible in the plane-wave approximation. Among them is dependence on an impact parameter between the beams, on phases of the incoming states, and on a phase of the scattering amplitude. A model-independent analysis of these effects is made. Two ways of measuring how a Coulomb phase and a hadronic one change with a transferred momentum t are discussed.

Massachusetts Bay - Internal wave packets digitized from SAR imagery

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This feature class contains internal wave packets digitized from SAR imagery at 1:350,000 scale in Massachusetts Bay. Internal waves are nonsinusoidal waves that...

Efficient incremental relaying for packet transmission over fading channels

KAUST Repository

Fareed, Muhammad Mehboob; Alouini, Mohamed-Slim; Yang, Hongchuan

2014-01-01

In this paper, we propose a novel relaying scheme for packet transmission over fading channels, which improves the spectral efficiency of cooperative diversity systems by utilizing limited feedback from the destination. Our scheme capitalizes

Using All-Sky Imaging to Improve Telescope Scheduling (Abstract)

Science.gov (United States)

Cole, G. M.

2017-12-01

(Abstract only) Automated scheduling makes it possible for a small telescope to observe a large number of targets in a single night. But when used in areas which have less-than-perfect sky conditions such automation can lead to large numbers of observations of clouds and haze. This paper describes the development of a "sky-aware" telescope automation system that integrates the data flow from an SBIG AllSky340c camera with an enhanced dispatch scheduler to make optimum use of the available observing conditions for two highly instrumented backyard telescopes. Using the minute-by-minute time series image stream and a self-maintained reference database, the software maintains a file of sky brightness, transparency, stability, and forecasted visibility at several hundred grid positions. The scheduling software uses this information in real time to exclude targets obscured by clouds and select the best observing task, taking into account the requirements and limits of each instrument.

Reduction in Power Consumption of Packet Counter on VIRTEX-6 FPGA by Frequency Scaling

DEFF Research Database (Denmark)

Pandey, Nisha; Pandey, Bishwajeet; Hussain, Dil muhammed Akbar

2017-01-01

In Today’s World it is very easy to share the information fast may be within seconds or even may be less. However, the required data is shared so it is the main concern. We share data over web and data is transferred in the form of packets. How these data packets are transmitted is all concept of...

Dispersionless wave packets in Dirac materials

Czech Academy of Sciences Publication Activity Database

Jakubský, Vít; Tušek, M.

2017-01-01

Roč. 378, MAR (2017), s. 171-182 ISSN 0003-4916 R&D Projects: GA ČR(CZ) GJ15-07674Y; GA ČR GA17-01706S Institutional support: RVO:61389005 Keywords : quantum systems * wave packets * dispersion * dirac materials Subject RIV: BE - Theoretical Physics OBOR OECD: Atomic, molecular and chemical physics ( physics of atoms and molecules including collision, interaction with radiation, magnetic resonances, Mössbauer effect) Impact factor: 2.465, year: 2016

Random Shift and XOR of Unequal-sized Packets (RaSOR) to Shave off Transmission Overhead

DEFF Research Database (Denmark)

Taghouti, Maroua; Roetter, Daniel Enrique Lucani; Fitzek, Frank Hanns Paul

2017-01-01

We propose the design of a novel coding scheme of unequal-sized packets. Unlike the conventional wisdom that consists of brute-force zero-padding in Random Linear Network Coding (RLNC), we exploit this heterogeneity to shave off this trailing overhead and transmit considerably less coded packets....

Quantum mechanical analysis of the equilateral triangle billiard: Periodic orbit theory and wave packet revivals

International Nuclear Information System (INIS)

Doncheski, M.A.; Robinett, R.W.

2002-01-01

Using the fact that the energy eigenstates of the equilateral triangle infinite well (or billiard) are available in closed form, we examine the connections between the energy eigenvalue spectrum and the classical closed paths in this geometry, using both periodic orbit theory and the short-term semi-classical behavior of wave packets. We also discuss wave packet revivals and show that there are exact revivals, for all wave packets, at times given by T rev =9μa 2 /4(h/2π) where a and μ are the length of one side and the mass of the point particle, respectively. We find additional cases of exact revivals with shorter revival times for zero-momentum wave packets initially located at special symmetry points inside the billiard. Finally, we discuss simple variations on the equilateral (60 deg. -60 deg. -60 deg. ) triangle, such as the half equilateral (30 deg. -60 deg. -90 deg.) triangle and other 'foldings', which have related energy spectra and revival structures

Effect of surface topography and morphology on space charge packets in polyethylene

International Nuclear Information System (INIS)

Zhou Yuanxiang; Wang Yunshan; Sun Qinghua; Wang Ninghua

2009-01-01

Polyethylene (PE) is a major kind of internal insulating material. With great progresses of space charge measurement technologies in the last three decades, lots of researches are focused on space charge in PE. The heat pressing and annealing condition of polyethylene affect its morphology obviously. During the heat pressing, the surface of PE forms different surface topographies because of different substrate materials. Surface topography has great relation to the epitaxial crystallization layer and influences the space charge characteristic of PE dramatically. This paper studied the formation process of different surface topographies and their micrographic characters in low density polyethylene (LDPE). pulsed electro-acoustic (PEA) method was used to measure the space charge distribution of samples with different surface topographies and morphologies in LDPE. The effect of surface topography and morphology to space charge packet were studied. The surface topography has great influence on space charge packet polarity and morphology has influence on both movement speed rate and polarity of space charge packet.

Optimal design of mixed-media packet-switching networks - Routing and capacity assignment

Science.gov (United States)

Huynh, D.; Kuo, F. F.; Kobayashi, H.

1977-01-01

This paper considers a mixed-media packet-switched computer communication network which consists of a low-delay terrestrial store-and-forward subnet combined with a low-cost high-bandwidth satellite subnet. We show how to route traffic via ground and/or satellite links by means of static, deterministic procedures and assign capacities to channels subject to a given linear cost such that the network average delay is minimized. Two operational schemes for this network model are investigated: one is a scheme in which the satellite channel is used as a slotted ALOHA channel; the other is a new multiaccess scheme we propose in which whenever a channel collision occurs, retransmission of the involved packets will route through ground links to their destinations. The performance of both schemes is evaluated and compared in terms of cost and average packet delay tradeoffs for some examples. The results offer guidelines for the design and optimal utilization of mixed-media networks.

Monitoring Agent for Detecting Malicious Packet Drops for Wireless Sensor Networks in the Microgrid and Grid-Enabled Vehicles

Directory of Open Access Journals (Sweden)

Jongbin Ko

2012-05-01

Full Text Available Of the range of wireless communication technologies, wireless sensor networks (WSN will be one of the most appropriate technologies for the Microgrid and Grid-enabled Vehicles in the Smartgrid. To ensure the security of WSN, the detection of attacks is more efficient than their prevention because of the lack of computing power. Malicious packet drops are the easiest means of attacking WSNs. Thus, the sensors used for constructing a WSN require a packet drop monitoring agent, such as Watchdog. However, Watchdog has a partial drop problem such that an attacker can manipulate the packet dropping rate below the minimum misbehaviour monitoring threshold. Furthermore, Watchdog does not consider real traffic situations, such as congestion and collision, and so it has no way of recognizing whether a packet drop is due to a real attack or network congestion. In this paper, we propose a malicious packet drop monitoring agent, which considers traffic conditions. We used the actual traffic volume on neighbouring nodes and the drop rate while monitoring a sending node for specific period. It is more effective in real network scenarios because unlike Watchdog it considers the actual traffic, which only uses the Pathrater. Moreover, our proposed method does not require authentication, packet encryption or detection packets. Thus, there is a lower likelihood of detection failure due to packet spoofing, Man-In-the Middle attacks or Wormhole attacks. To test the suitability of our proposed concept for a series of network scenarios, we divided the simulations into three types: one attack node, more than one attack nodes and no attack nodes. The results of the simulations meet our expectations.

Forwarding techniques for IP fragmented packets in a real 6LoWPAN network.

Science.gov (United States)

Ludovici, Alessandro; Calveras, Anna; Casademont, Jordi

2011-01-01

Wireless Sensor Networks (WSNs) are attracting more and more interest since they offer a low-cost solution to the problem of providing a means to deploy large sensor networks in a number of application domains. We believe that a crucial aspect to facilitate WSN diffusion is to make them interoperable with external IP networks. This can be achieved by using the 6LoWPAN protocol stack. 6LoWPAN enables the transmission of IPv6 packets over WSNs based on the IEEE 802.15.4 standard. IPv6 packet size is considerably larger than that of IEEE 802.15.4 data frame. To overcome this problem, 6LoWPAN introduces an adaptation layer between the network and data link layers, allowing IPv6 packets to be adapted to the lower layer constraints. This adaptation layer provides fragmentation and header compression of IP packets. Furthermore, it also can be involved in routing decisions. Depending on which layer is responsible for routing decisions, 6LoWPAN divides routing in two categories: mesh under if the layer concerned is the adaptation layer and route over if it is the network layer. In this paper we analyze different routing solutions (route over, mesh under and enhanced route over) focusing on how they forward fragments. We evaluate their performance in terms of latency and energy consumption when transmitting IP fragmented packets. All the tests have been performed in a real 6LoWPAN implementation. After consideration of the main problems in forwarding of mesh frames in WSN, we propose and analyze a new alternative scheme based on mesh under, which we call controlled mesh under.

Forwarding Techniques for IP Fragmented Packets in a Real 6LoWPAN Network

Directory of Open Access Journals (Sweden)

Jordi Casademont

2011-01-01

Full Text Available Wireless Sensor Networks (WSNs are attracting more and more interest since they offer a low-cost solution to the problem of providing a means to deploy large sensor networks in a number of application domains. We believe that a crucial aspect to facilitate WSN diffusion is to make them interoperable with external IP networks. This can be achieved by using the 6LoWPAN protocol stack. 6LoWPAN enables the transmission of IPv6 packets over WSNs based on the IEEE 802.15.4 standard. IPv6 packet size is considerably larger than that of IEEE 802.15.4 data frame. To overcome this problem, 6LoWPAN introduces an adaptation layer between the network and data link layers, allowing IPv6 packets to be adapted to the lower layer constraints. This adaptation layer provides fragmentation and header compression of IP packets. Furthermore, it also can be involved in routing decisions. Depending on which layer is responsible for routing decisions, 6LoWPAN divides routing in two categories: mesh under if the layer concerned is the adaptation layer and route over if it is the network layer. In this paper we analyze different routing solutions (route over, mesh under and enhanced route over focusing on how they forward fragments. We evaluate their performance in terms of latency and energy consumption when transmitting IP fragmented packets. All the tests have been performed in a real 6LoWPAN implementation. After consideration of the main problems in forwarding of mesh frames in WSN, we propose and analyze a new alternative scheme based on mesh under, which we call controlled mesh under.

A feasibility study of stateful automaton packet inspection for streaming application detection systems

Science.gov (United States)

Tseng, Kuo-Kun; Lo, Jiao; Liu, Yiming; Chang, Shih-Hao; Merabti, Madjid; Ng, Felix, C. K.; Wu, C. H.

2017-10-01

The rapid development of the internet has brought huge benefits and social impacts; however, internet security has also become a great problem for users, since traditional approaches to packet classification cannot achieve satisfactory detection performance due to their low accuracy and efficiency. In this paper, a new stateful packet inspection method is introduced, which can be embedded in the network gateway and used by a streaming application detection system. This new detection method leverages the inexact automaton approach, using part of the header field and part of the application layer data of a packet. Based on this approach, an advanced detection system is proposed for streaming applications. The workflow of the system involves two stages: the training stage and the detection stage. In the training stage, the system initially captures characteristic patterns from a set of application packet flows. After this training is completed, the detection stage allows the user to detect the target application by capturing new application flows. This new detection approach is also evaluated using experimental analysis; the results of this analysis show that this new approach not only simplifies the management of the state detection system, but also improves the accuracy of data flow detection, making it feasible for real-world network applications.

Novel scheme for efficient and cost-effective forwarding of packets in optical networks without header modification

DEFF Research Database (Denmark)

Wessing, Henrik; Fjelde, Tina; Christiansen, Henrik Lehrmann

2001-01-01

We present a novel scheme for addressing the outputs in optical packet switches and demonstrate its good scalability. The scheme requires neither header modification nor distribution of routing information to the packet switches, thus reducing optical component count while simplifying network...

Multifocal ERG wavelet packet decomposition applied to glaucoma diagnosis

Directory of Open Access Journals (Sweden)

Rodríguez-Ascariz José M

2011-05-01

Full Text Available Abstract Background Glaucoma is the second-leading cause of blindness worldwide and early diagnosis is essential to its treatment. Current clinical methods based on multifocal electroretinography (mfERG essentially involve measurement of amplitudes and latencies and assume standard signal morphology. This paper presents a new method based on wavelet packet analysis of global-flash multifocal electroretinogram signals. Methods This study comprised twenty-five patients diagnosed with OAG and twenty-five control subjects. Their mfERG recordings data were used to develop the algorithm method based on wavelet packet analysis. By reconstructing the third wavelet packet contained in the fourth decomposition level (ADAA4 of the mfERG recording, it is possible to obtain a signal from which to extract a marker in the 60-80 ms time interval. Results The marker found comprises oscillatory potentials with a negative-slope basal line in the case of glaucomatous recordings and a positive-slope basal line in the case of normal signals. Application of the optimal threshold calculated in the validation cases showed that the technique proposed achieved a sensitivity of 0.81 and validation specificity of 0.73. Conclusions This new method based on mfERG analysis may be reliable enough to detect functional deficits that are not apparent using current automated perimetry tests. As new stimulation and analysis protocols develop, mfERG has the potential to become a useful tool in early detection of glaucoma-related functional deficits.

Multi-Flow Carrier Aggregation in Heterogeneous Networks: Cross-Layer Performance Analysis

KAUST Repository

Alorainy, Abdulaziz

2017-02-09

Multi-flow carrier aggregation (CA) has recently been considered to meet the increasing demand for high data rates. In this paper, we investigate the cross-layer performance of multi-flow CA for macro user equipments (MUEs) in the expanded range (ER) of small cells. We develop a fork/join (F/J) queuing analytical model that takes into account the time varying channels, the channel scheduling algorithm, partial CQI feedback and the number of component carriers deployed at each tier. Our model also accounts for stochastic packet arrivals and the packet scheduling mechanism. The analytical model developed in this paper can be used to gauge various packet-level performance parameters e.g., packet loss probability (PLP) and queuing delay. For the queuing delay, our model takes out-of-sequence packet delivery into consideration. The developed model can also be used to find the amount of CQI feedback and the packet scheduling of a particular MUE in order to offload as much traffic as possible from the macrocells to the small cells while maintaining the MUE\\'s quality of service (QoS) requirements.

Optical Synchronization of a 10-G Ethernet Packet and Time-Division Multiplexing to a 50-Gb/s Signal Using an Optical Time Lens

DEFF Research Database (Denmark)

Hu, Hao; Laguardia Areal, Janaina; Palushani, Evarist

2010-01-01

A 10-G Ethernet packet with maximum packet size of 1518 bytes is synchronized to a master clock with 200-kHz frequency offset using a time lens. The input 10-Gb/s non-return-to-zero packet is at the same time converted into a return-to-zero (RZ) packet with a pulsewidth of 10 ps and then time......-division multiplexed with four 10-Gb/s optical time-division-multiplexing (OTDM) channels, thus constituting a 50-Gb/s OTDM serial signal. Error-free performances of the synchronized RZ packet and demultiplexed packet from the aggregated 50-Gb/s OTDM signal are achieved....

Collective neutrino oscillations and neutrino wave packets

Energy Technology Data Exchange (ETDEWEB)

Akhmedov, Evgeny; Lindner, Manfred [Max-Planck-Institut für Kernphysik, Saupfercheckweg 1, 69117 Heidelberg (Germany); Kopp, Joachim, E-mail: akhmedov@mpi-hd.mpg.de, E-mail: jkopp@uni-mainz.de, E-mail: lindner@mpi-hd.mpg.de [PRISMA Cluster of Excellence and Mainz Institute for Theoretical Physics, Johannes Gutenberg University, 55099 Mainz (Germany)

2017-09-01

Effects of decoherence by wave packet separation on collective neutrino oscillations in dense neutrino gases are considered. We estimate the length of the wave packets of neutrinos produced in core collapse supernovae and the expected neutrino coherence length, and then proceed to consider the decoherence effects within the density matrix formalism of neutrino flavour transitions. First, we demonstrate that for neutrino oscillations in vacuum the decoherence effects are described by a damping term in the equation of motion of the density matrix of a neutrino as a whole (as contrasted to that of the fixed-momentum components of the neutrino density matrix). Next, we consider neutrino oscillations in ordinary matter and dense neutrino backgrounds, both in the adiabatic and non-adiabatic regimes. In the latter case we study two specific models of adiabaticity violation—one with short-term and another with extended non-adiabaticity. It is demonstrated that, while in the adiabatic case a damping term is present in the equation of motion of the neutrino density matrix (just like in the vacuum oscillation case), no such term in general appears in the non-adiabatic regime.

Structure of Langmuir and electromagnetic collapsing wave packets in two-dimensional strong plasma turbulence

International Nuclear Information System (INIS)

Alinejad, H.; Robinson, P. A.; Cairns, I. H.; Skjaeraasen, O.; Sobhanian, S.

2007-01-01

Nucleating and collapsing wave packets relevant to electromagnetic strong plasma turbulence are studied theoretically in two dimensions. Model collapsing Langmuir and transverse potentials are constructed as superpositions of approximate eigenstates of a spherically symmetric density well. Electrostatic and electromagnetic potentials containing only components with azimuthal quantum numbers m=0, 1, 2 are found to give a good representation of the electric fields of nucleating collapsing wave packets in turbulence simulations. The length scales of these trapped states are related to the electron thermal speed v e and the length scale of the density well. It is shown analytically that the electromagnetic trapped states change with v e and that for v e e > or approx. 0.17c, the Langmuir and transverse modes remain coupled during collapse, with autocorrelation lengths in a constant ratio. An investigation of energy transfer to packets localized in density wells shows that the strongest power transfer to the nucleating state occurs for Langmuir waves. Energy transitions between different trapped and free states for collapsing wave packets are studied, and the transition rate from trapped Langmuir to free plane electromagnetic waves is calculated and related to the emission of electromagnetic waves at the plasma frequency

Solar Energy Education Packet for Elementary & Secondary Students.

Science.gov (United States)

Center for Renewable Resources, Washington, DC.

The arrangement of this packet is essentially evolutionary, with a conscious effort to alternate reading assignments, activities and experiments. It begins with solar energy facts and terminology as background to introduce the reader to basic concepts. It progresses into a discussion of passive solar systems. This is followed by several projects…

Performance analysis of multi-hop wireless packet networks

Directory of Open Access Journals (Sweden)

Lim J.-T.

1997-01-01

Full Text Available In this paper, a unified analytical framework for performance analysis of multi-hop wireless packet networks is developed. The effect of coupling between the hops on the degradation of the delay-throughput characteristics and the probability of blocking is investigated. The issue of hop decoupling is addressed.

The pump-probe coupling of matter wave packets to remote lattice states

DEFF Research Database (Denmark)

Sherson, Jacob F; Park, Sung Jong; Pedersen, Poul Lindholm

2012-01-01

containing a Bose–Einstein condensate. The evolution of these wave packets is monitored in situ and their six-photon reflection at a band gap is observed. In direct analogy with pump–probe spectroscopy, a probe pulse allows for the resonant de-excitation of the wave packet into states localized around...... selected lattice sites at a long, controllable distance of more than 100 lattice sites from the main component. This precise control mechanism for ultra-cold atoms thus enables controlled quantum state preparation and splitting for quantum dynamics, metrology and simulation....

Delocalization of charge and current in a chiral quasiparticle wave packet

Science.gov (United States)

Sarkar, Subhajit

2018-03-01

A chiral quasiparticle wave packet (c-QPWP) is defined as a conventional superposition of chiral quasiparticle states corresponding to an interacting electron system in two dimensions (2D) in the presence of Rashba spin-orbit coupling (RSOC). I investigate its internal structure via studying the charge and the current densities within the first-order perturbation in the electron-electron interaction. It is found that the c-QPWP contains a localized charge which is less than the magnitude of the bare charge and the remaining charge resides at the system boundary. The amount of charge delocalized turns out to be inversely proportional to the degenerate Fermi velocity v0(=√{α2+2 μ /m }) when RSOC (with strength α ) is weak, and therefore externally tunable. For strong RSOC, the magnitudes of both the delocalized charge and the current further strongly depend on the direction of propagation of the wave packet. Both the charge and the current densities consist of an anisotropic r-2 tail away from the center of the wave packet. Possible implications of such delocalizations in real systems corresponding to 2D semiconductor heterostructure are also discussed within the context of particle injection experiments.

Service Time Analysis for Secondary Packet Transmission with Adaptive Modulation

KAUST Repository

Wang, Wen-Jing; Usman, Muneer; Yang, Hong-Chuan; Alouini, Mohamed-Slim

2017-01-01

Cognitive radio communications can opportunistically access underutilized spectrum for emerging wireless applications. With interweave cognitive implementation, secondary user transmits only if primary user does not occupy the channel and waits for transmission otherwise. Therefore, secondary packet transmission involves both transmission time and waiting time. The resulting extended delivery time (EDT) is critical to the throughput analysis of secondary system. In this paper, we study the EDT of secondary packet transmission with adaptive modulation under interweave implementation to facilitate the delay and throughput analysis of such cognitive radio system. In particular, we propose an analytical framework to derive the probability density functions of EDT considering random-length transmission and waiting slots. We also present selected numerical results to illustrate the mathematical formulations and to verify our analytical approach.

Service Time Analysis for Secondary Packet Transmission with Adaptive Modulation

KAUST Repository

Wang, Wen-Jing

2017-05-12

Cognitive radio communications can opportunistically access underutilized spectrum for emerging wireless applications. With interweave cognitive implementation, secondary user transmits only if primary user does not occupy the channel and waits for transmission otherwise. Therefore, secondary packet transmission involves both transmission time and waiting time. The resulting extended delivery time (EDT) is critical to the throughput analysis of secondary system. In this paper, we study the EDT of secondary packet transmission with adaptive modulation under interweave implementation to facilitate the delay and throughput analysis of such cognitive radio system. In particular, we propose an analytical framework to derive the probability density functions of EDT considering random-length transmission and waiting slots. We also present selected numerical results to illustrate the mathematical formulations and to verify our analytical approach.

Propagation of arbitrary initial wave packets in a quantum parametric oscillator: Instability zones for higher order moments

Science.gov (United States)

Biswas, Subhadip; Chattopadhyay, Rohitashwa; Bhattacharjee, Jayanta K.

2018-05-01

We consider the dynamics of a particle in a parametric oscillator with a view to exploring any quantum feature of the initial wave packet that shows divergent (in time) behaviour for parameter values where the classical motion dynamics of the mean position is bounded. We use Ehrenfest's theorem to explore the dynamics of nth order moment which reduces exactly to a linear non autonomous differential equation of order n + 1. It is found that while the width and skewness of the packet is unbounded exactly in the zones where the classical motion is unbounded, the kurtosis of an initially non-gaussian wave packet can become infinitely large in certain additional zones. This implies that the shape of the wave packet can change drastically with time in these zones.

Dynamics of an atomic wave packet in a standing-wave cavity field: A cavity-assisted single-atom detection

International Nuclear Information System (INIS)

Chough, Young-Tak; Nha, Hyunchul; Kim, Sang Wook; An, Kyungwon; Youn, Sun-Hyun

2002-01-01

We investigate the single-atom detection system using an optical standing-wave cavity, from the viewpoint of the quantized center-of-mass motion of the atomic wave packet. We show that since the atom-field coupling strength depends upon the overlap integral of the atomic wave packet and the field mode function, the effect of the wave-packet spreading via the momentum exchange process brings about a significant effect in the detection efficiency. We find that, as a result, the detection efficiency is not sensitive to the individual atomic trajectory for reasonably slow atoms. We also address an interesting phenomenon of the atomic wave-packet splitting occurring when an atom passes through a node of the cavity field

Modelling the Probability Density Function of IPTV Traffic Packet Delay Variation

Directory of Open Access Journals (Sweden)

Michal Halas

2012-01-01

Full Text Available This article deals with modelling the Probability density function of IPTV traffic packet delay variation. The use of this modelling is in an efficient de-jitter buffer estimation. When an IP packet travels across a network, it experiences delay and its variation. This variation is caused by routing, queueing systems and other influences like the processing delay of the network nodes. When we try to separate these at least three types of delay variation, we need a way to measure these types separately. This work is aimed to the delay variation caused by queueing systems which has the main implications to the form of the Probability density function.

Packet Capture Solutions: PcapDB Benchmark for High-Bandwidth Capture, Storage, and Searching

Energy Technology Data Exchange (ETDEWEB)

Steinfadt, Shannon Irene [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Ferrell, Paul Steven [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

2017-03-21

PcapDB stands alone when looking at the overall field of competitors, from the cost-effective COTS hardware, to the efficient utilization of disk space that enables a longer packet history. A scalable, 100GbE-enabled system that indexes every packet and indexes flow data without complicated load-balancing requirements. The Transport Layer search and indexing approach led to patent-pending flow indexing technology, providing a specialized database system specifically optimized around providing fast flow searches. While there are a plethora of options in network packet capture, there are very few that are able to effectively manage capture rates of more than 10 Gb/s, distributed capture and querying, and a responsive user interface. By far, the primary competitor in the market place is Endace and DeepSee; in addition to meeting the technical requirements we set out in this document, they provide technical support and a fully 'appliance like' system. In terms of cost, however, our experience has been that the yearly maintenance charges alone outstrip the entire hardware cost of solutions like PcapDB. Investment in cyber security research and development is a large part of what has enabled us to build the base of knowlegable workers needed to defend government resources in the rapidly evolving cyber security landscape. We believe projects like Bro, WireCap, and Farm do more than just fill temporary gaps in our capabilities. They give allow us to build the firm foundation needed to tackle the next generation of cyber challenges. PcapDB was built with loftier ambitions than simply solving the packet capture of a single lab site, but instead to provide a robust, scaleable packet capture solution to the DOE complex and beyond.

The United States History = Lich Su Hoa Ky. [34 Self-Learning Packets for Vietnamese Students.

Science.gov (United States)

Nhi, Do Dien; And Others

Designed primarily for Indochinese students in grades 9-12, 34 United States history self-learning packets are presented in eight sections. The publication could be used by mainstream teachers who have a number of limited English proficient (LEP) Vietnamese students in their classes or by parents to tutor their children. The packets were adapted…

Detection of residual packets in cocaine body packers: low accuracy of abdominal radiography - a prospective study

Energy Technology Data Exchange (ETDEWEB)

Rousset, Pascal; Vadrot, Dominique; Revel, Marie-Pierre [Assistance Publique-Hopitaux de Paris, Paris (France); Hopital Hotel Dieu, Department of Radiology, Paris (France); Universite Paris-Descartes, Paris (France); Chaillot, Pierre-Fleury [Assistance Publique-Hopitaux de Paris, Paris (France); Hopital Hotel Dieu, Department of Radiology, Paris (France); Audureau, Etienne [Assistance Publique-Hopitaux de Paris, Paris (France); Hopital Hotel Dieu, Department of Biostatistics and Epidemiology, Paris (France); Universite Paris-Descartes, Paris (France); Rey-Salmon, Caroline; Becour, Bertrand [Assistance Publique-Hopitaux de Paris, Paris (France); Hopital Hotel Dieu, Department of Forensic, Paris (France); Fitton, Isabelle [Assistance Publique-Hopitaux de Paris, Paris (France); Hopital Europeen Georges Pompidou, Department of Radiology, Paris (France)

2013-08-15

To evaluate the accuracy of abdominal radiography (AXR) for the detection of residual cocaine packets by comparison with computed tomography (CT). Over a 1-year period unenhanced CT was systematically performed in addition to AXR for pre-discharge evaluation of cocaine body packers. AXR and CT were interpreted independently by two radiologists blinded to clinical outcome. Patient and packet characteristics were compared between the groups with residual portage and complete decontamination. Among 138 body packers studied, 14 (10 %) had one residual packet identified on pre-discharge CT. On AXR, at least one reader failed to detect the residual packet in 10 (70 %) of these 14 body packers. The sensitivity and specificity of AXR were 28.6 % (95 % CI: 8.4-58.1) and 100.0 % (95 % CI: 97.0-100.0) for reader 1 and 35.7 % (95 % CI: 12.8-64.9) and 97.6 % (95 % CI: 93.1-99.5) for reader 2. There were no significant patient or packet characteristics predictive of residual portage or AXR false negativity. All positive CT results were confirmed by delayed expulsion or surgical findings, while negative results were confirmed by further surveillance. Given the poor performance of AXR, CT should be systematically performed to ensure safe hospital discharge of cocaine body packers. (orig.)

Detection of residual packets in cocaine body packers: low accuracy of abdominal radiography - a prospective study

International Nuclear Information System (INIS)

Rousset, Pascal; Vadrot, Dominique; Revel, Marie-Pierre; Chaillot, Pierre-Fleury; Audureau, Etienne; Rey-Salmon, Caroline; Becour, Bertrand; Fitton, Isabelle

2013-01-01

To evaluate the accuracy of abdominal radiography (AXR) for the detection of residual cocaine packets by comparison with computed tomography (CT). Over a 1-year period unenhanced CT was systematically performed in addition to AXR for pre-discharge evaluation of cocaine body packers. AXR and CT were interpreted independently by two radiologists blinded to clinical outcome. Patient and packet characteristics were compared between the groups with residual portage and complete decontamination. Among 138 body packers studied, 14 (10 %) had one residual packet identified on pre-discharge CT. On AXR, at least one reader failed to detect the residual packet in 10 (70 %) of these 14 body packers. The sensitivity and specificity of AXR were 28.6 % (95 % CI: 8.4-58.1) and 100.0 % (95 % CI: 97.0-100.0) for reader 1 and 35.7 % (95 % CI: 12.8-64.9) and 97.6 % (95 % CI: 93.1-99.5) for reader 2. There were no significant patient or packet characteristics predictive of residual portage or AXR false negativity. All positive CT results were confirmed by delayed expulsion or surgical findings, while negative results were confirmed by further surveillance. Given the poor performance of AXR, CT should be systematically performed to ensure safe hospital discharge of cocaine body packers. (orig.)

Effects of delayed nonlinear response on wave packet dynamics in one-dimensional generalized Fibonacci chains

International Nuclear Information System (INIS)

Zhang, Jianxin; Zhang, Zhenjun; Tong, Peiqing

2013-01-01

We investigate the spreading of an initially localized wave packet in one-dimensional generalized Fibonacci (GF) lattices by solving numerically the discrete nonlinear Schrödinger equation (DNLSE) with a delayed cubic nonlinear term. It is found that for short delay time, the wave packet is self-trapping in first class of GF lattices, that is, the second moment grows with time, but the corresponding participation number does not grow. However, both the second moment and the participation number grow with time for large delay time. This illuminates that the wave packet is delocalized. For the second class of GF lattices, the dynamic behaviors of wave packet depend on the strength of on-site potential. For a weak on-site potential, the results are similar to the case of the first class. For a strong on-site potential, both the second moment and the participation number does not grow with time in the regime of short delay time. In the regime of large delay time, both the second moment and the participation number exhibit stair-like growth

Effects of delayed nonlinear response on wave packet dynamics in one-dimensional generalized Fibonacci chains

Energy Technology Data Exchange (ETDEWEB)

Zhang, Jianxin; Zhang, Zhenjun [Department of Physics and Institute of Theoretical Physics, Nanjing Normal University, Nanjing 210023 (China); Tong, Peiqing, E-mail: pqtong@njnu.edu.cn [Department of Physics and Institute of Theoretical Physics, Nanjing Normal University, Nanjing 210023 (China); Jiangsu Key Laboratory for Numerical Simulation of Large Scale Complex Systems, Nanjing Normal University, Nanjing 210023 (China)

2013-07-15

We investigate the spreading of an initially localized wave packet in one-dimensional generalized Fibonacci (GF) lattices by solving numerically the discrete nonlinear Schrödinger equation (DNLSE) with a delayed cubic nonlinear term. It is found that for short delay time, the wave packet is self-trapping in first class of GF lattices, that is, the second moment grows with time, but the corresponding participation number does not grow. However, both the second moment and the participation number grow with time for large delay time. This illuminates that the wave packet is delocalized. For the second class of GF lattices, the dynamic behaviors of wave packet depend on the strength of on-site potential. For a weak on-site potential, the results are similar to the case of the first class. For a strong on-site potential, both the second moment and the participation number does not grow with time in the regime of short delay time. In the regime of large delay time, both the second moment and the participation number exhibit stair-like growth.

A CURRICULUM FOR ENGLISH, STUDENT PACKET, GRADE 9.

Science.gov (United States)

Nebraska Univ., Lincoln. Curriculum Development Center.

THE FIRST UNIT OF THE STUDENT PACKET FOR GRADE NINE OF THE NEBRASKA ENGLISH CURRICULUM IS A STUDY OF THE RELATIONSHIPS WHICH EXIST BETWEEN AUTHOR AND AUDIENCE, AND AN EXAMINATION OF THE EPIGRAM, LIMERICK, PARABLE, FABLE, AND ODE. WITH THIS BACKGROUND, STUDENTS CONSIDER "ON AVARICE" AND "ANIMAL FARM" AS EXAMPLES OF FORMAL AND…

Investigating the Effect of Voltage-Switching on Low-Energy Task Scheduling in Hard Real-Time Systems

Science.gov (United States)

2005-01-01

We investigate the effect of voltage-switching on task execution times and energy consumption for dual-speed hard real - time systems , and present a...scheduling algorithm and apply it to two real-life task sets. Our results show that energy can be conserved in embedded real - time systems using energy...aware task scheduling. We also show that switching times have a significant effect on the energy consumed in hard real - time systems .

Wave-packet treatment of reactor neutrino oscillation experiments and its implications on determining the neutrino mass hierarchy

Energy Technology Data Exchange (ETDEWEB)

Chan, Yat-Long; Chu, M.C.; Xu, Jianyi [The Chinese University of Hong Kong, Department of Physics, Shatin (China); Tsui, Ka Ming [University of Tokyo, RCCN, ICRR, Kashiwa, Chiba (Japan); Wong, Chan Fai [Sun Yat-Sen University, Guangzhou (China)

2016-06-15

We derive the neutrino flavor transition probabilities with the neutrino treated as a wave packet. The decoherence and dispersion effects from the wave-packet treatment show up as damping and phase-shifting of the plane-wave neutrino oscillation patterns. If the energy uncertainty in the initial neutrino wave packet is larger than around 0.01 of the neutrino energy, the decoherence and dispersion effects would degrade the sensitivity of reactor neutrino experiments to mass hierarchy measurement to lower than 3 σ confidence level. (orig.)

Method and allocation device for allocating pending requests for data packet transmission at a number of inputs to a number of outputs of a packet switching device in successive time slots

Science.gov (United States)

Abel, Francois [Rueschlikon, CH; Iliadis, Ilias [Rueschlikon, CH; Minkenberg, Cyriel J. A. [Adliswil, CH

2009-02-03

A method for allocating pending requests for data packet transmission at a number of inputs to a number of outputs of a switching system in successive time slots, including a matching method including the steps of providing a first request information in a first time slot indicating data packets at the inputs requesting transmission to the outputs of the switching system, performing a first step in the first time slot depending on the first request information to obtain a first matching information, providing a last request information in a last time slot successive to the first time slot, performing a last step in the last time slot depending on the last request information and depending on the first matching information to obtain a final matching information, and assigning the pending data packets at the number of inputs to the number of outputs based on the final matching information.

A improved Network Security Situation Awareness Model

Directory of Open Access Journals (Sweden)

Li Fangwei

2015-08-01

Full Text Available In order to reflect the situation of network security assessment performance fully and accurately, a new network security situation awareness model based on information fusion was proposed. Network security situation is the result of fusion three aspects evaluation. In terms of attack, to improve the accuracy of evaluation, a situation assessment method of DDoS attack based on the information of data packet was proposed. In terms of vulnerability, a improved Common Vulnerability Scoring System (CVSS was raised and maked the assessment more comprehensive. In terms of node weights, the method of calculating the combined weights and optimizing the result by Sequence Quadratic Program (SQP algorithm which reduced the uncertainty of fusion was raised. To verify the validity and necessity of the method, a testing platform was built and used to test through evaluating 2000 DAPRA data sets. Experiments show that the method can improve the accuracy of evaluation results.

Power Minimization through Packet Retention in Cognitive Radio Sensor Networks under Interference and Delay Constraints: An Optimal Stopping Approach

Directory of Open Access Journals (Sweden)

Amr Y. Elnakeeb

2016-04-01

Full Text Available The aim of this article is twofold: First, we study the problem of packets retention in a queue with the aim of minimizing transmission power in delay-tolerant applications. The problem is classified as an optimal stopping problem. The optimal stopping rule has been derived as well. Optimal number of released packets is determined in each round through an Integer Linear Programming (ILP optimization problem. This transmission paradigm is tested via simulations in an interference-free environment leading to a significant reduction in transmission power (at least 55%. Second, we address the problem of applying the scheme of packets retention through the Optimal Stopping Policy (OSP to underlay Cognitive Radio Sensor Networks (CRSNs where strict interference threshold does exist. Simulations proved that our scheme outperforms traditional transmission method as far as dropped packet rate and Average Power per Transmitted Packet (APTP are concerned.

Cross-layer designed adaptive modulation algorithm with packet combining and truncated ARQ over MIMO Nakagami fading channels

KAUST Repository

Aniba, Ghassane; Aissa, Sonia

2011-01-01

works addressed the link layer performance of AM with truncated ARQ but without packet combining. In addition, previously proposed AM algorithms are not optimal and can provide poor performance when packet combining is implemented. Herein, we first show

Awareness and Attitudes of Primary Grade Teachers (1-4thGrade) towards Inclusive Education

OpenAIRE

P. Maheshwari; M. Shapurkar

2015-01-01

The present research aimed at studying the awareness and attitudes of teachers towards inclusive education. The sample consisted of 60 teachers, teaching in the primary section (1st – 4th) of regular schools affiliated to the SSC board in Mumbai. Sample was selected by Multi-stage cluster sampling technique. A semi-structured self-constructed interview schedule and a self-constructed attitude scale was used to study the awareness of teachers about disability and Inclusive...

NQAR: Network Quality Aware Routing in Error-Prone Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jaewon Choi

2010-01-01

Full Text Available We propose a network quality aware routing (NQAR mechanism to provide an enabling method of the delay-sensitive data delivery over error-prone wireless sensor networks. Unlike the existing routing methods that select routes with the shortest arrival latency or the minimum hop count, the proposed scheme adaptively selects the route based on the network qualities including link errors and collisions with minimum additional complexity. It is designed to avoid the paths with potential noise and collision that may cause many non-deterministic backoffs and retransmissions. We propose a generic framework to select a minimum cost route that takes the packet loss rate and collision history into account. NQAR uses a data centric approach to estimate a single-hop delay based on processing time, propagation delay, packet loss rate, number of backoffs, and the retransmission timeout between two neighboring nodes. This enables a source node to choose the shortest expected end-to-end delay path to send a delay-sensitive data. The experiment results show that NQAR reduces the end-to-end transfer delay up to approximately 50% in comparison with the latency-based directed diffusion and the hop count-based directed diffusion under the error-prone network environments. Moreover, NQAR shows better performance than those routing methods in terms of jitter, reachability, and network lifetime.

Extended wave-packet model to calculate energy-loss moments of protons in matter

Science.gov (United States)

Archubi, C. D.; Arista, N. R.

2017-12-01

In this work we introduce modifications to the wave-packet method proposed by Kaneko to calculate the energy-loss moments of a projectile traversing a target which is represented in terms of Gaussian functions for the momentum distributions of electrons in the atomic shells. These modifications are introduced using the Levine and Louie technique to take into account the energy gaps corresponding to the different atomic levels of the target. We use the extended wave-packet model to evaluate the stopping power, the energy straggling, the inverse mean free path, and the ionization cross sections for protons in several targets, obtaining good agreements for all these quantities on an extensive energy range that covers low-, intermediate-, and high-energy regions. The extended wave-packet model proposed here provides a method to calculate in a very straightforward way all the significant terms of the inelastic interaction of light ions with any element of the periodic table.

nDPI: Open-Source High-Speed Deep Packet Inspection

DEFF Research Database (Denmark)

Deri, Luca; Martinelli, Maurizio; Bujlow, Tomasz

2014-01-01

protocols became increasingly challenging, thus creating a motivation for creating tools and libraries for network protocol classification. This paper covers the design and implementation of nDPI, an open-source library for protocol classification using both packet header and payload. nDPI was extensively...

Optical switching and detection of 640 Gb/s OTDM data packets transmitted over 50 km of fibre

NARCIS (Netherlands)

Gomez-Agis, F.; Hu, H.; Luo, J.; Mulvad, H.C.H.; Galili, M.; Calabretta, N.; Oxenløwe, L.K.; Dorren, H.J.S.; Jeppesen, P.

2011-01-01

We demonstrate 1×4 optical-packet switching with error-free transmission of 640 Gb/s single-wavelength OTDM data-packets including instantaneous clock extraction and short pulse generation for optical time-demultiplexing based on a cavity-less pulse source.

Architecture-Aware Configuration and Scheduling of Matrix Multiplication on Asymmetric Multicore Processors

OpenAIRE

Catalán, Sandra; Igual, Francisco D.; Mayo, Rafael; Rodríguez-Sánchez, Rafael; Quintana-Ortí, Enrique S.

2015-01-01

Asymmetric multicore processors (AMPs) have recently emerged as an appealing technology for severely energy-constrained environments, especially in mobile appliances where heterogeneity in applications is mainstream. In addition, given the growing interest for low-power high performance computing, this type of architectures is also being investigated as a means to improve the throughput-per-Watt of complex scientific applications. In this paper, we design and embed several architecture-aware ...

Dynamic Average Consensus and Consensusability of General Linear Multiagent Systems with Random Packet Dropout

Directory of Open Access Journals (Sweden)

Wen-Min Zhou

2013-01-01

Full Text Available This paper is concerned with the consensus problem of general linear discrete-time multiagent systems (MASs with random packet dropout that happens during information exchange between agents. The packet dropout phenomenon is characterized as being a Bernoulli random process. A distributed consensus protocol with weighted graph is proposed to address the packet dropout phenomenon. Through introducing a new disagreement vector, a new framework is established to solve the consensus problem. Based on the control theory, the perturbation argument, and the matrix theory, the necessary and sufficient condition for MASs to reach mean-square consensus is derived in terms of stability of an array of low-dimensional matrices. Moreover, mean-square consensusable conditions with regard to network topology and agent dynamic structure are also provided. Finally, the effectiveness of the theoretical results is demonstrated through an illustrative example.

Packets Distributing Evolutionary Algorithm Based on PSO for Ad Hoc Network

Science.gov (United States)

Xu, Xiao-Feng

2018-03-01

Wireless communication network has such features as limited bandwidth, changeful channel and dynamic topology, etc. Ad hoc network has lots of difficulties in accessing control, bandwidth distribution, resource assign and congestion control. Therefore, a wireless packets distributing Evolutionary algorithm based on PSO (DPSO)for Ad Hoc Network is proposed. Firstly, parameters impact on performance of network are analyzed and researched to obtain network performance effective function. Secondly, the improved PSO Evolutionary Algorithm is used to solve the optimization problem from local to global in the process of network packets distributing. The simulation results show that the algorithm can ensure fairness and timeliness of network transmission, as well as improve ad hoc network resource integrated utilization efficiency.

Following dynamic nuclear wave packets in N2,O2, and CO with few-cycle infrared pulses

International Nuclear Information System (INIS)

De, S.; Magrakvelidze, M.; Bocharova, I. A.; Ray, D.; Cao, W.; Li, H.; Wang, Z.; Laurent, G.; Thumm, U.; Ben-Itzhak, I.; Cocke, C. L.; Znakovskaya, I.; Kling, M. F.; Litvinyuk, I. V.

2011-01-01

We study the evolution of nuclear wave packets launched in molecular nitrogen, oxygen, and carbon monoxide by intense 8-fs infrared pulses. We use velocity map imaging to measure the momentum of the ion fragments when these wave packets are interrogated by a second such pulse after a variable time delay. Both quasibound and dissociative wave packets are observed. For the former, measurements of bound-state oscillations are used to identify the participating states and, in some cases, extract properties of the relevant potential-energy surfaces. Vibrational structure is resolved in both energy and oscillation frequencies for the cations of oxygen and carbon monoxide, displaying the same quantum wave-packet motion in both energy and time domains. In addition, vibrational structure is seen in the dication of carbon monoxide in a situation where the energy resolution by itself is inadequate to resolve the structure.

Following dynamic nuclear wave packets in N2,O2, and CO with few-cycle infrared pulses

Science.gov (United States)

de, S.; Magrakvelidze, M.; Bocharova, I. A.; Ray, D.; Cao, W.; Znakovskaya, I.; Li, H.; Wang, Z.; Laurent, G.; Thumm, U.; Kling, M. F.; Litvinyuk, I. V.; Ben-Itzhak, I.; Cocke, C. L.

2011-10-01

We study the evolution of nuclear wave packets launched in molecular nitrogen, oxygen, and carbon monoxide by intense 8-fs infrared pulses. We use velocity map imaging to measure the momentum of the ion fragments when these wave packets are interrogated by a second such pulse after a variable time delay. Both quasibound and dissociative wave packets are observed. For the former, measurements of bound-state oscillations are used to identify the participating states and, in some cases, extract properties of the relevant potential-energy surfaces. Vibrational structure is resolved in both energy and oscillation frequencies for the cations of oxygen and carbon monoxide, displaying the same quantum wave-packet motion in both energy and time domains. In addition, vibrational structure is seen in the dication of carbon monoxide in a situation where the energy resolution by itself is inadequate to resolve the structure.

Numeric Analysis for Relationship-Aware Scalable Streaming Scheme

Directory of Open Access Journals (Sweden)

Heung Ki Lee

2014-01-01

Full Text Available Frequent packet loss of media data is a critical problem that degrades the quality of streaming services over mobile networks. Packet loss invalidates frames containing lost packets and other related frames at the same time. Indirect loss caused by losing packets decreases the quality of streaming. A scalable streaming service can decrease the amount of dropped multimedia resulting from a single packet loss. Content providers typically divide one large media stream into several layers through a scalable streaming service and then provide each scalable layer to the user depending on the mobile network. Also, a scalable streaming service makes it possible to decode partial multimedia data depending on the relationship between frames and layers. Therefore, a scalable streaming service provides a way to decrease the wasted multimedia data when one packet is lost. However, the hierarchical structure between frames and layers of scalable streams determines the service quality of the scalable streaming service. Even if whole packets of layers are transmitted successfully, they cannot be decoded as a result of the absence of reference frames and layers. Therefore, the complicated relationship between frames and layers in a scalable stream increases the volume of abandoned layers. For providing a high-quality scalable streaming service, we choose a proper relationship between scalable layers as well as the amount of transmitted multimedia data depending on the network situation. We prove that a simple scalable scheme outperforms a complicated scheme in an error-prone network. We suggest an adaptive set-top box (AdaptiveSTB to lower the dependency between scalable layers in a scalable stream. Also, we provide a numerical model to obtain the indirect loss of multimedia data and apply it to various multimedia streams. Our AdaptiveSTB enhances the quality of a scalable streaming service by removing indirect loss.

Very low bit rate voice for packetized mobile applications

International Nuclear Information System (INIS)

Knittle, C.D.; Malone, K.T.

1991-01-01

This paper reports that transmitting digital voice via packetized mobile communications systems that employ relatively short packet lengths and narrow bandwidths often necessitates very low bit rate coding of the voice data. Sandia National Laboratories is currently developing an efficient voice coding system operating at 800 bits per second (bps). The coding scheme is a modified version of the 2400 bps NSA LPC-10e standard. The most significant modification to the LPC-10e scheme is the vector quantization of the line spectrum frequencies associated with the synthesis filters. An outline of a hardware implementation for the 800 bps coder is presented. The speech quality of the coder is generally good, although speaker recognition is not possible. Further research is being conducted to reduce the memory requirements and complexity of the vector quantizer, and to increase the quality of the reconstructed speech. This work may be of use dealing with nuclear materials

Parametric packet-based audiovisual quality model for IPTV services

CERN Document Server

Garcia, Marie-Neige

2014-01-01

This volume presents a parametric packet-based audiovisual quality model for Internet Protocol TeleVision (IPTV) services. The model is composed of three quality modules for the respective audio, video and audiovisual components. The audio and video quality modules take as input a parametric description of the audiovisual processing path, and deliver an estimate of the audio and video quality. These outputs are sent to the audiovisual quality module which provides an estimate of the audiovisual quality. Estimates of perceived quality are typically used both in the network planning phase and as part of the quality monitoring. The same audio quality model is used for both these phases, while two variants of the video quality model have been developed for addressing the two application scenarios. The addressed packetization scheme is MPEG2 Transport Stream over Real-time Transport Protocol over Internet Protocol. In the case of quality monitoring, that is the case for which the network is already set-up, the aud...

Sonification of network traffic flow for monitoring and situational awareness

Science.gov (United States)

2018-01-01

Maintaining situational awareness of what is happening within a computer network is challenging, not only because the behaviour happens within machines, but also because data traffic speeds and volumes are beyond human ability to process. Visualisation techniques are widely used to present information about network traffic dynamics. Although they provide operators with an overall view and specific information about particular traffic or attacks on the network, they often still fail to represent the events in an understandable way. Also, because they require visual attention they are not well suited to continuous monitoring scenarios in which network administrators must carry out other tasks. Here we present SoNSTAR (Sonification of Networks for SiTuational AwaReness), a real-time sonification system for monitoring computer networks to support network administrators’ situational awareness. SoNSTAR provides an auditory representation of all the TCP/IP traffic within a network based on the different traffic flows between between network hosts. A user study showed that SoNSTAR raises situational awareness levels by enabling operators to understand network behaviour and with the benefit of lower workload demands (as measured by the NASA TLX method) than visual techniques. SoNSTAR identifies network traffic features by inspecting the status flags of TCP/IP packet headers. Combinations of these features define particular traffic events which are mapped to recorded sounds to generate a soundscape that represents the real-time status of the network traffic environment. The sequence, timing, and loudness of the different sounds allow the network to be monitored and anomalous behaviour to be detected without the need to continuously watch a monitor screen. PMID:29672543

Sonification of network traffic flow for monitoring and situational awareness.

Science.gov (United States)

Debashi, Mohamed; Vickers, Paul

2018-01-01

Maintaining situational awareness of what is happening within a computer network is challenging, not only because the behaviour happens within machines, but also because data traffic speeds and volumes are beyond human ability to process. Visualisation techniques are widely used to present information about network traffic dynamics. Although they provide operators with an overall view and specific information about particular traffic or attacks on the network, they often still fail to represent the events in an understandable way. Also, because they require visual attention they are not well suited to continuous monitoring scenarios in which network administrators must carry out other tasks. Here we present SoNSTAR (Sonification of Networks for SiTuational AwaReness), a real-time sonification system for monitoring computer networks to support network administrators' situational awareness. SoNSTAR provides an auditory representation of all the TCP/IP traffic within a network based on the different traffic flows between between network hosts. A user study showed that SoNSTAR raises situational awareness levels by enabling operators to understand network behaviour and with the benefit of lower workload demands (as measured by the NASA TLX method) than visual techniques. SoNSTAR identifies network traffic features by inspecting the status flags of TCP/IP packet headers. Combinations of these features define particular traffic events which are mapped to recorded sounds to generate a soundscape that represents the real-time status of the network traffic environment. The sequence, timing, and loudness of the different sounds allow the network to be monitored and anomalous behaviour to be detected without the need to continuously watch a monitor screen.

T-L Plane Abstraction-Based Energy-Efficient Real-Time Scheduling for Multi-Core Wireless Sensors

Directory of Open Access Journals (Sweden)

Youngmin Kim

2016-07-01

Full Text Available Energy efficiency is considered as a critical requirement for wireless sensor networks. As more wireless sensor nodes are equipped with multi-cores, there are emerging needs for energy-efficient real-time scheduling algorithms. The T-L plane-based scheme is known to be an optimal global scheduling technique for periodic real-time tasks on multi-cores. Unfortunately, there has been a scarcity of studies on extending T-L plane-based scheduling algorithms to exploit energy-saving techniques. In this paper, we propose a new T-L plane-based algorithm enabling energy-efficient real-time scheduling on multi-core sensor nodes with dynamic power management (DPM. Our approach addresses the overhead of processor mode transitions and reduces fragmentations of the idle time, which are inherent in T-L plane-based algorithms. Our experimental results show the effectiveness of the proposed algorithm compared to other energy-aware scheduling methods on T-L plane abstraction.

On Maximizing the Throughput of Packet Transmission under Energy Constraints.

Science.gov (United States)

Wu, Weiwei; Dai, Guangli; Li, Yan; Shan, Feng

2018-06-23

More and more Internet of Things (IoT) wireless devices have been providing ubiquitous services over the recent years. Since most of these devices are powered by batteries, a fundamental trade-off to be addressed is the depleted energy and the achieved data throughput in wireless data transmission. By exploiting the rate-adaptive capacities of wireless devices, most existing works on energy-efficient data transmission try to design rate-adaptive transmission policies to maximize the amount of transmitted data bits under the energy constraints of devices. Such solutions, however, cannot apply to scenarios where data packets have respective deadlines and only integrally transmitted data packets contribute. Thus, this paper introduces a notion of weighted throughput, which measures how much total value of data packets are successfully and integrally transmitted before their own deadlines. By designing efficient rate-adaptive transmission policies, this paper aims to make the best use of the energy and maximize the weighted throughput. What is more challenging but with practical significance, we consider the fading effect of wireless channels in both offline and online scenarios. In the offline scenario, we develop an optimal algorithm that computes the optimal solution in pseudo-polynomial time, which is the best possible solution as the problem undertaken is NP-hard. In the online scenario, we propose an efficient heuristic algorithm based on optimal properties derived for the optimal offline solution. Simulation results validate the efficiency of the proposed algorithm.

Further Results on Extended Delivery Time for Secondary Packet Transmission

KAUST Repository

Usman, Muneer; Yang, Hong-Chuan; Alouini, Mohamed-Slim

2017-01-01

with non-work-preserving strategy, where interrupted packets must be repeated. We also analyze the effect of imperfect periodic sensing, i.e., the secondary user periodically senses the spectrum for availability, with a chance of missing an available

Comparison of ethanol hand sanitizer versus moist towelette packets for mealtime patient hand hygiene.

Science.gov (United States)

Rai, Herleen; Knighton, Shanina; Zabarsky, Trina F; Donskey, Curtis J

2017-09-01

To facilitate patient hand hygiene, there is a need for easy-to-use products. In a survey of 100 patients, a single-use ethanol hand sanitizer packet took less time to access than a single-use moist towelette packet (3 vs 23 seconds) and was preferred by 74% of patients for mealtime hand hygiene. Performance of patient hand hygiene increased when a reminder was provided at the time of meal tray delivery. Published by Elsevier Inc.

40 Gbit/s NRZ Packet-Length Insensitive Header Extraction for Optical Label Switching Networks

DEFF Research Database (Denmark)

Seoane, Jorge; Kehayas, E; Avramopoulos, H.

2006-01-01

A simple method for 40 Gbit/s NRZ header extraction based on envelope detection for optical label switching networks is presented. The scheme is insensitive to packet length and spacing and can be single-chip integrated cost-effectively......A simple method for 40 Gbit/s NRZ header extraction based on envelope detection for optical label switching networks is presented. The scheme is insensitive to packet length and spacing and can be single-chip integrated cost-effectively...

Steering dissociation of Br2 molecules with two femtosecond pulses via wave packet interference.

Science.gov (United States)

Han, Yong-Chang; Yuan, Kai-Jun; Hu, Wen-Hui; Yan, Tian-Min; Cong, Shu-Lin

2008-04-07

The dissociation dynamics of Br2 molecules induced by two femtosecond pump pulses are studied based on the calculation of time-dependent quantum wave packet. Perpendicular transition from X 1Sigma g+ to A 3Pi 1u+ and 1Pi 1u+ and parallel transition from X 1Sigma g+ to B 3Pi 0u+, involving two product channels Br (2P3/2)+Br (2P3/2) and Br (2P3/2)+Br* (2P1/2), respectively, are taken into account. Two pump pulses create dissociating wave packets interfering with each other. By varying laser parameters, the interference of dissociating wave packets can be controlled, and the dissociation probabilities of Br2 molecules on the three excited states can be changed to different degrees. The branching ratio of Br*/(Br+Br*) is calculated as a function of pulse delay time and phase difference.

The nonlinear effects on the characteristics of gravity wave packets: dispersion and polarization relations

Directory of Open Access Journals (Sweden)

S.-D. Zhang

2000-10-01

Full Text Available By analyzing the results of the numerical simulations of nonlinear propagation of three Gaussian gravity-wave packets in isothermal atmosphere individually, the nonlinear effects on the characteristics of gravity waves are studied quantitatively. The analyses show that during the nonlinear propagation of gravity wave packets the mean flows are accelerated and the vertical wavelengths show clear reduction due to nonlinearity. On the other hand, though nonlinear effects exist, the time variations of the frequencies of gravity wave packets are close to those derived from the dispersion relation and the amplitude and phase relations of wave-associated disturbance components are consistent with the predictions of the polarization relation of gravity waves. This indicates that the dispersion and polarization relations based on the linear gravity wave theory can be applied extensively in the nonlinear region.Key words: Meteorology and atmospheric dynamics (middle atmosphere dynamics; waves and tides

Moving the boundary between wavelength resources in optical packet and circuit integrated ring network.

Science.gov (United States)

Furukawa, Hideaki; Miyazawa, Takaya; Wada, Naoya; Harai, Hiroaki

2014-01-13

Optical packet and circuit integrated (OPCI) networks provide both optical packet switching (OPS) and optical circuit switching (OCS) links on the same physical infrastructure using a wavelength multiplexing technique in order to deal with best-effort services and quality-guaranteed services. To immediately respond to changes in user demand for OPS and OCS links, OPCI networks should dynamically adjust the amount of wavelength resources for each link. We propose a resource-adjustable hybrid optical packet/circuit switch and transponder. We also verify that distributed control of resource adjustments can be applied to the OPCI ring network testbed we developed. In cooperation with the resource adjustment mechanism and the hybrid switch and transponder, we demonstrate that automatically allocating a shared resource and moving the wavelength resource boundary between OPS and OCS links can be successfully executed, depending on the number of optical paths in use.

Transmission Delay Modeling of Packet Communication over Digital Subscriber Line

Directory of Open Access Journals (Sweden)

Jiri Vodrazka

2013-01-01

Full Text Available Certain multimedia and voice services, such as VoIP, IPTV, etc., are significantly delay sensitive and their performance is influenced by the overall transmission delay and its variance. One of the most common solutions used in access networks are xDSL lines, especially ADSL2+ or VDSL2. Although these subscriber lines also use packet communication, there are several differences and mechanisms, which influence their resulting delay. Their delay characteristics are also dependent on the individual settings of each xDSL provider, therefore we decided to investigate this area for typical commercially available lines in Czech Republic. Based on the measured values and experiments with real ADSL2+ lines we also developed a potential modeling method, which is presented in this article as well. The parameters for packet jitter based on the generalized Pareto distribution were modeled.

Traffic analysis and signal processing in optical packet switched networks

DEFF Research Database (Denmark)

Fjelde, Tina

2002-01-01

/s optical packet switched network exploiting the best of optics and electronics, is used as a thread throughout the thesis. An overview of the DAVID network architecture is given, focussing on the MAN and WAN architecture as well as the MPLS-based network hierarchy. Subsequently, the traffic performance...... of the DAVID core optical packet router, which exploits wavelength conversion and fibre delay-line buffers for contention resolution, is analysed using a numerical model developed for that purpose. The robustness of the shared recirculating loop buffer with respect to´bursty traffic is demonstrated...... the injection of an additional clock signal into the IWC is presented. Results show very good transmission capabilities combined with a high-speed response. It is argued that signal regeneration is an inherent attribute of the IWC employed as a wavelength converter due to the sinusoidal transfer function...

Holistic virtual machine scheduling in cloud datacenters towards minimizing total energy

OpenAIRE

Li, Xiang; Garraghan, Peter; Jiang, Xiaohong; Wu, Zhaohui; Xu, Jie

2018-01-01

Energy consumed by Cloud datacenters has dramatically increased, driven by rapid uptake of applications and services globally provisioned through virtualization. By applying energy-aware virtual machine scheduling, Cloud providers are able to achieve enhanced energy efficiency and reduced operation cost. Energy consumption of datacenters consists of computing energy and cooling energy. However, due to the complexity of energy and thermal modeling of realistic Cloud datacenter operation, tradi...

Comparison between wavelet and wavelet packet transform features for classification of faults in distribution system

Science.gov (United States)

Arvind, Pratul

2012-11-01

The ability to identify and classify all ten types of faults in a distribution system is an important task for protection engineers. Unlike transmission system, distribution systems have a complex configuration and are subjected to frequent faults. In the present work, an algorithm has been developed for identifying all ten types of faults in a distribution system by collecting current samples at the substation end. The samples are subjected to wavelet packet transform and artificial neural network in order to yield better classification results. A comparison of results between wavelet transform and wavelet packet transform is also presented thereby justifying the feature extracted from wavelet packet transform yields promising results. It should also be noted that current samples are collected after simulating a 25kv distribution system in PSCAD software.

Time-resolved X-ray scattering by electronic wave packets: analytic solutions to the hydrogen atom

DEFF Research Database (Denmark)

Simmermacher, Mats; Henriksen, Niels Engholm; Møller, Klaus Braagaard

2017-01-01

Modern pulsed X-ray sources permit time-dependent measurements of dynamical changes in atoms and molecules via non-resonant scattering. The planning, analysis, and interpretation of such experiments, however, require a firm and elaborated theoretical framework. This paper provides a detailed...... description of time-resolved X-ray scattering by non-stationary electronic wave packets in atomic systems. A consistent application of the Waller-Hartree approximation is discussed and different contributions to the total differential scattering signal are identified and interpreted. Moreover......, it is demonstrated how the scattering signal of wave packets in the hydrogen atom can be expressed analytically. This permits simulations without numerical integration and establishes a benchmark for both efficiency and accuracy. Based on that, scattering patterns of an exemplary wave packet in the hydrogen atom...

A Novel Approach to Detect Network Attacks Using G-HMM-Based Temporal Relations between Internet Protocol Packets

Directory of Open Access Journals (Sweden)

Han Kyusuk

2011-01-01

Full Text Available This paper introduces novel attack detection approaches on mobile and wireless device security and network which consider temporal relations between internet packets. In this paper we first present a field selection technique using a Genetic Algorithm and generate a Packet-based Mining Association Rule from an original Mining Association Rule for Support Vector Machine in mobile and wireless network environment. Through the preprocessing with PMAR, SVM inputs can account for time variation between packets in mobile and wireless network. Third, we present Gaussian observation Hidden Markov Model to exploit the hidden relationships between packets based on probabilistic estimation. In our G-HMM approach, we also apply G-HMM feature reduction for better initialization. We demonstrate the usefulness of our SVM and G-HMM approaches with GA on MIT Lincoln Lab datasets and a live dataset that we captured on a real mobile and wireless network. Moreover, experimental results are verified by -fold cross-validation test.

Quantum spreading of a self-gravitating wave-packet in singularity free gravity

Science.gov (United States)

Buoninfante, Luca; Lambiase, Gaetano; Mazumdar, Anupam

2018-01-01

In this paper we will study for the first time how the wave-packet of a self-gravitating meso-scopic system spreads in theories beyond Einstein's general relativity. In particular, we will consider a ghost-free infinite derivative gravity, which resolves the 1 / r singularity in the potential - such that the gradient of the potential vanishes within the scale of non-locality. We will show that a quantum wave-packet spreads faster for a ghost-free and singularity-free gravity as compared to the Newtonian case, therefore providing us a unique scenario for testing classical and quantum properties of short-distance gravity in a laboratory in the near future.

Time-resolved dynamics of two-channel molecular systems in cw laser fields: Wave-packet construction in the Floquet formalism

International Nuclear Information System (INIS)

Nguyen-Dang, T.T.; Chateauneuf, F.; Atabek, O.; He, X.

1995-01-01

The description of the wave-packet time-resolved dynamics in a two-channel molecular system driven by a cw laser field is considered within the time-independent Floquet representation. It is shown that, at high field intensity, the wave-packet motions are governed solely by the pair of adiabatic dressed potential-energy surfaces (PES's) associated with a single Brillouin zone. The same expressions of the wave-packet motions in terms of the adiabatic PES's are obtained within a short-time approximation, thereby furnishing a new numerical algorithm for the wave-packet propagation in a laser-driven two-channel system at any intensity. Numerical tests of this algorithm are presented. The numerical results establish unambiguously the adiabaticity of nuclear motions at high field intensities

Awareness of breast cancer in women of an urban resettlement colony.

Science.gov (United States)

Somdatta, P; Baridalyne, N

2008-01-01

Breast cancer accounts for 19-34% of all cancer cases among women in India. There is a high mortality due to late stage diagnosis as patients usually present at an advanced stage because of lack of awareness and non-existent breast cancer screening programs. Aim : To determine the awareness about breast cancer among women in an urban resettlement colony in Delhi. A community based, cross-sectional study carried out in a resettlement colony in South Delhi. Semi-structured interview schedule was used to collect information regarding breast cancer. Modified Kuppuswamy scale was used for assessing the socio-economic status. A total of 333 women were included. The mean age was 36 years+/-15.1 and 46% were illiterate. Only 185 (56%) women were aware of breast cancer; among them, 51% knew about at least one of the signs /symptoms, 53% were aware that breast cancer can be detected early, and only 35% mentioned about risk factors. Thus, awareness about breast cancer is low amongst women in this community. There is a need for awareness generation programs to educate women about breast cancer, propagation of correct messages and promote early detection of breast cancer.

Chemical Hand Warmer Packet Ingestion: A Case of Elemental Iron Exposure.

Science.gov (United States)

Weiland, Jessica L; Sherrow, Leighanne K; Jayant, Deepak A; Katz, Kenneth D

2017-09-01

For individuals who work outdoors in the winter or play winter sports, chemical hand warmers are becoming increasingly more commonplace because of their convenience and effectiveness. A 32-year-old woman with a history of chronic pain and bipolar disorder presented to the emergency department complaining of a "warm sensation" in her mouth and epigastrium after reportedly ingesting the partial contents of a chemical hand warmer packet containing between 5 and 8 g of elemental iron. She had been complaining of abdominal pain for approximately 1 month and was prescribed unknown antibiotics the previous day. The patient denied ingestion of any other product or medication other than what was prescribed. A serum iron level obtained approximately 6 hours after ingestion measured 235 micrograms/dL (reference range 40-180 micrograms/dL). As the patient demonstrated no new abdominal complaints and no evidence of systemic iron toxicity, she was discharged uneventfully after education. However, the potential for significant iron toxicity exists depending on the extent of exposure to this or similar products. Treatment for severe iron toxicity may include fluid resuscitation, whole bowel irrigation, and iron chelation therapy with deferoxamine. Physicians should become aware of the toxicity associated with ingestion of commercially available hand warmers. Consultation with a medical toxicologist is recommended. Copyright © 2017 Wilderness Medical Society. Published by Elsevier Inc. All rights reserved.

Determination of the effective transverse coherence of the neutron wave packet as employed in reflectivity investigations of condensed-matter structures. II. Analysis of elastic scattering using energy-gated wave packets with an application to neutron reflection from ruled gratings

Science.gov (United States)