ppxscal/embedding_network huggingface dataset:
Elimination of Constants from Machines over AlgebraicallyClosed Fields
Authors: Pascal Koiran
Venue:  (1996)

Let $\k$ be an algebraically closed field of characteristic 0. We show that constants can be removed efficiently from any machine over $\k$ solving a problem which is definable without constants. This gives a new proof of the transfer theorem of Blum, Cucker, Shub \& Smale for the problem $\p \stackrel{?}{=}\np$. We have similar results in positive characteristic for non-uniform complexity classes. We also construct explicit and correct test sequences (in the sense of Heintz and Schnorr) for the class of polynomials which are easy to compute. An earlier version of this paper appeared as NeuroCOLT Technical Report 96-43. The present paper contains in particular a new bound for the size of explicit correct test sequences.
Rights and Commitment in Multi-Agent Agreements
Authors: Timothy J. Norman, Carles Sierra, Nick R. Jennings
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

For agents to act in collaboration, they often require an agreement that describes how they are to act, to which they are committed. Typically, agreements are characterised as an explicit course of action or a goal to be achieved. In this paper, it is argued such agreements may over specify the interaction required. To overcome this problem, a novel formalisation of agreements between agents is presented that is based on rights as well as actions to be performed. Each agent that is involved in an agreement is bound to uphold the rights of others, and the implications of exercising rights and acting for others. It is argued that this approach provides agents with greater flexibility in the agreements they may reach, while retaining the necessary group commitment.
Column scrambler for the GPT cryptosystem
Authors: A. V. Ourivski, E. M. Gabidulin
Venue: Discrete Applied Mathematics (2003)

In 1991, Gabidulin, Paramonov and Tretjakov presented a public key cryptosystem of the McEliece type based on rank codes correcting array errors, the GPT system. Making use of rank codes in cryptographic applications is advantageous since it is practically impossible to utilize combinatoric decoding. This enabled using public keys of a smaller size.Subsequently, in a series of works Gibson developed attacks that break the GPT system for public keys of about 5 Kbits.In this paper, we present a new PKC based on the idea of a column scrambler--a nonsingular matrix by which the public key is multiplied to the right. The column scrambler 'mixes' columns of the public key. It makes system more resistant to structural attacks at a little extra cost of a few additional columns. Possible attacks are carefully studied. The system is found to be secure against known attacks for public keys greater than 10 Kbits.
Low-Latency Communication over ATM Networks using Active Messages
Authors: Thorsten Von Eicken, Veena Avula, Anindya Basu, Vineet Buch
Venue:  (1995)

Recent developments in communication architectures for parallel machines have made significant progress and reduced the communication overheads and latencies by over an order of magnitude as compared to earlier proposals. This paper examines whether these techniques can carry over to clusters of workstations connected by an ATM network even though clusters use standard operating system software, are equipped with network interfaces optimized for stream communication, do not allow direct protected user-level access to the network, and use networks without reliable transmission or flow control. In a first part, this paper describes the differences in communication characteristics between clusters of workstations built from standard hardware and software components and state-of-the-art multiprocessors. The lack of flow control and of operating system coordination affects the communication layer design significantly and requires larger buffers at each end than on multiprocessors. A second part evaluates a prototype implementation of the low-latency Active Messages communication model on a Sun workstation cluster interconnected by an ATM network. Measurements show application-to-application latencies of about 20 microseconds for small messages which is roughly comparable to the Active Messages implementation on the Thinking Machines CM-5 multiprocessor.
Projective and Object Space Geometry for Monocular Building Extraction
Authors: J. C McGlone, Jefferey A. Shufelt
Venue:  (1994)

Knowledge about the imaging geometry and acquisition parameters provides useful geometric constraints for the analysis and extraction of man-made features in aerial imagery, particularly in oblique views. In this paper, we discuss the identification of horizontal and vertical lines in the scene, using image orientation information and vanishing point calculations, and the calculation of their dimensions. The vertical and horizontal attributions are used to constrain the set of possible building hypotheses. Vertical lines are extracted at corners to estimate structure height and permit the generation of three-dimensional building models from monocular views. Results of these techniques are presented for nadir and oblique imagery and evaluated against manually generated 3D ground truth building models.
Non-uniform References and Circuit-Switched Multistage Networks
Authors: A M Holliday
Venue:  (1987)

We present an analytical method of predicting the performance of circuit-switched multistage delta interconnection networks that allows non-uniform reference distributions and rates. Previous analytical methods dealt only with the uniform reference subcase. Our method is an iterative procedure based on submodel markov chain construction. This method is appealing because it offers an accurate alternative to time consuming and expensive simulation. The method has been applied to both the {\em drop} and {\em hold} semantics for blocked partial paths. The method has been implemented and is currently undergoing testing.
The WearARM: Modular, High Performance, Low Power Computing Platform Designed for Integration into Everyday Clothing
Authors: Urs Anliker, Paul Lukowicz, Gerhard Troester, Steven J. Schwartz, Richard W. DeVaul
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

This paper describes a low power, high performance wearable computing plattform, specifically designed for easy integration into everyday clothing. It combines a heterogenous, distributed, user reconfigurable system architecture, advanced power management features and highly miniaturized, mechanically flexible electronic packaging technology. As a result the WearARM system offers high perfomance for a wide range of application in a form factor that allows it to be worn without in any noticeable way interfering with your look and comfort.
Using mixture covariance matrices to improve face and facial expression recognitions
Authors: Carlos E. Thomaz, Duncan F. Gillies, Raul Q. Feitosa
Venue: Pattern Recognition Letters (2003)

In several pattern recognition problems, particularly in image recognition ones, there are often a large number of features available, but the number of training examples for each pattern is significantly less than the dimension of the feature space. This statement implies that the sample group covariance matrices often used in the Gaussian maximum probability classifier are singular. A common solution to this problem is to assume that all groups have equal covariance matrices and to use as their estimates the pooled covariance matrix calculated from the whole training set. This paper uses an alternative estimate for the sample group covariance matrices, here called the mixture covariance, given by an appropriate linear combination of the sample group and pooled covariance matrices. Experiments were carried out to evaluate the performance of this method in two biometric classification applications: face and facial expression. The average recognition rates obtained by using the mixture covariance matrices were higher than the usual estimates.
Jess in Action: Java Rule-Based Systems
Authors: Ernest Friedman Hill
Venue:  (2003)

:A practical handbook for anyone interested in programming rule-based systems and written by the creator of the popular Java rule engine, Jess, this book is structured around a series of large, fully developed practical examples of rule-based programming in Java. After the topic of rule-based systems is introduced, software developers and architects are shown the Jess rule programming language in an accessible, tutorial style. Demonstrated is how to quickly progress from building freestanding interactive applications to rule-based Web and Enterprise software. Specific issues covered in this process include designing the application, embedding Jess in Java applications, and using a rule engine in the J2EE environment.Author Biography: Ernest Friedman Hill is a principal member of the technical staff at Sandia National Laboratories. He lives in Gaithersburg,
Aviation Information Management: From Documents to Data, 1 edition
Authors: Thomas L. Seamster, Barbara G. Kanki
Venue:  (2002)

:The readership includes: Airline flight operations managers and standards personnel, Airline operating documents and publication specialists, Airline information managers, Commercial pilots, Airline maintenance managers and personnel, Manufacturers and vendors of aviation products, Aviation regulators and policy makers, Aviation researchers and developers of information technologies, and Military technical publications specialists.
Fault Containment and Error Detection in the Time-Triggered Architecture
Authors: H. Kopetz
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

This paper investigates the fault-containment and error-detection mechanisms of distributed safety-critical time- triggered systems. The following critical failure modes of a fault-containment region are introduced and analyzed in detail: babbling idiot failures, masquerading failures, slightly-off-specification (SOS) failures, crash/omission (CO) failures, and massive transient disturbances. After a short description of the two time-triggered protocols TTP/C and FlexRay this paper tries to show how these two protocols handle the listed failure modes at the architecture level.
MPI-IO on a Parallel File System for Cluster of Workstations
Authors: Hakan Taki, Gil Utard
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

Since the MPI-IO definition, a standard interface for parallel IO, some implementations are available for cluster of workstations, but the performances are within the limits of the file system (typically NFS). New parallel file systems are now available on cluster of workstations and provide higher performances. A first idea is to interface such parallel file system to a portable implementation of MPI-IO. In this paper, we present first experimental results of a straightforward port of ROMIO, an MPI-IO implementation from Argonne National Laboratory, on PVFS, a parallel file system for cluster from Clemson University. We measure the performances for typical file accesses found in data-parallel applications, and we compare the results with the performances of ROMIO on NFS.
A Data Abstraction Language for Concurrent Programming
Authors: Thomas P Murtagh
Venue:  (1983)

No Abstract Supplied
Introducing the "optimum telecommunications system"
Authors: A. Chaaban
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

A systems approach is used to model the "telecommunications system". The system elements, actors and processes are briefly described, together with the interrelations of the elements and their theoretical optimum status. Practical restrictions and limitations exist as factors that take the system away from the optimum, and some recommendations to get some equilibrium point, are presented.
A Communication-Induced Checkpointing Algorithm Using Virtual Checkpoint on Distributed Systems
Authors: Kim Do-Hyung, Park Chang-Soon
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Checkpointing is one of the fault-tolerant techniques to restore faults and to restart job fast. The algorithms for checkpointing on distributed systems have been under study for years. These algorithms can be classified into three classes: coordinated, uncoordinated and communication-induced algorithms. In this paper, we propose a new communication-induced checkpointing algorithm that has a minimum checkpointing counts equivalent to periodic checkpointing algorithm, and relatively short rollback distance at faulty situations. The proposed algorithm is compared with the previously proposed communication-induced checkpointing algorithms with simulation results. In the simulation, the proposed algorithm produces better performance than other algorithms in terms of task completion time in both of fault-free and faulty situations.
A model for information support of environmental management systems
Authors: B. Davey, C. Mathews
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

A review of the literature of environmental management systems has shown a steady development of theory supporting the production of well supported environmental management systems integrated to enterprise information systems. Research into the differences between Australian Chief Financial Officers and Information Systems Managers has shown that there is a gap between company policy on environmental management systems and existing information support for them. This paper reports on the research covering Australia's top 150 companies and preliminary results of interviews of responsible officers. A model is presented which draws on the literature and research findings. This model brings a systems focus to the problem of integrating information systems with environmental management systems so as to achieve organisational goals.
Behaviors that emerge from emotion and cognition: implementation and evaluation of a symbolic-connectionist architecture
Authors: Amy E. Henninger, Randolph M. Jones, Eric Chown
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper describes the implementation and evaluation of a framework for modeling emotions in complex, decision-making agents. Sponsored by U.S. Army Research Institute (ARI), the objective of this research is to make the decision-making process of complex agents less predictable and more realistic, by incorporating emotional factors that affect humans. In tune with modern theories of emotions, we regard emotions essentially as subconscious signals and evaluations that inform, modify, and receive feedback from a variety of sources including higher cognitive processes and the sensorimotor system. Thus, our work explicitly distinguishes the subconscious processes (in a connectionist implementation) and the decision making that is subject to emotional influences (in a symbolic cognitive architecture).It is our position that "emotional states" are emergent patterns of interaction between decision-making knowledge and these emotional signal systems. To this end, we have adopted an approach that promotes the emergence of behavior as a result of complex interactions between factors affecting emotions, integrated in the connectionist-style model, and factors affecting decision making, represented in the symbolic model.This paper presents the implementation of emotions architecture and explains how we evaluated the system. This includes a description of the behaviors we used in our prototype, the design of our experiments, a representative set of behavior patterns that emerged as a result of exercising our model over the design space, and our project's lessons learned.
Non-clairvoyant scheduling for weighted flow time
Authors: Jae-Hoon Kim, Kyung-Yong Chwa
Venue: Information Processing Letters (2003)

A non-clairvoyant scheduler makes decisions having no knowledge of jobs. It does not know when the jobs will arrive in the future, that is, it is online, and how long the jobs will be executed after they arrive. For non-clairvoyant scheduling, we first study the problem to minimize the total stretch. And we also consider the case in which the weights of jobs are known when they arrive, while their lengths are still unknown. In this case, we find a schedule to minimize the total weighted flow time. The weighted versions of well-known algorithms, Round Robin and Balance, are investigated.
Issues in Wearable Computing for Medical Monitoring Applications: A Case Study of a Wearable ECG Monitoring Device
Authors: Thomas Martin, Emil Jovanov, Dejan Raskovic
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

In this paper, we discuss issues surrounding wearable computers used as intelligent health monitors. Unlike existing holter monitors (for example, ECG and EEG holters), that are used mainly for data acquisition, the devices we discuss provide real-time feedback to the patient, either as a warning of impending medical emergency or as a monitoring aid during exercise. These medical applications are to be distinguished from applications of wearable computing for medical personnel, e.g. doctors, nurses, and emergency medical technicians. Medical monitoring applications differ from other wearable applications in their I/O requirements, sensors, reliability, privacy issues, and user interface. The paper describes a prototype wearable ECG monitor based upon a high-performance, low-power digital signal processor and the development environment for its design.
Procedure per l''aggiornamento automatico di liste di distribuzione
Authors: Laura Abba, Marina Buzzi, Francesco Gennai
Venue:  (1999)

This work describes how we used mailing lists in order to support the communication between CNR people.
ISQED Tutorials
Authors: Ibrahim Hajj
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

ISQED tutorial day, involves three parallel tutorial tracks, Consisting of a total of 15 tutorials, delivered by 25 industry experts. List of topics includes a wide variety of issues and methods regarding the design and quality.The first tutorial track is titled "Design for Reliability & Manufacturability". In this track, five tutorials are delivered, focusing on fundamental components of design quality. Some of the topics explored are, the quality of MOS models. Hot-Carrier effects, thermal effects, electromigration and the role of copper interconnect, statistical modeling, design and yield optimization. The second tutorial track is titled "Design for Quality" and addresses some of the key considerations and factors for a quality design. There are five tutorials presented in this track. List of topics include the quality of libraries, voltage drop effects, signal and power integrity, cross talk, and noise in VDSM designs. The third tutorial track is Titled "Closing the Manufacturing loop". As evident from the title, the focus of this track is on issues fundamental to manufacturability. There are also five tutorials given in this track. List of topics include factors and trends for quality physical design, deep submicron lithography effects and methods for dealing with them, layout compaction technology, and physical verification methods.
A Hypergraph Approach to the Identifying Parent Property: the Case of Multiple Parents
Authors: Barg A., Cohen G., Encheva S., Kabatiansky G., Zemor G.
Venue:  (2000)

Let $C$ be a code of length $n$ over an alphabet of $q$ letters. A codeword $y$ is called a descendant of a set of $t$ codewords $ x^1,\dots,x^t$ if $y_i\in\{x^1_i,\dots,x^t_i\}$ for all $i=1,\dots,n.$ A code is said to have the identifiable parent property if for any $n$-word that is a descendant of at most $t$ parents it is possible to identify at least one of them. We prove that for any $t\le q-1$ there exist sequences of such codes with asymptotically nonvanishing rate.
Thresholds for Object-Oriented Measures
Authors: Saida Benlarbi, Khaled El Emam, Nishith Goel, Shesh Rai
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

A practical application of object-oriented measures is to predict which classes are likely to contain a fault. This is contended to be meaningful because object-oriented measures are believed to be indicators of psychological complexity, and classes that are more complex are likely to be faultyRecently, a cognitive theory has been proposed suggesting that there are threshold effects for many object-oriented measures. This means that object-oriented classes are easy to understand as long as their complexity is below a threshold. Above that threshold, their understandability decreases rapidly, leading to an increased probability of a fault. This occurs, according to the theory, due to an overflow of short-term human memory. If this theory were confirmed, then it would provide a mechanism that would explain the introduction of faults into object-oriented systems, and would provide some practical guidance on how to design object-oriented programs. In this paper, we empirically test this theory on two C++ telecommunications systems.We test for threshold effects in a subset of the Chidamber and Kemerer (CK) suite of measures. The dependent variable was the incidence of faults that lead to field failures. Our results indicate that there are no threshold effects for any of the measures studied. This means that there is no value for the studied CK measures where the fault-proneness changes from being steady to rapidly increasing. The results are consistent across the two systems. Therefore, we can provide no support to the posited cognitive theory.
Fault-Tolerant Routing in 2D Tori or Meshes Using Limited-Global-Safety Information
Authors: Dong Xiang, Ai Chen
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

A limited-global-safety-information-based metric called local safety is proposed to handle fault-tolerant routing in 2D tori (or meshes). Sufficient conditions for existence of a minimum feasible path between the source and destination is presented based on local safety information in a 2D torus network. An efficient heuristic function is defined to guide fault-tolerant routing inside a 2D torus network. Unlike the conventional methods based on the block fault model, our method does not disable any fault-free nodes and fault-free nodes inside a fault block can still be a source or a destination, which can greatly increase throughputand computational power of the system. Techniques for avoidance of deadlocks are introduced. Extensive simulation results are presented.
A Framework for Experimental Evaluation of Clustering Techniques
Authors: Rainer Koschke, Thomas Eisenbarth
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

Experimental evaluation of clustering techniques for component recovery is necessary in order to analyze their strengths and weaknesses in comparison to other techniques. For comparable evaluations of automatic clustering techniques, a common reference corpus of freely available systems is needed for which the actual components are known. The reference corpus is used to measure recall and precision of automatic techniques. For this measurement, a standard scheme for comparing the components recovered by a clustering technique to components in the reference corpus is required. This paper describes both the process of setting up reference corpora and ways of measuring recall and precision of automatic clustering techniques.For methods with human intervention, controlled experiments should be conducted. This paper additionally proposes a controlled experiment as a standard for evaluating manual and semi-automatic component recovery methods that can be conducted cost-effectively.