R. van Liere, K. Batenburg, I. Garachon, Ching-Ling Wang, J. Dorscheid
{"title":"The Dual Space: Concept and Applications in Cultural Heritage","authors":"R. van Liere, K. Batenburg, I. Garachon, Ching-Ling Wang, J. Dorscheid","doi":"10.1109/MBITS.2022.3202508","DOIUrl":"https://doi.org/10.1109/MBITS.2022.3202508","url":null,"abstract":"An important question in cultural heritage concerns the make process of an artifact. Understanding the make process provides insight related to the origin, techniques, and craftsmanship used to make the artifact. Searching for tool marks or traces left by the artist’s hand is one way of retrieving clues related to the make process. X-ray computed tomography is a nondestructive tool that produces volumetric images of structures inside an artifact. However, interactively searching in large volumetric images for tool marks is a difficult, tedious, and time-consuming task. In this article, we introduce the concept of a dual space. The governing idea is that the dual space represents the air in the interior of an object. In the context of cultural heritage, the dual space represents those materials that first belonged to the object but have been removed during the make process. Our main goal of creating the dual space is to facilitate searching, inspection, and interpretation of tool marks. We provide two examples of how the dual space can be used to study the make process.","PeriodicalId":448036,"journal":{"name":"IEEE BITS the Information Theory Magazine","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129080156","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":"IEEE BITS Editorial Board","authors":"","doi":"10.1109/mbits.2022.3217879","DOIUrl":"https://doi.org/10.1109/mbits.2022.3217879","url":null,"abstract":"","PeriodicalId":448036,"journal":{"name":"IEEE BITS the Information Theory Magazine","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132351817","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. Calder, Reed Coil, J. A. Melton, P. Olver, G. Tostevin, K. Yezzi-Woodley
{"title":"Use and Misuse of Machine Learning in Anthropology","authors":"J. Calder, Reed Coil, J. A. Melton, P. Olver, G. Tostevin, K. Yezzi-Woodley","doi":"10.1109/MBITS.2022.3205143","DOIUrl":"https://doi.org/10.1109/MBITS.2022.3205143","url":null,"abstract":"Machine learning (ML), being now widely accessible to the research community at large, has fostered a proliferation of new and striking applications of these emergent mathematical techniques across a wide range of disciplines. In this article, we will focus on a particular case study: the field of paleoanthropology, which seeks to understand the evolution of the human species based on biological (e.g., bones, genetics) and cultural (e.g., stone tools) evidence. As we will show, the easy availability of ML algorithms and lack of expertise on their proper use among the anthropological research community has led to the foundational misapplications that have appeared throughout the literature. The resulting unreliable results not only undermine efforts to legitimately incorporate ML into anthropological research, but produce potentially faulty understandings about our human evolutionary and behavioral past. The aim of this article is to provide a brief introduction to some of the ways in which ML has been applied within paleoanthropology; we also include a survey of some basic ML algorithms for those who are not fully conversant with the field, which remains under active development. We discuss a series of missteps, errors, and violations of correct protocols of ML methods that appear disconcertingly often within the accumulating body of anthropological literature. These mistakes include the use of outdated algorithms and practices; inappropriate testing/training splits, sample composition, and textual explanations; as well as an absence of transparency due to the lack of data/code sharing, and the subsequent limitations imposed on independent replication. We assert that expanding samples, sharing data and code, re-evaluating approaches to peer review, and, most importantly, developing interdisciplinary teams that include experts in ML are all necessary for the progress in future research incorporating ML within anthropology and beyond.","PeriodicalId":448036,"journal":{"name":"IEEE BITS the Information Theory Magazine","volume":"229 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131832253","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":"No $((n,K,d< 127))$ Code Can Violate the Quantum Hamming Bound","authors":"E. Dallas, Faidon Andreadakis, Daniel A. Lidar","doi":"10.1109/MBITS.2023.3262219","DOIUrl":"https://doi.org/10.1109/MBITS.2023.3262219","url":null,"abstract":"It is well-known that nondegenerate quantum error correcting codes (QECCs) are constrained by a quantum version of the Hamming bound. Whether degenerate codes also obey such a bound, however, remains a long-standing question with practical implications for the efficacy of QECCs. We employ a combination of previously derived bounds on QECCs to demonstrate that a subset of all codes must obey the quantum Hamming bound. Specifically, we combine an analytical bound due to Rains with a numerical bound due to Li and Xing to show that no $((n,K,d))$((n,K,d)) code with $d< 127$d<127 can violate the quantum Hamming bound.","PeriodicalId":448036,"journal":{"name":"IEEE BITS the Information Theory Magazine","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121933733","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":"Conservation Laws and Quantum Error Correction: Toward a Generalized Matching Decoder","authors":"Benjamin J. Brown","doi":"10.1109/MBITS.2023.3246025","DOIUrl":"https://doi.org/10.1109/MBITS.2023.3246025","url":null,"abstract":"Decoding algorithms are essential to fault-tolerant quantum-computing architectures. In this perspective we explore decoding algorithms for the surface code; a prototypical quantum low-density parity-check code that underlies many of the leading efforts to demonstrate scalable quantum computing. Central to our discussion is the minimum-weight perfect-matching decoder. The decoder works by exploiting underlying structure that arises due to materialized symmetries among surface-code stabilizer elements. By concentrating on these symmetries, we begin to address the question of how a minimum-weight perfect-matching decoder might be generalized for other families of codes. We approach this question first by investigating examples of matching decoders for other codes. These include decoding algorithms that have been specialized to correct for noise models that demonstrate a particular structure or bias with respect to certain codes. In addition to this, we propose a systematic way of constructing a minimum-weight perfect-matching decoder for codes with certain characteristic properties. The properties we make use of are common among topological codes. We discuss the broader applicability of the proposal, and we suggest some questions we can address that may show us how to design a generalized matching decoder for arbitrary stabilizer codes.","PeriodicalId":448036,"journal":{"name":"IEEE BITS the Information Theory Magazine","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125107323","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":"Welcome to the First Issue of IEEE BITS","authors":"R. Calderbank","doi":"10.1109/mbits.2021.3134881","DOIUrl":"https://doi.org/10.1109/mbits.2021.3134881","url":null,"abstract":"","PeriodicalId":448036,"journal":{"name":"IEEE BITS the Information Theory Magazine","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125832123","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":"Friends in Comment—A Conversation With Regina Barzilay","authors":"M. Medard","doi":"10.1109/mbits.2021.3132470","DOIUrl":"https://doi.org/10.1109/mbits.2021.3132470","url":null,"abstract":"","PeriodicalId":448036,"journal":{"name":"IEEE BITS the Information Theory Magazine","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130534365","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":"The Virtual Year: Perspectives of JKW Best Paper Awardees","authors":"Martina Cardon","doi":"10.1109/mbits.2021.3129565","DOIUrl":"https://doi.org/10.1109/mbits.2021.3129565","url":null,"abstract":"","PeriodicalId":448036,"journal":{"name":"IEEE BITS the Information Theory Magazine","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127394282","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":"Information Theory at the U.S. National Science Foundation","authors":"P. Regalia","doi":"10.1109/mbits.2021.3134450","DOIUrl":"https://doi.org/10.1109/mbits.2021.3134450","url":null,"abstract":"","PeriodicalId":448036,"journal":{"name":"IEEE BITS the Information Theory Magazine","volume":"160 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129024850","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}
Pavlos Nikolopoulos, Sundara Rajan Srinivasavaradhan, C. Fragouli, S. Diggavi
{"title":"Group Testing for Community Infections","authors":"Pavlos Nikolopoulos, Sundara Rajan Srinivasavaradhan, C. Fragouli, S. Diggavi","doi":"10.1109/mbits.2021.3126244","DOIUrl":"https://doi.org/10.1109/mbits.2021.3126244","url":null,"abstract":"Group testing is the technique of pooling together diagnostic samples in order to increase the efficiency of medical testing. Traditionally, works in group testing assume that the infections are i.i.d. However, contagious diseases like COVID-19 are governed by community spread and hence the infections are correlated. This survey presents an overview of recent research progress that leverages the community structure to further improve the efficiency of group testing. We show that taking into account the side-information provided by the community structure may lead to significant savings—up to 60% fewer tests compared to traditional test designs. We review lower bounds and new approaches to encoding and decoding algorithms that take into account the community structure and integrate group testing into epidemiological modeling. Finally, we also discuss a few important open questions in this space.","PeriodicalId":448036,"journal":{"name":"IEEE BITS the Information Theory Magazine","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122831554","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}