{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T09:10:28Z","timestamp":1723108228538},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1109\/tase.2013.2271703","type":"journal-article","created":{"date-parts":[[2013,7,12]],"date-time":"2013-07-12T18:03:53Z","timestamp":1373652233000},"page":"274-279","source":"Crossref","is-referenced-by-count":3,"title":["Degree of Redundancy of Linear Systems Using Implicit Set Covering"],"prefix":"10.1109","volume":"11","author":[{"given":"John D.","family":"Arellano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Illya V.","family":"Hicks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24587-2_50"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1137\/S0895480103428338","article-title":"On the complexity of some enumeration problems for matroids","volume":"19","author":"boros","year":"2005","journal-title":"SIAM J Discrete Math"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.06.015"},{"key":"ref13","author":"govindaraj","year":"2010","journal-title":"Calculation of sensor redundancy degree for linear sensor systems"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"ref16","first-page":"155","article-title":"An iterated heuristic algorithm for the set covering problem","author":"marchiori","year":"1998","journal-title":"Proc 2nd Workshop on Algorithm Eng WAE'98"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/11779568_34"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00159-X"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(87)90141-X"},{"key":"ref28","author":"golub","year":"1996","journal-title":"Matrix Computations"},{"key":"ref4","first-page":"8","article-title":"Observability, redundancy, reliability and integrated design of measurement systems","author":"luong","year":"1994","journal-title":"Proc 3rd IFAC Symp Intell Compon Instrum Control Appl"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","article-title":"Optimally sparse representation in general (nonorthogonal) dictionaries via <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell$<\/tex> <\/formula>-1 minimization","volume":"100","author":"donoho","year":"2003","journal-title":"Proc Nat Acad Sci USA"},{"key":"ref3","author":"rugh","year":"1996","journal-title":"Linear System Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/aic.690450910"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372"},{"key":"ref7","author":"oxley","year":"1992","journal-title":"Matroid Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2010.2089449"},{"key":"ref9","author":"wolsey","year":"1998","journal-title":"Integer Programming"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0009-2509(76)85029-4"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90215-U"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","article-title":"Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study","volume":"12","author":"balas","year":"1980","journal-title":"Combinatorial Optimization"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120885"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00161-0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582278"},{"key":"ref26","year":"2010"},{"key":"ref25","author":"cho","year":"2007","journal-title":"On the Robustness of Clustered Sensor Networks"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8856\/6701320\/06558498.pdf?arnumber=6558498","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:31:55Z","timestamp":1642005115000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6558498\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":28,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tase.2013.2271703","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}