ppxscal/embedding_network huggingface dataset:
A General Resource Reservation Framework for Scientific Computing
Authors: Ravi Ramamoorthi, Adam Rifkin, Boris Dimitrov, K. M Chandy
Venue:  (1997)

We describe three contributions for distributed resource allocation in scientific applications. First, we present an abstract model in which different resources are represented as tokens of different colors; processes acquire resources by acquiring these tokens. Second, we present distributed scheduling algorithms that allow multiple resource managers to determine custom policies to control allocation of the tokens representing their particular resources. These algorithms allow multiple resource managers, each with its own resource management policy, to collaborate in providing resources for the whole system. Third, we present an implementation of a distributed resource scheduling algorithm framework using our abstract model. This implementation uses Infospheres, which are Internet communication packages written in Java, and shows the benefits of distributing the task of resource allocation to multiple resource managers.
Developing Web Applications with Visual Basic.NET and ASP.NET
Authors: John Alexander, Billy Hollis
Venue:  (2002)

:Written by two well-known and respected Microsoft insiders, this book is essential for today's VB developer who is tasked with building enterprise-level Web applications using the core .NET technologies -- ASP.NET and VB.NET. After a brief overview of the .NET technologies, they launch right into practical information on how to be immediately productive within ASP.NET from an experienced VB programmer's point of view. They also walk you through an enterprise prototype application that accesses an enhanced version of Microsoft's NorthWind Database.
Adaptation of Asymptotic Close-Coupling Methods to Massively Parallel Computers
Authors: T. W. Gorczyca, M. S. Pindzola, F. S. Shieh, C. L. McCreary
Venue:  (1995)

A standard asymptotic close-coupling method based on a perturbation technique is adapted for use on massively parallel computers. The calculation of K-matrices and cross sections is partitioned over the processors according to incident electron energy. Use of external disk during the calculation is eliminated. Linear scaling with the number of processors is achieved for a 128-node Intel iPSC/860 and a small farm of Sun Sparc 10 workstations.
Another Look at LTL Model Checking
Authors: Edmund Clarke, Orna Grumberg, Kiyoharu Hamaguchi
Venue:  (1994)

We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using this reduction, we also describe how to construct a symbolic LTL model checker that appears to be quite efficient in practice. In particular, we show how the SMV model checking system developed by McMillan can be extended to permit LTL specifications. The results that we have obtained are quite surprising. For the examples we considered, the LTL model checker required at most twice as much time and space as the CTL model checker. Although additional examples still need to be tried, it appears that efficient LTL model checking is possible when the specifications are not excessively complicated.
Computing similarity between RNA strings
Authors: V. Bafna, S. Muthukrishnan, R. Ravi
Venue:  (1996)

Ribonucleic acid (RNA) strings are strings over the four-letter alphabet {A,C,G,U} with a secondary structure of base-pairing between A-U and C-G pairs in the string. Edges are drawn between two bases that are paired in the secondary structure and these edges have traditionally been assumed to be noncrossing. The noncrossing base-pairing naturally leads to a tree-like representation of the secondary structure of RNA strings. In this paper, we address several notions of similarity between two RNA strings that take into account both the primary sequence and secondary base-pairing structure of the strings. We present efficient algorithms for exact matching and approximate matching between two RNA strings. We define a notion of alignment between two RNA strings and devise algorithms based on dynamic programming. We then present a method for optimally aligning a given RNA sequence with unknown secondary structure to one with known sequence and structure, thus attacking the structure prediction problem in the case when the structure of a closely related sequence is known. The techniques employed to prove our results include reductions to well-known string matching problems, allowing wild cards and ranges, and speeding up dynamic programming by using the tree structures implicit in the secondary structure of RNA strings.
Structure and Efficient Hessian Calculation
Authors: Thomas F. Coleman, Arun Verma
Venue:  (1996)

Modern methods for numerical optimization calculate (or approximate) the matrix of second derivatives, the Hessian matrix, at each iteration. The recent arrival of robust software for automatic differentiation allows for the possibility of automatically computing the Hessian matrix, and the gradient, given a code to evaluate the objective function itself. However, for large-scale problems direct application of automatic differentiation may be unacceptably expensive. Recent work has shown that this cost can be dramatically reduced in the presence of sparsity. In this paper we show that for structured problems it is possible to apply automatic differentiation tools in an economical way even in the absence of sparsity in the Hessian. Keywords: Hessian matrix, automatic differentiation, structured computation, sparsity.
On the use of non-linear finite element analysis in deformation evaluation and development of design charts for extrusion processes
Authors: Abul Fazal M. Arif
Venue: Finite Elements in Analysis and Design (2003)

Extrusion is a complex process involving thermo-mechanical changes and any analysis would thus depend upon a number of parameters. In the literature, different mathematical models for predicting required extrusion pressure have been reported. Most of them are based on experimental results and attempts have been made to present them in empirical or other forms. For equations such as those to be useful for tool and process design and process control, they must be placed in a form such as nomograph, charts and tables so as to be readily applied under different operating conditions. The current paper presents such a chart developed for the extrusion dies of varying extrusion ratios. To develop these charts, non-linear finite element method has been used as modeling and simulation tool. As a test case, the extrusion of round billet to rod is considered for a certain set of reference extrusion parameters. To predict the extrusion pressure for other conditions, a set of correction factors based on numerical results, is presented. Finally, the prediction of the proposed method is compared with the published experimental results.
Mass Lumping Emanating from Residual-Free Bubbles
Authors: Leopoldo P. Franca, Alessandro Russo
Venue:  (1995)

A nodally exact scheme is derived for a model equation in 1D involving zeroth and second order terms. The method is derived using residual-free bubbles in conjunction with the Galerkin approximation. It is shown that this approach leads to the mass lumping scheme for sufficiently small mesh sizes.
On the Weakest Failure Detector for Quiescent Reliable Communication
Authors: Marcos K Aguilera, Wei Chen, Sam Toueg
Venue:  (1997)

We consider the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process crashes and lossy links, and show that, among failure detectors with bounded output size, ><P is the weakest one that can be used to solve this problem. Combined with a result in [ACT97a], this shows that failure detectors that are commonly used in practice, i.e., those that output lists of suspects, are not always the best ones to solve a problem.
SHAMASH: An AI Tool for Modelling and Optimizing Business Processes
Authors: David Camacho, Ricardo Aler, Daniel Borrajo, Almudena Sierra-Alonso
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

In this paper we describe SHAMASH, a tool for modeling and automatically optimizing Business Processes. The main features that differentiate it from most current related tools are its ability to define and use organisation standards, and functional structure, and make automatic model simulation and optimisation of them. SHAMASH is a knowledge based system, and we include a discussion on how knowledge acquisition did take place. Furthemore, we introduce a high level description of the architecture, the conceptual model, and other importants modules of the system.
Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs
Authors: Vijay V. Vazirani, Mihali Yannakakis
Venue:  (1987)

The following issues in computational complexity remain imprecisely understood: the striking difference in the complexities of computing the permanent and determinant of a matrix despite their similar looking formulae, the complexity of checking if a directed graph contains an even length cycle, and the complexity of computing the number of perfect matchings in a graph using Pfaffian orientations. Via polynomial time equivalences, we show inter-relationships among these issues.
A Codesign Experiment in Acoustic Echo Cancellation: GMDFa
Authors: Frederic Rousseau
Venue: Proceedings of the 9th international symposium on System synthesis (1996)

Hardware/Software codesign approaches consist generally in Hw/Sw partitioning and scheduling, constrained code generation, hardware and interface synthesis. This paper presents the codesign of an industrial experiment in acoustic echo cancellation (GMDFa algorithm) and emphasizes the partitioning and communication synthesis steps. This experiment points out interesting problems such as data and programs distribution between system memories and modeling communications in the partitioning process.
Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Venue: International Conference on Symbolic and Algebraic Computation (2003)

ISSAC 2003 is the 28th meeting in the well-established series of the International Symposia on Symbolic and Algebraic Computation. The first meeting of the series (1966) was held in Washington, and sponsored by ACM. Since then, the abbreviated name of the meeting has evolved from SYMSAM, SYMSAC, EUROSAM, EUROCAL to finally settle on the present name ISSAC. In 2003, ISSAC will be held at the Drexel University in Philadelphia Pennsylvania USA from August 3rd to August 6th. The topics of the conference includes, but are not limited to: . Algorithmic mathematics. Algebraic, symbolic and symbolic-numeric algorithms. Simplification, function manipulation, equations, summation, integration, ODE/PDE, linear algebra, number theory, group and geometric computing. . Computer Science. Theoretical and practical problems in symbolic computation. Systems, problem solving environments, user interfaces, software, libraries, parallel/distributed computing and programming languages for symbolic computation, concrete analysis, benchmarking, theoretical and practical complexity of computer algebra algorithms, automatic differentiation, code generation, mathematical data structures and exchange protocols. . Applications. Problem treatments using algebraic, symbolic or symbolic-numeric computation in an essential or a novel way. Engineering, economics and finance, physical and biological sciences, computer science, logic, mathematics, statistics, education. . Following the tradition, ISSAC 2003 features invited talks, contributed papers, tutorials, poster sessions, and software exhibitions. This volume contains all the contributed papers to be presented at the meeting as well as the abstracts of the invited talks. The cover (design: Ed Shields) shows the Drexel University billboard at the intersection of 30th and Market Streets in Philadelphia. A total of 68 papers were submitted, and each was distributed to members of the program committee and external reviewers. An average of 3 referee reports were obtained for each submission, and finally 36 papers were selected for presentation. As a consequence, we are convinced that the contributions in these proceedings represent excellent and wide, though not complete, spectra of areas spanning most of symbolic and algebraic computation. Our congratulations and warmest thanks to all contributors and lecturers.
Combining Analytical Hierarchical Analysis with ISO/IEC 9126 for a Complete Quality Evaluation Framework
Authors: André Koscianski, João Candido Bracarense Costa
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

Software production has evolved from its early years of state-of-the-art towards an industrial activity. In the days of the 'software factory', there's a demand for business strategies, market satisfaction, etc. Quality assurance is one of the most important issues and there's an intensive search for technological tools to accomplish it.Measuring is such a valuable tool in the field of quality for several tasks as diagnosis, product comparison, process improvement, etc. In this article we present a measuring framework having the following main characteristics: adherence to an international standard; ability to handle subjectiveness; and clear presentation of detailed and general analysis results. This article is focused on the problem of extracting information about quality from the results of product measurements.
Traceability Recovery in RAD Software Systems
Authors: M. Di Penta, S. Gradara, G. Antoniol
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

This paper proposes an approach and a process to recover traceability links between source code and free text documents in software system developed with extensive use of COTS, middleware, and automatically generated code.The approach relies on a process to filter information gathered from low level artifacts. Information filtering was performed according to a taxonomy of factors affecting traceability links recovery methods. Those factors were directly stem from software rapid development techniques.The approach was applied to recover traceability links from a industrial software, developed with RAD techniques and tools, and making use of COTS (e.g., database accesscomponents), automatically generated code (e.g., via GUI builder and report generators), and middleware (i.e., CORBA). Results are presented, along with lessons learned.
Virtual High School: Teaching Generation V
Authors: Andrew A. Zucker, Robert Kozma
Venue:  (2003)

:Just a decade ago, the notion of attending high school on the Internet seemed futuristic. Yet, today, thousands of students are doing just that. This authoritative volume is the first to provide a thorough, detailed account of the virtual high school. Based on a 5-year study conducted by experienced researchers at SRI International, this book answers such questions as: What is the difference between an online and a face-to-face classroom? What is it like to take, or to teach, an online course? Are online courses effective? What are the problems with its use? Will this new technology change the way teaching and learning is done?
Conducting Realistic Experiments in Software Engineering
Authors: Dag I. K. Sj"berg, Bente Anda, Erik Arisholm, Tore Dybå, Magne J"rgensen, Amela Karahasanovic, Espen F. Koren, Marek Vokác
Venue: Proceedings of the 2002 International Symposium on Empirical Software Engineering (2002)

An important goal of most empirical software engineering research is the transfer of research results to industrial applications. Two important obstacles for this transfer are the lack of control of variables of case studies, i.e., the lack of explanatory power, and the lack of realism of controlled experiments. While it may be difficult to increase the explanatory power of case studies, there is a large potential for increasing the realism of controlled software engineering experiments. To convince industry about the validity and applicability of the experimental results, the tasks, subjects and the environments of the experiments should be as realistic as practically possible. Such experiments are, however, more expensive thanexperiments involving students, small tasks and pen-and-paper environments. Consequently, a change towards more realistic experiments requires a change in the amount of resources spent on software engineering experiments.This paper argues that software engineering researchers should apply for resources enabling expensive and realistic software engineering experiments similar to how other researchers apply for resources for expensive software and hardware that are necessary fortheir research. The paper describes experiences from recent experiments that varied in size from involving one software professional for 5 days to 130 software professionals, from 9 consultancy companies, for one day each.
The EYEDB OODBMS
Authors: Eric Viara, Emmanuel Barillot, Guy Vaysseix
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

This paper introduces the EYEDB Object Oriented DataBase Management System (OODBMS). EYEDB implements all the standard features of OODBMS, is language oriented, provides a generic object model and a support for data distribution using CORBA. It can deal with very large databases, and is both efficient and scalable. It is used in the genome project where huge amount of data have to be managed and intricate data structures needs to be modeled.
Multilevel Adaptive Methods for Turbulent Combustion with Detailed Chemistry: Part I
Authors: C. Liu, C. Liao, Z. Liu, X. Zheng, S. McCormick
Venue:  (1995)

A highly accurate and efficient numercial method is developed for modeling reacting flows with detailed chemistry (e.g. 48 species and 22 finite- rate reation steps) in general curvilinear coordinates. The prediction of NOx formation is made by solving a fully-coupled system of flow and chemistry equations. A contravariant velocity-based governing system is developed for general curvilinear coordinates to maintain simplicity of the continuity equation and compactness of the discretization stencil. We use a fully-implicit backward Euler technique and a third-order monotones upwind-biased scheme on a staggered grid for the respective temporal and spatial terms. An efficient semi-coarsening multigrid method based on line distributive relaxation os used as the flow solver. The species equations are solved in a fully coupled way and the chemical reaction source terms are treated implictly. A preselected-direction least squares iterative method is developed for solving the species equations. A parallel version if the code (P4 form) is used to enhance efficiency on advanced architectures. To obtain good resolution for reacting flow around holes, a fine patch grid is embedded for local refinement, which is shown to be very efficient for improving the entire solution. Calculatons were performed for 3-D plane and axisymmetric co-flow diffusion flames and for strong swirling combustion in a 3-D gas turbine combusture. The current computational method is found to be two to three orders of magnitude faster than traditional iterative methods. For a 49x65x65x frid of 207,025 grid points, the total calculation takes about 200 time steps and 21.3 CRAY-YMP hours
Improving The Efficiency and Quality of Simulation-Based Behavioral Model Verification Using Dynamic Bayesian Criteria
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

In order to improve the effectiveness of simulation-based behavioral verification, it is important to determine when to stop the current test strategy and to switch to an expectantly more rewarding test strategy. The location of a stopping point is dependent on the statistical model one chooses to describe the coverage behavior during verification. In this paper, we present a dynamic Bayesian (DB) and a confidence-based dynamic Bayesian (CDB) stopping rules for behavioral VHDL model verification. The statistical assumptions of the proposed stopping rules are based on experimental evaluation of probability distribution functions and correlation functions. Fourteen behavioral VHDL models were experimented to determine the high efficiency of the proposed stopping rules over the existing ones. Results show that the DB and the CDB stopping rules outperform all the existing stopping rules with an average improvement of at least 69\% in coverage per testing patterns used.
A New Parallel Algorithm for Global Optimization with Application to the Molecular Cluster Problem
Authors: Aiping Liao
Venue:  (1994)

In this paper we present a simple algorithm for global optimization. This algorithm combines random searches with efficient local minimization algorithms. The proposed algorithm begins with an initial "local minimizer." In each iteration, a search direction is generated randomly, along which some points are chosen as the initial points for the local optimization algorithm and several "local minimizers" are obtained. The next iteration is determined by comparing these local minimizers. We will discuss the expected number of iterations for finding a global minimizer with this algorithm. Several variants of the algorithm that take advantage of the partially separable structure are proposed for the Lennard-Jones cluster problem and tested on the IBM SP1 parallel computer. Our numerical results show that our algorithms are promising. Keywords: global optimization, partially separable structure, Lennard-Jones potential function
Coordinating declarative queries with a direct manipulation data exploration environment
Authors: M. Derthick, S. F. Roth, J. Kolojejchick
Venue: Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97) (1997)

Interactive visualization techniques allow data exploration to be a continuous process, rather than a discrete sequence of queries and results as in traditional database systems. However limitations in expressive power of current visualization systems force users to go outside the system and form a new dataset in order to perform certain operations, such as those involving the relationship among multiple objects. Further, there is no support for integrating data from the new dataset into previous visualizations, so users must recreate them. Visage's information centric paradigm provides an architectural hook for linking data across multiple queries, removing this overhead. This paper describes the addition to Visage of a visual query language, called VQE, which allows users to express more complicated queries than in previous interactive visualization systems. Visualizations can be created from queries and vice versa. When either is updated, the other changes to maintain consistency.