ppxscal/embedding_network huggingface dataset:
Functional labels and syntactic entropy on DNA strings and proteins
Authors: A. Carbone, M. Gromov
Venue: Theoretical Computer Science (2003)

The DNA of a cell is an object which admits a simple mathematical description and a convenient representation in a computer (it is given by an easily manipulatable list, a finite sequence in four letters typically of length between one million and 10 billions). In contrast to this, there is no simple way of describing the cell neither statically and even less temporally (dynamically). We shall indicate here a possible formalism of combinatorial and numerical (entropic) structures on spaces of sequences which reflect, up to some degree, the organization and functions of DNA and proteins.
Global Convergence of Damped Newton''s Method for Nonsmooth Equations, via the Path Search
Authors: Daniel Ralph
Venue:  (1991)

A natural damping of Newton''s method for nonsmooth equations is presented. This damping, via the path search instead of the traditional line search, enlarges the domain of convergence of Newton''s method and therefore is said to be globally convergent. Convergence behavior is like that of line search damped Newton''s method for smooth equations, including Q-quadratic convergence rates under appropriate conditions. Applications of the path search include damping Robinson-Newton''s method for nonsmooth normal equations corresponding to nonlinear complimentarity [sic] problems and variational inequalities, hence damping both Wilson''s method (sequential quadratic programming) for nonlinear programming and Josephy-Newton''s method for generalized equations. Computational examples from nonlinear programming are given.
Sensor Interpretation and Task-Directed Planning Using Perceptual Equivalence Classes
Authors: Bruce R Donald, James Jennings
Venue:  (1991)

We consider how a robot may interpret its sensors and direct its actions so as to gain more information about the world, and to accomplish manipulation tasks. The key difficulty is uncertainty, in the form of noise in sensors, error in control, and unmodelled or unknown aspects of the environment. Our research focuses on general techniques for coping with uncertainty, specifically, to sense ther state of the task, adapt to changes, and reason to select actions to gain information and achieve the goal. Sensors yield partial information about the world. When we interrogate the environment through our sensors, we in effect view a projection of the world onto the space of possible sensor values. We investigate the structure of this sensor space and its relationship to the world. We observe that sensors partition the world into perceptual equivalence classes, that can serve as natural ``landmarks.'''' By analyzing the properties of these equivalence classes we develop a ``lattice'''' and a ``bundle'''' structure for the information available to the robot through sensing and action. This yields a framework in which we develop and characterize algorithms for sensor-based planning and reasoning.
Studies for realizing soft TCCS residing on top of Ethernet LAN
Authors: N. Nakano, T. Ando, F. Sato, T. Mizuno
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

In this paper, the theoretical studies and solutions regarding problems for realizing Soft TCCS (Time Critical Communication System), residing on top of Ethernet LAN are presented. We analyze Ethernet LAN including its precise back off sequence to obtain throughput and delay characteristics in a light loaded circumstances. We also analyze the same performance characteristics effected by multi-modal condition which is the mode of transmitting both short packets for control messages and long packets for bulk data concurrently in Factory Automation system. These theoretical studies are validated through computer simulations. We end by presenting the definition of the bandwidth in Ethernet LAN and also formulae regarding its estimation needed for admission control to maintain the total load within the predetermined value.
Experience With a Course on Architectures for Software Systems Part I: Course Description
Authors: David Garlan, Mary Shaw, Chris Okasaki, Curtis M. Scott, Roy F. Swonger
Venue:  (1992)

As software systems grow in size and complexity their design problem extends beyond algorithms and data structures to issues of system design. This area receives little or no treatment in existing computer science curricula. Although courses about specific systems are usually available, there is no systematic treatment of the organizations used to assemble components into systems. These issues -- thesoftware architecture level of software design -- are the subject of a new course that we taught for the first time in Spring 1992. In this pair of reports, Part I presents the motivation for the course, the content and structure of the current version, and our plans for improving the next version. Part II consists of teaching materials from the first offering, including assignments and overheads for lectures.
Robustness Testing of A Distributed Simulation Backplane
Authors: Kimberly Fernsler, Philip Koopman
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

Creating robust software requires not only careful specification and implementation, but also quantitative measurement. This paper describes Ballista exception handling testing of the High Level Architecture Run-Time Infrastructure (HLA RTI). The RTI is a standard distributed simulation system intended to provide completely robust exception handling, yet implementations have normalized robustness failure rates as high as 10%. Non-robust testing responses include exception handler crashes, segmentation violations, "unknown" exceptions, and task hangs. Other issues include different robustness failure modes across ports to two operating systems, and mandatory client machine rebooting after a particular RTI failure.Testing the RTI led to scalable extensions of the Ballista architecture for handling exception-based error reporting models, testing object-oriented software structures (including callbacks, pass by reference, and constructors), and operating in a state-rich, distributed system environment. These results demonstrate that robustness testing can provide useful feedback to high-quality software development processes, and can be applied to domains well beyond the previous work on testing operating systems.
Process Migration: A Generalized Approach Using a Virtualizing Operating System
Authors: Tom Boyd, Partha Dasgupta
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Process migration has been used to perform specialized tasks, such as load sharing and checkpoint/restarting long running applications. Implementation typically consists of modifications to existing applications and the creation of specialized support systems, which limit the applicability of the methodology. Off the shelf applications have not benefited from process migration technologies, mainly due to the lack of an effective generalized methodology and facility. The benefits of process migration include mobility, checkpointing, relocation, scheduling and on the fly maintenance. This paper shows how regular, shrink-wrapped applications can be migrated.The approach to migration is to virtualize the application by injecting functionality into running applications and operating systems. Using this scheme, we separate the physical resource bindings of the application and replace it with virtual bindings. This technique is referred to as virtualization. We have developed a virtualizing Operating System (vOS), residing on top of Windows 2000 that injects stock applications with the virtualizing software. It coordinates activities across multiple platforms providing new functionality to the existing applications. The vOS makes it possible to build communities of systems that cooperate to run applications and share resources non-intrusively while retaining application binary compatibility.
Unsupervised learning of mDTD extraction patterns for web text mining
Authors: Dongseok Kim, Hanmin Jung, Gary Geunbae Lee
Venue: Information Processing and Management: an International Journal (2003)

This paper presents a new extraction pattern, called modified Document Type Definition (mDTD), which relies on analytical interpretation to identify extraction target from the contents of the Web documents. From conventional DTD in XML documents, we develop two major extensions: first, we introduce an extended content model with type-specific operators and keywords, and second, we refine the way to interpret the conventional DTD rules. As the result of the two, our mDTD becomes freely represent HTML structures and extraction targets. The goal of mDTD is to overcome the current major barriers, that is, domain portability (with minimal human intervention) and high performance, on information extraction. The human experts compose an mDTD as seed rules, and then our system automatically extracts a set of instances by the mDTD from structured documents on the Web. We use the extracted instances as Sequential mDTD Learner (SmL) inputs to generate new mDTD rules based on part-of-speech tags and features for lexical similarity. This process does not require any hand-annotated corpus. We have experimented with 330 Korean and 220 English Web documents on audio and video shopping sites. The average extraction precision is 91.3% for Korean and 81.9% for English.
Dreamweaver MX Developer Certification Study Guide, 1 edition
Authors: Marc Campbell
Venue:  (2002)

:The only classroom-based training and self-assessment system! Osborne's Dreamweaver Developer Certification Study Guide provides 100% complete coverage of all objectives for this challenging exam. Based on 300,000+ hours of IT training experience, the book contains hundreds of practice exam questions and hands-on exercises. The CD-ROM features full practice exam software with interactive tutorials and lab simulations, plus an adaptive test engine. 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
A configurable mobile agent data protection protocol
Authors: Paolo Maggi, Riccardo Sisto
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper addresses the problem of protecting the data carried by mobile agents from the possible attacks of malicious execution hosts. Specifically, we consider protection mechanisms that, instead of preventing malicious hosts from tampering with the collected data, simply aim at detecting tampering attempts. The various proposals that appeared in the literature so far are characterized by several limitations, some of which have been pointed out recently. In particular, data truncations may not be detected, and a binding of the static code to the collected data is missing. This paper takes into account such criticisms and formally defines a new protocol that does not suffer from all the previous limitations. Such a protocol is also configurable, according to the protection level needed. In this way, the minimum protection level compatible with the needed security properties can be selected each time.
The Dangerous 'All' in Specifications
Authors: Daniel M. Berry, Erik Kamsties
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

Rupp and Götz observe that some, but not all, requirement specification sentences involving universal quantification, are dangerous because they are usually not true. Jackson and Zave provide a classification of requirement specification sentences into indicative and optative sentences. It is observed that the dangerous sentences involving universal quantifiers are all indicative.
Microsoft Office PowerPoint 2003 Step by Step
Venue:  (2003)

Teach yourself how to use the presentation graphics capabilities in PowerPoint 2003-one step at a time! Learn how to turn your ideas into powerful presentations through easy-to-follow lessons and hands-on practice exercises. 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
Computer Forensics and Cyber Crime: An Introduction
Authors: Marjie T. Britz
Venue:  (2003)

:This book fully defines computer-related crime and the legal issues involved in its investigation. It provides a framework for the development of a computer crime unit. This book is the only comprehensive examination of computer-related crime and its investigation on the market. It includes an exhaustive discussion of legal and social issues, fully defines computer crime, and provides specific examples of criminal activities involving computers, while discussing the phenomenon in the context of the criminal justice system. Computer Forensics and Cyber Crime provides a comprehensive analysis of current case law, constitutional challenges, and government legislation. For computer crime investigators, police chiefs, sheriffs, district attorneys, public defenders, and defense attorneys. 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
The role of virtual world design in collaborative working
Authors: A. Huxor
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

Introduces the concept of Internet-based shared worlds, and certain problems that have been encountered in their use for collaborative working. These problems can be addressed, it is argued, by the use of architectural notions, such as grounding the model in a physical institution and looking at the role of locales in real working environments. The problem of access to these locales is made by drawing a parallel between the structure of the online resources and the structure of physical spaces described in space syntax theory. Results from the latter, it is suggested, can inform the design of virtual spaces to facilitate both privacy and chance encounters.
Randomization and Failure Detection: A Hybrid Approach to Solve Consensus
Authors: Marcos K. Aguilera, Sam Toueg
Venue:  (1996)

We present a Consensus algorithm that combines randomization and unreliable failure detection, two well-known techniques for solving Consensus in asynchronous systems with crash failures. This hybrid algorithm combines advantages from both approaches: it guarantees deterministic termination if the failure detector is accurate, and probabilistic termination otherwise. In executions with no failures or failure detector mistakes, the most likely ones in practice, Consensus is reached in only two asynchronous rounds.
Fast Computation of Time Deviation and Modified Allan Deviation for Telecommunications Clock Stability Characterization
Authors: M. Li, H.-M Peng, C.-S Liao
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

Time and frequency characterization of precision clocks and oscillators is an important ask in the maintenance of time and frequency standards. Recently, time domain signal characterization of clocks is generally preferred and several performance measures of clocks and oscillators are defined in ITU-T Recommendation G.810. Among these measures, Maximum Time Interval Error (MTIE), Time Deviation (TDEV)and Modified Allan Deviation (MDEV) are frequently used, especially in telecommunications measurement. However, the direct computation of MTIE, TDEV and MDEK defined in ITU-T Recommendation G.81O, tends to be unmanageable when the number of samples becomes large. In this paper, we propose a fast computation approach for TDEV and MDEV The approach is based on therecursive algorithm and the computation exactly conforms to the ITU-T G.810 definition. As compared with the direct computation approach, the time complexity of the proposedapproach is reduced by a factor of N, the number of samples. It reveals that the real-time measurement or monitoring will be feasible by employing the proposed computationapproach.
Adobe GoLive 6 For Dummies
Authors: William B. Sanders
Venue:  (2002)

:Tamed and translated for the novice or professional, Adobe GoLive 6 For Dummies will get you up to speed quickly with the latest version of Adobe GoLive -- the ideal software for creating engaging, dynamic and static Web sites. Provides great advice for effective site design and management. This fast and friendly book shows you how to use GoLive's built-in features for JavaScript, DHTML, CSS, and other technologies.
A Light-Weight Process for Capturing and Evolving Defect Reduction Experience
Authors: Victor R. Basili, Mikael Lindvall, Forrest Shull
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

Selecting technologies for developing software is acrucial activity in software projects. Defect reduction isan example of an area in which software developers haveto decide what technologies to use. CeBASE is a NSFfunded project that has the role of improving softwaredevelopment by providing decision support on theselection of techniques and tools. The decision support isbased on empirical data organized in experience basesand refined into high-level models. Empirical data iscollected through various activities, for example througheWorkshops in which experts discuss important issues,and formalized using the lightweight knowledge dust toknowledge pearl process.
CDMA Capacity and Quality Optimization, 1 edition
Authors: Adam Rosenberg, Sid Kemp
Venue:  (2002)

:With this essential expert guide and toolkit, you can get the best of CDMA (Code Division Multiple Access) -- now a key component of 3G systems worldwide. In CDMA Capacity and Quality Optimization, experts Adam Rosenberg and Sid Kemp explain every aspect of CDMA cellular networks: Radio Frequency, Telephony, Signaling, and Data Transmission.
Macroscopic model of agent-based load balancing on grids
Authors: Yuanshi Wang, Jiming Liu
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We present a dynamic model of agent-based load balancing on grids. Our goal is to explore the effects of agents' strategies on the quality of load balancing. We show that under certain conditions, the model exhibits a known phenomenon that the load is perfectly balanced. This result is in agreement with recent experimental results on load balancing through Anthill. On the other hand, under general conditions, our model predicts unexpected phenomena that all the load balancing states tend to a unique steady state, where the load is not absolutely even balanced. The quality of load balancing, e.g., whether or not the load can be perfectly balanced, depends on agents' strategies. To measure the quality of load balancing, we define a total utility gain and further discuss the optimization of total utility gains.
Determining the automorphism group of a hyperelliptic curve
Authors: Tanush Shaska
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

In this note we discuss techniques for determining the automorphism group of a genus $g$ hyperelliptic curve $\X_g$ defined over an algebraically closed field $k$ of characteristic zero. The first technique uses the classical $GL_2 (k)$-invariants of binary forms. This is a practical method for curves of small genus, but has limitations as the genus increases, due to the fact that such invariants are not known for large genus.The second approach, which uses dihedral invariants of hyperelliptic curves, is a very convenient method and works well in all genera. First we define the normal decomposition of a hyperelliptic curve with extra automorphisms. Then dihedral invariants are defined in terms of the coefficients of this normal decomposition. We define such invariants independently of the automorphism group $\Aut (\X_g)$. However, to compute such invariants the curve is required to be in its normal form. This requires solving a nonlinear system of equations.We find conditions in terms of classical invariants of binary forms for a curve to have reduced automorphism group $A_4$, $S_4$, $A_5$. As far as we are aware, such results have not appeared before in the literature.
Parallel Checkpoint/Restart without Message Logging
Authors: Kalman Z. Meth, William G. Tuel
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

We describe a parallel checkpoint/restart mechanism. The checkpoint is performed among the participating parallel tasks using a new algorithm that we call stop and discard. Tasks may be checkpointed without waiting for previously sent messages to be received. Specific message logging is not required. Message data that may be in transit is saved in the checkpoint files.
An Architecture for Automatic Reference Linking (Extended Version)
Authors: Donna bergmark, Carl Lagoze
Venue:  (2001)

Along with the explosive growth of the Web has come a great increase in on-line scholarly literature. More and moNot only is Web retrieval usually faster than a walk to the library, but the information obtained from the Web is generally more current than what appears in printed publications. The increasing proportion of on-line scholarly literature makes it possible to implement functionality desirable to all researchers -the ability to access cited documents immediately from the citing paper. Implementing this direct access is called "reference linking". While many authors insert explicit hyperlinks into their papers to support reference linking, it is by no means a universal practice. The approach taken by the Digital Library Research Group at Cornell employs "value-added surrogates" as a generalizable mechanism for providing reference-linking behavior in Web documents. Given the URL of an on-line document, a surrogate object is constructed for that paper, which then processes document''s content to extract reference linking data. The surrogate then exposes the reference linking data through a well-defined API, permitting the construction of reference linking services by external clients. We present two examples of the many possible reference linking applications buildable on this API. We also describe a metric that measures the API''s performance; currently we are (automatically) extracting reference linking information from HTML papers with more than 80
Experiences in Programming the J-Machine
Authors: Daniel Maskit, Stephen Taylor
Venue:  (1993)

No Abstract.
Extensible Resource Management For Cluster Computing
Authors: Nayeem Islam, Mark S. Squillante, Liana L. Fong, Ajei S. Gopal, Andreas L. Prodromidis
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Advanced general-purpose parallel systems should be able to support diverse applications with different resource requirements without compromising effectiveness and efficiency. We present a new resource management model for cluster computing that allows multiple scheduling policies to co-exist dynamically. In particular, we have built ``Octopus'', an extensible and distributed hierarchical scheduler that implements new space-sharing, gang-scheduling and load-sharing strategies. A series of experiments performed on an IBM SP2 suggest that ``Octopus'' can effectively match application requirements to available resources, and improve the performance of a variety of parallel applications within a cluster.