Christine Kim, Peggy Yin, Carlos Soto, Ian K. Blaby, Shinjae Yoo
{"title":"Multimodal biological analysis using NLP and expression profile","authors":"Christine Kim, Peggy Yin, Carlos Soto, Ian K. Blaby, Shinjae Yoo","doi":"10.1109/NYSDS.2018.8538944","DOIUrl":"https://doi.org/10.1109/NYSDS.2018.8538944","url":null,"abstract":"The goal of this project is to gather biological data from different sources and use computational analysis to evaluate it together. Two data sources were used: microarray gene expression data for Arabidopsis thaliana, and gene co-occurrences in scientific literature extracted from bioRxiv using natural language processing (NLP). For analysis, the microarray data was normalized, its dimensionality was reduced using principal component analysis (PCA), and it was grouped into different numbers of clusters using K-means clusters. Then these expression clusters were compared to the co-occurrence pairs in the NLP data, to evaluate the quality of the NLP extractions. This evaluation was done using entropy analysis on the combined data, compared to the maximum entropy in the clustering alone. As a result, the evaluation of the NLP data shows that the results do correspond to the clusters from the microarray data, and may be used for further analysis.","PeriodicalId":366010,"journal":{"name":"2018 New York Scientific Data Summit (NYSDS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130219529","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":"Simulating 0+1 Dimensional Quantum Gravity on Quantum Computers: Mini-Superspace Quantum Cosmology and the World Line Approach in Quantum Field Theory","authors":"C. D. Kocher, M. McGuigan","doi":"10.1109/NYSDS.2018.8538963","DOIUrl":"https://doi.org/10.1109/NYSDS.2018.8538963","url":null,"abstract":"Quantum computers are promising candidates to radically expand the domain of computational science by their increased computing power and more effective algorithms. In particular, quantum computing could have a tremendous impact on the field of quantum cosmology. The goal of quantum cosmology is to describe the evolution of the universe through the Wheeler-DeWitt equation or path integral methods without having to first formulate a full theory of quantum gravity. The quantum computer provides an advantage in this endeavor because it can perform path integrals directly in Lorentzian space and does not require constructing contour integrations in Euclidean gravity. Also, quantum computers can provide advantages in systems with fermions which are difficult to simulate on classical computers. In this study, we first employed classical computational methods to analyze a Friedmann-Robertson-Walker mini-superspace with a scalar field and visualize the calculated wavefunction of the universe for a variety of different values of the curvature of the universe and the cosmological constant. We then used IBM’s Quantum Information Science Kit Python library and the variational quantum eigensolver algorithm to study the same systems on a quantum computer. The framework was extended to the world line approach to quantum field theory.","PeriodicalId":366010,"journal":{"name":"2018 New York Scientific Data Summit (NYSDS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129652944","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":"Quantum Computation and Visualization of Hamiltonians using Discrete Quantum Mechanics and IBM QISKit","authors":"R. Miceli, M. McGuigan","doi":"10.1109/NYSDS.2018.8538959","DOIUrl":"https://doi.org/10.1109/NYSDS.2018.8538959","url":null,"abstract":"Quantum computers have the potential to transform the ways in which we tackle some important problems. The efforts by companies like Google, IBM and Microsoft to construct quantum computers have been making headlines for years. Equally important is the challenge of translating problems into a state that can be fed to these machines. Because quantum computers are in essence controllable quantum systems, the problems that most naturally map to them are those of quantum mechanics. Quantum chemistry has seen particular success in the form of the variational quantum eigensolver (VQE) algorithm, which is used to determine the ground state energy of molecular systems. The goal of our work has been to use the matrix formulation of quantum mechanics to translate other systems so that they can be run through this same algorithm. We describe two ways of accomplishing this using a position basis approach and a Gaussian basis approach. We use this translation to compute finite temperature quantities such as the average energy as a function of temperature. We do this by constructing a 0+1 dimensional thermal field theory, constructing a thermal double of the system and using tensor products to construct operators in the system coupled to a heat bath. We also discuss how to include a chemical potential in the quantum computations. We then connect the 0+1 formalism to gauge theory by using an effective matrix model description used in nuclear theory. We study effective potentials for components of the gauge field and use the VQE algorithm to calculate the ground state energies. We also visualize the wave functions from the eigensolver and make comparisons to theoretical results obtained with continuous operators.","PeriodicalId":366010,"journal":{"name":"2018 New York Scientific Data Summit (NYSDS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122204861","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}
Zhihua Dong, Yao-Lung L. Fang, Xiaojing Huang, Hanfei Yan, S. Ha, W. Xu, Y. Chu, S. Campbell, Meifeng Lin
{"title":"High-Performance Multi-Mode Ptychography Reconstruction on Distributed GPUs","authors":"Zhihua Dong, Yao-Lung L. Fang, Xiaojing Huang, Hanfei Yan, S. Ha, W. Xu, Y. Chu, S. Campbell, Meifeng Lin","doi":"10.1109/NYSDS.2018.8538964","DOIUrl":"https://doi.org/10.1109/NYSDS.2018.8538964","url":null,"abstract":"Ptychography is an emerging imaging technique that is able to provide wavelength-limited spatial resolution from specimen with extended lateral dimensions. As a scanning microscopy method, a typical two-dimensional image requires a number of data frames. As a diffraction-based imaging technique, the real-space image has to be recovered through iterative reconstruction algorithms. Due to these two inherent aspects, a ptychographic reconstruction is generally a computation-intensive and time-consuming process, which limits the throughput of this method. We report an accelerated version of the multi-mode difference map algorithm for ptychography reconstruction using multiple distributed GPUs. This approach leverages available scientific computing packages in Python, including mpi4py and PyCUDA, with the core computation functions implemented in CUDA C. We find that interestingly even with MPI collective communications, the weak scaling in the number of GPU nodes can still remain nearly constant. Most importantly, for realistic diffraction measurements, we observe a speedup ranging from a factor of 10 to 103 depending on the data size, which reduces the reconstruction time remarkably from hours to typically about 1 minute and is thus critical for real-time data processing and visualization.","PeriodicalId":366010,"journal":{"name":"2018 New York Scientific Data Summit (NYSDS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116661862","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":"Optimal Bayesian Classification When the Training Observations are Serially Dependent","authors":"A. Zollanvari, E. Dougherty","doi":"10.1109/NYSDS.2018.8538943","DOIUrl":"https://doi.org/10.1109/NYSDS.2018.8538943","url":null,"abstract":"In this study, we construct the optimal Bayesian classifier (OBC) when the training observations are serially dependent. To model the effect of dependency, we assume the training observations are generated from VAR(p), which is a multi-dimensional vector autoregressive process of order p.","PeriodicalId":366010,"journal":{"name":"2018 New York Scientific Data Summit (NYSDS)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129462187","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":"Predicting Available Computer Resources in Supercomputers","authors":"Peggy Yin, Chenxiao Xu, S. Panitkin, Shinjae Yoo","doi":"10.1109/NYSDS.2018.8538961","DOIUrl":"https://doi.org/10.1109/NYSDS.2018.8538961","url":null,"abstract":"To maximize efficiency, the workload management system of a supercomputer must be able to process a multitude of job requests at a given time. The application of data processing techniques shows it is possible to predict node availability. The high error and variance of such predictions can be eliminated through the utilization of machine learning methods. Implementation of accurate predictions leads to more productive supercomputing systems, accelerating the pace of groundbreaking scientific discovery.","PeriodicalId":366010,"journal":{"name":"2018 New York Scientific Data Summit (NYSDS)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114077421","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}
Deil Cho, Arfath Parsha, Shinjae Yoo, Susan Pepper, Yonggang Cui
{"title":"A Survey of Logstash for Indexing Bioinformatics Data","authors":"Deil Cho, Arfath Parsha, Shinjae Yoo, Susan Pepper, Yonggang Cui","doi":"10.1109/NYSDS.2018.8538952","DOIUrl":"https://doi.org/10.1109/NYSDS.2018.8538952","url":null,"abstract":"EXTENDED ABSTRACT","PeriodicalId":366010,"journal":{"name":"2018 New York Scientific Data Summit (NYSDS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115988581","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":"Visualization and Simulation of Carbon Structures with Higher Genus","authors":"B. T. Ortega, M. McGuigan","doi":"10.1109/NYSDS.2018.8538945","DOIUrl":"https://doi.org/10.1109/NYSDS.2018.8538945","url":null,"abstract":"The Computational Science Initiative (CSI) department at Brookhaven National Laboratory involves varied and interdisciplinary work through out all sciences. In particular, we worked within the realm of computational chemistry through the means of studying carbon nanotori structures via their visualization and simulation. Compounds like graphene and other carbon allotropes, such as the nanotorus, have been in the eye of scientists for several years due to their unique polyhex structures which provide unique topologies and therefore possibly unique material properties. C++ code to generate Cartesian coordinates for an arbitrary torus was utilized to allow the use of molecular editing and modeling programs, such as Avogadro or Visual Molecular Dynamics (VMD) to design multiple genus nanocarbon toroidal structures. Several files were generated that contained multiple genus to them, namely a double torus, triple torus, and quadruple torus, all based off of a single genus carbon nanotorus from previous said code. Bond angle information was then utilized through.report files generated from structures files (.xyz or.cml) to allow for vertices and thereby neighboring atoms to the vertices to be identified. With these identified atoms for the above multiple genus structures, as well as for the C240 buckyball fullerene and carbon nanotorus, we wrote C++ code to generate an adjacency matrix for each respective one. These matrices were then subsequently used to generate eigenvalues and eigenvectors through a Mathmatica function for each structure. Using these values we can study the energies of these systems and thereby its functionalities and properties.","PeriodicalId":366010,"journal":{"name":"2018 New York Scientific Data Summit (NYSDS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129520971","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":"Initial Experiments on Improving Seismic Data Inversion with Deep Learning","authors":"Lei Huang, M. Polanco, T. Clee","doi":"10.1109/NYSDS.2018.8538956","DOIUrl":"https://doi.org/10.1109/NYSDS.2018.8538956","url":null,"abstract":"The main objective of the work is to explore if deep learning can facilitate the seismic data inversion problem. The paper describes the challenges of seismic Full Waveform Inversion (FWI) process, and presents our method of creating a deep learning model into the FWI workflow. The paper presents the initial findings of the research in enhancing the FWI iterative optimization process. These initial findings demonstrate that deep learning is able to help physics-based solution by improving its numerical optimization.","PeriodicalId":366010,"journal":{"name":"2018 New York Scientific Data Summit (NYSDS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127618648","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}
Alireza Karbalayghareh, Xiaoning Qian, E. Dougherty
{"title":"Optimal Bayesian Transfer Learning for Classifying Multivariate Gaussian Observations","authors":"Alireza Karbalayghareh, Xiaoning Qian, E. Dougherty","doi":"10.1109/NYSDS.2018.8538958","DOIUrl":"https://doi.org/10.1109/NYSDS.2018.8538958","url":null,"abstract":"The fundamental assumption to guarantee the generalizability of traditional machine learning methods is that there are sufficient data for training, assumed to be independently sampled with the identical underlying distribution as the future data to test. However, in many real-world applications involving complex systems, we may not have sufficient data or the collected data may manifest heterogeneity. In either case, the cross-cutting question is when and how we may “transfer” the “surrogate” knowledge and data from well-characterized systems (source) to a target system of interest, to improve the predictive power of machine learning methods for the target.","PeriodicalId":366010,"journal":{"name":"2018 New York Scientific Data Summit (NYSDS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114992742","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}