ppxscal/embedding_network huggingface dataset:
A Management Strategy of Monitor Data in ICU Based on Data Stream Technology
Authors: Yongsheng Tan, Yibing Wang, Hongyan Li
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

The data produced by such medical monitor devices as ventilators, cardiac monitors in the ICU, arrive in multiple, continuous, rapid, time-varying data streams. Such data can not be stored entirely because of the storage devices limitation and the interference data produced by doctors' or nurses' medical operations and patients' activities. The present ICU systems using a relational database to store and manipulate data only provides the "operator-dependent" way to collect these stream data at fixed time intervals set by doctors. In this way, some important monitor data may be ignored, but some interference data may be collected. So the quality of data management can not meet the needs of doctors' and nurses'. In this paper, after deeply analyzing the features of the stream monitor data in the ICU, we talk about using data stream technology to solve the problem. Before the stream data arriving, doctors will pre-establish some data collecting rules based on patients' illness status such as fixed data collecting time intervals, data alarming range and level, and so on. When the monitor data arriving, they will be analyzed and manipulated by the pre-defining query rules above pre-established. So it can provide a "patient-dependent" way to collect not only the monitor data at fixed time intervals when patients in good condition, but also all the monitor data when they are in critically ill situation. Furthermore, in this paper we also provide a way to deal with the interference data produced by monitor devices. Data stream technology can supply a gap in the management of the stream monitor data which present based on a relational database, and improve the quality of the data management in the ICU.
The move to outsourced IT projects: key risks from the provider perspective
Authors: Hazel Taylor
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

As the number of outsourced IT projects increases, the identification of risks that may impact during project implementation has become increasingly important. There has been extensive research into the risk factors that impact on IT projects, typically focusing on in-house development although, more recently, some researchers have investigated risks for out-sourced projects from the client perspective. The question of the risks involved from the perspective of the outsource provider, however, has received little attention, but is becoming increasingly important with the present trend to outsourced projects. The research reported here describes key risks identified by a group of Hong Kong project managers working for vendor IT firms who offered package implementation solutions both locally and overseas. A number of new risks from the vendor perspective have been identified, which indicate that vendor project managers typically have a broader focus on risks than their in-house counterparts. In addition to risks to the project success itself, vendor project managers must be constantly vigilant for threats to their own firms from competitors and from potential damage to their firm's reputation if the customer is dissatisfied with either the outcomes or the process of the project. The increasing trend towards multinational outsourced projects also adds additional location-specific risks that must be addressed. The findings are of interest to all managers involved in offshore outsourcing projects.
Lazy caching in TLA
Authors: Peter Ladkin, Leslie Lamport, Bryan Olivier, Denis Roegel
Venue: Distributed Computing (1999)

We address the problem, proposed by Gerth, of verifying that a simplified version of the lazy caching algorithm of Afek, Brown, and Merritt is sequentially consistent. We specify the algorithm and sequential consistency in TLA+, a formal specification language based on TLA (the Temporal Logic of Actions). We then describe how to construct and check a formal TLA correctness proof.
Cumulant-based order selection of non-Gaussian autoregressive moving average models: the corner method
Authors: Adnan Al-Smadi
Venue: Signal Processing (2005)

This paper presents a new corner location method to model order selection of an autoregressive moving average (ARMA) model. The criterion is determined in terms of the minimum eigenvalue of the third-order cumulant matrix derived from the observed data sequence. The observed sequence is modeled as the output of an ARMA system that is excited by an unobservable input, and is corrupted by zero-mean Gaussian additive noise. The system is driven by a zero-mean independent and identically distributed (i.i.d.) non-Gaussian sequence. The method is an extension to recent results based on third-order cumulant (TOC) by Al-Smadi and Wilkes. Simulations verify the performance of the proposed method even when the observed signal is heavily corrupted by additive noise. The proposed estimator, via computer simulation, is found to outperform the TOC estimator of Al-Smadi and Wilkes.
Buffer-Architecture Exploration for Routers in a Hierarchical Network-on-Chip
Authors: Heiko Zimmer, Stefan Zink, Thomas Hollstein, Manfred Glesner
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

This paper explores efficient buffer architectures for toplevel mesh routers in HiNoC, a hierarchical Network-on-Chip. Multiple approaches to buffering are discussed and a size-performance comparison of synthesis results is performed. Among the possible buffer architectures, output buffering and middle buffering are examined carefully by evaluating the impact of variations in significant parameters on the router's overall area. This is done by synthesizing a generic design onto a FPGA. Eventually, middle buffering is identified as best buffer architecture and the influence of the aforementioned parameters on the area requirements is formalized.
SRI: description of the JV-FASTUS system used for MUC-5
Authors: Douglas E. Appelt, Jerry R. Hobbs, John Bear, David Israel, Megumi Kameyama, Mabry Tyson
Venue: Proceedings of the 5th conference on Message understanding (1993)

SRI International developed an information extraction system called FASTUS, a permuted acronym standing for "Finite State Automata-based Text Understanding System. The choice of acronym is some-what misleading, however, because FASTUS is a system for information extraction, not text understanding. The former problem is much simpler and more tractable, characterized by a relatively straightforward specification of information to be extracted from the text, only a fraction of which is relevant to the extraction task, and with the author's underlying goals and nuances of meaning of little interest. In contrast, a text understanding task is to recover all of the information in a text, including that which is only implicit in what is actually written. All the richness of natural language becomes fair game, including metaphor, metonymy, discourse structure, and the recognition of the author's underlying intentions, and the full interplay between language and world knowledge becomes central to the task.
Effect of Cognitive Load on Tactor Location Identification in Zero-g
Authors: Anu Bhargava, Michael Scott, Ryan Traylor, Roy Chung, Kimberly Mrozek, Jonathan Wolter, Hong Z. Tan
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

A wearable haptic interface has been developed to impart vibrotactile information to its user with the goal of improving situation awareness. The effectiveness of the haptic interface has been evaluated in three experiments aboard the NASA KC-135A reduced gravity aircraft. During the third flight, subjects identified the locations of tactors embedded in the haptic display in a microgravity environment. We report our results on how cognitive load affects oneýs ability to identify the locations of vibrotactile stimulations in the altered-gravity environment. Cognitive load was manipulated by requiring subjects to be strapped to the floor of the KC-135 (low cognitive-load condition) or allowing them to float freely in microgravity (high cognitive-load condition). It was found that tactor-location identification was more accurate in the low cognitive-load condition than in the high cognitive-load condition. Our results have implications for the design of multimodal user interfaces in general.
Automatic Type-Driven Library Generation for Telescoping Languages
Authors: Arun Chauhan, Cheryl McCosh, Ken Kennedy, Richard Hanson
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Telescoping languages is a strategy to automatically generate highly-optimized domain-specific libraries. The key idea is to create specialized variants of library procedures through extensive offline processing. This paper describes a telescoping system, called ARGen, which generates high-performance Fortran or C libraries from prototype Matlab code for the linear algebra library, ARPACK. ARGen uses variable types to guide procedure specializations on possible calling contexts. ARGen needs to infer Matlab types in order to speculate on the possible variants of library procedures, as well as to generate code. This paper shows that our type-inference system is powerful enough to generate all the variants needed for ARPACK automatically from the Matlab development code. The ideas demonstrated here provide a basis for building a more general telescoping system for Matlab.
Stem: The System Administration Enabler
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

Stem is a system administration "enabler." It is not an administrative tool, but rather a general-purpose development framework that allows an administrator to craft tools to perform a wide variety of tasks in a distributed environment easily and quickly. Many common tasks can be performed with Stem scripts involving a few lines of declarations. Current example applications include log file collating and service load balancing. Using Stem, a non-programmer can craft reliable network software in a few lines of declarations that would require hundreds or thousands of lines of code in a traditional programming language such as C.
Computer Security, Ethics and Society, 1 edition
Authors: George Ledin
Venue:  (2018)

Computer Security, Ethics, and Society is a book designed for computer science, engineering, and information technology majors taking a course in security. With the growing importance of networks and the importance of having secure transfer of data electronically, computer security is becoming increasingly important. This book covers the technical, legal, and ethical issues involved in computer security in a pedagogically sound manner. The author uses many motivating examples and cases, which deal with issues in the real world. In addition to keeping students abreast of important issues, this real world flavor motivates students. Table of contents 1 Introduction 2 Controlling Access Flow 3 Protecting Privacy 4 Dealing with Intrusion 5 Managing Distributed Resources 6 Encouraging Exploration 7 Fostering Responsibility 8 Asserting Ownership
A Human Factors Guide to Computer Speech: Design Criteria for the Effective Implementation of Speech Technology into Computer Applications
Authors: Christopher Cowley, Dylan Jones
Venue: ACM SIGCHI Bulletin (1992)

Recently, computer speech technology has advanced to the point where practical, commercially available speech output devices can be utilized for a variety of applications which take advantage of the unique attributes of language as a communication mode. Such devices, although not approaching the sophistication and flexibility of their human counterparts, allow production and manipulation of intelligible synthesized speech and the storage and display of high-quality digitized utterances. As the technology becomes more widely known and the costs decrease, much wider usage can be anticipated.
A Generic Shape Descriptor using Bezier Curves
Authors: Ferdous Ahmed Sohel, Gour C. Karmakar, Laurence S. Dooley
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Bezier curves are robust tool for a wide array of applications ranging from computer-aided design to calligraphic character outlining and object shape description. In terms of the control point generation process, existing shape descriptor techniques that employ Bezier curves do not distinguish between regions where an object's shape changes rapidly and those where the change is more gradual or flat. This can lead to an erroneous shape description, particularly where there are significantly sharp changes in shape, such as at sharp corners. This paper presents a novel shape description algorithm called a generic shape descriptor using Bezier curves (SDBC) which defines a new strategy for Bezier control point generation by integrating domain specific information about the shape of an object in a particular region. The strategy also includes an improved dynamic fixed length coding scheme for control points. The SDBC framework has been rigorously tested upon a number of arbitrary shapes, and both quantitative and qualitative analyses have confirmed its superior performance in comparison with existing algorithms.
Wire length as a circuit complexity measure
Authors: Robert A. Legenstein, Wolfgang Maass
Venue: Journal of Computer and System Sciences (2005)

We introduce wire length as a salient complexity measure for analyzing the circuit complexity of sensory processing in biological neural systems. This new complexity measure is applied in this paper to two basic computational problems that arise in translation- and scale-invariant pattern recognition, and hence appear to be useful as benchmark problems for sensory processing. We present new circuit design strategies for these benchmark problems that can be implemented within realistic complexity bounds, in particular with linear or almost linear wire length. Finally, we derive some general bounds which provide information about the relationship between new complexity measure wire length and traditional circuit complexity measures.
Kernel density classification and boosting: an L2 analysis
Authors: M. Di Marzio, C. C. Taylor
Venue: Statistics and Computing (2005)

Kernel density estimation is a commonly used approach to classification. However, most of the theoretical results for kernel methods apply to estimation per se and not necessarily to classification. In this paper we show that when estimating the difference between two densities, the optimal smoothing parameters are increasing functions of the sample size of the complementary group, and we provide a small simluation study which examines the relative performance of kernel density methods when the final goal is classification.A relative newcomer to the classification portfolio is "boosting", and this paper proposes an algorithm for boosting kernel density classifiers. We note that boosting is closely linked to a previously proposed method of bias reduction in kernel density estimation and indicate how it will enjoy similar properties for classification. We show that boosting kernel classifiers reduces the bias whilst only slightly increasing the variance, with an overall reduction in error. Numerical examples and simulations are used to illustrate the findings, and we also suggest further areas of research.
Analysis of a Discontinuous Finite Element Method for the Coupled Stokes and Darcy Problems
Authors: Béatrice Riviére
Venue: Journal of Scientific Computing (2005)

The coupled Stokes and Darcy flows problem is solved by the locally conservative discontinuous Galerkin method. Optimal error estimates for the fluid velocity and pressure are derived.
Pragmatic ECAD Data Integration
Authors: G. Kaufman
Venue: ACM SIGDA Newsletter (1990)

Data integration refers to the ability of applications to share data and the ease with which this data is shared. Data integration is one of the fundamental missing pieces of functionality in ECAD systems created with tools from multiple tool vendors. Current systems meet neither the user's nor the tool supplier's needs for sharing data.A data integration solution is composed of five parts: semantics, syntax, storage, translation, and mechanism. There are only a handful of data objects transferred among ECAD applications. The key to obtaining data integration is to develop a data model that is common to all applications for each of these objects.The goals for a data integration architecture are: use one data model, meet tool performance and resource requirements, provide an extensible model and format, accommodate tools from any supplier, provide a single data interface, and permit portability.An ECAD data integration architecture to meet these goals consists of: a system context data model, a data model for each system data object, one format and access method for each object (the canonical form), and a data controller to control access to and translation of the data objects.An initial implementation of this architecture might consist of a system context data model and data models and canonical forms for schematic capture symbols and simulation netlists. In the short term a very simple integration mechanism is acceptable; in the long term an object management facility holds the most promise as a flexible and general integration mechanism.
Characterizing r-perfect codes in direct products of two and three cycles
Authors: Janja Jerebic, Sandi Klavžar, Simon Špacapan
Venue: Information Processing Letters (2005)

An r-perfect code of a graph G = (V, E) is a set C ⊆ V such that the r-balls centered at vertices of C form a partition of V. It is proved that the direct product of Cm and Cn (r ≥ 1, m, n ≥ 2r + 1) contains an r-perfect code if and only if m and n are each a multiple of (r + 1)2 + r2 and that the direct product of Cm, Cn, and Cl (r ≥ 1, m, n, l ≥ 2r + 1) contains an r-perfect code if and only if m, n, and l are each a multiple of r3 + (r + 1)3. The corresponding r-codes are essentially unique. Also, r-perfect codes in C2r × Cn (r ≥ 2, n ≥ 2r) are characterized.
Convergent usability evaluation: a case study from the EIRS project
Authors: Jeff Johnson, Catherine Marshall
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Two non-profit organizations developed a Web application to help monitor U.S. elections: the Election Incident Reporting System (EIRS). The mostly-volunteer team had only four months to develop a workable system. The aggressive schedule, limited budget, and distributed team-structure challenged us to find creative ways to evaluate and improve EIRS' usability. We used an approach that combined expert UI review with opportunistic exploitation of venues for gathering data on EIRS' usability. This approach, which we call convergent usability evaluation, had, in the non-profit environment, advantages over the more formal methods typically used for commercial projects. In this paper we describe the usability evaluation methods we used for the EIRS project and discuss how they converged to provide a more complete picture than we would have obtained by conventional methods.
Complexity and Reducibility of the Skip Delivery Problem
Authors: C. Archetti, R. Mansini, M. G. Speranza
Venue: Transportation Science (2005)

In the skip delivery problem (SDP), a fleet of vehicles must deliver skips to a set of customers. Each vehicle has a maximum capacity of two skips, and has to start and end its tour at a central depot. The demand of each customer can be greater than the capacity of the vehicles. The objective is to minimize the cost of the total distance traveled by the vehicles to serve all the customers. We show that the SDP is solvable in polynomial time, while its generalization to the case where all vehicles have a capacity greater than two, known as the split delivery vehicle routing problem (SDVRP), is shown to be NP-hard, even under restricted conditions on the costs. We also show that, if the costs are symmetrical and satisfy the triangle inequality, the SDP is reducible in polynomial time to a problem of possibly smaller size, where each customer has unitary demand. This property allows a remarkable simplification of the problem.
European AISB summer school on knowledge systems
Authors: Keith Oatley
Venue: Issue 43 (December 1973) (1973)

A most successful meeting was held by the Study Group on Artificial Intelligence and Simulation of Behavior at Oxford University this summer. It took the form of a number of Britain's more distinguished workers in AI, Dr. M. B. Clowes, Mr. P. Hayes, Professor H. C. Longuet-Higgins, Mr. A. Mackworth, and Professor D. Michie each giving a series of lectures and leading discussions on the problems of how human and artificial intelligence organize and use knowledge.
Learning to Estimate Human Pose with Data Driven Belief Propagation
Authors: Gang Hua, Ming-Hsuan Yang, Ying Wu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We propose a statistical formulation for 2-D human pose estimation from single images. The human body configuration is modeled by a Markov network and the estimation problem is to infer pose parameters from image cues such as appearance, shape, edge, and color. From a set of hand labeled images, we accumulate prior knowledge of 2-D body shapes by learning their low-dimensional representations for inference of pose parameters. A data driven belief propagation Monte Carlo algorithm, utilizing importance sampling functions built from bottom-up visual cues, is proposed for efficient probabilistic inference. Contrasted to the few sequential statistical formulations in the literature, our algorithm integrates both top-down as well as bottom-up reasoning mechanisms, and can carry out the inference tasks in parallel. Experimental results demonstrate the potency and effectiveness of the proposed algorithm in estimating 2-D human pose from single images.
Morphological Erosions and Openings: Fast Algorithms Based on Anchors
Authors: M. Droogenbroeck, M. J. Buckley
Venue: Journal of Mathematical Imaging and Vision (2005)

Several efficient algorithms for computing erosions and openings have been proposed recently. They improve on van Herk's algorithm in terms of number of comparisons for large structuring elements. In this paper we introduce a theoretical framework of anchors that aims at a better understanding of the process involved in the computation of erosions and openings. It is shown that the knowledge of opening anchors of a signal f is sufficient to perform both the erosion and the opening of f.Then we propose an algorithm for one-dimensional erosions and openings which exploits opening anchors. This algorithm improves on the fastest algorithms available in literature by approximately 30% in terms of computation speed, for a range of structuring element sizes and image contents.
Fuzzy Weighted Average Filtering for Mixture Noises
Authors: Qing Xu, Liang Ma, Mingchu Li, Wei Wang, Jing Cai, Roberto Brunelli, Sterfano Messelodi
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Classic nonlinear filter does well for suppressing impulse noise and edge preserving. However, classic nonlinear filtering is not good at reducing the mixture of Gaussian noise and impulse noise. In this paper, we investigate nonlinear filtering techniques to eliminate the mixture of impulse noise and Gaussian noise. Based on fuzzy theory, we present a weighted average filter by making use of the fuzzy membership functions to optimize the weights of the filter. Computational results, which have been obtained from experiments for noise attenuation, indicate that the new algorithm is promising.