ppxscal/embedding_network huggingface dataset:
Temporal Causal Networks for Simulation and Diagnosis
Authors: M. Bouzid, A. Ligeza
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

The paper is devoted to presentation of Temporal Causal Networks (TCN) for representing and dealing with causal dependencies propagation over time. A temporal causal network is a causal network incorporating explicit representation of intervals of time during which its symptoms/nodes are valid, not valid, and unknown. The temporal knowledge is represented with use of the so-called characteristic functions formalism, which allows for classical binary-valued logic specification and can be easily extended towards multivalued or fuzzy logic. The presented approach makes use of specific time constraints propagation algorithm for determining causality propagation over the network in time. This is done by evaluating the characteristic functions used as means for representing time constraints for network nodes. The main application includes simulation, monitoring and elements of diagnostic reasoning for dynamic systems with explicit time representation.
The Internet Weather: Balancing Continuous Change and Constant Truths
Authors: James W. Moore
Venue:  (2002)

:"What will work be like in the future? Futurists often try to answer this question by looking at the effects of the Internet and technology, examining how they have changed our personal and professional lives." In The Internet Weather, instead of studying all the changes occurring in our world, James Moore looks at all the things that will stay the same. Technology may lead us to more rapid communication, more voluminous information, and a world without the privacy we've come to expect, but it will also force us to think in new ways about old values. Most likely, argues Moore, we will not abandon age-old ideals for new ones, but reorganize human society around the same old ideals we've always held, accommodating and incorporating new technologies into new ways of living under the same, long-held beliefs.
Synchronization of Digital Telecommunications Networks
Authors: Stefano Bregni
Venue:  (2002)

:Network synchronization deals with the distribution of time and frequency across a network of clocks often spread over a wide geographical area. The goal is to align (i.e. synchronize) the time and frequency scales of all clocks, by using the communication capacity of their interconnecting links.Network synchronization plays a central role in digital telecommunications as it determines the quality of most services offered by the network operator. However, the importance of network synchronization is often underestimated and how to solve quality-of-service degradation caused by synchronization difficulties can become problematical to all but a synchronization engineer.Systematically covers a wide spectrum of both theoretical and practical topicsFeatures a clear and profound description of synchronous and asynchronous digital multiplexing (PDH, SDH), jitter and timing aspects of SDH networksExpounds synchronization network principles and implementation issues, clock modelling, time and frequency measurementPresents recent advances in telecommunications clock characterization and measurementIf you are a system engineer, researcher, designer or postgraduate student searching for both the basics and an insight into more advanced areas currently under discussion then you will find Synchronization of Digital Telecommunications Networks an enlightening read. It will also prove to be a valuable sourcebook for senior undergraduates and technical personnel in telecommunications companies.
Validation of Coding Schemes and Coding Workbench
Authors: Vito Pirrelli, Claudia Soria, Ulrich Heid
Venue:  (2000)

This report presents methodology and results of the validation of the MATE best practice coding schemes and the MATE workbench. The validation phase covered the period from September 1999 to February 2000, and involved project partners as well as Advisory Panel members who kindly volunteered to act as external evaluators. The first part of the report focuses on the evaluation of the theoretical work in MATE while the second part concentrates on the workbench . In both cases, a questionnaire has been used as a core tool to obtain feedback from evaluators. A major probem has been the short time available for evaluation which has implied that less feedbach than originally expected could be obtained . Evaluation of MATE results will continue after the end of the project.
Program Derivation by Proof Transformation
Authors: Penny Anderson
Venue:  (2001)

In the proofs-as-programs methodology, verified programs are developed through theorem-proving in a constructive logic. Under this approach, the theorem-proving process can be regarded as a program derivation process. The merits of this approach to programming are twofold. First, working with proofs instead of programs concentrates the developer''s effort on the intellectually difficult part of the development process: understanding, solving, and explaining the solution to a mathematical problem. Second, the proof provides a formal and trustworthy basis for an explanation of the program. This thesis investigates the use of proof transformations as a way to address important concerns in program derivation that are not addressed by theorem-proving alone. One difficulty with the proofs-as-programs strategy arises from the conflict between elegance and efficiency. A simple, elegant proof may lead to an inefficient program. A more complex proof that corresponds to a more efficient program may be difficult to invent or understand. With proof transformations, a developer can start with an elegant proof that is easy to understand, and incrementally derive a more complex proof and thus a more efficient program. Another problem comes from the need for adaptation and reuse. With current automated support for theorem-proving, it is difficult to re-use previous work other than by re-using lemmas from a library. This kind of reuse is analogous to the use of subroutine libraries in ordinary programming, and does not directly support adaptation. Proof transformations provide a way of adapting a proof to a new context. One standard approach to metaprogramming tasks like proof transformation has been to use a separate programming language, such as ML, as a metalanguage for a type theory considered as an object logic. A more recently developed strategy, which has been applied to programming language semantics, theorem-proving, and related problems, is the use of a higher-order logic programming language as a logical framework. This thesis adopts the second approach, using the Elf programming language, which gives a logic programming interpretation to the Edinburgh Logical Framework. We show a partially verified implementation of support for the proofs-as-programs strategy and proof transformations, and argue that the implementation techniques contribute to the concise, declarative, and verifiable implementation of metaprogramming tasks for formal logic. Through case studies of small programming problems, we demonstrate that known program transformations can be implemented in the domain of proofs, and expressed as derived logical rules. The case studies supply evidence that a development methodology based on proof transformation can provide a useful integration between the flexibility of program transformation and the formal connection between a program and its specification of the proofs-as-programs methodology.
Multiobjective evolutionary search for one-dimensional cellular automata in the density classification task
Authors: Gina M. B. Oliveira, José C. Bortot, Pedro P. B. de Oliveira
Venue: Proceedings of the eighth international conference on Artificial life (2002)

A key concern in artificial-life-oriented research in complex systems has been the relationship between the dynamical behaviour of cellular automata (CA) and their computational ability. Along this line, evolutionary methods have been used to look for CA with predefined computational behaviours, the most widely studied task having been the Density Classification Task (DCT). It has recently been showed that the use of an heuristic guided by parameters that estimate the dynamical behaviour of CA, can improve evolutionary search. On the other hand, an approach that has been successfully applied to several kinds of problems is the Evolutionary Multiobjective Optimization (EMOO). Here, the EMOO technique called Non-Dominated Sorting Genetic Algorithm is combined with the parameter-based heuristic, and successfullly applied to the DCT, suggesting a positive synergy out of using the two techniques in the search for CA.
Extending Database Programming Language with Ad hoc Query Facilities
Authors: Iztok Savnik
Venue:  (1993)

The query language OVAL intended for the extension of the database programming language based on C++ with declarative constructs for querying complex objects is proposed in this paper. The work contributes to the solution of the impedance mismatch problem between the syntax and the semantics of the programming and query language. The proposed query language OVAL is based on the object-oriented functional data language O^2FDL [21]. The salient features of the OVAL query language are: (i) functional nature of the query language, which makes the language suitable for the integration with the imperative languages, (ii) modular style of query definition, which we found very natural for expressing queries on complex objects, (iii) recursive evaluation of the algebraic operations on set structured complex-objects and the use of schema information for expressing queries. The use of intermediate complex objects for the query definition and evaluation together with modular way of query definition leads to quite different style of writing queries comparing them to the standard SQL query language style.
Coherence without additivity
Authors: Enrico Diecidue, Fabio Maccheroni
Venue: Journal of Mathematical Psychology (2003)

The Dutch book argument is a coherence condition for the existence of subjective probabilities. This paper gives a general framework of analysis for this argument in a nonadditive probability setting. Particular cases are given by comonotonic and affinely related Dutch books that lead to Choquet expectation and Min expectations.
C++: The Complete Reference, 4th Edition, 4 edition
Authors: Herb Schildt
Venue:  (2002)

Best-selling genius Herb Schildt covers everything from keywords, syntax, and libraries, to advanced features such as overloading, inheritance, virtual functions, namespaces, templates, and RTTI—plus, a complete description of the Standard Template Library (STL).Table of contents Part I: The Foundation of C++: The C Subset 1: An Overview of C 2: Expressions 3: Statements 4: Arrays and Null-Terminated Strings 5: Pointers 6: Functions 7: Structures, Unions, Enumerations, and User-Defined Types 8: C-Style Console I/O 9: File I/O 10: The Preprocessor and Comments Part II: C++ 11: An Overview of C++ 12: Classes and Objects 13: Arrays, Pointers, References, and the Dynamic Allocation Operators 14: Function Overloading, Copy Constructors, and Default Arguments 15: Operator Overloading 16: Inheritance 17: Virtual Functions and Polymorphism 18: Templates 19: Exception Handling 20: The C++ I/O System Basics 21: C++ File I/O 22: Run-Time Type ID and the Casting Operators 23: Namespaces, Conversion Functions, and Other Advanced Topics 24: Introducing the Standard Template Library Part III: The Standard Function Library 25: The C-Based I/O Functions 26: The String and Character Functions 27: The Mathematical Functions 28: Time, Date, and Localization Functions 29: The Dynamic Allocation Functions 30: Utility Functions 31: The Wide-Character Functions Part IV: The Standard C++ Class Library 32: The Standard C++ I/O Classes 33: The STL Container Classes 34: The STL Algorithms 35: STL Iterators, Allocators, and Function Objects 36: The String Class 37: The Numeric Classes 38: Exception Handling and Miscellaneous Classes Part V : Applying C++ 39: Integrating New Classes: A Custom String Class 40: An Object-Oriented Expression Parser 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
An Optimal Lagrange Multiplier Based Domain Decomposition Method for Plate Bending Problems
Authors: Jan Mandel, Radek Tezaur, Charbel Farhat
Venue:  (1995)

We present a new Lagrange multiplier based domain decomposition method for solving iteratively systems of equations arising from the finite element discretization of plate bending problems. The proposed method is essentially an extension of the FETI substructuring algorithm to the biharmonic equation. The main idea is to enforce the continuity of the transversal displacement field at the subdomain crosspoints throughout the preconditioned conjugate gradient iterations. The resulting method is proved to have a condition number that does not grow with the number of subdomains, and grows at most polylogarithmically with the number elements per subdomain. These optimal properties hold for numerous plate bending elements for the Reissner-Mindlin plate models. Computational experiments are reported and shown to confirm the theoretical optimal convergence properties of the new domain decomposition method. Computational efficiency is also demonstrated with the numerical solution in 45 iterations and 105 seconds on a 64-processor IBM SP2 of a plate bending problem with almost one million degrees of freedom.
Bridging the Gap between Users and Complex Decision Support Systems: the Role of Justification
Authors: Giovanni Guida, Marina Zanella
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

Justification is understood as the task of convincing users that the output of a software system is correct and useful, providing sound specific support and credible reasons. This paper discusses the role of justification in making complex software systems more usable and acceptable, and proposes a novel approach to the design of justification systems. A generic, highly reusable architecture is defined and commented. It includes causal, teleological and behavioral models of the target application domain, a knowledge-base containing individual user profiles, and a set of reasoning mechanisms, based on general justification principles. The proposed approach, which supports a broad class of justifications, has been tested in a case study concerning operator support in steel production. The developed prototype is briefly presented along with justification examples.
Adaptive Crossover Operator based on Locality and Convergence
Authors: Myung-Sook Ko, Tae-Won Kang, Chong-Sun Hwang
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

In this paper, we propose an Adaptive Crossover Operator(ACO) for function optimization. ACO performs local improvement by restricting the crossover range in adaptive way. This approach is based on bias_value which restricts the location of crossover point. Bias_value is computed by the fitness function value, performance ratio, and the number of generations. As generations progress, the portion of chromosome to apply ACO becomes much smaller. ACO scheme can reduce t he computation complexity and escape from getting stuck local optimum. And also, by maintaining diversity it can maintain the balance between exploration and exploitation. Several experiments have been carried out to compare the performan ce of adaptive scheme and standard scheme. Compared to simple GA, the proposed method is faster and more accurate in finding global optimum.
Cluster Technologies for High Performance Computing
Authors: Mitsuo Ishii
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

A cluster system is extending its ability owing to the increase of transmission speed and interface speed between nodes and interconnect. Synfinity interconnect can carry out the routing and transfer the massages by the speed of Giga byte/s. Bottle neck problem raised in conventional cluster must be solved by such improvement as transmission speed and protocol. Based on standard interface, any kind of commodities like latest PCs,WSs and SMPs can be applied as a node computer. That makes cluster attractive system on the point of availability, usability, flexibility, scalability and cost performance. Moreover parallel program on cluster system can be written by using newly-developed message communication library without paying any attention to the communication between inter- and intra-node. Cluster system will be also used in stead of parallel computer, MPP and so called supercomputer and it have a new features of shared memory view.
Grey-scale morphology based on fuzzy logic
Authors: Ting Deng, Henk J.A.M. Heijmans
Venue:  (2000)

There exist several methods to extend binary morphology to grey-scale images. One of these methods is based on fuzzy logic and fuzzy set theory. Another approach starts from the complete lattice framework for morphology and the theory of adjunctions. In this paper, both approaches are combined. The basic idea is to use (fuzzy) conjunctions and implications which are adjoint in the definition of dilations and erosions, respectively. This gives rise to a large class of morphological operators for grey-scale images. It turns out that this class includes the often used grey-scale Minkowski addition and subtraction.
Comprehending Web Applications by a Clustering Based Approach
Authors: G. A. Di Lucca, A. R. Fasolino, F. Pace, P. Tramontana, U. De Carlini
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

The number and the complexity of web applications are increasing dramatically to satisfy the market requests, and the need of effective approaches for comprehending them is growing accordingly. Recently, some reverse engineering methods and tools have been proposed to support the comprehension of a web application; the information recovered by these tools is usually rendered in graphical representations. However, the graphical representations become progressively less useful with large-scale applications, and do not support adequately the comprehension of the application.In this paper, to overcome this limitation, we propose an approach based on a clustering method for decomposing a web application (WA) into groups of functionally related components. The approach is based on the definition of a coupling measure between interconnected components of the WA that takes into account both the typology and the topology of the connections. The coupling measure is exploited by a clustering algorithm that produces a hierarchy of clustering. This hierarchy allows a structured approach for the comprehension of the web application to be carried out. The approach has been experimented with medium sized web applications and produced interesting and encouraging results.
Domain-retargetable reverse engineering. III. Layered modeling
Authors: S. R. Tilley
Venue: Proceedings of the International Conference on Software Maintenance (1995)

For pt. II see International Conference on Software Maintenance (ICSM '94), p. 336-342. The paper describes ongoing work on a domain-retargetable reverse engineering environment which is used to aid the structural understanding of large information spaces. In particular, it presents a layered modeling approach to representing three classes of artifacts manipulated during the reverse engineering process. The approach provides a practical and extensible method of integrating existing tools and techniques into a reverse engineering environment by leveraging results from other areas, such as relational databases, hypertext, and conceptual modeling.
Aircraft conceptual design by collaborative manual and automatic agents
Authors: Kamran E Shahroudi
Venue:  (1997)

In real applications, it is extremely difficult (if not impossible) to define function(s) that measure the `true merit'' of a design object. For example, even the most prominent aircraft designers would not dare to claim that a particular set of merit and constraint functions measures the `true merit'' of a class of aircraft. The traditional approach to set up a `machine centric'' optimization cannot effectively address this issue because there is no user interaction with the numerical optimization at design or run time. The semi-automatic concept, however, can help because the user is allowed to interact with the design problem and the design progress in-the-loop, such that the design criteria can be improved relatively easily at design time. This paper briefly describes the semi-automatic design optimization setup which was introduced in full detail in a previous paper by the author. A simple multidisciplinary aircraft conceptual design optimization problem is then specified based on Torenbeek (1992). Various modes of in-the-loop user control on the search progress and the search problem then illustrate the potential benefits of allowing the user to interact with a numerical agent at various levels of automation.
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
Authors: Burkhard Englert, Alexander A. Shvartsman
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Providing shared-memory abstraction in message-passing systems often simplifies the development of distributed algorithms and allows for the reuse of shared-memory algorithms in the message-passing setting. Attiya, Bar-Noy, and Dolev (1995) developed a robust emulation of atomic single-writer/multi-reader registers in message-passing systems, this emulation was extended by Lynch and Shvartsman (1997) to multi-writer/multi-reader registers using reconfigurable quorum systems.In this work we present a new atomic multi-writer/multi-reader register service that includes a fault-tolerant reconfiguration service. This new emulation has a substantially improved performance and fault-tolerance characteristics. We introduce the concept of intermediate quorum configurations and show how they can be used by readers/writers during reconfiguration.The result is that the quorum reconfigurations are graceful: readers and writers no longer ¿busy-wait¿ during reconfigurations but are able to complete their operations. An additional advance is that the reconfigurer is eliminated as the single point of failure.When the reconfigurer fails, readers and writers continue using intermediate configurations. In finite executions, read and write operations terminate in bounded time using bounded number of messages (the bounds depend on the ¿currency¿ of the configuration at the invoker of the operation).Finally, the service places no restrictions on the installed quorum configuration: A previously installed quorum system can be replaced by an arbitrary new quorum system. Our algorithms are specified using I/O Automata; the safety proofs use the partial order techniques and invariants, and the performance is assessed using operational reasoning.
Within ARM''s reach: compilation of left-linear rewrite systems via minimal rewrite systems
Authors: Wan J. Fokkink, Jasper F.T Kamperman, H. R. Walters
Venue:  (1997)

A new compilation technique for left-linear term rewriting systems is presented, where rewrite rules are transformed into so-called minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM).