A New Pool Control Method for Boolean Compressed Sensing Based Adaptive Group Testing
|
|
- Matilda Hilda Hancock
- 5 years ago
- Views:
Transcription
1 Proceedings of APSIPA Annual Summit and Conference December 27, Malaysia A New Pool Control Method for Boolean Compressed Sensing Based Adaptive roup Testing Yujia Lu and Kazunori Hayashi raduate School of Informatics, Kyoto University, Kyoto, Japan luyujia@sys.i.kyoto-u.ac.jp raduate School of Engineering, Osaka City University, Osaka, Japan kazunori@eng.osaka-cu.ac.jp Abstract In the adaptive group testing, the pool a set of items to be tested used in the next test is determined based on past test results, and its performance heavily depends on the control method of the pool. This paper proposes a new pool control method for Boolean compressed sensing based adaptive group testing. The proposed method firstly selects a pool size of the next test by minimizing the expectation of the approximated required after the next test based on the estimated number of remaining positive items. Then, when the selected pool size is one, an item having the highest probability of being positive will be selected as a pool, otherwise a pool with the selected size will be constructed by randomly selecting items. In addition, a new cardinality estimation method of positive items, that can be implemented in parallel with the proposed pool control method, is also proposed. Computer simulation results reveal that the adaptive group testing with the proposed method has better performance than that with the conventional methods for both with and without the information of cardinality of positive items. I. INTRODUCTION In many fault detection problems, it needs to identify a few faulty or positive items in a large set of items. roup testing is known as an efficient method to solve such problems. In each test of group testing, some items are selected to construct a subset of items called pool and a test to tell whether the pool contains at least one positive item or not is performed. After some tests, positive items can be identified based on the test results using some algorithms. It is known that, group testing with an appropriate algorithm can identify all positive items in much smaller than testing all items one by one. A combinatorial group testing technique was first proposed by Dorfman in 94s []. Since then, group testing has been applied to a variety of research areas, including radio frequency identification RFID system [2], network tomography [3] and others. In general, group testing can be classified into two types, namely, non-adaptive and adaptive. Non-adaptive group testing is a simple method that decides pools of all tests at the beginning, whereas adaptive group testing controls the pool of each test based on previous test results. Therefore, non-adaptive group requires less testing time if all tests can be performed in parallel, while adaptive group testing requires smaller, which would be beneficial if the test has to be performed sequentially. In recent years, group testing has attracted much interest from the active research area of compressed sensing. Especially, Boolean compressed sensing has been applied to the group testing, which solves non-adaptive group testing via linear programming relaxation [4]. Kawaguchi et al. have applied it to adaptive group testing, where the pool size is controlled with a criterion of maximizing the information obtained in the next test and the pool is constructed by uniform random selection [5]. We have proposed Boolean compressed sensing based adaptive group testing with the solution space reduction, where the size of unknown vector is reduced according to identified items, and the pool size is determined by maximizing the expectation of the number of identifiable items [6], [7]. In the Boolean compressed sensing based adaptive group testing methods, the pool of each test is commonly determined in two steps. Namely, in the first step, the pool size is selected based on some objective function pool size control, and then, a pool with the selected size is generated by randomly selecting items in the second step pool selection control. However, a better pool control method might exist, especially because the information of positive tests has not been taken advantage of in the existing methods. In this paper, we propose a novel pool control method for Boolean compressed sensing based adaptive group testing. The proposed method selects a pool size of the next test by minimizing the expectation of the approximated required after the next test, and utilizes the information of previous positive tests to select an item having the highest probability of being positive when the pool size is one. Besides, a revised cardinality estimation method of positive items, that can be implemented in parallel with the proposed pool control method, is proposed in the paper. Computer simulation results show that adaptive group testing with the proposed method requires less to achieve a reliable reconstruction than that with the conventional methods for both with and without the information of cardinality of positive items. II. PROBLEM STATEMENT The model of adaptive group testing is shown in Fig.. Suppose N to be the number of all items with only K of which are positive. Note that we assume N is known, while K unknown. Then, we define a Boolean vector of items x = @27 APSIPA APSIPA ASC 27
2 Proceedings of APSIPA Annual Summit and Conference December 27, Malaysia repeat test pool positive negative test Fig.. The model of adaptive group testing [x x 2... x N ] T {, } N, where x j = or indicates that the j-th item is positive or negative, respectively. In each test, some items are selected from the set of all items and are mixed to construct a pool. The pool for the s-th test is defined by a Boolean row vector a s = [a s, a s,2... a s,n ] {, } N, where a s,j = or indicates that the j-th item belongs to the pool for the s-th test or not, respectively, and an S N Boolean matrix A S = [a T a T 2... a T S ]T defines the set of pools for S tests. The result of the s-th test is a single Boolean value y s {, }, where y s = indicates that at least one positive item is included in the pool for the s-th test, while y s = indicates that no positive item is in it. y s can be obtained by calculating the Boolean sum Boolean OR of {x j a s,j = }, which is the set of x j belonging to the pool for the s-th test. Accordingly, the observation model can be represented as y s = N a s,j x j, j= where denotes the Boolean sum and denotes the Boolean AND operation. For convenience, we define y S = [y y 2... y S ] T as the vector of test results obtained by S tests given by y S = A S x, 2 where A S x indicates taking Boolean product on corresponding elements of each row of A S and x, then taking Boolean sum of them. The goal of group testing is to reconstruct the unknown sparse Boolean vector x from the information of the pool matrix A S and the test results vector y S. For the case of adaptive group testing, the pool for the next test is determined based on previous test results. Specifically, the row vector a i+, which defines the pool for the i + - th test, is determined by using the observed results y s s =, 2,..., i and pool vectors a s s =, 2,..., i. In the rest of the paper, ˆx i indicates the estimate of x reconstructed from A i and y i. III. ADAPTIVE ROUP TESTINS VIA BOOLEAN COMPRESSED SENSIN We have proposed a method for adaptive group testing via Boolean compressed sensing with solution space reduction in [7], which is introduced in this section. A. Boolean Compressed Sensing Malioutov and Malyutov have proposed Boolean compressed sensing in [4], where group testing is modified into a linear programming problem through relaxing the elements of the vectors and the matrices into real numbers. The problem of Boolean compressed sensing for adaptive group testing after the i-th test is formulated as ˆx = arg min x R N j subject to : x, A P i x, A N i x =, 3 where and are vectors whose elements are all zero and one, respectively. Symbols and respectively mean every element in a vector in the left hand side is not less than and not greater than the corresponding element in the right hand side. Also, A P i and A N i are the matrices constructed by the rows of A i corresponding to positive and negative tests, respectively. B. Solution Space Reduction If test results are not deteriorated by noise, we can identify all items in negative pools as negative and each item in positive pools of size one as positive. Using these properties, some elements of the unknown vector can be confirmed as positive or negative during the tests, and the size of unknown vector composed by candidate items, namely, items to be further tested, can be reduced. Specifically, at the beginning, the set of solution space T = {, 2,..., N} including indexes of all items, negative-confirmed index set U = and positiveconfirmed index set V = are defined. After the i-th test, we update the sets in light of the test result y i and pool a i as follows: if y i = then x j T i+ = T i \ {j a i,j = }, U i+ = U i {j a i,j = }, V i+ = V i, else if y i = and the pool size is one then otherwise T i+ = T i \ {j a i,j = }, U i+ = U i, V i+ = V i {j a i,j = }, T i+ = T i, U i+ = U i, V i+ = V i @27 APSIPA APSIPA ASC 27
3 Proceedings of APSIPA Annual Summit and Conference December 27, Malaysia The improvement of the reconstruction performance by Boolean compressed sensing could be expected with this manipulation, because the of the required number of tests to achieve reliable reconstruction is monotonically increasing for items number N and positive items number K in non-adaptive group testing according to [8], [9], []. C. Pool Control In [7], making much account of effective solution space reduction, the expected number of identifiable items with the solution space reduction in the next test is employed as the criterion for pool size control. Thus, after the i-th test, we set the pool size of the i + -th test i+ to maximize the expectation of the number of items that can be identified in the i + -th test as where J i+ = i+ = arg max J i+, 4 N i+ K i N i+ > =, and N i+ = T i+ is the number of items in the solution space for the i + -th test. Ki is the estimated number of remaining positive items in solution space after the i-th test, which can be given by 5 K i = ˆK i V i+, 6 where ˆK i is the number of all positive items K estimated after the i-th test and V i+ is the size of positive-confirmed set for the i + -th test. Once the pool size is determined, the pool in the i + -th test will be constructed by randomly selecting items with size i+ as the pool selection control. D. Cardinality Estimation Comparing the actual number of negative tests and the statistical expectation of the number of negative tests, a cardinality estimation scheme of K has been proposed in [7] as follows. Since the approximated probability q i that the i-th test is negative is given by Ni K i q i = i Ni, 7 i the expected number of negative tests after the i-th test Q i is given by Ns i K s s Q i =. 8 Ns s= s Based on these discussions, and defining ˆQ i as the actual number of negative tests, the estimated number of all positive items after the i-th test can be given by Ns i ˆK V s+ ˆK i = arg min s ˆQ i ˆK Ns. 9 s= s E. Algorithm Scheme The iterative algorithm of the conventional method is summarized in Algorithm. Algorithm Method in [7] : initialize ˆK 2: calculate by 4 3: randomly construct a pool with size 4: perform test and recover ˆx by 3 5: if T = then stop the algorithm else continue 6: solution space reduction 7: calculate ˆK by 9 8: return to 2 IV. PROPOSED METHOD In this paper, we propose novel methods of both pool size control and pool selection control to improve the performance. Moreover, a new cardinality estimation method of positive items is also proposed, which can be implemented in parallel with the proposed pool control method. A. Pool Control Pool size control: Our approach is to select a pool size of the next test which minimizes the expectation of the required after the next test. To the best of our knowledge, however, the analytical expression of the required in general adaptive group testing has not been figured out yet. Consequently, in this paper, we use the upper bound K + 2 log N K derived in [] for adaptive group testing with the binary protocol as the approximation of the required. Due to the properties of solution space reduction, we should consider situations that the pool size is more than one and equal to one separately as follows: a pool size > All items in the pool could be identified as negative when the test result is negative, while none of them could be identified when the test result is positive. Therefore, the approximated required after the negative i- th test is given by D n,i = K i + 2 log N i+, K i @27 APSIPA APSIPA ASC 27
4 Proceedings of APSIPA Annual Summit and Conference December 27, Malaysia and after the positive i-th test is given by D p,i = K i + 2 log N i+. K i The probability that the i-th test becomes negative is given by Ni+ K i m n,i = Ni+, 2 and the probability of the positive test is obtained as m p,i = m n,i. 3 b pool size = The selected item of that pool could be confirmed after the test regardless of the test result if =. Therefore, the approximated required after the negative i-th test is given by D n,i = K i + 2 log N i+, K i and after the positive i-th test is given by D p,i = Ki + 2 log N i+. K i 4 5 The probability that the i-th test becomes negative is given by m n,i = N i+ K i N i+, 6 and the probability of the positive test is obtained as m p,i = m n,i. 7 In conclusion, the expectation of approximated required after the i-th test can be summarized as m n,i D n,i + m p,i D p,i > F i+ = 8 m n,i D n,i + m p,i D p,i =, and thus, we control the pool size by i+ = arg min F i Pool selection control: We propose a pool selection control method utilizing the information of previous positive tests, where the idea is that items included in smaller pools with positive test many times have higher probabilities of being positive. To be more specific, we first recall the matrix A P i of size R i N after the i-th test, defined in the previous section, where R i depends on the number of positive tests. Here, we define the j-th column vector of A P i as ã i,j = [a,j a 2,j... a Ri,j] T {, } Ri, and a r,j indicates whether the j-th item is included in the pool of the r-th positive test or not. Moreover, we notice that the item included in smaller pools have a higher probability of being positive. So we use the reciprocal of pool size as the weight of each positive test as w = [ 2... Ri ]. Thus, we approximate the probability p i,j that the j-th item is positive after the i-th test as p i,j wã i,j. 2 For the case with i+ =, we choose an item j max in T i which maximizes the probability as j max = arg max wã i,j. 2 j T i On the other hand, for i+ >, uniform random selection of items in the pool is employed thinking much of the exploration of various items. B. Cardinality Estimation As stated above, since we artificially select an item to construct the pool of size one, the probability p i,j that the remaining item is positive does not obey uniform distribution any longer, whereas the expectation of the number of remaining positive items is not changed as p i,j = K i. 22 j T i Taking advantage of this fact, the probability that the pool of size one is positive can be obtained as p i,jmax = K i wã i,jmax j T i wã i,j. 23 As a result, the formula of probability q i that the i-th test is negative 7 can be rewritten as N i ˆK i V i+ q i = i N i i i > ˆK i V i+ wã i,jmax i =, j T i wã i,j and the cardinality estimation is revised as Ns ˆK i = arg min ˆQ i ˆK V s+ s ˆK Ns {s s>} s ˆK V s+ wã s,jmax {s j T s=} s wã s,j. 25 C. Algorithm The iterative algorithm of the proposed method is summarized in Algorithm @27 APSIPA APSIPA ASC 27
5 Proceedings of APSIPA Annual Summit and Conference December 27, Malaysia Algorithm 2 Method : initialize ˆK 2: calculate by 9 3: if = then artificially construct the pool by 2 else randomly construct with size 4: perform test and recover ˆx by 3 5: if T = then stop the algorithm else continue 6: solution space reduction 7: calculate ˆK by 25 8: return to Fig. 2. Exact recovery rate versus the N = 2, K = Fig. 3. Exact recovery rate versus the N = 2, K =.2 V. SIMULATION EXPERIMENTS In this section, we evaluate performance of the proposed adaptive group testing method through simulation experiments. The performance is evaluated in terms of the exact recovery rate of the vector x versus the and the exact recovery rate has been obtain by averaging the results in trials. The performance of the proposed method is compared with that of the conventional method in [7], assuming known and unknown K. In the rest of figures, oracle means known K and the orange line labeled as represents the approximation of the required at the beginning, which is calculated by K+2 log N K. Figs. 2, 3 and 4 respectively show the s of the methods for N = 2, K = 5, N = 2, K = and N = 2, K = 5. The difference of performance between the proposed method and the conventional method are not so large in the case of small K. However, we can see that the performance of the proposed method is better than that of the conventional method for both known and unknown K with increasing K. Figs. 5, 6 and 7 with N = 5, K =, N = 5, K = 2 and N = 5, K = 3 confirm that the proposed method even outperforms the conventional method with the perfect information of the number of positive items, when the number of positive items is large Fig. 4. Exact recovery rate versus the N = 2, K = 5 VI. CONCLUSIONS We have proposed a novel pool control method for Boolean compressed sensing based adaptive group testing, which selects a pool size of the next test by minimizing the expectation of the approximated required after the next test and controls the selection of pools by taking advantage of the information of positive tests when selected pool size is one. Moreover, a revised cardinality estimation method of positive items is also proposed in accordance with new pool control method. Computer simulation results show that the proposed method requires less than the conventional methods for both with and without the information of cardinality of positive items. ACKNOWLEDMENT This work was supported in part by JSPS KAKENHI rant Numbers 5K664 and 5H @27 APSIPA APSIPA ASC 27
6 Proceedings of APSIPA Annual Summit and Conference December 27, Malaysia Fig. 5. Exact recovery rate versus the N = 5, K = Fig. 7. Exact recovery rate versus the N = 5, K = Boolean Compressed Sensing Based Adaptive roup Testing, IEICE Technical Report, vol. 6, no. 45, pp. 5-56, July 26. [8]. K. Atia and V. Saligrama, Boolean compressed sensing and noisy group testing, Information Theory, IEEE Transactions, vol. 58, no. 3, pp. 88-9, February. 22. [9] C. L. Chan, P. H. Che, S. Jaggi, and V. Saligrama, Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms, Communication, Control, and Computing, 2 49th Annual Allerton Conference, pp , Sept. 2. [] D. Sejdinovic and O. T. Johnson, Note on noisy group testing: Asymptotic bounds and belief propagation reconstruction, Proceedings of the 48th Annual Allerton Confer- ence on Communication, Control and Computing, Monticello Illinois, pp 998-3, 2. [] Keith Ball, Strange Curves, Counting Rabbits, and Other Mathematical Explorations. Princeton, New Jersey: Princeton University Press, 26. Fig. 6. Exact recovery rate versus the N = 5, K = 2 REFERENCES [] R. Dorfman, The detection of defective members of large populations, Annals of Mathematical Statistics, vol. 4, no. 6, pp , Dec [2] B. Sheng, CC Tan, Q Li, and W Mao, Finding popular categories for RFID tags, Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, ACM, pp , May 28. [3] M. Mukamoto, T. Matsuda, S. Hara, K. Takizawa, F. Ono, and R. Miura, Adaptive boolean network tomography for link failure detection, Integrated Network Management IM, 25 IFIP/IEEE International Symposium on. IEEE, pp , May 25. [4] Malioutov, Dmitry, and Mikhail Malyutov, Boolean compressed sensing: LP relaxation for group testing, 22 IEEE International Conference on Acoustics, Speech and Signal Processing, pp , March 22. [5] Y. Kawaguchi, T. Osa, S. Barnwal, H. Nagano, and M. Togami, Information-based pool size control of Boolean compressive sensing for adaptive group testing, 24 22nd European Signal Processing Conference, pp , Sept. 24. [6] R. Kawasaki, K. Hayashi, and M. Kaneko, Pool size control for adaptive group testing via Boolean compressed sensing with solution space reduction, Proceedings of APSIPA Annual Summit and Conference 25, pp. 6-9, Dec. 25. [7] Y. Lu and K. Hayashi, Cardinality Estimation of Positive Items for @27 APSIPA APSIPA ASC 27
SPARSE COMPONENT ANALYSIS FOR BLIND SOURCE SEPARATION WITH LESS SENSORS THAN SOURCES. Yuanqing Li, Andrzej Cichocki and Shun-ichi Amari
SPARSE COMPONENT ANALYSIS FOR BLIND SOURCE SEPARATION WITH LESS SENSORS THAN SOURCES Yuanqing Li, Andrzej Cichocki and Shun-ichi Amari Laboratory for Advanced Brain Signal Processing Laboratory for Mathematical
More informationCLASSIFICATION WITH RADIAL BASIS AND PROBABILISTIC NEURAL NETWORKS
CLASSIFICATION WITH RADIAL BASIS AND PROBABILISTIC NEURAL NETWORKS CHAPTER 4 CLASSIFICATION WITH RADIAL BASIS AND PROBABILISTIC NEURAL NETWORKS 4.1 Introduction Optical character recognition is one of
More informationQuickest Search Over Multiple Sequences with Mixed Observations
Quicest Search Over Multiple Sequences with Mixed Observations Jun Geng Worcester Polytechnic Institute Email: geng@wpi.edu Weiyu Xu Univ. of Iowa Email: weiyu-xu@uiowa.edu Lifeng Lai Worcester Polytechnic
More informationLOW-DENSITY PARITY-CHECK (LDPC) codes [1] can
208 IEEE TRANSACTIONS ON MAGNETICS, VOL 42, NO 2, FEBRUARY 2006 Structured LDPC Codes for High-Density Recording: Large Girth and Low Error Floor J Lu and J M F Moura Department of Electrical and Computer
More informationSDP Memo 048: Two Dimensional Sparse Fourier Transform Algorithms
SDP Memo 048: Two Dimensional Sparse Fourier Transform Algorithms Document Number......................................................... SDP Memo 048 Document Type.....................................................................
More informationDetecting Burnscar from Hyperspectral Imagery via Sparse Representation with Low-Rank Interference
Detecting Burnscar from Hyperspectral Imagery via Sparse Representation with Low-Rank Interference Minh Dao 1, Xiang Xiang 1, Bulent Ayhan 2, Chiman Kwan 2, Trac D. Tran 1 Johns Hopkins Univeristy, 3400
More informationPart 4. Decomposition Algorithms Dantzig-Wolf Decomposition Algorithm
In the name of God Part 4. 4.1. Dantzig-Wolf Decomposition Algorithm Spring 2010 Instructor: Dr. Masoud Yaghini Introduction Introduction Real world linear programs having thousands of rows and columns.
More informationApproximability Results for the p-center Problem
Approximability Results for the p-center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Prof. Timothy Chan University of Waterloo, Spring 2004 The p-center
More informationFountain Codes Based on Zigzag Decodable Coding
Fountain Codes Based on Zigzag Decodable Coding Takayuki Nozaki Kanagawa University, JAPAN Email: nozaki@kanagawa-u.ac.jp Abstract Fountain codes based on non-binary low-density parity-check (LDPC) codes
More informationA reversible data hiding based on adaptive prediction technique and histogram shifting
A reversible data hiding based on adaptive prediction technique and histogram shifting Rui Liu, Rongrong Ni, Yao Zhao Institute of Information Science Beijing Jiaotong University E-mail: rrni@bjtu.edu.cn
More informationAN ALGORITHM FOR BLIND RESTORATION OF BLURRED AND NOISY IMAGES
AN ALGORITHM FOR BLIND RESTORATION OF BLURRED AND NOISY IMAGES Nader Moayeri and Konstantinos Konstantinides Hewlett-Packard Laboratories 1501 Page Mill Road Palo Alto, CA 94304-1120 moayeri,konstant@hpl.hp.com
More informationConstrained Clustering with Interactive Similarity Learning
SCIS & ISIS 2010, Dec. 8-12, 2010, Okayama Convention Center, Okayama, Japan Constrained Clustering with Interactive Similarity Learning Masayuki Okabe Toyohashi University of Technology Tenpaku 1-1, Toyohashi,
More informationlambda-min Decoding Algorithm of Regular and Irregular LDPC Codes
lambda-min Decoding Algorithm of Regular and Irregular LDPC Codes Emmanuel Boutillon, Frédéric Guillou, Jean-Luc Danger To cite this version: Emmanuel Boutillon, Frédéric Guillou, Jean-Luc Danger lambda-min
More informationGenerating All Solutions of Minesweeper Problem Using Degree Constrained Subgraph Model
356 Int'l Conf. Par. and Dist. Proc. Tech. and Appl. PDPTA'16 Generating All Solutions of Minesweeper Problem Using Degree Constrained Subgraph Model Hirofumi Suzuki, Sun Hao, and Shin-ichi Minato Graduate
More information1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra
Pattern Recall Analysis of the Hopfield Neural Network with a Genetic Algorithm Susmita Mohapatra Department of Computer Science, Utkal University, India Abstract: This paper is focused on the implementation
More informationVideo Inter-frame Forgery Identification Based on Optical Flow Consistency
Sensors & Transducers 24 by IFSA Publishing, S. L. http://www.sensorsportal.com Video Inter-frame Forgery Identification Based on Optical Flow Consistency Qi Wang, Zhaohong Li, Zhenzhen Zhang, Qinglong
More informationA probabilistic model to resolve diversity-accuracy challenge of recommendation systems
A probabilistic model to resolve diversity-accuracy challenge of recommendation systems AMIN JAVARI MAHDI JALILI 1 Received: 17 Mar 2013 / Revised: 19 May 2014 / Accepted: 30 Jun 2014 Recommendation systems
More informationJPEG compression of monochrome 2D-barcode images using DCT coefficient distributions
Edith Cowan University Research Online ECU Publications Pre. JPEG compression of monochrome D-barcode images using DCT coefficient distributions Keng Teong Tan Hong Kong Baptist University Douglas Chai
More informationThe Comparative Study of Machine Learning Algorithms in Text Data Classification*
The Comparative Study of Machine Learning Algorithms in Text Data Classification* Wang Xin School of Science, Beijing Information Science and Technology University Beijing, China Abstract Classification
More informationDOWNWARD SPATIALLY-SCALABLE IMAGE RECONSTRUCTION BASED ON COMPRESSED SENSING
DOWNWARD SPATIALLY-SCALABLE IMAGE RECONSTRUCTION BASED ON COMPRESSED SENSING Shuyuan Zhu 1 Bing Zeng 1 Lu Fang 2 and Moncef Gabbouj 3 1 Institute of Image Processing University of Electronic Science and
More informationSEQUENTIAL IMAGE COMPLETION FOR HIGH-SPEED LARGE-PIXEL NUMBER SENSING
SEQUENTIAL IMAGE COMPLETION FOR HIGH-SPEED LARGE-PIXEL NUMBER SENSING Akira Hirabayashi Naoki Nogami Takashi Ijiri Laurent Condat Ritsumeikan University College Info. Science & Eng. Kusatsu, Shiga 525-8577,
More information56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997
56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997 Answer #1 and any five of the remaining six problems! possible score 1. Multiple Choice 25 2. Traveling Salesman Problem 15 3.
More informationAnalysis of Basic Data Reordering Techniques
Analysis of Basic Data Reordering Techniques Tan Apaydin 1, Ali Şaman Tosun 2, and Hakan Ferhatosmanoglu 1 1 The Ohio State University, Computer Science and Engineering apaydin,hakan@cse.ohio-state.edu
More informationRandom projection for non-gaussian mixture models
Random projection for non-gaussian mixture models Győző Gidófalvi Department of Computer Science and Engineering University of California, San Diego La Jolla, CA 92037 gyozo@cs.ucsd.edu Abstract Recently,
More informationVision-Motion Planning with Uncertainty
Vision-Motion Planning with Uncertainty Jun MIURA Yoshiaki SHIRAI Dept. of Mech. Eng. for Computer-Controlled Machinery, Osaka University, Suita, Osaka 565, Japan jun@ccm.osaka-u.ac.jp Abstract This paper
More informationTHE simplex algorithm [1] has been popularly used
Proceedings of the International MultiConference of Engineers and Computer Scientists 207 Vol II, IMECS 207, March 5-7, 207, Hong Kong An Improvement in the Artificial-free Technique along the Objective
More informationAlgorithms for Integer Programming
Algorithms for Integer Programming Laura Galli November 9, 2016 Unlike linear programming problems, integer programming problems are very difficult to solve. In fact, no efficient general algorithm is
More informationAudio-visual interaction in sparse representation features for noise robust audio-visual speech recognition
ISCA Archive http://www.isca-speech.org/archive Auditory-Visual Speech Processing (AVSP) 2013 Annecy, France August 29 - September 1, 2013 Audio-visual interaction in sparse representation features for
More informationRanking Clustered Data with Pairwise Comparisons
Ranking Clustered Data with Pairwise Comparisons Kevin Kowalski nargle@cs.wisc.edu 1. INTRODUCTION Background. Machine learning often relies heavily on being able to rank instances in a large set of data
More informationNew Constructions of Non-Adaptive and Error-Tolerance Pooling Designs
New Constructions of Non-Adaptive and Error-Tolerance Pooling Designs Hung Q Ngo Ding-Zhu Du Abstract We propose two new classes of non-adaptive pooling designs The first one is guaranteed to be -error-detecting
More informationSet Cover with Almost Consecutive Ones Property
Set Cover with Almost Consecutive Ones Property 2004; Mecke, Wagner Entry author: Michael Dom INDEX TERMS: Covering Set problem, data reduction rules, enumerative algorithm. SYNONYMS: Hitting Set PROBLEM
More informationA PRIMAL-DUAL EXTERIOR POINT ALGORITHM FOR LINEAR PROGRAMMING PROBLEMS
Yugoslav Journal of Operations Research Vol 19 (2009), Number 1, 123-132 DOI:10.2298/YUJOR0901123S A PRIMAL-DUAL EXTERIOR POINT ALGORITHM FOR LINEAR PROGRAMMING PROBLEMS Nikolaos SAMARAS Angelo SIFELARAS
More informationEfficiency Optimisation Of Tor Using Diffie-Hellman Chain
Efficiency Optimisation Of Tor Using Diffie-Hellman Chain Kun Peng Institute for Infocomm Research, Singapore dr.kun.peng@gmail.com Abstract Onion routing is the most common anonymous communication channel.
More informationSummary of Raptor Codes
Summary of Raptor Codes Tracey Ho October 29, 2003 1 Introduction This summary gives an overview of Raptor Codes, the latest class of codes proposed for reliable multicast in the Digital Fountain model.
More informationBagging and Boosting Algorithms for Support Vector Machine Classifiers
Bagging and Boosting Algorithms for Support Vector Machine Classifiers Noritaka SHIGEI and Hiromi MIYAJIMA Dept. of Electrical and Electronics Engineering, Kagoshima University 1-21-40, Korimoto, Kagoshima
More informationParallel Graph Algorithms
Parallel Graph Algorithms Design and Analysis of Parallel Algorithms 5DV050/VT3 Part I Introduction Overview Graphs definitions & representations Minimal Spanning Tree (MST) Prim s algorithm Single Source
More informationRuled Based Approach for Scheduling Flow-shop and Job-shop Problems
Ruled Based Approach for Scheduling Flow-shop and Job-shop Problems Mohammad Komaki, Shaya Sheikh, Behnam Malakooti Case Western Reserve University Systems Engineering Email: komakighorban@gmail.com Abstract
More informationSecretary Problems and Incentives via Linear Programming
Secretary Problems and Incentives via Linear Programming Niv Buchbinder Microsoft Research, New England and Kamal Jain Microsoft Research, Redmond and Mohit Singh Microsoft Research, New England In the
More informationAccelerating Pattern Matching or HowMuchCanYouSlide?
Accelerating Pattern Matching or HowMuchCanYouSlide? Ofir Pele and Michael Werman School of Computer Science and Engineering The Hebrew University of Jerusalem {ofirpele,werman}@cs.huji.ac.il Abstract.
More informationSTUDYING OF CLASSIFYING CHINESE SMS MESSAGES
STUDYING OF CLASSIFYING CHINESE SMS MESSAGES BASED ON BAYESIAN CLASSIFICATION 1 LI FENG, 2 LI JIGANG 1,2 Computer Science Department, DongHua University, Shanghai, China E-mail: 1 Lifeng@dhu.edu.cn, 2
More informationSparse Component Analysis (SCA) in Random-valued and Salt and Pepper Noise Removal
Sparse Component Analysis (SCA) in Random-valued and Salt and Pepper Noise Removal Hadi. Zayyani, Seyyedmajid. Valliollahzadeh Sharif University of Technology zayyani000@yahoo.com, valliollahzadeh@yahoo.com
More informationOptimization of HMM by the Tabu Search Algorithm
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 20, 949-957 (2004) Optimization of HMM by the Tabu Search Algorithm TSONG-YI CHEN, XIAO-DAN MEI *, JENG-SHYANG PAN AND SHENG-HE SUN * Department of Electronic
More informationHydraulic pump fault diagnosis with compressed signals based on stagewise orthogonal matching pursuit
Hydraulic pump fault diagnosis with compressed signals based on stagewise orthogonal matching pursuit Zihan Chen 1, Chen Lu 2, Hang Yuan 3 School of Reliability and Systems Engineering, Beihang University,
More informationOn the Role of Weibull-type Distributions in NHPP-based Software Reliability Modeling
International Journal of Performability Engineering Vol. 9, No. 2, March 2013, pp. 123-132. RAMS Consultants Printed in India On the Role of Weibull-type Distributions in NHPP-based Software Reliability
More informationCompressive Sensing for Multimedia. Communications in Wireless Sensor Networks
Compressive Sensing for Multimedia 1 Communications in Wireless Sensor Networks Wael Barakat & Rabih Saliba MDDSP Project Final Report Prof. Brian L. Evans May 9, 2008 Abstract Compressive Sensing is an
More informationWeighted-CS for reconstruction of highly under-sampled dynamic MRI sequences
Weighted- for reconstruction of highly under-sampled dynamic MRI sequences Dornoosh Zonoobi and Ashraf A. Kassim Dept. Electrical and Computer Engineering National University of Singapore, Singapore E-mail:
More informationTransactions on Modelling and Simulation vol 20, 1998 WIT Press, ISSN X
r-adaptive boundary element method Eisuke Kita, Kenichi Higuchi & Norio Kamiya Department of Mechano-Informatics and Systems, Nagoya University, Nagoya 464-01, Japan Email: kita@mech.nagoya-u.ac.jp Abstract
More informationCHAPTER 5 OPTIMAL CLUSTER-BASED RETRIEVAL
85 CHAPTER 5 OPTIMAL CLUSTER-BASED RETRIEVAL 5.1 INTRODUCTION Document clustering can be applied to improve the retrieval process. Fast and high quality document clustering algorithms play an important
More informationCompressed Sensing Algorithm for Real-Time Doppler Ultrasound Image Reconstruction
Mathematical Modelling and Applications 2017; 2(6): 75-80 http://www.sciencepublishinggroup.com/j/mma doi: 10.11648/j.mma.20170206.14 ISSN: 2575-1786 (Print); ISSN: 2575-1794 (Online) Compressed Sensing
More information2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006
2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,
More informationUser-Friendly Sharing System using Polynomials with Different Primes in Two Images
User-Friendly Sharing System using Polynomials with Different Primes in Two Images Hung P. Vo Department of Engineering and Technology, Tra Vinh University, No. 16 National Road 53, Tra Vinh City, Tra
More informationImproving Connectivity via Relays Deployment in Wireless Sensor Networks
Improving Connectivity via Relays Deployment in Wireless Sensor Networks Ahmed S. Ibrahim, Karim G. Seddik, and K. J. Ray Liu Department of Electrical and Computer Engineering, and Institute for Systems
More informationCHAPTER 6 INFORMATION HIDING USING VECTOR QUANTIZATION
CHAPTER 6 INFORMATION HIDING USING VECTOR QUANTIZATION In the earlier part of the thesis different methods in the spatial domain and transform domain are studied This chapter deals with the techniques
More informationDesign of Orthogonal Graph Wavelet Filter Banks
Design of Orthogonal Graph Wavelet Filter Banks Xi ZHANG Department of Communication Engineering and Informatics The University of Electro-Communications Chofu-shi, Tokyo, 182-8585 JAPAN E-mail: zhangxi@uec.ac.jp
More informationAnalyzing the Peeling Decoder
Analyzing the Peeling Decoder Supplemental Material for Advanced Channel Coding Henry D. Pfister January 5th, 01 1 Introduction The simplest example of iterative decoding is the peeling decoder introduced
More informationAMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12.
AMS 550.47/67: Graph Theory Homework Problems - Week V Problems to be handed in on Wednesday, March : 6, 8, 9,,.. Assignment Problem. Suppose we have a set {J, J,..., J r } of r jobs to be filled by a
More informationIEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 10, NO. 6, NOVEMBER Inverting Feedforward Neural Networks Using Linear and Nonlinear Programming
IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 10, NO. 6, NOVEMBER 1999 1271 Inverting Feedforward Neural Networks Using Linear and Nonlinear Programming Bao-Liang Lu, Member, IEEE, Hajime Kita, and Yoshikazu
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationRobust Image Identification without any Visible Information for Double-Compressed JPEG Images
Robust Image Identification without any Visible Information for Double-Compressed JPEG Images Kenta Iida and Hitoshi Kiya Tokyo Metropolitan University, Tokyo, Japan E-mail: iida-kenta1@ed.tmu.ac.jp, kiya@tmu.ac.jp
More information4.12 Generalization. In back-propagation learning, as many training examples as possible are typically used.
1 4.12 Generalization In back-propagation learning, as many training examples as possible are typically used. It is hoped that the network so designed generalizes well. A network generalizes well when
More informationSharing Several Secrets based on Lagrange s Interpolation formula and Cipher Feedback Mode
Int. J. Nonlinear Anal. Appl. 5 (2014) No. 2, 60-66 ISSN: 2008-6822 (electronic) http://www.ijnaa.semnan.ac.ir Sharing Several Secrets based on Lagrange s Interpolation formula and Cipher Feedback Mode
More informationACO and other (meta)heuristics for CO
ACO and other (meta)heuristics for CO 32 33 Outline Notes on combinatorial optimization and algorithmic complexity Construction and modification metaheuristics: two complementary ways of searching a solution
More informationSCALING UP OF E-MSR CODES BASED DISTRIBUTED STORAGE SYSTEMS WITH FIXED NUMBER OF REDUNDANCY NODES
SCALING UP OF E-MSR CODES BASED DISTRIBUTED STORAGE SYSTEMS WITH FIXED NUMBER OF REDUNDANCY NODES Haotian Zhao, Yinlong Xu and Liping Xiang School of Computer Science and Technology, University of Science
More informationOn the Maximum Throughput of A Single Chain Wireless Multi-Hop Path
On the Maximum Throughput of A Single Chain Wireless Multi-Hop Path Guoqiang Mao, Lixiang Xiong, and Xiaoyuan Ta School of Electrical and Information Engineering The University of Sydney NSW 2006, Australia
More informationModel and Algorithms for the Density, Coverage and Connectivity Control Problem in Flat WSNs
Model and Algorithms for the Density, Coverage and Connectivity Control Problem in Flat WSNs Flávio V. C. Martins, cruzeiro@dcc.ufmg.br Frederico P. Quintão, fred@dcc.ufmg.br Fabíola G. Nakamura fgnaka@dcc.ufmg.br,fabiola@dcc.ufam.edu.br
More informationLimitations of Matrix Completion via Trace Norm Minimization
Limitations of Matrix Completion via Trace Norm Minimization ABSTRACT Xiaoxiao Shi Computer Science Department University of Illinois at Chicago xiaoxiao@cs.uic.edu In recent years, compressive sensing
More informationUML CS Algorithms Qualifying Exam Fall, 2003 ALGORITHMS QUALIFYING EXAM
NAME: This exam is open: - books - notes and closed: - neighbors - calculators ALGORITHMS QUALIFYING EXAM The upper bound on exam time is 3 hours. Please put all your work on the exam paper. (Partial credit
More informationUsing Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions
Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions R.Thamaraiselvan 1, S.Gopikrishnan 2, V.Pavithra Devi 3 PG Student, Computer Science & Engineering, Paavai College
More informationRandomized rounding of semidefinite programs and primal-dual method for integer linear programming. Reza Moosavi Dr. Saeedeh Parsaeefard Dec.
Randomized rounding of semidefinite programs and primal-dual method for integer linear programming Dr. Saeedeh Parsaeefard 1 2 3 4 Semidefinite Programming () 1 Integer Programming integer programming
More informationChapter 14 Global Search Algorithms
Chapter 14 Global Search Algorithms An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Introduction We discuss various search methods that attempts to search throughout the entire feasible set.
More informationClustering. SC4/SM4 Data Mining and Machine Learning, Hilary Term 2017 Dino Sejdinovic
Clustering SC4/SM4 Data Mining and Machine Learning, Hilary Term 2017 Dino Sejdinovic Clustering is one of the fundamental and ubiquitous tasks in exploratory data analysis a first intuition about the
More informationAdaptive osculatory rational interpolation for image processing
Journal of Computational and Applied Mathematics 195 (2006) 46 53 www.elsevier.com/locate/cam Adaptive osculatory rational interpolation for image processing Min Hu a, Jieqing Tan b, a College of Computer
More informationTowards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms Joao Marques-Silva and Vasco Manquinho School of Electronics and Computer Science, University of Southampton, UK IST/INESC-ID,
More informationRedundancy Resolution by Minimization of Joint Disturbance Torque for Independent Joint Controlled Kinematically Redundant Manipulators
56 ICASE :The Institute ofcontrol,automation and Systems Engineering,KOREA Vol.,No.1,March,000 Redundancy Resolution by Minimization of Joint Disturbance Torque for Independent Joint Controlled Kinematically
More information248 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 1, JANUARY 2012
248 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 58, NO 1, JANUARY 2012 Graph-Constrained Group Testing Mahdi Cheraghchi, Associate Member, IEEE, Amin Karbasi, Student Member, IEEE, Soheil Mohajer, Member,
More informationTraining Digital Circuits with Hamming Clustering
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: FUNDAMENTAL THEORY AND APPLICATIONS, VOL. 47, NO. 4, APRIL 2000 513 Training Digital Circuits with Hamming Clustering Marco Muselli, Member, IEEE, and Diego
More informationHybrid Feature Selection for Modeling Intrusion Detection Systems
Hybrid Feature Selection for Modeling Intrusion Detection Systems Srilatha Chebrolu, Ajith Abraham and Johnson P Thomas Department of Computer Science, Oklahoma State University, USA ajith.abraham@ieee.org,
More informationConstrained adaptive sensing
Constrained adaptive sensing Deanna Needell Claremont McKenna College Dept. of Mathematics Mark Davenport Andrew Massimino Tina Woolf Sensing sparse signals -sparse When (and how well) can we estimate
More informationPrivacy Preserving Collaborative Filtering
Privacy Preserving Collaborative Filtering Emily Mu, Christopher Shao, Vivek Miglani May 2017 1 Abstract As machine learning and data mining techniques continue to grow in popularity, it has become ever
More informationA new two-stage decoding scheme with unreliable path search to lower the error-floor for low-density parity-check codes
IET Communications Research Article A new two-stage decoding scheme with unreliable path search to lower the error-floor for low-density parity-check codes Pilwoong Yang 1, Bohwan Jun 1, Jong-Seon No 1,
More informationOne-mode Additive Clustering of Multiway Data
One-mode Additive Clustering of Multiway Data Dirk Depril and Iven Van Mechelen KULeuven Tiensestraat 103 3000 Leuven, Belgium (e-mail: dirk.depril@psy.kuleuven.ac.be iven.vanmechelen@psy.kuleuven.ac.be)
More informationCrew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm. Santos and Mateus (2007)
In the name of God Crew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm Spring 2009 Instructor: Dr. Masoud Yaghini Outlines Problem Definition Modeling As A Set Partitioning
More informationBilevel Sparse Coding
Adobe Research 345 Park Ave, San Jose, CA Mar 15, 2013 Outline 1 2 The learning model The learning algorithm 3 4 Sparse Modeling Many types of sensory data, e.g., images and audio, are in high-dimensional
More informationIntroduction to Graphical Models
Robert Collins CSE586 Introduction to Graphical Models Readings in Prince textbook: Chapters 10 and 11 but mainly only on directed graphs at this time Credits: Several slides are from: Review: Probability
More informationSanta Fe Trail Problem Solution Using Grammatical Evolution
2012 International Conference on Industrial and Intelligent Information (ICIII 2012) IPCSIT vol.31 (2012) (2012) IACSIT Press, Singapore Santa Fe Trail Problem Solution Using Grammatical Evolution Hideyuki
More informationA robust optimization based approach to the general solution of mp-milp problems
21 st European Symposium on Computer Aided Process Engineering ESCAPE 21 E.N. Pistikopoulos, M.C. Georgiadis and A. Kokossis (Editors) 2011 Elsevier B.V. All rights reserved. A robust optimization based
More informationSparse & Redundant Representations and Their Applications in Signal and Image Processing
Sparse & Redundant Representations and Their Applications in Signal and Image Processing Sparseland: An Estimation Point of View Michael Elad The Computer Science Department The Technion Israel Institute
More informationExpected Capacity Guaranteed Routing based on Dynamic Link Failure Prediction
Expected Capacity Guaranteed Routing based on Dynamic Link Failure Prediction Shu Sekigawa, Satoru Okamoto, and Naoaki Yamanaka Department of Information and Computer Science, Faculty of Science and Technology,
More informationFace Recognition Using Vector Quantization Histogram and Support Vector Machine Classifier Rong-sheng LI, Fei-fei LEE *, Yan YAN and Qiu CHEN
2016 International Conference on Artificial Intelligence: Techniques and Applications (AITA 2016) ISBN: 978-1-60595-389-2 Face Recognition Using Vector Quantization Histogram and Support Vector Machine
More informationOn the Complexity of the Policy Improvement Algorithm. for Markov Decision Processes
On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes Mary Melekopoglou Anne Condon Computer Sciences Department University of Wisconsin - Madison 0 West Dayton Street Madison,
More informationClustering: Classic Methods and Modern Views
Clustering: Classic Methods and Modern Views Marina Meilă University of Washington mmp@stat.washington.edu June 22, 2015 Lorentz Center Workshop on Clusters, Games and Axioms Outline Paradigms for clustering
More informationA Representative Sample Selection Approach for SRC
DEIM Forum 2011 E9-1 AliceChen, NTT, 239-0847 1-1 School of Computing Science, Simon Fraser University 8888 University Drive, Burnaby BC, V5A 1S6 Canada E-mail: {alice.chen,eda.takeharu,katafuchi.norifumi,kataoka.ryoji}@lab.ntt.co.jp
More informationA method to speedily pairwise compare in AHP and ANP
ISAHP 2005, Honolulu, Hawaii, July 8-10, 2005 A method to speedily pairwise compare in AHP and ANP Kazutomo Nishizawa Department of Mathematical Information Engineering, College of Industrial Technology,
More informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
More informationA motion planning method for mobile robot considering rotational motion in area coverage task
Asia Pacific Conference on Robot IoT System Development and Platform 018 (APRIS018) A motion planning method for mobile robot considering rotational motion in area coverage task Yano Taiki 1,a) Takase
More informationRobust Steganography Using Texture Synthesis
Robust Steganography Using Texture Synthesis Zhenxing Qian 1, Hang Zhou 2, Weiming Zhang 2, Xinpeng Zhang 1 1. School of Communication and Information Engineering, Shanghai University, Shanghai, 200444,
More informationFault propagation in tabular expression-based specifications
Title Fault propagation in tabular expression-based specifications Authors) Feng, X; Parnas, DL; Tse, TH Citation The 32nd Annual IEEE International Computer Software and Applications Conference COMPSAC
More informationDevelopment of Generic Search Method Based on Transformation Invariance
Development of Generic Search Method Based on Transformation Invariance Fuminori Adachi, Takashi Washio, Hiroshi Motoda and *Hidemitsu Hanafusa I.S.I.R., Osaka University, {adachi, washio, motoda}@ar.sanken.osaka-u.ac.jp
More informationEfficient Implementation of Single Error Correction and Double Error Detection Code with Check Bit Precomputation
http://dx.doi.org/10.5573/jsts.2012.12.4.418 JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.12, NO.4, DECEMBER, 2012 Efficient Implementation of Single Error Correction and Double Error Detection
More informationDantzig selector homotopy with dynamic measurements
Dantzig selector homotopy with dynamic measurements M. Salman Asif a and Justin Romberg a a School of Electrical and Computer Engineering Georgia Institute of Technology, Atlanta, GA, 30332 ABSTRACT The
More information