ppxscal/embedding_network huggingface dataset:
Experiences Teach Us the Future of Autonomous Decentralized Systems
Authors: Hiroshi Kuwahara
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

In the last 20 years, autonomous decentralized systems (ADSs) have been developed, and now several hundred systems are in effective operation. As the ADS innovates the system concept, new system architectures and technologies have been induced to develop for increasing the merits and decreasing the demerits of ADSs. In this paper, two typical application systems are shown in order to describe the problems, the solutions and the further work required for realizing ADSs. These experiences teach us about the future of ADSs, which are heading towards telecommunications-based information service systems in which end users autonomously select the service they wish to utilize. The research and development for next-generation ADS technologies in telecommunications-based information services will be accomplished through world-wide cooperation.
Letters to the Editor
Venue: IEEE Security and Privacy (2003)

Comments on the Simson Garfinkel article and more. 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
How Presentation Graphs Communicate
Authors: A. S. C. Ehrenberg
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Graphs can show up simple qualitative patterns well, but not numbers or quantities. To communicate, a graph must have an explicit and verbalized story line. 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
Massive Data Set Analysis in Seismic Explorations for Oil and Gas in Crystalline Basement Interval
Authors: Muchnik Ilya, Mottl Vadim, Levyant Vladimir
Venue:  (1999)

On the basis of the optimization-based approach to the analysis of massive ordered data sets, a new method is proposed for computer-aided interpretation of seismic exploratory data from the so-called crystalline basement of the Earth mantle, which underlies the relatively thin sedimentary cover having been, up to now, the almost exceptional object of seismic explorations. The seismic exploratory data sets, seismic sections and cubes, are a class of, respectively, two- and three-dimensional data arrays, which are analyzed in the course of gas and oil reserves prospecting with the purpose of studying the structure of the underground rock mass. The seismic data sets consist of synchronous records of reflected seismic signals registered by a large number of geophones (seismic sensors) placed along a straight line or in the nodes of a rectangular lattice on the earth surface. As the source of the initial seismic pulse, usually serves a series of explosions, responses to which are averaged in a special manner. The vertical time axis forming the resulting two- or three-dimensional picture is identified with depth, so that the peculiarities of the reflected signal under the respective sensor carry an information on the local properties of the rock mass at the respective point of the underground medium. In contrast to the above-lying sedimentary cover, the absence of pronounced reflecting surfaces in a crystalline body results in a great difficulty of inferring the geological information from the basement interval of the seismic picture. The new method of seismic data analysis proposed in this work is aimed at finding fractured zones of the basement rock mass capable to accumulate oil or gas. The essence of the method consists in numerical evaluating distinctions in the local spatial texture of the seismic picture that are caused by differences in physical properties of fractured and monolith rock. The problem of estimating the local texture over the whole data array at once is set as that of minimizing an objective function in that the texture model parameters at all the elements of the array occur as its arguments. A special separable structure of the objective function provides a high speed of the optimization procedure.
Towards Fuzzy Type Theory
Authors: Vilém Novák
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

In the paper, the formal type theory is generalized tofuzzy one. The structure of truth values is assumedto be the IMTL-algebra (on [0 ,1], the algebra of leftcontinuous t-norms with involutive negation) since theformulation of FTT based on it preserves the elegancyof classical formulation. Some properties of theories offuzzy type theory are demonstrated and the completenesssaying that each consistent theory has a model isproved. We will follow the way of the development ofthe classical type theory as elaborated especially by A.Church and L. Henkin.
On Hamilton cycle decompositions of the tensor product of complete graphs
Authors: R. Balakrishnan, J.-C. Bermond, P. Paulraja, M.-L. Yu
Venue: Discrete Mathematics (2003)

In this paper, we show that the tensor product of complete graphs is hamilton cycle decomposable.
Uniform convergence of curve estimators for ergodic diffusion processes
Authors: J. H Zanten
Venue:  (2000)

For ergodic diffusions, we consider kernel-type estimators for the invariant density, its derivatives and the drift function. Using empirical process theory for martingales, we first prove a theorem regarding the uniform weak convergence of the empirical density. This result is then used to derive uniform weak convergence for the kernel estimator of the invariant density. For kernel estimators of the derivatives of the invariant density and for a nonparametric drift estimator that was proposed by Banon, we give bounds for the rate at which the uniform distance between the estimator and the true curve vanishes. We also consider the problem of estimation from discrete-time observations. In that case, obvious estimators can be constructed by replacing Lebesgue integrals by Riemann sums. We show that these approximations are also uniformly consistent, provided that the bandwidths and the time between the observations are correctly balanced.
Hierarchical Model of Mobile Agents and Its Multimedia Applications
Authors: Ichiro Satoh
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

This paper presents a new framework for constructing networked applications, including multimedia ones. The framework is based on a hierarchical mobile agent system for allowing more than one mobile agent to be dynamically assembled into a single mobile agent. Networked applications constructed in the framework can be implemented as a collection of mobile agents and can dynamically change and evolve their own functions by migrating agents that offer the functions. To demonstrate how to exploit our framework we construct extensible multimedia applications based on the framework.
A conservative theory for long term reliability growth prediction
Authors: P. G. Bishop, R. E. Bloomfield
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

The paper describes a different approach to software reliability growth modelling which should enable conservative long term predictions to be made. Using relatively standard assumptions it is shown that the expected value of the failure rate after a usage time t is bounded by: /spl lambda/~/sub t//spl les/(N/(et)) where N is the initial number of faults and e is the exponential constant. This is conservative since it places a worst case bound on the reliability rather than making a best estimate. We also show that the predictions might be relatively insensitive to assumption violations over the longer term. The theory offers the potential for making long term software reliability growth predictions based solely on prior estimates of the number of residual faults. The predicted bound appears to agree with a wide range of industrial and experimental reliability data. It is shown that less pessimistic results can be obtained if additional assumptions are made about the failure rate distribution of faults.
Lessons Learned from Wrapping Systems
Authors: Christopher Landauer, Kirstie L. Bellman
Venue: Proceedings of the 5th International Conference on Engineering of Complex Computer Systems (1999)

This paper describes lessons we have learned over the last ten years from our "Wrapping" approach to large-scale system development. Our research program in integration for Constructed Complex Systems has led to several results with system engineering applications: the wrapping expression notation "wrex" for communication among distributed entities, the Problem Posing Interpretation that inserts Knowledge-Based Polymorphism into any programming language, and a new systematization of design patterns. We show how we implement wrappings and describe example applications, A little bit of this theory goes a long way, since it was designed for extremely large systems, such as space systems, with their hundreds of organizations, thousands of components, and millions of lines of code.
Structure of coextensions of regular semigroups by rectangular bands
Authors: V. M. Chandrasekaran
Venue: The Korean Journal of Computational Applied Mathematics (2003)

In this paper, we described the structure of coextensions of regular semigroups by rectangular bands.
Evolution in asynchronous cellular automata
Authors: Chrystopher L. Nehaniv
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Building on the work of Von Neumann, Langton, and Sayama among others, we introduce the first examples of evolution in populations of self-reproducing configurations in asynchronous cellular automata. Reliance on a global synchronous update signal has been a limitation of all solutions since the problem of achieving self-production in cellular automata was first attacked by Von Neumann half a century ago. Results of the author obviate the need for this restriction.We review our simple constructive mechanism to transform any cellular automata network with synchronous update into one with essentially the same behavior but whose cells may be updated randomly and asynchronously. The generality of this mechanism is guaranteed by a general mathematical theorem that any synchronous cellular automata configuration and rule can be realized asynchronously in such a way that the behavior of the original synchronous cellular automata can be completely recovered from that of the corresponding asynchronous cellular automaton, in which temporal synchronization locally stays within small tolerances.It follows that most results on self-reproduction, universal computation and construction, and evolution in populations of self-reproducing configurations in cellular automata that have been obtained in the past carry over to the asynchronous domain using the method described here.Here we discuss requirements for evolutionary systems in cellular automata and describe implemented examples of our procedure applied to a variety of self-reproducing systems (Byl, Reggia et al., Langton, Sayama).In particular, we have implemented Sayama's evo-loop system asynchronously, giving the first example of evolution in asynchronous cellular automata.
A Simulation Study of Dynamic Load Balancing for Network-based Parallel Processing
Authors: Wentong Cai, Bu-Sung Lee, Alfred Heng, Li Zhu
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

A simulation study of dynamic load balancing for parallel processing on Network Of Workstations (NOW) is presented in this paper. A simulation model is constructed. It includes a representative CPU scheduling policy, and also considers the message exchange, task transfer and migration costs explicitly. A global dynamic load balancing algorithm is simulated. Both task transfer and task migration are considered. The performance of the algorithm under both homogeneous and heterogeneous environments is analyzed. In addition, the interaction of parallel and sequential workloads on an NOW is also examined. Our results show that dynamic load balancing can achieve better performance improvement for heterogeneous systems than for homogeneous systems; it is especially effective in a system where both parallel and sequential tasks concurrently exist; and the use of task migration generally does not further improve performance.
USB Design by Example: A Practical Guide to Building I/O Devices with CD-ROM, Second Edition, 2 edition
Authors: John Hyde
Venue:  (2002)

:This unique guide goes beyond all the Universal Serial Bus (USB) specification overviews to provide designers with the expert knowledge and skills they need to design and implement USB I/O devices. Organized around a series of fully documented, real-world examples, this book is structured to serve as both a step-by-step guide for creating specific devices and a complete reference to USB. Design examples cover most USB classesHID, communications, audio, mass-storage, and huband provide insights into high-speed USB 2.0 devices, including a device driver for a vendor class called blockio. 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
Concurrent Fault Detection in Random Combinational Logic
Authors: Petros Drineas, Yiorgos Makris
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

We discuss a non-intrusive methodology for concurrentfault detection in random combinational logic. The proposedmethod is similar to duplication, wherein a replica of thecircuit acts as a predictor that immediately detects potentialfaults by comparison to the original circuit. However,instead of duplicating the circuit, the proposed method selectsa small number of prediction logic functions which onlypartially replicate it. Selection is guided by the objective ofminimizing the incurred hardware overhead at the cost of introducingfault detection latency. To achieve this, the proposedmethod replicates only a reduced width output functionfor every input combination, yet without compromisingthe ability to detect all faults. In contrast to concurrent errordetection schemes which presume the ability to resynthesizethe circuit, the proposed method does not interfere with theimplementation of the original design. As compared to previousapproaches, the proposed method achieves significanthardware overhead reduction, while detecting all faults withvery low average fault detection latency.
Cyclone: a broadcast-free dynamic instruction scheduler with selective replay
Authors: Dan Ernst, Andrew Hamel, Todd Austin
Venue: ACM SIGARCH Computer Architecture News (2003)

To achieve high instruction throughput, instruction schedulers must be capable of producing high-quality schedules that maximize functional unit utilization while at the same time enabling fast instruction issue logic. Many solutions exist to the scheduling problem, ranging from compile-time to run-time approaches. Compile-time solutions feature fast and simple hardware, but at the expense of conservative schedules. Dynamic schedulers produce high-quality schedules that incorporate run-time information and dependence speculation, but implementing these schedulers requires complex circuits that can slow processor clock speeds.In this paper, we present the Cyclone scheduler, a novel design that captures the benefits of both compileand run-time scheduling. Our approach utilizes a list-based single-pass instruction scheduling algorithm, implemented by hardware at run-time in the front end of the processor pipeline. Once scheduled, instructions are injected into a timed queue that orchestrates their entry into execution. To accommodate branch and load/store dependence speculation, the Cyclone scheduler supports a simple selective replay mechanism. We implement this technique by overloading instruction register forwarding to also detect instructions dependent on incorrectly scheduled operations. Detailed simulation analyses suggest that with sufficient queue width, the Cyclone scheduler can rival the instruction throughput of similarly wide monolithic dynamic schedulers. Furthermore, the circuit complexity of the Cyclone scheduler is much more favorable than a broadcast-based scheduler, as our approach requires no global control signals.
Adaptive analysis of quasibrittle failure
Authors: B. Patzák, M. Jirásek
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper presents an adaptive mesh refinement technique suitable for the resolution of highly localized damage in concrete and other quasibrittle materials. Objectivity of the description of softening is ensured by using regularized material models based on the concept of nonlocal averaging, which is applied to isotropic and anisotropic damage formulations. The distributions of strain and internal variables produced by such regularized models are continuous, which facilitates the projection of information from one finite element mesh onto another. However, not all mapping algorithms for the transfer of internal variables preserve the basic characteristics of the localized process zone. The paper evaluates and compares three mapping algorithms, which are based on the closest-point transfer, least-square projection, and shape-function projection. It also briefiy comments on other important components of a complete adaptive strategy, i.e., on the error indicator, refinement rules and mesh generator. The efficiency of the proposed strategy is illustrated by examples that treat straight as well as curved crack trajectories. The underlying material model is a nonlocal integral formulation of anisotropic damage based on the microplane concept.
Detection and Protection Against Network Scanning: IEDP
Authors: Xiaobing Guo, Depei Qian, Min Liu, Ran Zhang, Bin Xu
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Network scanning is an increasing threat to network security. This paper classifies and analyzes current scanning methods, and draws a conclusion that the current detection and protection of scanning mainly aim at information concealment. A novel system of the detectionand protection named IEDP is presented in this paper. Its concept is discussed and its implementation is described in details. Compared with the current approaches, the concept of IEDP can be recapitulated in one word: "impartation". When detecting a scanning, IEDP gives the scanner bogus information to spoof and confuse him/her. So, for example, when scanning ports, the scanner will find that all ports are listening and can't tell which port is really open. IEDP also adopts a new mechanism called error steering to spoof the scanner.IEDP randomly steers errors in communication with the scanner, let the scanner believe that the communication is unstable and give up scanning. Experiments show that IEDP system is efficient.
Access Control Model in Object-Oriented Systems
Authors: Keiji Izaki, Katsuya Tanaka, Makoto Takizawa
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

The authors discuss a discretionary access control model to realize secure object-oriented systems. An object is manipulated only through methods supported by the object. Classes and objects are hierarchically structured in generalization (is-a) and aggregation (part-of) relations. We discuss how to authorize and inherit access rights on classes and objects in the hierarchical structure.
Introduction to fusion based systems - contributions of soft computing techniques and application to robotics
Authors: M. Oussalah
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

Data/information fusion, as a methodology to integrate information stemming from different sources to get a more refined and meaningful knowledge, has gained a lot of interest within several communities as it sounds from the number of publications and successful applications in this area. This chapter is aimed to explore how the fusion methodology is decomposed into a set of primary subtasks where the elicitation and the architecture play a central role in the fusion process. Particularly the contributions of soft computing techniques at various levels of the fusion architecture are laid bare. Some exemplifications, through the use of serial and parallel architectures, employing both probabilistic and possibilistic approaches, have been carried out. Finally a robotics application consisting in a localization of a mobile robot has been performed and shows how the different steps of the fusion architecture have been handled.
A formalised first-order confluence proof for the &#x03BB;-calculus using one-sorted variable names
Authors: René Vestergaard, James Brotherston
Venue: Information and Computation (2003)

We present the titular proof development that has been verified in Isabelle/HOL. As a first, the proof is conducted exclusively by the primitive proof principles of the standard syntax and of the considered reduction relations: the naive way, so to speak. Curiously, the Barendregt Variable Convention takes on a central technical role in the proof. We also show: (i) that our presentation of the λ-calculus coincides with Curry's and Hindley's when terms are considered equal up to α-equivalence and (ii) that the confluence properties of all considered systems are equivalent.
Time Controlled Dynamic Scheduling of Aperiodic Real-Time Tasks
Authors: Babak Hamidzadeh, Yacine Atif
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

In this paper, we introduce a new set of dynamic scheduling algorithms for scheduling and guaranteeing the deadline compliance of a set of aperiodic real-time tasks on a uniprocessor architecture. The task model selected is that of non-preemptable tasks with arbitrary start times and deadlines. The proposed algorithms address a fundamental trade-off in dynamic scheduling between the cost of scheduling and the quality of the resulting schedules. The algorithms control the time allocated to scheduling explicitly, in order to obtain good-quality schedules in reasonable times. We show that taking into account the scheduling time is crucial for honoring the deadlines of scheduled real-time tasks. The paper provides experimental evaluation of our algorithms via performance comparisons with existing landmark algorithms that were originally designed to address some similar issues. The results of our experiments show that our algorithms outperform the existing techniques in several parameter configurations.
Partial logics with two kinds of negation as a foundation for knowledge-based reasoning
Authors: Heinrich Herre, Jan O.M. Jaspars, Gerd Wagner
Venue:  (1995)

We show how to use model classes of partial logic to define semantics of general knowledge-based reasoning. Its essential benefit is that partial logics allow us to distinguish two sorts of negative information: the absence of information and the explicit rejection or falsification of information. Another general advantage of partial logic, which we discuss in the first part, is that its meta-theory is very close to the meta-theory of classical logic. In the second part notions of minimal, paraminimal and stable models are presented in terms of partial logic and we show how the resulting definitions can be used to define the semantics of knowledge bases such as relational and deductive databases, and extended logic programs.
Design of AQM in Supporting TCP Based on the Well-Known AIMD Model
Authors: Ki B Kim, Ao Tang, Steven H Low
Venue:  (2003)

Abstract to be added.