ppxscal/embedding_network huggingface dataset:
&ldquo;Healthometer&rdquo;&mdash;An Instrument for Self-Distributed Health Screening and Prevention in the Population
Authors: Lennart Spång, Erik Trell, Michael Fioretos, Volker Kielstein, Magdi Nasr
Venue: Journal of Medical Systems (1998)

In the ongoing expansion of medical systems toward prevention and health promotion, primary care is increasingly recognized as a key vehicle and agent. In order to establish a comprehensive health dialogue in the population, there is a need for innovative instruments corresponding to the information and linked media revolution that this shift is a part of. Based upon the experiences of the Department of Preventive Medicine in Malm&ouml;, Sweden, a self-mediated, interactive health testing and promotion instrument called &ldquo;healthometer&rdquo; has been developed and tested for feasibility. The instrument uses a special variety of a quintile-distributed visual analog scale with the thermometer as reference and allows: (a) easy summation and averaging of single or different aggregates of the test items as a &ldquo;wellness&rdquo; profile and score with emphasis upon the positive aspects of health, and (b) recognition against this on the whole favorable background of the weak points motivating further action. The instrument, which can be distributed on paper or electronic medium, supports participation and insight in the initial stages of a directed individual health program for the continuation of which the utilization of professional counsel is stimulated.
Building virtual teams: perspectives on communication, flexibility and trust
Authors: Gloria Mark
Venue: ACM SIGGROUP Bulletin (1998)

As organizations become more globally distributed, and as the fast growth of the Internet, multimedia, and collaborative software environments enable more opportunities for virtual groups to form and conduct business, it is important to understand how the technology affects group interaction. One such company interested in implementing virtual collocation technologies, The Boeing Company, has recently begun to seriously investigate the technology requirements for virtually collocated teams [4]. This paper reports on an empirical study of four virtual teams at The Boeing Company conducted over a three-month period in Spring of 1998. The goal of this research was to gain an understanding of the behavioral effects on work teams who are using such technologies.
The NIST model for role-based access control: towards a unified standard
Authors: Ravi Sandhu, David Ferraiolo, Richard Kuhn
Venue: Proceedings of the fifth ACM workshop on Role-based access control (2000)

This paper describes a unified model for role-based access control (RBAC). RBAC is a proven technology for large-scale authorization. However, lack of a standard model results in uncertainty and confusion about its utility and meaning. The NIST model seeks to resolve this situation by unifying ideas from prior RBAC models, commercial products and research prototypes. It is intended to serve as a foundation for developing future standards. RBAC is a rich and open-ended technology which is evolving as users, researchers and vendors gain experience with it. The NIST model focuses on those aspects of RBAC for which consensus is available. It is organized into four levels of increasing functional capabilities called flat RBAC, hierarchical RBAC, constrained RBAC and symmetric RBAC. These levels are cumulative and each adds exactly one new requirement. An alternate approach comprising flat and hierarchical RBAC in an ordered sequence and two unordered features&mdash;constraints and symmetry&mdash;is also presented. The paper furthermore identifies important attributes of RBAC not included in the NIST model. Some are not suitable for inclusion in a consensus document. Others require further work and agreement before standardization is feasible.
Object-Oriented Analysis and Design of a Health Care Management Information System
Authors: Marina Krol, David L. Reich
Venue: Journal of Medical Systems (1999)

We have created a prototype for a universal object-oriented model of a health care system compatible with the object-oriented approach used in version 3.0 of the HL7 standard for communication messages. A set of three models has been developed: (1) the Object Model describes the hierarchical structure of objects in a system&mdash;their identity, relationships, attributes, and operations&semi; (2) the Dynamic Model represents the sequence of operations in time as a collection of state diagrams for object classes in the system&semi; and (3) functional Diagram represents the transformation of data within a system by means of data flow diagrams. Within these models, we have defined major object classes of health care participants and their subclasses, associations, attributes and operators, states, and behavioral scenarios. We have also defined the major processes and subprocesses. The top-down design approach allows use, reuse, and cloning of standard components.
Integrating interactive computer-based learning experiences into established curricula: a case study
Authors: Anne Morgan Spalter, Rosemary Michelle Simpson
Venue: Proceedings of the 5th annual SIGCSE/SIGCUE ITiCSEconference on Innovation and technology in computer science education (2000)

Educators who wish to integrate interactive computer-based learning experiences into established courses must contend not only with the difficulty of creating quality digital content but with the often equally difficult challenge of reconfiguring their courses to use such materials. We describe our experiences with the Exploratories Project at Brown University [8] and the use of exploratories in an introductory computer graphics programming course [4]. We offer examples of both success and failure, with the goal of helping other educators avoid both painful mistakes and lost time spent coping with unforeseen logistical and pedagogical concerns. Among the lessons we learned: planning can't begin too early for the integration of such materials into an established curriculum, and all possible methods of integration should be considered before committing to any specific approach.
Distributed simulation of VLSI systems via lookahead-free self-adaptive optimistic and conservative synchronization
Authors: Dragos Lungeanu, C.-J. Richard Shi
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This paper presents a new protocol for parallel and distributed simulation of VLSI systems. It is novel in two aspects: first, it combines optimistic and conservative synchronization methods, allowing processes to self-adapt for maximal utilization of concurrency. Second, it does not require any application-dependent information like lookahead, which in many cases is unknown, zero, or difficult to automatically obtain from a design in a hardware description language. All these features make it very convenient and practical, extending the class of applications to at least all VHDL circuits, including delta cycle. The proposed protocol has been implemented and used for VHDL simulation. Experimental results on several large VHDL circuits (between 1411 and 14704 processes) have shown promising linear speedups. We also observed that the dynamic synchronization, in which processes automatically adapt to optimistic or conservative behavior, follows closely or finds a very good configuration. This protocol may have a string impact for mixed-signal circuit simulation, where digital parts may be optimistic and heavy-state analog parts, conservative.
A Variable Metric Proximal Point Algorithm for Monotone Operators
Authors: J. V. Burke, Maijian Qian
Venue: SIAM Journal on Control and Optimization (1999)

The proximal point algorithm (PPA) is a method for solving inclusions of the form $0\in T(z)$, where T is a monotone operator on a Hilbert space. The algorithm is one of the most powerful and versatile solution techniques for solving variational inequalities, convex programs, and convex-concave mini-max problems. It possesses a robust convergence theory for very general problem classes and is the basis for a wide variety of decomposition methods called splitting methods. Yet the classical PPA typically exhibits slow convergence in many applications. For this reason, acceleration methods for the PPA algorithm are of great practical importance. In this paper we propose a variable metric implementation of the proximal point algorithm. In essence, the method is a Newton-like scheme applied to the Moreau--Yosida resolvent of the operator T. In this article, we establish the global and linear convergence of the proposed method. In addition, we characterize the superlinear convergence of the method. In a companion work, we establish the superlinear convergence of the method when implemented with Broyden updating (the nonsymmetric case) and BFGS updating (the symmetric case).
Time Warp simulation on clumps
Authors: Girindra D. Sharma, Radharamanan Radhakrishnan, Umesh Kumar V. Rajasekaran, Nael Abu-Ghazaleh, Philip A. Wilsey
Venue: Proceedings of the thirteenth workshop on Parallel and distributed simulation (1999)

Traditionally, parallel discrete-event simulators based on the Time Warp synchronization protocol have been implemented using either the shared memory programming model or the distributed memory, message passing programming model. This was because the preferred hardware platform was either a shared memory multiprocessor workstation or a network of uniprocessor workstations. However, with the advent of "clumps" (cluster of shared memory multiprocessors), a change in this dichotomous view becomes necessary. This paper explores the design and implementation issues involved in exploiting this new platform for Time Warp simulations. Specifically, this paper presents two generic strategies for implementing Time Warp simulators on clumps. In addition, we present our experiences in implementing these strategies on an extant distributed memory, message passing Time Warp simulator (WARPED). Preliminary performance results comparing the modified clump-specific simulation kernel to the unmodified distributed memory, message passing simulation kernel are also presented.
Uniform generation in spatial constraint databases and applications (Extended abstract)
Authors: David Gross, Michel de Rougemont
Venue: Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2000)

We study the efficient approximation of queries in linear constraint databases using sampling techniques. We define the notion of an almost uniform generator for a generalized relation and extend the classical generator of Dyer, Frieze and Kannan for convex sets to the union and the projection of relations. For the intersection and the difference, we give sufficient conditions for the existence of such generators. We show how such generators give relative estimations of the volume and approximations of generalized relations as the composition of convex hulls obtained from the samples.
Multiprocessor Scheduling with Rejection
Authors: Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jirí Sgall, Leen Stougie
Venue: SIAM Journal on Discrete Mathematics (2000)

We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected at a certain penalty. An instance of the problem is given by $m$ identical parallel machines and a set of $n$ jobs, with each job characterized by a processing time and a penalty. In the on-line version the jobs become available one by one and we have to schedule or reject a job before we have any information about future jobs. The objective is to minimize the makespan of the schedule for accepted jobs plus the sum of the penalties of rejected jobs.The main result is a $1+\phi\approx 2.618$ competitive algorithm for the on-line version of the problem, where $\phi$ is the golden ratio. A matching lower bound shows that this is the best possible algorithm working for all $m$. For fixed $m$ we give improved bounds; in particular, for $m=2$ we give a $\phi\approx 1.618$ competitive algorithm, which is best possible.For the off-line problem we present a fully polynomial approximation scheme for fixed $m$ and a polynomial approximation scheme for arbitrary $m$. Moreover, we present an approximation algorithm which runs in time $O(n\log n)$ for arbitrary $m$ and guarantees a $2-\frac{1}{m}$ approximation ratio.
Temporal FDs on complex objects
Authors: Jef Wijsen
Venue: ACM Transactions on Database Systems (TODS) (1999)

Temporal functional dependencies (TFD) are defined for temporal databases that include object identity. It is argued that object identity can overcome certain semantic diffuculties with existing temporal relational data models. Practical applications of TFDs in object bases are discussed. Reasoning about TFDs is at the center of this paper. It turns out that the distinction between acyclic and cyclic schemas is significant. For acyclic schemas, a complete axiomatization for finite implication is given and an algorithm for deciding finite implication provided. The same axiomatization is proven complete for unrestricted implication in unrestricted schemas, which can be cyclic. An interesting result is that there are cyclic schemas for which unrestricted and finite implication do not coincide. TFDs relate and extend some earlier work on dependency theory in temporal databases. Throughout this paper, the construct of TFD is compared with the notion of temporal FD introduced by Wang et al. (1997). A comparison with other related work is provided at the end of the article.
The transport layer: tutorial and survey
Authors: Sami Iren, Paul D. Amer, Phillip T. Conrad
Venue: ACM Computing Surveys (CSUR) (1999)

Transport layer protocols provide for end-to-end communication between two or more hosts. This paper presents a tutorial on transport layer concepts and terminology, and a survey of transport layer services and protocols. The transport layer protocol TCP is used as a reference point, and compared and contrasted with nineteen other protocols designed over the past two decades. The service and protocol features of twelve of the most important protocols are summarized in both text and tables.
Switching Equivalence Classes of Perfect Codes
Authors: Kevin T. Phelps
Venue: Designs, Codes and Cryptography (1999)

The authors present a 1-error correcting perfect code of length 15 and show that it is not switching equivalent to the Hamming code thereby settling a question of Avgustinovich and Solov&lsquo;evaas96
SimDS: a simulation environment for the design of distributed database systems
Authors: Alok R. Chaturvedi, Samir Gupta, Subhajyoti Bandyopadhyay
Venue: ACM SIGMIS Database (1998)

Design of a distributed transaction processing system is a complex process. The paper describes the design and implementation of a general purpose scalable simulation environment (SimDS) for designing and evaluating the performance of distributed transaction processing systems. SimDS is a distributed simulation system where each data server is implemented as a separate process that communicates with each other through user datagram protocol. The paper describes the features of SimDS including various design policies that can be modeled by the system. It also discusses different design issues that one needs to consider in the implementation of a distributed simulation environment. The paper concludes with some test examples where SimDS was used to simulate different configurations of a real-time transaction processing system.
Trajectory Control of Convergent Networks
Authors: N. Peterfreund, Y. Baram
Venue: Neural Processing Letters (1998)

We present a class of feedback control functions which increase the convergence rates of nonlinear dynamical systems. A simple sign function is used to obtain convergence in finite time. We describe a trajectory learning procedure which preserves the convergence property of the system. Based on the proposed feedback, we developed a new neural network model which converges in finite time.
A graph theoretic optimal algorithm for schedule compression in time-multiplexed FPGA partitioning
Authors: Huiqun Liu, D. F. Wong
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This paper presents an optimal algorithm to solve the schedule compression problem, which is an open problem proposed by Trimberger [1] for time-multiplexed FPGA partitioning. Time-multiplexed FPGAs have the potential to dramatically improve logic density by time-sharing logic. Schedule compression is an important step in partitioning for time-multiplexed FPGAs [1,4,9,10] and can greatly influence the quality of the partitioning solution. We exactly solve the schedule compression problem by converting it to a constrained min-max path problem. We further extend our algorithm to minimize the communication cost during schedule compression. Experiments show that our optimal algorithm outperforms the existing heuristics and runs very efficiently.
Designer&mdash;a logic diagram design tool
Authors: Chris Power
Venue: ACM SIGCSE Bulletin (1999)

Designer is a software tool that helps the program developer lay out structure diagrams. Structure diagramming is a structured design technique commonly taught in New Zealand polytechnics. Diagrams can be written for overall logic flow or detailed design. Unlike a flow chart, a structure diagram can always be directly translated to the control structures of a structured programming language. The basic diagram symbols are process boxes, decisions, loops, input-output boxes and procedure calls.
Measures of Effectiveness for Governmental Organizations
Authors: Kishore Gawande, Timothy Wheeler
Venue: Management Science (1999)

For organizations whose objective is not necessarily the maximization of a financial quantity, there is little written in the economics and management literature about methods that quantify their effectiveness. Potential users of such methodologies are typically governmental organizations and agencies to whom Congress allocates funding periodically, but may also include many nonprofit organizations. Such research is importantly needed because government is no longer making outlay allocations on a merely historical basis, but is using as a criterion how effectively an organization uses its resources in meeting its objectives. In this paper we analyze the Maritime Safety Program of the U.S. Coast Guard (USCG), which is responsible for monitoring the quality of vessels that sail in U.S. waters, and present measures of effectiveness (MOEs) for the Program. We do this at two levels of activity: at an overall program level (Level I) and at a component activity level (Level II). Poisson models are used to construct the MOEs using data on maritime casualties (accidents) between 1990 -1993 from the real-time Marine Safety Management System (MSMS) database maintained by the Coast Guard. A feature of the empirical methodology is the Bayesian imputation of missing data. The MOEs constructed here have at least four important uses. First, as the name suggests, they perform the function that financial quantities such as returns on equity or returns on sales perform for private-sector organizations-that is, they are indicators of efficiency. Second, they can be used as inputs into allocative decisions within the organization. For example, the Level II MOEs can be used as inputs into a programming problem that determines the optimal allocation of resources among component activities. Third, internal performance evaluation across USCG Programs or across Port Units (called Marine Safety Offices) can be based on their respective Level I MOEs. Fourth, and possibly the most important long-run consideration, MOEs provide the basis for better regulation by the government. Without MOEs the nature of regulation is probably suboptimal. By adopting these MOEs as criteria, it will be easier for the government to redesign those aspects of its regulation of the Coast Guard which curtail incentives.
A Priori Error Analysis of Residual-Free Bubbles for Advection-Diffusion Problems
Authors: F. Brezzi, T. J. R. Hughes, L. D. Marini, A. Russo, E. Süli
Venue: SIAM Journal on Numerical Analysis (1999)

We develop an a priori error analysis of a finite element approximation to the elliptic advection-diffusion equation $-\eps \Delta u + \conv\cdot \nabla u = f$ subject to a homogeneous Dirichlet boundary condition, based on the use of residual-free bubble functions. An optimal order error bound is derived in the so-called stability-norm \[ \biggl(\eps \|\nabla v\|^2_{L_2(\Omega)} + \sum_{T} h_T\|\conv\cdot \nabla v\|^2_{L_2(T)}\biggr)^{1/2},\] where hT denotes the diameter of element T in the subdivision of the computational domain.
Separate-and-Conquer Rule Learning
Authors: Johannes Fürnkranz
Venue: Artificial Intelligence Review (1999)

This paper is a survey of inductive rule learning algorithms that use a separate-and-conquer strategy. This strategy can be traced back to the AQ learning system and still enjoys popularity as can be seen from its frequent use in inductive logic programming systems. We will put this wide variety of algorithms into a single framework and analyze them along three different dimensions, namely their search, language and overfitting avoidance biases.
Symplectic Matroids
Authors: Alexandre V. Borovik, Israel Gelfand, Neil White
Venue: Journal of Algebraic Combinatorics: An International Journal (1998)

A symplectic matroid is a collection {\cal B} of k-element subsets of J &equals; &lcub;1, 2, &hellip;, n, 1&ast;, 2&ast;, &hellip; n&ast;&rcub;, each of which contains not both of i and i&ast; for every i &le; n, and which has the additional property that for any linear ordering &pr; of J such that i &pr; j implies j&ast; &pr; i&ast; and i &pr; j&ast; implies j &pr; i&ast; for all i, j &le; n, {\cal B} has a member which dominates element-wise every other member of {\cal B}. Symplectic matroids are a special case of Coxeter matroids, namely the case where the Coxeter group is the hyperoctahedral group, the group of symmetries of the n-cube. In this paper we develop the basic properties of symplectic matroids in a largely self-contained and elementary fashion. Many of these results are analogous to results for ordinary matroids (which are Coxeter matroids for the symmetric group), yet most are not generalizable to arbitrary Coxeter matroids. For example, representable symplectic matroids arise from totally isotropic subspaces of a symplectic space very similarly to the way in which representable ordinary matroids arise from a subspace of a vector space. We also examine Lagrangian matroids, which are the special case of symplectic matroids where k &equals; n, and which are equivalent to Bouchet&lsquo;s symmetric matroids or 2-matroids.
Parallelizing a sequential logic simulator using an optimistic framework based on a global parallel heap event queue: an experience and performance report
Authors: Sushil K. Prasad, Nikhil Junankar
Venue: Proceedings of the fourteenth workshop on Parallel and distributed simulation (2000)

We have parallelized the Iowa Logic Simulator, a gate-level fine-grained discrete-event simulator, by employing an optimistic algorithm framework based on a global event queue implemented as a parallel heap. The original code and the basic data structures of the serial simulator remained unchanged. Wrapper data structures for the logical processes (gates) and the events are created to allow rollbacks, all the earliest events at each logical processes are stored into the parallel heap, and multiple earliest events are simulated repeatedly by invoking the simulate function of the serial simulator. The parallel heap allowed extraction of hundreds to thousands of earliest events in each queue access. On a bus-based shared-memory multiprocessor, simulation of synthetic circuits with 250,000 gates yielding speedups of 3.3 employing five processors compared to the serial execution time of the Iowa Logic Simulator, and limited the number of rollbacks to within 2,000. The basic steps of parallelization are well-defined and general enough to be employable on other discrete-event simulators.