Browsing by Subject "Computer Science"
Now showing items 1-20 of 48
-
An energy stable C0 finite element scheme for a quasi-incompressible phase-field model of moving contact line with variable density
(Journal of Computational Physics, 2020-03-15)In this paper, we focus on modeling and simulation of two-phase flow problems with moving contact lines and variable density. A thermodynamically consistent phase-field model with general Navier boundary condition is developed ... -
An Operating System Architecture for Networked Server Infrastructure
(2007-12-14)Collections of hardware components are the foundation of computation and consist of interconnections of different types of the same core elements: processors, disks, memory cards, I/O devices, and network links. Designing ... -
Attack Countermeasure Trees: A Non-state-space Approach Towards Analyzing Security and Finding Optimal Countermeasure Set
(2010)Attack tree (AT) is one of the widely used non-statespacemodels in security analysis. The basic formalism of ATdoes not take into account defense mechanisms. Defense trees(DTs) have been developed to investigate the effect ... -
Automated Microscopy and High Throughput Image Analysis in Arabidopsis and Drosophila
(2009)Development of a single cell into an adult organism is accomplished through an elaborate and complex cascade of spatiotemporal gene expression. While methods exist for capturing spatiotemporal expression patterns---in situ ... -
Automatic word count estimation from daylong child-centered recordings in various language environments using language-independent syllabification of speech
(Speech Communication, 2019-10-01)© 2019 The Authors Automatic word count estimation (WCE) from audio recordings can be used to quantify the amount of verbal communication in a recording environment. One key application of WCE is to measure language input ... -
Behavior of different numerical schemes for random genetic drift
(BIT Numerical Mathematics, 2019-09-01)In the problem of random genetic drift, the probability density of one gene is governed by a degenerated convection-dominated diffusion equation. Dirac singularities will always be developed at boundary points as time evolves, ... -
Chromatin Determinants of the Eukaryotic DNA Replication Program
(2011)The accurate and timely replication of eukaryotic DNA during S-phase is of critical importance for the cell and for the inheritance of genetic information. Missteps in the replication program can activate cell cycle checkpoints ... -
Computational Molecular Engineering Nucleic Acid Binding Proteins and Enzymes
(2010)Interactions between nucleic acid substrates and the proteins and enzymes that bind and catalyze them are ubiquitous and essential for reading, writing, replicating, repairing, and regulating the genomic code by the proteomic ... -
Computational Voting Theory: Game-Theoretic and Combinatorial Aspects
(2011)For at least two thousand years, voting has been used as one of the most effective ways to aggregate people's ordinal preferences. In the last 50 years, the rapid development of Computer Science has revolutionize every aspect ... -
Computationally Feasible Approaches to Automated Mechanism Design
(2010)In many multiagent settings, a decision must be made based on the preferences of multiple agents, and agents may lie about their preferences if this is to their benefit. In mechanism design, the goal is to design procedures ... -
Computer aided restoration of handwritten character strokes
(CAD Computer Aided Design, 2017-08-01)© 2017 Elsevier Ltd This work suggests a new variational approach to the task of computer aided segmentation and restoration of incomplete characters, residing in a highly noisy document image. We model character strokes ... -
Conditions for Rapid and Torpid Mixing of Parallel and Simulated Tempering on Multimodal Distributions
(2007-09-14)Stochastic sampling methods are ubiquitous in statistical mechanics, Bayesian statistics, and theoretical computer science. However, when the distribution that is being sampled is multimodal, many of these techniques converge ... -
Developing Scalable Abilities for Self-Reconfigurable Robots
(2010)The power of modern computer systems is due in no small part to their fantastic ability to adapt to whatever tasks they are charged with. Self-reconfigurable robots seek to provide that flexibility in hardware by building ... -
DNA Based Self-Assembly and Nanorobotic: Theory and Experiments
(2007-12-10)We study the following fundamental questions in DNA based self-assembly and nanorobotics: How to control errors in self-assembly? How to construct complex nanoscale objects in simpler ways? How to transport nanoscale objects ... -
Extensible Resource Management for Networked Virtual Computing
(2007-12-14)Advances in server virtualization offer new mechanisms to provideresource management for shared server infrastructures. Resourcesharing requires coordination across self-interested systemparticipants (e.g., providers from ... -
Feature Selection for Value Function Approximation
(2011)The field of reinforcement learning concerns the question of automated action selection given past experiences. As an agent moves through the state space, it must recognize which state choices are best in terms of allowing ... -
Foresight: Countering Malware through Cooperative Forensics Sharing
(2008-08-08)With the Internet's rapid growth has come a proportional increase in exposure to attacks, misuse and abuse. Modern viruses and worms are causing damage much more quickly than those created in the past. The fast replication ... -
Handling Resource Constraints and Scalability in Continuous Query Processing
(2007-12-12)Recent years have witnessed a rapid rise of a new class of data-intensive applications in which data arrive as transient, high-volume streams. Financial data processing, network monitoring, and sensor networks are all examples ... -
Homological Illusions of Persistence and Stability
(2008-08-04)In this thesis we explore and extend the theory of persistent homology, which captures topological features of a function by pairing its critical values. The result is represented by a collection of points in the extended ...
