Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (5)
- Theory and Algorithms (5)
- Engineering (4)
- OS and Networks (4)
- Other Computer Sciences (4)
-
- Social and Behavioral Sciences (4)
- Information Security (3)
- Library and Information Science (3)
- Archival Science (2)
- Artificial Intelligence and Robotics (2)
- Computer Engineering (2)
- Software Engineering (2)
- Biomedical Engineering and Bioengineering (1)
- Child Psychology (1)
- Computational Biology (1)
- Data Science (1)
- Digital Communications and Networking (1)
- Genetics and Genomics (1)
- Genomics (1)
- Graphics and Human Computer Interfaces (1)
- Law Librarianship (1)
- Life Sciences (1)
- Medical Specialties (1)
- Medicine and Health Sciences (1)
- Nanoscience and Nanotechnology (1)
- Neurosurgery (1)
- Numerical Analysis and Scientific Computing (1)
- Physics (1)
- Institution
Articles 1 - 18 of 18
Full-Text Articles in Physical Sciences and Mathematics
Deeppatent2: A Large-Scale Benchmarking Corpus For Technical Drawing Understanding, Kehinde Ajayi, Xin Wei, Martin Gryder, Winston Shields, Jian Wu, Shawn M. Jones, Michal Kucer, Diane Oyen
Deeppatent2: A Large-Scale Benchmarking Corpus For Technical Drawing Understanding, Kehinde Ajayi, Xin Wei, Martin Gryder, Winston Shields, Jian Wu, Shawn M. Jones, Michal Kucer, Diane Oyen
Computer Science Faculty Publications
Recent advances in computer vision (CV) and natural language processing have been driven by exploiting big data on practical applications. However, these research fields are still limited by the sheer volume, versatility, and diversity of the available datasets. CV tasks, such as image captioning, which has primarily been carried out on natural images, still struggle to produce accurate and meaningful captions on sketched images often included in scientific and technical documents. The advancement of other tasks such as 3D reconstruction from 2D images requires larger datasets with multiple viewpoints. We introduce DeepPatent2, a large-scale dataset, providing more than 2.7 million …
Charged Track Reconstruction With Artificial Intelligence For Clas12, Gagik Gavalian, Polykarpos Thomadakis, Angelos Angelopoulos, Nikos Chrisochoides
Charged Track Reconstruction With Artificial Intelligence For Clas12, Gagik Gavalian, Polykarpos Thomadakis, Angelos Angelopoulos, Nikos Chrisochoides
Computer Science Faculty Publications
In this paper, we present the results of charged particle track reconstruction in CLAS12 using artificial intelligence. In our approach, we use neural networks working together to identify tracks based on the raw signals in the Drift Chambers. A Convolutional Auto-Encoder is used to de-noise raw data by removing the hits that do not satisfy the patterns for tracks, and second Multi-Layer Perceptron is used to identify tracks from combinations of clusters in the drift chambers. Our method increases the tracking efficiency by 50% for multi-particle final states already conducted experiments. The de-noising results indicate that future experiments can run …
A Structure-Aware Generative Adversarial Network For Bilingual Lexicon Induction, Bocheng Han, Qian Tao, Lusi Li, Zhihao Xiong
A Structure-Aware Generative Adversarial Network For Bilingual Lexicon Induction, Bocheng Han, Qian Tao, Lusi Li, Zhihao Xiong
Computer Science Faculty Publications
Bilingual lexicon induction (BLI) is the task of inducing word translations with a learned mapping function that aligns monolingual word embedding spaces in two different languages. However, most previous methods treat word embeddings as isolated entities and fail to jointly consider both the intra-space and inter-space topological relations between words. This limitation makes it challenging to align words from embedding spaces with distinct topological structures, especially when the assumption of isomorphism may not hold. To this end, we propose a novel approach called the Structure-Aware Generative Adversarial Network (SA-GAN) model to explicitly capture multiple topological structure information to achieve accurate …
Comparison Of Physics-Based Deformable Registration Methods For Image-Guided Neurosurgery, Nikos Chrisochoides, Yixun Liu, Fotis Drakopoulos, Andriy Kot, Panos Foteinos, Christos Tsolakis, Emmanuel Billias, Olivier Clatz, Nicholas Ayache, Andrey Fedorov, Alex Golby, Peter Black, Ron Kikinis
Comparison Of Physics-Based Deformable Registration Methods For Image-Guided Neurosurgery, Nikos Chrisochoides, Yixun Liu, Fotis Drakopoulos, Andriy Kot, Panos Foteinos, Christos Tsolakis, Emmanuel Billias, Olivier Clatz, Nicholas Ayache, Andrey Fedorov, Alex Golby, Peter Black, Ron Kikinis
Computer Science Faculty Publications
This paper compares three finite element-based methods used in a physics-based non-rigid registration approach and reports on the progress made over the last 15 years. Large brain shifts caused by brain tumor removal affect registration accuracy by creating point and element outliers. A combination of approximation- and geometry-based point and element outlier rejection improves the rigid registration error by 2.5 mm and meets the real-time constraints (4 min). In addition, the paper raises several questions and presents two open problems for the robust estimation and improvement of registration error in the presence of outliers due to sparse, noisy, and incomplete …
Factors Affecting Student Educational Choices Regarding Oer Material In Computer Science, Anastasia Angelopoulou, Rania Hodhod, Alfredo J. Perez
Factors Affecting Student Educational Choices Regarding Oer Material In Computer Science, Anastasia Angelopoulou, Rania Hodhod, Alfredo J. Perez
Computer Science Faculty Publications
The use of Open Educational Resources (OER) in course settings provides a solution to reduce the textbook barrier. Several published studies have concluded that high textbook costs may influence students' educational choices. However, there are other student characteristics that may be relevant to OER. In this work, we study various factors that may influence students' educational choices regarding OER and their impact on a student’s perspectives on OER use and quality. More specifically, we investigate whether there are significant differences in the frequency of use and perceived quality of the OER textbook based on gender, prior academic achievements, income, seniority, …
The Dsa Toolkit Shines Light Into Dark And Stormy Archives, Shawn Morgan Jones, Himarsha R. Jayanetti, Alex Osborne, Paul Koerbin, Klein Martin, Michele C. Weigle, Michael L. Nelson
The Dsa Toolkit Shines Light Into Dark And Stormy Archives, Shawn Morgan Jones, Himarsha R. Jayanetti, Alex Osborne, Paul Koerbin, Klein Martin, Michele C. Weigle, Michael L. Nelson
Computer Science Faculty Publications
Web archive collections are created with a particular purpose in mind. A curator selects seeds, or original resources, which are then captured by an archiving system and stored as archived web pages, or mementos. The systems that build web archive collections are often configured to revisit the same original resource multiple times. This is incredibly useful for understanding an unfolding news story or the evolution of an organization. Unfortunately, over time, some of these original resources can go off-topic and no longer suit the purpose for which the collection was originally created. They can go off-topic due to web site …
Analysis Of Subtelomeric Rextal Assemblies Using Quast, Tunazzina Islam, Desh Ranjan, Mohammad Zubair, Eleanor Young, Ming Xiao, Harold Riethman
Analysis Of Subtelomeric Rextal Assemblies Using Quast, Tunazzina Islam, Desh Ranjan, Mohammad Zubair, Eleanor Young, Ming Xiao, Harold Riethman
Computer Science Faculty Publications
Genomic regions of high segmental duplication content and/or structural variation have led to gaps and misassemblies in the human reference sequence, and are refractory to assembly from whole-genome short-read datasets. Human subtelomere regions are highly enriched in both segmental duplication content and structural variations, and as a consequence are both impossible to assemble accurately and highly variable from individual to individual. Recently, we developed a pipeline for improved region-specific assembly called Regional Extension of Assemblies Using Linked-Reads (REXTAL). In this study, we evaluate REXTAL and genome-wide assembly (Supernova) approaches on 10X Genomics linked-reads data sets partitioned and barcoded using the …
Experiential Learning In The Technology Disciplines February 2020, Patricia Sendall, Christopher S. Stuetzle, Zachary A. Kissel, Tahir Hameed
Experiential Learning In The Technology Disciplines February 2020, Patricia Sendall, Christopher S. Stuetzle, Zachary A. Kissel, Tahir Hameed
Computer Science Faculty Publications
Learning-by-doing has long been a tradition in the technology disciplines. It is the "hands-on" work, combined with student reflection, feedback and assessment, that reinforces theory into practice. Over the past 40 years, experiential learning (EL) in higher education has grown beyond in-class assignments to include internships, cooperative education, team-based learning, project-based learning, community engagement, service learning, international and study-away experiences, capstone projects and research opportunities. This paper provides an overview of experiential education theory and practice in the undergraduate technology disciplines, and presents examples of how experiential learning practices have evolved over time at a medium-sized institution in the Northeast …
Sec-Lib: Protecting Scholarly Digital Libraries From Infected Papers Using Active Machine Learning Framework, Nir Nissim, Aviad Cohen, Jian Wu, Andrea Lanzi, Lior Rokach, Yuval Elovici, Lee Giles
Sec-Lib: Protecting Scholarly Digital Libraries From Infected Papers Using Active Machine Learning Framework, Nir Nissim, Aviad Cohen, Jian Wu, Andrea Lanzi, Lior Rokach, Yuval Elovici, Lee Giles
Computer Science Faculty Publications
Researchers from academia and the corporate-sector rely on scholarly digital libraries to access articles. Attackers take advantage of innocent users who consider the articles' files safe and thus open PDF-files with little concern. In addition, researchers consider scholarly libraries a reliable, trusted, and untainted corpus of papers. For these reasons, scholarly digital libraries are an attractive-target and inadvertently support the proliferation of cyber-attacks launched via malicious PDF-files. In this study, we present related vulnerabilities and malware distribution approaches that exploit the vulnerabilities of scholarly digital libraries. We evaluated over two-million scholarly papers in the CiteSeerX library and found the library …
A Survey Of Attention Deficit Hyperactivity Disorder Identification Using Psychophysiological Data, S. De Silva, S. Dayarathna, G. Ariyarathne, D. Meedeniya, Sampath Jayarathna
A Survey Of Attention Deficit Hyperactivity Disorder Identification Using Psychophysiological Data, S. De Silva, S. Dayarathna, G. Ariyarathne, D. Meedeniya, Sampath Jayarathna
Computer Science Faculty Publications
Attention Deficit Hyperactivity Disorder (ADHD) is one of the most common neurological disorders among children, that affects different areas in the brain that allows executing certain functionalities. This may lead to a variety of impairments such as difficulties in paying attention or focusing, controlling impulsive behaviours and overreacting. The continuous symptoms may have a severe impact in the long-term. This paper explores the ADHD identification studies using eye movement data and functional Magnetic Resonance Imaging (fMRI). This study discusses different machine learning techniques, existing models and analyses the existing literature. We have identified the current challenges and possible future directions …
Pedagogical Possibilities For The 2048 Puzzle Game, Todd W. Neller
Pedagogical Possibilities For The 2048 Puzzle Game, Todd W. Neller
Computer Science Faculty Publications
In this paper, we describe an engaging puzzle game called 2048 and outline a variety of exercises that can leverage the game’s popularity to engage student interest, reinforce core CS concepts, and excite student curiosity towards undergraduate research. Exercises range in difficulty from CS1-level exercises suitable for exercising and assessing 1D and 2D array skills to empirical undergraduate research in Monte Carlo Tree Search methods and skilled heuristic evaluation design.
Moved But Not Gone: An Evaluation Of Real-Time Methods For Discovering Replacement Web Pages, Martin Klein, Michael L. Nelson
Moved But Not Gone: An Evaluation Of Real-Time Methods For Discovering Replacement Web Pages, Martin Klein, Michael L. Nelson
Computer Science Faculty Publications
Inaccessible Web pages and 404 “Page Not Found” responses are a common Web phenomenon and a detriment to the user’s browsing experience. The rediscovery of missing Web pages is, therefore, a relevant research topic in the digital preservation as well as in the Information Retrieval realm. In this article, we bring these two areas together by analyzing four content- and link-based methods to rediscover missing Web pages. We investigate the retrieval performance of the methods individually as well as their combinations and give an insight into how effective these methods are over time. As the main result of this work, …
Emergent Behavior In Massively-Deployed Sensor Networks, Ekaterina Shurkova, Ruzana Ishak, Stephan Olariu, Shaharuddin Salleh
Emergent Behavior In Massively-Deployed Sensor Networks, Ekaterina Shurkova, Ruzana Ishak, Stephan Olariu, Shaharuddin Salleh
Computer Science Faculty Publications
The phenomenal advances in MEMS and nanotechnology make it feasible to build small devices, referred to as sensors that are able to sense, compute and communicate over small distances. The massive deployment of these small devices raises the fascinating question of whether or not the sensors, as a collectivity, will display emergent behavior, just as living organisms do. In this work we report on a recent effort intended to observe emerging behavior of large groups of sensor nodes, like living cells demonstrate. Imagine a massive deployment of sensors that can be in two states "red" and "blue". At deployment time …
Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Computer Science Faculty Publications
Existing methods of measuring lifetimes in P2P systems usually rely on the so-called create-based method (CBM), which divides a given observation window into two halves and samples users "created" in the first half every Delta time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we flrst derive a model for CBM and show that small window size or large Delta may lead to highly inaccurate lifetime distributions. We then show that create-based sampling exhibits an inherent …
On Node Isolation Under Churn In Unstructured P2p Networks With Heavy-Tailed Lifetimes, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
On Node Isolation Under Churn In Unstructured P2p Networks With Heavy-Tailed Lifetimes, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Computer Science Faculty Publications
Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-selection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared to uniform selection of neighbors. In fact, the second strategy based on random walks on age-weighted graphs demonstrates that for lifetimes with infinite variance, the system …
Modeling Heterogeneous User Churn And Local Resilience Of Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov, Xiaoming Wang
Modeling Heterogeneous User Churn And Local Resilience Of Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov, Xiaoming Wang
Computer Science Faculty Publications
Previous analytical results on the resilience of unstructured P2P systems have not explicitly modeled heterogeneity of user churn (i.e., difference in online behavior) or the impact of in-degree on system resilience. To overcome these limitations, we introduce a generic model of heterogeneous user churn, derive the distribution of the various metrics observed in prior experimental studies (e.g., lifetime distribution of joining users, joint distribution of session time of alive peers, and residual lifetime of a randomly selected user), derive several closed-form results on the transient behavior of in-degree, and eventually obtain the joint in/out degree isolation probability as a simple …
On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Computer Science Faculty Publications
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affect the resilience of such graphs. We start by applying classical results from random graph theory to show that a large variety of deterministic and random P2P graphs almost surely (i.e., with probability 1-o(1)) remain connected under random failure if and only if they have no isolated nodes. This simple, yet powerful, result subsequently allows us to derive in closed-form the probability that a P2P network develops isolated nodes, and therefore partitions, …
Time- And Cost-Optimal Parallel Algorithms For The Dominance And Visibility Graphs, D. Bhagavathi, H. Gurla, S. Olariu, J. L. Schwing, J. Zhang
Time- And Cost-Optimal Parallel Algorithms For The Dominance And Visibility Graphs, D. Bhagavathi, H. Gurla, S. Olariu, J. L. Schwing, J. Zhang
Computer Science Faculty Publications
The compaction step of integrated circuit design motivates associating several kinds of graphs with a collection of non-overlapping rectangles in the plane. These graphs are intended to capture various visibility relations amongst the rectangles in the collection. The contribution of this paper is to propose time- and cost-optimal algorithms to construct two such graphs, namely, the dominance graph (DG, for short) and the visibility graph (VG, for short). Specifically, we show that with a collection of n non-overlapping rectangles as input, both these structures can be constructed in θ (log n) time using n processors in the CREW model.