226 resultados para Alternate routes
Resumo:
Sum rules constraining the R-current spectral densities are derived holographically for the case of D3-branes, M2-branes and M5-branes all at finite chemical potentials. In each of the cases the sum rule relates a certain integral of the spectral density over the frequency to terms which depend both on long distance physics, hydrodynamics and short distance physics of the theory. The terms which which depend on the short distance physics result from the presence of certain chiral primaries in the OPE of two it-currents which are turned on at finite chemical potential. Since these sum rules contain information of the OPE they provide an alternate method to obtain the structure constants of the two R-currents and the chiral primary. As a consistency check we show that the 3 point function derived from the sum rule precisely matches with that obtained using Witten diagrams.
Resumo:
Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. We seek to develop local forwarding algorithms that can be tuned so as to tradeoff the end-to-end delay against a total cost, such as the hop count or total energy. Our approach is to solve, at each forwarding node enroute to the sink, the local forwarding problem of minimizing one-hop waiting delay subject to a lower bound constraint on a suitable reward offered by the next-hop relay; the constraint serves to tune the tradeoff. The reward metric used for the local problem is based on the end-to-end total cost objective (for instance, when the total cost is hop count, we choose to use the progress toward sink made by a relay as the reward). The forwarding node, to begin with, is uncertain about the number of relays, their wake-up times, and the reward values, but knows the probability distributions of these quantities. At each relay wake-up instant, when a relay reveals its reward value, the forwarding node's problem is to forward the packet or to wait for further relays to wake-up. In terms of the operations research literature, our work can be considered as a variant of the asset selling problem. We formulate our local forwarding problem as a partially observable Markov decision process (POMDP) and obtain inner and outer bounds for the optimal policy. Motivated by the computational complexity involved in the policies derived out of these bounds, we formulate an alternate simplified model, the optimal policy for which is a simple threshold rule. We provide simulation results to compare the performance of the inner and outer bound policies against the simple policy, and also against the optimal policy when the source knows the exact number of relays. Observing the good performance and the ease of implementation of the simple policy, we apply it to our motivating problem, i.e., local geographical routing of sporadic alarm packets in a large WSN. We compare the end-to-end performance (i.e., average total delay and average total cost) obtained by the simple policy, when used for local geographical forwarding, against that obtained by the globally optimal forwarding algorithm proposed by Kim et al. 1].
Resumo:
In the last decade, there has been a tremendous interest in Graphene transistors. The greatest advantage for CMOS nanoelectronics applications is the fact that Graphene is compatible with planar CMOS technology and potentially offers excellent short channel properties. Because of the zero bandgap, it will not be possible to turn off the MOSFET efficiently and hence the typical on current to off current ratio (Ion/Ioff) has been less than 10. Several techniques have been proposed to open the bandgap in Graphene. It has been demonstrated, both theoretically and experimentally, that Graphene Nanoribbons (GNR) show a bandgap which is inversely proportional to their width. GNRs with about 20 nm width have bandgaps in the range of 100meV. But it is very difficult to obtain GNRs with well defined edges. An alternate technique to open the band gap is to use bilayer Graphene (BLG), with an asymmetric bias applied in the direction perpendicular to their plane. Another important CMOS metric, the subthreshold slope is also limited by the inability to turn off the transistor. However, these devices could be attractive for RF CMOS applications. But even for analog and RF applications the non-saturating behavior of the drain current can be an issue. Although some studies have reported current saturation, the mechanisms are still not very clear. In this talk we present some of our recent findings, based on simulations and experiments, and propose possible solutions to obtain high on current to off current ratio. A detailed study on high field transport in grapheme transistors, relevant for analog and RF applications will also be presented.
Resumo:
Recently, Ebrahimi and Fragouli proposed an algorithm to construct scalar network codes using small fields (and vector network codes of small lengths) satisfying multicast constraints in a given single-source, acyclic network. The contribution of this paper is two fold. Primarily, we extend the scalar network coding algorithm of Ebrahimi and Fragouli (henceforth referred to as the EF algorithm) to block network-error correction. Existing construction algorithms of block network-error correcting codes require a rather large field size, which grows with the size of the network and the number of sinks, and thereby can be prohibitive in large networks. We give an algorithm which, starting from a given network-error correcting code, can obtain another network code using a small field, with the same error correcting capability as the original code. Our secondary contribution is to improve the EF Algorithm itself. The major step in the EF algorithm is to find a least degree irreducible polynomial which is coprime to another large degree polynomial. We suggest an alternate method to compute this coprime polynomial, which is faster than the brute force method in the work of Ebrahimi and Fragouli.
Resumo:
Mobile ad hoc networks (MANETs) is one of the successful wireless network paradigms which offers unrestricted mobility without depending on any underlying infrastructure. MANETs have become an exciting and im- portant technology in recent years because of the rapid proliferation of variety of wireless devices, and increased use of ad hoc networks in various applications. Like any other networks, MANETs are also prone to variety of attacks majorly in routing side, most of the proposed secured routing solutions based on cryptography and authentication methods have greater overhead, which results in latency problems and resource crunch problems, especially in energy side. The successful working of these mechanisms also depends on secured key management involving a trusted third authority, which is generally difficult to implement in MANET environ-ment due to volatile topology. Designing a secured routing algorithm for MANETs which incorporates the notion of trust without maintaining any trusted third entity is an interesting research problem in recent years. This paper propose a new trust model based on cognitive reasoning,which associates the notion of trust with all the member nodes of MANETs using a novel Behaviors-Observations- Beliefs(BOB) model. These trust values are used for detec- tion and prevention of malicious and dishonest nodes while routing the data. The proposed trust model works with the DTM-DSR protocol, which involves computation of direct trust between any two nodes using cognitive knowledge. We have taken care of trust fading over time, rewards, and penalties while computing the trustworthiness of a node and also route. A simulator is developed for testing the proposed algorithm, the results of experiments shows incorporation of cognitive reasoning for computation of trust in routing effectively detects intrusions in MANET environment, and generates more reliable routes for secured routing of data.
Resumo:
Influenza virus evades host immunity through antigenic drift and shift, and continues to circulate in the human population causing periodic outbreaks including the recent 2009 pandemic. A large segment of the population was potentially susceptible to this novel strain of virus. Historically, monoclonal antibodies (MAbs) have been fundamental tools for diagnosis and epitope mapping of influenza viruses and their importance as an alternate treatment option is also being realized. The current study describes isolation of a high affinity (K-D = 2.1 +/- 0.4 pM) murine MAb, MA2077 that binds specifically to the hemagglutinin (HA) surface glycoprotein of the pandemic virus. The antibody neutralized the 2009 pandemic H1N1 virus in an in vitro microneutralization assay (IC50 = 0.08 mu g/ml). MA2077 also showed hemagglutination inhibition activity (HI titre of 0.50 mu g/ml) against the pandemic virus. In a competition ELISA, MA2077 competed with the binding site of the human MAb, 2D1 (isolated from a survivor of the 1918 Spanish flu pandemic) on pandemic H1N1 HA. Epitope mapping studies using yeast cell-surface display of a stable HA1 fragment, wherein `Sa' and `Sb' sites were independently mutated, localized the binding site of MA2077 within the `Sa' antigenic site. These studies will facilitate our understanding of antigen antibody interaction in the context of neutralization of the pandemic influenza virus.
Resumo:
The assembly of aerospace and automotive structures in recent years is increasingly carried out using adhesives. Adhesive joints have advantages of uniform stress distribution and less stress concentration in the bonded region. Nevertheless, they may suffer due to the presence of defects in bond line and at the interface or due to improper curing process. While defects like voids, cracks and delaminations present in the adhesive bond line may be detected using different NDE methods, interfacial defects in the form of kissing bond may go undetected. Attempts using advanced ultrasonic methods like nonlinear ultrasound and guided wave inspection to detect kissing bond have met with limited success stressing the need for alternate methods. This paper concerns the preliminary studies carried out on detectability of dry contact kissing bonds in adhesive joints using the Digital Image Correlation (DIC) technique. In this attempt, adhesive joint samples containing varied area of kissing bond were prepared using the glass fiber reinforced composite (GFRP) as substrates and epoxy resin as the adhesive layer joining them. The samples were also subjected to conventional and high power ultrasonic inspection. Further, these samples were loaded till failure to determine the bond strength during which digital images were recorded and analyzed using the DIC method. This noncontact method could indicate the existence of kissing bonds at less than 50% failure load. Finite element studies carried out showed a similar trend. Results obtained from these preliminary studies are encouraging and further tests need to be done on a larger set of samples to study experimental uncertainties and scatter associated with the method. (C) 2013 Elsevier Ltd. All rights reserved.
Resumo:
Calcium titanate (CaTiO3) nanophosphors were synthesized by three different routes namely solution combustion (SC), modified solid-state reaction (MSS) and solid-state (SS) methods. Rietveld refinement studies revealed the presence of an orthorhombic structure with traces of CaCO3. The crystallite sizes were found to be in the 43-45 nm range. TEM studies also confirm the nano size with well crystalline nature. EPR spectrum for SS method exhibits a broad resonance signal at g = 2.027 is attributed to TiO6](9-) center, whereas in MSS sample the resonance signals are attributed to surface electron and hole trapping sites. The TL behavior has been investigated for the first time using gamma-irradiation. TL glow peak at 169 degrees C were recorded in CaTiO3 prepared by SC, MSS and SS methods. The trapping parameters such as activation energy (E) and order of kinetics (b) were estimated using peak shape method and results are discussed in detail. (C) 2013 Elsevier Ltd. All rights reserved.
Resumo:
Introduction: Cytochromes P450 (P450) and associated monooxygenases are a family of heme proteins involved in metabolism of endogenous compounds (arachidonic acid, eicosanoids and prostaglandins) as also xenobiotics including drugs and environmental chemicals. Liver is the major organ involved in P450-mediated metabolism and hepatic enzymes have been characterized. Extrahepatic organs, such as lung, kidney and brain have the capability for biotransformation through P450 enzymes. Brain, including human brain, expresses P450 enzymes that metabolize xenobiotics and endogenous compounds. Areas covered: An overview of P450-mediated metabolism in brain is presented focusing on distinct differences seen in expression of P450 enzymes, generation of unique P450 enzymes in brain through alternate splicing and their consequences in terms of metabolism of psychoactive drugs and inflammatory prompts, such as leukotrienes, thus modulating inflammatory response. Expert opinion: The brain possesses unique P450s that metabolize drugs and endogenous compounds through pathways that are markedly different from that seen in liver indicating that extrapolation directly from liver to brain is not appropriate. It is therefore necessary to characterize the unique brain P450s and their ability to metabolize xenobiotics and endogenous compounds to better understand the functions of this important class of enzymes in brain, especially human brain.
Resumo:
Background: Recent research on glioblastoma (GBM) has focused on deducing gene signatures predicting prognosis. The present study evaluated the mRNA expression of selected genes and correlated with outcome to arrive at a prognostic gene signature. Methods: Patients with GBM (n = 123) were prospectively recruited, treated with a uniform protocol and followed up. Expression of 175 genes in GBM tissue was determined using qRT-PCR. A supervised principal component analysis followed by derivation of gene signature was performed. Independent validation of the signature was done using TCGA data. Gene Ontology and KEGG pathway analysis was carried out among patients from TCGA cohort. Results: A 14 gene signature was identified that predicted outcome in GBM. A weighted gene (WG) score was found to be an independent predictor of survival in multivariate analysis in the present cohort (HR = 2.507; B = 0.919; p < 0.001) and in TCGA cohort. Risk stratification by standardized WG score classified patients into low and high risk predicting survival both in our cohort (p = <0.001) and TCGA cohort (p = 0.001). Pathway analysis using the most differentially regulated genes (n = 76) between the low and high risk groups revealed association of activated inflammatory/immune response pathways and mesenchymal subtype in the high risk group. Conclusion: We have identified a 14 gene expression signature that can predict survival in GBM patients. A network analysis revealed activation of inflammatory response pathway specifically in high risk group. These findings may have implications in understanding of gliomagenesis, development of targeted therapies and selection of high risk cancer patients for alternate adjuvant therapies.
Resumo:
Most charge generation studies on organic solar cells focus on the conventional mode of photocurrent generation derived from light absorption in the electron donor component (so called channel I). In contrast, relatively little attention has been paid to the alternate generation pathway: light absorption in the electron acceptor followed by photo-induced hole transfer (channel II). By using the narrow optical gap polymer poly(3,6-dithieno3,2-b] thiophen-2-yl)-2,5-bis(2-octyldodecyl)-pyrrolo- 3,4-c]pyrrole-1,4-dione-5',5 `'-diyl-alt-4,8-bis(dodecyloxy) benzo1,2-b:4,5-b'] dithiophene-2,6-diyl with two complimentary fullerene absorbers; phenyl-C-61-butyric acid methyl ester, and phenyl-C-71-butyric acid methyl ester (70-PCBM), we have been able to quantify the photocurrent generated each of the mechanisms and find a significant fraction (>30%), which is derived in particular from 70-PCBM light absorption.
Resumo:
We consider bounds for the capacity region of the Gaussian X channel (XC), a system consisting of two transmit-receive pairs, where each transmitter communicates with both the receivers. We first classify the XC into two classes, the strong XC and the mixed XC. In the strong XC, either the direct channels are stronger than the cross channels or vice-versa, whereas in the mixed XC, one of the direct channels is stronger than the corresponding cross channel and vice-versa. After this classification, we give outer bounds on the capacity region for each of the two classes. This is based on the idea that when one of the messages is eliminated from the XC, the rate region of the remaining three messages are enlarged. We make use of the Z channel, a system obtained by eliminating one message and its corresponding channel from the X channel, to bound the rate region of the remaining messages. The outer bound to the rate region of the remaining messages defines a subspace in R-+(4) and forms an outer bound to the capacity region of the XC. Thus, the outer bound to the capacity region of the XC is obtained as the intersection of the outer bounds to the four combinations of the rate triplets of the XC. Using these outer bounds on the capacity region of the XC, we derive new sum-rate outer bounds for both strong and mixed Gaussian XCs and compare them with those existing in literature. We show that the sum-rate outer bound for strong XC gives the sum-rate capacity in three out of the four sub-regions of the strong Gaussian XC capacity region. In case of mixed Gaussian XC, we recover the recent results in 11] which showed that the sum-rate capacity is achieved in two out of the three sub-regions of the mixed XC capacity region and give a simple alternate proof of the same.
Resumo:
We consider nonparametric or universal sequential hypothesis testing when the distribution under the null hypothesis is fully known but the alternate hypothesis corresponds to some other unknown distribution. These algorithms are primarily motivated from spectrum sensing in Cognitive Radios and intruder detection in wireless sensor networks. We use easily implementable universal lossless source codes to propose simple algorithms for such a setup. The algorithms are first proposed for discrete alphabet. Their performance and asymptotic properties are studied theoretically. Later these are extended to continuous alphabets. Their performance with two well known universal source codes, Lempel-Ziv code and KT-estimator with Arithmetic Encoder are compared. These algorithms are also compared with the tests using various other nonparametric estimators. Finally a decentralized version utilizing spatial diversity is also proposed and analysed.
Resumo:
Recent advances in the generation of synthetic gauge fields in cold atomic systems have stimulated interest in the physics of interacting bosons and fermions in them. In this paper, we discuss interacting two-component fermionic systems in uniform non-Abelian gauge fields that produce a spin-orbit interaction and uniform spin potentials. Two classes of gauge fields discussed include those that produce a Rashba spin-orbit interaction and the type of gauge fields (SM gauge fields) obtained in experiments by the Shanxi and MIT groups. For high symmetry Rashba gauge fields, a two-particle bound state exists even for a vanishingly small attractive interaction described by a scattering length. Upon increasing the strength of a Rashba gauge field, a finite density of weakly interacting fermions undergoes a crossover from a BCS like ground state to a BEC state of a new kind of boson called the rashbon whose properties are determined solely by the gauge field and not by the interaction between the fermions. The rashbon Bose-Einstein condensate (RBEC) is a quite intriguing state with the rashbon-rashbon interactions being independent of the fermion-fermion interactions (scattering length). Furthermore, we show that the RBEC has a transition temperature of the order of the Fermi temperature, suggesting routes to enhance the transition temperatures of weakly interacting superfluids by tuning the spin-orbit coupling. For the SM gauge fields, we show that in a regime of parameters, a pair of particles with finite centre-of-mass momentum is the most strongly bound. In other regimes of centre-of-mass momenta, there is no two-body bound state, but a resonance like feature appears in the scattering continuum. In the many-body setting, this results in flow enhanced pairing. Also, strongly interacting normal states utilizing the scattering resonance can be created opening the possibility of studying properties of helical Fermi liquids. This paper contains a general discussion of the physics of Feshbach resonance in a non-Abelian gauge field, where several novel features such as centre-of-mass-momentum-dependent effective interactions are shown. It is also shown that a uniform non-Abelian gauge field in conjunction with a spatial potential can be used to generate novel Hamiltonians; we discuss an explicit example of the generation of a monopole Hamiltonian.
Resumo:
Silicon nanowires were grown on Si substrates by electron beam evaporation (EBE) was demonstrated using Indium as an alternate catalyst to gold. We have studied the effect of substrate (growth) temperature, deposition time on the growth of nanowires. It was observed that a narrow temperature window from 300 degrees C to 400 degrees C for the nanowires growth. At growth temperature >= 400 degrees C suppression of nanowires growth was observed due to evaporation of catalyst particle. It is also observed that higher deposition times also leading to the absence of nanowire growth as well as uncatalyzed deposition on the nanowires side walls due to limited surface diffusion of ad atoms and catalyst evaporation.