332 resultados para Gaussian Relay Channel`


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fermi gases with generalized Rashba spin-orbit coupling induced by a synthetic gauge field have the potential of realizing many interesting states, such as rashbon condensates and topological phases. Here, we address the key open problem of the fluctuation theory of such systems and demonstrate that beyond-Gaussian effects are essential to capture the finite temperature physics of such systems. We obtain their phase diagram by constructing an approximate non-Gaussian theory. We conclusively establish that spin-orbit coupling can enhance the exponentially small transition temperature (T-c) of a weakly attracting superfluid to the order of the Fermi temperature, paving a pathway towards high T-c superfluids.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We establish zero-crossing rate (ZCR) relations between the input and the subbands of a maximally decimated M-channel power complementary analysis filterbank when the input is a stationary Gaussian process. The ZCR at lag is defined as the number of sign changes between the samples of a sequence and its 1-sample shifted version, normalized by the sequence length. We derive the relationship between the ZCR of the Gaussian process at lags that are integer multiples of Al and the subband ZCRs. Based on this result, we propose a robust iterative autocorrelation estimator for a signal consisting of a sum of sinusoids of fixed amplitudes and uniformly distributed random phases. Simulation results show that the performance of the proposed estimator is better than the sample autocorrelation over the SNR range of -6 to 15 dB. Validation on a segment of a trumpet signal showed similar performance gains.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We propose optimal bilateral filtering techniques for Gaussian noise suppression in images. To achieve maximum denoising performance via optimal filter parameter selection, we adopt Stein's unbiased risk estimate (SURE)-an unbiased estimate of the mean-squared error (MSE). Unlike MSE, SURE is independent of the ground truth and can be used in practical scenarios where the ground truth is unavailable. In our recent work, we derived SURE expressions in the context of the bilateral filter and proposed SURE-optimal bilateral filter (SOBF). We selected the optimal parameters of SOBF using the SURE criterion. To further improve the denoising performance of SOBF, we propose variants of SOBF, namely, SURE-optimal multiresolution bilateral filter (SMBF), which involves optimal bilateral filtering in a wavelet framework, and SURE-optimal patch-based bilateral filter (SPBF), where the bilateral filter parameters are optimized on small image patches. Using SURE guarantees automated parameter selection. The multiresolution and localized denoising in SMBF and SPBF, respectively, yield superior denoising performance when compared with the globally optimal SOBF. Experimental validations and comparisons show that the proposed denoisers perform on par with some state-of-the-art denoising techniques. (C) 2015 SPIE and IS&T

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The problem of cooperative beamforming for maximizing the achievable data rate of an energy constrained two-hop amplify-and-forward (AF) network is considered. Assuming perfect channel state information (CSI) of all the nodes, we evaluate the optimal scaling factor for the relay nodes. Along with individual power constraint on each of the relay nodes, we consider a weighted sum power constraint. The proposed iterative algorithm initially solves a set of relaxed problems with weighted sum power constraint and then updates the solution to accommodate individual constraints. These relaxed problems in turn are solved using a sequence of Quadratic Eigenvalue Problems (QEP). The key contribution of this letter is the generalization of cooperative beamforming to incorporate both the individual and weighted sum constraint. Furthermore, we have proposed a novel algorithm based on Quadratic Eigenvalue Problem (QEP) and discussed its convergence.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The present work investigates the mixed convective flow and heat transfer characteristics past a triangular cylinder placed symmetrically in a vertical channel. At a representative Reynolds number, Re = 100, simulations are carried out for the blockage ratios beta = 1/3; 1/4; and 1/6. Effect of aiding and opposing buoyancy is brought about by varying the Richardson number in the range -1.0 <= Ri <= 1.0. At a blockage ratio of 1/3, suppression of vortex shedding is found at Ri = 1, whereas von Karman vortex street is seen both at beta = 1/4 and 1/6, respectively. This is the first time that such behavior of blockage ratio past a triangular cylinder in the present flow configuration is reported. Drag coefficient increases progressively with increasing Ri and a slightly higher value is noticed at beta = 1/3. For all b, heat transfer increases with increasing Ri. Flattening of Nu(avg)-Ri curve beyond Ri > 0: 75 is observed at beta = 1/3.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We are given a set of sensors at given locations, a set of potential locations for placing base stations (BSs, or sinks), and another set of potential locations for placing wireless relay nodes. There is a cost for placing a BS and a cost for placing a relay. The problem we consider is to select a set of BS locations, a set of relay locations, and an association of sensor nodes with the selected BS locations, so that the number of hops in the path from each sensor to its BS is bounded by h(max), and among all such feasible networks, the cost of the selected network is the minimum. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard, and is hard to even approximate within a constant factor. For this problem, we propose a polynomial time approximation algorithm (SmartSelect) based on a relay placement algorithm proposed in our earlier work, along with a modification of the greedy algorithm for weighted set cover. We have analyzed the worst case approximation guarantee for this algorithm. We have also proposed a polynomial time heuristic to improve upon the solution provided by SmartSelect. Our numerical results demonstrate that the algorithms provide good quality solutions using very little computation time in various randomly generated network scenarios.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A person walks along a line (which could be an idealisation of a forest trail, for example), placing relays as he walks, in order to create a multihop network for connecting a sensor at a point along the line to a sink at the start of the line. The potential placement points are equally spaced along the line, and at each such location the decision to place or not to place a relay is based on link quality measurements to the previously placed relays. The location of the sensor is unknown apriori, and is discovered as the deployment agent walks. In this paper, we extend our earlier work on this class of problems to include the objective of achieving a 2-connected multihop network. We propose a network cost objective that is additive over the deployed relays, and accounts for possible alternate routing over the multiple available paths. As in our earlier work, the problem is formulated as a Markov decision process. Placement algorithms are obtained for two source location models, which yield a discounted cost MDP and an average cost MDP. In each case we obtain structural results for an optimal policy, and perform a numerical study that provides insights into the advantages and disadvantages of multi-connectivity. We validate the results obtained from numerical study experimentally in a forest-like environment.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we study sum secrecy rate in multicarrier decode-and-forward relay beamforming. We obtain the optimal source power and relay weights on each subcarrier which maximize the sum secrecy rate. For a given total power on a given subcarrier k, P-0(k), we reformulate the optimization problem by relaxing the rank-1 constraint on the complex positive semidefinite relay weight matrix, and solve using semidefinite programming. We analytically prove that the solution to the relaxed optimization problem is indeed rank 1. We show that the subcarrier secrecy rate, R-s (P-0(k)), is a concave function in total power P-0(k) if R-s (P-0(k)) > 0 for any P-0(k) > 0. Numerical results show that the sum secrecy rate with optimal power allocation across subcarriers is more than the sum secrecy rate with equal power allocation. We also propose a low complexity suboptimal power allocation scheme which outperforms equal power allocation scheme.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We develop an approximate analytical technique for evaluating the performance of multi-hop networks based on beaconless IEEE 802.15.4 ( the ``ZigBee'' PHY and MAC), a popular standard for wireless sensor networks. The network comprises sensor nodes, which generate measurement packets, relay nodes which only forward packets, and a data sink (base station). We consider a detailed stochastic process at each node, and analyse this process taking into account the interaction with neighbouring nodes via certain time averaged unknown variables (e.g., channel sensing rates, collision probabilities, etc.). By coupling the analyses at various nodes, we obtain fixed point equations that can be solved numerically to obtain the unknown variables, thereby yielding approximations of time average performance measures, such as packet discard probabilities and average queueing delays. The model incorporates packet generation at the sensor nodes and queues at the sensor nodes and relay nodes. We demonstrate the accuracy of our model by an extensive comparison with simulations. As an additional assessment of the accuracy of the model, we utilize it in an algorithm for sensor network design with quality-of-service (QoS) objectives, and show that designs obtained using our model actually satisfy the QoS constraints (as validated by simulating the networks), and the predictions are accurate to well within 10% as compared to the simulation results in a regime where the packet discard probability is low. (C) 2015 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Key points The physiological metabolite, lactate and the two-pore domain leak potassium channel, TREK1 are known neuroprotectants against cerebral ischaemia. However, it is not known whether lactate interacts with TREK1 channel to provide neuroprotection. In this study we show that lactate increases TREK1 channel activity and hyperpolarizes CA1 stratum radiatum astrocytes in hippocampal slices. Lactate increases open probability and decreases longer close time of the human (h)TREK1 channel in a concentration dependent manner. Lactate interacts with histidine 328 (H328) in the carboxy terminal domain of hTREK1 channel to decrease its dwell time in the longer closed state. This interaction was dependent on the charge on H328. Lactate-insensitive mutant H328A hTREK1 showed pH sensitivity similar to wild-type hTREK1, indicating that the effect of lactate on hTREK1 is independent of pH change. AbstractA rise in lactate concentration and the leak potassium channel TREK1 have been independently associated with cerebral ischaemia. Recent literature suggests lactate to be neuroprotective and TREK1 knockout mice show an increased sensitivity to brain and spinal cord ischaemia; however, the connecting link between the two is missing. Therefore we hypothesized that lactate might interact with TREK1 channels. In the present study, we show that lactate at ischaemic concentrations (15-30mm) at pH7.4 increases TREK1 current in CA1 stratum radiatum astrocytes and causes membrane hyperpolarization. We confirm the intracellular action of lactate on TREK1 in hippocampal slices using monocarboxylate transporter blockers and at single channel level in cell-free inside-out membrane patches. The intracellular effect of lactate on TREK1 is specific since other monocarboxylates such as pyruvate and acetate at pH7.4 failed to increase TREK1 current. Deletion and point mutation experiments suggest that lactate decreases the longer close dwell time incrementally with increase in lactate concentration by interacting with the histidine residue at position 328 (H328) in the carboxy terminal domain of the TREK1 channel. The interaction of lactate with H328 is dependent on the charge on the histidine residue since isosteric mutation of H328 to glutamine did not show an increase in TREK1 channel activity with lactate. This is the first demonstration of a direct effect of lactate on ion channel activity. The action of lactate on the TREK1 channel signifies a separate neuroprotective mechanism in ischaemia since it was found to be independent of the effect of acidic pH on channel activity. Key points The physiological metabolite, lactate and the two-pore domain leak potassium channel, TREK1 are known neuroprotectants against cerebral ischaemia. However, it is not known whether lactate interacts with TREK1 channel to provide neuroprotection. In this study we show that lactate increases TREK1 channel activity and hyperpolarizes CA1 stratum radiatum astrocytes in hippocampal slices. Lactate increases open probability and decreases longer close time of the human (h)TREK1 channel in a concentration dependent manner. Lactate interacts with histidine 328 (H328) in the carboxy terminal domain of hTREK1 channel to decrease its dwell time in the longer closed state. This interaction was dependent on the charge on H328. Lactate-insensitive mutant H328A hTREK1 showed pH sensitivity similar to wild-type hTREK1, indicating that the effect of lactate on hTREK1 is independent of pH change.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We formulate the problem of detecting the constituent instruments in a polyphonic music piece as a joint decoding problem. From monophonic data, parametric Gaussian Mixture Hidden Markov Models (GM-HMM) are obtained for each instrument. We propose a method to use the above models in a factorial framework, termed as Factorial GM-HMM (F-GM-HMM). The states are jointly inferred to explain the evolution of each instrument in the mixture observation sequence. The dependencies are decoupled using variational inference technique. We show that the joint time evolution of all instruments' states can be captured using F-GM-HMM. We compare performance of proposed method with that of Student's-t mixture model (tMM) and GM-HMM in an existing latent variable framework. Experiments on two to five polyphony with 8 instrument models trained on the RWC dataset, tested on RWC and TRIOS datasets show that F-GM-HMM gives an advantage over the other considered models in segments containing co-occurring instruments.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Speech enhancement in stationary noise is addressed using the ideal channel selection framework. In order to estimate the binary mask, we propose to classify each time-frequency (T-F) bin of the noisy signal as speech or noise using Discriminative Random Fields (DRF). The DRF function contains two terms - an enhancement function and a smoothing term. On each T-F bin, we propose to use an enhancement function based on likelihood ratio test for speech presence, while Ising model is used as smoothing function for spectro-temporal continuity in the estimated binary mask. The effect of the smoothing function over successive iterations is found to reduce musical noise as opposed to using only enhancement function. The binary mask is inferred from the noisy signal using Iterated Conditional Modes (ICM) algorithm. Sentences from NOIZEUS corpus are evaluated from 0 dB to 15 dB Signal to Noise Ratio (SNR) in 4 kinds of additive noise settings: additive white Gaussian noise, car noise, street noise and pink noise. The reconstructed speech using the proposed technique is evaluated in terms of average segmental SNR, Perceptual Evaluation of Speech Quality (PESQ) and Mean opinion Score (MOS).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1, infinity)-RLL constraint. We derive the capacity for this setting, which can be expressed as C-is an element of = max(0 <= p <= 0.5) (1-is an element of) H-b (p)/1+(1-is an element of) p, where is an element of is the erasure probability and Hb(.) is the binary entropy function. Moreover, we prove that a priori knowledge of the erasure at the encoder does not increase the feedback capacity. The feedback capacity was calculated using an equivalent dynamic programming (DP) formulation with an optimal average-reward that is equal to the capacity. Furthermore, we obtained an optimal encoding procedure from the solution of the DP, leading to a capacity-achieving, zero-error coding scheme for our setting. DP is, thus, shown to be a tool not only for solving optimization problems, such as capacity calculation, but also for constructing optimal coding schemes. The derived capacity expression also serves as the only non-trivial upper bound known on the capacity of the input-constrained erasure channel without feedback, a problem that is still open.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this article, we present a novel approach to throughput enhancement in miniaturized microfluidic microscopy systems. Using the presented approach, we demonstrate an inexpensive yet high-throughput analytical instrument. Using the high-throughput analytical instrument, we have been able to achieve about 125,880 cells per minute (more than one hundred and twenty five thousand cells per minute), even while employing cost-effective low frame rate cameras (120 fps). The throughput achieved here is a notable progression in the field of diagnostics as it enables rapid quantitative testing and analysis. We demonstrate the applicability of the instrument to point-of-care diagnostics, by performing blood cell counting. We report a comparative analysis between the counts (in cells per mu l) obtained from our instrument, with that of a commercially available hematology analyzer.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Hitherto, electron transfer (ET) between redox proteins has been deemed to occur via donor-acceptor binding, and diffusible reactive species are considered as deleterious side-products in such systems. Herein, ET from cytochrome P450 reductase (CPR, an animal membrane flavoprotein) and horseradish peroxidase (HRP, a plant hemoprotein) to cytochrome c (Cyt c, a soluble animal hemoprotein) was probed under diverse conditions, using standard assays. ET in the CPR-Cyt c system was critically inhibited by cyanide and sub-equivalent levels of polar one-electron cyclers like copper ions, vitamin C/Trolox and superoxide dismutase. In the presence of lipids, inhibition was also afforded by amphipathic molecules vitamin E, palmitoyl-vitamin C and the membrane hemoprotein, cytochrome b(5). Such nonspecific inhibition (by diverse agents in both aqueous and lipid phases) indicated that electron transfer/relay was effected by small diffusible agents, whose lifetimes are shortened by the diverse radical scavengers. When CPR was retained in a dialysis membrane and Cyt c presented outside in free solution, ET was still observed. Further, HRP (taken at nM levels) catalyzed oxidation of a phenolic substrate was significantly inhibited upon the incorporation of sub-nM levels of Cyt c. The findings imply that CPR-Cyt c or HRP-Cyt c binding is not crucial for ET. Further, fundamental quantitative arguments (based on diffusion/collision) challenge the erstwhile protein-protein binding-assisted ET hypothesis. It is proven beyond reasonable doubt that mobile and diffusible electron carriers (ions and radicals) serve as ``redox-relay agents'' in the biological ET models/setup studied.