The economic, education, and health problems facing Uganda are immense. The average life span is around 42 years of age. Health clinics, potable [drinkable] water and electricity are not readily available for most cit...
详细信息
This volume comprises the polished and fully refereed versions of a selection of papers presented at the Thirty-Sixth Annual acmsymposium on Theory of computing (STOC 2004), held in Chicago, Illinois, June 13-15, 200...
This volume comprises the polished and fully refereed versions of a selection of papers presented at the Thirty-Sixth Annual acmsymposium on Theory of computing (STOC 2004), held in Chicago, Illinois, June 13-15, 2004. Unrefereed preliminary versions of the papers presented at the symposium appeared in the proceedings of the meeting, published by acm. The symposium was sponsored by the acm Special Interest Group on Algorithms and Computation Theory (SIGACT).
Determining transcriptional regulatory networks has been one of the most important goals in the field of functional genomics. Despite the recent advances in experimental techniques, complementary computational techniq...
详细信息
Determining transcriptional regulatory networks has been one of the most important goals in the field of functional genomics. Despite the recent advances in experimental techniques, complementary computational techniques have lagged behind. We introduce a novel computational methodology that uses DNA microarray data and known regulatory interactions to predict unknown regulatory interactions. Our method involves three steps: in the training stage, we utilize network component analysis (NCA) (Liao et al., 2003; Kao et al., 2004; Boscolo et al., 2005) to reconstruct the hidden activity profiles of transcriptional factors (TF); then we cluster TFs into functional modules according to the similarities of their reconstructed activity profiles; in the prediction stage, we infer additional TF-gene regulatory links by selecting TF profiles that best interpret genes expression profiles via a linear model. We applied the methodology to a gene expression dataset of bacterium Escherichia coli, whose partial TF-gene regulatory structure is obtained from RegulonDB (Salgado et al., 2004). Cross-validation results show that when the profiles of all TFs regulating a gene are reconstructed from NCA, we could identify 36% of the TF-gene interactions, and the prediction accuracy is 89%. And when the profiles of partial (50% or more) TFs regulating a gene can be reconstructed, we can identify 14% of the TF-gene interactions, and the accuracy rate is 69%. These represent some of the best known accuracy and coverage statistics reported in the literature so far
We propose a framework for establishing the correctness of untrusted Java bytecode components w.r.t. to complex functional and/or security policies. To this end, we define a bytecode specification language (BCSL) and ...
详细信息
ISBN:
(纸本)1595931082
We propose a framework for establishing the correctness of untrusted Java bytecode components w.r.t. to complex functional and/or security policies. To this end, we define a bytecode specification language (BCSL) and a weakest precondition calculus for sequential Java bytecode. BCSL and the calculus are expressive enough for verifying non-trivial properties of programs, and cover most of sequential Java bytecode, including exceptions, subroutines, references, object creation and method calls. Our approach does not require that bytecode components are provided with their source code. Nevertheless, we provide a means to compile JML annotations into BCSL annotations by defining a compiler from the Java Modeling Language (JML) to BCSL. Our compiler can be used in combination with most Java compilers to produce extended class files from JML-annotated Java source programs. All components, including the verification condition generator and the compiler are implemented and integrated in the Java Applet Correctness Kit (JACK). Copyright 2006 acm.
We investigate conditions under which an infinite set of atomic messages can be replaced with one or two values without affecting the correctness of a security protocol. The work is conducted using the strand spaces f...
详细信息
ISBN:
(纸本)1595931082
We investigate conditions under which an infinite set of atomic messages can be replaced with one or two values without affecting the correctness of a security protocol. The work is conducted using the strand spaces formalism, but the results apply to all protocol analysis techniques, and should be of particular value to those using model checking. The implications of the central result are discussed. Copyright 2006 acm.
This paper presents ALTER, an adaptive failure detection service, which incorporates the technique of unreliable failure detection service and the idea of R-GMA. ALTER is organized in a hierarchical structure and it c...
详细信息
ISBN:
(纸本)1595931082
This paper presents ALTER, an adaptive failure detection service, which incorporates the technique of unreliable failure detection service and the idea of R-GMA. ALTER is organized in a hierarchical structure and it can be adaptive to the system conditions and user requirements with changing the system parameters and system organizations. With mathematical evaluation, ALTER shows good scalability and flexibility, which is suitable for grid environments. Copyright 2006 acm.
Global public computing platforms, such as PlanetLab, grid computing systems, and XenoServers, require facilities for managing trust to allow their participants to interact effectively in an open and untrusted environ...
详细信息
ISBN:
(纸本)1595931082
Global public computing platforms, such as PlanetLab, grid computing systems, and XenoServers, require facilities for managing trust to allow their participants to interact effectively in an open and untrusted environment. In this paper, we describe BambooTrust, a practical, high-performance distributed trust management system for global public computing platforms. We present our peer-to-peer architecture, based on the XenoTrust model and the Bamboo distributed hash table. We describe the initial BambooTrust implementation and deployment, and demonstrate that the system performs and scales more than adequately well by means of experimental evaluation. Copyright 2006 acm.
This paper proposes a temporal version mapping concept and a SQL query rewriting technique to support the OLAP query analysis in multidimensional database (MDB) systems modeled on multiversion schema. Based on our pro...
详细信息
ISBN:
(纸本)1595931082
This paper proposes a temporal version mapping concept and a SQL query rewriting technique to support the OLAP query analysis in multidimensional database (MDB) systems modeled on multiversion schema. Based on our proposed model, an integration solution of MDB schema change and multiversion OLAP query analysis performed over the changed database schema are taken into account. In addition, we present the system design and implementation of our prototype system to demonstrate our research idea. Copyright 2006 acm.
The release of computer hardware devices based on "trusted computing" technologies is heralding a paradigm shift that will have profound implications for digital forensics. In this paper, we map out the cont...
详细信息
ISBN:
(纸本)1595931082
The release of computer hardware devices based on "trusted computing" technologies is heralding a paradigm shift that will have profound implications for digital forensics. In this paper, we map out the contours of a trusted environment in order to establish the context for the paper. This is followed by the main components of the TC architecture with an emphasis on the Trusted Platform and the Trusted Platform Module (TPM). The next section presents a synopsis based on three threat models, viz., (i) pc owner-centric, (ii) trusted computing-centric, and (iii) digital forensics-centric and then briefly touches on the implications and unintended consequences of trusted computing for digital forensics. Finally, the last section of the concludes with a recommendation on how to mitigate the negative effects of trusted computing. Copyright 2006 acm.
Most previous work on information flow in process algebras has been based on untimed models of concurrency. It is obvious, however, that an observer might well use time to gain information about what a high-level user...
详细信息
ISBN:
(纸本)1595931082
Most previous work on information flow in process algebras has been based on untimed models of concurrency. It is obvious, however, that an observer might well use time to gain information about what a high-level user of the system is doing. We use the priority took view (a discrete timed model) to extend several traditional untimed noninterference properties to the timed world. These are the determinism-based conditions of [14], [15] and [17], and Forster's local noninterference properties [6], [7]. Copyright 2006 acm.
暂无评论