ppxscal/embedding_network huggingface dataset:
Scalability of Two Reliable Multicast Protocols
Authors: Oznur Ozkasap, Zhen Xiao, Kenneth P. Birman
Venue:  (1999)

Growing demand for multicast commun-ication in large network settings has focused attention on the scalability of reliable multicast protocols. Our paper uses both simulation tools and experiments to compare two scalable protocols, focusing on an aspect not often studied: we emphasize stability of latency distributions as these protocols scale, although also considering overhead and link utilization. These properties are considered in a variety of network topologies and with several levels of packet loss. Our findings confirm that SRM scales poorly under some conditions: to obtain reliability, the protocol incurs overhead linear in group size and throughput fluctuates erratically. We also show that SRM latencies can be very large and that latency distributions are unstable as a function of group size and network topology. Our own protocol, Bimodal Multicast, also exhibits overhead growth, but the rate of growth is slow, and latency distributions and delivery throughput rates are stable.
PMMAP: A Mobile Agents Platform for Program Mining
Authors: Kegang Xu, Yaoxue Zhang, Zizhong Wei
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

This paper presents a platform called PMMAP, a Java-based mobile agents platform that isoriented for program mining. Program mining is a kind of novel computing paradigm thatsupports computing on demand in distributed network. The whole process of program miningis based on mobile agents technology. In order to implement program mining, we develop a powerful and suitable mobile agents platform. It not only provides the basic functions, such asloading agent, unloading agent, starting agent, stopping agent, suspending agent, resumingagent, but also develops a series of mechanisms and protocols to implement data security,efficient communication, fault-tolerance, strongly mobile migration and component support. Users can easily build their own agents based on our platform. It enables s to run mobile agents across the Internet safely and smoothly, and manage them easily.
Theory of the lattice Boltzmann method: Lattice Boltzmann models for non-ideal gases
Authors: Luo Li-Shi
Venue:  (2001)

In this paper a procedure for systematic a priori derivation of the lattice Boltzmann models for non-ideal gases from the Enskog equation (the modified Boltzmann equation for dense gases) is presented. This treatment provides a unified theory of lattice Boltzmann models for non-ideal gases. The lattice Boltzmann equation is systematically obtained by discretizing the Enskog equation in phase space and time. The lattice Boltzmann model derived in this paper is thermodynamically consistent up to the order of discretization error. Existing lattice Boltzmann models for non-ideal gases are analyzed and compared in detail. Evaluation of these models are made in light of the general procedure to construct the lattice Boltzmann model for non-ideal gases presented in this work. 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
Application of a Hybrid Neural Network for the Discrimination of Seeds by Artificial Vision
Authors: Y. Chitioui, D. Bertrand, Devaux, D. Barba
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Intelligent hybrid systems are playing an increasing role in the development of artificial intelligence, In this study, we applied simulated annealing to adjust the weights of a multilayer neural network &INN). Two versions of simulated annealing were tested: conventional simulated annealing (CSA) and fast simulated annealing (FSA). The applied hybrid system was used as a classifier in order to discriminate between 3 seed species (I cultivated seed species which is perennial rye grass, and 2 adventitious seed species which are rumex and wild oat). From a set of color digital images, 73 morphometrical and textural features were extracted to characterize each individual seed. Stepwise discriminant analysis made if possible to select the first 3 relevant features. The performances of classification were highly dependent on the scaling parameters of simulated annealing. For example, when the number of iterations of simulated annealing was 5, and the number of temperatures was 40, the combination between CSA and MNN correctly classified 98.18 and 97.77 percent of the training and the test sets, whereas FSA and MNN identified PP. 18 and 99.68 percent of the same data sets. Globally, FSA outperformed CSA both in reliability and computational resources. A hybrid system combined with a color image analysis showed promise for the designing of an automatic seed identification device.
A Statistical Model for Electromigration Failures
Authors: Gilbert Yoh, Farid N. Najm
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

The lognormal has been traditionally used to model the failure time distribution of electromigration failures. However, when used to estimate the failure of large metal layers, it leads to a clear disagreement with established empirical data. To resolve this problem, we propose to use a shifted lognormal (SLN) as a better model of the failure time of individual wires. We will show that the SLN is well justified because it matches other more detailed and more physical models, such as the multilognormal~[1]. We will also show that the SLN exhibits the right behavior for long wires. Finally, we will provide an estimation methodology by which the parameters of the SLN can be estimated from failure data. Finally, the analysis will be extended to large metal layers where the advantages of using SLN over LN will be clearly demonstrated.
Efficient Algorithms for Fault-Tolerant Communication in Optical WDM Networks
Authors: Hong Shen, Keqin Li, Yi Pan, Si Qing Zheng
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

This paper addresses the problem of efficient communication in unreliable multi-hop optical networks supported by Wavelength Division Multiplexing (WDM). We first define a new cost model for routing in (optical) WDM networks that is more general and realistic than the existing models. Our model takes into consideration not only the cost of wavelength access and conversion but also the cost for wavelength switching when several optical channels of the same wavelength arriving at the same node. We then propose a set of efficient algorithms in both reliable and unreliable WDM networks on the new cost model respectively for each of three important communication patterns --- multiple point-to-point routing, multicast and multiple multicast.
Modularized System Architecture for Flexible Clinical Laboratory Systems
Authors: Hiroshi Mitsumaki, Toshiyuki Ikeda, Ryuichiro Kodama, Takeiki Aizono
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

The increase in medical expenses resulting from longer life expectancy is an increasing serious social problem in Japan. Reducing the cost of clinical laboratory systems, increasing quality of service to patients, and safeguarding the health of hospital staff are important issues for hospitals. A flexible clinical laboratory system is needed to reduce system development cost. Automated clinical laboratory systems, for large and small hospitals alike, are needed in order to reduce waiting time and the risk of workers being exposed to infectious diseases. Flexible systems could meet all these needs. We have developed a modularized system architecture to provide a flexible clinical laboratory system. The hardware and software of the clinical and sample transfer equipment are modularized in this system. Each piece of equipment can autonomously decide where to transfer samples and how to process them. The clinical equipment works autonomously and can be added or suspended without influencing the other equipment. The transfer equipment is also autonomous, and the sample transfer lines can be changed easily in accordance with space limitations. We applied this modularized system architecture to a pre-analytical sample-handling system, and demonstrated its effectiveness. This system was developed by using equipment from different vendors, thus demonstrating that such a system can be easily built.
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
Authors: Manindra Agrawal, Eric Allender, Steven Rudich
Venue:  (1997)

We show that all sets that are complete for NP under non-uniform AC^0 reductions are isomorphic under non-uniform AC^0-computable isomorphisms. Furthermore, these sets remain NP-complete even under non-uniform NC^0 reductions. More generally, we show two theorems that hold for any complexity class C closed under (uniform) NC^1-computable many-one reductions. Gap: The sets that are complete for C under AC^0 and NC^0 reducibility coincide. Isomorphism: The sets complete for C under AC^0 reductions are all isomorphic under isomorphisms computable and invertible by AC^0 circuits of depth three. Our Gap Theorem does not hold for strongly uniform reductions: we show that there are Dlogtime-uniform AC^0-complete sets for NC^1 that are not Dlogtime-uniform NC^0-complete.} (This technical report replaces DIMACS TR 96-04.)
Voting and technology: who gets to count your vote?
Authors: David L. Dill, Bruce Schneier, Barbara Simons
Venue: Communications of the ACM (2003)

Paperless voting machines threaten the integrity of democratic process by what they don't do.
A Non-Type-Theoretic Semantics For Type-Theoretic Language
Authors: Stuart Allen
Venue:  (1987)

Since 1970 several methods have been proposed for using formal systems of constructive logic as programming languages. One prominent approach is based upon systems of computationally significant terms which either bear or are assigned types; these systems are essentially lambda calculi or combinatory logics in which either the terms are explicitly typed or else types are assigned to untyped terms in the manner of Curry. This thesis concerns two such systems, namely, Martin-Lof''s intuitionistic type theory of 1979, and a variation of that theory upon which Nuprl is based. Nuprl is a system implemented at Cornell for developing functional programs and constructive proofs. The expressive machinery of these theories can be given a rather natural non-type-theoretic semantics that is not inherently constructive and yet closely follows the semantical explanation of type theory. The principal content of this thesis is a careful development of such a semantic reinterpretation with the intention of making the bulk of type-theoretic practice, of the kind arising from the use of Nuprl and formalizations of Martin-Lof''s theory, independent of its original type-theoretic and constructive basis. The reinterpretation opens the type-theoretic methodology of programming to nonconstructivists and others who may not subscribe to the intuitionistic theory of types, preserving the features of type-theoretic language that make it a suitable language for programming. Moreover, the natural structural similarity between the type-theoretic concepts and their reinterpretations yields an analytic tool which may serve type-theorists as well. The body of this thesis has two phases. In the first, the semantic concepts of Martin-Lof''s theory, including expressions, types, judgements of functionality, and universes, are reinterpreted. This phase culminates in a non-type-theoretic definition of the types explicitly defined in Martin-Lof''s paper of 1979. The remainder of the thesis treats various topics of semantic significance, including the representation of propositions as types, the anticipation of new terms and types, certain ``type-free'''' forms of inference, and a sort of ``universe polymorphism.'''' Finally, we shall reinterpret the semantics of Nuprl''s judgements of functionality which differs radically from that of Martin-Lof''s judgements in the use of assumptions.
Access Normalization: Loop Restructuring for NUMA Compilers
Authors: Wei Li, Keshav Pingali
Venue:  (1992)

A common feature of many scalable parallel machines is non-uniform memory access a processor can access data in its local memory ten to a thousand times faster than it can access local data. In addition, when a number of remote accesses must be made, it is usually more efficient to use block transfers of data rather than to use many small messages. To run well on such machines, software must exploit these features. We believe it is too onerous for a programmer to do this by hand, so we have been exploring the use of restructuring compiler technology for this purpose. In this paper, we start with a language like FORTRAN-D with user-specified data distributions and develop a systematic loop transformation strategy called access normalization that restructures loop nests to exploit both locality and block transfers whenever possible. We demonstrate the power of our techniques using routines from the BLAS (Basic Linear Algebra Subprograms) library. Our loop transformation strategy is expressed in the framework of invertible matrcies and integer lattice theory, and it is an important generalization of Banerjee''s framework of unimodular matrices.
Using Parallel Techniques to Improve the Computational Efficiency of Evidential Combination
Authors: Xin Hong, Kenny Adamson, Weiru Liu
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

This paper presents a method of partitioning a MarKov tree of belief functions into clusters so as to efficiently implement parallel belief function propagations on the basis of the local computation technique. Our method initially represents computations of combining evidence on all nodes in a MarKov tree as parallelism instances, then balances the computation load among these instances, and finally partitions them into clusters which can be mapped onto a set of processors in a PowerPC network. The advantage of our method is that the maximum parallelization can still be achieved, even with limited processors availability.
Nonlinear Hammerstein Model Identification Using Genetic Algorithm
Authors: Ali Akramizadeh, Ali Akbar Farjami, Hamid Khaloozadeh
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

In this paper, a new approach to nonlinear system identification using evolutionary LMS Algorithm has been proposed. System in our method consists of a static nonlinear function in series with a dynamic linear transfer function, which literature refers to them as Hammersteinmodels. Identified nonlinear function can be one of the hyperbolic function or a general format of (ax+b) or a combination of them. Genetic Algorithm is responsible for finding the correct structure and parameters of the nonlinear function, and number of zeros and poles of the linear transfer function as well. In order to speed up the convergence process, we use a kind of dynamic mutation rate that increase with respect to the generation passed while the fitness remains unchanged. As the linear identification algorithm we prefer to parameterize the problem as ARMA and use the traditional LMS algorithm. AIC is the fitness function evaluator of the GA chromosomes, using both total error and estimated order of the linear section. Two different simulations show the effectiveness of our method. In the simulation two hard nonlinear functions, saturation and deadzone, has been used and show that despite of small amount of information which is limited to input-output signals, our approach can considerably identify the systems.
Enforcing Mandatory Integrity Protection in Operating System
Authors: Hongliang Liang, Yufang Sun
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

It is functionality other than security that was put in the first place when most systems and applications were built. The threats brought by Internet connectivity, downloaded code and loaded modules are obvious and dangerous and requires a kind of reliable integrityprotection. In this paper we present our mandatory integrity protection(RS-MIP) building in a secure Linux operating system kernel. We describe the security policy and integrity . model on which RS-MIP is based, its underlying implementation technology. In the end we compare it to other security protection approaches.
Automating the Organization of Presentations for Playout Management in Multimedia Databases
Authors: V. Hakkoymaz, G. Ozsoyoglu
Venue: Proceedings of the 1996 International Workshop on Multi-Media Database Management Systems (IW-MMDBMS '96) (1996)

We introduce a constraint-driven methodology for t h e automated assembly, organization and playout of presentations from multimedia databases. We use inclusion and exclusion constraints for extracting a semantically coherent set of multimedia segments. Presentation organization constraints are utilized for organizing the multimedia segments into a presentation, which in turn helps decide the playout order of the extracted multimedia segments. The playout order of the segments is represented in a presentation graph. If the specified set of organization constraints are not suficient to construct a unique presentation graph, we propose two techniques so that a unique graph is constructible. We also propose playout algorithms, one for the generation, start and termination of playout agents, the other to provide dynamic controls for playout management of organized presentations. The characteristics of these algorithms are expressed in terms of presentation playout parameters.
Typed logics with states
Authors: D. J Eijck
Venue:  (1997)

The paper presents a simple format for typed logics with states by adding a function for register update to standard typed lambda calculus. It is shown that universal validity of equality for this extended language is decidable (extending a well-known result of Friedman for typed lambda calculus). This system is next extended to a full fledged typed dynamic logic, and it is illustrated how the resulting format allows for very simple and intuitive representations of dynamic semantics for natural language and denotational semantics for imperative programming. The proposal is compared with some alternative approaches to formulating typed versions of dynamic logics.
A methodology of complicated mechanical systems virtual prototyping
Authors: A. A. Mezentsev
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

General methodology of complicated machinery virtual prototyping as part of design automation is presented. Method utilizes nodal matrix-topological multibody software, cluster analysis and some of graph theory approaches. Definition of complicated mechanical systems as the background of the methodology is given. Desired hierarchy of models for successful prototyping is presented. The results of the methodology application to the sphere of industrial robots and machine-tools are given.
On Moving and Orienting Objects
Authors: B. K. Natarajan
Venue:  (1986)

Many problems arising in the area of robotics are directly or indirectly related. In order to analyze such problems, it is necessary to incorporate the dynamics with the geometry in the mathematical formulation. With this in view, this thesis deals with two such problems motion planning in the presence of uncertainty and the automated design of parts orienters. Motion planning for robots with errors in position measurement, velocity and time is considered and shown to be decidable in polynomial time for a large class of inputs. The robot model is then extended to include damping a limited form of force sensing. Motion planning for point objects in three-dimensional scenes and robots with damping is shown to be PSPACE-hard. A simplified version of the same problem is shown to be PSPACE-complete. The problem of the automated design of parts orienters is rather closely related to motion planning. But the dynamics of the problem is so dominant that similar general formulations seem impossible. In this thesis, the alternative pursued is paradigm-by-paradigm analysis. Three paradigms are presented and analyzed the ``belt'''', for orienting convex polygons that are infinite in the third dimension, the ``pan handler'''', for flat polygonal objects and the vibratory track for flat, convex polygons. Polynomial time algorithms are developed for the automated design of orienters in each of the paradigms.
Eclipse Modeling Framework
Authors: Frank Budinsky, Stephen A. Brodsky, Ed Merks
Venue:  (2003)

The authoritative guide to the Eclipse Modeling Framework (EMF)--written by the lead EMF designers! Shows how EMF unifies three important technologies: Java, XML, and UML @BULLET= Provides a comprehensive overview of the EMF classes including a complete quick reference for all the classes and methods in the EMF 1.1 API. Includes examples of many common framework customizations and programming techniques.
Database system support for multidimensional data analysis in environmental epidemiology
Authors: V. Kamp, F Wietek
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

The project CARLOS (Cancer Registry Lower-Saxony) aims at novel techniques for analysing cancer clusters using advanced database technology to support multidimensional analysis of spatio-temporal related health data. This requires very advanced support capabilities which can not be provided by existing technology. Therefore, new approaches in the fields of spatio-temporal, multidimensional and statistical database systems have to be considered to develop an appropriate support architecture. We present our experiences and ideas gained in implementing a prototype. Based on these facts, we describe our approach to dynamically create statistical objects over predicate based aggregates in the course of epidemiological data analysis.
Build Your Own PC Recording Studio
Authors: Jon Chappell
Venue:  (2003)

:Regardless of whether your taste is heavy metal, hip-hop, or classical, this book will show you how to set up, operate, and maintain a working home recording studio. Learn to choose the right equipment for your music, produce audio for the Internet or a CD, and even get construction tips for building an optimal recording environment. 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 Note on the Sparse Complete Sets
Authors: Steven Fortune
Venue:  (1978)

Hartmanis and Berman have conjectured that all NP-complete sets are polynomial time isomorphic. A consequence of the conjecture is that there are no sparse NP-complete sets. We show that the existence of an NP-complete set whose complement is sparse implies P = NP. We also show that if there is a polynomial time reduction with sparse range to a PTAPE-complete set, then P=PTAPE. Keywords: reduction, polynomial time, nondeterministic polynomial time, complete sets, sparsity.