{"title":"Joint machine learning and human learning design with sequential active learning and outlier detection for linear regression problems","authors":"Xiaohua Li, Jian Zheng","doi":"10.1109/CISS.2016.7460537","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460537","url":null,"abstract":"In this paper, we propose a joint machine learning and human learning design approach to make the training data labeling task in linear regression problems more efficient and robust to noise, modeling mismatch, and human labeling errors. Considering a sequential active learning scheme which relies on human learning to enlarge training data set, we integrate it with sparse outlier detection algorithms to mitigate the inevitable human errors during training data labeling. First, we assume sparse human errors and formulate the outlier detection as a sparse optimization problem within the sequential active learning procedure. Then, for non-sparse human errors, with the IRT (item response theory) to model the distribution of human errors, appropriate data are selected to reconstruct a training data set with sparse human errors. Simulations are conducted to verify the desirable performance of the proposed approach.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127421228","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}
{"title":"Defining perfect location privacy using anonymization","authors":"Zarrin Montazeri, A. Houmansadr, H. Pishro-Nik","doi":"10.1109/CISS.2016.7460502","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460502","url":null,"abstract":"The popularity of mobile devices and location-based services (LBS) has created great concerns regarding the location privacy of users of such devices and services. Anonymization is a common technique that is often being used to protect the location privacy of LBS users. In this paper, we provide a general information theoretic definition for location privacy. In particular, we define perfect location privacy. We show that under certain conditions, perfect privacy is achieved if the pseudonyms of users are changed before O(N(2/r-1)) observations by the adversary, where N is the number of users and r is the number of sub-regions or locations.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"73 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132948651","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}
{"title":"Dynamic estimation of causal influences in sparsely-interacting neuronal ensembles","authors":"Alireza Sheikhattar, B. Babadi","doi":"10.1109/CISS.2016.7460562","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460562","url":null,"abstract":"In this paper, we consider a neuronal ensemble under spontaneous activity where each neuron modulates the activity of the others through its spiking history. Assuming that the cross-history dependence parameters of the ensemble are sparse and time-varying, we perform adaptive system identification using sparse point process filters. We then provide a novel filtering and smoothing algorithm for estimating the Granger causality with high temporal resolution and with recursively computed statistical confidence intervals. We provide simulation studies which reveal significant performance gains obtained by our proposed technique in describing the causal influences in neuronal ensemble activity.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133354722","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}
Lin Gao, M. Tang, Haitian Pang, Jianwei Huang, Lifeng Sun
{"title":"Performance bound analysis for crowdsourced mobile video streaming","authors":"Lin Gao, M. Tang, Haitian Pang, Jianwei Huang, Lifeng Sun","doi":"10.1109/CISS.2016.7460530","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460530","url":null,"abstract":"Adaptive bitrate (ABR) streaming enables video users to adapt the playing bitrate to the real-time network conditions to achieve the desirable quality of experience (QoE). In this work, we propose a novel crowdsourced streaming framework for multi-user ABR video streaming over wireless networks. This framework enables the nearby mobile video users to crowdsource their radio links and resources for cooperative video streaming. We focus on analyzing the social welfare performance bound of the proposed crowdsourced streaming system. Directly solving this bound is challenging due to the asynchronous operations of users. To this end, we introduce a virtual time-slotted system with the synchronized operations, and formulate the associated social welfare optimization problem as a linear programming. We show that the optimal social welfare performance of the virtual system provides effective upper-bound and lower-bound for the optimal performance (bound) of the original asynchronous system, hence characterizes the feasible performance region of the proposed crowdsourced streaming system. The performance bounds derived in this work can serve as a benchmark for the future online algorithm design and incentive mechanism design.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131494090","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}
{"title":"Integration of multiple adaptive algorithms for parallel decision fusion","authors":"Weiqiang Dong, Moshe Kam","doi":"10.1109/CISS.2016.7460528","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460528","url":null,"abstract":"The Chair-Varshney rule for parallel binary decision fusion requires knowledge of the a priori probabilities of the hypotheses and the performance of the sensors (probabilities of false alarm and missed detection). In most applications, this information is not available. Five methods were developed so far for estimating the unknown probabilities. However, none of them is the best under all circumstances. We present an algorithm that selects the best of these five methods. The algorithm estimates roughly the value of the a priori probabilities and the sensor performance from input data, and seeks support from a data base that provides archival data from the five methods at this operating point. In simulation, the algorithm performed on average better than each one of the five existing methods operating alone.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131053088","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}
{"title":"A Dynamic Time Warping algorithm for industrial robot motion analysis","authors":"B. Johnen, B. Kuhlenkötter","doi":"10.1109/CISS.2016.7460470","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460470","url":null,"abstract":"Industrial robots have a wide field of application and their applicability is constantly examined in further new application areas. Therefore the performance characteristics of industrial robots are of great interest. Such performance criteria are defined by national and international industrial standards, which also describe methods to evaluate them. However applying these criteria and methods directly to any robotic application may result in a false identification of robotic accuracy and consequently to a possible misinterpretation of the robots' capabilities. This paper describes the problems of using industrial standards for robot motion path analysis. Relating to the underlying motion data, similarities to signal processing methods in speech recognition are discussed and the usage of Dynamic Time Warping (DTW) as a general method for industrial robot motion analysis is proposed. We present a new variant of the DTW algorithm which allows the mapping of interpolated trajectory points without significantly increasing the computation complexity.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"467 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132851269","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}
{"title":"Improving the recovery of principal components with semi-deterministic random projections","authors":"Keegan Kang, G. Hooker","doi":"10.1109/CISS.2016.7460570","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460570","url":null,"abstract":"Random projection is a technique which was first used for data compression, by using a matrix with random variables to map a high dimensional vector to a lower dimensional one. The lower dimensional vector preserves certain properties of the higher dimensional vector, up to a certain degree of accuracy. However, random projections can also be used for matrix decompositions and factorizations, described in [1]. We propose a new structure of random projections, and apply this to the method of recovering principal components, building upon the work of Anaraki and Hughes [2]. Our extension results in a better accuracy in recovering principal components, as well as a substantial saving in storage space. Experiments have been conducted on both artificial data and on the MNIST dataset to demonstrate our results.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133907149","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}
H. B. Kassa, T. Chernet, Estifanos Yohannes, Dereje Hailemariam, Yacob Astatke, F. Moazzami, Wondimu K. Zegeye
{"title":"Investigation of RLS beamforming algorithm interms of energy efficiency","authors":"H. B. Kassa, T. Chernet, Estifanos Yohannes, Dereje Hailemariam, Yacob Astatke, F. Moazzami, Wondimu K. Zegeye","doi":"10.1109/CISS.2016.7460481","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460481","url":null,"abstract":"This work investigates the energy efficiency of Recursive Least Square (RLS) beamforming algorithm by developing a new energy model, which is a function of beam width, range, instantaneous signal to noise plus interference ratio (SNIR) and inter element spacing. It analyzes the effect of varying inter element spacing on linear array geometry for energy efficient beam formation. We evaluated the amount of energy saved and showed the advantage of selecting a better inter-element spacing for smart antenna installation. We also showed the advantage of checking the SNIR status of the user signal before releasing the beam energy from the base station antenna system. The result show that, installing antenna elements with 0.5λ separation has better energy efficiency than smaller separation distance (0.1λ) or wider separation distance (1λ). Furthermore, it indicates that knowledge of the status of the user signal SNIR, facilitates for the base station to adaptively control the release of energy and to reduce the linear increment of energy per range.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"80 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130657657","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}
{"title":"Optimal energy allocation and storage control for distributed estimation with sensor collaboration","authors":"Sijia Liu, Yanzhi Wang, M. Fardad, P. Varshney","doi":"10.1109/CISS.2016.7460474","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460474","url":null,"abstract":"In wireless sensor networks with energy harvesting nodes, we study the problem of energy allocation and storage control for distributed estimation with sensor collaboration, where collaboration refers to the act of sharing measurements with neighboring sensors prior to transmission to a fusion center. To jointly design energy allocation and storage control polices, we formulate a nonconvex optimization problem in which the estimation distortion is minimized subject to energy harvesting and storage constraints. We show that the resulting optimization problem contains two special types of nonconvexities: cardinality function and difference of convex functions. By exploiting the problem structure, locally optimal solutions are found via an ℓ1 relaxation and a convex-concave procedure. Numerical experiments are provided to show the effectiveness of our approach.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133090572","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}
J. Khamse-Ashari, G. Kesidis, I. Lambadaris, B. Urgaonkar, Yiqiang Q. Zhao
{"title":"Max-min Fair scheduling of variable-length packet-flows to multiple servers by deficit round-robin","authors":"J. Khamse-Ashari, G. Kesidis, I. Lambadaris, B. Urgaonkar, Yiqiang Q. Zhao","doi":"10.1109/CISS.2016.7460534","DOIUrl":"https://doi.org/10.1109/CISS.2016.7460534","url":null,"abstract":"We describe a scheduler based on deficit-round robin (DRR) for multiple servers of multiple packet-flows, where each packet-flow may be served by only a subset of available (preferred) servers. The scheduler uses a token allocation algorithm that is weighted max-min fair, and so we've called it Multi-Server Max-min Fair DRR (MSMF-DRR). The scheduler also compensates for potential errors in estimates of server capacities when determining token allocations, and considers service underflow resulting in unused tokens at the end of a round. Numerical examples are given to illustrate how the scheduler itself is weighted max-min fair.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115682661","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}