ppxscal/embedding_network huggingface dataset:
Neural Networks with Long-Range Feedback: Design for Stable Dynamics
Authors: R. Braham
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Feedback in neural networks is essential. Without it, true dynamics would be lacking. For this reason, many well known models include feedback connections (e.g. Hopfield, ART, neocognitron). Neural networks with feedback are, however, likely to be unstable if not carefully designed. In this paper, we show how to incorporate long-range feedback in a class of dynamically stable nonlinear neural networks. 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
Strip Layout: A New Layout Methodology for Standard Circuit Modules
Authors: Jitendra Apte, Gershon Kedem
Venue:  (1987)

is a new layout methodology that is suitable for automatically laying out standard circuit modules and for automatic module generation from transistor net-list. We demonstrate that the new layout methodology yields circuits that are denser than standard cell layout while retaining all the advantages of standard cells. Moreover, Strip Layout could be generated by simple algorithms at high speed.
Decidability Extracted: Synthesizing "Correct-by-Construction" Decision Procedures from Constructive Proofs
Authors: James Caldwell
Venue:  (1998)

The topic of this thesis is the extraction of efficient and readable programs from formal constructive proofs of decidability. The proof methods employed to generate the efficient code are new and result in clean and readable Nuprl extracts for two non-trivial programs. They are based on the use of Nuprl''s set type and techniques for extracting efficient programs from induction principles. The constructive formal theories required to express the decidability theorems are of independent interest. They formally circumscribe the mathematical knowledge needed to understand the derived algorithms. The formal theories express concepts that are taught at the senior college level. The decidability proofs themselves, depending on this material, are of interest and are presented in some detail. The proof of decidability of classical propositional logic is relative to a semantics based on Kleene''s strong three-valued logic. The constructive proof of intuitionistic decidability presented here is the first machine formalization of this proof. The exposition reveals aspects of the Nuprl tactic collection relevant to the creation of readable proofs; clear extracts and efficient code are illustrated in the discussion of the proofs.
Universal coalgebra: a theory of systems
Authors: J. J.M.M. Rutten
Venue:  (1996)

In the semantics of programming, finite data types such as finite lists, have traditionally been modelled by initial algebras. Later final coalgebras were used in order to deal with infinite data types. Coalgebras, which are the dual of algebras, turned out to be suited, moreover, as models for certain types of automata and more generally, for (transition and dynamical) systems. An important property of initial algebras is that they satisfy the familiar principle of induction. Such a principle was missing for coalgebras until the work of Aczel (1988) on a theory of non-wellfounded sets, in which he introduced a proof principle nowadays called coinduction. It was formulated in terms of bisimulation, a notion originally stemming from the world of concurrent programming languages (Milner, 1980; Park, 1981). Using the notion of coalgebra homomorphism, the definition of bisimulation on coalgebras can be shown to be formally dual to that of congruence on algebras (Aczel and Mendler, 1989). Thus the three basic notions of universal algebra: algebra, homomorphism of algebras, and congruence, turn out to correspond to: coalgebra, homomorphism of coalgebras, and bisimulation, respectively. In this paper, the latter are taken as the basic ingredients of a theory called universal coalgebra. Some standard results from universal algebra are reformulated (using the afore mentioned correspondence) and proved for a large class of coalgebras, leading to a series of results on, e.g., the lattices of subcoalgebras and bisimulations, simple coalgebras and coinduction, and a covariety theorem for coalgebras similar to Birkhoff''s variety theorem.
Using graph grammar to implement global layout for a visual programming language generation system
Authors: Ke-Bing Zhang, Kang Zhang, Mehmet A. Orgun
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

VisPro is a general-purpose visual language generation system based on Reserved Graph Grammar (RGG). It can express a wide range of diagrammatic visual programming languages (VPLs). This paper presents a global layout approach used in the VisPro system. Our approach is grammar-based graph drawing, in which layout rules are embedded in the productions of RGG. Thus, the RGG formalism serves both the visual language grammar and the layout grammar. This approach is appropriate and feasible enough for graph drawing in the area of visual programming languages based on reserved graph grammars.
An Incremental Planning Algorithm for Ordering Equations in a Multilinear System of Constraints
Authors: Bradley T. Vander Zanden
Venue:  (1988)

Constraint equations are increasingly being used in interactive applications such as graphics, logical programming, and simulation that demand immediate feedback. To handle the performance requirements imposed by such systems constraint evaluators must use incremental satisfaction techniques. In this paper, we apply these techniques to noncircular, multilinear systems of equations. The constraint satisfaction process is divided into two phases--a planning phase that imposes a topological order on the equations and an execution phase that evaluates the equations. A planning algorithm is presented that incrementally updates this order each time the constraint system changes. This technique achieves significant performance improvements in large constraint systems since modifications generally perturb only a small portion of the topological order.
The Breakdown of Operators when Interacting with the External World
Authors: Garrett A. Pelton, Jill F Lehman
Venue:  (1994)

By looking at the simple task of tossing a bean bag from hand to hand, we show how the macro operator method breaks down when formulating agent models that interact with an uncertain external world. A macro operator encapsulates a plan to reach an objective. Occasionally the objective will be found to be unachievable, requiring the macro operator and its plan to be rejected. Letting the macro operator interact with the external world does not, by itself, change this situation, but the fact that the results of the interaction are uncertain, and the agent''s knowledge incomplete, does. The key idea is that the agent can''t positively determine if progress towards the objective is being made in the external world, and thus errors will be made in rejecting a macro operator that would succeed. We show that there are a number of methods by which the agent can recover from such an operator rejection and continue toward the operator''s objective. If we make operator rejection and recovery into a common mechanism, then the operators and the plans they represent will be split by the interaction into a sequence of smaller operators each doing a portion of the work toward the objective of the larger operator. The models are described in terms of Soar and we assume the reader''s familiarity with both the architecture and the Problem Space Computational Model in our discussions.
A Graph Parsing Algorithm
Authors: Carolyn L. McCreary
Venue:  (1990)

The theory of graph-grammars is a generalization of formal languages and the theory of string grammars. The objects that are created through productions are graphs rather than strings and the production rules must include instructions for connecting the produced graph to the existing graph (embedding rules). The lack of clear and concise statements of the production rules and the absence of a parsing algorithm to recapture a set of productions are two problems that have prevented much use of graph-grammars. Most graph rewriting schemes have a complex set of rules for determining which production can be applied and for specifying the embedding of the replacement graph in the host graph. This paper presents a parsing alorithm for decomposing two large classes of graphs, dependency graphs and Hasse graphs. A dependency graph is the transitive closure of a directed acyclic graph (dag) and a Hasse graph is the transitive reduction of a dag. A dag can be uniquely associated with each of these graphs. The graph rewriting scheme is simple and the resulting parse is unique. The graph rewriting scheme is the first known polynomial time, O(n**3) parsing algorithm for a general class of graphs.
Fast Algebraic Multigrid for Discontinuous Optical Flow Estimation
Authors: Sugata Ghosal, Petr Vanek
Venue:  (1994)

Multiple moving objects, occluded objects, or even a moving object against the static background give rise to discontinuities in the optical flow field in corresponding image sequences. Uniform global smoothing-based regularization cannot provide accurate estimates if the optical flow is discontinuous. A weighted anisotropic smoothness''-based regularization technique is proposed for accurately estimation dense optical flow field. Weighted sum of the magnitude and first-order spatial derivatives of the optic flow field is used for regularization. Less regularization is performed at points where strong intensity gradient information is available. The solution at any point is interpolated more from those at neighboring points along the weaker intensity gradient-component. A new scalable algebraic multigrid algorithm is developed to efficiently solve resulting second-order elliptic partial differential equations with discontinuities and anisotropies in coefficients. This multigrid technique utilizes information about coefficients of the stiffness matrix in generating coarse spaces. The proposed optical flow computation technique outperforms Horn-Schunck''s and Nagel-Enkelmann''s techniques in terms of accuracy as well as speed. Experimental results and execution times are reported for a variety of synthetic and real sequences to demonstrate the effectiveness of the weighted anisotropic smoothness-based regularization and the algebraic multigrid solver.
Ciao: a graphical navigator for software and document repositories
Authors: Y.-F. R. Chen, G. S. Fowler, E. Koutsofios, R. S. Wallach
Venue: Proceedings of the International Conference on Software Maintenance (1995)

Programmers frequently have to retrieve and link information from various software documents to accomplish a maintenance task. Ciao is a graph-based navigator that helps programmers query and browse structural connections embedded in different software and document repositories. A repository consists of a collection of source documents with an associated database that describes their structure. Ciao supports repositories organized in an architecture style called Aero, which exploits the duality between a class of entity-relationship (ER) databases and directed attributed graphs (DAG). Database queries and graph analysis operators in Aero are plug-compatible because they all take an ER database and produce yet another ER database by default. Various presentation filters generate graph views, source views, and relational views from any compatible ER database. The architecture promotes the construction of successively more complex operators using a notion of virtual database pipelines. Ciao has been instantiated for C and C++ program databases, and program difference databases. The latter allows programmers to explore program structure changes by browsing and expanding graphs that highlight changed, deleted, and added entities and relationships. The unifying ER model under ciao also allows users to navigate different software repositories and make necessary connections. We have linked program difference databases and modification request (MR) databases so that users can investigate the connections between MRs and affected entities. Ciao has been applied to several large communications software projects and we report experiences and lessons learned from these applications.
A compact file format for labeled transition systems
Authors: Izak A. Langevelde
Venue:  (2001)

A compact open file format for labeled transition systems, which are commonly used in specification and verification of concurrent systems, is introduced. This combination of openness, both in specification and implementation, and compactness is unprecedented, since existing formats in this field are either not compact, yielding files too large to be easily handled, or proprietary, hampering the development of efficient tools. Therefore, the development of this {\sc SVC} format was initiated to facilitate the development of state-of-the-art tools for the analysis of concurrent systems and communication protocols. The {\sc SVC} format is specified by its binary layout and the underlying compression scheme, based on Lempel-Ziv and dynamic Huffman encoding. Also, an application programming interface is defined. The compression scheme is compared with existing algorithms.
A Dynamic Reconfiguration Model for a Distributed Web Crawling System
Authors: Hongfie Yan, Jianyong Wang, Xiaoming Li
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

A web crawling system employing a parallel and distributed architecture needs to have a mechanism to bring the whole system in a coordinated state when the nodes are added to or removed from the system. This paper presents an efficient dynamic reconfiguration model that can be used in such a system. The study shows that this model leads to some nice properties, such as load balance and low traffic in the system, which contribute to high performance. Currently this model is being implemented in WebGather, a well-known Chinese and English web search engine.
Multilingual linguistic resources: from monolingual lexicons to bilingual interrelated lexicons
Authors: Marta Villegas, Nuria Bel, Alessandro Lenci, Nicoletta Calzolari, Nilda Ruimy, Antonio Zampolli, Teresa Sadurni, Joan Soler
Venue:  (2000)

This paper describes a procedure to convert the PAROLE-SIMPLE monolingual lexicons into bilingual interrelated lexicons where each word sense of a given language is linked to the pertinent sense of the right words in one or more target lexicons. Nowadays, SIMPLE lexicons are monolingual although the ultimate goal of these harmonised monolingual lexicons is to build multilingual lexical resources. For achieving this goal it is necessary to automatise the linking among the different senses of the different monolingual lexicons, as the production of such multilingual relations by hand will be, as all tasks related with the development of linguistic resources, unaffordable in terms of human resources and time spent. The system we describe in this paper takes advantage of the SIMPLE model and the SIMPLE based lexicons so that, in the best case, it can find fully automatically the relevant sense-to-sense correspondences for determining the translational equivalence of two words in two different languages and, in the worst case, it will be able to narrow the set of admissible links between words and relevant senses. This paper also explores to what extent semantic encoding in already existing computational lexicons such as SIMPLE can help in overcoming the problems arisen when using monolingual meaning descriptions for bilingual links and aims to set the basis for defining a model for adding a bilingual layer to the SIMPLE model. This bilingual layer based on a bilingual relation model will be the basis indeed for defining the multilingual language resource we want PAROLE-SIMPLE lexicons to become.
VC Rating and Quality Metrics: Why Bother?
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The System-on-a-Chip era needs more than just avail-able silicon to become a reality. A first step was an SoC design methodology roadmap based on IP Reuse. Two significant initiatives were taken. First one by Mentor Graphics and Synopsys at DAC 1997 where the two companies signed a Design Reuse Partnership. A follow up of this initiative was the publishing at DAC'98 of the Reuse Methodology Manual for System-on-a-Chip, a practical methodology to the challenges associated with design reuse. In parallel the electronic industry created the Virtual Socket Initiative (VSI) organization. Both initiatives were well perceived by the electronic design community and significant achievements occurred. VSI focused more on the Virtual Components aspects with its deliverables and Mentor and Synopsys on the authoring part of the Virtual Component (VC). The next step was taken at DAC'2001 when Mentor and Synopsys decided to donate the IP OpenMORE rating system to VSIA and participate strongly together in the next stage towards the VC Open Standards story. Thus giving birth to a VSIA VC Quality Development Working Group. The challenge will be for this forum to convince the elec-tronic design community that VC rating and quality met-rics are achievable and useful, and make them available. We will go through the process that takes place during the SoC complete design and verification phase with existing VC open standards and design methodology rules and guidelines. We will use a mobile radio 3G base station sub-system as an example. This example comes from a fast growing market segment, therefore system designers are under heavy development mile-stone pressure and it shows how a very practical ap-proach can be taken to a very rational VC design repre-sentation choice process. The objective of this paper is to set the stage for the final step towards a VC quality metrics effort that the industry needs to adopt, and de-fine the next achievable goals. 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
Special Year on Logic and Algorithms Tutorial Notes: Complexity Issues in Automata-Theoretic Verification: The COSPAN Approach to Deal with These Issues(Tutorial Lectures by Robert Kurshan)
Authors: Robert Kurshan, Sandeep Shukla
Venue:  (1997)

The 1995-1996 DIMACS Special Year on Logic and Algorithms began with three week-long tutorial sessions on the topics of the special year:
A combined procedure for optimization via simulation
Authors: Juta Pichitlamken, Barry L. Nelson
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2003)

We propose an optimization-via-simulation algorithm for use when the performance measure is estimated via a stochastic, discrete-event simulation, and the decision variables may be subject to deterministic linear integer constraints. Our approach---which consists of a global guidance system, a selection-of-the-best procedure, and local improvement---is globally convergent under very mild conditions.
Correspondentie David van Dantzig -- Gerrit Mannoury historische notitie SEN, 1
Authors: J. Siegenbeek van Heukelom, Gerard Alberts
Venue:  (2000)

Correspondence David van Dantzig--Gerrit Mannoury October 23rd 1917, after the second lecture in a course on analytical geometry David van Dantzig, student of chemistry, wrote a long letter to the professor of mathematics Gerrit Mannoury. It proved the starting point of a life-long symbiosis of pupil and master in mathematics, metamathematics and significs. Significs was the novel theory of intersubjective understanding. Gerrit Mannoury, 1867-1956, self-educated mathematician and communist was the central figure in the signific circle, a Dutch counterpart of the Vienna circle. David van Dantzig, 1900-1959, grew to be a successful mathematician. In the late 1930''s he turned to applications and mathematical modelling. After the war Van Dantzig cofounded the CWI. He placed mathematical statistics on the mathematical agenda in the Netherlands. This historical note offers an inventory of their correspondence.
Methods of Problem-Oriented Representation and Data Processing in Resources of the Hardware Support of Intellectual Systems
Authors: Oleg A. Fin'ko
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

In the report the conceptual problems of rise of productivity and reliability of specialized computing devices (SCD) of intellectual systems are considered on the basis of representation and data processing with the help various problem-oriented machine arithmetics (POMA). The directions of development of methods of representation and data processing are considered, and also the new methods are offered and the known methods are essentially advanced.
On Intervals of Partial Clones of Boolean Partial Functions
Authors: L. Haddad, G. E. Simons
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

We describe the interval of all partial clones that containall monotonic idempotent Boolean partial functions as wellas the interval of all partial clones that contain all idempotentself-dual Boolean partial functions.
The Unstoppable Orchestra: a responsive distributed application
Authors: M. Werner, A. Polze, M. Malek
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

Responsiveness, the ability to provide real-time behavior even in the presence of faults, is becoming one of the most sought after properties in distributed computing systems. We present a framework for "high-performance responsive computing" in networked systems whose current implementation works on a network of five NeXTSTEP (Mach 2.5)-based HP workstations. "The Unstoppable Orchestra" is a demonstration program which runs in our environment. This application simulates a real orchestra consisting of musicians playing different instrumental parts of a classical masterpiece. However instead of real musicians our orchestra consists of computers equipped with speakers. In contrast to the real orchestra, where a sudden disappearance of, for example, a flautist can hardly be hidden, in our orchestra one "musician" can take over his neighbour's part, ensuring uninterrupted performance. We discuss the design issues behind the "Unstoppable Orchestra" and show how our programming framework supports synchronization and reconfiguration of responsive applications.
Distributed protocol for selective intra-group communication
Authors: T. Tachikawa, M. Takizawa
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

In distributed applications, a group of application processes is established and the processes in the group communicate with one another, i.e. intra-group communication. Here, messages have to be reliably and causally delivered to all the destinations. In addition, the processes send messages to any subset of the group at any time. This paper presents an intra-group communication protocol which provides the group of application processes with the selective and causally ordered (SCO) delivery of messages. The SCO protocol is based on the fully distributed control scheme, i.e. no master controller and uses the high-speed one-to-one network where messages may be lost due to the buffer overrun and congestion