WorldWideScience

Sample records for aware packet scheduling

  1. Mitigating Receiver’s Buffer Blocking by Delay Aware Packet Scheduling in Multipath Data Transfer

    OpenAIRE

    Sarwar, Golam; Boreli, Roksana; Lochin, Emmanuel; Mifdaoui, Ahlem; Smith, Guillaume

    2013-01-01

    Reliable in-order multi-path data transfer under asymmetric heterogeneous network conditions has known problems related to receiver's buffer blocking, caused by out of order packet arrival. Consequently, the aggregate capacity from multiple paths, which theoretically should be available to and achievable by the multi-path transport protocol, is practically severely underutilized. Several mitigation techniques have been proposed to address this issue mostly by using various packet retransmissi...

  2. Fair packet scheduling in Wireless Mesh Networks

    KAUST Repository

    Nawab, Faisal

    2014-02-01

    In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wireless Mesh Networks (WMNs). We use a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically determine the throughput. Based on the developed model, we propose a distributed MAC protocol called Timestamp-ordered MAC (TMAC), aiming to alleviate the unfairness problem in WMNs. TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended with a timestamp to a selected list of neighbors. It can proceed with the transmission only if it receives a sufficient number of grant control messages from these neighbors. A grant message indicates that the associated data packet has the lowest timestamp of all the packets pending transmission at the local transmit queue. We demonstrate that a loose ordering of timestamps among neighboring nodes is sufficient for enforcing local fairness, subsequently leading to flow rate fairness in a multi-hop WMN. We show that TMAC can be implemented using the control frames in IEEE 802.11, and thus can be easily integrated in existing 802.11-based WMNs. Our simulation results show that TMAC achieves excellent resource allocation fairness while maintaining over 90% of maximum link capacity across a large number of topologies.

  3. Uplink Packet-Data Scheduling in DS-CDMA Systems

    Science.gov (United States)

    Choi, Young Woo; Kim, Seong-Lyun

    In this letter, we consider the uplink packet scheduling for non-real-time data users in a DS-CDMA system. As an effort to jointly optimize throughput and fairness, we formulate a time-span minimization problem incorporating the time-multiplexing of different simultaneous transmission schemes. Based on simple rules, we propose efficient scheduling algorithms and compare them with the optimal solution obtained by linear programming.

  4. Opportunistic Nonorthogonal Packet Scheduling in Fixed Broadband Wireless Access Networks

    Directory of Open Access Journals (Sweden)

    Ahmed Mohamed H

    2006-01-01

    Full Text Available In order to mitigate high cochannel interference resulting from dense channel reuse, the interference management issues are often considered as essential part of scheduling schemes in fixed broadband wireless access (FBWA networks. To that end, a series of literature has been published recently, in which a group of base stations forms an interferer group (downlink transmissions from each base station become dominant interference for the users in other in-group base stations, and the scheduling scheme deployed in the group allows only one base station to transmit at a time. As a result of time orthogonality in transmissions, the dominant cochannel interferers are prevented, and hence the packet error rate can be improved. However, prohibiting concurrent transmissions in these orthogonal schemes introduces throughput penalty as well as higher end-to-end packet delay which might not be desirable for real-time services. In this paper, we utilize opportunistic nonorthogonality among the in-group transmissions whenever possible and propose a novel transmission scheduling scheme for FBWA networks. The proposed scheme, in contrast to the proactive interference avoidance techniques, strives for the improvements in delay and throughput efficiency. To facilitate opportunistic nonorthogonal transmissions in the interferer group, estimation of signal-to-interference-plus-noise ratio (SINR is required at the scheduler. We have observed from simulations that the proposed scheme outperforms the reference orthogonal scheme in terms of spectral efficiency, mean packet delay, and packet dropping rate.

  5. Packet-aware transport for video distribution [Invited

    Science.gov (United States)

    Aguirre-Torres, Luis; Rosenfeld, Gady; Bruckman, Leon; O'Connor, Mannix

    2006-05-01

    We describe a solution based on resilient packet rings (RPR) for the distribution of broadcast video and video-on-demand (VoD) content over a packet-aware transport network. The proposed solution is based on our experience in the design and deployment of nationwide Triple Play networks and relies on technologies such as RPR, multiprotocol label switching (MPLS), and virtual private LAN service (VPLS) to provide the most efficient solution in terms of utilization, scalability, and availability.

  6. Integrated Fractional Load and Packet Scheduling for OFDMA Systems

    DEFF Research Database (Denmark)

    Monghal, Guillaume Damien; Kumar, S.; Pedersen, Klaus I.

    2009-01-01

    This paper study the performance of an orthogonal frequency division multiple access (OFDMA) system under fractional load based in long term evolution (LTE) downlink. Fractional load is defined by a situation where only a fraction of the bandwidth is used for transmission due to lack of traffic....... This type of situation should result in a global increase of signal to interference and noise ratio (SINR) conditions in the network. We propose different methods integrating the transmission pattern selection to the packet scheduling functionality of the enode-B depending only on the channel quality...

  7. Sensitivity of the optimal parameter settings for a LTE packet scheduler

    NARCIS (Netherlands)

    Fernandez-Diaz, I.; Litjens, R.; van den Berg, C.A.; Dimitrova, D.C.; Spaey, K.

    Advanced packet scheduling schemes in 3G/3G+ mobile networks provide one or more parameters to optimise the trade-off between QoS and resource efficiency. In this paper we study the sensitivity of the optimal parameter setting for packet scheduling in LTE radio networks with respect to various

  8. A Scheduling Algorithm for Time Bounded Delivery of Packets on the Internet

    NARCIS (Netherlands)

    I. Vaishnavi (Ishan)

    2008-01-01

    htmlabstractThis thesis aims to provide a better scheduling algorithm for Real-Time delivery of packets. A number of emerging applications such as VoIP, Tele-immersive environments, distributed media viewing and distributed gaming require real-time delivery of packets. Currently the scheduling

  9. 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...

  10. Q FUNCTION AWARE OPTICAL PACKET SWITCH WITH LOW PACKET LOSS RATE

    Directory of Open Access Journals (Sweden)

    OMPAL SINGH

    2017-03-01

    Full Text Available Optical packet switching (OPS is a very promising technology for the next generation data transfer due to the very large bandwidth of the optical fiber. The success of the OPS relies heavily on design of the node architecture which supports comparatively larger buffering capacity without detiorating signal quality too much and it should provide very low packet loss probability with reasonably low average delay. In this paper, a design analysis of low complexity OPS node architecture is discussed along-with its advantages. The presented architecture support both fixed and variable length packets. The packets are stored in a single piece of fiber using the WDM technology. Physical layer analysis presented in this paper is to obtain the Q function (Bit Error Rate. Finally, the Monte Carlo simulation is done to obtain the packet loss. The average delay performance of the switch and effect of Q values on packet loss rates are discussed.

  11. A Scheduling Algorithm for Minimizing the Packet Error Probability in Clusterized TDMA Networks

    Directory of Open Access Journals (Sweden)

    Arash T. Toyserkani

    2009-01-01

    Full Text Available We consider clustered wireless networks, where transceivers in a cluster use a time-slotted mechanism (TDMA to access a wireless channel that is shared among several clusters. An approximate expression for the packet-loss probability is derived for networks with one or more mutually interfering clusters in Rayleigh fading environments, and the approximation is shown to be good for relevant scenarios. We then present a scheduling algorithm, based on Lagrangian duality, that exploits the derived packet-loss model in an attempt to minimize the average packet-loss probability in the network. Computer simulations of the proposed scheduling algorithm show that a significant increase in network throughput can be achieved compared to uncoordinated scheduling. Empirical trials also indicate that the proposed optimization algorithm almost always converges to an optimal schedule with a reasonable number of iterations. Thus, the proposed algorithm can also be used for bench-marking suboptimal scheduling algorithms.

  12. An Enhanced Feedback-Base Downlink Packet Scheduling Algorithm for Mobile TV in WIMAX Networks

    Directory of Open Access Journals (Sweden)

    Joseph Oyewale

    2013-06-01

    Full Text Available With high speed access network technology like WIMAX, there is the need for efficient management of radio resources where the throughput and Qos requirements for Multicasting Broadcasting Services (MBS for example TV are to be met. An enhanced  feedback-base downlink Packet scheduling algorithm  that can be used in IEEE 802.16d/e networks for mobile TV “one way traffic”(MBS is needed to support many users utilizing multiuser diversity of the  broadband of WIMAX systems where a group of users(good/worst channels share allocated resources (bandwidth. This paper proposes a WIMAX framework feedback-base (like a channel-awareness downlink packet scheduling algorithm for Mobile TV traffics in IEEE806.16, in which network Physical Timing Slots (PSs resource blocks are allocated in a dynamic way to mobile TV subscribers based on the Channel State information (CSI feedback, and then considering users with worst channels with the aim of improving system throughput while system coverage is being guaranteed. The algorithm was examined by changing the PSs bandwidth allocation of the users and different number of users of a cell. Simulation results show our proposed algorithm performed better than other algorithms (blind algorithms in terms of improvement in system throughput performance. /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso

  13. Performance of Spatial Division Multiplexing MIMO with Frequency Domain Packet Scheduling

    DEFF Research Database (Denmark)

    Wei, Na; Pokhariyal, Akhilesh; Sørensen, Troels Bundgaard

    2008-01-01

    the performance bounds of SDM-FDPS. To facilitate the analysis, a unified SINR concept is utilized to make a fair comparison of MIMO schemes with different number of spatial streams. The effect of packet scheduling is included in the post-scheduling SINR distribution using an analytical model. Based on that...

  14. 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.

  15. QoS Differentiated and Fair Packet Scheduling in Broadband Wireless Access Networks

    Directory of Open Access Journals (Sweden)

    Zhang Yan

    2009-01-01

    Full Text Available This paper studies the packet scheduling problem in Broadband Wireless Access (BWA networks. The key difficulties of the BWA scheduling problem lie in the high variability of wireless channel capacity and the unknown model of packet arrival process. It is difficult for traditional heuristic scheduling algorithms to handle the situation and guarantee satisfying performance in BWA networks. In this paper, we introduce learning-based approach for a better solution. Specifically, we formulate the packet scheduling problem as an average cost Semi-Markov Decision Process (SMDP. Then, we solve the SMDP by using reinforcement learning. A feature-based linear approximation and the Temporal-Difference learning technique are employed to produce a near optimal solution of the corresponding SMDP problem. The proposed algorithm, called Reinforcement Learning Scheduling (RLS, has in-built capability of self-training. It is able to adaptively and timely regulate its scheduling policy according to the instantaneous network conditions. Simulation results indicate that RLS outperforms two classical scheduling algorithms and simultaneously considers: (i effective QoS differentiation, (ii high bandwidth utilization, and (iii both short-term and long-term fairness.

  16. Packet-Scheduling Algorithm by the Ratio of Transmit Power to the Transmission Bits in 3GPP LTE Downlink

    Directory of Open Access Journals (Sweden)

    Gil Gye-Tae

    2010-01-01

    Full Text Available Packet scheduler plays the central role in determining the overall performance of the 3GPP long-term evolution (LTE based on packet-switching operation. In this paper, a novel minimum transmit power-based (MP packet-scheduling algorithm is proposed that can achieve power-efficient transmission to the UEs while providing both system throughput gain and fairness improvement. The proposed algorithm is based on a new scheduling metric focusing on the ratio of the transmit power per bit and allocates the physical resource block (PRB to the UE that requires the least ratio of the transmit power per bit. Through computer simulation, the performance of the proposed MP packet-scheduling algorithm is compared with the conventional packet-scheduling algorithms by two primary criteria: fairness and throughput. The simulation results show that the proposed algorithm outperforms the conventional algorithms in terms of the fairness and throughput.

  17. 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...

  18. Energy-saving scheme based on downstream packet scheduling in ethernet passive optical networks

    Science.gov (United States)

    Zhang, Lincong; Liu, Yejun; Guo, Lei; Gong, Xiaoxue

    2013-03-01

    With increasing network sizes, the energy consumption of Passive Optical Networks (PONs) has grown significantly. Therefore, it is important to design effective energy-saving schemes in PONs. Generally, energy-saving schemes have focused on sleeping the low-loaded Optical Network Units (ONUs), which tends to bring large packet delays. Further, the traditional ONU sleep modes are not capable of sleeping the transmitter and receiver independently, though they are not required to transmit or receive packets. Clearly, this approach contributes to wasted energy. Thus, in this paper, we propose an Energy-Saving scheme that is based on downstream Packet Scheduling (ESPS) in Ethernet PON (EPON). First, we design both an algorithm and a rule for downstream packet scheduling at the inter- and intra-ONU levels, respectively, to reduce the downstream packet delay. After that, we propose a hybrid sleep mode that contains not only ONU deep sleep mode but also independent sleep modes for the transmitter and the receiver. This ensures that the energy consumed by the ONUs is minimal. To realize the hybrid sleep mode, a modified GATE control message is designed that involves 10 time points for sleep processes. In ESPS, the 10 time points are calculated according to the allocated bandwidths in both the upstream and the downstream. The simulation results show that ESPS outperforms traditional Upstream Centric Scheduling (UCS) scheme in terms of energy consumption and the average delay for both real-time and non-real-time packets downstream. The simulation results also show that the average energy consumption of each ONU in larger-sized networks is less than that in smaller-sized networks; hence, our ESPS is better suited for larger-sized networks.

  19. Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

    Science.gov (United States)

    Song, W.-Z.; Yuan, F.; LaHusen, R.; Shirazi, B.

    2007-01-01

    This paper studies the wireless sensor networks (WSN) application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs [image omitted], N(u0)-1) time slots, assuming each node reports one unit of data in each round. Here [image omitted] is the total number of sensors, while [image omitted] denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet-scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also mitigated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle.

  20. A Novel Algorithm for Efficient Downlink Packet Scheduling for Multiple-Component-Carrier Cellular Systems

    Directory of Open Access Journals (Sweden)

    Yao-Liang Chung

    2016-11-01

    Full Text Available The simultaneous aggregation of multiple component carriers (CCs for use by a base station constitutes one of the more promising strategies for providing substantially enhanced bandwidths for packet transmissions in 4th and 5th generation cellular systems. To the best of our knowledge, however, few previous studies have undertaken a thorough investigation of various performance aspects of the use of a simple yet effective packet scheduling algorithm in which multiple CCs are aggregated for transmission in such systems. Consequently, the present study presents an efficient packet scheduling algorithm designed on the basis of the proportional fair criterion for use in multiple-CC systems for downlink transmission. The proposed algorithm includes a focus on providing simultaneous transmission support for both real-time (RT and non-RT traffic. This algorithm can, when applied with sufficiently efficient designs, provide adequate utilization of spectrum resources for the purposes of transmissions, while also improving energy efficiency to some extent. According to simulation results, the performance of the proposed algorithm in terms of system throughput, mean delay, and fairness constitute substantial improvements over those of an algorithm in which the CCs are used independently instead of being aggregated.

  1. 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.

  2. Modified weighted fair queuing for packet scheduling in mobile WiMAX networks

    Science.gov (United States)

    Satrya, Gandeva B.; Brotoharsono, Tri

    2013-03-01

    The increase of user mobility and the need for data access anytime also increases the interest in broadband wireless access (BWA). The best available quality of experience for mobile data service users are assured for IEEE 802.16e based users. The main problem of assuring a high QOS value is how to allocate available resources among users in order to meet the QOS requirement for criteria such as delay, throughput, packet loss and fairness. There is no specific standard scheduling mechanism stated by IEEE standards, which leaves it for implementer differentiation. There are five QOS service classes defined by IEEE 802.16: Unsolicited Grant Scheme (UGS), Extended Real Time Polling Service (ertPS), Real Time Polling Service (rtPS), Non Real Time Polling Service (nrtPS) and Best Effort Service (BE). Each class has different QOS parameter requirements for throughput and delay/jitter constraints. This paper proposes Modified Weighted Fair Queuing (MWFQ) scheduling scenario which was based on Weighted Round Robin (WRR) and Weighted Fair Queuing (WFQ). The performance of MWFQ was assessed by using above five QoS criteria. The simulation shows that using the concept of total packet size calculation improves the network's performance.

  3. A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks.

    Science.gov (United States)

    Dao, Thi-Nga; Yoon, Seokhoon; Kim, Jangyoung

    2016-01-05

    Many applications in wireless sensor networks (WSNs) require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E) packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR) is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF) algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR.

  4. A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Thi-Nga Dao

    2016-01-01

    Full Text Available Many applications in wireless sensor networks (WSNs require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR.

  5. 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.

  6. 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.

  7. 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.

  8. 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....

  9. 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.

  10. 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...

  11. 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.

  12. 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.

  13. 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

  14. 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.

  15. 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%....

  16. 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...

  17. 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.

  18. 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.

  19. 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.

  20. 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.

  1. 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 ...

  2. 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.

  3. 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.

  4. 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.

  5. 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.

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

    Directory of Open Access Journals (Sweden)

    Subhrakanti Dey

    2007-08-01

    Full Text Available 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 power, rate, and transmission time allocation at the wireless links. We further consider an optimal power allocation problem for multiple transmitting sources in the same framework. Performances of the resource allocation algorithms including the effect of buffer load control are illustrated via extensive simulation studies.

  7. 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.

  8. Optimizing Transmission and Shutdown for Energy-Efficient Real-time Packet Scheduling in Clustered Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Rajkumar Ragunathan

    2005-01-01

    Full Text Available Energy efficiency is imperative to enable the deployment of ad hoc networks. Conventional power management focuses independently on the physical or MAC layer and approaches differ depending on the abstraction level. At the physical layer, the fundamental tradeoff between transmission rate and energy is exploited, which leads to transmit as slow as possible. At MAC level, power reduction techniques aim to transmit as fast as possible to maximize the radios power-off interval. The two approaches seem conflicting and it is not obvious which one is the most appropriate. We propose a transmission strategy that optimally mixes both techniques in a multiuser context. We present a cross-layer solution considering the transceiver power characteristics, the varying system load, and the dynamic channel constraints. Based on this, we derive a low-complexity online scheduling algorithm. Results considering an -ary quadrature amplitude modulation radio show that for a range of scenarios a large power reduction is achieved, compared to the case where only scaling or shutdown is considered.

  9. 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.

  10. 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.

  11. 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)

  12. 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...

  13. 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...

  14. 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.

  15. 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

  16. 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.

  17. 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.

  18. 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....

  19. 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.

  20. 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.

  1. 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.

  2. 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.

  3. 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.

  4. 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.

  5. 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 ...

  6. Flexible Data-Aware Scheduling for Workflows over an In-Memory Object Store

    Energy Technology Data Exchange (ETDEWEB)

    Duro, Francisco Rodrigo; Garcia Blas, Javier; Isaila, Florin; Wozniak, Justin M.; Carretero, Jesus; Ross, Rob

    2016-01-01

    This paper explores novel techniques for improving the performance of many-task workflows based on the Swift scripting language. We propose novel programmer options for automated distributed data placement and task scheduling. These options trigger a data placement mechanism used for distributing intermediate workflow data over the servers of Hercules, a distributed key-value store that can be used to cache file system data. We demonstrate that these new mechanisms can significantly improve the aggregated throughput of many-task workflows with up to 86x, reduce the contention on the shared file system, exploit the data locality, and trade off locality and load balance.

  7. Layout-Aware I/O Scheduling for Terabits Data Movement

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Youngjae [ORNL; Atchley, Scott [ORNL; Vallee, Geoffroy R [ORNL; Shipman, Galen M [ORNL

    2013-01-01

    Many science facilities, such as the Department of Energy s Leadership Computing Facilities and experimental facilities including the Spallation Neutron Source, Stanford Linear Accelerator Center, and Advanced Photon Source, produce massive amounts of experimental and simulation data. These data are often shared among the facilities and with collaborating institutions. Moving large datasets over the wide- area network (WAN) is a major problem inhibiting collaboration. Next- generation, terabit-networks will help alleviate the problem, however, the parallel storage systems on the end-system hosts at these institutions can become a bottleneck for terabit data movement. The parallel storage system (PFS) is shared by simulation systems, experimental systems, analysis and visualization clusters, in addition to wide-area data movers. These competing uses often induce temporary, but significant, I/O load imbalances on the storage system, which impact the performance of all the users. The problem is a serious concern because some resources are more expensive (e.g. super computers) or have time-critical deadlines (e.g. experimental data from a light source), but parallel file systems handle all requests fairly even if some storage servers are under heavy load. This paper investigates the problem of competing workloads accessing the parallel file system and how the performance of wide-area data movement can be improved in these environments. First, we study the I/O load imbalance problems using actual I/O performance data collected from the Spider storage system at the Oak Ridge Leadership Computing Facility. Second, we present I/O optimization solutions with layout-awareness on end-system hosts for bulk data movement. With our evaluation, we show that our I/O optimization techniques can avoid the I/O congested disk groups, improving storage I/O times on parallel storage systems for terabit data movement.

  8. 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.

  9. 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…

  10. Fair packet scheduling in Wireless Mesh Networks

    KAUST Repository

    Nawab, Faisal; Jamshaid, Kamran; Shihada, Basem; Ho, Pin Han

    2014-01-01

    ordering of timestamps among neighboring nodes is sufficient for enforcing local fairness, subsequently leading to flow rate fairness in a multi-hop WMN. We show that TMAC can be implemented using the control frames in IEEE 802.11, and thus can be easily

  11. 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...

  12. 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

  13. 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.

  14. 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

  15. 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.

  16. 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

  17. 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)

  18. 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.

  19. 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

  20. 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.

  1. 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…

  2. 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.

  3. 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.

  4. 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)

  5. 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.

  6. 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.

  7. 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...

  8. 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…

  9. 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.

  10. 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…

  11. 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…

  12. 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.

  13. 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

  14. 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,…

  15. 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.

  16. 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.

  17. 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.

  18. 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).

  19. 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...

  20. 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

  1. 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

  2. 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

  3. 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

  4. 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

  5. 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.

  6. Efficient packet forwarding using cyber-security aware policies

    Science.gov (United States)

    Ros-Giralt, Jordi

    2017-10-25

    For balancing load, a forwarder can selectively direct data from the forwarder to a processor according to a loading parameter. The selective direction includes forwarding the data to the processor for processing, transforming and/or forwarding the data to another node, and dropping the data. The forwarder can also adjust the loading parameter based on, at least in part, feedback received from the processor. One or more processing elements can store values associated with one or more flows into a structure without locking the structure. The stored values can be used to determine how to direct the flows, e.g., whether to process a flow or to drop it. The structure can be used within an information channel providing feedback to a processor.

  7. 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…

  8. 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…

  9. 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…

  10. 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

  11. 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

  12. 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.

  13. 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.

  14. Multidimensional signaling via wavelet packets

    Science.gov (United States)

    Lindsey, Alan R.

    1995-04-01

    This work presents a generalized signaling strategy for orthogonally multiplexed communication. Wavelet packet modulation (WPM) employs the basis functions from an arbitrary pruning of a full dyadic tree structured filter bank as orthogonal pulse shapes for conventional QAM symbols. The multi-scale modulation (MSM) and M-band wavelet modulation (MWM) schemes which have been recently introduced are handled as special cases, with the added benefit of an entire library of potentially superior sets of basis functions. The figures of merit are derived and it is shown that the power spectral density is equivalent to that for QAM (in fact, QAM is another special case) and hence directly applicable in existing systems employing this standard modulation. Two key advantages of this method are increased flexibility in time-frequency partitioning and an efficient all-digital filter bank implementation, making the WPM scheme more robust to a larger set of interferences (both temporal and sinusoidal) and computationally attractive as well.

  15. Downlink Transmission of Short Packets

    DEFF Research Database (Denmark)

    Trillingsgaard, Kasper Fløe; Popovski, Petar

    2017-01-01

    Cellular wireless systems rely on frame-based transmissions. The frame design is conventionally based on heuristics, consisting of a frame header and a data part. The frame header contains control information that provides pointers to the messages within the data part. In this paper, we revisit...... the principles of frame design and show the impact of the new design in scenarios that feature short data packets, which are central to various 5G and Internet of Things applications. We~treat framing for downlink transmission in an AWGN broadcast channel with $K$ users, where the sizes of the messages....... This requires changes in the way control information is sent, and it requires that the users need to spend power decoding other messages, thereby increasing the average power consumption. We~show that the common heuristic design is only one point on a curve that represents the tradeoff between latency and power...

  16. 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)

  17. 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%.

  18. 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%.

  19. 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

  20. 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

  1. Refinery scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Magalhaes, Marcus V.; Fraga, Eder T. [PETROBRAS, Rio de Janeiro, RJ (Brazil); Shah, Nilay [Imperial College, London (United Kingdom)

    2004-07-01

    This work addresses the refinery scheduling problem using mathematical programming techniques. The solution adopted was to decompose the entire refinery model into a crude oil scheduling and a product scheduling problem. The envelope for the crude oil scheduling problem is composed of a terminal, a pipeline and the crude area of a refinery, including the crude distillation units. The solution method adopted includes a decomposition technique based on the topology of the system. The envelope for the product scheduling comprises all tanks, process units and products found in a refinery. Once crude scheduling decisions are Also available the product scheduling is solved using a rolling horizon algorithm. All models were tested with real data from PETROBRAS' REFAP refinery, located in Canoas, Southern Brazil. (author)

  2. 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...

  3. 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....

  4. 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...

  5. 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.

  6. 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

  7. 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

  8. 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.

  9. 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

  10. 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.

  11. 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.

  12. 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...

  13. 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…

  14. 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…

  15. 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...

  16. 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.

  17. 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.

  18. Schedule Analytics

    Science.gov (United States)

    2016-04-30

    Warfare, Naval Sea Systems Command Acquisition Cycle Time : Defining the Problem David Tate, Institute for Defense Analyses Schedule Analytics Jennifer...research was comprised of the following high- level steps :  Identify and review primary data sources 1...research. However, detailed reviews of the OMB IT Dashboard data revealed that schedule data is highly aggregated. Program start date and program end date

  19. 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.

  20. 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.

  1. 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.

  2. 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.

  3. 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.

  4. 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.

  5. 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.

  6. 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...

  7. 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

  8. 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

  9. 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…

  10. 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

  11. 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

  12. 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…

  13. 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

  14. 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.

  15. 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, ...

  16. 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

  17. 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)

  18. 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.

  19. 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

  20. 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.

  1. 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.

  2. A microcomputer for a packet switched network

    International Nuclear Information System (INIS)

    Seller, P.; Bairstow, R.; Barlow, J.; Waters, M.

    1982-12-01

    The Bubble Chamber Research Group of the Rutherford and Appleton Laboratory has a large film analysis facility. This comprises 16 digitising tables used for the measurement of bubble chamber film. Each of these tables has an associated microcomputer. These microcomputers are linked by a star structured packet switched local area network (LAN) to a VAX 11/780. The LAN, and in particular a microcomputer of novel architecture designed to act as the central switch of the network, is described. (author)

  3. 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.

  4. 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.

  5. "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.

  6. 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.

  7. 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

  8. 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.

  9. 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.

  10. 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.

  11. 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...

  12. 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

  13. 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....

  14. 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

  15. 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

  16. 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.)

  17. 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

  18. Multiple descriptions for packetized predictive control

    DEFF Research Database (Denmark)

    Østergaard, Jan; Quevedo, Daniel

    2016-01-01

    be reliably reconstructed at the plant side. For the particular case of LTI plant models and i.i.d. channels, we show that the overall system forms a Markov jump linear system. We provide conditions for mean square stability and derive upper bounds on the operational bit rate of the quantizer to guarantee......In this paper, we propose to use multiple descriptions (MDs) to achieve a high degree of robustness towards random packet delays and erasures in networked control systems. In particular, we consider the scenario, where a data-rate limited channel is located between the controller and the plant...

  19. 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...

  20. 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.

  1. 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.

  2. 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.

  3. 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.

  4. 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.

  5. 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...

  6. 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.

  7. 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...

  8. 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.

  9. 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.…

  10. 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...

  11. 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…

  12. 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...

  13. 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…

  14. 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 ...

  15. 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...

  16. 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

  17. 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 ...

  18. 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...

  19. 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.

  20. 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

  1. 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.

  2. Waveform and packet structure of lion roars

    Directory of Open Access Journals (Sweden)

    W. Baumjohann

    Full Text Available The Equator-S magnetometer is very sensitive and has a sampling rate of normally 128 Hz. The high sampling rate allows for the first time fluxgate magnetometer measurements of ELF waves between the ion cyclotron and the lower hybrid frequencies in the equatorial dayside magnetosheath. The so-called lion roars, typically seen by the Equator-S magnetometer at the bottom of the magnetic troughs of magnetosheath mirror waves, are near-monochromatic packets of electron whistler waves lasting for a few wave cycles only, typically 0.25 s. They are right-hand circularly polarized waves with typical amplitudes of 0.5–1 nT at around one tenth of the electron gyrofrequency. The cone angle between wave vector and ambient field is usually smaller than 1.5°.

    Key words. Interplanetary physics (MHD waves and turbulence; plasma waves and turbulence

  3. Waveform and packet structure of lion roars

    Directory of Open Access Journals (Sweden)

    W. Baumjohann

    1999-12-01

    Full Text Available The Equator-S magnetometer is very sensitive and has a sampling rate of normally 128 Hz. The high sampling rate allows for the first time fluxgate magnetometer measurements of ELF waves between the ion cyclotron and the lower hybrid frequencies in the equatorial dayside magnetosheath. The so-called lion roars, typically seen by the Equator-S magnetometer at the bottom of the magnetic troughs of magnetosheath mirror waves, are near-monochromatic packets of electron whistler waves lasting for a few wave cycles only, typically 0.25 s. They are right-hand circularly polarized waves with typical amplitudes of 0.5–1 nT at around one tenth of the electron gyrofrequency. The cone angle between wave vector and ambient field is usually smaller than 1.5°.Key words. Interplanetary physics (MHD waves and turbulence; plasma waves and turbulence

  4. Node design in optical packet switched networks

    DEFF Research Database (Denmark)

    Nord, Martin

    2006-01-01

    The thesis discusses motivation, realisation and performance of the Optical Packet Switching (OPS) network paradigm. The work includes proposals for designs and methods to efficiently use both the wavelength- and time domain for contention resolution in asynchronous operation. The project has also......S parameter. Finally, the thesis includes a proposal for a node design and associated MAC protocol for an OPS ring topology metropolitan area network with high throughput and fairness, also for unbalanced traffic....... proposed parallel designs to overcome scalability constraints and to support migration scenarios. Furthermore, it has proposed and demonstrated optical input processing schemes for hybrids networks to simultaneously support OPS and Optical Circuit Switching. Quality of Service (QoS) differentiation enables...

  5. Wave packets, Maslov indices, and semiclassical quantization

    International Nuclear Information System (INIS)

    Littlejohn, R.G.

    1989-01-01

    The Bohr-Sommerfeld quantization condition, as refined by Keller and Maslov, reads I=(n+m/4)h, where I is the classical action, n is the quantum number, and where m is the Maslov index, an even integer. The occurrence of the integers n and m in this formula is a reflection of underlying topological features of semiclassical quantization. In particular, the work of Arnold and others has shown that m/2 is a winding number of closed curves on the classical symplectic group manifold, Sp(2N). Wave packets provide a simple and elegant means of establishing the connection between semiclassical quantization and the homotopy classes of Sp(2N), as well as a practical way of calculating Maslov indices in complex problems. Topological methods can also be used to derive general formulas for the Maslov indices of invariant tori in the classical phase space corresponding to resonant motion. (orig.)

  6. Construction of localized atomic wave packets

    International Nuclear Information System (INIS)

    Ranjani, S Sree; Kapoor, A K; Panigrahi, P K

    2010-01-01

    It is shown that highly localized solitons can be created in lower dimensional Bose-Einstein condensates (BECs), trapped in a regular harmonic trap, by temporally varying the trap frequency. A BEC confined in such a trap can be effectively used to construct a pulsed atomic laser emitting coherent atomic wave packets. In addition to having a complete control over the spatio-temporal dynamics of the solitons, we can separate the equation governing the Kohn mode (centre of mass motion). We investigate the effect of the temporal modulation of the trap frequency on the spatio-temporal dynamics of the bright solitons and also on the Kohn mode. The dynamics of the solitons and the variations in the Kohn mode with time are compared with those in a BEC confined in a trap with unmodulated trap frequency.

  7. Suicide Awareness

    Science.gov (United States)

    ... View Cart | ({{Header.numItems}} Item s ) Home Health & Wellness Mental Health Suicide March 15, 2018 @ 9:56 AM | 3 Min Read | 10105 Views Suicide Awareness Suicide is a serious concern in military communities; ...

  8. 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).

  9. 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.

  10. 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.

  11. 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

  12. 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...

  13. 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.

  14. 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

  15. 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

  16. 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

  17. 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.

  18. 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...

  19. 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...

  20. 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.

  1. 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.

  2. 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.

  3. Engineering and manipulating exciton wave packets

    Science.gov (United States)

    Zang, Xiaoning; Montangero, Simone; Carr, Lincoln D.; Lusk, Mark T.

    2017-05-01

    When a semiconductor absorbs light, the resulting electron-hole superposition amounts to a uncontrolled quantum ripple that eventually degenerates into diffusion. If the conformation of these excitonic superpositions could be engineered, though, they would constitute a new means of transporting information and energy. We show that properly designed laser pulses can be used to create such excitonic wave packets. They can be formed with a prescribed speed, direction, and spectral make-up that allows them to be selectively passed, rejected, or even dissociated using superlattices. Their coherence also provides a handle for manipulation using active, external controls. Energy and information can be conveniently processed and subsequently removed at a distant site by reversing the original procedure to produce a stimulated emission. The ability to create, manage, and remove structured excitons comprises the foundation for optoexcitonic circuits with application to a wide range of quantum information, energy, and light-flow technologies. The paradigm is demonstrated using both tight-binding and time-domain density functional theory simulations.

  4. 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...

  5. 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...

  6. 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....

  7. 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....

  8. 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.

  9. Frequency Domain Packet Scheduling Under Fractional Load for the UTRAN LTE Downlink

    DEFF Research Database (Denmark)

    Pokhariyal, Akhilesh; Monghal, Guillaume Damien; Pedersen, Klaus I.

    2007-01-01

    FL based on transmission using a subset of the time-frequency resources, in an un-coordinated manner throughout the cellular network. On the basis of detailed system-level simulations we find that FDPS under FL can provide a performance trade-off between improvement in coverage and the loss in cell...

  10. 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.

  11. 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.

  12. Evolutionary Awareness

    Directory of Open Access Journals (Sweden)

    Gregory Gorelik

    2014-10-01

    Full Text Available In this article, we advance the concept of “evolutionary awareness,” a metacognitive framework that examines human thought and emotion from a naturalistic, evolutionary perspective. We begin by discussing the evolution and current functioning of the moral foundations on which our framework rests. Next, we discuss the possible applications of such an evolutionarily-informed ethical framework to several domains of human behavior, namely: sexual maturation, mate attraction, intrasexual competition, culture, and the separation between various academic disciplines. Finally, we discuss ways in which an evolutionary awareness can inform our cross-generational activities—which we refer to as “intergenerational extended phenotypes”—by helping us to construct a better future for ourselves, for other sentient beings, and for our environment.

  13. 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.

  14. 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.

  15. 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.

  16. Immunization Schedules for Adults

    Science.gov (United States)

    ... ACIP Vaccination Recommendations Why Immunize? Vaccines: The Basics Immunization Schedule for Adults (19 Years of Age and ... diseases that can be prevented by vaccines . 2018 Immunization Schedule Recommended Vaccinations for Adults by Age and ...

  17. Instant Childhood Immunization Schedule

    Science.gov (United States)

    ... Recommendations Why Immunize? Vaccines: The Basics Instant Childhood Immunization Schedule Recommend on Facebook Tweet Share Compartir Get ... date. See Disclaimer for additional details. Based on Immunization Schedule for Children 0 through 6 Years of ...

  18. 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.

  19. 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.

  20. Current awareness.

    Science.gov (United States)

    Compagno, C; Brambilla, L; Capitanio, D; Boschi, F; Ranzi, B M; Porro, D

    2001-05-01

    In order to keep subscribers up-to-date with the latest developments in their field, this current awareness service is provided by John Wiley & Sons and contains newly-published material on yeasts. Each bibliography is divided into 10 sections. 1 Books, Reviews & Symposia; 2 General; 3 Biochemistry; 4 Biotechnology; 5 Cell Biology; 6 Gene Expression; 7 Genetics; 8 Physiology; 9 Medical Mycology; 10 Recombinant DNA Technology. Within each section, articles are listed in alphabetical order with respect to author. If, in the preceding period, no publications are located relevant to any one of these headings, that section will be omitted. (4 weeks journals - search completed 7th Mar. 2001)

  1. Institutional Awareness

    DEFF Research Database (Denmark)

    Ahlvik, Carina; Boxenbaum, Eva

    Drawing on dual-process theory and mindfulness research this article sets out to shed light on the conditions that need to be met to create “a reflexive shift in consciousness” argued to be a key foundational mechanism for agency in institutional theory. Although past research has identified...... in consciousness to emerge and argue for how the varying levels of mindfulness in the form of internal and external awareness may manifest as distinct responses to the institutional environment the actor is embedded in....

  2. Web Publishing Schedule

    Science.gov (United States)

    Section 207(f)(2) of the E-Gov Act requires federal agencies to develop an inventory and establish a schedule of information to be published on their Web sites, make those schedules available for public comment. To post the schedules on the web site.

  3. Preemptive scheduling with rejection

    NARCIS (Netherlands)

    Hoogeveen, H.; Skutella, M.; Woeginger, Gerhard

    2003-01-01

    We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the jobs and thereby incur job-dependent penalties for each rejected job, and he must construct a schedule for the remaining

  4. Preemptive scheduling with rejection

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Skutella, M.; Woeginger, G.J.; Paterson, M.

    2000-01-01

    We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the jobs and thereby incur job-dependent penalties for each rejected job, and he must construct a schedule for the remaining

  5. Outage scheduling and implementation

    International Nuclear Information System (INIS)

    Allison, J.E.; Segall, P.; Smith, R.R.

    1986-01-01

    Successful preparation and implementation of an outage schedule and completion of scheduled and emergent work within an identified critical path time frame is a result of careful coordination by Operations, Work Control, Maintenance, Engineering, Planning and Administration and others. At the Fast Flux Test Facility (FFTF) careful planning has been responsible for meeting all scheduled outage critical paths

  6. Scheduling with Time Lags

    NARCIS (Netherlands)

    X. Zhang (Xiandong)

    2010-01-01

    textabstractScheduling is essential when activities need to be allocated to scarce resources over time. Motivated by the problem of scheduling barges along container terminals in the Port of Rotterdam, this thesis designs and analyzes algorithms for various on-line and off-line scheduling problems

  7. 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

  8. 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.

  9. 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.

  10. 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.

  11. 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.

  12. 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

  13. 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.

  14. 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.

  15. 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.

  16. 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

  17. 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

  18. NASA scheduling technologies

    Science.gov (United States)

    Adair, Jerry R.

    1994-01-01

    This paper is a consolidated report on ten major planning and scheduling systems that have been developed by the National Aeronautics and Space Administration (NASA). A description of each system, its components, and how it could be potentially used in private industry is provided in this paper. The planning and scheduling technology represented by the systems ranges from activity based scheduling employing artificial intelligence (AI) techniques to constraint based, iterative repair scheduling. The space related application domains in which the systems have been deployed vary from Space Shuttle monitoring during launch countdown to long term Hubble Space Telescope (HST) scheduling. This paper also describes any correlation that may exist between the work done on different planning and scheduling systems. Finally, this paper documents the lessons learned from the work and research performed in planning and scheduling technology and describes the areas where future work will be conducted.

  19. 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...

  20. 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

  1. 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

  2. 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....

  3. 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.

  4. 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...

  5. 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...

  6. 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....

  7. 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.

  8. 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....

  9. 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 ...

  10. Optical packet switching in HPC : an analysis of applications performance

    NARCIS (Netherlands)

    Meyer, Hugo; Sancho, Jose Carlos; Mrdakovic, Milica; Miao, Wang; Calabretta, Nicola

    2018-01-01

    Optical Packet Switches (OPS) could provide the needed low latency transmissions in today large data centers. OPS can deliver lower latency and higher bandwidth than traditional electrical switches. These features are needed for parallel High Performance Computing (HPC) applications. For this

  11. The Sphinx and the Pyramids at Giza. Educational Packet.

    Science.gov (United States)

    Gagliano, Sara; Rapport, Wendy

    This packet of materials was created to accompany the exhibit "The Sphinx and the Pyramids: 100 Years of American Archaeology at Giza" at the Semitic Museum of Harvard University. The lessons and teacher's guide focus on the following: (1) "The Mystery of the Secret Tomb" where students take on the role of an archaeologist by…

  12. 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

  13. Comparison of Deep Packet Inspection (DPI) Tools for Traffic Classification

    DEFF Research Database (Denmark)

    Bujlow, Tomasz; Carela-Español, Valentín; Barlet-Ros, Pere

    the researchers do not only have the full payloads, but also they are provided the information which application created the flow. Therefore, the dataset is useful for testing Deep Packet Inspection (DPI) tools, as well as statistical, and port-based classifiers. The dataset was created in a fully manual way...

  14. 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)

  15. Production of a tracer packet of heavier rare earth elements

    International Nuclear Information System (INIS)

    Lahiri, S.; Nayak, D.; Maji, S.

    2004-01-01

    Production of a tracer packet of heavier rare earth elements containing carrier-free radionuclides of 153,155 Tb, 153,155,157 Dy, 159 Ho, 159,161 Er, 161 Tm produced by medium energy 7 Li and 12 C irradiation on an europium oxide target and the subsequent separation of bulk europium from the carrier-free products is described. (author)

  16. Hardware packet pacing using a DMA in a parallel computer

    Science.gov (United States)

    Chen, Dong; Heidelberger, Phillip; Vranas, Pavlos

    2013-08-13

    Method and system for hardware packet pacing using a direct memory access controller in a parallel computer which, in one aspect, keeps track of a total number of bytes put on the network as a result of a remote get operation, using a hardware token counter.

  17. 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.

  18. a pyramid algorithm for the haar discrete wavelet packet transform

    African Journals Online (AJOL)

    PROF EKWUEME

    computer-aided signal processing of non-stationary signals, this paper develops a pyramid algorithm for the discrete wavelet packet ... Edith T. Luhanga, School of Computational and Communication Sciences and Engineering, Nelson Mandela African. Institute of ..... Mathematics, Washington University. 134. EDITH T.

  19. 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…

  20. Hardware Realization of an Ethernet Packet Analyzer Search Engine

    Science.gov (United States)

    2000-06-30

    specific for the home automation industry. This analyzer will be at the gateway of a network and analyze Ethernet packets as they go by. It will keep... home automation and not the computer network. This system is a stand-alone real-time network analyzer capable of decoding Ethernet protocols. The

  1. Self-Management of Hybrid Optical and Packet Switching Networks

    NARCIS (Netherlands)

    Fioreze, Tiago; Pras, Aiko

    Hybrid optical and packet switching networks enable data to be forwarded at multiple levels. Large IP flows at the IP level may be therefore moved to the optical level bypassing the per hop routing decisions of the IP level. Such move could be beneficial since congested IP networks could be

  2. Self-Management of Hybrid Optical and Packet Switching Networks

    NARCIS (Netherlands)

    Fioreze, Tiago

    2010-01-01

    Hybrid optical and packet switching networks are composed of multi-service hybrid devices that enable forwarding of data at multiple levels. Large IP flows at the IP level may be therefore moved to the optical level bypassing therefore the per hop routing decisions of the IP level. Such move could

  3. 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.

  4. On the Effects of Heterogeneous Packet Lengths on Network Coding

    DEFF Research Database (Denmark)

    Compta, Pol Torres; Fitzek, Frank; Roetter, Daniel Enrique Lucani

    2014-01-01

    Random linear network coding (RLNC) has been shown to provide increased throughput, security and robustness for the transmission of data through the network. Most of the analysis and the demonstrators have focused on the study of data packets with the same size (number of bytes). This constitutes...

  5. 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.

  6. 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)

  7. 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 ...

  8. 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.

  9. 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)

  10. Application of Cellular Automata to Detection of Malicious Network Packets

    Science.gov (United States)

    Brown, Robert L.

    2014-01-01

    A problem in computer security is identification of attack signatures in network packets. An attack signature is a pattern of bits that characterizes a particular attack. Because there are many kinds of attacks, there are potentially many attack signatures. Furthermore, attackers may seek to avoid detection by altering the attack mechanism so that…

  11. Analysis and implementation of packet preemption for Time Sensitive Networks

    DEFF Research Database (Denmark)

    Zhou, Zifan; Yan, Ying; Ruepp, Sarah Renée

    2017-01-01

    level simulation in Riverbed Modeler. The simulation is complemented by numerical analysis which provides the average queuing delay for both types of traffic (preemptable and express). Furthermore, the paper describes an approach to implement the packet preemption solution on an FPGA in VHDL, which...... illustrates the complexity of hardware implementation....

  12. 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

  13. General writing-information packet for the environmental impact project

    International Nuclear Information System (INIS)

    Raaen, H.P.

    1975-02-01

    The information packet was prepared primarily for internal use at Holifield National Laboratory. The contents include suggestions to authors of environmental statements; format of environmental statements; formats of references given in environmental statements; preparation of SELECTED BIBLIOGRAPHY; troublesome words; glossary; abbreviations, initialisms, and symbols; and MT/ST taping procedure. (U.S.)

  14. 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…

  15. Solar Energy Education Packet for Elementary & Secondary Students. Revised Edition.

    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…

  16. 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

  17. 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

  18. 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.

  19. Scheduling for decommissioning projects

    International Nuclear Information System (INIS)

    Podmajersky, O.E.

    1987-01-01

    This paper describes the Project Scheduling system being employed by the Decommissioning Operations Contractor at the Shippingport Station Decommissioning Project (SSDP). Results from the planning system show that the project continues to achieve its cost and schedule goals. An integrated cost and schedule control system (C/SCS) which uses the concept of earned value for measurement of performance was instituted in accordance with DOE orders. The schedule and cost variances generated by the C/SCS system are used to confirm management's assessment of project status. This paper describes the types of schedules and tools used on the SSDP project to plan and monitor the work, and identifies factors that are unique to a decommissioning project that make scheduling critical to the achievement of the project's goals. 1 fig

  20. Program reference schedule baseline

    International Nuclear Information System (INIS)

    1986-07-01

    This Program Reference Schedule Baseline (PRSB) provides the baseline Program-level milestones and associated schedules for the Civilian Radioactive Waste Management Program. It integrates all Program-level schedule-related activities. This schedule baseline will be used by the Director, Office of Civilian Radioactive Waste Management (OCRWM), and his staff to monitor compliance with Program objectives. Chapter 1 includes brief discussions concerning the relationship of the PRSB to the Program Reference Cost Baseline (PRCB), the Mission Plan, the Project Decision Schedule, the Total System Life Cycle Cost report, the Program Management Information System report, the Program Milestone Review, annual budget preparation, and system element plans. Chapter 2 includes the identification of all Level 0, or Program-level, milestones, while Chapter 3 presents and discusses the critical path schedules that correspond to those Level 0 milestones

  1. 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.

  2. 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...

  3. 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.

  4. 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 ...

  5. Energy awareness

    Energy Technology Data Exchange (ETDEWEB)

    1977-01-01

    The objective of the Symposium for Public Awareness on Energy was to provide an information exchange among the members of the technical community and the public, civic, fraternal, service, and labor organizations on timely energy-related issues. The 1977 symposium was oriented toward state and local governmental officials in the southeastern states. Since it is these officials who have the responsibility for the development and actualization of local energy strategies, the program was directed toward providing information which would be of help to them in considering energy plans. The symposium presentations featured speakers who are recognized in many facets of the energy field. A variety of views were expressed and a number of policy alternatives were suggested. It is hoped that the presentations provided the motivation for the audience to return to their respective communities with a new and expanded perspective regarding energy issues and policies. The private and public organizations represented at the symposium can continue to provide pertinent information to those who are interested. A separate abstract was prepared for each of the 9 presentations.

  6. Approximating Preemptive Stochastic Scheduling

    OpenAIRE

    Megow Nicole; Vredeveld Tjark

    2009-01-01

    We present constant approximative policies for preemptive stochastic scheduling. We derive policies with a guaranteed performance ratio of 2 for scheduling jobs with release dates on identical parallel machines subject to minimizing the sum of weighted completion times. Our policies as well as their analysis apply also to the recently introduced more general model of stochastic online scheduling. The performance guarantee we give matches the best result known for the corresponding determinist...

  7. Revisiting Symbiotic Job Scheduling

    OpenAIRE

    Eyerman , Stijn; Michaud , Pierre; Rogiest , Wouter

    2015-01-01

    International audience; —Symbiotic job scheduling exploits the fact that in a system with shared resources, the performance of jobs is impacted by the behavior of other co-running jobs. By coscheduling combinations of jobs that have low interference, the performance of a system can be increased. In this paper, we investigate the impact of using symbiotic job scheduling for increasing throughput. We find that even for a theoretically optimal scheduler, this impact is very low, despite the subs...

  8. 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

  9. Battery-Aware Scheduling of Mixed Criticality Systems

    DEFF Research Database (Denmark)

    Wognsen, Erik Ramsgaard; Hansen, Rene Rydhof; Larsen, Kim Guldstrand

    2014-01-01

    . Mixed criticality and soft real-time systems may accept deadline violations and therefore enable trade-offs and evaluation of performance by criteria such as the number of tasks that can be completed with a given battery. We model a task set in combination with the kinetic battery model as a stochastic...

  10. Energy-Aware Scheduling of FIR Filter Structures

    DEFF Research Database (Denmark)

    Koch, Peter; Wognsen, Erik Ramsgaard

    2015-01-01

    In this report we initially introduce four different implementation structures which are suitable for the Finite Impulse Response filters applied in the SDR front-end. We derive data flow graphs and precedence graphs for all four structures using the Synchronous Data Flow (SDF) notation. Using po...

  11. Information sharing, scheduling, and awareness in community gardening collaboration

    NARCIS (Netherlands)

    Wang, X.; Wakkary, R.; Neustædter, C.; Desjardins, A.

    2015-01-01

    Community gardens are places where people, as a collaborative group, grow food for themselves and for others. There is a lack of studies in HCI regarding collaboration in community gardens and considering technologies to support such collaborations. This paper reports on a detailed study of

  12. LADS: Optimizing Data Transfers using Layout-Aware Data Scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Youngjae [ORNL; Atchley, Scott [ORNL; Vallee, Geoffroy R [ORNL; Shipman, Galen M [ORNL

    2015-01-01

    While future terabit networks hold the promise of signifi- cantly improving big-data motion among geographically distributed data centers, significant challenges must be overcome even on today s 100 gigabit networks to real- ize end-to-end performance. Multiple bottlenecks exist along the end-to-end path from source to sink. Data stor- age infrastructure at both the source and sink and its in- terplay with the wide-area network are increasingly the bottleneck to achieving high performance. In this paper, we identify the issues that lead to congestion on the path of an end-to-end data transfer in the terabit network en- vironment, and we present a new bulk data movement framework called LADS for terabit networks. LADS ex- ploits the underlying storage layout at each endpoint to maximize throughput without negatively impacting the performance of shared storage resources for other users. LADS also uses the Common Communication Interface (CCI) in lieu of the sockets interface to use zero-copy, OS-bypass hardware when available. It can further im- prove data transfer performance under congestion on the end systems using buffering at the source using flash storage. With our evaluations, we show that LADS can avoid congested storage elements within the shared stor- age resource, improving I/O bandwidth, and data transfer rates across the high speed networks.

  13. Memory aware query scheduling in a database cluster

    NARCIS (Netherlands)

    F. Waas; M.L. Kersten (Martin)

    2000-01-01

    textabstractQuery throughput is one of the primary optimization goals in interactive web-based information systems in order to achieve the performance necessary to serve large user communities. Queries in this application domain differ significantly from those in traditional database applications:

  14. Resource-aware control and dynamic scheduling in CPS

    NARCIS (Netherlands)

    Heemels, W.P.M.H.

    2015-01-01

    Recent developments in computer and communication technologies are leading to an increasingly networked and wireless world. This raises new challenging questions in the context of control for cyberphysical systems (CPS), especially when the computation, communication, energy and actuation resources

  15. Deadline-aware scheduling for Software Transactional Memory

    DEFF Research Database (Denmark)

    Maldonado, Walter; Marlier, Patrick; Felber, Pascal

    2011-01-01

    Software Transactional Memory (STM) is an optimistic concurrency control mechanism that simplifies the development of parallel programs. Still, the interest of STM has not yet been demonstrated for reactive applications that require bounded response time for some of their operations. We propose...

  16. Leakage aware hardware and stochastic power scheduling for smart ...

    African Journals Online (AJOL)

    A core requirement of effective and efficient management of energy is a good understanding of where and how the energy is used; how much of the system's energy is consumed by which parts of the system and under what circumstances. In this work, a Smartphone is developed, hereafter referred to as the XLP, from the ...

  17. 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

  18. 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....

  19. Alternative Work Schedules: Definitions

    Science.gov (United States)

    Journal of the College and University Personnel Association, 1977

    1977-01-01

    The term "alternative work schedules" encompasses any variation of the requirement that all permanent employees in an organization or one shift of employees adhere to the same five-day, seven-to-eight-hour schedule. This article defines staggered hours, flexible working hours (flexitour and gliding time), compressed work week, the task system, and…

  20. Range Scheduling Aid (RSA)

    Science.gov (United States)

    Logan, J. R.; Pulvermacher, M. K.

    1991-01-01

    Range Scheduling Aid (RSA) is presented in the form of the viewgraphs. The following subject areas are covered: satellite control network; current and new approaches to range scheduling; MITRE tasking; RSA features; RSA display; constraint based analytic capability; RSA architecture; and RSA benefits.

  1. The triangle scheduling problem

    NARCIS (Netherlands)

    Dürr, Christoph; Hanzálek, Zdeněk; Konrad, Christian; Seddik, Yasmina; Sitters, R.A.; Vásquez, Óscar C.; Woeginger, Gerhard

    2017-01-01

    This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A measure is introduced, namely the binary tree ratio. It is shown that the Greedy algorithm solves the problem to

  2. 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.

  3. 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

  4. 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.

  5. 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.

  6. 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.

  7. 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...

  8. 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.

  9. 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.

  10. 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.

  11. Binary Systematic Network Coding for Progressive Packet Decoding

    OpenAIRE

    Jones, Andrew L.; Chatzigeorgiou, Ioannis; Tassi, Andrea

    2015-01-01

    We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show that systematic network coding outperforms conventional net- work coding. We also develop an algorithm based on Gaussian elimination that allows progressive decoding of source packets. Simulation results show that the proposed decoding algorithm can achieve ...

  12. IP- -: A Reduced Internet Protocol for Optical Packet Networking

    Science.gov (United States)

    Ohta, Masataka; Fujikawa, Kenji

    IP- - is proposed as an Internet Protocol suitable for optical packet networking. As optical routers require much faster control than electric ones and lack of optical buffers other than those by fiber delay lines requires fixed time control, Internet Protocols must be at least as simple as IPv4 and much simpler than IPv6. IP- - also addresses issues of IP address space exhaustion and IP routing table explosion.

  13. Information Processing Techniques Program. Volume I. Packet Speech Systems Technology

    Science.gov (United States)

    1980-09-30

    Itindsign has litt-rn vt-tntit-r aliti sill dI- ditiibuted trrni cparat- tintr aisa ithnnin ITtc-i A. Packet Vttice Terminal As Iprt- iouisik rtrtteti tin...September 1980. FO1M 1473 EDITION OF I NOV 65 IS OBSOLETEDD I JAN 73 UNCLA.SSI F[IF ) SECURITY CLASSIFICATION OF THIS PAGE (Ibmn Data fntew-d)

  14. Effect of latency and packet loss on achievable bandwidth

    CERN Multimedia

    CERN. Geneva

    2015-01-01

    Following an incident with a slow database replication between CERN's data centers, we discovered that even a very low rate packet loss in the network can induce significant penalties to long distance single stream TCP transfers. We explore the behaviour of multiple congestion control algorithms in a controlled loss environment in order to understand what is the achievable throughput of TCP data transfers between the Meyrin and Wigner data centres.

  15. Universal potential-barrier penetration by initially confined wave packets

    International Nuclear Information System (INIS)

    Granot, Er'el; Marchewka, Avi

    2007-01-01

    The dynamics of an initially sharp-boundary wave packet in the presence of an arbitrary potential barrier is investigated. It is shown that the penetration through the barrier is universal in the sense that it depends only on the values of the wave function and its derivatives at the boundary. The dependence on the derivatives vanishes at long distances from the barrier, where the dynamics is governed solely by the initial value of the wave function at the boundary

  16. Universal potential-barrier penetration by initially confined wave packets

    Science.gov (United States)

    Granot, Er'El; Marchewka, Avi

    2007-07-01

    The dynamics of an initially sharp-boundary wave packet in the presence of an arbitrary potential barrier is investigated. It is shown that the penetration through the barrier is universal in the sense that it depends only on the values of the wave function and its derivatives at the boundary. The dependence on the derivatives vanishes at long distances from the barrier, where the dynamics is governed solely by the initial value of the wave function at the boundary.

  17. NASA Schedule Management Handbook

    Science.gov (United States)

    2011-01-01

    The purpose of schedule management is to provide the framework for time-phasing, resource planning, coordination, and communicating the necessary tasks within a work effort. The intent is to improve schedule management by providing recommended concepts, processes, and techniques used within the Agency and private industry. The intended function of this handbook is two-fold: first, to provide guidance for meeting the scheduling requirements contained in NPR 7120.5, NASA Space Flight Program and Project Management Requirements, NPR 7120.7, NASA Information Technology and Institutional Infrastructure Program and Project Requirements, NPR 7120.8, NASA Research and Technology Program and Project Management Requirements, and NPD 1000.5, Policy for NASA Acquisition. The second function is to describe the schedule management approach and the recommended best practices for carrying out this project control function. With regards to the above project management requirements documents, it should be noted that those space flight projects previously established and approved under the guidance of prior versions of NPR 7120.5 will continue to comply with those requirements until project completion has been achieved. This handbook will be updated as needed, to enhance efficient and effective schedule management across the Agency. It is acknowledged that most, if not all, external organizations participating in NASA programs/projects will have their own internal schedule management documents. Issues that arise from conflicting schedule guidance will be resolved on a case by case basis as contracts and partnering relationships are established. It is also acknowledged and understood that all projects are not the same and may require different levels of schedule visibility, scrutiny and control. Project type, value, and complexity are factors that typically dictate which schedule management practices should be employed.

  18. 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.

  19. 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.

  20. 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

  1. 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.

  2. 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^...

  3. 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.

  4. 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.

  5. 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.

  6. 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.

  7. 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

  8. 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 ...

  9. 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.

  10. 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

  11. Physician Fee Schedule Search

    Data.gov (United States)

    U.S. Department of Health & Human Services — This website is designed to provide information on services covered by the Medicare Physician Fee Schedule (MPFS). It provides more than 10,000 physician services,...

  12. Clinical Laboratory Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — Outpatient clinical laboratory services are paid based on a fee schedule in accordance with Section 1833(h) of the Social Security Act. The clinical laboratory fee...

  13. CERN confirms LHC schedule

    CERN Document Server

    2003-01-01

    The CERN Council held its 125th session on 20 June. Highlights of the meeting included confirmation that the LHC is on schedule for a 2007 start-up, and the announcement of a new organizational structure in 2004.

  14. DMEPOS Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — The list contains the fee schedule amounts, floors, and ceilings for all procedure codes and payment category, jurisdication, and short description assigned to each...

  15. Project Schedule Simulation

    DEFF Research Database (Denmark)

    Mizouni, Rabeb; Lazarova-Molnar, Sanja

    2015-01-01

    overrun both their budget and time. To improve the quality of initial project plans, we show in this paper the importance of (1) reflecting features’ priorities/risk in task schedules and (2) considering uncertainties related to human factors in plan schedules. To make simulation tasks reflect features......’ priority as well as multimodal team allocation, enhanced project schedules (EPS), where remedial actions scenarios (RAS) are added, were introduced. They reflect potential schedule modifications in case of uncertainties and promote a dynamic sequencing of involved tasks rather than the static conventional...... this document as an instruction set. The electronic file of your paper will be formatted further at Journal of Software. Define all symbols used in the abstract. Do not cite references in the abstract. Do not delete the blank line immediately above the abstract; it sets the footnote at the bottom of this column....

  16. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

    Sørensen, M. D.; Clausen, Jens

    2002-01-01

    scheduling is investigated. The airport terminal is divided into zones, where each zone consists of a set of stands geographically next to each other. Staff is assigned to work in only one zone and the staff scheduling is planned decentralized for each zone. The advantage of this approach is that the staff...... work in a smaller area of the terminal and thus spends less time walking between stands. When planning decentralized the allocation of stands to flights influences the staff scheduling since the workload in a zone depends on which flights are allocated to stands in the zone. Hence solving the problem...... depends on the actual stand allocation but also on the number of zones and the layout of these. A mathematical model of the problem is proposed, which integrates the stand allocation and the staff scheduling. A heuristic solution method is developed and applied on a real case from British Airways, London...

  17. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-11-01

    This single page document is the November 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the production reactor.

  18. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-10-01

    This single page document is the October 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.

  19. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-10-15

    This single page document is the October 15, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.

  20. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-09-15

    This single page document is the September 15, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production Reactor.

  1. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-12-15

    This single page document is the December 16, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production reactor.

  2. Reactor outage schedule (tentative)

    Energy Technology Data Exchange (ETDEWEB)

    Walton, R.P.

    1969-12-01

    This single page document is the December 1, 1969 reactor refueling outage schedule for the Hanford Production Reactor. It also contains data on the amounts and types of fuels to be loaded and relocated in the Production reactor.

  3. Fee Schedules - General Information

    Data.gov (United States)

    U.S. Department of Health & Human Services — A fee schedule is a complete listing of fees used by Medicare to pay doctors or other providers-suppliers. This comprehensive listing of fee maximums is used to...

  4. CMS Records Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — The CMS Records Schedule provides disposition authorizations approved by the National Archives and Records Administration (NARA) for CMS program-related records...

  5. ATLAS construction schedule

    CERN Multimedia

    Kotamaki, M

    The goal during the last few months has been to freeze and baseline as much as possible the schedules of various ATLAS systems and activities. The main motivations for the re-baselining of the schedules have been the new LHC schedule aiming at first collisions in early 2006 and the encountered delays in civil engineering as well as in the production of some of the detectors. The process was started by first preparing a new installation schedule that takes into account all the new external constraints and the new ATLAS staging scenario. The installation schedule version 3 was approved in the March EB and it provides the Ready For Installation (RFI) milestones for each system, i.e. the date when the system should be available for the start of the installation. TCn is now interacting with the systems aiming at a more realistic and resource loaded version 4 before the end of the year. Using the new RFI milestones as driving dates a new summary schedule has been prepared, or is under preparation, for each system....

  6. 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.

  7. 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.

  8. 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.

  9. Constraint-based job shop scheduling with ILOG SCHEDULER

    NARCIS (Netherlands)

    Nuijten, W.P.M.; Le Pape, C.

    1998-01-01

    We introduce constraint-based scheduling and discuss its main principles. An approximation algorithm based on tree search is developed for the job shop scheduling problem using ILOG SCHEDULER. A new way of calculating lower bounds on the makespan of the job shop scheduling problem is presented and

  10. 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.

  11. 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.

  12. 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

  13. Constraint-based scheduling

    Science.gov (United States)

    Zweben, Monte

    1993-01-01

    The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint-based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all the inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocation for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its application to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.

  14. SPANR planning and scheduling

    Science.gov (United States)

    Freund, Richard F.; Braun, Tracy D.; Kussow, Matthew; Godfrey, Michael; Koyama, Terry

    2001-07-01

    SPANR (Schedule, Plan, Assess Networked Resources) is (i) a pre-run, off-line planning and (ii) a runtime, just-in-time scheduling mechanism. It is designed to support primarily commercial applications in that it optimizes throughput rather than individual jobs (unless they have highest priority). Thus it is a tool for a commercial production manager to maximize total work. First the SPANR Planner is presented showing the ability to do predictive 'what-if' planning. It can answer such questions as, (i) what is the overall effect of acquiring new hardware or (ii) what would be the effect of a different scheduler. The ability of the SPANR Planner to formulate in advance tree-trimming strategies is useful in several commercial applications, such as electronic design or pharmaceutical simulations. The SPANR Planner is demonstrated using a variety of benchmarks. The SPANR Runtime Scheduler (RS) is briefly presented. The SPANR RS can provide benefit for several commercial applications, such as airframe design and financial applications. Finally a design is shown whereby SPANR can provide scheduling advice to most resource management systems.

  15. 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

  16. 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...

  17. A Time-Frequency Auditory Model Using Wavelet Packets

    DEFF Research Database (Denmark)

    Agerkvist, Finn

    1996-01-01

    A time-frequency auditory model is presented. The model uses the wavelet packet analysis as the preprocessor. The auditory filters are modelled by the rounded exponential filters, and the excitation is smoothed by a window function. By comparing time-frequency excitation patterns it is shown...... that the change in the time-frequency excitation pattern introduced when a test tone at masked threshold is added to the masker is approximately equal to 7 dB for all types of maskers. The classic detection ratio therefore overrates the detection efficiency of the auditory system....

  18. Theoretical prediction of a rotating magnon wave packet in ferromagnets.

    Science.gov (United States)

    Matsumoto, Ryo; Murakami, Shuichi

    2011-05-13

    We theoretically show that the magnon wave packet has a rotational motion in two ways: a self-rotation and a motion along the boundary of the sample (edge current). They are similar to the cyclotron motion of electrons, but unlike electrons the magnons have no charge and the rotation is not due to the Lorentz force. These rotational motions are caused by the Berry phase in momentum space from the magnon band structure. Furthermore, the rotational motion of the magnon gives an additional correction term to the magnon Hall effect. We also discuss the Berry curvature effect in the classical limit of long-wavelength magnetostatic spin waves having macroscopic coherence length.

  19. Memory of AMR coded speech distorted by packet loss

    OpenAIRE

    Nykänen, Arne; Lindegren, David; Wruck, Louisa; Ljung, Robert; Odelius, Johan; Möller, Sebastian

    2014-01-01

    Previous studies have shown that free recall of spoken word lists is impaired if the speech is presented in background noise, even if the signal-to-noise ratio is kept at a level allowing full word identification. The objective of this study was to examine recall rates for word lists presented in noise and word lists coded by an AMR (Adaptive Multi Rate) telephone codec distorted by packet loss. Twenty subjects performed a word recall test. Word lists consisting of ten words were played to th...

  20. Riemann zeta function from wave-packet dynamics

    DEFF Research Database (Denmark)

    Mack, R.; Dahl, Jens Peder; Moya-Cessa, H.

    2010-01-01

    We show that the time evolution of a thermal phase state of an anharmonic oscillator with logarithmic energy spectrum is intimately connected to the generalized Riemann zeta function zeta(s, a). Indeed, the autocorrelation function at a time t is determined by zeta (sigma + i tau, a), where sigma...... index of JWKB. We compare and contrast exact and approximate eigenvalues of purely logarithmic potentials. Moreover, we use a numerical method to find a potential which leads to exact logarithmic eigenvalues. We discuss possible realizations of Riemann zeta wave-packet dynamics using cold atoms...

  1. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

    Hjorth, Katrine; Börjesson, Maria; Engelson, Leonid

    2015-01-01

    of car drivers' route and mode choice under uncertain travel times. Our analysis exposes some important methodological issues related to complex non-linear scheduling models: One issue is identifying the point in time where the marginal utility of being at the destination becomes larger than the marginal......Different assumptions about travelers' scheduling preferences yield different measures of the cost of travel time variability. Only few forms of scheduling preferences provide non-trivial measures which are additive over links in transport networks where link travel times are arbitrarily...... utility of being at the origin. Another issue is that models with the exponential marginal utility formulation suffer from empirical identification problems. Though our results are not decisive, they partly support the constant-affine specification, in which the value of travel time variability...

  2. Post LS1 schedule

    CERN Document Server

    Lamont, M

    2014-01-01

    The scheduling limits for a typical long year taking into account technical stops, machine development, spe- cial physics runs are presented. An attempt is then made to outline a ten year post LS1 schedule taking into account the disparate requirements outlined in the previous talks in this session. The demands on the planned long shutdowns and the impact of these demands on their proposed length will be discussed. The option of using ion running as a pre-shutdown cool-down period will be addressed.

  3. 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.

  4. 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.

  5. 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.

  6. Automated Scheduling Via Artificial Intelligence

    Science.gov (United States)

    Biefeld, Eric W.; Cooper, Lynne P.

    1991-01-01

    Artificial-intelligence software that automates scheduling developed in Operations Mission Planner (OMP) research project. Software used in both generation of new schedules and modification of existing schedules in view of changes in tasks and/or available resources. Approach based on iterative refinement. Although project focused upon scheduling of operations of scientific instruments and other equipment aboard spacecraft, also applicable to such terrestrial problems as scheduling production in factory.

  7. 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...

  8. CMS multicore scheduling strategy

    International Nuclear Information System (INIS)

    Yzquierdo, Antonio Pérez-Calero; Hernández, Jose; Holzman, Burt; Majewski, Krista; McCrea, Alison

    2014-01-01

    In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue 'Moore's Law' style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications, but also the memory requirements of these processes push the workernode architectures to the limit. One solution is parallelizing the application itself, through forking and memory sharing or through threaded frameworks. CMS is following all of these approaches and has a comprehensive strategy to schedule multicore jobs on the GRID based on the glideinWMS submission infrastructure. The main component of the scheduling strategy, a pilot-based model with dynamic partitioning of resources that allows the transition to multicore or whole-node scheduling without disallowing the use of single-core jobs, is described. This contribution also presents the experiences made with the proposed multicore scheduling schema and gives an outlook of further developments working towards the restart of the LHC in 2015.

  9. Harmonious personnel scheduling

    NARCIS (Netherlands)

    Fijn van Draat, Laurens; Post, Gerhard F.; Veltman, Bart; Winkelhuijzen, Wessel

    2006-01-01

    The area of personnel scheduling is very broad. Here we focus on the ‘shift assignment problem’. Our aim is to discuss how ORTEC HARMONY handles this planning problem. In particular we go into the structure of the optimization engine in ORTEC HARMONY, which uses techniques from genetic algorithms,

  10. Hybrid job shop scheduling

    NARCIS (Netherlands)

    Schutten, Johannes M.J.

    1995-01-01

    We consider the problem of scheduling jobs in a hybrid job shop. We use the term 'hybrid' to indicate that we consider a lot of extensions of the classic job shop, such as transportation times, multiple resources, and setup times. The Shifting Bottleneck procedure can be generalized to deal with

  11. Practical job shop scheduling

    NARCIS (Netherlands)

    Schutten, Johannes M.J.

    1998-01-01

    The Shifting Bottleneck procedure is an intuitive and reasonably good approximation algorithm for the notoriously difficult classical job shop scheduling problem. The principle of decomposing a classical job shop problem into a series of single-machine problems can also easily be applied to job shop

  12. "Creative" Work Schedules.

    Science.gov (United States)

    Blai, Boris

    Many creative or flexible work scheduling options are becoming available to the many working parents, students, handicapped persons, elderly individuals, and others who are either unable or unwilling to work a customary 40-hour work week. These options may be broadly categorized as either restructured or reduced work time options. The three main…

  13. 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.

  14. 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间通信,通过模拟防真软件来代替现实的设备,以解决在实践教学中实验设备缺乏的问题,提高教学质量。

  15. 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...

  16. 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...

  17. 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;…

  18. 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.

  19. 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)

  20. 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....

  1. 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…

  2. 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...

  3. 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

  4. 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...

  5. 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…

  6. 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…

  7. 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

  8. 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.

  9. 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...

  10. 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)

  11. 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...

  12. 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

  13. 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...

  14. 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...

  15. 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.

  16. 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.

  17. 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.

  18. 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.

  19. 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.

  20. 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.

  1. 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

  2. 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.

  3. 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.

  4. 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.

  5. 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.

  6. 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

  7. 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

  8. Scheduling techniques in the Request Oriented Scheduling Engine (ROSE)

    Science.gov (United States)

    Zoch, David R.

    1991-01-01

    Scheduling techniques in the ROSE are presented in the form of the viewgraphs. The following subject areas are covered: agenda; ROSE summary and history; NCC-ROSE task goals; accomplishments; ROSE timeline manager; scheduling concerns; current and ROSE approaches; initial scheduling; BFSSE overview and example; and summary.

  9. Location-based Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    on the market. However, CPM is primarily an activity based method that takes the activity as the unit of focus and there is criticism raised, specifically in the case of construction projects, on the method for deficient management of construction work and continuous flow of resources. To seek solutions...... to the identified limitations of the CPM method, an alternative planning and scheduling methodology that includes locations is tested. Location-based Scheduling (LBS) implies a shift in focus, from primarily the activities to the flow of work through the various locations of the project, i.e. the building. LBS uses...... the graphical presentation technique of Line-of-balance, which is adapted for planning and management of work-flows that facilitates resources to perform their work without interruptions caused by other resources working with other activities in the same location. As such, LBS and Lean Construction share...

  10. 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

  11. 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

  12. 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.

  13. Modelling altered fractionation schedules

    International Nuclear Information System (INIS)

    Fowler, J.F.

    1993-01-01

    The author discusses the conflicting requirements of hyperfractionation and accelerated fractionation used in radiotherapy, and the development of computer modelling to predict how to obtain an optimum of tumour cell kill without exceeding normal-tissue tolerance. The present trend is to shorten hyperfractionated schedules from 6 or 7 weeks to give overall times of 4 or 5 weeks as in new schedules by Herskovic et al (1992) and Harari (1992). Very high doses are given, much higher than can be given when ultrashort schedules such as CHART (12 days) are used. Computer modelling has suggested that optimum overall times, to yield maximum cell kill in tumours ((α/β = 10 Gy) for a constant level of late complications (α/β = 3 Gy) would be X or X-1 weeks, where X is the doubling time of the tumour cells in days (Fowler 1990). For median doubling times of about 5 days, overall times of 4 or 5 weeks should be ideal. (U.K.)

  14. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

    Hjorth, Katrine; Börjesson, Maria; Engelson, Leonid

    Extended abstract Choice of departure time is a travel choice dimension that transportation planners often need to forecast in appraisal. A traveller may shift departure time in response to changes in expected travel time or travel time variability (TTV) or in response to time-differentiated cong......Extended abstract Choice of departure time is a travel choice dimension that transportation planners often need to forecast in appraisal. A traveller may shift departure time in response to changes in expected travel time or travel time variability (TTV) or in response to time...... from the underlying scheduling preferences (Noland and Small, 1995, Bates et al., 2001, Fosgerau and Karlström, 2010). The scheduling preferences can be formally represented as time-dependent rates of utility derived at different locations. Assuming that the travellers are rational and choose departure......’ departure time choice. The assumption underlying the scheduling approach is that the traveller rationally maximises her total utility obtained during a period of time. The total utility depends on time of departure from the origin and time of arrival to the destination. The total utility is usually assumed...

  15. Printed Persian Subword Recognition Using Wavelet Packet Descriptors

    Directory of Open Access Journals (Sweden)

    Samira Nasrollahi

    2013-01-01

    Full Text Available In this paper, we present a new approach to offline OCR (optical character recognition for printed Persian subwords using wavelet packet transform. The proposed algorithm is used to extract font invariant and size invariant features from 87804 subwords of 4 fonts and 3 sizes. The feature vectors are compressed using PCA. The obtained feature vectors yield a pictorial dictionary for which an entry is the mean of each group that consists of the same subword with 4 fonts in 3 sizes. The sets of these features are congregated by combining them with the dot features for the recognition of printed Persian subwords. To evaluate the feature extraction results, this algorithm was tested on a set of 2000 subwords in printed Persian text documents. An encouraging recognition rate of 97.9% is got at subword level recognition.

  16. High-speed packet switching network to link computers

    CERN Document Server

    Gerard, F M

    1980-01-01

    Virtually all of the experiments conducted at CERN use minicomputers today; some simply acquire data and store results on magnetic tape while others actually control experiments and help to process the resulting data. Currently there are more than two hundred minicomputers being used in the laboratory. In order to provide the minicomputer users with access to facilities available on mainframes and also to provide intercommunication between various experimental minicomputers, CERN opted for a packet switching network back in 1975. It was decided to use Modcomp II computers as switching nodes. The only software to be taken was a communications-oriented operating system called Maxcom. Today eight Modcomp II 16-bit computers plus six newer Classic minicomputers from Modular Computer Services have been purchased for the CERNET data communications networks. The current configuration comprises 11 nodes connecting more than 40 user machines to one another and to the laboratory's central computing facility. (0 refs).

  17. Design and implementation considerations of a MSAT packet data network

    Science.gov (United States)

    Karam, Fouad G.; Hearn, Terry; Rohr, Doug; Guibord, Arthur F.

    1993-01-01

    The Mobile Data System, which is intended to provide for packet switched data services is currently under development. The system is based on a star network topology consisting of a centralized Data Hub (DH) serving a large number of mobile terminals. Through the Data Hub, end-to-end connections can be established between terrestrial users on public or private data networks and mobile users. The MDS network will be capable of offering a variety of services some of which are based on the standard X.25 network interface protocol, and others optimized for short messages and broadcast messages. A description of these services and the trade-offs in the DH design are presented.

  18. Wave packets in quantum cosmology and the cosmological constant

    International Nuclear Information System (INIS)

    Kiefer, C.

    1990-01-01

    Wave packets are constructed explicitly in minisuperspace of quantum gravity corresponding to a Friedmann universe containing a conformally coupled scalar field with and without a cosmological constant. The construction is performed in close analogy to the case of constructing coherent states in quantum mechanics. Various examples are also depicted numerically. The corresponding lorentzian path integrals are evaluated for some cases. It is emphasized that the new concept of time in quantum gravity demands the imposition of a kind of boundary conditions not encountered in quantum gravity demands the imposition of a kind of boundary conditions not encountered in quantum mechanics. Connection is also made to recent investigations predicting a vanishing cosmological constant. It is shown that the fact of whether this result is generic or not depends on where the boundary conditions are imposed in the configuration space. (orig.)

  19. Psychoacoustic Music Analysis Based on the Discrete Wavelet Packet Transform

    Directory of Open Access Journals (Sweden)

    Xing He

    2008-01-01

    Full Text Available Psychoacoustical computational models are necessary for the perceptual processing of acoustic signals and have contributed significantly in the development of highly efficient audio analysis and coding. In this paper, we present an approach for the psychoacoustic analysis of musical signals based on the discrete wavelet packet transform. The proposed method mimics the multiresolution properties of the human ear closer than other techniques and it includes simultaneous and temporal auditory masking. Experimental results show that this method provides better masking capabilities and it reduces the signal-to-masking ratio substantially more than other approaches, without introducing audible distortion. This model can lead to greater audio compression by permitting further bit rate reduction and more secure watermarking by providing greater signal space for information hiding.

  20. An adaptive routing strategy for packet delivery in complex networks

    International Nuclear Information System (INIS)

    Zhang, Huan; Liu, Zonghua; Tang, Ming; Hui, P.M.

    2007-01-01

    We present an efficient routing approach for delivering packets in complex networks. On delivering a message from a node to a destination, a node forwards the message to a neighbor by estimating the waiting time along the shortest path from each of its neighbors to the destination. This projected waiting time is dynamical in nature and the path through which a message is delivered would be adapted to the distribution of messages in the network. Implementing the approach on scale-free networks, we show that the present approach performs better than the shortest-path approach and another approach that takes into account of the waiting time only at the neighboring nodes. Key features in numerical results are explained by a mean field theory. The approach has the merit that messages are distributed among the nodes according to the capabilities of the nodes in handling messages

  1. Wave-packet approach to Rydberg resonances in dissociative recombination

    International Nuclear Information System (INIS)

    Morisset, Sabine; Pichl, Lukas; Orel, Ann E.; Schneider, Ioan F.

    2007-01-01

    We report the time-dependent approach to resonant electron capture into Rydberg states in collisions with molecular cations at low impact energy, as an alternative to the method based on multichannel quantum defect theory (MQDT), and present the results for the HD + ion. The propagation of the initial wave function on 13 Rydberg states (besides one valence state) correctly describes the indirect dissociative recombination mechanism in the time domain. Notably, the nonlocal coupling operator between the ionization and dissociation channels is accounted for in the indirect process, extending previous work on the case of direct coupling. The present approach compares to the MQDT framework with remarkable precision: resonant structures in the cross section correctly emerge from the wave-packet propagation; the time-dependent result also forms a cross section envelope for the dense series of ultrafine MQDT resonances corresponding to the quasicontinuous part of the Rydberg state manifold

  2. Denoising in Wavelet Packet Domain via Approximation Coefficients

    Directory of Open Access Journals (Sweden)

    Zahra Vahabi

    2012-01-01

    Full Text Available In this paper we propose a new approach in the wavelet domain for image denoising. In recent researches wavelet transform has introduced a time-Frequency transform for computing wavelet coefficient and eliminating noise. Some coefficients have effected smaller than the other's from noise, so they can be use reconstruct images with other subbands. We have developed Approximation image to estimate better denoised image. Naturally noiseless subimage introduced image with lower noise. Beside denoising we obtain a bigger compression rate. Increasing image contrast is another advantage of this method. Experimental results demonstrate that our approach compares favorably to more typical methods of denoising and compression in wavelet domain.100 images of LIVE Dataset were tested, comparing signal to noise ratios (SNR,soft thresholding was %1.12 better than hard thresholding, POAC was %1.94 better than soft thresholding and POAC with wavelet packet was %1.48 better than POAC.

  3. Quantum wave packet study of D+OF reaction

    International Nuclear Information System (INIS)

    Kurban, M.; Karabulut, E.; Tutuk, R.; Goektas, F.

    2010-01-01

    The quantum dynamics of the D+OF reaction on the adiabatic potential energy surface of the ground 1 3 A ' state has been studied by using a time-dependent quantum real wave packet method. The state-to-state and state-to-all reaction probabilities for total angular momentum J = 0 have been calculated. The probabilities for J > 0 have been calculated by J-shifting the J = 0 results by means of capture model. Then, the integral cross sections and initial state selected rate constants have been calculated. The initial state-selected reaction probabilities and reaction cross section show threshold but not manifest any resonances and the initial state selected rate constants are sensitive to the temperature.

  4. 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.

  5. 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)

  6. 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.

  7. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    1982-07-01

    Effective January 1, 1982, NRC will institute records retention and disposal practices in accordance with the approved Comprehensive Records Disposition Schedule (CRDS). CRDS is comprised of NRC Schedules (NRCS) 1 to 4 which apply to the agency's program or substantive records and General Records Schedules (GRS) 1 to 22 which apply to housekeeping or facilitative records. The schedules are assembled functionally/organizationally to facilitate their use. Preceding the records descriptions and disposition instructions for both NRCS and GRS, there are brief statements on the organizational units which accumulate the records in each functional area, and other information regarding the schedules' applicability

  8. 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)

  9. 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.

  10. 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.

  11. 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.

  12. Awareness in cardiac anesthesia.

    LENUS (Irish Health Repository)

    Serfontein, Leon

    2010-02-01

    Cardiac surgery represents a sub-group of patients at significantly increased risk of intraoperative awareness. Relatively few recent publications have targeted the topic of awareness in this group. The aim of this review is to identify areas of awareness research that may equally be extrapolated to cardiac anesthesia in the attempt to increase understanding of the nature and significance of this scenario and how to reduce it.

  13. Practical quantum appointment scheduling

    Science.gov (United States)

    Touchette, Dave; Lovitz, Benjamin; Lütkenhaus, Norbert

    2018-04-01

    We propose a protocol based on coherent states and linear optics operations for solving the appointment-scheduling problem. Our main protocol leaks strictly less information about each party's input than the optimal classical protocol, even when considering experimental errors. Along with the ability to generate constant-amplitude coherent states over two modes, this protocol requires the ability to transfer these modes back-and-forth between the two parties multiple times with very low losses. The implementation requirements are thus still challenging. Along the way, we develop tools to study quantum information cost of interactive protocols in the finite regime.

  14. Scheduling theory, algorithms, and systems

    CERN Document Server

    Pinedo, Michael L

    2016-01-01

    This new edition of the well-established text Scheduling: Theory, Algorithms, and Systems provides an up-to-date coverage of important theoretical models in the scheduling literature as well as important scheduling problems that appear in the real world. The accompanying website includes supplementary material in the form of slide-shows from industry as well as movies that show actual implementations of scheduling systems. The main structure of the book, as per previous editions, consists of three parts. The first part focuses on deterministic scheduling and the related combinatorial problems. The second part covers probabilistic scheduling models; in this part it is assumed that processing times and other problem data are random and not known in advance. The third part deals with scheduling in practice; it covers heuristics that are popular with practitioners and discusses system design and implementation issues. All three parts of this new edition have been revamped, streamlined, and extended. The reference...

  15. Quantized Visual Awareness

    Directory of Open Access Journals (Sweden)

    W Alexander Escobar

    2013-11-01

    Full Text Available The proposed model holds that, at its most fundamental level, visual awareness is quantized. That is to say that visual awareness arises as individual bits of awareness through the action of neural circuits with hundreds to thousands of neurons in at least the human striate cortex. Circuits with specific topologies will reproducibly result in visual awareness that correspond to basic aspects of vision like color, motion and depth. These quanta of awareness (qualia are produced by the feedforward sweep that occurs through the geniculocortical pathway but are not integrated into a conscious experience until recurrent processing from centers like V4 or V5 select the appropriate qualia being produced in V1 to create a percept. The model proposed here has the potential to shift the focus of the search for visual awareness to the level of microcircuits and these likely exist across the kingdom Animalia. Thus establishing qualia as the fundamental nature of visual awareness will not only provide a deeper understanding of awareness, but also allow for a more quantitative understanding of the evolution of visual awareness throughout the animal kingdom.

  16. 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...

  17. 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

  18. 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.

  19. 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.

  20. 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...

  1. 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...

  2. Perceptions of randomized security schedules.

    Science.gov (United States)

    Scurich, Nicholas; John, Richard S

    2014-04-01

    Security of infrastructure is a major concern. Traditional security schedules are unable to provide omnipresent coverage; consequently, adversaries can exploit predictable vulnerabilities to their advantage. Randomized security schedules, which randomly deploy security measures, overcome these limitations, but public perceptions of such schedules have not been examined. In this experiment, participants were asked to make a choice between attending a venue that employed a traditional (i.e., search everyone) or a random (i.e., a probability of being searched) security schedule. The absolute probability of detecting contraband was manipulated (i.e., 1/10, 1/4, 1/2) but equivalent between the two schedule types. In general, participants were indifferent to either security schedule, regardless of the probability of detection. The randomized schedule was deemed more convenient, but the traditional schedule was considered fairer and safer. There were no differences between traditional and random schedule in terms of perceived effectiveness or deterrence. Policy implications for the implementation and utilization of randomized schedules are discussed. © 2013 Society for Risk Analysis.

  3. Students multicultural awareness

    Directory of Open Access Journals (Sweden)

    F.I Soekarman

    2016-12-01

    Full Text Available Multicultural awareness is the foundation of communication and it involves the ability of standing back from ourselves and becoming aware of our cultural values, beliefs and perceptions. Multicultural awareness becomes central when we have to interact with people from other cultures. People see, interpret and evaluate things in a different ways. What is considered an appropriate behaviour in one culture is frequently inappropriate in another one. this research use descriptive- quantitative methodology to indentify level of students multicultural awareness specifically will be identified by gender and academic years. This research will identify multicultural awareness based on differences of gender, academic years. This research use random and purposive random sampling of 650 students from university. These studies identify of multicultural awareness 34, 11, 4% in high condition, 84, 1% medium and 4, 5% in low. Further, there is a significant difference in the level of multicultural awareness based on gender and academic year. These findings could not be generalized because of the limited sample and ethnicity; it should need a wider research so that can be generalized and recommended the efforts to development and improvement of multicultural awareness conditions for optimization the services.

  4. 2007 Wholesale Power Rate Schedules : 2007 General Rate Schedule Provisions.

    Energy Technology Data Exchange (ETDEWEB)

    United States. Bonneville Power Administration.

    2006-11-01

    This schedule is available for the contract purchase of Firm Power to be used within the Pacific Northwest (PNW). Priority Firm (PF) Power may be purchased by public bodies, cooperatives, and Federal agencies for resale to ultimate consumers, for direct consumption, and for Construction, Test and Start-Up, and Station Service. Rates in this schedule are in effect beginning October 1, 2006, and apply to purchases under requirements Firm Power sales contracts for a three-year period. The Slice Product is only available for public bodies and cooperatives who have signed Slice contracts for the FY 2002-2011 period. Utilities participating in the Residential Exchange Program (REP) under Section 5(c) of the Northwest Power Act may purchase Priority Firm Power pursuant to the Residential Exchange Program. Rates under contracts that contain charges that escalate based on BPA's Priority Firm Power rates shall be based on the three-year rates listed in this rate schedule in addition to applicable transmission charges. This rate schedule supersedes the PF-02 rate schedule, which went into effect October 1, 2001. Sales under the PF-07 rate schedule are subject to BPA's 2007 General Rate Schedule Provisions (2007 GRSPs). Products available under this rate schedule are defined in the 2007 GRSPs. For sales under this rate schedule, bills shall be rendered and payments due pursuant to BPA's 2007 GRSPs and billing process.

  5. 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.)

  6. 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.

  7. Wave-packet revival for the Schroedinger equation with position-dependent mass

    International Nuclear Information System (INIS)

    Schmidt, Alexandre G.M.

    2006-01-01

    We study the temporal evolution of solutions of 1D Schroedinger equation with position-dependent mass inside an infinite well. Revival of wave-packet is shown to exist and partial revivals are different from the usual ones

  8. 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...

  9. 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..

  10. Rostering and Task Scheduling

    DEFF Research Database (Denmark)

    Dohn, Anders Høeg

    . The rostering process is non-trivial and especially when service is required around the clock, rostering may involve considerable effort from a designated planner. Therefore, in order to minimize costs and overstaffing, to maximize the utilization of available staff, and to ensure a high level of satisfaction...... as possible to the available staff, while respecting various requirements and rules and while including possible transportation time between tasks. This thesis presents a number of industrial applications in rostering and task scheduling. The applications exist within various contexts in health care....... Mathematical and logic-based models are presented for the problems considered. Novel components are added to existing models and the modeling decisions are justified. In one case, the model is solved by a simple, but efficient greedy construction heuristic. In the remaining cases, column generation is applied...

  11. Scheduling the powering tests

    CERN Document Server

    Barbero-Soto, E; Casas-Lino, M P; Fernandez-Robles, C; Foraz, K; Pojer, M; Saban, R; Schmidt, R; Solfaroli-Camillocci, M; Vergara-Fernandez, A

    2008-01-01

    The Large Hadron Collider is now entering in its final phase before receiving beam, and the activities at CERN between 2007 and 2008 have shifted from installation work to the commissioning of the technical systems ("hardware commissioning"). Due to the unprecedented complexity of this machine, all the systems are or will be tested as far as possible before the cool-down starts. Systems are firstly tested individually before being globally tested together. The architecture of LHC, which is partitioned into eight cryogenically and electrically independent sectors, allows the commissioning on a sector by sector basis. When a sector reaches nominal cryogenic conditions, commissioning of the magnet powering system to nominal current for all magnets can be performed. This paper briefly describes the different activities to be performed during the powering tests of the superconducting magnet system and presents the scheduling issues raised by co-activities as well as the management of resources.

  12. Improving Packet Processing Performance in the ATLAS FELIX Project

    CERN Document Server

    AUTHOR|(SzGeCERN)752705; The ATLAS collaboration; Anderson, John Thomas; Borga, Andrea; Boterenbrood, Hendrik; Chen, Hucheng; Chen, Kai; Drake, Gary; Francis, David; Gorini, Benedetto; Lanni, Francesco; Lehmann Miotto, Giovanna; Levinson, Lorne; Narevicius, Julia; Plessl, Christian; Roich, Alexander; Ryu, Soo; Schreuder, Frans Philip; Vandelli, Wainer; Zhang, Jinlong; Vermeulen, Jos

    2015-01-01

    Experiments in high-energy physics (HEP) and related fields often impose constraints and challenges on data acquisition systems. As a result, these systems are implemented as unique mixtures of custom and commercial-off-the-shelf electronics (COTS), involving and connecting radiation-hard devices, large high-performance networks, and computing farms. FELIX, the Frontend Link Exchange, is a new PC-based general purpose data routing device for the data-acquisition system of the ATLAS experiment at CERN. Performance is a very crucial point for devices like FELIX, which have to be capable of processing tens of gigabyte of data per second. Thus it is important to understand the performance limitations for typical workloads on modern hardware. We present an analysis of a packet processing algorithm that is used in FELIX, and show how the PC system's memory architecture plays a key factor in the overall data throughput achieved by the application. Finally, we present optimizations that increase the processing throug...

  13. Wavelet Packet Transform Based Driver Distraction Level Classification Using EEG

    Directory of Open Access Journals (Sweden)

    Mousa Kadhim Wali

    2013-01-01

    Full Text Available We classify the driver distraction level (neutral, low, medium, and high based on different wavelets and classifiers using wireless electroencephalogram (EEG signals. 50 subjects were used for data collection using 14 electrodes. We considered for this research 4 distraction stimuli such as Global Position Systems (GPS, music player, short message service (SMS, and mental tasks. Deriving the amplitude spectrum of three different frequency bands theta, alpha, and beta of EEG signals was based on fusion of discrete wavelet packet transform (DWPT and FFT. Comparing the results of three different classifiers (subtractive fuzzy clustering probabilistic neural network, -nearest neighbor was based on spectral centroid, and power spectral features extracted by different wavelets (db4, db8, sym8, and coif5. The results of this study indicate that the best average accuracy achieved by subtractive fuzzy inference system classifier is 79.21% based on power spectral density feature extracted by sym8 wavelet which gave a good class discrimination under ANOVA test.

  14. Hanbury Brown–Twiss Effect with Wave Packets

    Directory of Open Access Journals (Sweden)

    Tabish Qureshi

    2017-11-01

    Full Text Available The Hanbury Brown–Twiss (HBT effect, at the quantum level, is essentially an interference of one particle with another, as opposed to interference of a particle with itself. Conventional treatments of identical particles encounter difficulties while dealing with entanglement. A recently introduced label-free approach to indistinguishable particles is described, and is used to analyze the HBT effect. Quantum wave-packets have been used to provide a better understanding of the quantum interpretation of the HBT effect. The effect is demonstrated for two independent particles governed by Bose–Einstein or Fermi–Dirac statistics. The HBT effect is also analyzed for pairs of entangled particles. Surprisingly, entanglement has almost no effect on the interference seen in the HBT effect. In the light of the results, an old quantum optics experiment is reanalyzed, and it is argued that the interference seen in that experiment is not a consequence of non-local correlations between the photons, as is commonly believed. Quanta 2017; 6: 61–69.

  15. 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.

  16. Sport Tournament Automated Scheduling System

    OpenAIRE

    Raof R. A. A; Sudin S.; Mahrom N.; Rosli A. N. C

    2018-01-01

    The organizer of sport events often facing problems such as wrong calculations of marks and scores, as well as difficult to create a good and reliable schedule. Most of the time, the issues about the level of integrity of committee members and also issues about errors made by human came into the picture. Therefore, the development of sport tournament automated scheduling system is proposed. The system will be able to automatically generate the tournament schedule as well as automatically calc...

  17. 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

  18. 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.

  19. 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...

  20. 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 ...

  1. 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

  2. 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

  3. 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...

  4. 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...

  5. 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.

  6. NRC comprehensive records disposition schedule

    International Nuclear Information System (INIS)

    1992-03-01

    Title 44 United States Code, ''Public Printing and Documents,'' regulations cited in the General Services Administration's (GSA) ''Federal Information Resources Management Regulations'' (FIRMR), Part 201-9, ''Creation, Maintenance, and Use of Records,'' and regulation issued by the National Archives and Records Administration (NARA) in 36 CFR Chapter XII, Subchapter B, ''Records Management,'' require each agency to prepare and issue a comprehensive records disposition schedule that contains the NARA approved records disposition schedules for records unique to the agency and contains the NARA's General Records Schedules for records common to several or all agencies. The approved records disposition schedules specify the appropriate duration of retention and the final disposition for records created or maintained by the NRC. NUREG-0910, Rev. 2, contains ''NRC's Comprehensive Records Disposition Schedule,'' and the original authorized approved citation numbers issued by NARA. Rev. 2 totally reorganizes the records schedules from a functional arrangement to an arrangement by the host office. A subject index and a conversion table have also been developed for the NRC schedules to allow staff to identify the new schedule numbers easily and to improve their ability to locate applicable schedules

  7. 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.

  8. 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.

  9. 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.

  10. Awareness in Gestalt sex therapy.

    Science.gov (United States)

    Mosher, D L

    1979-01-01

    Awareness is conceived to be selective, curative, a method, a prescription for ideal living, and a ground for human existence. In this paper the following gestalt awareness methods are described: continuum of awareness, awareness questions, biobehavioral feedback, directed awareness, concentration, present-centering, taking responsibilty, and shuttles in awareness. The use of these methods is illustrated in a gestalt therapy dialogue. The application of awareness as concept and method to sensate focus and to the treatment of the prematurely ejaculating male is discussed. Shuttles in awareness and the shared continua of awareness are introduced as promising new methods in the treatment of sexual dysfunction and as enhancing sexual pleasure and communion.

  11. Energy Aware Computing in Cooperative Wireless Networks

    DEFF Research Database (Denmark)

    Olsen, Anders Brødløs; Fitzek, Frank H. P.; Koch, Peter

    2005-01-01

    In this work the idea of cooperation is applied to wireless communication systems. It is generally accepted that energy consumption is a significant design constraint for mobile handheld systems. We propose a novel method of cooperative task computing by distributing tasks among terminals over...... the unreliable wireless link. Principles of multi–processor energy aware task scheduling are used exploiting performance scalable technologies such as Dynamic Voltage Scaling (DVS). We introduce a novel mechanism referred to as D2VS and here it is shown by means of simulation that savings of 40% can be achieved....

  12. Schedules of Controlled Substances: Temporary Placement of 4-Fluoroisobutyryl Fentanyl into Schedule I. Temporary scheduling order.

    Science.gov (United States)

    2017-05-03

    The Administrator of the Drug Enforcement Administration is issuing this temporary scheduling order to schedule the synthetic opioid, N-(4-fluorophenyl)-N-(1-phenethylpiperidin-4-yl)isobutyramide (4-fluoroisobutyryl fentanyl or para-fluoroisobutyryl fentanyl), and its isomers, esters, ethers, salts and salts of isomers, esters, and ethers, into schedule I pursuant to the temporary scheduling provisions of the Controlled Substances Act. This action is based on a finding by the Administrator that the placement of 4-fluoroisobutyryl fentanyl into schedule I of the Controlled Substances Act is necessary to avoid an imminent hazard to the public safety. As a result of this order, the regulatory controls and administrative, civil, and criminal sanctions applicable to schedule I controlled substances will be imposed on persons who handle (manufacture, distribute, reverse distribute, import, export, engage in research, conduct instructional activities or chemical analysis, or possess), or propose to handle, 4-fluoroisobutyryl fentanyl.

  13. 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.

  14. 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

  15. 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.

  16. 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.

  17. 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.

  18. Power Aware Distributed Systems

    National Research Council Canada - National Science Library

    Schott, Brian

    2004-01-01

    The goal of PADS was to study power aware management techniques for wireless unattended ground sensor applications to extend their operational lifetime and overall capabilities in this battery-constrained environment...

  19. Cross-cultural awareness

    OpenAIRE

    БУРЯК Н.Ю.

    2016-01-01

    The article deals with the importance of cultural awareness for businesspeople when they go abroad. It also gives some cultural advice and factors which are thought to be the most important in creating a culture.

  20. Year 2000 awareness

    Energy Technology Data Exchange (ETDEWEB)

    Holmes, C.

    1997-11-01

    This report contains viewgraphs on the challenges business face with the year 2000 software problem. Estimates, roadmaps, virtual factory software, current awareness, and world wide web references are given.