ppxscal/embedding_network huggingface dataset:
Fusion of Intelligent Agents for the Detection of Aircraft in SAR Images
Authors: Authur Filippidis, L. C. Jain, N. Martin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Receiver Operating Curves are used in the analysis of 20 images using a novel Automatic Target Recognition (ATR) Fusion System. Fuzzy reasoning is used to improve the accuracy of the automatic detection of aircraft in Synthetic Aperture Radar (SAR) images using a priori knowledge derived from color aerial photographs. The images taken by the two different sensors are taken at different times. In summarizing the results of our experiments using real and generated targets with noise for a probability of detection of 91.5 percent using the ATR fusion technique, we have improved our false alarm rates by approximately 17 percent over using texture classification.
A real-time, path guidance cue
Authors: John R. Newport
Venue: ACM SIGAda Ada Letters (1999)

This paper describes an implementation of some simple control laws for following a predefined path. The application might be generation of an aircrew cue or an autopilot capability. Even in the simplest physical representation, there are two complicating factors. These are: bull; Lead time to avoid overshooting the centerline of the next path, and bull; Spiral path due to wind drift.This paper describes the algorithms involved and some lessons learned from the implementation. (Among those lessons are the appropriateness of Ada for complex applications.)
Generating numerical ODE formulas via a symbolic calculus of divided differences
Authors: K. O. Geddes
Venue: ACM SIGSAM Bulletin (1999)

Divided differences of vector functions can be applied to generate numerical update formulas for ODEs, as proposed by W. Kahan. A computer algebra system renders the symbolic manipulations practical to perform. The technique is presented here using the Maple system. Some examples illustrate the potential applications of this hybrid symbolic-numeric approach to solving initial-value problems.
Mixed Covolume Methods on Rectangular Grids For Elliptic Problems
Authors: So-Hsiang Chou, Do Y. Kwak
Venue: SIAM Journal on Numerical Analysis (2000)

We consider a covolume method for a system of first order PDEs resulting from the mixed formulation of the variable-coefficient-matrix Poisson equation with the Neumann boundary condition. The system may be used to represent the Darcy law and the mass conservation law in anisotropic porous media flow. The velocity and pressure are approximated by the lowest order Raviart--Thomas space on rectangles. The method was introduced by Russell [Rigorous Block-centered Discretizations on Irregular Grids: Improved Simulation of Complex Reservoir Systems, Reservoir Simulation Research Corporation, Denver, CO, 1995] as a control-volume mixed method and has been extensively tested by Jones [A Mixed Finite Volume Elementary Method for Accurate Computation of Fluid Velocities in Porous Media, University of Colorado at Denver, 1995] and Cai et al. [Computational Geosciences, 1 (1997), pp. 289--345]. We reformulate it as a covolume method and prove its first order optimal rate of convergence for the approximate velocities as well as for the approximate pressures.
A Distributed Shared-Memory System on a Workstation Cluster Using Fast Serial Links
Authors: Hironori Nakajo, Akihiro Ichikawa, Yukio Kaneda
Venue: International Journal of Parallel Programming (2000)

In this paper, a fast serial link, Serial Transparent Asynchronous First-in First-out Link (STAFF-Link), is introduced. Using such links, we construct a parallel processing system based on a workstation cluster. The workstation cluster implements a distributed sharedmemory mechanism for inter-process communication using a software controlled cache using a STAFF-Link router board. The board has a chained multicast capability with which we have implemented efficient invalidation protocol based on Eager Release Consistency (ERC) model in the DSM system. Performance results on several application programs from the SPLASH2 benchmark suites have been measured.
Notung: dating gene duplications using gene family trees
Authors: Kevin Chen, Dannie Durand, Martin Farach-Colton
Venue: Proceedings of the fourth annual international conference on Computational molecular biology (2000)

Large scale gene duplication is a major force driving the evolution of genetic functional innovation. Whole genome duplications are widely believed to have played an important role in the evolution of the maize, yeast and vertebrate genomes. The use of evolutionary trees to analyze the history of gene duplication and estimate duplication times provides a powerful tool for studying this process. Many studies in the molecular evolution literature have used this approach on small data sets, using analyses performed by hand. The rapid growth of genetic sequence data will soon allow similar studies on a genomic scale but such studies will be limited unless the analysis can be automated. Even existing data sets admit alternative hypotheses that would be too tedious to consider without automation. In this paper, we describe a toolbox called NOTUNG that facilitates large scale analysis, using both rooted and unrooted trees. When tested on trees analyzed in the literature, NOTUNG consistently yielded result that agree with the assessments in the original publications. Thus, NOTUNG provides a basic building block for inferring duplication dates from gene trees automatically and can also be used as an exploratory analysis tool for evaluating alternative hypotheses.
Factorization of linear partial differential operators and Darboux integrability of nonlinear PDEs
Authors: S. P. Tsarev
Venue: ACM SIGSAM Bulletin (1998)

Using a new definition of generalized divisors we prove that the lattice of such divisors for a given linear partial differential operator is modular and obtain analogues of the well-known theorems of the Loewy-Ore theory of factorization of linear ordinary differential operators. Possible applications to factorized Gr ouml;bner bases computations in the commutative and non-commutative cases are discussed, an application to finding criterions of Darboux integrability of nonlinear PDEs is given.
Tradeoffs in displaying peripheral information
Authors: Paul P. Maglio, Christopher S. Campbell
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

Peripheral information is information that is not central to a person's current task, but provides the person the opportunity to learn more, to do a better job, or to keep track of less important tasks. Though peripheral information displays are ubiquitous, they have been rarely studied. For computer users, a common peripheral display is a scrolling text display that provides announcements, sports scores, stock prices, or other news. In this paper, we investigate how to design peripheral displays so that they provide the most information while having the least impact on the user's performance on the main task. We report a series of experiments on scrolling displays aimed at examining tradeoffs between distraction of scrolling motion and memorability of information displayed. Overall, we found that continuously scrolling displays are more distracting than displays that start and stop, but information in both is remembered equally well. These results are summarized in a set of design recommendations.
Erratum: a Sharp Upper Bound for the Expected Number of Shadow Vertices in Lp-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes
Authors: Karl Heinz Borgwardt
Venue: Mathematics of Operations Research (1999)

Due to an error in typesetting, an incorrect version of Figure 1 was printed as part of this paper in Mathematics of Operations Research, Vol. 24 No. 3, August 1999, pp. 544-603. The paper is reprinted correctly.
Uniform Error Estimates for an Exponentially Fitted Finite Element Method for Singularly Perturbed Elliptic Equations
Authors: W. Dörfler
Venue: SIAM Journal on Numerical Analysis (1999)

We consider a linear singularly perturbed elliptic equation on (0,1)2. In a recent paper [W. Dörfler, SIAM J. Numer. Anal., to appear] we proved uniform (in the perturbation parameter) estimates for solutions and an abstract a priori error estimate. Now we show, for some examples, that one can achieve uniform error estimates on a rectangular mesh using exponentially fitted finite elements. These are constructed as tensor products from solutions of local one-dimensional constant coefficient problems. Estimates are obtained in the L2-norm and, assuming discrete stability, also in the $L^\infty$-norm.
What Tasks can be Performed with an Uncalibrated Stereo Vision System?
Authors: J. P. Hespanha, Z. Dodds, G. D. Hager, A. S. Morse
Venue: International Journal of Computer Vision (1999)

This article studies the following question: &ldquo;When is it possible to decide, on the basis of images of point-features observed by an imprecisely modeled two-camera stereo vision system, whether or not a prescribed robot positioning task has been precisely accomplished?&rdquo; Results are shown for three camera model classes: injective cameras, weakly calibrated projective cameras, and uncalibrated projective cameras. In particular, given a weakly calibrated stereo pair, it is shown that a positioning task can be precisely accomplished if and only if the task specification is invariant to projective transformations. It is shown that injective and uncalibrated projective cameras can accomplish fewer tasks, but are still able to accomplish tasks involving point coincidences.The same formal framework is applied to the problem of determining the set of tasks which can be precisely accomplished with the well-known position-based control architecture. It is shown that, for any class of camera models, the set of tasks which can be precisely accomplished using a position-based control architecture is a subset of the complete set of tasks which can be decided on the set, but includes all positioning tasks based on point coincidences. Two ways of extending the idea of position-based control to accomplish more tasks are also presented.
A model of accountability, confidentiality and override for healthcare and other applications
Authors: J. J. Longstaff, M. A. Lockyer, M. G. Thick
Venue: Proceedings of the fifth ACM workshop on Role-based access control (2000)

A UML model of Authorisation is described, which was developed for an Electronic Medical Records application in collaboration with the UK NHS Information Authority. The model is an enhancement of the UK Healthcare Model (HcM), in that it provides extra classes for use with HcM classes. It provides powerful confidentiality specification capabilities, which can also be used in other applications.A Role (actually called AgentActivityType for consistency with the HcM) may be directly associated with an Accountability. An Accountability is an agreement where one Party commissions a second Party to undertake Activities under the authority of that Accountability.Four types of Confidentiality Permission are defined which allow access to data items (SubjectPhenomena), or to data items with specific types (SubjectPhenomenonType). Access can be granted to individual Agents, or to AuthorizedAgents acting in specified Roles. A model of override allows the Confidentiality Permissions to be overridden in a strictly controlled way. Override facilities are granted to Agents by establishing appropriate Accountabilities, and any use of override is logged.Access to data can be granted to groups of Agents, and to group of Roles. Establishing access rights for a group involves defining a set of Confidentiality Permissions for the group.The Authorisation Model is illustrated throughout the paper by examples from healthcare. In particular a demanding scenario (child abuse) is presented. In this scenario complex restrictions must be placed on the data, which might result in inappropriate actions if clinicians and other professionals are denied access to the data.
An Integrated Digital CMOS Time-to-Digital Converter with Sub-Gate-Delay Resolution
Authors: Antti Mäntyniemi, Timo Rahkonen, Juha Kostamovaara
Venue: Analog Integrated Circuits and Signal Processing (2000)

An integrated digital CMOS time-to-digital converter with sub-gate delay LSB width and 50 ps single-shot precision &sigma;-value has been designed and implemented for a laser range-finding application. The measurement is based on a counter and a novel two-step parallel interpolation that uses only 32 delay elements to provide 128 LSBs in the interpolator within the reference clock cycle. The circuit was fabricated in the AMS 0.8 &mu;m CMOS process and the current consumption of the circuit is <20 mA from a single &plus;5 V supply.
Commit-reconcile fences (CRF): a new memory model for architects and compiler writers
Authors: Xiaowei Shen, Arvind, Larry Rudolph
Venue: ACM SIGARCH Computer Architecture News (1999)

We present a new mechanism-oriented memory model called Commit-Reconcile amp; Fences (CRF) and define it using algebraic rules. Many existing memory models can be described as restricted versions of CRF. The model has been designed so that it is both easy for architects to implement, and stable enough to serve as a target machine interface for compilers of high-level languages. The CRF model exposes a semantic notion of caches (saches), and decomposes load and store instructions into finer-grain operations. We sketch how to integrate CRF into modern microprocessors and outline an adaptive coherence protocol to implement CRF in distributed shared-memory systems. CRF offers an upward compatible way to design next generation computer systems.
Assessment of Psychosocial Work Environment in Primary Care&mdash;Development of a Questionnaire
Authors: Susan Wilhelmsson, Ingemar Åkerlind, Tomas Faresjö, Anna-Christina Ek
Venue: Journal of Medical Systems (1999)

Recent studies have indicated deteriorated working conditions of health care personnel. To have an efficient health care organization requires good working conditions and the well-being of the personnel. Today there are no &ldquo;gold-standard&rdquo; assessment tools measuring psychosocial working conditions. The aim of this study was to develop two valid and reliable questionnaires, one generic and one specific, measuring psychosocial working conditions for general practitioners (GPs) and district nurses (DNs) in Sweden, with a special emphasis on organizational changes. The construction of the questionnaires were made after a stepwise developing phase including literature review, interviews, and a pilot study. The pilot study included GPs n &equals; 42 and DNs n &equals; 39. The questionnaires were later on used in a main study (GPs n &equals; 465, DNs n &equals; 465). A factor analysis was carried out and showed that there were fewer items in the main study that had factor loading &ge; 0.40 in more than one factor, compared to the pilot study. The factors from the main study were easier to label and had good correspondence with other studies. After this stepwise development phase good construct validity and internal consistency were established for the questionnaire.
Efficient concurrency control in multidimensional access methods
Authors: Kaushik Chakrabarti, Sharad Mehrotra
Venue: ACM SIGMOD Record (1999)

The importance of multidimensional index structures to numerous emerging database applications is well established. However, before these index structures can be supported as access methods (AMs) in a &ldquo;commercial-strength&rdquo; database management system (DBMS), efficient techniques to provide transactional access to data via the index structure must be developed. Concurrent accesses to data via index structures introduce the problem of protecting ranges specified in the retrieval from phantom insertions and deletions (the phantom problem). This paper presents a dynamic granular locking approach to phantom protection in Generalized Search Trees(GiSTs), an index structure supporting an extensible set of queries and data types. The granular locking technique offers a high degree of concurrency and has a low lock overhead. Our experiments show that the granular locking technique (1) scales well under various system loads and (2) similar to the B-tree case, provides a significantly more efficient implementation compared to predicate locking for multidimensional AMs as well. Since a wide variety of multidimensional index structures can be implemented using GiST, the developed algorithms provide a general solution to concurrency control in multidimensional AMs. To the best of our knowledge, this paper provides the first such solution based on granular locking.
On Hoare logic and Kleene algebra with tests
Authors: Dexter Kozen
Venue: ACM Transactions on Computational Logic (TOCL) (2000)

We show that Kleene algebra with tests (KAT) subsumes propositional Hoare logic (PHL). Thus the specialized syntax and deductive apparatus of Hoare logic are inessential and can be replaced by simple equational reasoning. In addition, we show that all relationally valid inference rules are derivable in KAT and that deciding the relational validity of such rules is PSPACE-complete.
Superlinear Convergence of An Algorithm for Monotone Linear Complementarity Problems, When No Strictly Complimentary Solution Exists
Authors: Narasimhaiah Gorla, Steve Krehbiel, Jos F. Sturm
Venue: Mathematics of Operations Research (1999)

A new predictor-corrector interior point algorithm for solving monotone linear complementarity problems (LCP) is proposed, and it is shown to be superlinearly convergent with at least order 1.5, even if the LCP has no strictly complementary solution. Unlike the algorithm of Mizuno (1996), the fast local convergence is attained without any need for estimating the optimal partition. In the special case that a strictly complementary solution does exist, the order of convergence becomes quadratic. The proof relies on an investigation of the asymptotic behavior of first and second order derivatives that are associated with trajectories of weighted centers for monotone LCPs. The results of this investigation are also used to study convergence and error bounds of three Tapia-type indicators.
Augmented surfaces: a spatially continuous work space for hybrid computing environments
Authors: Jun Rekimoto, Masanori Saitoh
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

This paper describes our design and implementation of a computer augmented environment that allows users to smoothly interchange digital information among their portable computers, table and wall displays, and other physical objects. Supported by a camera-based object recognition system, users can easily integrate their portable computers with the pre-installed ones in the environment. Users can use displays projected on tables and walls as a spatially continuous extension of their portable computers. Using an interaction technique called hyperdragging, users can transfer information from one computer to another, by only knowing the physical relationship between them. We also provide a mechanism for attaching digital data to physical objects, such as a videotape or a document folder, to link physical and digital spaces.
Technology in neonatal intensive care - a study on parents' experiences
Authors: Kaisa Jämsä, Timo Jämsä
Venue: Technology and Health Care (1998)

A comprehensive health technology assessment is needed to meet the demands of holistic health care. We performed a qualitative study to describe the parents experiences of the nursing care of sick newborn infants. The parents of seven full-term infants in a neonatal intensive care unit were interviewed. The parents found the intensive care unit shocking. The equipment with wiring, tubing and blinking lights looked frightening. The parents felt very unpleasant because of the audible signals. The technological environment was oppressive, which caused the parents to feel as outsiders in their parental role and delayed the development of their ability to participate in the care of the child. To relieve the anxiety of the parents and to promote their ability to take care of their newborn child, parental experiences should be taken into account when developing devices. Special attention should be given to designing the outside appearance and the audible signals and alarms of the equipment.
Synthesizing transformations for locality enhancement of imperfectly-nested loop nests
Authors: Nawaaz Ahmed, Nikolay Mateev, Keshav Pingali
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

We present an approach for synthesizing transformations to enhance locality in imperfectly-nested loops. The key idea is to embed the iteration space of every statement in a loop nest into a special iteration space called the product space. The product space can be viewed as a perfectly-nested loop nest, so embedding generalizes techniques like code sinking and loop fusion that are used in ad hoc ways in current compilers to produce perfectly-nested loops from imperfectly-nested ones. In contrast to these ad hoc techniques however, our embeddings are chosen carefully to enhance locality. The product space is then transformed further to enhance locality, after which fully permutable loops are tiled, and code is generated. We evaluate the effectiveness of this approach for dense numerical linear algebra benchmarks, relaxation codes, and the tomcatv code from the SPEC benchmarks.
A Practical Methodology for the Formal Verification of RISC Processors
Authors: Sofiéne Tahar, Ramayya Kumar
Venue: Formal Methods in System Design (1998)

In this paper a practical methodology for formally verifying RISC cores is presented. Using a hierarchical model which reflects the abstraction levels used by designers of real RISC processors, proofs between neighboring levels are performed for simplifying the verification process. The proofs are performed by showing that each instruction is executed correctly by the pipelined machine with respect to the semantics of the instruction set architecture. During this proof, temporal abstractions are used to find correspondences between the various levels of abstractions. Additionally, lower level implementational details such as, multiphased clocks and gate level descriptions of the final implementation, are accounted for. The overall correctness proof is managed in two complementary steps, namely, {\it pipeline\ data} and {\it pipeline\ control} correctness. In the former, we show that the cumulative effect of pipeline suboperations yields the data semantics of architecture instructions. While in the latter, we are concerned with interferences (conflicts) between the different instructions and suboperations in the pipeline. We have developed a set of parametrized proof scripts which highly automate the different proof tasks. In addition, the pipeline control proof is constructive, in the sense that the conditions under which the pipeline conflicts occur are automatically generated and explicitly stated thus aiding the user in its removal. All developed specifications and proof scripts are kept general, so that the methodology could be applied for a wide range of RISC cores (e.g., those used in embedded systems). In this paper, the described formalization and proof strategies are illustrated via the DLX RISC processor.