As we increase our reliance on computer-generated information, often using it as part of our decision-making process, we must devise tools to assess the correctness of that information. Consider, for example, software...
ISBN:
(数字)9781627058346
As we increase our reliance on computer-generated information, often using it as part of our decision-making process, we must devise tools to assess the correctness of that information. Consider, for example, software embedded on vehicles, used for simulating aircraft performance, or used in medical imaging. In those cases, software correctness is of paramount importance as there"s little room for error. Software verification is one of the tools available to attain such goals. Verification is a well known and widely studied subfield of computerscience and computational science and the goal is to help us increase confidence in the software implementation by verifying that the software does what it is supposed to do. The goal of this book is to introduce the reader to software verification in the context of visualization. In the same way we became more dependent on commercial software, we have also increased our reliance on visualization software. The reason is simple: visualization is the lens through which users can understand complex data, and as such it must be verified. The explosion in our ability to amass data requires tools not only to store and analyze data, but also to visualize it. This book is comprised of six chapters. After an introduction to the goals of the book, we present a brief description of both worlds of visualization (Chapter 2) and verification (Chapter 3). We then proceed to illustrate the main steps of the verification pipeline for visualization algorithms. We focus on two classic volume visualization techniques, namely, Isosurface Extraction (Chapter 4) and Direct Volume Rendering (Chapter 5). We explain how to verify implementations of those techniques and report the latest results in the field of verification of visualization techniques. The last chapter concludes the book and highlights new research topics for the future.
In the version of the article published, the author list is not accurate. Igor Cima and Min-Han Tan should have been authors, appearing after Mark Wong in the author list, while Paul Jongjoon Choi should not have been...
In the version of the article published, the author list is not accurate. Igor Cima and Min-Han Tan should have been authors, appearing after Mark Wong in the author list, while Paul Jongjoon Choi should not have been listed as an author. Igor Cima and Min-Han Tan both have the affiliation Institute of Bioengineering and Nanotechnology, Singapore, Singapore, and their contributions should have been noted in the Author Contributions section as "I.C. preprocessed Primary Cell Atlas data with inputs from M.-H.T." The following description of the contribution of Paul Jongjoon Choi should not have appeared: "P.J.C. supported the smFISH experiments." In the 'RCA: global panel' section of the Online Methods, the following sentence should have appeared as the second sentence, "An expression atlas of human primary cells (the Primary Cell Atlas) was preprocessed similarly to in ref. 55," with new reference 55 (Cima, I. et al. Tumor-derived circulating endothelial cell clusters in colorectal cancer. science Transl. Med. 8, 345ra89, 2016).
Protection of patient's privacy is an obligation enforced by laws and regulations in the US, Canada, and other jurisdictions. With exponential growth of exchange of personal health information (PHI) brought about ...
详细信息
Protection of patient's privacy is an obligation enforced by laws and regulations in the US, Canada, and other jurisdictions. With exponential growth of exchange of personal health information (PHI) brought about by e-health, there is a need for smart algorithms that help the data publisher to protect PHI. Within exiting privacy models, differential privacy is considered one of the strongest privacy protection techniques that does not make any assumption about the attacker's background knowledge. One way to achieve differential privacy in the non-interactive mode is to derive a contingency table of the raw data over the database domain, to add noise to each count, and to publish the resulting noisy table of counts. This approach, however, is not suitable for high-dimensional data with large domains as the added noise substantially destroys the utility of the data. In this work, we show that when the K-anonymity is preceded by feature selection, it is possible to obtain a contingency table with higher counts. As a result, when noise is added to satisfy differential privacy, its distorting effect is minimized and high utility of the data is preserved. We propose the TOP_Diff algorithm which offers a trade-off between anonymization level K and the privacy budget ɛ, and enables us to publish privacy preserving datasets with high utility. Our approach is capable of handling both numerical and categorical features.
The research on community structure is a key to analyze the network functionality and topology, and thus it is significant to detect and analysis the community structure. During the abstract process from an actual sys...
详细信息
The research on community structure is a key to analyze the network functionality and topology, and thus it is significant to detect and analysis the community structure. During the abstract process from an actual system to a network, especially for a large-scale network, it is inevitable to have mistaken connections between nodes or have connection missing. In addition, in real applications, from time to time we can obtain prior information in the form of pairwise constraints between nodes besides topology information, although they may be inaccurate or conflicted. These noises in the network-related information will dramatically reduce the accuracy of community detection. Hence, in this paper, we introduce a dissimilarity index to determine the trustworthiness of pairwise constraints and settle the conflict of pairwise constraints. Then, focusing on the community detection with false connections or conflicted connections, we propose a pairwise constrained structure-enhanced extremal optimization-based semi-supervised algorithm (PCSEO-SS algorithm). Compared with existing semi-supervised community detection approaches, the experimental results executed on real networks and synthetic networks, show that PCSEO-SS can solve the problem of false connections or conflicted connections to some extent and detect the community structure more precisely.
A large amount of digital information collected and stored in databases creates new opportunities for knowledge discovery and data mining. The datasets, however, may contain personally identifiable information that ne...
详细信息
ISBN:
(纸本)9781479956678
A large amount of digital information collected and stored in databases creates new opportunities for knowledge discovery and data mining. The datasets, however, may contain personally identifiable information that needs to be protected. With high dimensionality of many large datasets, dimensionality reduction such as feature selection becomes indispensible. In this work, we aim at incorporating privacy into the very process of feature selection and as such, propose a privacy-aware filter-based feature selection method (PF-IFR). Our method enables data custodians to define a trade-off measure for controlling the amount of privacy and efficacy using filter-based feature selection techniques.
A1 Highlights from the eleventh ISCB Student Council Symposium 2015 Katie Wilkins, Mehedi Hassan, Margherita Francescatto, Jakob Jespersen, R. Gonzalo Parra, Bart Cuypers, Dan DeBlasio, Alexander Junge, Anupama Jigish...
详细信息
A1 Highlights from the eleventh ISCB Student Council Symposium 2015 Katie Wilkins, Mehedi Hassan, Margherita Francescatto, Jakob Jespersen, R. Gonzalo Parra, Bart Cuypers, Dan DeBlasio, Alexander Junge, Anupama Jigisha, Farzana Rahman O1 Prioritizing a drug’s targets using both gene expression and structural similarity Griet Laenen, Sander Willems, Lieven Thorrez, Yves Moreau O2 Organism specific protein-RNA recognition: A computational analysis of protein-RNA complex structures from different organisms Nagarajan Raju, Sonia Pankaj Chothani, C. Ramakrishnan, Masakazu Sekijima; M. Michael Gromiha O3 Detection of Heterogeneity in Single Particle Tracking Trajectories Paddy J Slator, Nigel J Burroughs O4 3D-NOME: 3D NucleOme Multiscale Engine for data-driven modeling of three-dimensional genome architecture Przemysław Szałaj, Zhonghui Tang, Paul Michalski, Oskar Luo, Xingwang Li, Yijun Ruan, Dariusz Plewczynski O5 A novel feature selection method to extract multiple adjacent solutions for viral genomic sequences classification Giulia Fiscon, Emanuel Weitschek, Massimo Ciccozzi, Paola Bertolazzi, Giovanni Felici O6 A Systems Biology Compendium for Leishmania donovani Bart Cuypers, Pieter Meysman, Manu Vanaerschot, Maya Berg, Hideo Imamura, Jean-Claude Dujardin, Kris Laukens O7 Unravelling signal coordination from large scale phosphorylation kinetic data Westa Domanova, James R. Krycer, Rima Chaudhuri, Pengyi Yang, Fatemeh Vafaee, Daniel J. Fazakerley, Sean J. Humphrey, David E. James, Zdenka Kuncic
Background: Non-small cell lung cancer (NSCLC) is a major cause of cancer-related death worldwide due to poor patient prognosis and clinical outcome. Here, we studied the genetic variations underlying NSCLC pathogenes...
详细信息
Click fraud-the deliberate clicking on advertisements with no real interest on the product or service offered-is one of the most daunting problems in online advertising. Building an effective fraud detection method is...
详细信息
Click fraud-the deliberate clicking on advertisements with no real interest on the product or service offered-is one of the most daunting problems in online advertising. Building an effective fraud detection method is thus pivotal for online advertising businesses. We organized a Fraud Detection in Mobile Advertising (FDMA) 2012 Competition, opening the opportunity for participants to work on real-world fraud data from BuzzCity Pte. Ltd., a global mobile advertising company based in Singapore. In particular, the task is to identify fraudulent publishers who generate illegitimate clicks, and distinguish them from normal publishers. The competition was held from September 1 to September 30, 2012, attracting 127 teams from more than 15 countries. The mobile advertising data are unique and complex, involving heterogeneous information, noisy patterns with missing values, and highly imbalanced class distribution. The competition results provide a comprehensive study on the usability of data mining-based fraud detection approaches in practical setting. Our principal findings are that features derived from fine-grained time-series analysis are crucial for accurate fraud detection, and that ensemble methods offer promising solutions to highly-imbalanced nonlinear classification tasks with mixed variable types and noisy/missing patterns. The competition data remain available for further studies at http://***/fdma2012/.
暂无评论