ppxscal/embedding_network huggingface dataset:
Numerical simulation of interfacial flows by smoothed particle hydrodynamics
Authors: Andrea Colagrossi, Maurizio Landrini
Venue: Journal of Computational Physics (2003)

An implementation of the smoothed particle hydrodynamics (SPH) method is presented to treat two-dimensional interfacial flows, that is, flow fields with different fluids separated by sharp interfaces. Test cases are presented to show that the present formulation remains stable for low density ratios. In particular, results are compared with those obtained by other solution techniques, showing a good agreement. The classical dam-break problem is studied by the present two-phase approach and the effects of density-ratio variations are discussed. The role of air entrapment on loads is discussed.
An object-oriented persistent database interface for CAD
Authors: M. N. Sim, P. M. Dewilde
Venue: Proceedings of the conference on European design automation (1990)

Much activity in the database community is focused on providing database support to the application programmer in a user-friendly environment that improves productivity and encourages software re-use. Object-oriented and Persistent programming are two emerging paradigms that are considered essential to create such an environment. One approach is to converge programming languages and databases to a coherent and consistent whole. Such systems are not yet ready to replace database systems with procedural interfaces, due to lack of standard or degraded speed. We consider a front end based on the two paradigms for the Nelsis CAD system. We discuss what kind of persistent environment is required and how to create it, with emphasis on the stringent time efficiency requirements of CAD database systems.
An algorithm for anaphora resolution in Spanish texts
Authors: Manuel Palomar, Lidia Moreno, Jesús Peral, Rafael Muñoz, Antonio Ferrández, Patricio Martínez-Barco, Maximiliano Saiz-Noeda
Venue: Computational Linguistics (2001)

This paper presents an algorithm for identifying noun phrase antecedents of third person personal pronouns, demonstrative pronouns, reflexive pronouns, and omitted pronouns (zero pronouns) in unrestricted Spanish texts. We define a list of constraints and preferences for different types of pronominal expressions, and we document in detail the importance of each kind of knowledge (lexical, morphological, syntactic, and statistical) in anaphora resolution for Spanish. The paper also provides a definition for syntactic conditions on Spanish NP-pronoun noncoreference using partial parsing. The algorithm has been evaluated on a corpus of 1,677 pronouns and achieved a success rate of 76.8%. We have also implemented four competitive algorithms and tested their performance in a blind evaluation on the same test corpus. This new approach could easily be extended to other languages such as English, Portuguese, Italian, or Japanese.
Stationary solutions for two nonlinear Black-Scholes type equations
Authors: P. Amster, C. G. Averbuj, M. C. Mariani
Venue: Applied Numerical Mathematics (2003)

We study by topological methods two different problems arising in the Black-Scholes model for option pricing. More specifically, we consider a nonlinear differential equation which generalizes the Black-Scholes formula when the volatility is assumed to be stochastic. On the other hand, we study a model with transaction costs.
The ALIVE system: wireless, full-body interaction with autonomous agents
Authors: Pattie Maes, Trevor Darrell, Bruce Blumberg, Alex Pentland
Venue: Multimedia Systems (1997)

The cumbersome nature of wired interfaces often limits the range of application of virtual environments. In this paper, we discuss the design and implementation of a novel system, called ALIVE, which allows unencumbered full-body interaction between a human participant and a rich graphical world inhabited by autonomous agents. Based on results obtained with thousands of users, the paper argues that this kind of system can provide more complex and very different experiences than traditional virtual reality systems. The ALIVE system significantly broadens the range of potential applications of virtual reality systems: in particular, the paper discusses novel applications in the area of training and teaching, entertainment, and digital assistants or interface agents. We give an overview of the methods used in the implementation of the existing ALIVE systems.
The Impact of Negative Acknowledgments in Shared Memory Scientific Applications
Authors: Mainak Chaudhuri, Mark Heinrich
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Abstract--Negative ACKnowledgments (NACKs) and subsequent retries, used to resolve races and to enforce a total order among shared memory accesses in distributed shared memory (DSM) multiprocessors, not only introduce extra network traffic and contention, but also increase node controller occupancy, especially at the home. In this paper, we present possible protocol optimizations to minimize these retries and offer a thorough study of the performance effects of these messages on six scalable scientific applications running on 64-node systems and larger. To eliminate NACKs, we present a mechanism to queue pending requests at the main memory of the home node and augment it with a novel technique of combining pending read requests, thereby accelerating the parallel execution for 64 nodes by as much as 41 percent (a speedup of 1.41) compared to a modified version of the SGI Origin 2000 protocol. We further design and evaluate a protocol by combining this mechanism with a technique that we call write string forwarding, used in the AlphaServer GS320 and Piranha systems. We find that without careful design considerations, especially regarding atomic read-modify-write operations, this aggressive write forwarding can hurt performance. We identify and evaluate the necessary micro-architectural support to solve this problem. We compare the performance of these novel NACK-free protocols with a base bitvector protocol, a modified version of the SGI Origin 2000 protocol, and a NACK-free protocol that uses dirty sharing and write string forwarding as in the Piranha system. To understand the effects of network speed and topology the evaluation is carried out on three network configurations.
Supporting Quick and Dirty CORBA Introspection and Manipulation
Authors: Abdulmalik Al-Gahmi, Ciju John, Jonathan E. Cook, Bo Du
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Run-time monitoring (and perhaps manipulation)tools, essential for reverse engineering of dynamic behavior, are often difficult to build fromscratch. This presentsa barrier for prototyping new analyses, and for building customized tools specific for single projects. Toalleviate this problem, we present an architecture for easing the effort needed to build new monitoring tools thatis based on the use of scripting languages for prototype monitors.This architecture is presented in a prototype designand implementation of introspection and manipulationof CORBA-based applications. Our framework implementation is being accomplished by tying a new CORBAdynamic access feature known as Portable Interceptorswith an existing very high level programming language,Tcl/Tk.
A posteriori error estimates for control problems governed by nonlinear elliptic equations
Authors: Wenbin Liu, Ningning Yan
Venue: Applied Numerical Mathematics (2003)

In this paper, we derive a posteriori error estimates for the finite element approximation of a class of nonlinear optimal control problems. We derive a posteriori error estimates for both the state and the control approximation. Such estimates, which are apparently not available in the literature, can be used to construct reliable adaptive finite element approximation schemes for the control problems.
Alternatives to the Rayleigh Quotient for the Quadratic Eigenvalue Problem
Authors: Michiel E. Hochstenbach, Henk A. van der
Venue: SIAM Journal on Scientific Computing (2003)

We consider the quadratic eigenvalue problem $\lambda^2 Ax + \lambda Bx + Cx = 0.$ Suppose that $u$ is an approximation to an eigenvector $x$ (for instance, obtained by a subspace method) and that we want to determine an approximation to the corresponding eigenvalue $\lambda$. The usual approach is to impose the Galerkin condition $r(\theta, u) = (\theta^2 A + \theta B + C)u \perp u$, from which it follows that $\theta$ must be one of the two solutions to the quadratic equation $(u^*Au) \theta^2 + (u^*Bu) \theta + (u^*Cu) = 0$. An unnatural aspect is that if $u=x$, the second solution has in general no meaning. When $u$ is not very accurate, it may not be clear which solution is the best. Moreover, when the discriminant of the equation is small, the solutions may be very sensitive to perturbations in $u$.In this paper we therefore examine alternative approximations to $\lambda$. We compare the approaches theoretically and by numerical experiments. The methods are extended to approximations from subspaces and to the polynomial eigenvalue problem.
Reliability Analysis of Systems Described by Fault Trees with Efficiency
Authors: N. Yu. Kuznetsov, K. V. Mikhalevich
Venue: Cybernetics and Systems Analysis (2003)

A fault tree model is proposed that describes a structure and functioning of systems with different levels of operation quality. Approximate analytical and statistical methods for evaluation of reliability characteristics of such system are developed. An appropriate software is worked out.
On Faster IDDQ Measurements
Authors: C. Thibeault
Venue: Journal of Electronic Testing: Theory and Applications (2003)

The purpose of this paper is to introduce a new IDDQ measurement technique based on active successive approximations, called ASA-IDDQ. This technique has unique features facilitating a speed-up in IDDQ measurement. Experimental results suggest that a significant speed-up factor (up to 4) can be obtained over the QuiC-Mon technique. Such a speed-up is a key element in the replacement of single-threshold IDDQ testing since it amplifies the effectiveness of post-processing techniques.
Multimedia retrieval by regions, concepts, and constraints
Authors: Apostol Ivanov Natsev
Venue:  (2001)

This thesis investigates the problem of searching multimedia data. In particular, we identify poor retrieval quality and usability as two of the main hurdles for adoption of multimedia search technology. We therefore try to address the above issues by introducing three different multimedia query models and proposing the necessary infrastructure for supporting them. Specifically, we propose methods for region-based, concept-based, and constraint-based retrieval of images. In order to improve retrieval effectiveness, we first propose a similarity model that compares images at the granularity of image objects rather than entire images. We design an efficient algorithm to support the above similarity model and to be robust with respect to scaling and translation of image objects. We also introduce an intermediate layer on top of the query engine that automatically translates simple text queries into complex content-based queries. This concept-based query interface makes the content-based query transparent to the user and improves the system's ease of use. Finally, we consider the problem of matching arbitrary relationships among multimedia objects (e.g., spatial, temporal, and scale constraints). In the second part of the thesis, we study the infrastructure needed for supporting the above query models. More precisely, we consider the problem of efficiently answering top-k nearest neighbor queries. We propose SQL query language extensions and query optimization strategies for search based upon aggregate predicates, which is a generalization of top- k queries. We also investigate top-k queries over joins of ranked inputs. This ordered join problem is fundamental to multimedia query systems but also appears in many traditional database applications. In particular, we propose several algorithms, both exact and approximate, for the ordered join problem, we prove optimality results for them, and we study their behavior empirically.
Placement Using a Localization Probability Model (LPM)
Authors: Markus Olbrich, Erich Barke
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

We propose a new placement model for global placement. This model uses probabilities to localize the cells. It enables arbitrary levels of placement abstraction. Wire-length estimations at any level can be derived from the model. We present a new placer, that uses a special variant of the proposed model. Examples show that the model properties improve placement quality.
Direct interaction based on a two-point laser pointer technique
Authors: Sergey V. Matveyev, Martin Göbel
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

The proposed laser pointer technique uses two spots on a screen for interaction with virtual environments and presentations. The spots are produced by splitting an infrared laser beam.
Search Types and Context of Use in the Semantic Web
Authors: Michele A. Visciola
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Current search engines do not process queries semantics. However, most of the times contexts of use embed ontologies that do provide meanings. The paper suggests that the capability to satisfy users' queries is at variance with the level of ontology complexity. Whenextracting information from simple ontologies, the search engines are able to satisfy easily queries because the ambiguity of interpretation of terms and relations is very little or non-existent. The paper identifies and describes four different categories of information search (so-called "ideal types of information search"), that show a growing level of complexity. At the highest level of complexity they present an higher level of ambiguity. This means that meanings might be embedded in more ontologies and/or use contexts. Finally, the paper suggests that scenario analysis can enable to characterize the ontologies of use contexts by means of Web services and Personalization tools.
Process inheritance and instance modification
Authors: Guangxin Yang
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Process technologies play an increasingly important role as the world is being digitalized in nearly every corner. The major obstacles to their massive deployment include reusability and adaptivity. This paper addresses the two crucial problems with one single solution: process inheritance. We discuss what process inheritance is, what mechanisms are needed to support it, and how it can be used to handle exceptions effectively. The ideas and mechanisms are implemented in the runtime system of a process language named P.
Targeted advertising on the Web with inventory management
Authors: David Maxwell Chickering, David Heckerman
Venue: Interfaces (2003)

Companies that maintain Web sites can make considerable revenue by running advertisements, and they therefore compete to attract advertisers. The ability to deliver high click-through rates on a site can attract advertisers and, under an appropriate pricing model, can also increase revenue directly. Consequently, companies can benefit from delivery systems that display advertisements selectively to those visitors most likely to click though. To satisfy contractual obligations, however, these systems must simultaneously manage inventory. We developed a delivery system that maximizes click-through rate given inventory-management constraints in the form of advertisement quotas. The system uses predictive segments in conjunction with a linear program to perform the constrained optimization. Using a real Web site (msn.com), we demonstrated the efficacy of the system. We can generalize our system to find revenue-optimal advertisement schedules under a wide variety of pricing models.
Text Mining for a Clear Picture of Defect Reports: A Praxis Report
Authors: Jutta Kreyss, Steve Selvaggio, Michael White, Zach Zakharian
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We applied the text mining categorization technology,in the publicly available, IBM Enterprise InformationPortal V8.1 to more than 15,000 customer reported,product problem records. We used a proven softwarequality category set to categorize these problem recordsinto different areas of interest. Our intent was to developa clear picture of potential areas for quality improvementin each of the software products reviewed, and to providethis information to development's management.The paper presents the benefits that can be gained fromcategorizing problem records, as well as the limitations.
Factors affecting the adoption of e-business in the aerospace industry
Authors: Jay Aronson
Venue:  (2003)

The aerospace industry is on the verge of a major transition to a new way of doing business with the Internet providing a channel for the distribution of information to the customer. These innovative concepts are being applied from the supply network to the training of operators in the field. The Theory of the Diffusion of Innovation of Everett Rogers applies to the adoption of e-business as a new business model within an organization in the aerospace industry. The Technology Acceptance Model (TAM) of F. D. Davis links the adoption of technology to two primary variables, perceived ease of use (PEOU) and perceived usefulness (PU). These two factors are prominent in the literature in the acceptance of the Internet as a business channel. The Theory of Reasoned Action (TRA) of I. Ajzen and M. Fishbein is an attitudinal theory used to predict behavior in general and specifically the behavior or intent regarding adoption or non-adoption of innovations based on the factors of attitudinal behavior and subjective norm. These three theories all are expected to play major roles in the overall adoption equation of e-business in this vital industry. This research may indicate a correlation between the independent variables of attitude, perceived voluntariness and subjective norm and the dependent variable of behavioral intent to adopt e-business in the aerospace industry.
Red-black trees with types
Authors: Stefan Kahrs
Venue: Journal of Functional Programming (2001)

Chris Okasaki showed how to implement red-black trees in a functional programming language. Ralf Hinze incorporated even the invariants of such data structures into their types, using higher-order nested datatypes. We show how one can achieve something very similar without the usual performance penalty of such types, by combining the features of nested datatypes, phantom types and existential type variables.
A new look at exploiting data parallelism in embedded systems
Authors: Hillery C. Hunter, Jaime H. Moreno
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

This paper describes and evaluates three architectural methods for accomplishing data parallel computation in a programmable embedded system. Comparisons are made between the well-studied Very Long Instruction Word (VLIW) and Single Instruction Multiple Packed Data (SIMpD) paradigms; the less-common Single Instruction Multiple Disjoint Data (SIMdD) architecture is described and evaluated. A taxonomy is defined for data-level parallel architectures, and patterns of data access for parallel computation are studied, with measurements presented for over 40 essential telecommunication and media kernels. While some algorithms exhibit data-level parallelism suited to packed vector computation, it is shown that other kernels are most efficiently scheduled with more flexible vector models. This motivates exploration of non-traditional processor architectures for the embedded domain.
Database technologies for L-system simulations in virtual plant applications on bioinformatics
Authors: Yi-Ping Phoebe Chen, Robert M. Colomb
Venue: Knowledge and Information Systems (2003)

One of the most important advantages of database systems is that the underlying mathematics is rich enough to specify very complex operations with a small number of statements in the database language. This research covers an aspect of biological informatics that is the marriage of information technology and biology, involving the study of real-world phenomena using virtual plants derived from L-systems simulation. L-systems were introduced by Aristid Lindenmayer as a mathematical model of multicellular organisms. Not much consideration has been given to the problem of persistent storage for these simulations. Current procedures for querying data generated by L-systems for scientific experiments, simulations and measurements are also inadequate. To address these problems the research in this paper presents a generic process for data-modeling tools (L-DBM) between L-systems and database systems. This paper shows how L-system productions can be generically and automatically represented in database schemas and how a database can be populated from the L-system strings. This paper further describes the idea of pre-computing recursive structures in the data into derived attributes using compiler generation. A method to allow a correspondence between biologists' terms and compiler-generated terms in a biologist computing environment is supplied. Once the L-DBM gets any specific L-systems productions and its declarations, it can generate the specific schema for both simple correspondence terminology and also complex recursive structure data attributes and relationships.
Information and communication technology in Singapore: lessons for developing nations on the role of government
Authors: Leo Tan Wee Hin, R. Subramaniam
Venue: Advanced topics in global information management (2003)

Information and Communication Technologies (ICT) hold great potential for promoting socioeconomic development in many developing countries. ICT has not significantly percolated down the economic value chain in these countries for various reasons. The example of Singapore is used to show how governments can make a difference in entrenching a vibrant ICT sector through appropriate policies, programs, and other intervention instruments. It is suggested that aspects of the Singapore experience would be useful for other developing countries.
A cost-benefit evaluation server for decision support in e-business
Authors: Youzhong Liu, Fahong Yu, Stanley Y. W. Su, Herman Lam
Venue: Decision Support Systems (2003)

Business organizations are often faced with decision situations in which the costs and benefits of some competing business specifications such as business offers, product specifications, or negotiation proposals need to be evaluated in order to select the best or desirable ones. In e-business, there is a need to automate the cost-benefit evaluation process to support decision making. This paper presents a general-purpose Cost-Benefit Evaluation Server (CBES) and its underlying Cost-Benefit Decision Model (CBDM), which models benefits in terms of costs and logical scoring and aggregation of preferences associated with products and services. The Server provides build-time tools for users to specify preference and cost information and a run-time engine to perform cost-benefit evaluations. A business scenario involving supplier selection and automated negotiation is given to illustrate the application of the Server and its four evaluation modes.