414 resultados para Optimal spectral partition
Resumo:
We consider optimal average power allocation policies in a wireless channel in the presence of individual delay constraints on the transmitted packets. Power is consumed in transmission of data only. We consider the case when the power used in transmission is a linear function of the data transmitted. The transmission channel may experience multipath fading. We have developed a computationally efficient online algorithm, when there is same hard delay constraint for all packets. Later on, we generalize it to the case when there are multiple real time streams with different hard deadline constraints. Our algorithm uses linear programming and has very low complexity.
Resumo:
Cooperative relaying combined with selection has been extensively studied in the literature to improve the performance of interference-constrained secondary users in underlay cognitive radio (CR). We present a novel symbol error probability (SEP)-optimal amplify-and-forward relay selection rule for an average interference-constrained underlay CR system. A fundamental principle, which is unique to average interference-constrained underlay CR, that the proposed rule brings out is that the choice of the optimal relay is affected not just by the source-to-relay, relay-to-destination, and relay-to-primary receiver links, which are local to the relay, but also by the direct source-to-destination (SD) link, even though it is not local to any relay. We also propose a simpler, practically amenable variant of the optimal rule called the 1-bit rule, which requires just one bit of feedback about the SD link gain to the relays, and incurs a marginal performance loss relative to the optimal rule. We analyze its SEP and develop an insightful asymptotic SEP analysis. The proposed rules markedly outperform several ad hoc SD link-unaware rules proposed in the literature. They also generalize the interference-unconstrained and SD link-unaware optimal rules considered in the literature.
Resumo:
Generalized spatial modulation (GSM) uses n(t) transmit antenna elements but fewer transmit radio frequency (RF) chains, n(rf). Spatial modulation (SM) and spatial multiplexing are special cases of GSM with n(rf) = 1 and n(rf) = n(t), respectively. In GSM, in addition to conveying information bits through n(rf) conventional modulation symbols (for example, QAM), the indices of the n(rf) active transmit antennas also convey information bits. In this paper, we investigate GSM for large-scale multiuser MIMO communications on the uplink. Our contributions in this paper include: 1) an average bit error probability (ABEP) analysis for maximum-likelihood detection in multiuser GSM-MIMO on the uplink, where we derive an upper bound on the ABEP, and 2) low-complexity algorithms for GSM-MIMO signal detection and channel estimation at the base station receiver based on message passing. The analytical upper bounds on the ABEP are found to be tight at moderate to high signal-to-noise ratios (SNR). The proposed receiver algorithms are found to scale very well in complexity while achieving near-optimal performance in large dimensions. Simulation results show that, for the same spectral efficiency, multiuser GSM-MIMO can outperform multiuser SM-MIMO as well as conventional multiuser MIMO, by about 2 to 9 dB at a bit error rate of 10(-3). Such SNR gains in GSM-MIMO compared to SM-MIMO and conventional MIMO can be attributed to the fact that, because of a larger number of spatial index bits, GSM-MIMO can use a lower-order QAM alphabet which is more power efficient.
Resumo:
Methane, the primary constituent of natural gas, binds too weakly to nanostructured carbons to meet the targets set for on-board vehicular storage to be viable. We show, using density functional theory calculations, that replacing graphene by graphene oxide increases the adsorption energy of methane by 50%. This enhancement is sufficient to achieve the optimal binding strength. In order to gain insight into the sources of this increased binding, that could also be used to formulate design principles for novel storage materials, we consider a sequence of model systems that progressively take us from graphene to graphene oxide. A careful analysis of the various contributions to the weak binding between the methane molecule and the graphene oxide shows that the enhancement has important contributions from London dispersion interactions as well as electrostatic interactions such as Debye interactions, aided by geometric curvature induced primarily by the presence of epoxy groups. (C) 2015 AIP Publishing LLC.
Resumo:
Computing the maximum of sensor readings arises in several environmental, health, and industrial monitoring applications of wireless sensor networks (WSNs). We characterize the several novel design trade-offs that arise when green energy harvesting (EH) WSNs, which promise perpetual lifetimes, are deployed for this purpose. The nodes harvest renewable energy from the environment for communicating their readings to a fusion node, which then periodically estimates the maximum. For a randomized transmission schedule in which a pre-specified number of randomly selected nodes transmit in a sensor data collection round, we analyze the mean absolute error (MAE), which is defined as the mean of the absolute difference between the maximum and that estimated by the fusion node in each round. We optimize the transmit power and the number of scheduled nodes to minimize the MAE, both when the nodes have channel state information (CSI) and when they do not. Our results highlight how the optimal system operation depends on the EH rate, availability and cost of acquiring CSI, quantization, and size of the scheduled subset. Our analysis applies to a general class of sensor reading and EH random processes.
Resumo:
A new, phenoxo-bridged Cu-II dinuclear complex Cu-2(L)(2)(DMF)(2)] (1) has been obtained by employing the coumarin-assisted tridentate precursor, H2L, benzoic acid(7-hydroxy-4-methyl-2-oxo-2H-chromen-8-ylmethylene)-hydrazide]. Complex 1 has been systematically characterized by FTIR, UV-Vis, fluorescence and PR spectrometry. The single crystal X-ray diffraction analysis of 1 shows that the geometry around each copper ion is square pyramidal, comprising two enolato oxygen atoms belonging to different ligands (which assemble the dimer bridging the two metal centers), one imine-N and one phenolic-O atoms of the Schiff base and one oxygen atom from the DMF molecule. The temperature dependent magnetic interpretation agrees with the existence of weak ferromagnetic interactions between the bridging dinuclear Cu(II) ions. Both the ligand and complex 1 exhibit anti-mycobacterial activity and considerable efficacy towards M. tuberculosis H37Rv ATCC 27294 and M. tuberculosis H37Ra ATCC 25177 strains. The cytotoxicity study on human adenocarcinoma cell lines (MCF7) suggests that the ligand and complex 1 have potential anticancer properties. Molecular docking of H2L with the enoyl acyl carrier protein reductase of M. tuberculosis H37R(v) (PDB ID: 4U0K) is examined and the best docked pose of H2L shows one hydrogen bond with Thr196 (1.99 angstrom).
Resumo:
The time division multiple access (TDMA) based channel access mechanisms perform better than the contention based channel access mechanisms, in terms of channel utilization, reliability and power consumption, specially for high data rate applications in wireless sensor networks (WSNs). Most of the existing distributed TDMA scheduling techniques can be classified as either static or dynamic. The primary purpose of static TDMA scheduling algorithms is to improve the channel utilization by generating a schedule of smaller length. But, they usually take longer time to schedule, and hence, are not suitable for WSNs, in which the network topology changes dynamically. On the other hand, dynamic TDMA scheduling algorithms generate a schedule quickly, but they are not efficient in terms of generated schedule length. In this paper, we propose a novel scheme for TDMA scheduling in WSNs, which can generate a compact schedule similar to static scheduling algorithms, while its runtime performance can be matched with those of dynamic scheduling algorithms. Furthermore, the proposed distributed TDMA scheduling algorithm has the capability to trade-off schedule length with the time required to generate the schedule. This would allow the developers of WSNs, to tune the performance, as per the requirement of prevalent WSN applications, and the requirement to perform re-scheduling. Finally, the proposed TDMA scheduling is fault-tolerant to packet loss due to erroneous wireless channel. The algorithm has been simulated using the Castalia simulator to compare its performance with those of others in terms of generated schedule length and the time required to generate the TDMA schedule. Simulation results show that the proposed algorithm generates a compact schedule in a very less time.
Resumo:
Branched Chain Amino Acids (BCAAs) are related to different aspects of diseases like pathogenesis, diagnosis and even prognosis. While in some diseases, levels of all the BCAAs are perturbed; in some cases, perturbation occurs in one or two while the rest remain unaltered. In case of ischemic heart disease, there is an enhanced level of plasma leucine and isoleucine but valine level remains unaltered. In `Hypervalinemia', valine is elevated in serum and urine, but not leucine and isoleucine. Therefore, identification of these metabolites and profiling of individual BCAA in a quantitative manner in body-fluid like blood plasma/serum have long been in demand. H-1 NMR resonances of the BCAAs overlap with each other which complicates quantification of individual BCAAs. Further, the situation is limited by the overlap of broad resonances of lipoprotein with the resonances of BCAAs. The widely used commercially available kits cannot differentially estimate the BCAAs. Here, we have achieved proper identification and characterization of these BCAAs in serum in a quantitative manner employing a Nuclear Magnetic Resonance-based technique namely T-2-edited Correlation Spectroscopy (COSY). This approach can easily be extended to other body fluids like bile, follicular fluids, saliva, etc.
Resumo:
Motivated by multi-distribution divergences, which originate in information theory, we propose a notion of `multipoint' kernels, and study their applications. We study a class of kernels based on Jensen type divergences and show that these can be extended to measure similarity among multiple points. We study tensor flattening methods and develop a multi-point (kernel) spectral clustering (MSC) method. We further emphasize on a special case of the proposed kernels, which is a multi-point extension of the linear (dot-product) kernel and show the existence of cubic time tensor flattening algorithm in this case. Finally, we illustrate the usefulness of our contributions using standard data sets and image segmentation tasks.
Resumo:
We propose a multiple initialization based spectral peak tracking (MISPT) technique for heart rate monitoring from photoplethysmography (PPG) signal. MISPT is applied on the PPG signal after removing the motion artifact using an adaptive noise cancellation filter. MISPT yields several estimates of the heart rate trajectory from the spectrogram of the denoised PPG signal which are finally combined using a novel measure called trajectory strength. Multiple initializations help in correcting erroneous heart rate trajectories unlike the typical SPT which uses only single initialization. Experiments on the PPG data from 12 subjects recorded during intensive physical exercise show that the MISPT based heart rate monitoring indeed yields a better heart rate estimate compared to the SPT with single initialization. On the 12 datasets MISPT results in an average absolute error of 1.11 BPM which is lower than 1.28 BPM obtained by the state-of-the-art online heart rate monitoring algorithm.
Resumo:
We have synthesized a series of 4'-aryl substituted 2,2':6',2 `'-terpyridine (terpy) derivatives, namely 4'-(4-methylphenyl)-2,2':6',2 `'-terpyridine (C-1), 4'-(2-furyl)-2,2':6'2 `'-terpyridine (C-2), and 4'-(3,4,5-trimethoxyphenyl)-2,2':6',2 `'-terpyridine (C-3). The synthesized terpy compounds were characterized by elemental analyses, FTIR, NMR (H-1 and C-13), and ESI-Mass spectrometry. Photophysical, electrochemical and thermal properties of terpy compounds were systematically studied. Maximum excitation band was observed between 240 and 330 nm using UV-visible spectra, and maximum emission peaks from PL spectra were observed at 385, 405 and 440 nm for C-1, C-2 and C-3 respectively. Fluorescence lifetime (tau) of the fluorophores was found to be 035 and 1.55 ns at the excitation wavelength of 406 nm for C-1 and C-2 respectively, and tau value for C-3 was found to be 0.29 ns at the excitation wavelength of 468 nm. We noticed that the calculated values of HOMO energy levels were increased from 5.96 (C-1) to 6.08 (C-3) eV, which confirms that C-3 derivative is more electrons donating in nature. The calculated electrochemical band gaps were 2.95, 2.82 and 3.02 eV for C-1, C-2 and C-3 respectively. These blue fluorescent emitter derivatives can be used as an electron transport and electroluminescent material to design the blue fluorescent organic light emitting diode (OLED) applications. (C) 2015 Elsevier B.V: All rights reserved.
Resumo:
To calculate static response properties of a many-body system, local density approximation (LDA) can be safely applied. But, to obtain dynamical response functions, the applicability of LDA is limited bacause dynamics of the system needs to be considered as well. To examine this in the context of cold atoms, we consider a system of non-interacting spin4 fermions confined by a harmonic trapping potential. We have calculated a very important response function, the spectral intensity distribution function (SIDF), both exactly and using LDA at zero temperature and compared with each other for different dimensions, trap frequencies and momenta. The behaviour of the SIDF at a particular momentum can be explained by noting the behaviour of the density of states (DoS) of the free system (without trap) in that particular dimension. The agreement between exact and LDA SIDFs becomes better with increase in dimensions and number of particles.
Resumo:
In this article, an abstract framework for the error analysis of discontinuous Galerkin methods for control constrained optimal control problems is developed. The analysis establishes the best approximation result from a priori analysis point of view and delivers a reliable and efficient a posteriori error estimator. The results are applicable to a variety of problems just under the minimal regularity possessed by the well-posedness of the problem. Subsequently, the applications of C-0 interior penalty methods for a boundary control problem as well as a distributed control problem governed by the biharmonic equation subject to simply supported boundary conditions are discussed through the abstract analysis. Numerical experiments illustrate the theoretical findings.
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.