117 research outputs found
Azadirachta indica (neem) leaves mediated synthesis of SnO2/NiO nanocomposite and assessment of its photocatalytic activity
No full textOn the pressure and temperature dependent ductile, brittle nature of Hg0.91Mn0.09Te semiconductor
No full textOn the optimality of likelihood ratio test for prospect theory-based binary hypothesis testing
No full textIn this letter, the optimality of the likelihood ratio test (LRT) is investigated for binary hypothesis testing problems in the presence of a behavioral decision-maker. By utilizing prospect theory, a behavioral decision-maker is modeled to cognitively distort probabilities and costs based on some weight and value functions, respectively. It is proved that the LRT may or may not be an optimal decision rule for prospect theory-based binary hypothesis testing, and conditions are derived to specify different scenarios. In addition, it is shown that when the LRT is an optimal decision rule, it corresponds to a randomized decision rule in some cases; i.e., nonrandomized LRTs may not be optimal. This is unlike Bayesian binary hypothesis testing, in which the optimal decision rule can always be expressed in the form of a nonrandomized LRT. Finally, it is proved that the optimal decision rule for prospect theory-based binary hypothesis testing can always be represented by a decision rule that randomizes at most two LRTs. Two examples are presented to corroborate the theoretical results.Manuscript received August 13, 2018; revised October 5, 2018; accepted October 16, 2018. Date of publication October 22, 2018; date of current version November 5, 2018. The work of P. K. Varshney was supported by Air Force Office of Scientific Research under Grant FA9550-17-1-0313 under the DDDAS program. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Ashish Pandharipande. (Corresponding author: Sinan Gezici.) S. Gezici is with the Department of Electrical and Electronics Engineering, Bilkent University, Ankara 06800, Turkey (e-mail:,[email protected])
Effect of chromium doping on the structural and vibrational properties of Mn-Zn ferrites
No full textState Estimation of Linear Systems With Sparse Inputs and Markov-Modulated Missing Outputs
No full textIn this paper, we consider the problem of estimating the states of a linear dynamical system whose inputs are jointly sparse and outputs at a few unknown time instants are missing. We model the missing data mechanism using a Markov chain with two states representing the missing and non-missing data. This mechanism with memory governed by the Markov chain models intermittent outages due to communication channels and occlusions corresponding to moving objects. We rely on the sparse Bayesian learning framework to derive an estimation algorithm that uses Kalman smoothing to handle temporal correlation and the Viterbi algorithm to handle missing data. Further, we demonstrate the utility of our algorithm by applying it to the frequency division duplexed multiple input multiple output downlink channel estimation problem.Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Signal Processing System
Problems in Task Scheduling in Multiprocessor System
No full textThis Contemporary computer systems are multiprocessor or multicomputer machines. Their efficiency depends on good methods of administering the executed works. Fast processing of a parallel application is possible only when its parts are appropriately ordered in time and space. This calls for efficient scheduling policies in parallel computer systems. In this work deterministic problems of scheduling are considered. The classical scheduling theory assumed that the application in any moment of time is executed by only one processor. This assumption has been weakened recently, especially in the context of parallel and distributed computer systems. This monograph is devoted to problems of deterministic scheduling applications or tasks according to the scheduling terminology requiring more than one processor simultaneously. We name such applications multiprocessor tasks. In this work the complexity of open multiprocessor task scheduling problems has been established. Algorithms for scheduling multiprocessor tasks on parallel and dedicated processors are proposed. For a special case of applications with regular structure which allow for dividing it into parts of arbitrary size processed independently in parallel, a method of finding optimal scattering of work in a distributed computer system is proposed. The applications with such regular characteristics are called divisible tasks. The concept of a divisible task enables creation of tractable computation models in a wide class of computer architectures such as chains, stars, meshes, hypercubes, multistage networks. Divisible task method gives rise to the evaluation of computer system performance. Examples of such performance evaluation are presented. This work summarizes earlier works of the author as well as contains new original results. Mukul Varshney | Jyotsna | Abhakiran Rajpoot | Shivani Garg "Problems in Task Scheduling in Multiprocessor System" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-4 , June 2017, URL: https://www.ijtsrd.com/papers/ijtsrd2198.pd
Exciting journey of 10 years from genomes to fields and markets: Some success stories of genomics-assisted breeding in chickpea, pigeonpea and groundnut
No full textAbstractLegume crops such as chickpea, pigeonpea and groundnut, mostly grown in marginal environments, are the major source of nutrition and protein to the human population in Asia and Sub-Saharan Africa. These crops, however, have a low productivity, mainly due to their exposure to several biotic and abiotic stresses in the marginal environments. Until 2005, these crops had limited genomics resources and molecular breeding was very challenging. During the last decade (2005–2015), ICRISAT led demand-driven innovations in genome science and translated the massive genome information in breeding. For instance, large-scale genomic resources including draft genome assemblies, comprehensive genetic and physical maps, thousands of SSR markers, millions of SNPs, several high-throughput as well as low cost marker genotyping platforms have been developed in these crops. After mapping several breeding related traits, several success stories of translational genomics have become available in these legumes. These include development of superior lines with enhanced drought tolerance in chickpea, enhanced and pyramided resistance to Fusarium wilt and Ascochyta blight in chickpea, enhanced resistance to leaf rust in groundnut, improved oil quality in groundnut and utilization of markers for assessing purity of hybrids/parental lines in pigeonpea. Some of these stories together with future prospects have been discussed
Scalable and Decentralized Algorithms for Anomaly Detection via Learning-Based Controlled Sensing
No full textWe address the problem of sequentially selecting and observing processes from a given set to find the anomalies among them. The decision-maker observes a subset of the processes at any given time instant and obtains a noisy binary indicator of whether or not the corresponding process is anomalous. We develop an anomaly detection algorithm that chooses the processes to be observed at a given time instant, decides when to stop taking observations, and declares the decision on anomalous processes. The objective of the detection algorithm is to identify the anomalies with an accuracy exceeding the desired value while minimizing the delay in decision making. We devise a centralized algorithm where the processes are jointly selected by a common agent as well as a decentralized algorithm where the decision of whether to select a process is made independently for each process. Our algorithms rely on a Markov decision process defined using the marginal probability of each process being normal or anomalous, conditioned on the observations. We implement the detection algorithms using the deep actor-critic reinforcement learning framework. Unlike prior work on this topic that has exponential complexity in the number of processes, our algorithms have computational and memory requirements that are both polynomial in the number of processes. We demonstrate the efficacy of these algorithms using numerical experiments by comparing them with state-of-the-art methods.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Signal Processing System
- …
