ppxscal/embedding_network huggingface dataset:
Chemical genetic algorithms: coevolution between codes and code translation
Authors: Hideaki Suzuki, Hidefumi Sawai
Venue: Proceedings of the eighth international conference on Artificial life (2002)

A chemical genetic algorithm (CGA) in which several types of molecules (information units) react with each other in a cell is proposed. Translation from codons (short substrings of bits) in DNA to amino acids (real value units) is specified by a particular set of translation molecules created by the reaction between tRNA units and amino acid units. This adaptively changes and optimizes the fundamental genotype-phenotype mapping during evolution. Through the struggle between cells containing a DNA unit and small molecular units, the codes in DNA and the translation table described by the small molecular units coevolve, and a specific output function (protein), which is used to evaluate a cell's fitness, is optimized. To demonstrate the effectiveness of the CGA, the algorithm is applied to a set of deceptive problems, and the results by using the CGA are compared to those by using a simple GA. It is shown that the CGA has far better performance for the tested functions than the conventional simple GA.
Proxac: An Editor for Program Transformation
Authors: Jan L. A. Van de Snepscheut
Venue:  (1993)

No abstract available.
Programming the Nintendo Game Boy Advance
Authors: Jonathan S. Harbour
Venue:  (2003)

:Now go beyond mere play and design your own games on the Gameboy Advance! The only book of its kind on the market, Programming the Gameboy Advance is written in an easily understood manner suitable for beginning games developers. If you're a more advanced programmer, you can go right to the sections describing the hardware systems. Take away from this book a game framework that you can use to develop high-quality games, and also gain an understanding of the many concepts needed in creating games for this platform. You'll need a PC to run the compiler and emulator, plus a download cable for testing small games.
Recursive Generation of Partitionable Graphs
Authors: Boros E., Gurvich V., Hougardy S.
Venue:  (1999)

Results of Lov\''asz (1972) and Padberg (1974) imply that partitionable graphs contain all the potential counterexamples to Berge''s famous Strong Perfect Graph Conjecture. A recursive method of generating partitionable graphs was suggested by Chv\''atal, Graham, Perold and Whitesides (1979). Results of Seb\H{o} (1996) entail that Berge''s conjecture holds for all the partitionable graphs obtained by this method. Here we suggest a more general recursion. Computer experiments show that it generates {\em all} the partitionable graphs with $\go = 3, \ga \leq 9$ (we conjecture that the same will hold for bigger $\ga$, too) and ''almost all'' for $(\go,\ga) = (4,4)$ and $(4,5)$. Here $\ga$ and $\go$ are respectively the clique and stability numbers of a partitionable graph, i.e. numbers of vertices in its maximum clique and stable set. All the partitionable graphs generated by our method contain a {\em critical $\go$-clique}, that is an $\go$-clique which intersects only $2\go-2$ other $\go$-cliques. This property might imply that in our class there are no counterexamples to Berge''s conjecture (c.f. Seb\H{o} (1996)), however this question is still open.
Parallel Refinement of Unstructured Meshes
Authors: Jose Castanos, John E. Savage
Venue:  (1999)

Parallel Refinement of Unstructured Meshes
Meta-circular abstract interpretation in prolog
Authors: Michael Codish, Harald Søndergaard
Venue: The essence of computation: complexity, analysis, transformation (2002)

We give an introduction to the meta-circular approach to the abstract interpretation of logic programs. This approach is particularly useful for prototyping and for introductory classes on abstract interpretation. Using interpreters, students can immediately write, adapt, and experiment with interpreters and working dataflow analysers. We use a simple meta-circular interpreter, based on a "non-ground Tp" semantics, as a generic analysis engine. Instantiating the engine is a matter of providing an appropriate domain of approximations, together with definitions of "abstract" unification and disjunction. Small changes of the interpreter let us vary both what can be "observed" by an analyser, and how fixed point computation is done. Amongst the dataflow analyses used to exemplify this approach are a parity analysis, groundness dependency analysis, call patterns, depth-k analysis, and a "pattern" analysis to establish most specific generalisations of calls and success sets.
Real-Time System = Discrete System + Clock Variables
Authors: Rajeev Alur, Thomas A. Henzinger
Venue:  (1994)

How can we take a programming language off the shelf and upgrade it into a real-time programming language? Programs such as device drivers and plant controllers must explicitly refer and react to time. For this purpose, a variety of language constructs-including delays, timeouts, and watchdogs-has been put forward. We advocate an alternative answer, namely, to designate certain program variables as clock variables. The value of a clock variable changes as time advances. Timing constraints can be expressed, then, by conditions on clock values. A single new language construct-the guarded wait statement-suffices to enforce the timely progress of a program. Our presentation proceeds in two steps. First, we extend untimed systems (Section 1) with clock variables (Section 2); then we introduce the guarded wait statement (Section 3). The usage of clock variables and the guarded wait statement is illustrated with real-time applications such as round-robin (timeout-driven) scheduling, priority (interrupt-driven) scheduling, and embedded process control (Section 4). Indeed, clock variables generalize naturally to variables that measure environment parameters other than time (Section 5). In keeping with an expository style, all references are clustered in bibliographic remarks at the end of each section. We conclude by pointing to selected literature on formal methods and support tools for our approach to real-time programming (Section 6).
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations
Authors: Christoph W. Kessler, Craig H. Smith
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

Automatic program comprehension is particularly useful when applied to sparse matrix codes, since it allows to abstract e.g. from specific sparse matrix storage formats used in the code. In this paper we describe SPARAMAT, a system for speculative automatic program comprehension suitable for sparse matrix codes, and its implementation.
A Compiler Time Model for Composing Parallel Programs
Authors: Susan Hinrichs
Venue:  (1994)

Many distributed memory machines support connection-based communication instead of or in addition to connection-less message passing. Connection-based communication can be more efficient than message passing because the resources are reserved once for the connection and multiple messages can be sent over the connection. While long-lived connections enable more efficient use of the communication system in some situations, managing connection resources adds another level of complexity to programming such machines. %These long-lived connections are also called virtual channels or %virtual connections on various architectures. iWarp is an example of a distributed memory machine that supports long-lived connections. To aid the iWarp programmer and program generator tools, we developed a tool chain that enables the programmer to define connections and compose parallel programs. The communication tool chain has been in use for four years in various forms. In that time, we have found many benefits and a few pitfalls in our model. This paper describes the design of the programming model and tools and discusses our experiences with this implementation.
A Multiple-View Analysis Model of Debugging Processes
Authors: Shinji Uchida, Akito Monden, Hajimu Iida, Ken-ichi Matsumoto, Hideo Kudo
Venue: Proceedings of the 2002 International Symposium on Empirical Software Engineering (2002)

This paper proposes a model for analyzing the reading strategies in software debugging. The model provides quantitative and objective visions to a human's debugging activity, and provides the framework for clarifying good- and/or bad-strategies for program reading. We have conducted a case study to observe the debugging processes under a controlled environment. The observation includes: Both novice debugger and expert debugger could correctly locate an area that seems to have a bug, however, only the expert subject couldquickly narrow down that area, reading the faulty (or most suspicious) module only will not generally lead to a shorter debugging time, and the most well-performed subjects read the module that seems to be a key to find a fault. This case study suggested that explicit andquantitative evaluation of the debugging process becomes possible by using the proposed model.
Parallel Text Search Methods
Authors: Gerard Salton, Chris Buckley
Venue:  (1987)

An evaluation of recently proposed parallel text search methods does not support the notion that the parallel methods provide large-scale gains in either retrieval effectiveness or efficiency, compared with alternative available search strategies using serial processing machines.
Program Predictability and Data Security
Authors: Charles G. Moore,  III, Richard W. Conway
Venue:  (1974)

NO SUPPLIED
Yes, trees may have neurons
Authors: Alois P. Heinz
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

Neural Trees are introduced. These descendants of decision trees are used to represent (approximations to) arbitrary continuous functions. They support efficient evaluation and the application of arithmetic operations, differentiation and definite integration.
WebScript -A Scripting Language for the Web
Authors: Yin Zhang
Venue:  (1999)

WebScript is a scripting language for processing Web documents. Designed as an extension to Jacl, the Java implementation of Tcl, WebScript allows programmers to manipulate HTML in the same way as Tcl manipulates text strings and GUI elements. This leads to a completely new way of writing the next generation of Web applications. This paper presents the motivation behind the design and implementation of WebScript, an overview of its major features, as well as some demonstrations of its power. 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
Real-Time Rendering Tricks and Techniques in Directx
Authors: Kelly Dempski, D. Sim Dietrich
Venue:  (2002)

:The last several years have seen some exciting advances in the field of real-time graphics. If you're reading this book, then you've decided that you're ready to learn more about the developments in graphics programming. Starting slowly for beginning programmers, Real-Time Rendering Tricks and Techniques in DirectX begins by reviewing recent 3D graphics developments and with an introduction to vectors, matrices, colors, and lighting. Then it's on to rendering graphics! Learn various vertex and pixel shader techniques, discover how to use video as a texture, and get the scoop on several techniques for picking objects in a scene. Whatever your level of programming expertise, let this book serve as your guide to mastering the possibilities of real-time graphics programming.
Quantum Voltage Comparator for 0.07 µm CMOS Flash A/D Converters
Authors: Jincheol Yoo, Kyusun Choi, Jahan Ghaznavi
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

This paper presents a new voltage comparator designcalled Quantum Voltage (QV) comparator for the next generationdeep sub-micron low voltage CMOS flash A/D converter(ADC). Unlike the traditional differential voltagecomparators designed to minimize input-offset voltage errordue to the mismatches in a differential transistor pair,the QV comparators are designed to optimize the input-offsetvoltages by systematically and uniformly varying thetransistor sizes of the differential transistor pair. The QVcomparators allow very small voltage comparison, completeelimination of resistor ladder circuit, and dramaticimprovement of linearity in an ADC.
User centred design: how to design accessible products
Authors: Martin Arnold, Paul Hopewell, Claire Paddison, Phil Parry, Nadya Sustache
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Find out how disabled users interact with information technology and the importance of a 'design for all' approach. Real life examples and demonstrations of assistive technologies Illustrate how to design accessible products.
LSign Reordered
Authors: Viswanath Ramachandran, Pascal Van Hentenryck
Venue:  (1995)

LSign is an elegant domain proposed by Marriott and Stuckey for analyzing constraint logic programming languages over linear real constraints. Its key conceptual ideas are the abstraction of linear constraints by replacing coefficients by their signs and the use of annotations for preserving multiplicity information on the constraints. Unfortunately, the ordering of abstract constraint stores given in the original paper does not capture the intended meaning and makes it impossible to prove the consistency of the abstract operations of LSign. In this paper, we reconsider the domain LSign. Our first contribution is to define a new ordering on abstract constraint stores and to give the meaning of the domain through a monotone concretization function from abstract stores to sets of constraint stores, where a constraint store is a multiset of constraints. Our second contribution is to show that ordering two abstract stores reduces to a matching problem, which can be solved in polynomial time. Our last contribution is to propose a simpler and more precise algorithm for abstract projection and a schema for generating upper bound operations and to prove their consistency.
The Central Classifier Bound - A New Error Bound for the Classifier Chosen by Early Stopping
Authors: Eric Bax, Zehra Cataltepe, Joe Sill
Venue:  (1997)

No abstract available.
Asymptotic behavior of solutions of forced nonlinear neutral delay differential equations with impulses
Authors: Jiaowan Luo, Lokenath Debnath
Venue: The Korean Journal of Computational Applied Mathematics (2003)

Sufficient conditions for asymptotic behavior of the solutions of nonlinear forced neutral delay differential equations with impulses are found. The results given in [2,4,6,7] are generalized and improved.
Ciw: Security Professional Study Guide, 1 edition
Authors: James Stanger, Patrick T. Lane
Venue:  (2002)

:Here's the book you need to prepare for Exam 1D0-470, CIW Security Professional. This Study Guide provides: In-depth coverage of official exam objectives Practical information on security concepts and practices Hundreds of challenging review questions, in the book and on the CD Leading-edge exam preparation software, including a testing engine and electronic flashcards Authoritative coverage of all exam topics, including: Implementing internetworking encryption and encryption methods Analyzing firewall types and firewall terminology Planning security systems and incorporating multiple levels of protection Securing mechanisms and parameters for Windows and UNIX Analyzing router security, threat containment, and intrusion detection Implementing intrusion-detection systems in an enterprise environment Installing operating system add-ons for personal firewalls and native auditing SSH Featured on the CD The enclosed CD is packed with vital preparation tools and materials, beginning with the Sybex EdgeTest testing engine for the exam. Loaded with hundreds of practice questions, it lets you test yourself according to objective areas. You'll also find electronic flashcards for your PC and Palm handhelds, along with two bonus exams that will help you prepare for the test. Also included is a complete electronic version of the entire book. About the Authors James Stanger has been working in the IT industry since 1995. A Master CIW Administrator, he has worked for ProsoftTraining as Course Director for the CIW Server Administrator and CIW Security Professional certifications since1999. Patrick T. Lane is the Director of Courseware for ProsoftTraining.com. He assisted in the creation of the CIW program and the i-Accelerate program for Intel, Novell, and Microsoft professionals. Tim Crothers, CCNA, CIW, MCSE, CNE, is the chief security engineer at ITM Technology LLC, a firm that offers leading-edge Internet threat management services.
Environment for Performing Collaborative Distributed Virtual Environments with QoS
Authors: Zièd Choukair, Damien Retailleau, Magnus Hellstrom
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

The spread of virtual environments is setting forth a new set of challenges in the management of system resources for guaranteeing Quality of Service (QoS). This paper describes an implementation of end-user QoS control to a Distributed Virtual Environment Platform DVECOM [Choukair00]. In particular, we describe how to guarantee mandatory properties such as synchronization and consistency and how to reduce the impact on the application in case of sudden overload in the system and how we master this degradation to guarantee a smooth degradation according to the end user requirements. This representation degradation is driven by the user's choices and profile selected through the offered rendering strategy API. We also present our evaluation of the QoS implementation, describing some interesting results we achieved in a simulation of a collaborative work in the system.
Substituting for Real Time and Common Knowledge in Distributed Systems
Authors: Gilbert A. Neiger, Sam Toueg
Venue:  (1986)

We study time and knowledge in synchronous and asynchronous reliable distributed systems. For both types of systems, we describe clocks that can be used as if they were perfectly synchronized real-time clocks in the solution of a large class of problems that we formally characterize. For this same class of problems, we also propose a broadcast primitive that can be used as if it achieves common knowledge. Our clocks and broadcast primitive are tools that considerably simplify the task of designing and proving correct distributed algorithms: the designer can assume that processors have access to real-time clocks and the ability to achieve common knowledge. The latter can be used to implement the abstraction of shared memory.
ASF+SDF parsing tools applied to ELAN
Authors: Mark Brand, C. Ringeissen
Venue:  (2000)

This paper describes the development of a new \elan\ parser using \asdf\ parsing technology. \asdf\ and \elan\ are two modern rule-based systems. Both systems have their own features and application domains, however, both formalism have user-defined syntax for defining rewrite rules. The \asdf\ Meta-Environment uses powerful and efficient generic parsing tools, whereas the \elan\ parser is based on an Earley parser. Furthermore, the \elan\ syntax is ``hard-wired'''' in the parser, which makes adaptations of the syntax cumbersome. The use of \asdf\ parsing technology makes the \elan\ syntax more open and adaptable, however, some features of the \elan\ syntax makes the development of a parser a challenging problem.
Low-Energy Logic Circuit Techniques for Multiple Valued Logic
Authors: K. W. Current, V. G. Oklobdzija, D. Maksimovic
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

Multiple valued logic (MVL) has been proposed as a means for reducing the power, improving the speed, and increasing the packing density of VLSI circuits. These performance improvements are achieved by designers who identify signal processing functions that can benefit from the design tradeoffs possible with MVL. Since advocates of MVL are accustomed to incorporating the possible tradeoffs of MVL techniques into specific VLSI design applications, these MVL designers may be able to take advantage of new energy saving circuit design techniques that may have tradeoffs that complement those of MVL. Low-energy (adiabatic) logic circuits have been proposed to reduce energy consumption of VLSI logic functions. Instead of the conventional dc power supply, these logic circuits use "ac" power supplies (power clocks) that allow energy recovery and also serve as timing clocks for the logic. It is possible to integrate all power switches and control circuitry on the chip with low-energy logic. This results in better system efficiency and simpler power distribution. In this paper, concepts of adiabatic circuit design and the use of high-frequency resonant dc/ac converters as power clock generators for adiabatic circuits will be summarized and then their possible application to low-energy, adiabatic Multiple Valued Logic is discussed.
A Scalable Stock Web Service
Authors: Katherine Betz
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

We built an Internet stock service and focused on its scaling characteristics. This service allows a person to request e-Mail notification when a specified stock reaches a price. For example, one could request to be e-Mailed when IBM reaches or exceeds $150. We decided to leverage the capabilities of an underlying publication/subscription (pub/sub) system, which has a JMS interface. We explored ways to configure the pub/sub system as well as how to tie it to a Web Application server. We also explored performance results on different machines. Our goal was to determine what was necessary to scale to 3 million user stock requests as well as to have 100,000 satisfied each day and 100,000 new requests entered each day. We proved this possible.
Differentiated predictive fair service for TCP flows
Authors: I. Matta, Liang Guo
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

The majority of the traffic (bytes) flowing over the Internet today have been attributed to the Transmission Control Protocol (TCP). This strong presence of TCP has spurred further investigations into its congestion control mechanism and its effect on the performance of short and long data transfers. We investigate the interaction among short and long TCP flows, and how TCP service can be improved by employing a low-cost service differentiation scheme. Through control-theoretic arguments and extensive simulations, we show the utility, of isolating TCP flows into two classes based on their life-time/size, time/size one class of short flows and another of long flows. With such class-based isolation, short and long TCP flows have separate service queues at routers. This protects each class of flows from the other as they possess different characteristics, such as burstiness of arrivals/departures and congestion/sending window dynamics. We show the benefits of isolation, in terms of better predictability and fairness, over traditional shared queueing systems with both tail-drop and random-early-drop (RED) packet dropping policies.