ppxscal/embedding_network huggingface dataset:
Book review: Abduetive Inference Models for Diagnostic Problem Solving by Y. Peng and J. Reggia (Springer Verlag New York 1990)
Venue: ACM SIGART Bulletin (1990)

In the spring of 1990, the American Association for Artificial Intelligence sponsored a symposium on abductive inference, bringing together several dozen researchers (O'Rorke 1990). The term "abduction" as a form of inference originated with C.S. Peirce in the 1890s, and was introduced in artificial intelligence by Pople (1973). In recent years, it has found increasing use by researchers working on a diverse set of topics, particularly medical diagnosis, scientific discovery, and natural language understanding. But what is abductive inference?
Aspect-oriented programming
Authors: Gregor Kiczales
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
Design and prototype of parallel, wire-actuated robots with a constraining linkage
Authors: Geoff Mroz, Leila Notash
Venue: Journal of Robotic Systems (2004)

Currently, wire-actuated robots are not used extensively in industry, but they are gaining more attention due to advantages they possess. Low weight, cost, and power consumption are features that make wire-controlled robots worth researching. This article investigates the designs of two different, 4 degrees of freedom parallel, wire-actuated robots so that a prototype of one of these can be built. A design methodology is developed and presented. The process will be beneficial to those working on designing and prototyping a new robot or modifying an existing robot. Stability of both designs is considered first to ensure that the robots are able to exert and withstand end effector forces in different positions throughout their respective workspaces. The stiffness and strength of the materials used in the designs is also investigated using finite element analysis. &copy; 2004 Wiley Periodicals, Inc.
On parallel computation of blood flow in human arterial network based on 1-D modelling
Authors: B. V. Rathish Kumar, Alfio Quateroni, Luca Formaggia, Daniele Lamponi
Venue: Computing (2003)

In this study, parallel computation of blood flow in a 1-D model of human arterial network has been carried out employing a Taylor Galerkin Finite Element Method. Message passing interface libraries have been used on Origin 2000 SGI machine. A Greedy strategy for load-distribution has been devised and data-flow graphs necessary for parallelization have been generated. The performance of parallel implementation measured in terms of speedup and efficiency factors is found to be good. Further, the parallel code is used in simulating the propagation of pressure and velocity waveforms in our 1-D arterial model for two different inflow pressure pulses. Also, the influence of consideration of terminal resistance on pressure and velocity waveforms have been analyzed.
Grid -Based Parallel Data Streaming implemented for the Gyrokinetic Toroidal Code
Authors: S. Klasky, S. Ethier, Z. Lin, K. Martins, D. McCune, R. Samtaney
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

We have developed a threaded parallel data streaming approach using Globus to transfer multi-terabyte simulation data from a remote supercomputer to the scientistýs home analysis/visualization cluster, as the simulation executes, with negligible overhead. Data transfer experiments show that this concurrent data transfer approach is more favorable compared with writing to local disk and then transferring this data to be post-processed. The present approach is conducive to using the grid to pipeline the simulation with post-processing and visualization. We have applied this method to the Gyrokinetic Toroidal Code (GTC), a 3-dimensional particle-in-cell code used to study micro-turbulence in magnetic confinement fusion from first principles plasma theory.
Patch-Duplets for Object Recognition and Pose Estimation
Authors: Bjorn Johansson, Anders Moe
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

This paper describes a view-based method for object recognition and estimation of object pose from a single image. The method is based on feature vector matching and clustering. A set of interest points is detected and combined into pairs. A pair of patches, centered around each point in the pair, is extracted from a local orientation image. The patch orientation and size depends on the relative positions of the points, whichmake them invariant to translation, rotation, and locally invariant to scale. Each pair of patches constitutes a feature vector. The method is demonstrated on a number of real images and the patch-duplet feature is compared to the SIFT feature.
Path selection algorithm: the strategy for designing deterministic routing from alternative paths
Authors: Michihiro Koibuchi, Akiya Jouraku, Hideharu Amano
Venue: Parallel Computing (2005)

System Area Networks (SANs), which usually accept irregular topologies, have been used to connect nodes in PC/WS clusters or high-performance storage systems. Although routing algorithms for SANs usually find out alternative paths, SANs usually accept only deterministic routings. Thus, path selection algorithm, which chooses a single path from alternative paths, becomes essential for advanced routings in SANs. However, a few studies of it have been done only for SANs without virtual channels, and its impact is not well analyzed. In this paper, (1) we propose four path selection algorithms which have different concepts to distribute paths in SANs with virtual channels, and (2) we investigate the performance influences of various path selection algorithms through a flit-level simulation. Simulation results show that one of the four algorithms improves up to 92% of throughput against simple path selection algorithms, and policies to remove paths crossing the bottleneck channels are more efficient than ones to keep paths crossing channels that are not crowded.
Task Reweighting on Multiprocessors: Efficiency versus Accuracy
Authors: Aaron Block, James H. Anderson
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

We consider the problem of task reweighting in fair-scheduled multiprocessor systems wherein each task's processor share is specified using a weight. The responsiveness of a reweighting scheme can be assessed by comparing its allocations to those of an ideal scheduler that instantly reweights tasks. A reweighting scheme is fine-grained if the per-task "error" (in comparison to an ideal allocation) caused by a reweighting event is constant, and coarsegrained, otherwise. When the number of tasks N is larger than the number of processorsM, the worst-case time complexity for fine-grained reweighting, ¿(NlogN), is larger than that of coarse-grained reweighting, ¿(MlogN). In this paper, we construct two new reweighting algorithms that are hybrids of fine- and coarse-grained reweighting that have time complexity less than ¿(NlogN), and produce less error than current coarse-grained techniques. We also present experiments to compare relative advantages of all schemes.
Analysis of co-articulation regions for performance-driven facial animation: Research Articles
Authors: Douglas Fidaleo, Ulrich Neumann
Venue: Computer Animation and Virtual Worlds (2004)

A facial gesture analysis procedure is presented for the control of animated faces. Facial images are partitioned into a set of local, independently actuated regions of appearance change termed co-articulation regions (CRs). Each CR is parameterized by the activation level of a set of face gestures that affect the region. The activation of a CR is analyzed using independent component analysis (ICA) on a set of training images acquired from an actor. Gesture intensity classification is performed in ICA space by correlation to training samples. Correlation in ICA space proves to be an efficient and stable method for gesture intensity classification with limited training data. A discrete sample-based synthesis method is also presented. An artist creates an actor-independent reconstruction sample database that is indexed with CR state information analyzed in real time from video. Copyright &copy; 2004 John Wiley & Sons, Ltd.
The role of performance engineering techniques in the context of the Grid: Research Articles
Authors: A. J. G. Hey, J. Papay, M. Surridge
Venue: Concurrency and Computation: Practice Experience (2005)

Performance engineering can be described as a collection of techniques and methodologies whose aim is to provide reliable prediction, measurement and validation of the performance of applications on a variety of computing platforms. This paper reviews techniques for performance estimation and performance engineering developed at the University of Southampton and presents application case studies in task scheduling for engineering meta-applications, and capacity engineering for a financial transaction processing system. These show that it is important to describe performance in terms of a resource model, and that the choice of models may have to trade accuracy for utility in addressing the operational issues. We then present work from the on-going EU funded Grid project GRIA, and show how lessons learned from the earlier work have been applied to support a viable business model for Grid service delivery to a specified quality of service level. The key in this case is to accept the limitations of performance estimation methods, and design business models that take these limitations into account rather than attempting to provide hard guarantees over performance. We conclude by identifying some of the key lessons learned in the course of our work over many years and suggest possible directions for future investigations. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Improved Performance of Maximum Likelihood Decoding Algorithm with Efficient Use of Algebraic Decoder
Authors: P. G. Babalis, P. T. Trakadas, T. B. Zahariadis, C. N. Capsalis
Venue: Wireless Personal Communications: An International Journal (2005)

A new soft decision maximum-likelihood decoding algorithm, which generates the minimum set of candidate codewords by efficiently applying the algebraic decoder is proposed. As a result, the decoding complexity is reduced without degradation of performance. The new algorithm is tested and verified by simulation results.
Zeros of polynomials orthogonal on two arcs of the unit circle
Authors: A. L. Lukashov, F. Peherstorfer
Venue: Journal of Approximation Theory (2005)

In this paper we study polynomials (Pn) which are hermitian orthogonal on two arcs of the unit circle with respect to weight functions which have square root singularities at the end points of the arcs, an arbitrary nonvanishing trigonometric polynomial A in the denominator and possible point measures at the zeros of A. First we give an explicit representation of the orthogonal polynomials Pn in terms of elliptic functions. With the help of this representation for sufficiently large n the number of zeros of Pn, which are in an ε-neighbourhood of each of the arcs are determined. Finally, it is shown that the accumulation points of the zeros of (Pn) which are not attracted to the support lie on a Jordan arc running within the unit disk from one of the arcs to the other one. The accumulation points lie dense on the Jordan arc if the harmonic measures of the arcs are irrational. If the harmonic measures are rational then there is only a finite set of accumulation points on the Jordan arc.
A QoS-enabled packet scheduling algorithm for IPSec multi-accelerator based systems
Authors: Alberto Ferrante, Vincenzo Piuri, Fabien Castanier
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

IPSec is a suite of protocols that adds security to communications at the IP level. Protocols within the IPSec suite make extensive use of cryptographic algorithms. Since these algorithms are computationally very intensive, some hardware acceleration is needed to support high throughput. In this paper we discuss a scheduling algorithm for distributing IPSec packet processing over the CPU with a software implementation of the cryptographic algorithms considered and multiple cryptographic accelerators. This algorithm also provides support for quality of service. High-level simulations and the related results are provided to show the properties of the algorithm. Some architectural improvements suitable to better exploit this scheduling algorithm are also presented
Level Set Based Shape Prior Segmentation
Authors: Tony Chan, Wei Zhu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We propose a level set based variational approach that incorporates shape priors into Chan-Veseýs model [3] for the shape prior segmentation problem. In our model, besides the level set function for segmentation, as in Cremersý work [5], we introduce another labelling level set function to indicate the regions on which the prior shape should be compared. Our model can segment an object, whose shape is similar to the given prior shape, from a background where there are several objects. Moreover, we provide a proof for a fast solution principle, which was mentioned [7] and similar to the one proposed in [19], for minimizingChan-Veseýs segmentation model without length term. We extend the principle to the minimization of our prescribed functionals.
Governance enterprise architecture (GEA): domain models for e-governance
Authors: Vassilios Peristeras, Konstantinos Tarabanis
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Public administrations all over the world promote ambitious and costly e-government programmes. The required domain analysis is usually conducted on a local and ad hoc basis, due to a lack of commonly accepted domain models - in literature and practice - for the overall governance system. This paper summarizes a broad research modelling effort, which aims at developing a domain description for the overall governance system. We propose the Governance Enterprise Architecture (GEA) as a set of domain models that serve as a top-level enterprise architecture. To this point, the development includes five high-level generic process and objects models. Namely, we present the GEA mega-process model, the GEA interaction model, the GEA public policy formulation object model, the GEA service provision object model and the latest development of the GEA object model for the overall governance system.
Research in natural language processing: Hewlett-Packard Laboratories
Authors: Egon Loebner
Venue: Issue 79 (January 1982) (1982)

We are carrying out a preliminary investigation of the use of a generalized phrase structre grammar (the formulation of context-free grammars developed in [1] and related works) as the basis for a modular and linguistically robust natural language processor. The grammar is generated from a kernel set of rules, plus a set of metarules that expand the kernel into the full rule set used for processing English. This greatly simplifies the task of testing and modifying the grammar.
EXPERIPLAN an expert system that selects statistical analyses for research studies
Authors: Joseph Schreiner
Venue: Issue 89 (July 1984) (1984)

EXPERIPLAN is a LISP program that selects and applies statistical analyses to experimental or observational research studies in medicine biology, education, and psychology. A research study is a proposed hypothesis describing the relationship between observed variables. It is based on observed characteristics (variables) of individual subjects. EXPERIPLAN selects an appropriate statistical analysis from the hypothesis and the variables' properties. It contains tutorial components that explain the analysis using the original hypothesis variables, and describe empirical relationships between variables. EXPERIPLAN contains information on 8 pre-defined variables (IO, Sex, Age, Education.,) and their empirical relationships. This knowledge base can be expanded and modified within the memory limits of the operating system. EXPERIPLAN uses this knowledge to advise researchers on the study's possible results. It also searches for controlling or matching variables to include in the study.
Complex products and systems: Potential from using layout platforms
Authors: Adrian P. Hofer, Johannes I. M. Halman
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2004)

In their quest to manage the complexity of offering greater product variety, firms in many industries are considering platform-based development of product families. Key in this approach is the sharing of components, modules, and other assets across a family of products. Current research indicates that companies are often choosing physical elements of the product architecture (i.e., components, modules, building blocks) for building platform-based product families. Other sources for platform potential are widely neglected. We argue that for complex products and systems with hierarchic product architectures and considerable freedom in design, a new platform type, the system layout, offers important commonality potential. This layout platform standardizes the arrangement of subsystems within the product family. This paper is based on three industry case studies, where a product family based on a common layout could be defined. In combination with segment-specific variety restrictions, this results in an effective, efficient, and flexible positioning of a company's products. The employment of layout platforms leads to substantial complexity reduction, and is the basis for competitive advantage, as it imposes a dominant design on a product family, improves its configurability, and supports effective market segmentation.
Interactive sonification of geo-referenced data
Authors: Haixia Zhao
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper describes an investigation of using interactive sonification (non-speech sound) to present geo-referenced statistical data to vision-impaired users for problem solving and decision making. By working with vision-impaired users, the work will identify effective interaction and sound designs for geo-referenced data, and derive principles that can guide general interactive data sonification designs for auditory information seeking.
DA standards activities
Authors: Patrick M. Hefferan
Venue: ACM SIGDA Newsletter (1990)

For many contributors to the CFI, last year represented a significant turning point. Continued high levels of participation and a focus on solving practical tool integration problems have given members confidence in developing a workable set of guidelines. As a result, our mission was refined as follows. "To create a free market model for EDA tools and their supporting framework environments, via development of effective industry guidelines that remove barriers to integration." In keeping with this mission, key highlights of the past year are summarized below.
Eventually consistent failure detectors
Authors: Mikel Larrea, Antonio Fernández, Sergio Arévalo
Venue: Journal of Parallel and Distributed Computing (2005)

The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to solve different problems in asynchronous systems, in particular the Consensus problem. In this paper, we present a new class of unreliable failure detectors, which we call Eventually Consistent and denote by @?C. This class combines the failure detection capabilities of class @?S with the eventual leader election capability of class @W. This capability allows all correct processes to eventually choose the same correct process as leader. We study the relationship between @?C and other classes of failure detectors. We also propose an efficient algorithm to transform @?C into @?P in models of partial synchrony. Finally, to show the power of this new class of failure detectors, we present a Consensus algorithm based on @?C. This algorithm successfully exploits both the leader election and the failure detection capabilities of the failure detector, and performs better in number of rounds than all the previously proposed algorithms for @?S.
A non-overlapping domain decomposition method with non-matching grids for modeling large finite antenna arrays
Authors: Seung-Cheol Lee, Marinos N. Vouvakis, Jin-Fa Lee
Venue: Journal of Computational Physics (2005)

A non-overlapping domain decomposition method (DDM) is proposed herein to solve Maxwell equations in R^3. In this work, the Maxwell equations are discretized using a vector finite element method with hierarchical H(curl) vector basis functions. There are two major ingredients in the proposed non-overlapping DDM: (a) A proper 1st order transmission condition to enforce field continuity across domain boundaries and (b) A cement technique to allow non-matching grids for neighboring domains. Moreover, a detail Fourier analysis of the transmission condition for a canonical half-space example is presented. The analysis provides significant insights into the convergence behavior of the proposed non-overlapping DDM for solving electromagnetic radiation problems, such as the large finite antenna arrays. Particularly for the antenna arrays, the proposed non-overlapping DDM is extremely efficient since the formulation can easily incorporate geometrical repetitions. Exponentially tapered notch (Vivaldi) antenna arrays with size up to 100x100 elements are solved on a common PC to validate the proposed non-overlapping DDM.
Random walks and multiply intersecting families
Authors: Peter Frankl, Norihide Tokushige
Venue: Journal of Combinatorial Theory Series A (2005)

Let F ⊂ 2[n] be a 3-wise 2-intersecting Sperner family. It is proved that |F| ≤ {(n-2 (n-2)/2) if n even, (n-2 (n-1)/2)+2 if n odd holds for n ≥ n0. The unique extremal configuration is determined as well.
The stakeholder forest: designing an expenses application for the enterprise
Authors: Jonathan Arnowitz, Monica Heidelberg, Diana Gray, Michael Arent, Naomi Dorsch
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper discusses the redesign of PeopleSoft's Enterprise Expenses product from a product that was notorious for it's complexity into a product that was both usable and one of PeopleSoft's best selling products. The process used was a combination of best practices from user-centered design, business and marketing to deliver a usable application on a pure-html "no-code on the client" platform. The design effort was also a collaboration of design, usability engineers, business strategy, functional analysts and developers (and of course our customers!) At the same time, the process needed to track the competing interests of various stakeholders: clients, their end users, their business processes, our technical requirements, our limited resources and our internal stakeholders. The designed solution had to work within a framework that could not be re-written. A poorly working metaphor was redefined into a concept that would work better with the end-users.