ppxscal/embedding_network huggingface dataset:
Variational and numerical analysis of a dynamic frictionless contact problem with adhesion
Authors: O. Chau, J. R. Fernández, W. Han, M. Sofonea
Venue: Journal of Computational and Applied Mathematics (2003)

We study a dynamic frictionless contact problem between a viscoelastic body and an obstacle, the so-called foundation. The contact is subjected to an adhesion effect, whose evolution is described by an ordinary differential equation. For the variational formulation of the contact problem, we present and prove an existence and uniqueness result. A fully discrete scheme is introduced to solve the problem. Under certain solution regularity assumptions, we derive an optimal order error estimate. Some numerical examples are included to show the performance of the method.
Type Analysis of Prolog Using Type Graphs
Authors: P. Van Hentenryck, A. Cortesi, B. L Charlier
Venue:  (1993)

Type analyis of Prolog is of primary importance for high-performance compilers, since type information may lead to better indexing and to sophisticated specializations of unification and built-in predicates to name a few. However, these optimizations often require a sophisticated type inference system capable of inferring disjunctive and recursive types and hence expensive in computation time. The purpose of this paper is to describe a type analysis system for Prolog based on abstract interpretation and type graphs (i.e. disjunctive rational trees) with this functionality. The system (about 15,000 lines of C) consists of the combination of a generic fixpoint algorithm, a generic pattern domain, and a type graph domain. The main contribution of the paper is to show that this approach can be engineered to be practical for medium-sized programs without sacrificing accuracy. The main technical contributions to achieve this result are (1) a novel widening operator for type graphs which appears to be accurate and effective in keeping the sizes of the graphs, and hence the computation time, reasonably small; (2) the use of the generic pattern domain to obtain a compact representation of equality constraints between subterms and to factor out sure structural information.
On guaranteed bandwidth channels
Authors: S. Chaudhry, M. Raziuddin, A. Choudhary
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

This paper introduces a new scheme and design of a protocol for guaranteed bandwidth channels. Given traffic characteristics of media streams, it is possible to bound delays experienced through each node in the network, using appropriate discretion at channel establishment time. Once a channel with such bounded delays is established, our scheme uses feedback techniques to match the flow of media units at each node with that of the playback rate at the client site. The feedback is triggered by preset marks in the buffers at each node called water marks. The receipt of a feedback by a node changes the rate of flow at that node, thus matching the rate of playback at the client. Jitter is implicitly controlled in such a scheme, as buffering absorbs the different delays experienced by media units. The scheme also provides continuity of playback for multimedia streams, removing this responsibility from the higher software layers at the client. We present analytical proofs that our scheme provides guaranteed bandwidth and prove the protocol safe. Further, simulation results are provided to validate the protocol
MLPQ: a linear constraint database system with aggregate operators
Authors: P. Z. Revesz, Yiming Li
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

The paper describes the MLPQ constraint database system. The query language of MLPQ is SQL extended with linear arithmetic constraints. The input and output databases are linear constraint databases (LCDBs). An important feature of the MLPQ system is that it can handle aggregate operators, Min, Max, Sum, Avg, etc. In MLPQ, these operators are evaluated for a series of linear programming (LP) problems. This approach provides an efficient way of evaluation of SQL queries with aggregate operators on linear constraint databases.
Semantic integration of deductive databases
Authors: Patrizia Asirelli, Chiara Renso, Franco Turini
Venue:  (1996)

A language in support of semantic integration of deductive databases is proposed. The language allows one to construct mediators by extending logic programming with a suite of operators for composing programs and message passing features. The abstract semantics and implementation techniques of the extensions are discussed, and an example of integration of databases supporting libraries and departments is used to illustrate the usefulness of the approach. EMAIL:: asirelli@iei.pi.cnr.it
Some Space Considerations of VLSI Systolic Array Mappings
Authors: J. H. Weston, C. N. Zhang, Hua Li
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

In this paper, the space-time mapping of the dependency matrix of an algorithm is used to study spatial properties of a systolic array implementation of a 3-nested loop structure. Elementary expressions are developed for both the number of processing elements and the area of the array. These expressions involve only the space-time transformation and the lengths of the loops. As well, characterizations have been found for the form of the space-time transformation which produces a systolic array with the minimum number of processing elements, and one which has both the minimum number of processing elements and the smallest area. Moreover, the theorems can be also being applied to more general algorithms, such as variable length of loops.
Microsoft Office Project 2003 Inside Out
Authors: Teresa Stover
Venue:  (2003)

Take your Microsoft Project experience to the next level! This supremely organized reference packs hundreds of timesaving solutions, troubleshooting tips, and handy workarounds for Project 2003 in concise, fast-answer format.
Implementing a Notion of Modules in the Logic ProgrammingLanguage Lambda-Prolog
Authors: Keehang Kwon, Gopalan Nadathur, Sue D Wilson
Venue:  (1993)

Issues concerning the implementation of a notion of modules in the higher-order logic programming language $\lambda$Prolog are examined. A program in this language is a composite of type declarations and procedure definitions. The module construct that is considered permits large collections of such declarations and definitions to be decomposed into smaller units. Mechanisms are provided for controlling the interaction of these units and for restricting the visibility of names used within any unit. The typical interaction between modules has both a static and a dynamic nature. The parsing of expressions in a module might require declarations in a module that it interacts with, and this information must be available during compilation. Procedure definitions within a module might utilize procedures presented in other modules and support must be provided for making the appropriate invocation during execution. Our concern here is largely with the dynamic aspects of module interaction. We describe a method for compiling each module into an independent fragment of code. Static interactions prevent the compilation of interacting modules from being completely decoupled. However, using the idea of an interface definition presented here, a fair degree of independence can be achieved even at this level. The dynamic semantics of the module construct involve enhancing existing program contexts with the procedures defined in particular modules. A method is presented for achieving this effect through a linking process applied to the compiled code generated for each module. A direct implementation of the dynamic semantics leads to considerable redundancy in search. We present a way in which this redundancy can be controlled, prove the correctness of our approach and describe run-time structures for incorporating this idea into the overall implementation.
Coverage Modeling for Dependability Analysis of Fault-Tolerant Systems
Authors: B J Dugan, S K Trivedi
Venue:  (1986)

Several different models for predicting coverage in a fault-tolerant system are discussed, including models for permanent, intermittent and transient errors. Markov, semi-Markov, non-homogeneous Markov and extended stochastic Petri net models for computing coverage are developed. Two types of events which interfere with recovery are examined; methods for modeling such events (applicable if the events are deterministic or random) are given. The sensitivity of system reliability/availability to the coverage parameter and the sensitivity of the coverage parameter to various error handling strategies are investigated. Particularly, we discovered that a policy of attempting transient recovery upon detection of an error (as opposed to automatically reconfiguring the affected component out of the system) may actually {\em increase} the unreliability of the system. This result is true if the error detectability is not nearly perfect, so that the risk of producing an undetectable error (if the transient error is still present) is greater than the benefit gained by not discarding the component.
Identifying Parallelism in Programs with Cyclic Graphs
Authors: Yuan-Shin Hwang, Joel Saltz
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Dependence analysis algorithms have been proposed to identify parallelism in programs with tree-like data structures. However, they cannot analyze the dependence of statements if recursive data structures of programs are cyclic. This paper presents a technique to identify parallelism in programs with cyclic graphs. The technique consists of three steps: (1) Traversal patterns that loops or recursive procedures traverse graphs are identified, and the statements that construct the links of traversal patterns will be located by definition-use chains of recursive data structures; (2) Shape analysis is performed to estimate possible shapes of traversal patterns; (3) Dependence analysis is performed to identify parallelism using the result of shape analysis. This approach can identify parallelism in programs with cyclic data structures due to the facts that many programs follow acyclic structures (i.e. traversal patterns) to access all nodes on the cyclic data structures. Once the traversal patterns are isolated from the overall data structures, dependence analysis can be applied to identify parallelism.
Sensitivity Analysis of Modular Dynamic Fault Trees
Authors: Yong Ou, Joanne Bechta Dugan
Venue: Proceedings of the 4th International Computer Performance and Dependability Symposium (2000)

Dynamic fault tree analysis, as currently supported by the Galileo software package, provides an effective means for assessing the reliability of embedded computer-based systems. Dynamic fault trees extend traditional fault trees by defining special gates to capture sequential and functional dependency characteristics. A modular approach to the solution of dynamic fault trees effectively applies Binary Decision Diagram (BDD) and Markov model solution techniques to different parts of the dynamic fault tree model.Reliability analysis of a computer-based system tells only part of the story, however. Follow-up questions such as: "Where are the weak links in the system?", "How do the results change if my input parameters change?" and "What is the most cost effective way to improve reliability?" require a sensitivity analysis of the reliability analysis. Sensitivity analysis (often called Importance Analysis) is not a new concept, but the calculation of sensitivity measures within the modular solution methodology for dynamic and static fault trees raises some interesting issues.In this paper we address several of these issues, and present a modular technique for evaluating sensitivity, a single traversal solution to sensitivity analysis for BDD, a simplified methodology for estimating sensitivity for Markov models, and a discussion of the use of sensitivity measures in system design. The sensitivity measures for both the Binary Decision Diagram and Markov approach presented in this paper will be implemented in Galileo, a software package for reliability analysis of complex computer-based systems.
Dave Sussman's Beginning Dynamic Websites with ASP.NET Web Matrix
Authors: Dave Sussman, Alex Homer, John West, James Greenwood
Venue:  (2003)

:With this book and Web Matrix, you'll be developing your own powerful ASP.NET websites in no time.We'll start at the beginning, learning how to create graphical web pages in Web Matrix. Then we'll use Visual Basic .NET and databases to add the dynamic features usually seen in expensive commercial websites. We'll finish by looking at some of the expert ASP.NET features - writing our own controls and web services. Even if you've never programmed before, this book will take you right into the world of professional web development. You'll be amazed at how easy it is, and how much you can do. Complete Starter kit. Everything you need to get you started: Complete ASP.NET Web Matrix Software included on the CD Friendly tutorial full of working examples and packed with screenshots With this book you will be able to... Go further than just static HTML websites, by using a programming language. We will get you building real dynamic websites right from the beginning. Change the content of your pages quickly and easily by using databases. With this book, youll learn how databases work, and how to make the most of them. Add interactivity to your website by creating your very own Guest Book, and allow people to leave messages with emoticons. Create content you can distribute to other websites, and learn how to automatically update it all over the Web in one go! Who is this book for? Users of any edition of Microsoft Windows XP or 2000 Ideal for beginners - no HTML knowledge is required About the Authors:David Sussman has been writing about ASP since the early days. His books include the best selling Beginning ASP 3.0, Professional ASP 3.0, and Beginning ASP.NET. The Microsoft ASP.NET team gave David early access to the Web Matrix project, and to coincide with the release of Web Matrix he and Alex Homer wrote a free Inside Web Matrix e-book. This is offered fee to everybody who downloads the application from www.asp.net. This latest book teaches readers to create fun and powerful web sites and applications using this excellent free tool. Colt Kwong is one of the most helpful and prolific posters on Microsoft's ASP.NET forums. He spends a great deal of his free time providing help to budding ASP.NET developers, and has used this experience to ensure that this book teaches you all you need to be a successful web developer. John West is a software consultant from Atlanta, Georgia. He develops powerful .NET applications for his corporate clients, and has extensive knowledge of the real-world challenges faced by ASP.NET developers today.
Internet: The Complete Reference, 2 edition
Authors: Margaret Levine Young
Venue:  (2002)

:Get connected and take full advantage of all the Internet has to offer using this resource written by Margaret Levine Young. Whether you use the Internet at home just for fun or in a small office or large organization, you'll find information on every topic from streamlining your e-mail, fighting junk mail, and downloading files to registering your domain name. Learn how to use Web-based chat services, watch videos, purchase goods safely, transfer files, and create your own Web site using Dreamweaver, FrontPage, and GoLive. Fully updated to reflect recent changes in technology and online trends - including peer-to-peer services and voice and video conferencing - this is an ideal reference for every Internet user. 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
{\bf (Revision of CS-1994-16.)} SATCHMORE: SATCHMO with RElevancy
Authors: W D Loveland, W D Reed, S D Wilson
Venue:  (1994)

We introduce a relevancy detection algorithm to be used in conjunction with the SATCHMO prover. The version of SATCHMO considered here is essentially a bidirectional prover, utilizing Prolog (back-chaining) on Horn clauses and forward-chaining on non-Horn clauses. Our extension, SATCHMORE (SATCHMO with RElevancy), addresses the major weakness of SATCHMO: the uncontrolled use of forward-chaining. By marking potentially relevant clause head literals, and then requiring that all the head literals be marked relevant (be ``totally relevant'''') before a clause is used for forward-chaining, SATCHMORE is able to guide the use of these rules. Furthermore, the relevancy testing is performed without extending the proof search beyond what is done in SATCHMO. A simple implementation of the extended SATCHMO can be written in Prolog. We describe our relevancy testing approach, present the implementation, prove soundness and completeness, and provide examples which demonstrate the power of relevancy testing.
TALK2C: A Tool for Automatic Migration
Authors: S. Dhinakar Jacob, Madhuchhanda Das
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

The IT infrastructure of today's organizations is often populated with yesterday's legacy systems which trace an evolutionary path, with ad hoc changes & enhancements spread over a period of time and an inadequate change history. The inherent knowledge is normally contained in the code, which is written in an arcane language, understandable to a few and hard to maintain. Automated translation provides a convenient solution to these issues when maintaining the existing system is the main issue and the source and target languages share the same programming paradigms. TALK2C was developed to automate the conversion of code from SabreTalk to C language. SabreTalk a derivative of PL/1, runs on an earlier version of the TPF (Transaction Pro essing Facility) system.
Lightweight Languages for Interactive Graphics
Authors: Scott Draves
Venue:  (1995)

Run time code generation (RTCG) and traditional compilation are two ends of the same underlying optimization: factoring computations out of repeated procedure calls. Self-applicable partial evaluation (PE) is a semantics-based program transformation traditionally used for automatic compiler generation. Recently, PE has also been applied to RTCG. My approach to RTCG is to implement a composable cogen for a compiler intermediate representation. My thesis is that this approach to optimizing programs can be particularly useful for interactive graphics toolkits. I intend to demonstrate this by implementing a compiler generator tuned for RTCG, and showing how it can be used to build software that is highly abstract and yet still as fast as less general programs.
Oracle9i DBA 101, 1 edition
Authors: Marlene Theriault, Rachel Carmichael, James Viscusi
Venue:  (2002)

Your Oracle career starts here! Ideal for those new to Oracle technology, this introductory guide explains in easy-to-follow detail the day-to-day duties of a database administrator (DBA), as well as essential database installation, monitoring, and managing techniques. The book covers all the new features of Oracle9i. From the exclusive publisher of Oracle Press books.Table of contents Part I: Defining Your World 1: About Being an Oracle DBA 2: Oracle Database Layout 3: How to Look at the Database 4: How to Look at the Database Using the V$ Views 5: How to Protect the Database 6: How to Tune the Database Part II: Managing Your World 7: Oracle Installation, Configuration, and Build 8: General Database Considerations 9: What We Do Daily Part III: Protecting Your World 10: Oracle Security and You 11: Availability Part IV: Tuning Your World 12: Server Performance 13: Oracle-Supplied Tools Part V: Appendixes A: Glossary B: Resources
Stock Detective Investor: Finding Market Gems Online
Authors: Kevin Lichtman, Lynn N. Duke
Venue:  (2002)

:The market's wild ride of the past two decades and the rise of the Internet have put many investors in an enviously successful position. Today there are more investing opportunities than ever before and quicker access to more information than most people knew existed. And yet there is one downside to the market boom that has grown as rapidly as the Dow - securities fraud. So, how do you get in on the online investing revolution without losing your shirt - or your nest egg? The answer is just a click away." "Now, with Stock Detective Investor: Finding Market Gems Online, you'll learn the invaluable research strategies used by the popular Web site and how to apply them yourself.
Groundness Analysis for Prolog: Implementation and Evaluation of the Domain Prop
Authors: Baudouin L Charlier, Pascal Van Hentenryck
Venue:  (1992)

The domain Prop is a conceptually simple and elegant abstract domain to compute groundness information for Prolog programs. In particular, abstract substitutions are represented by Boolean functions built using and, or, and equivalence. Prop has raised much theoretical interest recently but little is known about the practical accuracy and efficiency of this domain. Experimental evaluation of Prop is particularly important since Prop theoretically needs to solve a co-NP-complete problem. However, this complexity issue may not matter much in practice because the size of the abstract substitutions is bounded, since Prop would work only on the clause variables in many frameworks. In this paper, we describe an implementation of the domain Prop and use it to instantiate a generic abstract interpretation algorithm. A key feature of the implementation is the use of ordered binary decision graphs to provide a compact representation of many Boolean functions. The implementation (about 6000 lines of C) has been evaluated systematically and its efficiency and accuracy has been compared with two other abstract domains: the domain Mode (mode, same-value, sharing) and the domain Pattern (mode, same-value, sharing, pattern). A comparison with a reexecution algorithm over the domain Mode, denoted Mode-Reex, is also given. The benchmark programs include symbolic equation-solvers, peephole optimizers, cutting-stock programs, and parsers. This is, to our knowledge, the first implementation and evaluation of Prop. The experimental results are particularly interesting. The accuracy results for groundness inference indicate that, on our benchmark programs, Prop compares well in accuracy with Pattern, outperforms Mode by an order of magnitude, and is exactly as accurate as Mode-Reex. The efficiency results are even more surprising. They indicate that Prop is only twice as slow as Mode in the average, takes 70 Mode-Reex. Results on on-line analysis are also reported.
Balancing Domain Decomposition for Plates
Authors: Patrick Le Tallec, Jan Mandel, Marina Vidrascu
Venue:  (1993)

We show that the Neumann-Neumann preconditioner with a coarse problem can be applied to the solution of system of linear equations arising from the tin plate problem discretized by the HCT and DKT elements. The condition number is asymptotically bounded by log^2(H/h), with H the subdomain size and h the element size. The bound is independent of coefficient jumps of arbitrary size between subdomains. Numerical results are presented.