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 151 - 180 of 772
Full-Text Articles in Computer Sciences
Functional Monitoring Without Monotonicity, Chrisil Arackaparambil, Joshua Brody, Amit Chakrabarti
Functional Monitoring Without Monotonicity, Chrisil Arackaparambil, Joshua Brody, Amit Chakrabarti
Computer Science Technical Reports
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi to initiate a formal study of the communication cost of certain fundamental problems arising in distributed systems, especially sensor networks. In this model, each of k sites reads a stream of tokens and is in communication with a central coordinator, who wishes to continuously monitor some function f of \sigma, the union of the k streams. The goal is to minimize the number of bits communicated by a protocol that correctly monitors f(\sigma), to within some small error. As in previous work, we focus on a …
Digital Image Ballistics From Jpeg Quantization: A Followup Study, Hany Farid
Digital Image Ballistics From Jpeg Quantization: A Followup Study, Hany Farid
Computer Science Technical Reports
The lossy JPEG compression scheme employs a quantization table that controls the amount of compression achieved. Because 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. This report describes the analysis of quantization tables extracted from 1,000,000 images downloaded from Flickr.com.
Toward Evaluating Lighting Design Interface Paradigms For Novice Users, William Brandon Kerr, Fabio Pellacini
Toward Evaluating Lighting Design Interface Paradigms For Novice Users, William Brandon Kerr, Fabio Pellacini
Computer Science Technical Reports
Lighting design is a complex and fundamental task in computer cinematography, involving adjustment of light parameters to define final scene appearance. Many lighting interfaces have been proposed to improve lighting design work flow. These paradigms exist in three paradigm categories: direct light parameter manipulation, indirect light feature manipulation (e.g., shadow dragging), and goal-based optimization of light through painting. To this date, no formal evaluation of the relative effectiveness of these methods has been performed. In this paper, we present a first step toward evaluating the three paradigms in the form of a user study with novice users. We focus our …
Blac: Revoking Repeatedly Misbehaving Anonymous Users Without Relying On Ttps, Patrick P. Tsang, Man Ho Au, Apu Kapadia, Sean W. Smith
Blac: Revoking Repeatedly Misbehaving Anonymous Users Without Relying On Ttps, Patrick P. Tsang, Man Ho Au, Apu Kapadia, Sean W. Smith
Computer Science Technical Reports
Several credential systems have been proposed in which users can authenticate to service providers anonymously. Since anonymity can give users the license to misbehave, some variants allow the selective deanonymization (or linking) of misbehaving users upon a complaint to a trusted third party (TTP). The ability of the TTP to revoke a user's privacy at any time, however, is too strong a punishment for misbehavior. To limit the scope of deanonymization, systems have been proposed in which users are deanonymized if they authenticate ``too many times,'' such as ``double spending'' with electronic cash. While useful in some applications, it is …
Lzfuzz: A Fast Compression-Based Fuzzer For Poorly Documented Protocols, Sergey Bratus, Axel Hansen, Anna Shubina
Lzfuzz: A Fast Compression-Based Fuzzer For Poorly Documented Protocols, Sergey Bratus, Axel Hansen, Anna Shubina
Computer Science Technical Reports
Real-world infrastructure offers many scenarios where protocols (and other details) are not released due to being considered too sensitive or for other reasons. This situation makes it hard to apply fuzzing techniques to test their security and reliability, since their full documentation is only available to their developers, and domain developer expertise does not necessarily intersect with fuzz-testing expertise (nor deployment responsibility). State-of-the-art fuzzing techniques, however, work best when protocol specifications are available. Still, operators whose networks include equipment communicating via proprietary protocols should be able to reap the benefits of fuzz-testing them. In particular, administrators should be able to …
Detecting Kernel Rootkits, Ashwin Ramaswamy
Detecting Kernel Rootkits, Ashwin Ramaswamy
Computer Science Technical Reports
Kernel rootkits are a special category of malware that are deployed directly in the kernel and hence have unmitigated reign over the functionalities of the kernel itself. We seek to detect such rootkits that are deployed in the real world by first observing how the majority of kernel rootkits operate. To this end, comparable to how rootkits function in the real world, we write our own kernel rootkit that manipulates the network driver, thus giving us control over all packets sent into the network. We then implement a mechanism to thwart the attacks of such rootkits by noticing that a …
Twokind Authentication: Protecting Private Information In Untrustworthy Environments (Extended Version), Katelin Bailey, Apu Kapadia, Linden Vongsathorn, Sean W. Smith
Twokind Authentication: Protecting Private Information In Untrustworthy Environments (Extended Version), Katelin Bailey, Apu Kapadia, Linden Vongsathorn, Sean W. Smith
Computer Science Technical Reports
We propose and evaluate TwoKind Authentication, a simple and effective technique that allows users to limit access to their private information in untrustworthy environments. Users often log in to Internet sites from insecure computers, and more recently have started divulging their email passwords to social-networking sites, thereby putting their private communications at risk. To mitigate this problem, we explore the use of multiple authenticators for the same account that are associated with specific sets of privileges. In its simplest form, TwoKind features two modes of authentication, a low and a high authenticator. By using a low authenticator, users can signal …
Yasir: A Low-Latency, High-Integrity Security Retrofit For Legacy Scada Systems (Extended Version), Patrick P. Tsang, Sean W. Smith
Yasir: A Low-Latency, High-Integrity Security Retrofit For Legacy Scada Systems (Extended Version), Patrick P. Tsang, Sean W. Smith
Computer Science Technical Reports
We construct a bump-in-the-wire (BITW) solution that retrofits security into time-critical communications over bandwidth-limited serial links between devices in legacy Supervisory Control And Data Acquisition (SCADA) systems, on which the proper operations of critical infrastructures such as the electric power grid rely. Previous BITW solutions do not provide the necessary security within timing constraints; the previous solution that does is not BITW. At a hardware cost comparable to existing solutions, our BITW solution provides sufficient security, and yet incurs minimal end-to-end communication latency.
The Weakest Failure Detector To Solve Mutual Exclusion, Vibhor Bhatt, Nicholas Christman, Prasad Jayanti
The Weakest Failure Detector To Solve Mutual Exclusion, Vibhor Bhatt, Nicholas Christman, Prasad Jayanti
Computer Science Technical Reports
Mutual exclusion is not solvable in an asynchronous message-passing system where processes are subject to crash failures. Delporte-Gallet et. al. determined the weakest failure detector to solve this problem when a majority of processes are correct. Here we identify the weakest failure detector to solve mutual exclusion in any environment, i.e., regardless of the number of faulty processes. We also show a relation between mutual exclusion and consensus, arguably the two most fundamental problems in distributed computing. Specifically, we show that a failure detector that solves mutual exclusion is sufficient to solve non-uniform consensus but not necessarily uniform consensus.
Ppaa: Peer-To-Peer Anonymous Authentication (Extended Version), Patrick P. Tsang, Sean W. Smith
Ppaa: Peer-To-Peer Anonymous Authentication (Extended Version), Patrick P. Tsang, Sean W. Smith
Computer Science Technical Reports
In the pursuit of authentication schemes that balance user privacy and accountability, numerous anonymous credential systems have been constructed. However, existing systems assume a client-server architecture in which only the clients, but not the servers, care about their privacy. In peer-to-peer (P2P) systems where both clients and servers are peer users with privacy concerns, no existing system correctly strikes that balance between privacy and accountability. In this paper, we provide this missing piece: a credential system in which peers are {\em pseudonymous} to one another (that is, two who interact more than once can recognize each other via pseudonyms) but …
Bounded Unpopularity Matchings, Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre
Bounded Unpopularity Matchings, Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre
Computer Science Technical Reports
We investigate the following problem: given a set of jobs and a set of people with preferences over the jobs, what is the optimal way of matching people to jobs? Here we consider the notion of \emph{popularity}. A matching $M$ is popular if there is no matching $M'$ such that more people prefer $M'$ to $M$ than the other way around. Determining whether a given instance admits a popular matching and, if so, finding one, was studied in \cite{AIKM05}. If there is no popular matching, a reasonable substitute is a matching whose {\em unpopularity} is bounded. We consider two measures …
Active Behavioral Fingerprinting Of Wireless Devices, Sergey Bratus, Cory Cornelius, David Kotz, Daniel Peebles
Active Behavioral Fingerprinting Of Wireless Devices, Sergey Bratus, Cory Cornelius, David Kotz, Daniel Peebles
Computer Science Technical Reports
We propose a simple active method for discovering facts about the chipset, the firmware or the driver of an 802.11 wireless device by observing its responses (or lack thereof) to a series of crafted non-standard or malformed 802.11 frames. We demonstrate that such responses can differ significantly enough to distinguish between a number of popular chipsets and drivers. We expect to significantly expand the number of recognized device types through community contributions of signature data for the proposed open fingerprinting framework. Our method complements known fingerprinting approaches, and can be used to interrogate and spot devices that may be spoofing …
Localized Bridging Centrality For Distributed Network Analysis, Soumendra Nanda, David Kotz
Localized Bridging Centrality For Distributed Network Analysis, Soumendra Nanda, David Kotz
Computer Science Technical Reports
Centrality is a concept often used in social network analysis to study different properties of networks that are modeled as graphs. We present a new centrality metric called Localized Bridging Centrality (LBC). LBC is based on the Bridging Centrality (BC) metric that Hwang et al. recently introduced. Bridging nodes are nodes that are located in between highly connected regions. LBC is capable of identifying bridging nodes with an accuracy comparable to that of the BC metric for most networks. As the name suggests, we use only local information from surrounding nodes to compute the LBC metric, while, global knowledge is …
Tr-2008007: Degeneration Of Structured Integer Matrices Modulo An Integer, Victor Y. Pan, Xinmao Wang
Tr-2008007: Degeneration Of Structured Integer Matrices Modulo An Integer, Victor Y. Pan, Xinmao Wang
Computer Science Technical Reports
No abstract provided.
Tr-2008008: Schur Aggregation For Linear Systems And Determinants, V. Y. Pan, D. Grady, B. Murphy, G. Qian, R. E. Rosholt, A. D. Ruslanov
Tr-2008008: Schur Aggregation For Linear Systems And Determinants, V. Y. Pan, D. Grady, B. Murphy, G. Qian, R. E. Rosholt, A. D. Ruslanov
Computer Science Technical Reports
No abstract provided.
Tr-2008015: An Efficient Heuristic For The Tree Alignment Problem, Andrés Varón, Ward Wheeler, Amotz Bar-Noy
Tr-2008015: An Efficient Heuristic For The Tree Alignment Problem, Andrés Varón, Ward Wheeler, Amotz Bar-Noy
Computer Science Technical Reports
No abstract provided.
Tr-2008013: Content-Based 3d Mosaics For Large-Scale Dynamic Urban Scenes, Hao Tang, Zhigang Zhu
Tr-2008013: Content-Based 3d Mosaics For Large-Scale Dynamic Urban Scenes, Hao Tang, Zhigang Zhu
Computer Science Technical Reports
No abstract provided.
Tr-2008012: Product-Free Lambek Calculus Is Np-Complete, Yury Savateev
Tr-2008012: Product-Free Lambek Calculus Is Np-Complete, Yury Savateev
Computer Science Technical Reports
No abstract provided.
Tr-2008011: Contrast Transfer Function Correction In Electron Microscopy, Joanna Klukowska
Tr-2008011: Contrast Transfer Function Correction In Electron Microscopy, Joanna Klukowska
Computer Science Technical Reports
No abstract provided.
Tr-2008002: On Image Reconstruction From A Small Number Of Projections, G. T. Herman, R. Davidi
Tr-2008002: On Image Reconstruction From A Small Number Of Projections, G. T. Herman, R. Davidi
Computer Science Technical Reports
No abstract provided.
Tr-2008001: Public And Private Communication Are Different: Results On Relative Expressivity, Bryan Renne
Tr-2008001: Public And Private Communication Are Different: Results On Relative Expressivity, Bryan Renne
Computer Science Technical Reports
No abstract provided.
Tr-2008003: Unified Nearly Optimal Algorithms For Structured Integer Matrices And Polynomials, Victor Y. Pan, Brian Murphy, Rhys E. Rosholt
Tr-2008003: Unified Nearly Optimal Algorithms For Structured Integer Matrices And Polynomials, Victor Y. Pan, Brian Murphy, Rhys E. Rosholt
Computer Science Technical Reports
No abstract provided.
Tr-2008004: Additive Preconditioning For Matrix Computations, Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Yuqing Tang, Xiaodong Yan
Tr-2008004: 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-2008005: Weakly Random Additive Preconditioning For Matrix Computations, Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Yuqing Tang, Xiaodong Yan
Tr-2008005: Weakly Random 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-2008016: An Analysis Of Entries In The First Tac Market Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Peter Mcburney
Tr-2008016: An Analysis Of Entries In The First Tac Market Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Peter Mcburney
Computer Science Technical Reports
No abstract provided.
Tr-2008006: Additive Preconditioning, Eigenspaces, And The Inverse Iteration, Victor Y. Pan, Xiaodong Yan
Tr-2008006: Additive Preconditioning, Eigenspaces, And The Inverse Iteration, Victor Y. Pan, Xiaodong Yan
Computer Science Technical Reports
No abstract provided.
Tr-2008009: Solving Homogeneous Linear Systems With Weakly Randomized Additive Preprocessing, Victor Y. Pan, Guoliang Qian
Tr-2008009: Solving Homogeneous Linear Systems With Weakly Randomized Additive Preprocessing, Victor Y. Pan, Guoliang Qian
Computer Science Technical Reports
No abstract provided.
Tr-2008010: The Logic Of Justification, Sergei Artemov
Tr-2008010: The Logic Of Justification, Sergei Artemov
Computer Science Technical Reports
No abstract provided.
Tr-2008014: Why Do We Need Justification Logic?, Sergei Artemov
Tr-2008014: Why Do We Need Justification Logic?, Sergei Artemov
Computer Science Technical Reports
No abstract provided.
Two's Company, Three's A Crowd: Stable Family And Threesome Roommates Problems, Chien-Chung Huang
Two's Company, Three's A Crowd: Stable Family And Threesome Roommates Problems, Chien-Chung Huang
Computer Science Technical Reports
We investigate Knuth's eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among the other two groups. The goal is to organize them into family units, so that no three of them have the incentive to desert their assigned family members to form a new family. A similar problem, called the threesome roommates problem, assumes that a group of persons, each with their preferences among the combinations of two others, are to be partitioned into triples. Similarly, the goal is to make sure that …