56 resultados para Traffic assignment.
Resumo:
We present here an improvisation of HNN (Panchal, Bhavesh et al., 2001) called RD 3D HNCAN for backbone (HN, CA and N-15) assignment in both folded and unfolded proteins. This is a reduced dimensionality experiment which employs CA chemical shifts to improve dispersion. Distinct positive and negative peak patterns of various triplet segments along the polypeptide chain observed in HNN are retained and these provide start and check points for the sequential walk. Because of co-incrementing of CA and N-15, peaks along one of the dimensions appear at sums and differences of the CA and N-15 chemical shifts. This changes the backbone assignment protocol slightly and we present this in explicit detail. The performance of the experiment has been demonstrated using Ubiquitin and Plasmodium falciparum P2 proteins. The experiment is particularly valuable when two neighboring amino acid residues have nearly identical backbone N-15 chemical shifts. (C) 2012 Elsevier Inc. All rights reserved.
Resumo:
Sequence specific resonance assignments have been obtained for H-1, C-13 and N-15 nuclei of the 21 kDa (188 residues long) glutamine amido transferase subunit of guanosine monophosphate synthetase from Methanocaldococcus jannaschii. From an analysis of H-1 and C-13(alpha), C-13(beta) secondary chemical shifts, (3) JH(N)H(alpha) scalar coupling constants and sequential, short and medium range H-1-H-1 NOEs, it was deduced that the glutamine amido transferase subunit has eleven strands and five helices as the major secondary structural elements in its tertiary structure.
Resumo:
TCP attacks are the major problem faced by Mobile Ad hoc Networks (MANETs) due to its limited network and host resources. Attacker traceback is a promising solution which allows a victim to identify the exact location of the attacker and hence enables the victim to take proper countermeasure near attack origins, for forensics and to discourage attackers from launching the attacks. However, attacker traceback in MANET is a challenging problem due to dynamic network topology, limited network and host resources such as memory, bandwidth and battery life. We introduce a novel method of TCP attacker Identification in MANET using the Traffic History - MAITH. Based on the comprehensive evaluation based on simulations, we showed that MAITH can successfully track down the attacker under diverse mobile multi-hop network environment with low communication, computation, and memory overhead.
Resumo:
Channel-aware assignment of sub-channels to users in the downlink of an OFDMA system demands extensive feedback of channel state information (CSI) to the base station. Since the feedback bandwidth is often very scarce, schemes that limit feedback are necessary. We develop a novel, low feedback splitting-based algorithm for assigning each sub-channel to its best user, i.e., the user with the highest gain for that sub-channel among all users. The key idea behind the algorithm is that, at any time, each user contends for the sub-channel on which it has the largest channel gain among the unallocated sub-channels. Unlike other existing schemes, the algorithm explicitly handles multiple access control aspects associated with the feedback of CSI. A tractable asymptotic analysis of a system with a large number of users helps design the algorithm. It yields 50% to 65% throughput gains compared to an asymptotically optimal one-bit feedback scheme, when the number of users is as small as 10 or as large as 1000. The algorithm is fast and distributed, and scales with the number of users.
Resumo:
Streaming applications demand hard bandwidth and throughput guarantees in a multiprocessor environment amidst resource competing processes. We present a Label Switching based Network-on-Chip (LS-NoC) motivated by throughput guarantees offered by bandwidth reservation. Label switching is a packet relaying technique in which individual packets carry route information in the form of labels. A centralized LS-NoC Management framework engineers traffic into Quality of Service (QoS) guaranteed routes. LS-NoC caters to the requirements of streaming applications where communication channels are fixed over the lifetime of the application. The proposed NoC framework inherently supports heterogeneous and ad hoc system-on-chips. The LS-NoC can be used in conjunction with conventional best effort NoC as a QoS guaranteed communication network or as a replacement to the conventional NoC. A multicast, broadcast capable label switched router for the LS-NoC has been designed. A 5 port, 256 bit data bus, 4 bit label router occupies 0.431 mm(2) in 130 nm and delivers peak bandwidth of 80 Gbits/s per link at 312.5 MHz. Bandwidth and latency guarantees of LS-NoC have been demonstrated on traffic from example streaming applications and on constant and variable bit rate traffic patterns. LS-NoC was found to have a competitive AreaxPower/Throughput figure of merit with state-of-the-art NoCs providing QoS. Circuit switching with link sharing abilities and support for asynchronous operation make LS-NoC a desirable choice for QoS servicing in chip multiprocessors. (C) 2013 Elsevier B.V. All rights reserved.
Resumo:
The study demonstrates the utility of ternary ion-pair complex formed among BINOL (1,1'-Bi-2-naphthol), a carboxylic acid and an organic base, such as, dimethylpyridine (DMAP), 1,4-diazabicyclo2.2.2]octane (DABCO), as a versatile chiral solvating agent (CSA) for the enantiodiscrimination of carboxylic acids, measurement of enantiomeric excess (ee) and the assignment of absolute configuration of hydroxy acids. The proposed mechanism of ternary complex has wider application for testing the enantiopurity owing to the fact that the binary mixture using BINOL alone does not serve as a solvating agent for their discrimination. In addition, the developed protocol has an excellent utility for the assignment of the absolute configurations of hydroxy acids.
Resumo:
Three-component chiral derivatization protocols are proposed for the assignment of the absolute configurations of chiral primary amines and chiral hydroxy acids using H-1-NMR. The protocols involve simple mixing of the ternary components in CDCl3, followed by stirring for 15 min. The spectra can be recorded directly, without invoking any separation method, unlike many other chiral derivatizing agents. The protocols permit the analysis in less than 15 min, making them convenient and effective for the assignment of the absolute configurations of primary amines and hydroxy acids.
Resumo:
Materials with widely varying molecular topologies and exhibiting liquid crystalline properties have attracted considerable attention in recent years. C-13 NMR spectroscopy is a convenient method for studying such novel systems. In this approach the assignment of the spectrum is the first step which is a non-trivial problem. Towards this end, we propose here a method that enables the carbon skeleton of the different sub-units of the molecule to be traced unambiguously. The proposed method uses a heteronuclear correlation experiment to detect pairs of nearby carbons with attached protons in the liquid crystalline core through correlation of the carbon chemical shifts to the double-quantum coherences of protons generated through the dipolar coupling between them. Supplemented by experiments that identify non-protonated carbons, the method leads to a complete assignment of the spectrum. We initially apply this method for assigning the C-13 spectrum of the liquid crystal 4-n-pentyl-4'-cyanobiphenyl oriented in the magnetic field. We then utilize the method to assign the aromatic carbon signals of a thiophene based liquid crystal thereby enabling the local order-parameters of the molecule to be estimated and the mutual orientation of the different sub-units to be obtained.
Resumo:
Optimal control of traffic lights at junctions or traffic signal control (TSC) is essential for reducing the average delay experienced by the road users amidst the rapid increase in the usage of vehicles. In this paper, we formulate the TSC problem as a discounted cost Markov decision process (MDP) and apply multi-agent reinforcement learning (MARL) algorithms to obtain dynamic TSC policies. We model each traffic signal junction as an independent agent. An agent decides the signal duration of its phases in a round-robin (RR) manner using multi-agent Q-learning with either is an element of-greedy or UCB 3] based exploration strategies. It updates its Q-factors based on the cost feedback signal received from its neighbouring agents. This feedback signal can be easily constructed and is shown to be effective in minimizing the average delay of the vehicles in the network. We show through simulations over VISSIM that our algorithms perform significantly better than both the standard fixed signal timing (FST) algorithm and the saturation balancing (SAT) algorithm 15] over two real road networks.
Resumo:
The study discusses an approach that allows simultaneous determination of boronic acid and its anhydride without the need for tedious physical separation of the mixture. The assignment of the proton spectra of monomer, dimer and trimer was achieved by combining utility of 1D and 2D experimental techniques including 2D DOSY. The differential intensities of NMR peaks and supplementary resonances were detected in low polar solvents, such as, chloroform, toluene and in a non-polar solvent benzene. A fascinating phenomenon is observed at lower temperature where there is a formation of aryl boronic acid with the disappearance of boraxine formation. (C) 2015 Elsevier B.V. All rights reserved.
Resumo:
This paper proposes a probabilistic prediction based approach for providing Quality of Service (QoS) to delay sensitive traffic for Internet of Things (IoT). A joint packet scheduling and dynamic bandwidth allocation scheme is proposed to provide service differentiation and preferential treatment to delay sensitive traffic. The scheduler focuses on reducing the waiting time of high priority delay sensitive services in the queue and simultaneously keeping the waiting time of other services within tolerable limits. The scheme uses the difference in probability of average queue length of high priority packets at previous cycle and current cycle to determine the probability of average weight required in the current cycle. This offers optimized bandwidth allocation to all the services by avoiding distribution of excess resources for high priority services and yet guaranteeing the services for it. The performance of the algorithm is investigated using MPEG-4 traffic traces under different system loading. The results show the improved performance with respect to waiting time for scheduling high priority packets and simultaneously keeping tolerable limits for waiting time and packet loss for other services. Crown Copyright (C) 2015 Published by Elsevier B.V.