ppxscal/embedding_network huggingface dataset:
The Cost-Effectiveness of Preventing Cytomegalovirus Disease in Aids Patients
Authors: A. David Paltiel, Kenneth A. Freedberg
Venue: Interfaces (1998)

To examine the costs and consequences of prophylaxis against cytomegalovirus (CMV) infection, we developed a compartmental model of the natural history of late-stage HIV disease. We used data on the progression of illness, economic costs, the incidence of infections, the efficacy and toxicity of therapy, and patient quality of life from national cohort studies, randomized clinical trials, and resource-utilization surveys. We found that CMV prophylaxis confers additional quality-adjusted life-years at a lower-bound, marginal cost of $160,000. While this cost-effectiveness result compares unfavorably with alternative uses of scarce resources, it is sensitive to assumptions regarding the price of therapy and the incidence of infection.
Clustering categorical data: an approach based on dynamical systems
Authors: David Gibson, Jon Kleinberg, Prabhakar Raghavan
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2000)

We describe a novel approach for clustering collections of sets, and its application to the analysis and mining of categorical data. By &ldquo;categorical data,&rdquo; we mean tables with fields that cannot be naturally ordered by a metric &ndash; e.g., the names of producers of automobiles, or the names of products offered by a manufacturer. Our approach is based on an iterative method for assigning and propagating weights on the categorical values in a table; this facilitates a type of similarity measure arising from the co-occurrence of values in the dataset. Our techniques can be studied analytically in terms of certain types of non-linear dynamical systems.
Abstracting cryptographic protocols with tree automata
Authors: David Monniaux
Venue: Science of Computer Programming (2003)

Cryptographic protocols have so far been analyzed for the most part by means of testing (which does not yield proofs of secrecy) and theorem proving (costly). We propose a new approach, based on abstract interpretation and using regular tree languages. The abstraction we use seems fine-grained enough to be able to certify some protocols. Both the concrete and abstract semantics of the protocol description language and implementation issues are discussed in the paper.
Applying a core competence approach in virtual enterprise formation
Authors: Carlos Frederico Bremer, Jairo Eduardo Moraes Siqueira, Luis Fernando Moraes Marques
Venue: Managing virtual web organizations in the 21st century: issues and challenges (2002)

The process of core competencies identification has been incorporated by the enterprises within strategic planning. The virtual enterprise, which is a form of cooperation between enterprises, is one of the most benefited with this new process, mainly in its formation stage. The identified core competencies, which are deployed in products, process and technology, may support a more agile gathering of the virtual enterprise partners. This chapter presents a method to identify core competencies, supported by a practical case of successful virtual enterprise formation, where the method was applied and validated.
Behavior coordination for a mobile visuo-motor system in an augmented real-world environment
Authors: Dimitrij Surmeli, Horst-Michael Gross
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

We utilize HUMPHRYS' W-Learning on a real robot Khepera to coordinate three behaviors in an augmented maze: first, to drive straight and fast while avoiding obstacles, second, to find a location marked by one projected color (e.g., where food can be found), and third, to escape from another color. We describe the experimental setup and compare results of the individual agents to those of a monolithic agent solving all tasks, and of the agents coordinated by different types of W-Learning. We demonstrate the feasibility of W-Learning on a real visuo-motor system and conclude by discussing why the monolith outperforms all forms of coordination investigated.
Predictive Functional Control Based on Fuzzy Model: Comparison with Linear Predictive Functional Control and PID Control
Authors: Marko Lepetič, Igor škrjanc, Héctor G. Chiacchiarini, Drago Matko
Venue: Journal of Intelligent and Robotic Systems (2003)

The implementation of the fuzzy predictive functional control (FPFC) on the magnetic suspension system is presented in the paper. The magnetic suspension system was in our case the pilot plant for magnetic bearing and is an open-loop unstable process, therefore a lead compensator was used to stabilize it. The high quality control requirements were a-periodical step response and zero steady-state error. Adding the integrator to a feedback causes overshoot. The solution to the problem was cascade control with fuzzy predictive functional controller in the outer loop. To cope with the unknown model parameters and the nonlinear nature of the magnetic system, a fuzzy identification based on FNARX model was used. After successful validation the obtained fuzzy model was used for controller design. The FPFC is compared with a cascade linear predictive functional control (PFC) and PID control. The results we obtained with the FPFC are very promising and hardly comparable with conventional control techniques.
Total recall: in-place viewing of captured whiteboard annotations
Authors: Lars Erik Holmquist, Johan Sanneblad, Lalya Gaye
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Total Recall introduces a new way to view captured whiteboard annotations. To digitize drawings we used a modified commercial system. However, instead of displaying the annotations on a separate computer screen, Total Recall shows the annotations at the place on the board where they were actually made. The user holds a hand-held computer to the board and moves it to reveal the desirable portion of the captured annotations. By using ultra-sonic positioning and optimized graphics, we achieve a high frame-rate (30 fps), allowing for very smooth panning and interaction. We argue that this way of viewing captured whiteboard annotations is more natural and intuitive than current desktop-based systems.
Skeletons for parallel image processing: an overview of the SKIPPER project
Authors: Jocelyn Sérot, Dominique Ginhac
Venue: Parallel Computing (2002)

This paper is a general overview of the SKIPPER project, run at Blaise Pascal University between 1996 and 2002. The main goal of the SKIPPER project was to demonstrate the applicability of skeleton-based parallel programming techniques to the fast prototyping of reactive vision applications. This proiect has produced several versions of a full-fledged integrated parallel programming environment (PPE). These PPEs have been used to implement realistic vision applications, such as road following or vehicle tracking for assisted driving, on embedded parallel platforms embarked on semi-autonomous vehicles. All versions of SKIPPER share a common front-end and repertoire of skeletons--presented in previous papers--but differ in the techniques used for implementing skeletons. This paper focuses on these implementation issues, by making a comparative survey, according to a set of four criteria (efficiency, expressivity, portability, predictability), of these implementation techniques. It also gives an account of the lessons we have learned, both when dealing with these implementation issues and when using the resulting tools for prototyping vision applications.
Designing HIV Vaccination Policies: Subtypes and Cross-Immunity
Authors: Travis C. Porco, Sally M. Blower
Venue: Interfaces (1998)

We developed and used mathematical models to assess vaccine programs for controlling two subtypes of HIV, both for developing countries where more than one subtype is present and for countries where only one subtype is present but other subtypes may invade. We began by formulating a model of the intrinsic transmission dynamics of the two HIV subtypes and then extended this model to include the effects of a prophylactic vaccine that provides a degree of protection against infection by one subtype and vaccine-induced cross-immunity against infection by the second subtype. Using these models, we assessed the potential impact of using a prophylactic vaccine when one subtype of HIV is endemic and a second subtype is introduced into the community. In each case, mass vaccination could result in one of four possible outcomes: (1) both subtypes are eradicated, (2) the endemic subtype persists and the invading subtype is eradicated, (3) the endemic subtype is eradicated and the invading subtype persists, or (4) both subtypes coexist.
Material identification by surface reflection analysis in combination with bundle adjustment technique
Authors: A. B. Orun, A. Alkis
Venue: Pattern Recognition Letters (2003)

This work aims to investigate a unified method for surface analysis and remote surface identification. The work includes two independent and simultaneously operating techniques which exploit both the local surface geometry (by bundle adjustment technique) and the microstructure of the material surface (whose image is generated by laser-surface interaction). The unification of these two techniques enables the unambiguous identification of surface type at any orientation.
The power to change is in our hands
Authors: Sarah Leever, Megan Dunigan, Melissa Turner
Venue: Journal of Computing Sciences in Colleges (2002)

While women represent over half of the workforce today, this is not the case for the proportion of women in Information Technology (IT) careers. Women are dropping out of computer-related fields for various reasons such as gender bias and difficulty in balancing work and the home. Although much has been published regarding this current issue, there is a surprising lack of formal research on its causes and remedies. The obstacles that females face start early in the education process and continue into the professional environment. Following a review of many articles, some general problem areas were discovered which could hopefully be used in finding potential remedies for the gender gap in computer science fields.
Administrative assistants as interruption mediators
Authors: Laura A. Dabbish, Ryan S. Baker
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

When designing automated systems that make decisions about when to allow or deny interruptions, the methods of professional interruption mediators are an important source of information. Administrative assistants are, by the nature of their jobs, expert interruption mediators. They make decisions every day about whether to allow interruptions to the person they support. We have conducted a series of interviews with administrative assistants whose ability has been publicly recognized. Based on their responses, we present a production-rule model of the decision process they use when deciding whether to deliver interruptions to the person they support.
Fast unified computation of the multi-dimensional discrete sinusoidal transforms
Authors: L. Z. Cheng, Z. Wang, Z. H. Zhang
Venue: Applied Mathematics and Computation (2002)

Based on a one-to-one index mapping approach, conversions of two types of m- dimensional discrete W transforms into the multiple sums involving a number of one-dimensional discrete W transforms (1-D DWTs) are first presented. A unified fast (m- 1)-dimensional polynomial transform [(m - 1)-D PT] and 1-D DWTs algorithm for computing these two types of m-D DWTs are then proposed. By revealing the relationships among the m-dimensional discrete W transforms (m-D DWTs), the m- dimensional generalized discrete Fourier transforms (m-D GDFTs), the m-dimensional discrete cosine transforms (m-D DCTs), and the m-dimensional discrete sine transforms (m-D DSTs), the generalized fast algorithms for 14 types of the m-D discrete sinusoidal transforms including four types of m-D DWTs and the same number of types of m-D GDFTs, and three types of m-D DCTs and the same number of types of m-D DSTs are presented. The number of multiplications for all 14 types of the m-D discrete sinusoidal transforms needed by the proposed algorithm is only 1/m times that of the widely used corresponding row-column methods. The number of additions required by the proposed algorithm is also reduced considerably. Finally, with the help of the software platform Visual C++ 6.0 for Windows 98, the computation time comparisons between the proposed and the reported algorithms are given. The numerical experiments show that the proposed algorithms are not only highly efficient but are also very simple in computational structure.
Constructing DO loops for non-convex iteration spaces in compiling for parallel machines
Authors: Jingling Xue
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

A need that frequently arises in code generation for shared and distributed memory machines is to scan a region of index points intersected by an integer lattice in their lexicographical order. Methods have been proposed in the special case when the given region is a convex polyhedron. This paper contributes a method in the more general case when the given region is a union of convex polyhedra-a non-convex polyhedron in general. As a secondary contribution, we show the usefulness of this method by presenting its applications in several areas, such as non-singular transformations of nested loops with non-convex iteration spaces, generation of data transfer code for shared memory machines, and generation of SPMD DO loops with communication code for distributed memory machines, where existing methods do not apply. Thus, these various code generation problems can all be unified as one of constructing DO loops to scan a union of convex polyhedra, possibly intersected by a lattice.
Spatial Oligopolistic Electricity Models with Cournot Generators and Regulated Transmission Prices
Authors: Wei Jing-Yuan, Yves Smeers
Venue: Operations Research (1999)

An oligopoly with spatially dispersed generators and consumers and with multi-period demand is modeled in this paper. The producers are assumed to behave in a Cournot manner with regulated transmission prices. A (generali zed) Nash equilibrium is sought. The story of the game is as follows. Each generator takes its rivals' output (generation, supply, and flows) and the prices for transmission services as fixed when it decides upon its output to maximize its profit; the tr ansmission firm takes the quantities of transmission services demanded by the generators as fixed when it determines the transmission prices according to certain regulatory rules. An equilibrium of the model is a set of generation output at which no generator will obtain more profit if it unilaterally modifies its output from this set, and a set of transmission prices satisfying certain regulatory requirements. A variational inequality approach is used for computing the equilibria of the model. Using the same approach, two variants of the model, respectively based on average-cost and marginal-cost pricing for transmission services, are also formulated. This model is applied to simulate a long-run electricity market where transmission prices are regulated.
Optimal price and lot size when the supplier offers a temporary price reduction over an interval
Authors: P. L. Abad
Venue: Computers and Operations Research (2003)

Manufacturers and other suppliers offer temporary reduction in the price charged to resellers for a variety of reasons. Typically the trade promotion lasts for some finite time-span. In addition, in reselling situations, the end demand tends to be sensitive to selling price. Thus, when the trade promotion takes place, there is possibility that not all the quantity purchased by the reseller at discount is passed on to the final consumers at a reduced selling price. Studies to date addressing the above problem situation have assumed that the trade promotion is offered by the supplier only at one point in time. We extend the analysis to the more realistic case where the promotion lasts a finite time interval. We consider two cases: (1) using technology (e.g. point-of-sale systems), the supplier can insure that the discount is applicable to only units resold during the promotion and (2) the discount is applicable to units purchased during the promotion.
Towards mathematical morpho-logics
Authors: Isabelle Bloch, Jérôme Lang
Venue: Technologies for constructing intelligent systems: tools (2002)

In this paper, we suggest a new way to process information represented in a logical framework based on mathematical morphology. We show how the basic morphological operations can be expressed in a logical setting. We give some properties, show some links with revision and fusion, and ideas illustrate possible use of morpho-logics to approximation, reasoning and decision.
File declustering for efficient parallel I/O on networks of workstations
Authors: Hau-Yang Cheng, Chung-Ta King
Venue: Cluster Computing (2001)

This paper presents the issues involved in selecting an appropriate file declustering method to serve various access patterns on distributed parallel computing environments. A good file declustering method for multiple access patterns must (1) maximize the overall local access ratio, (2) minimize the performance variance between the access patterns, and (3) balance disk loads. The variable striping file declustering (VSFD) method is proposed for optimizing the file allocation in the I/O nodes with multiple access patterns and can increase the local access ratio. In addition, VSFD can provide uniform and consistent performance across different access patterns, because it is able to induce the smallest variance in local disk access ratios for different access patterns.
Efficient solution space exploration based on segment trees in analog placement with symmetry constraints
Authors: Florin Balasa, Sarat C. Maruvada, Karthik Krishnamoorthy
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

The traditional way of approaching devicelevel placement problems for analog layout is to explore a huge search space of absolute placement representations, where cells are allowed to illegally overlap during their moves [2, 7, 8]. This paper presents a novel analog placement technique operating on the set of binary tree representations of the layout [3], where the typical presence of an arbitrary number of symmetry groups of devices is directly taken into account during the exploration of the solution space. The efficiency of the novel approach is due to a data structure called segment tree, mainly used in computational geometry.
Close-Point Spatial Tests and Their Application to Random Number Generators
Authors: Pierre L'Écuyer, Jean-François Cordeau, Richard Simard
Venue: Operations Research (2000)

We study statistical tests of uniformity based on theL p -distances between them nearest pairs of points, forn points generated uniformly over thek-dimensional unit hypercube or unit torus. The number of distinct pairs at distance no more thant, fort = 0, is a stochastic process whose initial part, after an appropriate transformation and asn ? 8, is asymptotically a Poisson process with unit rate. Convergence to this asymptotic is slow in the hypercube as soon ask exceeds 2 or 3, due to edge effects, but is reasonably fast in the torus. We look at the quality of approximation of the exact distributions of the tests statistics by their asymptotic distributions, discuss computational issues, and apply the tests to random number generators. Linear congruential generators fail decisively certain variants of the tests as soon asn approaches the square root of the period length.
Mobile data technologies and small business adoption and diffusion: an empirical study of barriers and and facilitators
Authors: Jeanette Van Akkeren, Debra Harker
Venue: Mobile commerce: technology, theory, and applications (2003)

The technological environment in which contemporary small- and medium-sized enterprises (SMEs) operate can only be described as dynamic. The exponential rate of technological change, characterised by perceived increases in the benefits associated with various technologies, shortening product life cycles and changing standards, provides for the SME a complex and challenging operational context. The primary aim of this research was to identify the needs of SMEs in regional areas for mobile data technologies (MDT).In this study a distinction was drawn between those respondents who were full-adopters of technology, those who were partial-adopters, and those who were non-adopters and these three segments articulated different needs and requirements for MDT. Overall, the needs of regional SMEs for MDT can be conceptualised into three areas where the technology will assist business practices; communication, e-commerce and security.
Information technology fluency at a liberal arts college: experience with implementation and assessment
Authors: John P. Dougherty
Venue: Journal of Computing Sciences in Colleges (2003)

As information technology (IT) tools continue their rapid rate of change, students need to understand concepts as well as acquire current skills at a comparable rate. In other words, they must be fluent with IT. Various approaches have been suggested to increase the degree of IT fluency for undergraduates, particularly noncomputing majors. This paper outlines the goals, motivations and results of extending an existing computing survey course to include the topic of IT fluency explicitly via a case study in economics.
A practical algorithm to find the best subsequence patterns
Authors: Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
Venue: Theoretical Computer Science (2003)

Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. We regard it to find a subsequence pattern which separates these two sets. The problem is known to be NP-complete. We naturally generalize it to an optimization problem, where we try to find a subsequence pattern which maximally separates these two sets. We provide a practical algorithm to solve it exactly. Our algorithm uses two pruning heuristics based on the properties of subsequence languages, and utilizes the data structure called subsequence automata. We report some experimental results, which show these heuristics and the data structure contribute to reduce the search time.
Requirements Driven Quality Control
Authors: Stanislaw Szejko
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

The paper aims at presenting a method of controlling software quality attributes driven by the set of requirements. This is done in three steps: specifying all the requirements, mapping them to quality attributes and controlling the development process against the demanded quality. The steps adapt and integrate well-known patterns of requirements specification and weighting, evaluation of the software demanded quality, and measuring the development process.A supporting prototype tool and the relatred example of a distributed application assist in requirements specification and their mapping to quality characteristics, while the latter step is discussed in draft. Some further research problems and questions are shown.