Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Computer Science Faculty Research & Creative Works

Algorithm

Publication Year

Articles 1 - 2 of 2

Full-Text Articles in Physical Sciences and Mathematics

Graph-Regularized Dual Lasso For Robust Eqtl Mapping, Wei Cheng, Xiang Zhang, Zhishan Guo, Yu Shi, Wei Wang Jun 2014

Graph-Regularized Dual Lasso For Robust Eqtl Mapping, Wei Cheng, Xiang Zhang, Zhishan Guo, Yu Shi, Wei Wang

Computer Science Faculty Research & Creative Works

Motivation: As a promising tool for dissecting the genetic basis of complex traits, expression quantitative trait loci (eQTL) mapping has attracted increasing research interest. An important issue in eQTL mapping is how to effectively integrate networks representing interactions among genetic markers and genes. Recently, several Lasso-based methods have been proposed to leverage such network information. Despite their success, existing methods have three common limitations: (i) a preprocessing step is usually needed to cluster the networks; (ii) the incompleteness of the networks and the noise in them are not considered; (iii) other available information, such as location of genetic markers and …


Two Energy Efficient Algorithms For Tracking Objects In A Sensor Network, Arvind Rapaka, Sanjay Kumar Madria Jul 2006

Two Energy Efficient Algorithms For Tracking Objects In A Sensor Network, Arvind Rapaka, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

We propose two energy efficient algorithms for locating a target object moving in an area covered by a wireless ad hoc network. The first algorithm developed conserve energy by efficiently identifying sensor nodes, as Home Nodes, and use only local messages between neighboring nodes to follow the trail of the object. Since we avoid the long-range transmission and maximize the localization, the algorithms reduce the communication cost. The dynamic nature of the second algorithm exploits the predefined parameters such as the object velocity. Our algorithm represents query shipping against the conventional data shipping as a means to reduce the amount …