ppxscal/embedding_network huggingface dataset:
Problem Solving, Abstraction, and Design using C++, 4 edition
Authors: Frank L. Friedman, Elliot B. Koffman
Venue:  (2003)

:While emphasizing problem solving and programming skills, the authors introduce object-oriented concepts early in the text. The system-defined string and stream classes and a user-defined money class are used to reinforce the importance of data modeling in programming. This second edition contains all of the classic learning features readers have come to know and trust in authors Frank Friedman and Elliot Koffman. These features include case studies, program style sections, syntax display boxes, end-of-section exercises, common-error sections, chapter reviews, quick-check exercises, and programming projects.
On the Recognition of Primes by Automata
Authors: Juris Hartmanis, H. Shank
Venue:  (1968)

A study of the problem of recognizing the set of primes by automata is presented. A simple algebraic condition is derived which shows that neither the set of primes nor any infinite subset of primes can be accepted by a pushdown or finite automaton. In view of this result an interesting open problem is to determine the ``weakest'''' automaton which can accept the set of primes. It is shown that the linearly bounded automaton can accept the set of primes, and it is conjectured that no automaton whose memory grows less rapidly can recognize the set of primes. One of the results shows that if this conjecture is true, it cannot be proved by the use of arguments about the distribution of primes, as described by the Prime Number Theorem. Some relations are established between two classical conjectures in number theory and the minimal rate of memory growth of automata which can recognize the set of primes.
Generalizing RSVP's Traffic and Policy Control Interface
Authors: Martin Karsten, Jens Schmitt, Ralf Steinmetz
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In this paper, we describe our current efforts to evaluate and extend the traffic control interface of RSVP and to define a useful policy control interface. The particular goal is to advance integration of non-broadcast multiple-access (NBMA) subnets, such as native ATM, and furthermore, to allow for meaningful inter-operation between traffic control and policy control. Our experience stems from implementing RSVP in combination with a policy interface to charging modules. Furthermore, we have developed a VC management module for ATM, which enables flexible inter-operation of RSVP with ATM subnets. We describe the status of this work with respect to multicast, atomicity of operations and resulting challenges.
Multi-authority secret-ballot elections with linear work
Authors: Ronald J.F. Cramer, Matthew Franklin, L. A.M. Schoenmakers, Moti Yung
Venue:  (1995)

We present new cryptographic protocols for multi-authority secret ballot elections that guarantee privacy, robustness, and universal verifiability. Application of some novel techniques, in particular the construction of witness hiding/indistinguishable protocols from Cramer, Damgaard and Schoenmakers, and the verifiable secret sharing scheme of Pedersen, reduce the work required by the voter or an authority to a linear number of cryptographic operations in the population size (compared to quadratic in previous schemes). Thus we get significantly closer to a practical election scheme.
Java Software Solutions, AP Version
Authors: John Lewis, William Loftus, Cara Struble, Cara Cocking
Venue:  (2003)

:This book teaches beginners how to create well-designed software using Java and prepares them for both the A and AB advanced placement tests in Java. With a focus on object-oriented programming, teaching objects first and then writing classes, the authors identify the material, within an introduction to Java and a case study, that will be featured on the AP tests. Any student preparing to take the AP test in Java.
Hiding in Plain Sight: Steganography and the Art of Covert Communication, 1 edition
Authors: Eric Cole
Venue:  (2003)

:These days, encryption of confidential data and communications is an increasingly important part of doing business. But steganography can take data confidentiality to a whole new level, since it hides encrypted messages in ordinary-looking data files, making the very existence of the messages practically undetectable. Although steganography is not a new field and has played a critical part in secret communication throughout history, few people understand exactly how it works today. This detailed, practical guide changes that -- whether your goal is to add an extra level of security to business or government communications or to detect and counter steganography when it's used by criminals or terrorists.
Efficient Closed-Form Crosstalk Delay Metrics
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

In this paper we present efficient closed-form formulas to estimate capacitive coupling-induced delay in distributed RC coupling network. The efficiency of our approach stems from the fact that only five basic operations are used in the expressions: addition, subtraction, multiplication, division, and square root. The formulas do not require exponent computation or numerical iterations. Our estimates are conservative, and yet achieve acceptable accuracy. They are simple enough to be used in the inner loops of performance optimization or as cost functions for a router. The delay expressions capture the dependency on coupling direction and coupling location.
Emotional advantage for adaptability and autonomy
Authors: Eugénio Oliveira, Luís Sarmento
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

During the last two decades, researchers have collected a decisive amount of experimental evidence about the fundamental role of Emotion on cognitive processing. Emotional phenomena have been correlated with effective decision-making processes, memory, learning and other high-level cognitive capabilities and skills (e.g. risk assessment). In this paper we will describe an ongoing work that aims to design new Agent Architectures influenced by what has been learned in psychology and neurosciences about Emotion-cognition interaction. We will present an Agent architecture that includes several emotional-like mechanisms, namely: emotional evaluation functions, Emotion-biased processing, emotional tagging and mood congruent memory. These mechanisms are intended to increase the performance and adaptability of Agents operating in real-time environments. We will also introduce Pyrosim, a MAS platform we have developed to serve as an appropriate test-bed for Emotional-based Architectures, which simulates a forest fire in a complex 3D environment.
A Nearly best-possible approximation algorithm for node-weighted Steiner trees
Authors: Philip Klein, R. Ravi
Venue:  (1992)

We give the first approximation algorithm for the node-weighted Steiner tree problem. Its performance guarantee is within a constant factor of the best possible unless $\tilde P \supseteq NP$. Our algorithm generalizes to handle other network design problems.
Network Congestion Monitoring and Detection Using the IMI Infrastructure
Authors: Takeo Saitoh, Glenn Mansfield, Norio Shiratori
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

IMI provides a scalable and exible measurement infrastructure. It essentially uses RMON-type passive monitoring and on demand, active probes. It is built on the SNMP framework so all interactions are through MIB-variables; security and access control is in place. Detecting congestion is a challenge and diagnosing it is an even greater challenge. In this work we have experimented with techniques of detecting congestion in the network using the distributed infrastructure of IMI. As a symptom of congestion, retransmission packets in the network traffic are detected, counted and analyzed. The related information from various IMId's (IMI-daemons) are collated and used in conjunction with configuration information to detect and then locate a congestion bottleneck.
Interpolation of the discrete logarithm in Fq by Boolean functions and by polynomials in several variables modulo a divisor of q - 1
Authors: Tanja Lange, Arne Winterhof
Venue: Discrete Applied Mathematics (2003)

Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in finite prime fields by Boolean functions. In the first part of the paper, these results are extended to arbitrary finite fields of odd characteristic. More precisely, we prove some complexity lower bounds for Boolean functions representing the least significant bit of the discrete logarithm in a finite field.In the second part of the paper we obtain lower bounds on the sparsity and the degree of polynomials over Fq in several variables computing the discrete logarithm modulo a prime divisor of q - 1. These results are valid for even characteristic, as well.
Distributed Clustering for Ad Hoc Networks
Authors: Stefano Basagni
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

A Distributed Clustering Algorithm (DCA) and a Distributed Mobility-Adaptive Clustering (DMAC) algorithm are presented that partition the nodes of a fully mobile network (ad hoc network) into clusters, thus giving the network a hierarchical organization. Nodes are grouped by following a new weight-based criterium that allows the choice of the nodes that coordinate the clustering process based on node mobility-related parameters. The DCA is suitable for clustering ``quasi-static'' ad hoc networks. It is easy to implement and its time complexity is proven to be bounded by a network parameter that depends on the topology of the network rather than on its size, i.e., the invariant number of the network nodes. The DMAC algorithm adapts to the changes in the network topology due to the mobility of the nodes, and it is thus suitable for any mobile environment. Both algorithms are executed at each node with the sole knowledge of the identity of the one hop neighbors, and induce on the network the same clustering structure.
Dynamic Observations and Dynamic State Termination for Off-Line Handwritten Word Recognition Using HMM
Authors: Y. Al-Ohali, M. Cheriet, C. Y. Suen
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

HMM has been successfully used to model 1-D data, e.g. voice signals. Their use to model 2-D patterns was not as successful due to a major difficulty in describing the 2-D data using 1-D observation sequences. In this paper, we discuss the importance of this issue and present an improved method to extract 1-D observations from the dynamics of off-line handwritten words. The method is based on pen-trajectory estimation techniques. The paper also includes description of our HMM classifier which allows dynamic termination states to achieve enhanced discriminative power. Experimental results show the applicability and the usefulness of the proposed method. As a result of using the termination probability in HMM modeling, the top 1st recognition rate increased by 10%.
Computational models of electromagnetic resonators: Analysis of edge element approximation
Authors: Daniele Boffi, Paolo Fernandes, Lucia Gastaldi, Ilaria Perugia
Venue:  (1997)

The purpose of this paper is to address some difficulties which arise in computing the eigenvalues of the Maxwell''s system by a finite element method. Depending on the used method, the spectrum may be polluted by spurious modes which are difficult to pick out among the approximations of the physically correct eigenvalues. Here we prove, under very general assumptions, that using edge elements the discrete spectrum well approximates the correct one and we give some justification of the spectral pollution which occurs when nodal elements are used. Results of numerical experiments confirming the theory are also reported. EMAIL:: ian@microian.ian.pv.cnr.it
Correcting for unreliable regression integration testing
Authors: K. Abdullah, J. Kimble, L. White
Venue: Proceedings of the International Conference on Software Maintenance (1995)

H. Leung and L. White (1990) introduced the firewall concept for control flow in regression testing. In order to define this firewall, they assumed that unit testing and integration testing are both reliable. The paper continues to assume that unit testing can be carried out in an entirely reliable fashion, while integration testing may not be reliable. The paper is designed to fulfill the following objectives: identify the error cases that the testing process may have missed, making integration testing unreliable; attempt to solve the problems that make integration testing unreliable, designing procedures to improve reliability; and determine the effects of unreliable integration testing on the firewall, indicating how the firewall construction should subsequently change.
Getting CUTE with Matlab
Authors: Mary A Branch
Venue:  (1994)

CUTE is a testing environment for nonlinear programming algorithms developed by Bongartz, Conn, Gould, and Toint ([CUTE: Constrained and unconstrained testing environment , Research Report RC 18860, IBM T.J. Watson Research Center, Yorktown Heights, USA, 1993]). The test problems in this environment are encoded in standard input format (SIF) and accessed by a set of FORTRAN subroutines. An extension to this environment was developed to allow fast access to the CUTE test problems from Matlab. This report describes this new Matlab interface to CUTE and how to use it.
The power of the incredible hulk--the ILM Linux death star
Authors: Robin Rowe
Venue: Linux Journal (2003)

This fully operational battle station is a 750-node Linux cluster running a custom batch scheduling program. 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
Working Knowledge: The New Vocationalism and Higher Education
Authors: Colin Symes, John McIntyre
Venue:  (2002)

:Universities are undergoing a series of profound changes. One of the more pronounced of these involves the partnerships that are now being formed between business enterprises and higher education. The emergence of these partnerships has much to do with the changing economy, which is increasingly based around knowledge and information - the traditional stock-in-trade of the university. Knowledge capitalism has given a renewed impetus to higher education. One expression of this is work-based learning, which challenges the scope and site of the university curriculum. This book analyzes this development from a number of perspectives: critical, historical, philosophical, sociological and pedagogical. Its various contributors argue that work-based approaches contain much that is challenging to the university, and also much that could help to create new frameworks of learning and new roles for academics. Working Knowledge offers a comprehensive examination of the new vocationalism in high
Integrated Systems I. Design Principles
Authors: P. A. D. DeMaine, K. D. Bradley, M. M. DeMaine, S. M. Jodis, K. H. Chang, W. B. Day, C. M. Pancake, W. B. Dress
Venue:  (1990)

The following design principles are being used in an ongoing project to realize an integrated family of expert systems that can be used separately or together in different combinations to solve problems common to many different disciplines. Some essential features of this family are: (1) Individual members can be used in the normal way as expert systems or they can be transparently invoked by other expert systems without interrogating users. (2) The knowledge (or rule) bases of key members do not mimic the perceived mode of human thought; therefore, they can predict events that cannot be predicted by state-of-the-art alone. (3) The Law of Conservation of Mass/Energy is used to detect and correct computational errors.
Spatial Clustering for Data Mining with Genetic Algorithms
Authors: V. Estivill-Castro
Venue:  (1997)

Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. The identification of clusters in spatially referenced data provides a means of generalization of the spatial component of the data associated with a Geographical Information System. A variety of clustering formulations exists. A non-hierarchical approach in Data-mining applications is to use a medoid based version. This approach has robust behavior with respect to outliers and many heuristics have been developed that find near optimal partitions. This paper develops a genetic search heuristic for solving medoid based clustering problems. We base our genetic recombination upon Random Assorting Recombination. A comparison is made with previous solution approaches. Results show improvements on the genetic search heuristic.
Reasoning about Time and Probability
Authors: Keiji Kanazawa
Venue:  (1992)

Reasoning about Time and Probability Keiji Kanazawa Decision making requires reasoning about chance and change in the world: how things change over time, the chances that things change in different possible ways, and how our actions affect these chances. Together with knowledge about preferences, it is possible to choose the best action in a given situation. As an example, consider treatment planning in a hospital emergency room. It requires reasoning about the likely changes in a patient''s condition, when important changes are likely to occur, and the probable effects of different treatment and testing actions. This dissertation is an account of reasoning about chance and change for planning and decision-making. It builds upon earlier results in developing the original treatment of reasoning about time and probability in artificial intelligence. The following distinguish my approach: --- I explicitly reason about chance with probability, and I use decision theory to choose the best action based on preferences. Probability and decision theory are mature, normative theories of reasoning about chance and choice (they tell you the right thing to do). --- I develop logics and graph models for expressing knowledge about time, probability, and preference. Logic makes it easy to express knowledge about time and probability, and to apply this knowledge as needed. Graph models of knowledge about probability and preferences make it easy to reason about time and probability efficiently. The program developed in my thesis, Goo, is a deductive database for knowledge about time and probability. Goo can answer queries such as ``What is the chance that I will receive the test results within half an hour?'''' and ``Are there any surgical procedures where the probability of success is more than .5 for this patient?''''. Goo automatically constructs and maintains graph models based on logical knowledge in response to queries and assertions.
Computing Global Functions in Asynchronous Distributed Systems Prone to Process Crashes
Authors: J. M. Hélary, M. Hurfin, A. Mostéfaoui, M. Raynal, F. Tronel
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

A Global Data is a vector with one entry per process. Each entry must be filled with an appropriate value provided by the corresponding process. Several distributed computing problems amount to compute a function on a global data. This paper proposes a protocol to solve such problems in the context of asynchronous distributed systems where processes may fail by crashing.The main problem that has to be solved lies in computing the global data and in providing each non-crashed process with a copy of it, despite the possible crash of some processes. To be consistent, the global data must contain (at least) all the values provided by the processes that do not crash. This defines the Global Data Computation (GDC) problem. To solve this problem, processes execute a sequence of asynchronous rounds during which they construct (in a decentralized way) the value of the global data, and eventually each process gets a copy of it. To cope with process crashes, the protocol uses a perfect failure detector.The proposed protocol has been designed to be time-efficient. It allows early decision. Let t be the maximum number of processes that may crash (\math where n is the total number of processes) and f be the actual number of process crashes \math. In the worst case, the protocol terminates in min\math rounds. Moreover, the protocol does not require processes to exchange information on their perception of crashes. The message size depends only on the size of the global data.
The South Pole Information System
Authors: Stefania Biagioni, Carlo Carlesi, Giorgio Leone, Ovidio Salvetti
Venue:  (1995)

An integrated multi-disciplinary information system, known as the South Pole system, has been developed within the framework of the Italian Programme for Research in the Antarctic promoted by ENEA (National Agency for Alternative Energy). The system consists of a series of heterogeneous data banks sited in Local Centres, each one dedicated to a particular theme, geographically distributed throughout the territory. The Local Centres are connected via telematic networks (Internet, TCP/IP). The main objective of the South Pole system is to make all the data and information concerning the Italian Antarctic expeditions available to the scientific community, through the creation of a series of specific thematic databanks
Orgy in the computer: multi-parent reproduction in genetic algorithms
Authors: Agoston E. Eiben, Cees H.M. Kemenade, Joost N. Kok
Venue:  (1995)

In this paper we investigate the phenomenon of multi-parent reproduction, i.e. we study recombination mechanisms where an arbitrary $n<1$ number of parents participate in creating children. In particular, we discuss scanning crossover that generalizes the standard uniform crossover and diagonal crossover that generalizes 1-point crossover, and study the effects of different number of parents on the GA behavior. We conduct experiments on tough function optimization problems and observe that by multi-parent operators the performance of GAs can be enhanced significantly. We also give a theoretical foundation by showing how these operators work on distributions.
Analysis of the Equivalences and Dominances of Transient Faults at the RT Level
Authors: Luis Berrojo, Isabel González, Luis Entrena, Celia López, Fulvio Corno, Matteo Sonza, Giovanni Squillero
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

This work presents a study for tackling transient faults at the RT-level and outlines the techniques devised and implemented to speed-up fault-injection campaigns, detecting the equivalences and dominancies between faults in order to collapse them. Experimental results are provided on an industrial case study, demonstrating the effectiveness of the approach.