ppxscal/embedding_network huggingface dataset:
The MEDIGATE Graphical User Interface for Entry of Physical Findings: Design Principles and Implementation
Authors: Joseph W. Yoder, Donald F. Schultz Ben T. Williams
Venue: Journal of Medical Systems (1998)

The solution to many of the problems of the computer-based recording of the medical record has been elusive, largely due to difficulties in the capture of those data elements that comprise the records of the Present Illness and of the Physical Findings. Reliable input of data has proven to be more complex than originally envisioned by early work in the field. This has led to more research and development into better data collection protocols and easy to use human-computer interfaces as support tools. The Medical Examination Direct Iconic and Graphic Augmented Text Entry System (MEDIGATE System) is a computer enhanced interactive graphic and textual record of the findings from physical examinations designed to provide ease of user input and to support organization and processing of the data characterizing these findings.(27,30) The primary design objective of the MEDIGATE System is to develop and evaluate different interface designs for recording observations from the physical examination in an attempt to overcome some of the deficiencies in this major component of the individual record of health and illness.
The Ravenscar Tasking Profile&mdash;experience reporting
Authors: Brian Dobbing, George Romanski
Venue: Proceedings of the ninth international workshop on Real-time Ada (1999)

The Ravenscar Profile was defined at the 18th International Real-Time Ada Workshop as a simple subset of the tasking features of Ada, in order to support efficient, high integrity applications that need to be analysed for their timing properties. Ada compiler vendor Aonix subsequently implemented the Profile via its Raven product line, and is currently engaged in producing the formal certification material for qualifying the runtime system to the most stringent set of guidelines --- DO-178B Level A. This paper describes some of the experiences in implementing and qualifying the Profile, and some early indications from the user community of its value to address the application domains that it was intended for.
Object mappings in a software engineering project
Authors: Richard M. Casey
Venue: ACM SIGSOFT Software Engineering Notes (1999)

In a software engineering project, business objects were mapped directly to software and database objects. There was a natural correlation between objects in real world systems and their representation as software objects and database objects. This mapping may serve as an effective model for similar projects.
Towards application/file-level characterization of block references: a case for fine-grained buffer management
Authors: Jongmoo Choi, Sam H. Noh, Sang Lyul Min, Yookun Cho
Venue: Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2000)

Two contributions are made in this paper. First, we show that system level characterization of file block references is inadequate for maximizing buffer cache performance. We show that a finer-grained characterization approach is needed. Though application level characterization methods have been proposed, this is the first attempt, to the best of our knowledge, to consider file level characterizations. We propose an Application/File-level Characterization (AFC) scheme where we detect on-line the reference characteristics at the application level and then at the file level, if necessary. The results of this characterization are used to employ appropriate replacement policies in the buffer cache to maximize performance. The second contribution is in proposing an efficient and fair buffer allocation scheme. Application or file level resource management is infeasible unless there exists an allocation scheme that is efficient and fair. We propose the &Dgr;HIT allocation scheme that takes away a block from the application/file where the removal results in the smallest reduction in the number of expected buffer cache hits. Both the AFC and &Dgr;HIT schemes are on-line schemes that detect and allocate as applications execute. Experiments using trace-driven simulations show that substantial performance improvements can be made. For single application executions the hit ratio increased an average of 13 percentage points compared to the LRU policy, with a maximum increase of 59 percentage points, while for multiple application executions, the increase is an average of 12 percentage points, with a maximum of 32 percentage points for the workloads considered.
Blowup in Reaction-Diffusion Systems with Dissipation of Mass
Authors: Michel Pierre, Didier Schmitt
Venue: SIAM Review (2000)

We prove possible blowup in finite time of the solutions to reaction-diffusion systems which preserve nonnegativity and for which the total mass of the components is nonincreasing in time (two natural properties in applications). This is done by presenting explicit counterexamples constructed with the help of formal computation software. Several partial results of global existence had been obtained previously in the literature. Our counterexamples explain a posteriori why extra conditions were needed. Negative results of independent interest are also provided as a by-product for linear parabolic equations in nondivergence form and with discontinuous coefficients and for nonlinear Hamilton--Jacobi evolution equations.
Star Extremal Circulant Graphs
Authors: Ko-Wei Lih, Daphne Der-Fen Liu, Xuding Zhu
Venue: SIAM Journal on Discrete Mathematics (1999)

A graph is called star extremal if its fractional chromatic number is equal to its circular chromatic number (also known as the star chromatic number). We prove that members of a certain family of circulant graphs are star extremal. The result generalizes some known theorems of Sidorenko [Discrete Math., 91 (1991), pp. 215--217] and Gao and Zhu [Discrete Math., 152 (1996), pp. 147--156]. We show relations between circulant graphs and distance graphs and discuss their star extremality. Furthermore, we give counterexamples to two conjectures of Collins [SIAM J. Discrete Math., 11 (1998), pp. 330--339] on asymptotic independence ratios of circulant graphs.
Nonlinear Stability of Compressible Thermal Lattice BGK Models
Authors: M. De Cicco, S. Succi, G. Bella
Venue: SIAM Journal on Scientific Computing (1999)

The nonlinear stability of thermal lattice BGK models is examined by means of computer simulation for the case of one- and two- dimensional compressible flows.It is shown that in one dimension (1D) the method is stable on a sizeable range of flow speeds and temperatures. In two dimensions (2D) the method is stable even in the presence of negative distribution functions, but on a smaller stability domain.The computational efficiency of the method compares favorably with classical algorithms for compressible flows, such as the $\lambda$-scheme and the Lax--Wendroff scheme.
Power browser: efficient Web browsing for PDAs
Authors: Orkut Buyukkokten, Hector Garcia-Molina, Andreas Paepcke, Terry Winograd
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

We have designed and implemented new Web browsing facilities to support effective navigation on Personal Digital Assistants (PDAs) with limited capabilities: low bandwidth, small display, and slow CPU. The implementation supports wireless browsing from 3Com's Palm Pilot. An HTTP proxy fetches web pages on the client's behalf and dynamically generates summary views to be transmitted to the client. These summaries represent both the link structure and contents of a set of web pages, using information about link importance. We discuss the architecture, user interface facilities, and the results of comparative performance evaluations. We measured a 45% gain in browsing speed, and a 42% reduction in required pen movements.
Convergence Analysis of a Finite Element Projection/Lagrange--Galerkin Method for the Incompressible Navier--Stokes Equations
Authors: Y. Achdou, J.-L. Guermond
Venue: SIAM Journal on Numerical Analysis (2000)

This paper provides a convergence analysis of a fractional-step method to compute incompressible viscous flows by means of finite element approximations. In the proposed algorithm, the convection, the diffusion, and the incompressibility are treated in three different substeps. The convection is treated first by means of a Lagrange--Galerkin technique, whereas the diffusion and the incompressibility are treated separately in two subsequent substeps by means of a projection method. It is shown that provided the time step, $\delta t,$ is of ${\cal O}(h^{d/4}),$ where $h$ is the meshsize and $d$ is the space dimension ($2\leq d \leq 3$), the proposed method yields for finite time T an error of ${\cal O}(h^{l+1}+\delta t)$ in the L2 norm for the velocity and an error of ${\cal O}(h^{l}+\delta t)$ in the H1 norm (or the L2 norm for the pressure), where l is the polynomial degree of the approximate velocity.
A suite of WWW-based tools for advanced course management
Authors: Kurt Nørmark
Venue: ACM SIGCSE Bulletin (2000)

A collection of tools for creation of advanced and comprehensive course home pages is presented. The tools cover the spectrum from course overview pages and hypertext teaching materials to interactive services that support the teaching activities during the course. From the teacher's perspective the tools allow for abstraction from details and automation of routine work in the authoring process. Seen from a student's perspective the comprehensive linking of course plans, teaching material, and interactive services provides for a valuable organization of a large body of information.
Using Genetic Algorithms to Model the Evolution of Heterogeneous Beliefs
Authors: James Bullard, John Duffy
Venue: Computational Economics (1999)

We study a general equilibrium system where agents have heterogeneous beliefs concerning realizations of possible outcomes. The actual outcomes feed back into beliefs thus creating a complicated nonlinear system. Beliefs are updated via a genetic algorithm learning process which we interpret as representing communication among agents in the economy. We are able to illustrate a simple principle: genetic algorithms can be implemented so that they represent pure learning effects (i.e., beliefs updating based on realizations of endogenous variables in an environment with heterogeneous beliefs). Agents optimally solve their maximization problem at each date given their beliefs at each date. We report the results of a set of computational experiments in which we find that our population of artificial adaptive agents is usually able to coordinate their beliefs so as to achieve the Pareto superior rational expectations equilibrium of the model.
Direct Least Square Fitting of Ellipses
Authors: Andrew Fitzgibbon, Maurizio Pilu, Robert B. Fisher
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac¿b2 = 1, the new method incorporates the ellipticity constraint into the normalization factor. The proposed method combines several advantages: It is ellipse-specific, so that even bad data will always return an ellipse. It can be solved naturally by a generalized eigensystem. It is extremely robust, efficient, and easy to implement.
Atomic Decomposition by Basis Pursuit
Authors: Scott Shaobing Chen, David L. Donoho, Michael A. Saunders
Venue: SIAM Journal on Scientific Computing (1998)

The time-frequency and time-scale communities have recently developed a large number of overcomplete waveform dictionaries --- stationary wavelets, wavelet packets, cosine packets, chirplets, and warplets, to name a few. Decomposition into overcomplete systems is not unique, and several methods for decomposition have been proposed, including the method of frames (MOF), Matching pursuit (MP), and, for special dictionaries, the best orthogonal basis (BOB).Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions. We give examples exhibiting several advantages over MOF, MP, and BOB, including better sparsity and superresolution. BP has interesting relations to ideas in areas as diverse as ill-posed problems, in abstract harmonic analysis, total variation denoising, and multiscale edge denoising.BP in highly overcomplete dictionaries leads to large-scale optimization problems. With signals of length 8192 and a wavelet packet dictionary, one gets an equivalent linear program of size 8192 by 212,992. Such problems can be attacked successfully only because of recent advances in linear programming by interior-point methods. We obtain reasonable success with a primal-dual logarithmic barrier method and conjugate-gradient solver.
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
Authors: Richa Agarwala, Vineet Bafna, Martin Farach, Mike Paterson, Mikkel Thorup
Venue: SIAM Journal on Computing (1999)

We consider the problem of fitting an n &times; n distance matrix D by a tree metric T. Let $\varepsilon$ be the distance to the closest tree metric under the $L_{\infty}$ norm; that is, $\varepsilon=\min_T\{\parallel T-D\parallel{\infty}\}$. First we present an O(n2) algorithm for finding a tree metric T such that $\parallel T-D\parallel{\infty}\leq 3\varepsilon$. Second we show that it is ${\cal NP}$-hard to find a tree metric T such that $\parallel T-D\parallel{\infty}
&lgr;-DB: an ODMG-based object-oriented DBMS
Authors: Leonidas Fegaras, Chandrasekhar Srinivasan, Arvind Rajendran, David Maier
Venue: ACM SIGMOD Record (2000)

The &lgr;-DB project at the University of Texas at Arlington aims at developing frameworks and prototype systems that address the new query optimization challenges for object-oriented and object-relational databases, such as query nesting, multiple collection types, methods, and arbitrary nesting of collections. We have already developed a theoretical framework for query optimization based on an effective calculus, called the monoid comprehension calculus [4]. The system reported here is a fully operational ODMG 2.0 [2] OODB management system, based on this framework. Our system can handle most ODL declarations and can process most OQL query forms. &lgr;-DB is not ODMG compliant. Instead it supports its own C++ binding that provides a seamless integration between OQL and C++ with low impedance mismatch. It allows C++ variables to be used in queries and results of queries to be passed back to C++ programs. Programs expressed in our C++ binding are compiled by a preprocessor that performs query optimization at compile time, rather than run-time, as it is proposed by ODMG. In addition to compiled queries, &lgr;-DB provides an interpreter that evaluates ad-hoc OQL queries at run-time. The &lgr;-DB system architecture is shown in Figure 1. The &lgr;-DB evaluation engine is written in SDL (the SHORE Data Language) of the SHORE object management system [1], developed at the University of Wisconsin. ODL schemas are translated into SDL schemas in a straightforward way and are stored in the system catalog. The &lgr;-DB OQL compiler is a C++ preprocessor that accepts a language called &lgr;-OQL, which is C++ code with embedded DML commands to perform transactions, queries, updates, etc. The preprocessor translates &lgr;-OQL programs into C++ code that contains calls to the &lgr;-DB evaluation engine. We also provide a visual query formulation interface, called VOODOO, and a translator from visual queries to OQL text, which can be sent to the &lgr;-DB OQL interpreter for evaluation.Even though a lot of effort has been made to make the implementation of our system simple enough for other database researchers to use and extend, our system is quite sophisticated since it employs current state-of-the-art query optimization technologies as well as new advanced experimental optimization techniques which we have developed through the years, such as query unnesting [3]. The &lgr;-DB OODBMS is available as an open source software through the web at http://lambda.uta.edu/lambda-DB.html
Handover and new call blocking performance with dynamic single-channel assignment in linear cellular arrays
Authors: Alexander L. Wijesinha, Srikanta P. Kumar, Deepinder P. Sidhu
Venue: Wireless Networks (2000)

We consider dynamic assignment of a single channel in a linear cellular array, and derive closed&dash;form expressions for the blocking probability of handover calls and new calls in terms of the array size and traffic load assuming a Markov traffic model. Handover and new call blocking performance in the limit of large arrays and extreme traffic loads is also determined.
Add finalization
Authors: Christoph Grein
Venue: ACM SIGAda Ada Letters (1999)

With its tagged types and appropriate dynamic binding facilities, Ada95 has become a mighty language. Virtually ad libidum, you can add new components to given types of a class. This seems to imply some kind of arbitrariness in the choice of the starting point of a type hierarchy (the root of a class). However, this arbitrariness is only a seeming one and you rather have to exercise utmost care in choosing the root lest you might run into troubles at the end. This fact is highlighted by the following problem about controlled types I found some time ago in the Ada internet forum Chat@Gnat.com, which I thought might be of common interest.
Combating the code warrior: a different sort of programming instruction
Authors: Debora Weber-Wulff
Venue: Proceedings of the 5th annual SIGCSE/SIGCUE ITiCSEconference on Innovation and technology in computer science education (2000)

Many CS101 courses purport to teach object-oriented programming, but many seem to be directly translated from traditional structured programming courses. Lynn Andrea Stein's "Rethinking CS101" program at MIT offers a radically different approach to teaching OO programming by concentrating on the interactive aspects of object-oriented systems. This approach has the added advantage that students who have previously learned "programming" must also relearn how to approach the problems involved in programming interactive systems. This paper reports on the author's use of this concept outside of MIT, with encouraging results.
Self-Organized Feature Extraction Achieved with a Parameterized Filterbank
Authors: Temujin Gautama, Marc M. Van Hulle
Venue: Neural Processing Letters (1999)

Filterbanks are often used as preprocessing stages in many applications and can be used for e.g. feature extraction or dimensionality reduction. In this paper, an unsupervised learning algorithm is described that develops a bank of parameterized (Gabor) filters, starting from a training set. It forces the filters to partition the input space in an equitable manner: each filter is tuned to a different frequency region and contributes equally to the extraction of localized features. The algorithm is tested on a real world example, after which the results are discussed.
Modelling Asynchrony with a Synchronous Model
Authors: R. P. Kurshan, M. Merritt, A. Orda, S. R. Sachs
Venue: Formal Methods in System Design (1999)

The I/O automaton paradigm of Lynch and Tuttle models asynchrony through an interleaving parallel composition. The recognition that such interleaving models in fact can be viewed as special cases of synchronous parallel composition has been very limited. Let <?TeX="{\cal A}"> be any set of finite-state I/O automata drawing actions from a fixed finite set containing a subset &Delta;. In this article we establish a translation T : <?TeX="{\cal A}\,{\rightarrow}\,{\cal P}"> to a class of &omega;-automata <?TeX="\cal{P}"> closed under a synchronous parallel composition, for which T is monotonic with respect to implementation relative to &Delta;, and linear with respect to composition. Thus, for A^1, &hellip;, A, B^1, &hellip;, B &isin; <?TeX="{\cal A}"> and A &equals; A^1 &Verbar;&hellip;&Verbar; A, B &equals; B^1 &Verbar;&hellip;&Verbar; B, if &Delta; is the set of actions common to both A and B, then A implements B (in the sense of I/O automata) if and only if the &omega;-automaton language containment<?TeX="{\cal L}"> (T(A^1) &otimes; &hellip; &otimes; T(A)) &sub; <?TeX="{\cal L}"> (T(B^1) &otimes; &hellip; &otimes; T(B)) obtains, where &Verbar; denotes the interleaving parallel composition on <?TeX="{\cal A}"> and &otimes; denotes the synchronous parallel composition on <?TeX="{\cal P}"> . For the class <?TeX="{\cal P}">, we use the L-process model of &omega;-automata. This result enables one to verify systems specified by I/O automata through model-checkers such as COSPAN or SMV, that operate on models with synchronous parallel composition. The translation technique generalizes to other interleaving models, although in each case, the translation map must match the specific model.
Using Data Flow Information to Obtain Efficient Check Sets for Algorithm-Based Fault Tolerance
Authors: Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi
Venue: International Journal of Parallel Programming (1999)

Algorithm-Based Fault Tolerance (ABFT) is a well known technique for achieving fault and error detection in multiprocessor systems. We examine several issues concerning ABFT systems when the data flow information for the underlying multiprocessor computation is available. Our results show that this finergrained information can be exploited to obtain test schemes involving fewer checks, in some cases, dramatically fewer checks. We address both the analysis and design of ABFT systems when the data flow information is available. The analysis problem for a given ABFT system is to determine the fault detectability and the fault locatability (maximum number of detectable and locatable faulty processors) of the system. We show that the analysis problem can be solved efficiently when the number of faults is fixed. We also address the computational difficulty of this problem when the number of faults is not fixed. The design problem is concerned with the construction of a minimal collection of checks which can detect or locate a specified number of faults for a given multiprocessor computation. We examine some special classes of data flow graphs and establish upper and lower bounds on the number of checks needed to detect or locate a given number of faults. We also address the computational difficulty of this design problem for several cases.
Solving Scheduling Problems by Simulated Annealing
Authors: Olivier Catoni
Venue: SIAM Journal on Control and Optimization (1998)

We define a general methodology to deal with a large family of scheduling problems. We consider the case where some of the constraints are expressed through the minimization of a loss function. We study in detail a benchmark example consisting of some jigsaw puzzle problem with additional constraints. We discuss some algorithmic issues typical of scheduling problems, such as the apparition of small unused gaps or the representation of proportionality constraints. We also carry on an experimental comparison between the Metropolis algorithm, simulated annealing, and the iterated energy transformation method to see whether asymptotical theoretical results are a good guide towards practically efficient algorithms.