{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:21:00Z","timestamp":1729657260412,"version":"3.28.0"},"reference-count":50,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1109\/seams.2013.6595499","type":"proceedings-article","created":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T11:55:18Z","timestamp":1379591718000},"page":"123-132","source":"Crossref","is-referenced-by-count":4,"title":["Self-adaptive containers: Building resource-efficient applications with low programmer overhead"],"prefix":"10.1109","author":[{"given":"Wei-Chih","family":"Huang","sequence":"first","affiliation":[]},{"given":"William J.","family":"Knottenbelt","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"35","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022445108617"},{"journal-title":"STL Tutorial and Reference Guide C++ Programming with the Standard Template Library","year":"2001","author":"musser","key":"36"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1145\/1516533.1516538"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02161-9_1"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2003.1160055"},{"key":"38","article-title":"A classification scheme for self-adaptation research","author":"rohr","year":"2006","journal-title":"Proc International Conference on Self-Organization and Autonomous Systems in Computing and Communications (SOAS'2006)"},{"journal-title":"Web Service Level Agreement (WSLA) Language Specification IBM Corporation Std","year":"2003","author":"ludwig","key":"43"},{"journal-title":"Dablooms An Open Source Scalable Counting Bloom Filter Library","year":"2012","author":"hines et al","key":"42"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195563"},{"key":"40","first-page":"684","article-title":"An improved construction for counting Bloom filters","author":"bonomi","year":"2006","journal-title":"LNCS 4168 Proc ESA 2006"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-11-560"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-354"},{"key":"24","article-title":"Memory efficient de Bruijn graph construction","author":"li","year":"2012","journal-title":"CoRR"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2009.4919646"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-333"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1121464109"},{"key":"28","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/978-3-642-33122-0_19","article-title":"Space-efficient and exact de Bruijn graph representation based on a Bloom filter","volume":"7534","author":"chikhi","year":"2012","journal-title":"Algorithms in Bioinformatics of Lecture Notes in Computer Science"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018964121953"},{"key":"3","first-page":"59","article-title":"Reliable hashing without collision detection","author":"wolper","year":"1993","journal-title":"CAV"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380180203"},{"key":"1","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1109\/TC.1980.1675654","article-title":"On evaluating the performability of degradable computing systems","volume":"29","author":"meyer","year":"1980","journal-title":"IEEE Trans Computers"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/PDMC-HiBi.2010.10"},{"journal-title":"Software Product Lines Practices and Patterns","year":"2002","author":"clements","key":"30"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/PDMC-HiBi.2010.13"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/PNPM.1999.796528"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2005.85"},{"key":"4","first-page":"206","article-title":"Improved probabilistic verification by hash compaction","author":"stern","year":"1995","journal-title":"CHARME"},{"journal-title":"Design Patterns Elements of Reusable Object-Oriented Software","year":"1995","author":"gamma","key":"31"},{"key":"9","first-page":"58","article-title":"Distributed disk-based solution techniques for large Markov models","author":"knottenbelt","year":"1999","journal-title":"Proc 3rd International Workshop on the Numerical Solution of Markov Chains (NSMC '99)"},{"key":"8","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/BFb0022197","article-title":"An efficient disk-based tool for solving very large Markov models","author":"deavours","year":"1997","journal-title":"Proc 9th International Conference on Computer Performance Evaluation Modelling Techniques and Tools"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1101\/gr.074492.107"},{"key":"17","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1089\/cmb.1995.2.291","article-title":"A new algorithm for DNA sequence assembly","volume":"2","author":"idury","year":"1995","journal-title":"Journal of Computational Biology"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.171285098"},{"journal-title":"Performance Analysis of Large Markov Models","year":"2000","author":"knottenbelt","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16164-3_8"},{"key":"13","first-page":"181","article-title":"Parallel State Space Exploration for GSPN Models","volume":"935","author":"caselli","year":"1995","journal-title":"Proc Application and Theory of Petri Nets"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.10.1.82"},{"key":"11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-45605-8_9","article-title":"Out-of-core solution of large linear systems of equations arising from stochastic modelling","author":"kwiatkowska","year":"2002","journal-title":"Proc 2nd Intl Workshop on Process Algebra and Probabilistic Methods Performance Modeling and Verification"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63138-0_19"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470397"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1101\/gr.7337908"},{"journal-title":"The CityHash Family of Hash Functions","year":"2010","author":"pike","key":"49"},{"key":"48","article-title":"STXXL: Standard Template Library for XXL data sets","author":"dementiev","year":"2007","journal-title":"Software Practice and Experience"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.48"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1145\/1380584.1380585"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941586"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1145\/263580.263614"},{"key":"10","first-page":"181","article-title":"Serial and parallel out-of-core solution of linear systems arising from Generalised Stochastic Petri Nets","author":"bell","year":"2001","journal-title":"Proc High Performance Computing"},{"journal-title":"Model checking","year":"2000","author":"grumberg","key":"50"}],"event":{"name":"2013 8th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)","start":{"date-parts":[[2013,5,20]]},"location":"San Francisco, CA, USA","end":{"date-parts":[[2013,5,21]]}},"container-title":["2013 8th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6588685\/6595479\/06595499.pdf?arnumber=6595499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T18:11:23Z","timestamp":1498068683000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6595499\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/seams.2013.6595499","relation":{},"subject":[],"published":{"date-parts":[[2013,5]]}}}