ppxscal/embedding_network huggingface dataset:
Adoption-related Aspects of an Information System in a Health Care Setting
Authors: Marianne C. Maass, Reima Suomi
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

Objective. The goal of this paper is to highlight some health care related issues with regard to Information Systems implementations. This case study is connected to the adoption of a Picture Archiving and Communication System (PACS) in Turku University Central Hospital. PACS is an Information System, which handles radiological film images in digital form. Benefits, costs and drawbacks are discussed.Methods. The results are based on a four-year survey consisting of statistical data, cost analysis, modelling, customer satisfaction inquiries, time and motion studies, observation and staff interviews.Results and discussion. Less than 1% of the hospital budget was dedicated to theimplementation and adoption. PACS was expected to eliminate the use of film- and paper prints, and introduce a new working environment. After four years of adoption one clinical customer unit shifted to filmless activity, namely the Intensive Care Unit (ICU). Availability of imaging requests, imaging studies and radiology reports was improved to 100% from 87-88%. A staff member was dedicated to the manual transfer of digital images to the wards. Film acquisition costs were not reduced as anticipated. Personnel tasks will reduce only to thedegree to which paper and film prints will be renounced. Also, new tasks will emerge due toPACS.Conclusion. Hospital staff was unprepared for the change. Inexperience regarding informatics, system behaviour, and lack of designated expert personnel slowed down the implementation process. In general there is inexperience regarding digital archiving of medical images, which hinders efficient adoption. Technology providers had not sufficient information or knowledge of clinical requirements. Budgets were not adequate for the build-up of a comprehensive cost-effective system. PACS did not overcome any of those concerns it was expected, but added new concerns.
Diagnosis oriented test pattern generation
Authors: P. Camurati, A. Lioy, P. Prinetto, M. Sonza Reorda
Venue: Proceedings of the conference on European design automation (1990)

This paper addresses the generation of test patterns having diagnostic properties. Our goal is to produce patterns able not only to detect, but also to distinguish faults in combinational circuits. A general formalization of the problem is first given; a new technique is then introduced to improve the diagnostic capabilities of a traditional ATPG; the experimental results showing its effectiveness are finally presented.
Processing and analysis of dna microarrays
Authors: Ahmed H. Desoky
Venue:  (2003)

Microarray technology is a newly emerging technique that promises revolutionary progress in better health and improved quality of life. This dissertation focuses on the development of a user-friendly and efficient software package (named SmartArray), equipped with existing methods and new methods proposed in this dissertation, that will allow processing and analysis of thousands of genes on microarray images. New methods proposed include a template alignment method using a DAC algorithm, an adaptive threshold algorithm, a wavelet denoising algorithm for background removal, a snake algorithm using minimum SS (Sum of Squares), and a quality of printing method. Novel methods of analysis are proposed for the optimization of microarray applications. SmartArray has three tools: a template alignment tool, a quantification tool, and an analysis tool. The processing and analysis are performed sequentially regardless of the type of microarray images. First, scanned microarray images are corrected in the preprocessing step if they are tilted. Then, circle templates are placed on the spots in microarray images using MCF (Microarray Configuration File) files, and the spots are quantified by user-defined methods. Finally, the gene expression data from a control microarray and a test microarray is compared and analyzed for gene analysis. The analysis results demonstrate that the software package can find many changes in gene expression levels in each subarray and can classify them according to their significance. In addition, the changed genes correspond to visual comparisons through charts of each subarray. The results of analysis of the microarray images are obtained through newly proposed methods, which worked well for our desired goals and tell which genes in a test microarray are significantly up- or downregulated compared to genes in a control microarray.
PI predictive fuzzy controllers for electrical drive speed control: methods and software for stable development
Authors: Radu-Emil Precup, Stefan Preitl, Gabriel Faur
Venue: Computers in Industry (2003)

The paper presents two structures of PI predictive fuzzy controllers (PI-P-FCs) with first- and second-order prediction. The PI-P-FCs are meant for the speed control of electrical drives with variable inertia used in several industrial applications. The new development method for these PI-P-FCs is based on guaranteeing a desired domain for the "phase margin" of the fuzzy control systems (FCSs) with PI-P-FCs when they are considered to be equivalent to the linear control systems with linear (conventional) PI controllers. It is also proposed a stability analysis method for the FCSs with PI-P-FCs employing Popov's hyperstability theory and a discrete-time state space mathematical model of the controlled plant. A software tool for the stability analysis of the FCSs, developed in the Matlab and Simulink environment, is presented.
Mixed scheduling disciplines for network flows
Authors: Hanhua Feng, Vishal Misra
Venue: ACM SIGMETRICS Performance Evaluation Review (2003)

We introduce a novel method to prove that the FBPS discipline has optimal mean sojourn time and mean slowdown ratio for DHR service time distributions in an M/G/1 queue. We then discuss the problems related to FBPS, and propose a new scheduling discipline to overcome these problems.
Energy-Aware Communication and Task Scheduling for Network-on-Chip Architectures under Real-Time Constraints
Authors: Jingcao Hu, Radu Marculescu
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

In this paper, we present a novel Energy-Aware Scheduling (EAS) algorithm which statically schedules both communication transactions and computation tasks onto heterogeneousNetwork-on-Chip (NoC) architectures under real-time constraints. Our algorithm automatically assigns tasks onto different processing elements and then schedules their execution. At the same time, the algorithm also takes into consideration the exact communication delay by scheduling communication transactions in parallel. As the main contribution, we first formulate the problem of concurrent communication and task scheduling for heterogeneous NoC architectures and then propose an efficient heuristic to solve it. Experimental results show that significant energy savings can be achieved by using our energy-aware scheduler while meeting the specified performance constraints. For instance, for a complex multimedia application, 44% energy savings have been observed, on average, compared to the schedules generated by a standard earliest-deadline-first scheduler.
A transition-based strategy for object-oriented software testing
Authors: Issa Traoré
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Though time-to-market has become the primary criterion that drives most current software development projects, quality still remains the key concern of critical software development projects, for which the cost of a single bug may involve serious loss or damages. Meeting the higher quality level required for such kinds of systems may be achieved only by using sound and rigorous test practices. We present in this paper an integrated platform that uses a formalized version of UML statechart as the basis for rigorous testing of object-oriented programs. The platform adapts and integrates systematic test data generation strategies and associated tools for object-oriented program testing.
Believable Cyberpeople: A True Challenge for the Decade
Authors: Daniel Thalmann
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

We define cyberpeople as people represented on thenet using embodiment. These people can be either Avatarsthat are a representation of a real human or completelysynthesized virtual humans or Autonomous VirtualAgents (AVAs). In this paper, we discuss the two kinds ofcyberpeople and show how it will become difficult in thenear future to distinguish Avatars from AVAs. We willdemonstrate with examples how embodied agents becomemore and more intelligent and autonomous.
Validation of code-improving transformations for embeded systems
Authors: Robert van Engelen, David Whalley, Xin Yuan
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Programmers of embeded systems often develop software in assembly code due to inadequate support from compilers and the need to meet critical speed and/or space constraints. Many embeded applications are being used as a component of an increasing number of critical systems. While achieving high performance for these systems is important, ensuring that these systems execute correctly is vital. One portion of this process is to ensure that code-improving transformations applied to a program will not change the program's semantic behavior, which may be jeopardized when transformations are specified manually. This paper describes a general approach for validation of many low-level code-improving transformations made either by a compiler or specified by hand. Initially, we associate a region of the program representation with a code-improving transformation. Afterwards, we calculate the region's effects on the rest of the program before and after the transformation. The transformation is considered valid when the effects before and after the transformation are identical. We implemented an automatic validation system in the vpo compiler. The system is currently able to validate all code-improving transformations in vpo except transformations that affect blocks across loop levels.
Clustering Item Data Sets with Association-Taxonomy Similarity
Authors: Ching-Huang Yun, Kun-Ta Chuang, Ming-Syan Chen
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We explore in this paper the efficient clustering of itemdata. Different from those of the traditional data, the featuresof item data are known to be of high dimensionalityand sparsity. In view of the features of item data, we devisein this paper a novel measurement, called the association-taxonomysimilarity, and utilize this measurement to performthe clustering. With this association-taxonomy similaritymeasurement, we develop an efficient clustering algorithm,called algorithm AT (standing for Association-Taxonomy),for item data. Two validation indexes basedon association and taxonomy properties are also devised toassess the quality of clustering for item data. As validatedby the real dataset, it is shown by our experimental resultsthat algorithm AT devised in this paper significantly outperformsthe prior works in the clustering quality as measuredby the validation indexes, indicating the usefulness ofassociation-taxonomy similarity in item data clustering.
A Core Stateless Bandwidth Broker Architecture for Scalable Support of Guaranteed Services
Authors: Zhenhai Duan, Zhi-Li Zhang, Yiwei Thomas Hou, Lixin Gao
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Abstract--We present a novel bandwidth broker architecture for scalable support of guaranteed services that decouples the QoS control plane from the packet forwarding plane. More specifically, under this architecture, core routers do not maintain any QoS reservation states, whether per-flow or aggregate. Instead, the QoS reservation states are stored at and managed by a bandwidth broker. There are several advantages of such a bandwidth broker architecture. Among others, it avoids the problem of inconsistent QoS states faced by the conventional hop-by-hop, distributed admission control approach. Furthermore, it allows us to design efficient admission control algorithms without incurring any overhead at core routers. The proposed bandwidth broker architecture is designed based on a core stateless virtual time reference system developed recently. This virtual time reference system provides a unifying framework to characterize, in terms of their abilities to support delay guarantees, both the per-hop behaviors of core routers and the end-to-end properties of their concatenation. In this paper, we focus on the design of efficient admission control algorithms under the proposed bandwidth broker architecture. We consider both per-flow end-to-end guaranteed delay services and class-based guaranteed delay services with flow aggregation. Using our bandwidth broker architecture, we demonstrate how admission control can be done on a per domain basis instead of on a ¿hop-by-hop¿ basis. Such an approach may significantly reduce the complexity of the admission control algorithms. In designing class-based admission control algorithms, we investigate the problem of dynamic flow aggregation in providing guaranteed delay services and devise a new apparatus to effectively circumvent this problem. We conduct detailed analyses to provide theoretical underpinning for our schemes as well as to establish their correctness. Simulations are also performed to demonstrate the efficacy of our schemes.
Reverse engineering the Internet
Authors: Neil Spring, David Wetherall, Thomas Anderson
Venue: ACM SIGCOMM Computer Communication Review (2004)

To provide insight into Internet operation and performance, recent efforts have measured various aspects of the Internet, developing and improving measurement tools in the process. In this paper, we argue that these independent advances present the community with a startling opportunity: the collaborative reverse-engineering of the Internet. By this, we mean annotating a map of the Internet with properties such as: client populations, features and workloads; network ownership, capacity, connectivity, geography and routing policies; patterns of loss, congestion, failure and growth; and so forth. This combination of properties it greater than the sum of its parts, and exposes the attributes of network design easily overlooked by simpler, uncorrelated models. We argue that reverse engineering the Internet is feasible based on continuing improvements in measurement techniques, the potential to infer new properties from external measurements, and an accounting of the resources required to complete the process.
Reconstructing Software Architecture for J2EE Web Applications
Authors: Minmin Han, Christine Hofmeister, Robert L. Nord
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

In this paper we describe our approach toreconstructing the software architecture of J2EE webapplications. We use the Siemens Four Views approach,separating the architecture into conceptual, module,execution, and code views. We paid particular attentionto the dependencies in the implementation, which led totwo results. One is the distinction between a traditionalusage dependency and a more superficial "knows"dependency, where one module knows of another by typename but nothing else. Another is the recognition ofimportant but implicit dependencies in web applications,between a client page formatting a request and a moduleinterpreting the request. We make these explicit as"logical interfaces." Using separate views improves ourability to describe these architectures, and we provide ascenario showing how it helps a developer understand theimpact of changes to the application. Although we havenot yet developed tools to automate such areconstruction, this paper provides a critical first step indescribing what should be present in an architecturedescription, and how this information can be deducedfrom the implementation.
Coping with irregular spatio-temporal sampling in sensor networks
Authors: Deepak Ganesan, Sylvia Ratnasamy, Hanbiao Wang, Deborah Estrin
Venue: ACM SIGCOMM Computer Communication Review (2004)

Wireless sensor networks have attracted attention from a diverse set of researchers, due to the unique combination of distributed, resource and data processing constraints. However, until now, the lack of real sensor network deployments have resulted in ad-hoc assumptions on a wide range of issues including topology characteristics and data distribution. As deployments of sensor networks become more widespread [1, 2], many of these assumptions need to be revisited.This paper deals with the fundamental issue of spatio-temporal irregularity in sensor networks We make the case for the existence of such irregular spatio-temporal sampling, and show that it impacts many performance issues in sensor networks. For instance, data aggregation schemes provide inaccurate results, compression efficiency is dramatically reduced, data storage skews storage load among nodes and incurs significantly greater routing overhead. To mitigate the impact of irregularity, we outline a spectrum of solutions. For data aggregation and compression, we propose the use of spatial interpolation of data (first suggested by Ganeriwal et al in [3] and temporal signal segmentation followed by alignment. To reduce the cost of data-centric storage and routing, we propose the use of virtualization, and boundary detection.
Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases
Authors: V. A. Orlov
Venue: Discrete Applied Mathematics (2004)

Algorithmic problems are considered that are related to implementing bounded-deterministic functions by circuits and formulas of the minimum size in automaton bases. The problem of finding the asymptotics of the Shannon function is known to be algorithmically undecidable in the case of complete bases, but the coefficient in the formula for the Shannon function can be found with arbitrary accuracy. In the paper the so called strong algorithmic undecidability of the problem of finding the asymptotics of the Shannon function in the case of functionally complete bases is proved. A basis is called cf-equivalent if the constants in the asymptotic formulas for the Shannon function in the classes of circuits and formulas coincide. The existence of bases that are not cf-equivalent is proved in the case of functionally complete bases. It is proved that the recognition problem for the cf-equivalence of a basis is algorithmically undecidable in the strong sense.
Integrating text planning and linguistic choice without abandoning modularity: the IGEN generator
Authors: Robert Rubinoff
Venue: Computational Linguistics (2000)

Natural language generation is usually divided into separate text planning and linguistic components. This division, though, assumes that the two components can operate independently, which is not always true. The IGEN generator eliminates the need for this assumption; it handles interactions between the components without sacrificing the advantages of modularity. IGEN accomplishes this by means of annotations that its linguistic component places on the structures it builds; these annotations provide an abstract description of the effects of particular linguistic choices, allowing the planner to evaluate these choices without needing any linguistic knowledge. This approach allows IGEN to vary the work done by each component independently, even in cases where the final output depends on interactions between them. In addition, since IGEN explicitly models the effects of linguistic choices, it can gracefully handle situations where the available time or linguistic resources are limited.
From FNS to HEIV: A Link between Two Vision Parameter Estimation Methods
Authors: Wojciech Chojnacki, Michael J. Brooks, Anton van den Hengel, Darren Gawley
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--Problems requiring accurate determination of parameters from image-based quantities arise often in computer vision. Two recent, independently developed frameworks for estimating such parameters are the FNS and HEIV schemes. Here, it is shown that FNS and a core version of HEIV are essentially equivalent, solving a common underlying equation via different means. The analysis is driven by the search for a nondegenerate form of a certain generalized eigenvalue problem and effectively leads to a new derivation of the relevant case of the HEIV algorithm. This work may be seen as an extension of previous efforts to rationalize and interrelate a spectrum of estimators, including the renormalization method of Kanatani and the normalized eight-point method of Hartley.
Faster Shading by Equal Angle Interpolation of Vectors
Authors: Tony Barrera, Anders Hast, Ewert Bengtsson
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

Abstract--In this paper, we show how spherical linear interpolation can be used to produce shading with a quality at least similar to Phong shading at a computational effort in the inner loop that is close to that of the Gouraud method. We show how to use the Chebyshev's recurrence relation in order to compute the shading very efficiently. Furthermore, it can also be used to interpolate vectors in such a way that normalization is not necessary, which will make the interpolation very fast. The somewhat larger setup effort required by this approach can be handled through table look up techniques.
The efficiency of adjusted least squares in the linear functional relationship
Authors: Alexander Kukush, Erich Otto Maschke
Venue: Journal of Multivariate Analysis (2003)

A linear functional errors-in-variables model with unknown slope parameter and Gaussian errors is considered. The measurement error variance is supposed to be known, while the variance of errors in the equation is unknown. In this model a risk bound of asymptotic minimax type for arbitrary estimators is established. The bound lies above that one which was found previously in the case of both variances known. The bound is attained by an adjusted least-squares estimators.
The Many Meanings of Open Source
Authors: Cristina Gacek, Budi Arief
Venue: IEEE Software (2004)

Many software development methodologies are called "open source." However simply stating that a project is open source doesn't precisely describe the approach used to support the project. A multidisciplinary viewpoint can help determine those characteristics that are common to open source projects and those that vary among projects. These characteristics form the basis for a taxonomy of open source projects that's useful for analyzing and setting up projects. They also provide a starting point for understanding what "open source" means.