ppxscal/embedding_network huggingface dataset:
HELPER: an interactive extensible debugging system
Authors: H. E. Kulsrud
Venue: Proceedings of the second symposium on Operating systems principles (1969)

HELPER is a symbol oriented debugging system used for programs which have been compiled previously. It is easily extensible employing an incremental compiler to process commands given in a natural language. Programs are executed by simulation permitting a number of analysis actions to take place on each instruction. Debugging is both dynamic and static. Many program errors are caught before execution and a back up feature is provided to check code in the neighborhood of an error. Free access to more machine oriented debugging tools is possible and a complete record of each computer session is kept.
Managing Don't Cares in Boolean Satisfiability
Authors: Sean Safarpour, Andreas Veneris, Rolf Drechsler, Joanne Lee
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Advances in Boolean satisfiability solvers have popularized their use in many of today's CAD VLSI challenges. Existing satisfiability solvers operate on a circuit representation that does not capture all of the structural circuit characteristics and properties. This work proposes algorithms that take into account the circuit don't care conditions thus enhancing the performance of these tools. Don't care sets are addressed in this work both statically and dynamically to reduce the search space and guide the decision making process. Experimentsdemonstrate performance gains.
A structured product coding system (spcs) for intelligent product data management
Authors: Chi-Haur Wu
Venue:  (2003)

The impact of products' design on manufacturing cost is significant. A product that is difficult to assemble will increase its production cost while one that is difficult to disassemble will increase its recycling cost. In order to develop highly manufacturable and recyclable products, an accurate process for identifying problematic parts, before they are released for manufacturing, must be used. In recognizing the importance of this capability, a CAD/CAM/CAE product data management (C3P) tool based on a structured product coding system (SPCS) is developed. The CP3 system is an integrated design-to-manufacturing system for analyzing and calculating products' manufacturing cost in a virtual assembly and disassembly environment. It analyses a product by importing information from its ISO-10303 (STEP) CAD data. It models assembly and disassembly operations of both parts and tools used in manufacturing the product to accurately model its production process. By using the system, a product designer is able to calculate the impact of every part used for building a product based on it parts and tool cost, cycle time, and other important parameters associated with manufacturing and recycling.
Remeshed smoothed particle hydrodynamics for the simulation of laminar chemically reactive flows
Authors: A. K. Chaniotis, C. E. Frouzakis, J. C. Lee, A. G. Tomboulides, D. Poulikakos, K. Boulouchos
Venue: Journal of Computational Physics (2003)

We present an extension of the remeshed smooth particle hydrodynamics (RSPH) method for the simulation of chemically reactive flows. The governing conservation equations are solved in a Lagrangian fashion, while particle locations, which are distorted by the flow, are periodically re-initialized (remeshed) on a grid. The RSPH implementation is employed for the simulation of a hydrogen/air opposed-jet burner with detailed chemistry and transport. The effect of particle number (resolution), compressibility (Mach number) and outflow boundary condition (length of the domain) on the solution are considered. The RSPH computational results are compared with numerical results obtained by a spectral element implicit scheme and by a one-dimensional code. It is shown that RSPH provides a flexible and accurate alternative for the numerical simulation of chemically reacting flows.
On a Combinatorial Theorem of Erd&ouml;s, Ginzburg and Ziv
Authors: Yahya Ould Hamidoune, Oscar Ordaz, Asdrubal Ortuño
Venue: Combinatorics, Probability and Computing (1998)

Let G be an abelian group of order n and let &mu; be a sequence of elements of G with length 2n&minus;k+1 taking k distinct values. Assuming that no value occurs n&minus;k+3 times, we prove that the sums of the n-subsequences of &mu; must include a non-null subgroup. As a corollary we show that if G is cyclic then &mu; has an n-subsequence summing to 0. This last result, conjectured by Bialostocki, reduces to the Erdos&ndash;Ginzburg&ndash;Ziv theorem for k=2.
Ordering systems: coordinative practices in architectural design and planning
Authors: Kjeld Schmidt
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

In their cooperative effort, architects depend critically on elaborate coordinative practices and artifacts. The paper presents, on the basis of an in-depth study of architectural work, an analysis of these practices and artifacts and shows that they are multilaterally interrelated and form complexes of interrelated practices and artifacts which we have dubbed 'ordering systems'. In doing so, the paper outlines a conceptual framework for investigating and conceiving of such practices.
Multivariate quadrature on adaptive sparse grids
Authors: Hans-Joachim Bungartz, Stefan Dirnstorfer
Venue: Computing (2003)

In this paper, we study the potential of adaptive sparse grids for multivariate numerical quadrature in the moderate or high dimensional case, i.e. for a number of dimensions beyond three and up to several hundreds. There, conventional methods typically suffer from the curse of dimension or are unsatisfactory with respect to accuracy. Our sparse grid approach, based upon a direct higher order discretization on the sparse grid, overcomes this dilemma to some extent, and introduces additional flexibility with respect to both the order of the 1 D quadrature rule applied (in the sense of Smolyak's tensor product decomposition) and the placement of grid points. The presented algorithm is applied to some test problems and compared with other existing methods.
Architecture and design of a diagnostic information fusion system
Authors: Kai Goebel
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

This paper introduces an architecture for aggregation of output from different diagnostic tools. The diagnostic fusion tool deals with conflict resolution, where diagnostic tools disagree; temporal information discord, where the estimate of different tools is separated in time; differences in information updates, where the classifiers are updated at different rates; fault coverage discrepancies; and integration of a priori performance specifications. To this end, a hierarchical weight manipulation approach is introduced which creates and successively refines a fused output. The performance of the fusion tool is evaluated throughout its design. This allows impact assessment of adding heuristics and enables early tuning of parameters. Results obtained from diagnosing on-board faults from aircraft engines are shown which demonstrate the fusion tool's operation.
An efficient gradient-based learning algorithm applied to neural networks with selective actuation neurons
Authors: Noel Lopes, Bernardete Ribeiro
Venue: Neural, Parallel Scientific Computations (2003)

A new class of Neural Networks (NN), designated the Multiple Feed-Forward (MFF) networks, and a new gradient-based learning algorithm, Multiple Back-Propagation (MBP), are proposed and analyzed. MFF are obtained by integrating two feed-forward networks (a main network and a space network) in a novel manner. A major characteristic is their ability to partition the input space by using selective neurons, whose actuation role is captured through the space localisation of input pattern data. In this sense, only those neurons fired by a particular data point turn out to be relevant, while they retain the capacity to approximate closely to more general, irregular, non-linear features in localized regions. Together, the MFF networks and the MBP algorithm embody a new neural architecture, ensuring, in most cases, a better design choice than the one provided by the Multi-Layer Perceptron (MLP) networks trained with the Back-Propagation (BP) algorithm. The utilization of computable importance factors for the actuation neurons whose relative magnitudes are derived from the space network properties and the training data is the key reason for its ability to decompose the underlying mapping function into simpler sub-functions requiring parsimonious NN. Experimental results on benchmarks confirm improved efficiency of the gradient-based learning algorithm proposed, borne out by better generalization and in most cases by shorter training times for online learning, as compared with the MLP networks trained with the BP algorithm.
Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research
Authors: Ann Gawam, Jan K. Pachl, Jacob Slonim, Anne Stilman
Venue: IBM Centre for Advanced Studies Conference (1991)

Welcome to CASCON '91. This conference marks a new phase in IBM's university relationships. Over the past nine years, IBM Canada has worked closely with universities through its university cooperative program -- contributing more than $60 million to fund a wide variety of research projects. We strongly believe that education and research are key to creating a better future. The IBM Canada Ltd. Laboratory Centre for Advanced Studies (CAS)is built upon this commitment.
Cyber Heart: The Employment of an Iterative Design Process to Develop a Left Ventricular Heart Graphical Display
Authors: C. Reginald Jegathese, Goo Lay Guan, L. Antony Rajiv, Eddie Y. K. Ng, Dhanjoo Ghista, Edmond C. Prakash
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

This paper presents a model-based representation ofthe heart shape, and dynamics. The left ventricle (LV) ofthe heart is constructed as a mathematical model, close tothe shape of actual LV. The model is made suitable forsimulating the deformation of the heart during the cardiaccycle. A pseudo stress and strain analysis are conductedon the ventricular myocardium, and visualized. Thevisualization software is capable of simulating theconditions of a diseased heart. The interactive model andsoftware implementation is useful for wide range ofsimulation studies that can be integrated with this virtualmodel that can help in fields like clinical treatmentplanning, manufacture of artificial heart, study of heartdiseases etc.
Digitizing cultural heritage manuscripts: the Bovary project
Authors: Stéphane Nicolas, Thierry Paquet, Laurent Heutte
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

In this paper we describe the Bovary Project, a manuscripts digitization project of the famous French writer Gustave FLAUBERT first great work. This project has just begun at the end of 2002 and should end in 2006 by providing an online access to an hypertextual edition of "Madame Bovary" drafts set. We develop the global context of this project, the main objectives, the first studies and the considered outlooks for the project's carried out.
Evolutions in typesetting systems
Authors: Darrell R. Raymond
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

Using text previewers to browse code and documentation has uncovered some of the basic limitations of classical typesetting systems. Problems arise from the use of embedded markup, the reliance on context-free grammars, and monolithic typesetter design. Some aspects of each of these problems are discussed. A typesetter architecture is proposed that does not require markup or grammars, and that employs a functional decomposition of the typesetting task, in which object-oriented inheritance is used to manage the interaction between modules.
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Authors: Dirk Pattinson
Venue: Theoretical Computer Science (2003)

This paper studies finitary modal logics, interpreted over coalgebras for an endofunctor, and establishes soundness, completeness and decidability results. The logics are studied within the abstract framework of coalgebraic modal logic, which can be instantiated with arbitrary endofunctors on the category of sets. This is achieved through the use of predicate liftings, which generalise atomic propositions and modal operators from Kripke models to arbitrary coalgebras. Predicate liftings also allow us to use induction along the terminal sequence of the underlying endofunctor as a proof principle. This induction principle is systematically exploited to establish soundness, completeness and decidability of the logics. We believe that this induction principle also opens new ways for reasoning about modal logics: Our proof of completeness does not rely on a canonical model construction, and the proof of the finite model property does not use filtrations.
The role of directory services in network management
Authors: James W. Hong, Michael A. Bauer, J. Michael Bennett
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 (1992)

In this paper, the potential role and feasibility of the X.500 Directory Service within the CORDS management services is studied. A simple network monitoring application was adapted to use a prototype X.500 Directory Service for (1) device information, (2) application information, and (3) for compiling summary information on network load. This study is a first step towards the understanding of the possible role of the Directory Service in the management of distributed systems and applications. This work provides an initial feasibility study whose results suggest that the X.500 Directory Service can be used for the storage and retrieval of management information in the management framework. The results also suggest that the Directory Service can be used without it being the bottleneck in certain management operations.
The commutative closure of a binary slip-language is context-free: a new proof
Authors: Michel Rigo
Venue: Discrete Applied Mathematics (2003)

Using original arguments about sets of integers satisfying some first-order formula of the Presburger arithmetic 〈N,+〉, we give a new proof that the commutative closure of a slip-language over a two letters alphabet is context-free.
An Extensible Framework for Collaborative Software Engineering
Authors: Carl Cook, Neville Churcher
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

The size, complexity and duration of typical softwareengineering projects means that teams of developers willwork on them. However, with the exception of version controlsystems, the editors, diagrammers and other tools usedwill generally support only a single user. In this paper, wepresent an architecture for bringing to software engineeringdevelopment environments the advantages of awareness ofthe presence, intentions, and actions of others. Thus far, theapplications of such facilities have been primarily in simpleComputer Supported Cooperative Work (CSCW) tools,such as shared whiteboards, where the corresponding artifacts,unlike those of software engineering, are typicallyboth simple and transient. We describe our implementationof the architecture and prototype tools and illustratethe benefits of providing support for real-time collaborationbetween developers located anywhere on the Internet.We also describe how our architecture, which is based on aparse tree representation of artifacts, may be extended readilyto include new tools, languages, and notations or be customisedto provide new awareness mechanisms.
Formal Methods applied to Plywood Production
Authors: Rosziati Ibrahim, Marlene Lu
Venue: Proceedings of the Third International Conference on Quality Software (2003)

Formal notations and mathematics are used in severalareas to capture the requirements and express thefunctionalities of the software. This paper focuses on theuse of formal methods to model the real worldenvironment in a Malaysian plywood productionmanufacturing industry. The formal methods are used todescribe abstractly the plywood production system in theaspect of its behavior but not precisely the way the systemis programmed. Other informal description does thesame, but with a formal description we can determine (intheory) whether or not a real system satisfies itsdescription and functionalities. Because of this, preciseanalysis on the description itself can be performed and itexposes design decisions which otherwise might not beidentified until the system prototype is being developed.
Semantic Web Services: Reflections on Web Service Mediation and Composition
Authors: Christoph Bussler
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Integrating complex systems like application systems or whole enterprises by means of exchanging electronic business data requires not only the passing of the business data itself in form of business events between the systems but also ensuring that the relevant business events are passed at the right time as well as in the right order. This is called the integration problem: the formal definition and execution of the exchange sequence of business events between complex systems. Many insufficient standard proposals are currently being broughtforward to address the integration problem. This contribution revisits the requirements of complex systems integration and proposes superior alternatives in approaching and solving the integration problem.
Visual data mining and zoomable interfaces
Authors: Alexander Kort
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

In this paper an approach for combining a focus+context visual data mining method with zoomable interfaces is shown. Therefore a zoomable interface for analysing structurable image sets was coupled with a visual data mining component. Research questions like interactions and their relationships to associated data, data-driven interaction restrictions and view generation are discussed.
An extension to the subtype relationship in C++ implemented with template metaprogramming
Authors: István Zólyomi, Zoltán Porkoláb, Tamás Kozsik
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

Families of independent classes, where each class represents a separate, orthogonal concern are highly attractive for implementing collaboration-based design. However, required subtype relationship between such families cannot be expressed in many programming languages. This paper presents a framework to handle collaborating groups of classes using template metaprogramming based on standard C++ features in the style of Loki::Typelist. Our solution provides tailor-made implicit conversion rules between appropriate groups, inclusion polymorphism and a tool for dynamic binding.
Multilanguage programming with ada in the .Net environment
Authors: Jeffrey W. Humphries, Martin C. Carlisle, Terry A. Wilson
Venue: ACM SIGAda Ada Letters (2004)

This paper describes our experiences in using Ada with other programming languages in the .NET environment. This paper explains our approach and presents lessons learned during our development of a real-world software project using .NET. We compare and contrast the languages used, justify our language choices, and present details of our efforts.
A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
Authors: Ali Allahverdi
Venue: Computers and Operations Research (2004)

This paper addresses the m-machine flowshop problem with the objective of minimizing a weighted sum of makespan and maximum tardiness. Two types of the problem are addressed. The first type is to minimize the objective function subject to the constraint that the maximum tardiness should be less than a given value. The second type is to minimize the objective without the constraint. A new heuristic is proposed and compared to two existing heuristics. Computational experiments indicate that the proposed heuristic is much better than the existing ones. Moreover, a dominance relation and a lower bound are developed for a three-machine problem. The dominance relation is shown to be quite efficient.
Design patterns for semaphores
Authors: Kenneth A. Reek
Venue: ACM SIGCSE Bulletin (2004)

This paper describes two design patterns that are powerful tools to help teach how semaphores are used to solve synchronization problems. The patterns are general enough to be used with many different types of problems, yet are simple enough for students to understand and apply effectively.
TUISTER: a tangible UI for hierarchical structures
Authors: Andreas Butz, Markus Groß, Antonio Krüger
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

Tangible user interfaces provide access to virtual information through intuitive physical manipulation. However, feedback is mostly provided by displays in the environment instead of the TUI itself. In this paper we describe the design of Tuister, a tangible user interface with multiple embedded displays and sensors. We explain how Tuister can be used to browse and access hierarchical structures and briefly describe the current state of a prototype we're building.
Automated short proof generation for projective geometric theorems with Cayley and bracket algebras: I. incidence geometry
Authors: Hongbo Li, Yihong Wu
Venue: Journal of Symbolic Computation (2003)

In this paper we establish the Cayley expansion theory on factored and shortest expansions of typical Cayley expressions in two- and three-dimensional projective geometry. We set up a group of Cayley factorization formulae based on the classification of Cayley expansions. We continue to establish three powerful simplification techniques in bracket computation. On top of the Cayley expansions and simplifications, together with a set of elimination rules, we design an algorithm that can produce extremely short proofs in two- and three-dimensional projective geometry. The techniques developed here can be immediately applied to other symbolic computation tasks involving brackets.