ppxscal/embedding_network huggingface dataset:
Some ideas towards a grammatical model of the /spl sigma//sup 54/ bacterial promoters
Authors: J. Collado-Vides
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

The integration of large amounts of information on the regulation of gene expression requires conceptual frameworks which should facilitate the discovery of general principles underlying different mechanisms of gene regulation. An exhaustive database of /spl sigma//sup 70/ and /spl sigma//sup 54/ promoters in E. Coli has supported the construction of a grammatical model of the /spl sigma//sup 70/ type of promoters. This grammar generates all and only those regulatory arrangements of the collection, as well as new ones which are consistent with the biological principles of the collection. In this paper, some ideas towards a unified model of the /spl sigma//sup 70/ and the /spl sigma//sup 54/ bacterial promoters are presented. This model should reflect the biological differences on the possible regulatory mechanisms of these collections. The /spl sigma//sup 54/ class represents an intermediate step between the 7/sup 0/ promoters and those present in higher organisms. Based on the biology of these bacterial promoters a hypothesis is proposed which stipulates that in principle it is feasible to activate /spl sigma//sup 70/ promoters at a distance, an exclusive property of the /spl sigma//sup 54/ class shared with promoters from higher organisms. Assuming this hypothesis is correct, some a ideas supporting a unique "universal" grammar for the /spl sigma//sup 70/ and /spl sigma//sup 54/ promoters are presented.
Identity Theft: How to Protect Your Most Valuable Asset
Authors: Robert J. Hammond, Jr Hammond
Venue:  (2002)

:Don't give anyone the power or the means to assume your identity, ruin your good name, steal your hard-earned credit, demolish your credit rating, or even subject you to criminal prosecution. This book shows you how to keep your identity protected, safe, and accessible by only one person -- you! While your fingerprints are yours alone and cannot be used by anyone else, your valuable identifying data -- Social Security number, birth certificate, credit card numbers, telephone calling card numbers, and the like -- can fall into the wrong hands and be used against you. Robert Hammond helps you understand the mind of the identity thief. He shows how to recognize those unscrupulous individuals who may be in your immediate vicinity: a family member or good friend, an HR assistant in your company, the high school computer wiz down the street, or even the new teller at your heighborhood bank. Instead of becoming suspicious of everyone around you, Hammond explains how identity theft occurs, who the likely victims are, how to minimize your risk, and what you can do if your identity has been stolen. Protect yourself from what is quickly becoming one of the most prevalent and destructive crimes of the 21st century.
Visualizing Interactions in Distributed Java Applications
Authors: Nishant Bawa, Sudipto Ghosh
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Distributed Java applications represent a large growth area in software. Such applications are composed of distributed components that interact with each other to provide the desired functionality. Visualization of these interactions helps designers, programmers and testers in many aspects of software development: understanding application behavior, testing, debugging, checking conformance of the implementation with the design, and performance tuning. We have developed a technique to visualize execution of distributed Java RMI-based applications in terms of sequences of method calls between distributed objects. In this paper we describe the technique and a prototype implementation of a Tool for Remote Interactions Monitoring (TRIM).
Energy-Efficient Deterministic Routing Protocols in Radio Networks
Authors: Koji Nakano, Stephan Olariu, Albert Zomaya
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

A radio network (RN, for short) is a distributed system populated by small, bulk-produced, handheld radio transceivers, running on batteries. Since recharging batteries may not be possible while on mission, it is important to design protocols that are highly energy-efficient. In this work, we address the problem of energy-efficient routing in k-channel RNs. An important subproblem is that of permutation routing an instance of which involves p stations each storing \math items. Since in the worst case each item must be transmitted at least once, every permutation routing protocol must take \math time slots. Similarly, each station must be awake for at least \math time slots.Our main contribution is to present an almost optimal energy-efficient permutation routing protocol on the k-channel, p-station RN that routes n items in at most \math time slots, with no station being awake for more than \math time slots, where \math, \math, and \math.
A Heuristic Approach to Improve a Branch and Bound Based Program Partitioning Algorithm
Authors: Masami Takata, Kazuki Joe, Yoshitoshi Kunieda
Venue: Proceedings of the 1999 International Workshop on Innovative Architecture (1999)

In this paper, we propose several heuristics that improve the branch and bound based program partitioning algorithm proposed by Girkar et. al., and evaluate the effectiveness by experiments. The heuristic depends heavily on the element order of edges of a given task graph. Therefore, it is necessary to sort the edges carefully to make effective use of the heuristic. Different sorting methods are investigated and experimentally evaluated. Approximate solutions that provide a sufficient practical partitioning were obtained using the accelerated heuristic, and execution times and error compared to the optimal solutions decreased considerably by sorting the edges of the task graph.
Description and formal specification of the Link Layer of P1394
Authors: S. P. Luttik
Venue:  (1997)

We give a formal specification in $\mu$CRL of the Link Layer as described in the IEEE document ``P1394 Standard for a High Performance Serial Bus''''; this specification may serve as a starting point for further verification.
On Time Versus Space
Authors: John E. Hopcroft, Wolfgang J. Paul, Leslie Valiant
Venue:  (1975)

It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Consequently, for tape constructable t(n), the class of languages recognizable by multitape Turing machines of time complexity t(n) is strictly contained in the class of languages recognized by Turing machines of tape complexity t(n). In particular, the context sensitive languages can not be recognized in linear time by deterministic multitape Turing machines. Keywords and phrases: Turing machines, time complexity, tape complexity.
Experiments on Machine Learning Techniques for Sensor Fusion
Authors: Katti Faceli, Andre C. P. L. de Carvalho, Solange O. Rezende
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Mobile robots rely on sensor data to have a representation of their environment.However theSensor usually provide incomplete, inconsistent or inaccurate information.Sensor fusion have bee successfully employed to enhance the accuracy of sensor measures.This article proposes and investigates the use of artificial intelligence techniques for sensor fusion to improve the Accuracy and reliability of a distance between a root and an object in its work environment.
Using a discrete event simulation to test a generic architecture for complex real-time systems
Authors: I. Benyahia
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

The new generation of real-time systems is described as complex because of the great amount of dependent parameters to be handled in a specified time. These parameters, often represent the interconnected components of these systems interaction environments. Our contribution is the development of a generic architecture for these systems. Object-oriented techniques are used to model the system and the environment components. Thus, the complex interconnections between these components are considered and their processing is found to be easier. To test this architecture, we have developed a prototype that uses a discrete event simulation Due to its properties, it is possible to represent in a realistic manner real-time systems behavior and appraise the benefits of the architecture.
SynRGEN: An Extensible File Reference Generator
Authors: Maria R. Ebling, Mahadev Satyanarayanan
Venue:  (1994)

SynRGen, a synthetic file reference generator operating at the system call level, is capable of modeling a wide variety of usage environments. It achieves realism through trace-inspired micromodels and flexibility by combining these micromodels stochastically. A micromodel is a parameterized piece of code that captures the distinctive signature of an application. We have used SynRGen extensively for stress testing the Coda File System. We have also performed a controlled experiment that demonstrates SynRGen''s ability to closely emulate real users --- within 20% of many key system variables. In this paper we present the rationale, detailed design, and evaluation of SynRGen, and mention its applicability to broader uses such as performance evaluation.
Fragment Reconstruction: Providing Global Cache Coherence in a Transactional Storage System
Authors: Atul Adya, Miguel Castro, Barbara Liskov, Umesh Maheshwari, Liuba Shrira
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Cooperative caching is a promising technique to avoid the increasingly formidable disk bottleneck problem in distributed storage systems; it reduces the number of disk accesses by servicing client cache misses from the caches of other clients. However, existing cooperative caching techniques do not provide adequate support for fine-grained sharing. In this paper, we describe a new storage system architecture, split caching, and a new cache coherence protocol, fragment reconstruction, that combine cooperative caching with efficient support for fine-grained sharing and transactions. We also present the results of performance studies that show that our scheme introduces little overhead over the basic cooperative caching mechanism and provides better performance when there is false sharing.
Identifying a control function in two-dimensional parabolic inverse problems
Authors: Mehdi Dehghan
Venue: Applied Mathematics and Computation (2003)

Numerical solution of the parabolic partial differential equations with an unknown parameter play a very important role in engineering applications. This study presents numerical schemes for solving two two-dimensional parabolic inverse problems, i.e. for the determination of some unknown functions in the parabolic partial differential equations. These schemes are developed for determining the parameter p(t) which satisfy ut =uxx + uyy + p(t)u + φ, in R × (0, T], u(x, y, 0) = f(x, y), (x, y) ∈ R = [0,1]2. It is assumed that u is known on the boundary of R and subject to the integral overspecification over a portion of the spatial domain ∫01 ∫01 u(x, y, t) dxdy = E(t), 0 ≤ t ≤ T, or to the overspecification at a point in the spatial domain u(x0, y0, t) = E(t), 0 ≤ t ≤ T, where E(t) is known and (x0, y0) is a given point of R. These schemes are considered for identifying the control parameter which produces, at any given time, a desired energy distribution in the spacial domain, or a desired temperature distribution at a given point in the spacial domain. The Saulyev's finite difference techniques are used to compute the solution. Although the resulting difference equations do not appear explicit, a suitable use of the equations make them explicit. These explicit schemes are unconditionally stable. Numerical experiments are presented to demonstrate the accuracy of the finite difference schemes and the efficiency of the proposed computational procedures.
The Double Scheme: Deadlock-free Dynamic Reconfiguration of Cut-Through Networks
Authors: Ruoming Pang, Timothy Mark Pinkston, José Duato
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Network-based computing systems often require the ability to reconfigure the routing algorithm to reflect changes in network topology if and when those changes occur. The process of reconfiguring a network's routing capabilities may lead to deadlock if not handled properly. In this paper, we propose efficient and deadlock-free dynamic reconfiguration techniques that are generically applicable to distributed routing algorithms and networks, including those, which use wormhole switching. The proposed techniques do not impede the transmission of packets during the reconfiguration process, thus providing increased network availability and quality-of-service (QoS) support as compared to traditional techniques based on static reconfiguration.
Numerical Solution of the Maxwell Equations for Circular and Forward Backward Birefringence/Dichroism: Optical NMR and ESR
Authors: M. W. Evans, A. Lakhtakia
Venue:  (1991)

A numerical solution of the Maxwell equations is developed for novel non-linear circular and forward backward birefringence and dichroism caused by the conjudate product of a circularly polarised pump laser, or alternatively, static magnetic flux density. Maxwell equations for these effects are developed to the point at which they may be solved numerically with standard library routines. These methods are discussed in relation to the semi-classical theory of birefringence due to each of the above conditions, and to the emerging thoery of imaging optical NMR, a potentially useful analytical technique in which the magnetic flux density of an NMR instrument is supplemented by a circularly polarised pump laser.
Adaptive and Virtual Reconfigurations for Effective Dynamic Job Scheduling in Cluster Systems
Authors: Songqing Chen, Li Xiao, Xiaodong Zhang
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

In a cluster system with dynamic load sharing support, a job submission or migration to a workstation is determined by the availability of CPU and memory resources of the workstation at the time [3]. In such a system, a small number of running jobs with unexpectedly large memory allocation requirements may significantly increase the queuing delay times of the rest of jobs with normal memory requirements, slowing down executions of individual jobs and decreasing the system throughput. We call this phenomenon as the job blocking problem because the big jobs block the execution pace of majority jobs in the cluster. Since the memory demand of jobs may not be known in advance and may change dynamically, the possibility of unsuitable job sub-missions/migrations to cause the blocking problem is high, andthe existing load sharing schemes are unable to effectively handle this problem. We propose a software method incorporating with dynamic load sharing, which adaptively reserves a smallset of workstations through virtual cluster reconfiguration to provide special services to the jobs demanding large memory allocations. This policy implies the principle ofhortest-remaining-processing-time policy. As soon as the blocking problem is resolved by the reconfiguration, the system will adaptively switch back to the normal load sharing state. We present three contributions in this study. (1) we quantitatively present the conditionsto cause the job blocking problem. (2) We present the adaptive software method in a dynamic load sharing system. We show the adaptive process causes little additional overhead. (3) Conducting trace-driven simulations, we show that our method can effectively improve the cluster computing performance by quickly resolving the job blocking problem. The effectiveness and performance insights are also analytically verified.
A Program Development System Execution Supervisor
Authors: James E. Archer,  Jr., Andrew I. Shore
Venue:  (1979)

The Cornell Program Development System is an experimental vehicle to explore the applicability of highly cooperative tactics to a contemporary development environment. The CPDS provides significant facilities for modifying and immediately executing programs. The execution supervisor and the internal user program representation it uses to implement these facilities are described.
Web Journalism: Practice and Promise of a New Medium
Authors: James Glen Stovall
Venue:  (2003)

:Journalism on the Web explores the current practices and future possibilities of Web journalism and examines the characteristics of the Web that distinguish it from traditional media. The author guides students through discussion of the traditional practices of journalism, such as reporting, editing, photojournalism, and design, while showing how the distinguishing features of the Web -- capacity, immediacy, flexibility, permanency, and interactivity - offer new storytelling possibilities. The traditional principles of journalism, particularly journalistic writing that emphasizes accuracy, clarity, precision and efficiency, are emphasized throughout the text.FeaturesThe first three chapters offer an in-depth examination of the Web as an individual news medium, taking students beyond the idea that Web news is simply a newspaper on screen.An inside look at MSNBC provides students with an idea of what it's like to be inside a 24-hour Web news organization (Ch. 13).Three chapters (4, 5, and 6) on lateral thinking ask students to think beyond the traditional narrative storytelling forms of the inverted pyramid and present a variety of forms and structures to present information."Cool Ideas" sidebars, located throughout the book, offer short descriptions of innovative ideas of Web journalism, to stimulate creative thinking.Web site references at the end of each chapter provide professors with the best sites available for keeping up with advances in Web journalism. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Random walk with a heavy-tailed jump distribution
Authors: J. W. Cohen
Venue:  (2000)

The classical random walk of which the one-step displacement variable $\mathbf x$ has a first finite negative moment is considered. The R.W. possesses an unique stationary distribution; $\mathbf x$ is a random variable with this distribution. It is assumed that the righthand and/or the lefthand tail of the distribution of ${\mathbf u}$ are heavy-tailed. For the type of heavy-tailed distribution considered in this study a contraction factor ${\Delta (a)}$ exists with ${\Delta (a)} {\downarrow 0}$ for $a \uparrow 1$, and $a \uparrow 1$ is equivalent with $\E \{ {\mathbf u} \} {\uparrow 0}$. It is shown that ${\Delta (a)} {\mathbf x}$ converges in distribution for $a \uparrow 1$. It is the analysis of the tail of this limiting distribution of ${\Delta (a)} {\mathbf x}$ which is the main purpose of the present study in particular when ${\mathbf u}$ is a mix of stochastic variables ${\mathbf u}_i , i = 1 , \ldots , N$, each ${\mathbf u}_i$ having its own heavy tail characteristics for its right- and lefthand tails. For an important case it is shown that for the tail of the distribution of ${\Delta (a)} {\mathbf x}$ an asymptotic expression in the variables ${\Delta (a)}$ and $t$ for ${\Delta (a)} {\downarrow 0}$ and ${t \rightarrow \infty}$ can be derived. For this asymptotic relation the dominating term is completely determined by the heavier tail of the $2N$ tails of the ${\mathbf u}_i$; the other terms of the asymptotic relation show the influence of less heavier tails and, depending on $t$, the terms may have a contribution which is not always negligible. The study starts with the derivation of a functional equation for the L.S.-transform of the distribution of ${\mathbf x}$ and that of the excess distribution of the stationary idle time distribution. For several important cases this functional equation could be solved and thus has led to the above mentioned asymptotic result. The derivation of it required quite some preparation, because it needed an effective description of the heavy-tailed jump vector ${\mathbf u}$. It was obtained by prescribing the heavy-tailed distributions of $[{\mathbf u}]^+ = \max (0 , {\mathbf u} )$ and $[{\mathbf u}]^- = \min (0, {\mathbf u})$. The random walk may serve as a model for the actual waiting process of a GI/G/1 queueing model; in that case the distribution of ${\mathbf u}$ is that of the difference of the service time and the interarrival time. The analysis of the present study then describes the heavy-traffic theory for the case with heavy-tailed service-and/or interarrival time distribution.
A proposal for standardized software dependability data
Authors: H. Hecht
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

The article describes requirements for and implementation of an error classification methodology for high integrity systems. It is largely based on a software error classification scheme recommended for nuclear power safety systems. The emphasis is on the purposes of the classification, the required data, and their logical ordering. There is no intention to propose a specific data format or database management system. Nevertheless, it is very convenient to adopt the terminology of a generic database manager.
Estimating flow distributions from sampled flow statistics
Authors: Nick Duffield, Carsten Lund, Mikkel Thorup
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

Passive traffic measurement increasingly employs sampling at the packet level. Many high-end routers form flow statistics from a sampled substream of packets. Sampling is necessary in order to control the consumption of resources by the measurement operations. However, knowledge of the statistics of flows in the unsampled stream remains useful, for understanding both characteristics of source traffic, and consumption of resources in the network.This paper provide methods that use flow statistics formed from sampled packet stream to infer the absolute frequencies of lengths of flows in the unsampled stream. A key part of our work is inferring the numbers and lengths of flows of original traffic that evaded sampling altogether. We achieve this through statistical inference, and by exploiting protocol level detail reported in flow records. The method has applications to detection and characterization of network attacks: we show how to estimate, from sampled flow statistics, the number of compromised hosts that are sending attack traffic past the measurement point. We also investigate the impact on our results of different implementations of packet sampling.
A System for Efficiently Self-Reconstructing E-1 1 \over 2 -Track Switch Torus Arrays
Authors: T. Horita, I. Takanami
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

A mesh-connected processor array consists of many similar processing elements (PEs), which can be executed in both parallel and pipeline processing. FOT the implementation of an array of large numbers of processors, it is necessary to consider some fault tolerant issues to enhance the (fabrication-time) yield and the (ran-time) reliability.