ppxscal/embedding_network huggingface dataset:
Formulating disjunctive coupling queries in a web warehouse
Authors: Sourav S. Bhowmick, Ang Kho Kiong, Sanjay Madria
Venue: Data Knowledge Engineering (2003)

We describe how to formulate a coupling query to glean relevant Web data in the context of our web warehousing system called WHOWEDA (Warehouse Of Web Data). Coupling query may be used for querying both HTML and XML documents. One of the important feature of our query mechanism is the ability to express conjunctive as well as disjunctive query conditions compactly. We describe how to formulate a coupling query in text form as well as pictorially using the coupling text and the coupling graph respectively. We explore the limitations of coupling graph with respect to the coupling text. We found out that AND-, OR- and AND/OR-coupling graphs are less expressive than their textual counterparts. To address this shortcoming we introduce the notion of hybrid graph which is a special type of p-connected coupling graph. Finally, we discuss the implementation of a GUI-based system called VISCOUS (VISual COupling QUery System) for formulating such queries.
Exploring IBM E-Business Software, 2 edition
Authors: Casey Young, Donn Atkins
Venue:  (2003)

:If you need to stay current with IBM's wide-ranging e-business software tools, this book (and the companion "members only" Web site) is for you. Widely considered the bible of IBM's e-business world, Exploring IBM e-business Software, Second Edition tells you everything you need to know to evaluate, select, integrate, and manage IBM's e-business software products and services in small, medium, or large sized business environments. In this book, IBM expert Casey Young provides a detailed look at IBM's companywide e-business on demand strategy and how the various IBM software products fit into that strategy. Here you will find information on key IBM e-business platforms, development tools, application server software, network security solutions, systems management software, consulting services, and more. Important product families covered include WebSphere, DB2, Lotus, Tivoli, and Rational Software to mention a few. The easy-to-read discussions will help you see what functions each contributes to an e-business infrastructure. Included with the book is a password necessary for accessing the companion Web site which provides up-to-the-minute e-business software news, expanded information through the Living Table of Contents, and other helpful resources. This book/Web site combination is unbeatable.
Requirements Validation of a Voice Communication System Used in Air Traffic Control
Authors: Johann Hörl, Bernhard K. Aichernig
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

During the last, few years' lightweight approaches to formal development methods have been proposed in order to facilitate the technological transfer of formal methods. ¿Lightweight¿ means that a precise and unambiguous formal specification language is used in order to raise the quality of a system's description, without focusing on proofs [1]. This article presents the results and experiences gained in an industrial project where VDM ++ , an object oriented extension of the Vienna Development Method, has been applied in such a lightweight manner. In the joint project of the Austrian company Frequent is and the Technical University Graz [2], a safety critical voice communication system (VCS) for air-traffic control has been specified and validated. It serves as the sole communication system between the pilots, the air-traffic control personnel at the tower, the ground personnel on the runways, other parties external to the airport and even other airports. During the formal specification of the VCS system a total number of 64 ambiguous, contradictory or incomplete issues have been detected in the various documents of the system. These issues have been summarized in a catalogue of questions. All of them have been resolved, supported by system experts.
Using the Representation in a Neural Network''s Hidden Layer for Task-Specific Focus of Attention
Authors: Shumeet Baluja, Dean Pomerleau
Venue:  (1995)

FTP: CMU-CS-95-143.ps In many real-world tasks, the ability to focus attention on the important features of the input is crucial for good performance. In this paper a mechanism for achieving task-specific focus of attention is presented. A saliency map, which is based upon a computed expectation of the contents of the inputs at the next time step, indicates which regions of the input retina are important for performing the task. The saliency map can be used to accentuate the features which are important, and de-emphasize those which are not. The performance of this method is demonstrated on a real-world robotics task: autonomous road following. The applicability of this method is also demonstrated in a non-visual domain. Architectural and algorithmic details are provided, as well as empirical results.
Working on Student Models (Really) Based on Mental States
Authors: Lucia M. M. Giraffa, Michael Da C. Móra, Alexandre Zamberlam
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper shows some aspects of our work using a Multi-agent System applied to build interactive Intelligent Tutoring Systems (ITS) with student model based on mental states (BDI agents).We present some aspects about BDI agents' implementation, and the tool (E-BDI editor) under construction.We do believe that building BDI agents is not simple.Understand this declarative paradigm and its implementation needs to be guided by a visual tool.This editor was designed to aid researches to organise the basic set of mental states needed to model the cognitive agents.
One Black-Box Iterative Solver
Authors: Marian Brezina, Petr Vanek
Venue:  (1997)

We propose a black-box parallel iterative method suitable for solving both elliptic and non-elliptic problems discretized on unstructured meshes. The method is analyzed in the case of second order elliptic problems discretized on quasiuniform P1 and Q1 finite element meshes. The quasiuniformity assumption is not, however, essential for the theory. The numerical experiments confirm validity of the proved convegence estimate and show that the mathod can be used for more difficult problems (e.g. plates, shells and Helmholtz equation in high-frequency domain.)
Adaptive crossover in genetic algorithms using statistics mechanism
Authors: Shengxiang Yang
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Genetic Algorithms (GAs) emulate the natural evolution process and maintain a population of potential solutions to a given problem. Through the population, GAs implicitly maintain the statistics about the search space. This implicit statistics can be used explicitly to enhance GA's performance. Inspired by this idea, a statistics-based adaptive non-uniform crossover (SANUX) has been proposed. SANUX uses the statistics information of the alleles in each locus to adaptively calculate the swapping probability of that locus for crossover operation. A simple triangular function has been used to calculate the swapping probability. In this paper two new functions, the trapezoid and exponential functions, are proposed for SANUX instead of the triangular function. Experiment results show that both functions further improve the performance of SANUX.
Creating Havoc: Havoc Development Program
Authors: David Cohn, Stephen Madancy
Venue:  (1986)

One area where use of the computer is essential is in the modern scientific laboratory. High speed computation, data storage and data analysis enable scientists to perform experiments that would otherwise be impractical. A problem inherent to the effective use of special purpose laboratory computers, however, is the fact that this equipment has generally been developed for highly specific uses, and has either tried to cope with existing high-level languages or has abandoned the attempt and required the user to program in a low-level assembly or machine language. Our idea was to design, develop and implement a programming language that is suited to the needs of a laboratory scientist. Our results have led us to believe that the best way to achieve our goals was using an interpretive/compiled programming environment (similar in spirit to FORTH) in which large programs could be built in small, coherent pieces, that could easily be tested on as high or low a level as the programmer desired. Our language, Havoc, adheres to these principles while providing many of the more widespread and useful language features not found in FORTH. Besides giving it motivation, this preliminary report describes the current design and implementation status of the HAVOC system. The current version of the HAVOC system is available for the Macintosh.
An Efficient Linear Scaling Algorithm for Tight Bonding Molecular Dynamics
Authors: S. Goedecker, L. Colombo
Venue:  (1994)

A novel formulation for tight binding total energy calculations and tight binding molecular dynamics, which scales linearily with the size of the system, is presented. The linear complexity allows us to treat systems of very large size and the algorithm is already faster than the best implementation of classical diagonalization for systems of 64 atoms. In addition, it is naturally parallelizable and it permits us therefore to perform molecular dynamics simulations of systems of unprecedented size. Finite electronic temperatures can also be taken into account. We illustrate this method by investigating structural and dynamical properties of solid and liquid carbon at different densities.
Issues in Designing and Implementing a Scalable Virtual Interface Architecture
Authors: Shailabh Nagar, Anand Sivasubramaniam, Jorge Rodriguez, Mazin Yousif
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

The Virtual Interface Architecture brings the benefits of low latency User-level Networking to a cluster environment. With an increasing number of communication channels created and used, the performance degradation of existing channels becomes an important consideration. This paper addresses the crucial issue of VIA scalability by examining the hardware and software options at the network interface and the host. Different design alternatives are investigated in depth using a detailed simulation model to get revealing insights from the scalability perspective.
Path Caching: A Technique for Optimal External Searching
Authors: Sridhar Ramaswamy, Sairam Subramanian
Venue:  (1994)

External 2-dimensional searching is a fundamental problem with many applications in relational, object-oriented, spatial, and temporal databases. For example, interval intersection can be reduced to 2-sided, 2-dimensional searching and indexing class hierarchies of objects to 3-sided, 2-dimensional searching. Path caching is a new technique that can be used to transform a number of time/space efficient data structures for internal 2-dimensional searching (such as segment trees, interval trees, and priority search trees) into I/O efficient external ones. Let n be the size of the database, B the page size, and t the output size of a query. Using path caching, we provide the first data structure with optimal I/O query time $O(\log_B n + t/B)$ for 2-sided, 2-dimensional searching. Furthermore, we show that path caching requires a small space overhead $O((n/B)\log_2\log_2 B)$ and is simple enough to admit dynamic updates in optimal $O(\log_B n)$ amortized time. We also extend this data structure to handle 3-sided, 2-dimensional searching with optimal I/O query-time, at the expense of slightly higher storage and update overheads.
Analysis of one-way reservation algorithms
Authors: I. Cidon, R. Rom, Y. Shavitt
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Modern high speed networks (and ATM networks in particular) use resource reservation as a basic means of establishing communications. One-way on-the-fly reservation is a method for allocating resources for short bursts of data when regular reservation is too costly. The first such algorithms were recently suggested by Turner. We investigate two examples that are characteristic to the way traffic streams interact in virtual circuit networks: a three node subnetwork that also acts as a 4/spl times/2 switch and a ring. For both systems we compute system throughput under homogeneous load, and compare it with the throughput when fast reservation protocols are used. For the three node subnetwork we also give an explicit expression for an upper bound.
Subdefinite Models as a Variety of Constraint Programming
Authors: V. Telerman, D. Ushakov
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper describes sub-definite models as a variety of constraint satisfaction problem. The use of the method of sub-definite calculations makes it possible to solve over determined and underdetermined problems, as well as problems with uncertain, imprecise and in-complete data. Constraint propagation in all these problems is supported by a single data-driven inference algorithm. Several examples are given to show the capabilities of this approach for solving a wide class of problems.
THE THEORETICAL ACCURACY OF RUNGE-KUTTA TIME DISCRETIZATIONS FOR THE INITIAL BOUNDARY VALUE PROBLEM: A CAREFUL STUDY OF THE BOUNDARY ERROR
Authors: Mark H. Carpenter, David Gottlieb, Saul Abarbanel, Author:
Venue:  (1993)

The conventional method of imposing time dependent boundary conditions for Runge-Kutta (RK) time advancement reduces the formal accuracy of the space-time method to first order locally, and second order globally, independently of the spatial operator. This counter intuitive result is analyzed in this paper. Two methods of eliminating this problem are proposed for the linear constant coefficient case: 1) impose the exact boundary condition only at the end of the complete RK cycle, 2) impose consistent intermediate boundary conditions derived from the physical boundary condition and its derivatives. The first method, while retaining the RK accuracy in all cases , results in a scheme with much reduced CFL condition, rendering the RK scheme less attractive. The second method retains the same allowable time step as the periodic problem. However it is a general remedy only for the linear case. For non-linear hyperbolic equations the second method is effective only for for RK schemes of third order accuracy or less. Numerical studies are presented to verify the efficacy of each approach.
Experience with Tools for Software Performance Engineering
Authors: U C Smith
Venue:  (1985)

Several research tools are presented that were developed specifically to explore the concepts and requirements for automated tools to support software performance engineering (SPE). Interesting features of the tools include the format for describing software models, and the user interface features that facilitate model development, evaluation, and viewing. Some general requirements for automated tools for SPE ascertained by using the tools for SPE studies, are also presented.
Streaming Media (Professional Developer's Guide Series): Building and Implementing a Complete Streaming System, 1 edition
Authors: Gregory C. Demetriades
Venue:  (2003)

:A complete toolkit to successfully develop and implement streaming media on the WebFrom hands-on training and distance learning to teleconferencing and product demonstrations, streaming media is providing businesses with a whole new world of opportunity. Written by one of the leading experts in the field, this book will provide you with all the information you'll need to begin streaming immediately. Demetriades offers an accessible presentation of this complex technology and all of its components, so you'll be able to address each segment of the streaming industry. As you progress through each chapter, you'll take another step toward the development of a streaming media enterprise.This informative book will direct you to the best resources to start streaming live or stored content over the Internet or Intranet. You'll also learn how to choose the right audio and video equipment, capture and edit, and set up a streaming site that meets your company's needs. Covering major platforms such as Microsoft, Real Networks, and Apple, it includes:Sixteen steps to building a successful streaming enterprise systemDetailed instructions on how to make movies with a digital cameraA guide to building your own encodersAn in-depth look at wireless streaming mediaA discussion on security and surveillance using streaming mediaThe CD-ROM contains:Adobe Premiere tryout versionPathfinder, Rapid Response, and Screen Magic by MaxVU, Inc.Discreet cleaner demo version 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
Near-Minimum Parallel Time Reduction on Processor Arrays
Authors: A R Wagner, D M Landis
Venue:  (1993)

Consider a network of processor elements arranged in a $d$-dimensional grid, where each processor can accept an operand from any one of its neighbors in one time step. If each processor has a separate element of some set $\boldmath R$, how do we compute an associative operation + on all of the elements in $\boldmath R$? This operation is called a reduction over + on $\boldmath R$. In this paper we present a method for evaluating such a reduction operation. Our method takes time which is a small additive constant above a proven lower bound required to evaluate the expression. Our new method for performing this reduction can be up to $d$ times faster than the method which reduces along each dimension in sequence.
Material Classification of Magnetic Resonance Volume Data
Authors: David H. Laidlaw
Venue:  (1992)

A major unsolved problem in computer graphics is that of making high-quality models. Traditionally, models have consisted of interactively or algorithmically described collections of graphics primitives such as polygons. The process of constructing these models is painstaking and often misses features and behavior that we wish to model. Models extracted from volume data collected from real, physical objects have the potential to show features and behavior that are difficult to capture using these traditional modeling methods. We use vector-valued magnetic resonance volume data in this thesis. The process of extracting models from such data involves four main steps: collecting the sampled volume data; preprocessing it to reduce artifacts from the collection process; classifying materials within the data; and creating either a rigid geometric model that is static, or a flexible, dynamic model that can be simulated. In this thesis we focus on the the first three steps. We present guidelines and techniques for collecting and processing magnetic resonance data to meet the needs of the later steps. Our material classification and model extraction techniques work better when the data values for a given material are constant throughout the dataset, when data values for different materials are different, and when the dataset is free of aliasing artifacts and noise. We present a new material-classification method that operates on vector-valued volume data. The method produces a continuous probability function for each material over the volume of the dataset, and requires no expert interaction to teach it different material classes. It operates by fitting peaks in the histogram of a collected dataset using parameterized gaussian bumps, and by using Bayes'' law to calculate material probabilities, with each gaussian bump representing one material. To illustrate the classification method, we apply it to real magnetic resonance data of a human head, a human hand, a banana, and a jade plant. From the classified data, we produce "computationally stained" slices that discriminate among materials better than do the original grey-scale versions. We also generate volume-rendered images of classified datasets clearly showing different anatomical features of various materials. Finally, we extract preliminary static and dynamic geometric models of different tissues.
An Empirical Evaluation of Statistical Testing Designed from UML State Diagrams: The Flight Guidance System Case Study
Authors: Philippe Chevalley, Pascale Thévenod-Fosse
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

This paper presents an empirical study of the effectiveness of test cases generated from UML state diagrams using transition coverage as the testing criterion.The test cases production is mainly based on an adaptation of a probabilistic method, called statistical testing based on testing criteria.This technique was automated with the aid of the Rational Software Corporation's Rose Rea Time tool.The test strategy investigated combines statistical test cases with (few) deterministic test cases focused on domain boundary values.Its feasibility is exemplified on a research version of an avionics system implemented in Java: the Flight Guidance System case study (14 concurrent state diagrams).Then, the results of an empirical evaluation of the effectiveness of the created test cases are presented.The evaluation was performed using mutation analysis to assess the error detection power of the test cases on more than 1500 faults seeded one by one in the Java source code (115 c asses, 6500 LOC).A detailed analysis of the test results allows us to draw first conclusions on the expected strengths and weaknesses of the proposed test strategy.
Partial Objects in Type Theory
Authors: Scott F Smith
Venue:  (1988)

Intuitionistic type theories, originally developed by Martin-Lof, provide a foundation for intuitionistic mathematics, much as set theory provides a foundation for mathematics. They are of interest to computer scientists because the objects typed are computations, making type theory an appropriate setting for reasoning about computation. Type theories such as Nuprl or the theories of Martin-Lof have types for objects that always terminate, but objects which may diverge are not directly typable. If type theory is to be a full-fledged theory for reasoning about computations, we need to be able to reason about potentially diverging objects. In this thesis we show how potentially diverging computations, which we call partial objects, may be typed by extending type theory to partial object type theory. New partial types are added to type partial objects. These types are usable: partial objects written in natural program notation can easily be shown to lie in the types. In addition to being able to express partial objects, it is also important to be able to reason about them; for this purpose general principles are given for proving facts about partial objects via induction. The resulting theory serves as a foundation for computational as well as mathematical reasoning. It also gives insights into abstract recursion theory, leads to a new method for constructive reasoning, and sheds light on inductive methods for reasoning about recursive computation.