2016 IEEE Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)最新文献

筛选
英文 中文
Handheld electrochemical workstation for serum albumin measurement 手持式电化学工作站测定血清白蛋白
2016 IEEE Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER) Pub Date : 2016-08-01 DOI: 10.1109/DISCOVER.2016.7806232
Suraj Hebbar, Vinay Kumar, M. S. Bhat, N. Bhat
{"title":"Handheld electrochemical workstation for serum albumin measurement","authors":"Suraj Hebbar, Vinay Kumar, M. S. Bhat, N. Bhat","doi":"10.1109/DISCOVER.2016.7806232","DOIUrl":"https://doi.org/10.1109/DISCOVER.2016.7806232","url":null,"abstract":"This paper presents a novel handheld electrochemical workstation for serum albumin measurement. The system consists of a multi-path potentiostat module which performs electrochemical measurements on disposable test strip. The strip provides a port for applying blood sample. The test strip consists of 3 electrochemical cells for redundancy and parallel testing. The 3 sets of 3 electrodes (Working, Reference and Counter electrodes) are screen printed on a Polyethylene Terephthalate (PET) substrate. The system provides the unique capability of performing Cyclic Voltammetry and Chrono Amperometry measurements in three parallel paths. The system is very generic and flexible, with user defined inputs for voltage, sweep rate and time through 5 inch capacitive touch screen. The experimental results can be stored on micro SD card and the data is accessible with USB or Bluetooth interface. This paper reports an extensive characterization of system through several tests conducted on standard redox solution. The system is then validated for human serum albumin measurement, using clinical samples. This is the first ever point of care handheld diagnostic device in the world for human serum albumin measurement.","PeriodicalId":383554,"journal":{"name":"2016 IEEE Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128741452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A comparative study of horn antennas suitable for the transmitting antenna array module of MELISSA architecture 适用于MELISSA架构发射天线阵列模块的喇叭天线比较研究
2016 IEEE Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER) Pub Date : 2016-08-01 DOI: 10.1109/DISCOVER.2016.7806226
S. Vincent, Sharmila Anand John Francis, O. Kumar, E. Rajsingh
{"title":"A comparative study of horn antennas suitable for the transmitting antenna array module of MELISSA architecture","authors":"S. Vincent, Sharmila Anand John Francis, O. Kumar, E. Rajsingh","doi":"10.1109/DISCOVER.2016.7806226","DOIUrl":"https://doi.org/10.1109/DISCOVER.2016.7806226","url":null,"abstract":"The MELISSA system is a ground based aperture radar that has been designed for landslide monitoring in Italy. It consists of a linear antenna array of 12 Pyramidal horn antennas present in the transmitting module of the system and another linear array of 12 receiving Vivaldi antennas. It has been proven that an alternate planar antenna array geometry of 2 × 6 pyramidal horn antennas gives a better performance than the 12 linear horns; present in the transmitting module of MELISSA; in terms of directivity, half power beam width and peak side lobe ratio. This paper aims at presenting a comparative study of peak gains and half power beam widths of various other types of individual horn antenna elements that could be used to replace the conventional pyramidal horn in the earlier proposed 2 × 6 planar configuration and thereby revise the MELISSA system.","PeriodicalId":383554,"journal":{"name":"2016 IEEE Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126338648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Identification of gene network motifs for cancer disease diagnosis 肿瘤疾病诊断的基因网络基序鉴定
2016 IEEE Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER) Pub Date : 1900-01-01 DOI: 10.1109/DISCOVER.2016.7806253
Rohit Gupta, S. M. Fayaz, Sanjay Singh
{"title":"Identification of gene network motifs for cancer disease diagnosis","authors":"Rohit Gupta, S. M. Fayaz, Sanjay Singh","doi":"10.1109/DISCOVER.2016.7806253","DOIUrl":"https://doi.org/10.1109/DISCOVER.2016.7806253","url":null,"abstract":"All networks, including biological networks, computer networks, social networks and more can be represented as graphs, which include a number of small module such as subgraph, also called as network motifs. Network motifs are subgraph which recur themselves in a specific network or different networks. In biological networks, these network motifs plays very important role to identify diseases in human beings. In this paper we have developed a module to identify common network motifs types from cancer pathways and Signal Transduction Networks (STNs). It also identifies the topological behaviors o f cancer networks and STNs. In this study, we have implemented five motif algorithms such as Auto-Regulation Loop (ARL), Feed Backward Loop (FBL), Feed Forward Loop (FFL), Single-Input Motif (SIM) and Bi-fan. These algorithms gives correct results in terms of network motifs for human cancer and STNs. Finding network motifs by using online tool is limited to three nodes, but our proposed work provides facility to find network motifs upto any number of nodes. We applied five motif algorithms to human cancer networks and Signal Transduction Networks (STNs) which are collected from KEGG database as a result we got “Frequent Occurrences of Network Motifs (FONMs)”. These FONMs acts as a references for an oncologist in order to find type o f cancer in human beings.","PeriodicalId":383554,"journal":{"name":"2016 IEEE Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116786378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Mutual fund performance prediction 共同基金业绩预测
2016 IEEE Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER) Pub Date : 1900-01-01 DOI: 10.1109/DISCOVER.2016.7806257
Hassan Qamar, Sanjay Singh
{"title":"Mutual fund performance prediction","authors":"Hassan Qamar, Sanjay Singh","doi":"10.1109/DISCOVER.2016.7806257","DOIUrl":"https://doi.org/10.1109/DISCOVER.2016.7806257","url":null,"abstract":"It is increasingly seen that non parametric frontier method has become a popular method in predicting the performance of investment fund. This paper uses the non-parametric method to analyze the efficiency and performance of mutual funds. The methodology uses Data Envelopment Analysis (DEA) to predict the performance of fund in coming years. Factor such as mutual fund returns, turnover rate, volatility, expense ratio are used to find the relative efficiency of funds using DEA. The end result not only provides funds with good return but at the same time these funds are consistent in performance and stable in nature. The methodology is applied to a sample of 46 Indian equity funds over the period 2006-2015. The time frame for implementing this analysis is three, five, and ten years evaluation respectively. The results are obtained on the basis of comparison with crisil and value research rating system. Our results provide practical application for investor to choose the best fund among all. It also help fund manager in better management of funds.","PeriodicalId":383554,"journal":{"name":"2016 IEEE Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121449469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Efficient location selection for computations of expensive Log-Gabor features using directional enhancement: For robust localization of lane markings in cluttered scenes 使用方向增强计算昂贵的Log-Gabor特征的有效位置选择:用于混乱场景中车道标记的鲁棒定位
2016 IEEE Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER) Pub Date : 1900-01-01 DOI: 10.1109/discover.2016.7806230
Pamir Ghimire, Siddrameshwar Kadagad
{"title":"Efficient location selection for computations of expensive Log-Gabor features using directional enhancement: For robust localization of lane markings in cluttered scenes","authors":"Pamir Ghimire, Siddrameshwar Kadagad","doi":"10.1109/discover.2016.7806230","DOIUrl":"https://doi.org/10.1109/discover.2016.7806230","url":null,"abstract":"Vision-based estimation tasks, such as lane marking localization, can be more robust to noise and false signals when utilizing pattern recognition and machine learning techniques as opposed to only low level computer vision operations. Computationally expensive features like Gabor filter responses can be very robust to changes to illumination and other noise. However, machine learning techniques can also be prohibitively slow for time critical applications if such computationally expensive features are calculated for all pixel locations in an input scene. We describe a method to pick the most likely locations for which to compute robust features in order to identify locations of lane markings in highly cluttered scenes. Locations for which features are computed are selected using a novel iterative directional enhancement and thresholding on the perspective image. This drastically reduces the number of locations for which expensive features have to be computed, thus improving latency while retaining precision of the machine learning method. Our method is thus a cascaded classifier scheme that uses low level computer vision operations followed by pattern recognition techniques. We evaluate the performance of our system by checking the overlap of estimates of left and right lane boundaries and lane midline with corresponding annotations.","PeriodicalId":383554,"journal":{"name":"2016 IEEE Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132497482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信