Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Graphics and Human Computer Interfaces (135)
- Artificial Intelligence and Robotics (124)
- Other Computer Sciences (114)
- Engineering (107)
- Social and Behavioral Sciences (103)
-
- Databases and Information Systems (95)
- Medicine and Health Sciences (84)
- Theory and Algorithms (79)
- Life Sciences (59)
- OS and Networks (57)
- Computer Engineering (55)
- Library and Information Science (53)
- Numerical Analysis and Scientific Computing (52)
- Digital Communications and Networking (41)
- Information Security (40)
- Systems Architecture (40)
- Software Engineering (31)
- Genetics and Genomics (29)
- Data Science (26)
- Education (25)
- Arts and Humanities (22)
- Archival Science (21)
- Applied Mathematics (20)
- Computational Biology (20)
- Programming Languages and Compilers (20)
- Anatomy (19)
- Medical Specialties (19)
- Business (18)
- Institution
-
- Old Dominion University (391)
- University of Texas Rio Grande Valley (175)
- University of Dayton (108)
- University of Nebraska at Omaha (83)
- University of Kentucky (39)
-
- West Chester University (34)
- University of Montana (32)
- Gettysburg College (27)
- Connecticut College (12)
- Western Kentucky University (9)
- College of Saint Benedict and Saint John's University (5)
- Bowling Green State University (4)
- Bridgewater State University (3)
- Cleveland State University (2)
- Fort Hays State University (2)
- LSU New Orleans (1)
- University of North Dakota (1)
- Keyword
-
- Deep learning (40)
- Machine learning (31)
- Digital libraries (24)
- Artificial intelligence (23)
- Neural networks (20)
-
- Computer science (19)
- Algorithms (18)
- Blockchain (14)
- Web archives (14)
- Humans (13)
- Answer set programming (12)
- Security (12)
- Web archiving (12)
- Classification (11)
- Information retrieval (11)
- Privacy (11)
- Graph theory (10)
- Training (10)
- Mesh generation (9)
- Screen reader (9)
- Secondary structure (9)
- Semantics (9)
- Blind (8)
- Digital preservation (8)
- Eye tracking (8)
- Image (8)
- Information systems (8)
- Memento (8)
- Metadata (8)
- Natural language processing (8)
- Publication Year
- File Type
Articles 751 - 780 of 928
Full-Text Articles in Computer Sciences
A Straightforward Path Routing In Wireless Ad Hoc Sensor Networks, Zhen Jiang, Junchao Ma, Wei Lou, Jie Wu
A Straightforward Path Routing In Wireless Ad Hoc Sensor Networks, Zhen Jiang, Junchao Ma, Wei Lou, Jie Wu
Computer Science Faculty Publications
No abstract provided.
Composing Analysis Patterns To Build Complex Models: Flight Reservation, Zhen Jiang, Eduardo B. Fernandez
Composing Analysis Patterns To Build Complex Models: Flight Reservation, Zhen Jiang, Eduardo B. Fernandez
Computer Science Faculty Publications
No abstract provided.
Sink-Anonymity Mobility Control In Wireless Sensor Networks, Qijun Gu, Xiao Chen, Zhen Jiang, Jie Wu
Sink-Anonymity Mobility Control In Wireless Sensor Networks, Qijun Gu, Xiao Chen, Zhen Jiang, Jie Wu
Computer Science Faculty Publications
No abstract provided.
Multicast Encryption Infrastructure For Security In Sensor Networks, Richard R. Brooks, Brijesh Pillai, Matthew Pirretti, Michele C. Weigle
Multicast Encryption Infrastructure For Security In Sensor Networks, Richard R. Brooks, Brijesh Pillai, Matthew Pirretti, Michele C. Weigle
Computer Science Faculty Publications
Designing secure sensor networks is difficult. We propose an approach that uses multicast communications and requires fewer encryptions than pairwise communications. The network is partitioned into multicast regions; each region is managed by a sensor node chosen to act as a keyserver. The keyservers solicit nodes in their neighborhood to join the local multicast tree. The keyserver generates a binary tree of keys to maintain communication within the multicast region using a shared key. Our approach supports a distributed key agreement protocol that identifies the compromised keys and supports membership changes with minimum system overhead. We evaluate the overhead of …
Evaluating Multicore Algorithms On The Unified Memory Model, John E. Savage, Mohammad Zubair
Evaluating Multicore Algorithms On The Unified Memory Model, John E. Savage, Mohammad Zubair
Computer Science Faculty Publications
One of the challenges to achieving good performance on multicore architectures is the effective utilization of the underlying memory hierarchy. While this is an issue for single-core architectures, it is a critical problem for multicore chips. In this paper, we formulate the unified multicore model (UMM) to help understand the fundamental limits on cache performance on these architectures. The UMM seamlessly handles different types of multiple-core processors with varying degrees of cache sharing at different levels. We demonstrate that our model can be used to study a variety of multicore architectures on a variety of applications. In particular, we use …
Everyone Is A Curator: Human-Assisted Preservation For Ore Aggregations, Frank Mccown, Michael L. Nelson, Herbert Van De Sompel
Everyone Is A Curator: Human-Assisted Preservation For Ore Aggregations, Frank Mccown, Michael L. Nelson, Herbert Van De Sompel
Computer Science Faculty Publications
The Open Archives Initiative (OAI) has recently created the Object Reuse and Exchange (ORE) project that defines Resource Maps (ReMs) for describing aggregations of web resources. These aggregations are susceptible to many of the same preservation challenges that face other web resources. In this paper, we investigate how the aggregations of web resources can be preserved outside of the typical repository environment and instead rely on the thousands of interactive users in the web community and the Web Infrastructure (the collection of web archives, search engines, and personal archiving services) to facilitate preservation. Inspired by Web 2.0 services such as …
Correlation Of Music Charts And Search Engine Rankings, Martin Klein, Olena Hunsicker, Michael Nelson
Correlation Of Music Charts And Search Engine Rankings, Martin Klein, Olena Hunsicker, Michael Nelson
Computer Science Faculty Publications
We investigate the question whether expert rankings of real-world entities correlate with search engine (SE) rankings of corresponding web resources. We compare Billboards "Hot 100 Airplay" music charts with SE rankings of associated web resources. Out of nine comparisons we found two strong, two moderate, two weak and one negative correlation. The remaining two comparisons were inconclusive.
Object Reuse And Exchange, Michael L. Nelson, Carl Lagoze, Herbert Van De Sompel, Pete Johnston, Robert Sanderson, Simeon Warner, Jürgen Sieck (Ed.), Michael A. Herzog (Ed.)
Object Reuse And Exchange, Michael L. Nelson, Carl Lagoze, Herbert Van De Sompel, Pete Johnston, Robert Sanderson, Simeon Warner, Jürgen Sieck (Ed.), Michael A. Herzog (Ed.)
Computer Science Faculty Publications
The Open Archives Object Reuse and Exchange (OAI-ORE) project defines standards for the description and exchange of aggregations of Web resources. The OAI-ORE abstract data model is conformant with the Architecture of the World Wide Web and leverages concepts from the Semantic Web, including RDF descriptions and Linked Data. In this paper we provide a brief review of a motivating example and its serialization in Atom.
On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Zhongmei Yao, Derek Leonard, Xiaoming Wang, Dmitri Loguinov
On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Zhongmei Yao, Derek Leonard, 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 …
S-Means: Similarity Driven Clustering And Its Application In Gravitational-Wave Astronomy Data Mining, Hansheng Lei, Lappoon R. Tang, Juan R. Iglesias, Soma Mukherjee, Soumya Mohanty
S-Means: Similarity Driven Clustering And Its Application In Gravitational-Wave Astronomy Data Mining, Hansheng Lei, Lappoon R. Tang, Juan R. Iglesias, Soma Mukherjee, Soumya Mohanty
Computer Science Faculty Publications
Clustering is to classify unlabeled data into groups. It has been well researched for decades in many disciplines. Clustering in massive amount of astronomical data generated by multi-sensor networks has become an emerging new challenge; assumptions in many existing clustering algorithms are often violated in these domains. For example, K means implicitly assumes that underlying distribution of data is Gaussian. Such an assumption is not necessarily observed in astronomical data. Another problem is the determination of K, which is hard to decide when prior knowledge is lacking. While there has been work done on discovering the proper value for K …
Cluster Analysis Of Simulated Gravitationalwave Triggers Using S-Means And Constrained Validation Clustering, Lappoon R. Tang, Hansheng Lei, Soma Mukherjee, Soumya Mohanty
Cluster Analysis Of Simulated Gravitationalwave Triggers Using S-Means And Constrained Validation Clustering, Lappoon R. Tang, Hansheng Lei, Soma Mukherjee, Soumya Mohanty
Computer Science Faculty Publications
The fifth Science run of LIGO (S5) has been concluded recently. The data collected over two years of the run calls for a thorough analysis of the glitches seen in the gravitational wave channels, as well as in the auxiliary and environmental channels. The study presents two new techniques for cluster analysis of gravitational wave burst triggers. Traditional approaches to clustering treats the problem as an optimization problem in an “open” search space of clustering models. However, this can lead to problems with producing models that over-fit or under-fit the data as the search is stuck on local minima. The …
Collecting Open Source Intelligence Via Tailored Information Delivery Systems, William Sousan, Qiuming Zhu, Ryan Nickell, William Mahoney, Peter Hospodka
Collecting Open Source Intelligence Via Tailored Information Delivery Systems, William Sousan, Qiuming Zhu, Ryan Nickell, William Mahoney, Peter Hospodka
Computer Science Faculty Publications
The Internet offers a plethora of freely available information for possible use in Open Source Intelligence (OSINT) operations. However, along with this information come challenges in finding relevant information and overcoming information overload. This paper presents the results of an ongoing research in a Tailored Information Delivery Services (TIDS) system that aids users in retrieving relevant information through various open intelligence sources. The TIDS provides a semantics-based query constructor that operates in a “What You Get is What You Need (WYGIWYNTM)” fashion and builds ontology based information tagging, theme extractor, and contextual model.
Benchmark Experiments For Higher-Order And Full-Stokes Ice Sheet Models (Ismip-Hom), F. Pattyn, L. Perichon, A. Aschwanden, B. Breuer, B. De Smedt, O. Gagliardini, G. H. Gudmundsson, R. C. A. Hindmarsh, A. Hubbard, Jesse V. Johnson, T. Kleiner, Y. Konovalov, C. Martin, A. J. Payne, D. Pollard, S. Price, M. Rückamp, F. Saito, O. Soucek, S. Sugiyama, T. Zwinger
Benchmark Experiments For Higher-Order And Full-Stokes Ice Sheet Models (Ismip-Hom), F. Pattyn, L. Perichon, A. Aschwanden, B. Breuer, B. De Smedt, O. Gagliardini, G. H. Gudmundsson, R. C. A. Hindmarsh, A. Hubbard, Jesse V. Johnson, T. Kleiner, Y. Konovalov, C. Martin, A. J. Payne, D. Pollard, S. Price, M. Rückamp, F. Saito, O. Soucek, S. Sugiyama, T. Zwinger
Computer Science Faculty Publications
We present the results of the first ice sheet model inter comparison project for higher-order and full-Stokes ice sheet models. These models are compared and verified in a series of six experiments of which one has an analytical solution obtained from a perturbation analysis. The experiments are applied to both 2-D and 3-D geometries; five experiments are steady-state diagnostic, and one has a time dependent prognostic solution. All participating models give results that are in close agreement. A clear distinction can be made between higher-order models and those that solve the full system of equations. The full-Stokes models show a …
Link Lifetimes And Randomized Neighbor Selection In Dhts, Zhongmei Yao, Dmitri Loguinov
Link Lifetimes And Randomized Neighbor Selection In Dhts, Zhongmei Yao, Dmitri Loguinov
Computer Science Faculty Publications
Several models of user churn, resilience, and link lifetime have recently appeared in the literature [12], [13], [34], [35]; however, these results do not directly apply to classical Distributed Hash Tables (DHTs) in which neighbor replacement occurs not only when current users die, but also when new user arrive into the system, and where replacement choices are often restricted to the successor of the failed zone in the DHT space. To understand neighbor churn in such networks, this paper proposes a simple, yet accurate, model for capturing link dynamics in structured P2P systems and obtains the distribution of link lifetimes …
Symbolic Links In The Open Directory Project, Saverio Perugini
Symbolic Links In The Open Directory Project, Saverio Perugini
Computer Science Faculty Publications
We present a study to develop an improved understanding of symbolic links in web directories. A symbolic link is a hyperlink that makes a directed connection from a web page along one path through a directory to a page along another path. While symbolic links are ubiquitous in web directories such as Yahoo!, they are under-studied, and as a result, their uses are poorly understood. A cursory analysis of symbolic links reveals multiple uses: to provide navigational shortcuts deeper into a directory, backlinks to more general categories, and multiclassification. We investigated these uses in the Open Directory Project (ODP), the …
The Online Transportation Problem: On The Exponential Boost Of One Extra Server, Christine Chung, Patchrawat Uthaisombut, Kirk Pruhs
The Online Transportation Problem: On The Exponential Boost Of One Extra Server, Christine Chung, Patchrawat Uthaisombut, Kirk Pruhs
Computer Science Faculty Publications
No abstract provided.
The Price Of Stochastic Anarchy, Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth
The Price Of Stochastic Anarchy, Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth
Computer Science Faculty Publications
No abstract provided.
Quick Convergence Mobility Control Schemes In Wireless Sensor Networks, Xiao Chen, Zhen Jiang, Jie Wu
Quick Convergence Mobility Control Schemes In Wireless Sensor Networks, Xiao Chen, Zhen Jiang, Jie Wu
Computer Science Faculty Publications
No abstract provided.
An Information Model For Geographic Greedy Forwarding In Wireless Ad-Hoc Sensor Networks, Zhen Jiang, Junchao Ma, Wei Lou, Jie Wu
An Information Model For Geographic Greedy Forwarding In Wireless Ad-Hoc Sensor Networks, Zhen Jiang, Junchao Ma, Wei Lou, Jie Wu
Computer Science Faculty Publications
No abstract provided.
Mobility Control For Complete Coverage In Wireless Sensor Networks, Zhen Jiang, Jie Wu, Robert Kline, Jennifer Krantz
Mobility Control For Complete Coverage In Wireless Sensor Networks, Zhen Jiang, Jie Wu, Robert Kline, Jennifer Krantz
Computer Science Faculty Publications
No abstract provided.
A Hierarchical Structure Based Coverage Repair In Wireless Sensor Networks, Jie Wu, Zhen Jiang
A Hierarchical Structure Based Coverage Repair In Wireless Sensor Networks, Jie Wu, Zhen Jiang
Computer Science Faculty Publications
No abstract provided.
Splitting Np-Complete Sets, Christian Glaßer, A. Pavan, Alan L. Selman, Liyu Zhang
Splitting Np-Complete Sets, Christian Glaßer, A. Pavan, Alan L. Selman, Liyu Zhang
Computer Science Faculty Publications
We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long-standing open question in a surprising way. As a consequence of this unconditional result and recent work by Glaßer et al., complete sets for all of the following complexity classes are m-mitotic: NP, coNP, ⊕P, PSPACE, and NEXP, as well as all levels of PH, MODPH, and the Boolean hierarchy over NP. In the cases of NP, PSPACE, NEXP, and PH, this at once answers several well-studied open questions. These results tell us that complete sets share a redundancy that was not known …
Creating Preservation-Ready Web Resources, Joan A. Smith, Michael L. Nelson
Creating Preservation-Ready Web Resources, Joan A. Smith, Michael L. Nelson
Computer Science Faculty Publications
There are innumerable departmental, community, and personal web sites worthy of long-term preservation but proportionally fewer archivists available to properly prepare and process such sites. We propose a simple model for such everyday web sites which takes advantage of the web server itself to help prepare the site's resources for preservation. This is accomplished by having metadata utilities analyze the resource at the time of dissemination. The web server responds to the archiving repository crawler by sending both the resource and the just-in-time generated metadata as a straight-forward XML-formatted response. We call this complex object (resource + metadata) a CRATE. …
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 …
Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti
Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti
Computer Science Faculty Publications
Phenomenal advances in nano-technology and packaging have made it possible to develop miniaturized low-power devices that integrate sensing, special-purpose computing, and wireless communications capabilities. It is expected that these small devices, referred to as sensors, will be mass-produced and deployed, making their production cost negligible. Due to their small form factor and modest non-renewable energy budget, individual sensors are not expected to be GPS-enabled. Moreover, in most applications, exact geographic location is not necessary, and all that the individual sensors need is a coarse-grain location awareness. The task of acquiring such a coarse-grain location awareness is referred to as training. …
Toward A New Generation Of Ice Sheet Models, Christopher M. Little, Michael Oppenheimer, Richard B. Alley, Venkatramani Balaji, Garry K. C. Clarke, Thomas L. Delworth, Robert Hallberg, David Holland, Christina L. Hulbe, Stan Jacobs, Jesse V. Johnson, Hiram Levy, William Lipscomb, Shawn J. Marshall, Byron R. Parizek, Antony J. Payne, Gavin A. Schmidt, Ronald J. Stouffer, David G. Vaughan, Michael Winton
Toward A New Generation Of Ice Sheet Models, Christopher M. Little, Michael Oppenheimer, Richard B. Alley, Venkatramani Balaji, Garry K. C. Clarke, Thomas L. Delworth, Robert Hallberg, David Holland, Christina L. Hulbe, Stan Jacobs, Jesse V. Johnson, Hiram Levy, William Lipscomb, Shawn J. Marshall, Byron R. Parizek, Antony J. Payne, Gavin A. Schmidt, Ronald J. Stouffer, David G. Vaughan, Michael Winton
Computer Science Faculty Publications
This report summarizes the conclusions and recommendations of a 1-day workshop on ice sheet modeling held at the NOAA Geophysical Fluid Dynamics Laboratory on 8 January 2007, sponsored by NOAA and by the Program in Science, Technology, and Environmental Policy of the Woodrow Wilson School of Public and International Affairs at Princeton University, N. J.
Incremental Procedures For Partitioning Highly Intermixed Multi-Class Datasets Into Hyper-Spherical And Hyper-Ellipsoidal Clusters, Qinglu Kong, Qiuming Zhu
Incremental Procedures For Partitioning Highly Intermixed Multi-Class Datasets Into Hyper-Spherical And Hyper-Ellipsoidal Clusters, Qinglu Kong, Qiuming Zhu
Computer Science Faculty Publications
Two procedures for partitioning large collections of highly intermixed datasets of different classes into a number of hyper-spherical or hyper-ellipsoidal clusters are presented. The incremental procedures are to generate a minimum numbers of hyper-spherical or hyper-ellipsoidal clusters with each cluster containing a maximum number of data points of the same class. The procedures extend the move-to-front algorithms originally designed for construction of minimum sized enclosing balls or ellipsoids for dataset of a single class. The resulting clusters of the dataset can be used for data modeling, outlier detection, discrimination analysis, and knowledge discovery.
Mining Web-Functional Dependencies For Flexible Information Access, Saverio Perugini, Naren Ramakrishnan
Mining Web-Functional Dependencies For Flexible Information Access, Saverio Perugini, Naren Ramakrishnan
Computer Science Faculty Publications
We present an approach to enhancing information access through Web structure mining in contrast to traditional approaches involving usage mining. Specifically, we mine the hardwired hierarchical hyperlink structure of Web sites to identify patterns of term-term co-occurrences we call Web functional dependencies (FDs). Intuitively, a Web FD ‘x y’ declares that all paths through a site involving a hyperlink labeled x also contain a hyperlink labeled y. The complete set of FDs satisfied by a site help characterize (flexible and expressive) interaction paradigms supported by a site, where a paradigm is the set of explorable sequences therein. …
A Trend Pattern Assessment Approach To Microarray Gene Expression Profiling Data Analysis, Kahai Cao, Qiuming Zhu, Javeed Iqbal, John W.C. Chan
A Trend Pattern Assessment Approach To Microarray Gene Expression Profiling Data Analysis, Kahai Cao, Qiuming Zhu, Javeed Iqbal, John W.C. Chan
Computer Science Faculty Publications
We study the problem of how to assess the reliability of a statistical measurement on data set containing unknown quantity of noises, inconsistencies, and outliers. A practical approach that analyzes the dynamical patterns (trends) of the statistical measurements through a sequential extreme-boundary-points (EBP) weed-out process is explored. We categorize the weed-out trend patterns (WOTP) and examine their relation to the reliability of the measurement. The approach is applied to the processes of extracting genes that are predictive to BCL2 translocations and to clinical survival outcomes of diffuse large B-cell lymphoma (DLBCL) from DNA Microarray gene expression profiling data sets. Fisher’s …
A Three-Tier Knowledge Management Scheme For Software Engineering Support And Innovation, Richard Corbin, Christopher B. Dunbar, Qiuming Zhu
A Three-Tier Knowledge Management Scheme For Software Engineering Support And Innovation, Richard Corbin, Christopher B. Dunbar, Qiuming Zhu
Computer Science Faculty Publications
To ensure smooth and successful transition of software innovations to enterprise systems, it is critical to maintain proper levels of knowledge about the system configuration, the operational environment, and the technology in both existing and new systems. We present a three-tier knowledge management scheme through a systematic planning of actions spanning the transition processes in levels from conceptual exploration to prototype development, experimentation, and product evaluation. The three-tier scheme is an integrated effort for bridging the development and operation communities, maintaining stability to the operational performance, and adapting swiftly to software technology innovations. The scheme combines experiences of academic researches …