Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Mathematics (21)
- Statistics and Probability (19)
- Engineering (13)
- Electrical and Computer Engineering (6)
- Medicine and Health Sciences (3)
-
- Operations Research, Systems Engineering and Industrial Engineering (3)
- Health Information Technology (2)
- Information Security (2)
- Aerospace Engineering (1)
- Cybersecurity (1)
- Economics (1)
- Education (1)
- Higher Education (1)
- Medical Pathology (1)
- Medical Sciences (1)
- Social and Behavioral Sciences (1)
- Institution
- Keyword
-
- Automated Induction, Machine Learning, Knowledge Representation (4)
- Algorithms (3)
- Algorithm Design (2)
- Application-Oriented Fault Tolerance, Multicomputers. (2)
- Chromatic Number (2)
-
- Embedding, Fault Tolerance, Reconfiguration, Ring, Hypercube. (2)
- Embeddings (2)
- Graph-Coloring (2)
- Heuristic Algorithms (2)
- Optimization, Probabilistic Methods, Stock Cutting, Bin Packing (2)
- Reasoning (2)
- Scheduling (2)
- Speedup (2)
- Academic/Educational Applications (1)
- Approximation (1)
- Artificial Intelligence, Database Rule Systems, Rule Indexing, Rule Clustering, Search Strategies, Rule-base. (1)
- Artificial intelligence (1)
- Bibliography (1)
- Branch-And-Bound (1)
- Church-Rosser Property (1)
- Class NC (1)
- Class NG (1)
- Compilers, Formal Languages, Language Processors, LR(l) Grammars, LR(l) Parsing (1)
- Complete Sets of Reductions (1)
- Complexity Of Algorithms (1)
- Computer assisted instruction (1)
- Conant gasket (1)
- Concurrent Systems (1)
- Conditional Reductions (1)
- Cyber resilience (1)
- Publication Year
- File Type
Articles 211 - 240 of 772
Full-Text Articles in Computer Sciences
Tr-2007023: The Schur Aggregation For Linear Systems And Determinants, V. Y. Pan, B. Murphy, G. Qian, R. E. Rosholt
Tr-2007023: The Schur Aggregation For Linear Systems And Determinants, V. Y. Pan, B. Murphy, G. Qian, R. E. Rosholt
Computer Science Technical Reports
No abstract provided.
Tr-2007024: A Register-Free Abstract Prolog Machine With Jumbo Instructions, Neng-Fa Zhou
Tr-2007024: A Register-Free Abstract Prolog Machine With Jumbo Instructions, Neng-Fa Zhou
Computer Science Technical Reports
No abstract provided.
Tr-2007025: Public Communication In Justification Logic, Bryan Renne
Tr-2007025: Public Communication In Justification Logic, Bryan Renne
Computer Science Technical Reports
No abstract provided.
Tr-2007003: Additive Preconditioning For Matrix Computations, Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Yuqing Tang, Xiaodong Yan
Tr-2007003: Additive Preconditioning For Matrix Computations, Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Yuqing Tang, Xiaodong Yan
Computer Science Technical Reports
No abstract provided.
Tr-2007012: The Relative Expressivity Of Public And Private Communication In Bms Logic, Bryan Renne
Tr-2007012: The Relative Expressivity Of Public And Private Communication In Bms Logic, Bryan Renne
Computer Science Technical Reports
No abstract provided.
Tr-2007013: Error-Free Computations Via Floating-Point Operations: The Code, V. Y. Pan, B. Murphy, G. Qian, R. E. Rosholt
Tr-2007013: Error-Free Computations Via Floating-Point Operations: The Code, V. Y. Pan, B. Murphy, G. Qian, R. E. Rosholt
Computer Science Technical Reports
No abstract provided.
Tr-2007016: Symmetric Logic Of Proofs, Sergei Artemov
Tr-2007016: Symmetric Logic Of Proofs, Sergei Artemov
Computer Science Technical Reports
No abstract provided.
Tr-2007018: Peak Shaving Through Resource Buffering, Amotz Bar-Noy, Matthew P. Johnson, Ou Liu
Tr-2007018: Peak Shaving Through Resource Buffering, Amotz Bar-Noy, Matthew P. Johnson, Ou Liu
Computer Science Technical Reports
No abstract provided.
Cheating To Get Better Roommates In A Random Stable Matching, Chien-Chung Huang
Cheating To Get Better Roommates In A Random Stable Matching, Chien-Chung Huang
Computer Science Technical Reports
This paper addresses strategies for the stable roommates problem, assuming that a stable matching is chosen at random. We investigate how a cheating man should permute his preference list so that he has a higher-ranking roommate probabilistically. In the first part of the paper, we identify a necessary condition for creating a new stable roommate for the cheating man. This condition precludes any possibility of his getting a new roommate ranking higher than all his stable roommates when everyone is truthful. Generalizing to the case that multiple men collude, we derive another impossibility result: given any stable matching in which …
Tools And Algorithms To Advance Interactive Intrusion Analysis Via Machine Learning And Information Retrieval, Javed Aslam, Sergey Bratus, Virgil Pavlu
Tools And Algorithms To Advance Interactive Intrusion Analysis Via Machine Learning And Information Retrieval, Javed Aslam, Sergey Bratus, Virgil Pavlu
Computer Science Technical Reports
We consider typical tasks that arise in the intrusion analysis of log data from the perspectives of Machine Learning and Information Retrieval, and we study a number of data organization and interactive learning techniques to improve the analyst's efficiency. In doing so, we attempt to translate intrusion analysis problems into the language of the abovementioned disciplines and to offer metrics to evaluate the effect of proposed techniques. The Kerf toolkit contains prototype implementations of these techniques, as well as data transformation tools that help bridge the gap between the real world log data formats and the ML and IR data …
Digital Image Ballistics From Jpeg Quantization, Hany Farid
Digital Image Ballistics From Jpeg Quantization, Hany Farid
Computer Science Technical Reports
Most digital cameras export images in the JPEG file format. This lossy compression scheme employs a quantization table that controls the amount of compression achieved. Different cameras typically employ different tables. A comparison of an image's quantization scheme to a database of known cameras affords a simple technique for confirming or denying an image's source. Similarly, comparison to a database of photo-editing software can be used in a forensic setting to determine if an image was edited after its original recording.
Metric Measurements On A Plane From A Single Image, Micah K. Johnson, Hany Farid
Metric Measurements On A Plane From A Single Image, Micah K. Johnson, Hany Farid
Computer Science Technical Reports
The past decade has seen considerable advances in the application of principles from projective geometry to problems in image analysis and computer vision. In this paper, we review a subset of this work, and leverage these results for the purpose of forensic analysis. Specifically, we review three techniques for making metric measurements on planar surfaces from a single image. The resulting techniques should prove useful in forensic settings where real-world measurements are required.
Sampled: Shared Anonymous Music Playback Using Wireless Devices, Constantinos Neophytou
Sampled: Shared Anonymous Music Playback Using Wireless Devices, Constantinos Neophytou
Computer Science Technical Reports
Recent advances in mobile computing enable many new applications, yet at the same time create privacy implications caused by the increasing amount of data that becomes available. This thesis will explore the possibilities of wireless-enabled portable devices and their attending privacy implications. We will describe how such a device containing personal information about the musical preferences of its user can help improve the user's experience in a social setting where music is played for all, and at the same time preserve each user's privacy.
Visualizing Paths In Context, Fabio Pellacini, Lori Lorigo, Geri Gay
Visualizing Paths In Context, Fabio Pellacini, Lori Lorigo, Geri Gay
Computer Science Technical Reports
Data about movement through a space is increasingly becoming available for capture and analysis. In many applications, this data is captured or modeled as transitions between a small number of areas of interests, or a finite set of states, and these transitions constitute paths in the space. Similarities and differences between paths are of great importance to such analyses, but can be difficult to assess. In this work we present a visualization approach for representing paths in context, where individual paths can be compared to other paths or to a group of paths. Our approach summarizes path behavior using a …
A Simple Computational Method For The Identification Of Disease-Associated Loci In Complex, Incomplete Pedigrees, Gregory Leibon, Dan Rockmore, Martin R. Pollak
A Simple Computational Method For The Identification Of Disease-Associated Loci In Complex, Incomplete Pedigrees, Gregory Leibon, Dan Rockmore, Martin R. Pollak
Computer Science Technical Reports
We present an approach, called the Shadow Method, for the identification of disease loci from dense genetic marker maps in complex, potentially incomplete pedigrees. Shadow is a simple method based on an analysis of the patterns of obligate meiotic recombination events in genotypic data. This method can be applied to any high density marker map and was specifically designed to explore the fact that extremely dense marker maps are becoming more readily available. We also describe how to interpret and associated meaningful P-Values to the results. Shadow has significant advantages over traditional parametric linkage analysis methods in that it can …
Tr-2006001: The Em Algorithm As A Lower Bound Optimization Technique, Rave Harpaz, Robert Haralick
Tr-2006001: The Em Algorithm As A Lower Bound Optimization Technique, Rave Harpaz, Robert Haralick
Computer Science Technical Reports
No abstract provided.
Tr-2006012: Every P-Recursion Category Has An Index Composer, Florian Lengyel
Tr-2006012: Every P-Recursion Category Has An Index Composer, Florian Lengyel
Computer Science Technical Reports
No abstract provided.
Tr-2006002: A Replacement Theorem For Lp, Melvin Fitting
Tr-2006002: A Replacement Theorem For Lp, Melvin Fitting
Computer Science Technical Reports
No abstract provided.
Tr-2006005: Logical Omniscience Via Proof Complexity, Sergei Artemov, Roman Kuznets
Tr-2006005: Logical Omniscience Via Proof Complexity, Sergei Artemov, Roman Kuznets
Computer Science Technical Reports
No abstract provided.
Tr-2006006: Additive Preconditioning And Aggregation In Matrix Computations, Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Islam Taj-Eddin, Yuqing Tang, Xiaodong Yan
Tr-2006006: Additive Preconditioning And Aggregation In Matrix Computations, Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Islam Taj-Eddin, Yuqing Tang, Xiaodong Yan
Computer Science Technical Reports
No abstract provided.
Tr-2006007: Root-Finding With Eigen-Solving, Victor Y. Pan, Brian Murphy, Rhys Eric Rosholt
Tr-2006007: Root-Finding With Eigen-Solving, Victor Y. Pan, Brian Murphy, Rhys Eric Rosholt
Computer Science Technical Reports
No abstract provided.
Tr-2006008: Every P-Recursion Category Has An Index Composer, Florian Lengyel
Tr-2006008: Every P-Recursion Category Has An Index Composer, Florian Lengyel
Computer Science Technical Reports
No abstract provided.
Tr-2006014: Geometric Considerations For Distribution Of Sensors In Ad-Hoc Sensor Networks, Ted Brown, Deniz Sarioz, Amotz Bar-Noy, Tom Laporta, Dinesh Verma, Matthew Johnson, Hosam Rowaihy
Tr-2006014: Geometric Considerations For Distribution Of Sensors In Ad-Hoc Sensor Networks, Ted Brown, Deniz Sarioz, Amotz Bar-Noy, Tom Laporta, Dinesh Verma, Matthew Johnson, Hosam Rowaihy
Computer Science Technical Reports
No abstract provided.
Tr-2006003: Explicit Proofs In Formal Provability Logic, Evan Goris
Tr-2006003: Explicit Proofs In Formal Provability Logic, Evan Goris
Computer Science Technical Reports
No abstract provided.
Tr-2006004: Justified Knowledge Is Sufficient, Evangelia Antonakos
Tr-2006004: Justified Knowledge Is Sufficient, Evangelia Antonakos
Computer Science Technical Reports
No abstract provided.
Tr-2006011: Locally Connected Recursion Categories, Florian Lengyel
Tr-2006011: Locally Connected Recursion Categories, Florian Lengyel
Computer Science Technical Reports
No abstract provided.
Tr-2006013: The Dom Event And Its Use In Implementing Constraint Propagators, Neng-Fa Zhou, Mark Wallace, Peter J. Stuckey
Tr-2006013: The Dom Event And Its Use In Implementing Constraint Propagators, Neng-Fa Zhou, Mark Wallace, Peter J. Stuckey
Computer Science Technical Reports
No abstract provided.
A Novel Minimized Dead-End Elimination Criterion And Its Application To Protein Redesign In A Hybrid Scoring And Search Algorithm For Computing Partition Functions Over Molecular Ensembles, Ivelin Georgiev, Ryan H. Lilien, Bruce R. Donald
A Novel Minimized Dead-End Elimination Criterion And Its Application To Protein Redesign In A Hybrid Scoring And Search Algorithm For Computing Partition Functions Over Molecular Ensembles, Ivelin Georgiev, Ryan H. Lilien, Bruce R. Donald
Computer Science Technical Reports
Novel molecular function can be achieved by redesigning an enzyme's active site so that it will perform its chemical reaction on a novel substrate. One of the main challenges for protein redesign is the efficient evaluation of a combinatorial number of candidate structures. The modeling of protein flexibility, typically by using a rotamer library of commonly-observed low-energy side-chain conformations, further increases the complexity of the redesign problem. A dominant algorithm for protein redesign is Dead-End Elimination (DEE), which prunes the majority of candidate conformations by eliminating rigid rotamers that provably are not part of the Global Minimum Energy Conformation (GMEC). …
How Hard Is It To Cheat In The Gale-Shapley Stable Matching Algorithm, Chien-Chung Huang
How Hard Is It To Cheat In The Gale-Shapley Stable Matching Algorithm, Chien-Chung Huang
Computer Science Technical Reports
We study strategy issues surrounding the stable marriage problem. Under the Gale-Shapley algorithm (with men proposing), a classical theorem says that it is impossible for every liar to get a better partner. We try to challenge this theorem. First, observing a loophole in the statement of the theorem, we devise a coalition strategy in which a non-empty subset of the liars gets a better partner and no man is worse off than before. This strategy is restricted in that not everyone has the incentive to cheat. We attack the classical theorem further by means of randomization. However, this theorem shows …
A Steerable, Untethered, 250x60 Micron Mems Mobile Micro-Robot, Bruce R. Donald, Christopher G. Levey, Craig D. Mcgray, Igor Paprotny, Daniela Rus
A Steerable, Untethered, 250x60 Micron Mems Mobile Micro-Robot, Bruce R. Donald, Christopher G. Levey, Craig D. Mcgray, Igor Paprotny, Daniela Rus
Computer Science Technical Reports
We present a steerable, electrostatic, untethered, MEMS micro-robot, with dimensions of 60 µm by 250 µm by 10 µm. This micro-robot is 1 to 2 orders of magnitude smaller in size than previous micro-robotic systems. The device consists of a curved, cantilevered steering arm, mounted on an untethered scratch drive actuator. These two components are fabricated monolithically from the same sheet of conductive polysilicon, and receive a common power and control signal through a capacitive coupling with an underlying electrical grid. All locations on the grid receive the same power and control signal, so that the devices can be operated …