ppxscal/embedding_network huggingface dataset:
Patient Safety-Related Information Technology Utilization in Urban and Rural Hospitals
Authors: Robert G. Brooks, Nir Menachemi, Darrell Burke, Art Clawson
Venue: Journal of Medical Systems (2005)

Ongoing research has linked certain information technology applications to reduction of medical errors and improved patient outcomes. The purpose of this study was to assess both the use of patient safety-related information technologies (PSIT) in urban and rural hospitals, as well as the organizational factors which may be linked to overall PSIT adoption. Florida's 199 acute care hospitals (170 urban; 29 rural) were surveyed regarding their utilization of PSIT. Of the 10 technologies studied, rural hospitals averaged 30% utilization compared to 48% for urban hospitals. Individual PSIT applications such as pharmacy-based systems, clinical decision support systems, and outcomes and quality management tools were all more likely to be present in urban hospitals. Hospital bed size (less than 100 beds), tax status (not-for-profit vs. for-profit), and system-affiliation appeared to be related to overall PSIT utilization. These findings are valuable for those interested in the current status of hospital PSIT and set the stage for further studies relating these applications to clinical outcomes in urban and rural hospitals.
Protocols for processes: programming in the large for open systems
Authors: Munindar P. Singh, Amit K. Chopra, Nirmit Desai, Ashok U. Mallya
Venue: ACM SIGPLAN Notices (2004)

The modeling and enactment of business processes is being recognized as key to modern information managment. The expansion of Web services has increased the attention given to processes, because processes are how services are composed and put to good use. However, current approaches are inadequate for flexibly modeling and enacting processes. These approaches take a logically centralized view of processes, treating a process as an implementation of a composed service. They provide low-level scripting languages to specify how a service may be implemented, rather than what interactions are expected from it. Consequently, existing approaches fail to adequately accommodate the essential properties of the business partners in a process (the partners would be realized via services)---their autonomy (freedom of action), heterogeneity (freedom of design), and dynamism (freedom of configuration).Flexibly represented protocols can provide a more natural basis for specifying processes. Protocols specify what rather than how; thus they naturally maximize the authonomy, heterogeneity, and dynamism of the interacting parties. We are developing an approach for modeling and enacting business processes based on protocols. This paper describes some elements of (1) a conceptual model of processes that will incorporate abstractions based on protocols, roles, and commitments; (2)the semantics or mathematical foundations underlying the conceptual model and mapping global views of processes to the local actions of the parties involved; (3) methodologies involving rule-based reasoning to specify processes in terms of compositions of protocols.
Q'tron Neural Networks for Constraint Satisfaction
Authors: Tai-Wen Yue, Mei-Ching Chen
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

This paper proposes the methods to solve the constraint satisfaction problems (CSPs) using Q'tron neural networks (NNs). A Q'tron NN is local-minima free if it is built as a known-energy system and is incorporated with the proposed persistent noise-injection mechanism. The so-built Q'tron NN, as a result, will settle down if and only if a feasible solution is found. Additionally, such a Q'tron NN is intrinsically auto-reversible. This renders the NN operable in a question-answering mode for extracting interested information. A concrete example, i.e., to solve the N-queen problem, will be demonstrated to highlight the main concept.
Sharp asymptotics of the metric entropy for ellipsoids
Authors: Siegfried Graf, Harald Luschgy
Venue: Journal of Complexity (2004)

The sharp asymptotics for the (metric) entropy numbers of large ellipsoids in a Hilbert space is derived. The condition imposed is slow variation of the lengths of the semi-axes.
Learning domain ontologies for Web service descriptions: an experiment in bioinformatics
Authors: Marta Sabou, Chris Wroe, Carole Goble, Gilad Mishne
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

The reasoning tasks that can be performed with semantic web service descriptions depend on the quality of the domain ontologies used to create these descriptions. However, building such domain ontologies is a time consuming and difficult task.We describe an automatic extraction method that learns domain ontologies for web service descriptions from textual documentations attached to web services. We conducted our experiments in the field of bioinformatics by learning an ontology from the documentation of the web services used in myGrid, a project that supports biology experiments on the Grid. Based on the evaluation of the extracted ontology in the context of the project, we conclude that the proposed extraction method is a helpful tool to support the process of building domain ontologies for web service descriptions.
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
Authors: Mikhail Alekhnovich, Sanjeev Arora, Iannis Tourlakis
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

Lovász and Schrijver described a generic method of tightening the LP and SDP relaxation for any 0-1 optimization problem. These tightened relaxations were the basis of several celebrated approximation algorithms (such as for max-cu , max-3sat, and sparsest cut).We prove strong inapproximability results in this model for well-known problems such as max-3sat, hypergraph vertex cover and set cover. We show that the relaxations produced by as many as Ω(n) rounds of the LS+ procedure do not allow nontrivial approximation, thus ruling out the possibility that the LS+ approach gives even slightly subexponential approximation algorithms for these problems.We also point out why our results are somewhat incomparable to known inapproximability results proved using PCPs, and formalize several interesting open questions.
Benchmark Measurements of Current UPC Platforms
Authors: Zhang Zhang, Steven Seidel
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16 (2005)

UPC is a parallel programming language based on the concept of partitioned shared memory. There are now several UPC compilers available and several different parallel architectures that support one or more of these compilers. This paper is the first to compare the performance of most of the currently available UPC implementations on several commonly used parallel platforms. These compilers are the GASNet UPC compiler from UC Berkeley, the v1.1 MuPC compiler from Michigan Tech, the Hewlet-Packard v2.2 compiler, and the Intrepid UPC compiler. The parallel architectures used in this study are a 16-node x86 Myrinet cluster, a 32-processor AlphaServer SC-40, and a 48-processor Cray T3E. A STREAM-like microbenchmark was developed to measure fine- and course-grained shared memory accesses. Also measured are five NPB kernels using existing UPC implementations. These measurements and associated observations provide a snapshot of the relative performance of current UPC platforms.
Proceedings of the 1st annual conference on Information security curriculum development
Venue: Information security curriculum development (2004)

I am delighted to welcome you to the first annual Information Security Curriculum Development Conference. InfoSecCD 2004 was designed to be one of the first major forums for the presentation of research and pedagogical experience on the issues associated with the development and conduct of Information Security curriculum in higher education in the Southeast. As such the mission of the conference is to share novel instructional methods and techniques, pedagogical research findings, curriculum models and methods, and to identify new directions for future research and development work in Information Security education. The conference provides both a venue to discuss these pedagogical issues, and professional development opportunities, through presentations from industry professionals.The conference is unique in its approach to both share the unique ideas of innovative information security professionals, and provide professional development opportunities through presentations of both academic and industry professionals. The ideas of the panelists should also provide additional insight into the complex nature of designing and conducting information security curriculum. With the addition of the Student Poster presentation, the conference provides value to the student and teacher alike.Kennesaw State University is proud to sponsor this conference, as a joint collaboration between the Center for Information Security Education, the Department of Computer Science and Information Systems and the College of Science and Mathematics.
Shape Perception with Friction Model for Indirect Touch
Authors: Yoshihiro Kuroda, Megumi Nakao, Tomohiro Kuroda, Hiroshi Oyama, Hiroyuki Yoshihara
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The purpose of this paper is to study shape perception in the situation where the target object is interfered by other objects. This paper proposes a friction model that updates shear stiffness function of objects, in order to produce physics-based friction force in the situation of indirect touch. The result of experiments indicated that friction force influenced accuracy of indirect perception of convex shape.
A computational module for spontaneous discourse: UCSD
Authors: Rachel Reichman
Venue: Issue 79 (January 1982) (1982)

Having recently joined the computer science faculty at UCSD, I shall be continuing my work on spontaneous discourse first started a number of years ago while I was at BBN. In this abstract, I review this past work and briefly describe some future plans.
An Evaluation of Two Implementation Strategies for Optimizing One-Sided Atomic Reduction
Authors: Jarek Nieplocha, Vinod Tipparaju, Edoardo Apra
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 9 - Volume 10 (2005)

One-sided atomic reduction, also known as the accumulate operation, combines atomically a content of the local buffer with data at remote memory location. This operation has been included in the MPI-2 standard a, MPI_Accumulate. The current paper discusses two strategies for implementing one-sided atomic reduction called owner-computes and callercomputes. Performance of these two schemes has been investigated on the HP Alphaserver SC45 and HP zx-2600 clusters both equipped with the Quadrics Elan-3 network.
Comparing human and machine performance for natural language information extraction: results for English microelectronics from the MUC-5 evaluation
Authors: Craig A. Will
Venue: Proceedings of the 5th conference on Message understanding (1993)

In evaluating the state of technology for extracting information from natural language text by machine, it is valuable to compare the performance of machine extraction systems with that achieved by humans performing the same task. The purpose of this paper is to present some results from a comparative study of human and machine performance for one of the information extraction tasks used in the MUC-5/Tipster evaluation that can help assess the maturity and applicability of the technology.
Higher-order split-step Fourier schemes for the generalized nonlinear Schrödinger equation
Authors: G. M. Muslu, H. A. Erbay
Venue: Mathematics and Computers in Simulation (2005)

The generalized nonlinear Schrodinger (GNLS) equation is solved numerically by a split-step Fourier method. The first, second and fourth-order versions of the method are presented. A classical problem concerning the motion of a single solitary wave is used to compare the first, second and fourth-order schemes in terms of the accuracy and the computational cost. This numerical experiment shows that the split-step Fourier method provides highly accurate solutions for the GNLS equation and that the fourth-order scheme is computationally more efficient than the first-order and second-order schemes. Furthermore, two test problems concerning the interaction of two solitary waves and an exact solution that blows up in finite time, respectively, are investigated by using the fourth-order split-step scheme and particular attention is paid to the conserved quantities as an indicator of the accuracy. The question how the present numerical results are related to those obtained in the literature is discussed.
Findex: search result categories help users when document ranking fails
Authors: Mika Käki
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Long web search result lists can be hard to browse. We demonstrated experimentally, in a previous study, the usefulness of a categorization algorithm and filtering interface. However, the nature of interaction in real settings is not known from an experiment in laboratory settings. To address this problem, we provided our categorizing web search user interface to 16 users for a two month period. The interactions with the system were logged and the users' opinions were elicited with two questionnaires. The results show that categories are successfully used as part of users' search habits. They are helpful when the result ranking of the search engine fails. In those cases, the users are able to access results that locate far in the rank order list with the categories. Users can also formulate simpler queries and find needed results with the help of the categories. In addition, the categories are beneficial when more than one result is needed like in an exploratory or undirected search task.
Interview with Elisabeth and Eric Freeman: October 17, 2004
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2005)

Elisabeth Freeman is a software developer and digital artist. A strong advocate for women in computing, Elisabeth co-founded The Ada Project (TAP) - an award-winning website for resources for women in computing. In 1995, TAP became an official volunteer project of the ACM Committee on the Status of Women (http://women.acm.org/). Elisabeth led the R&D efforts in digital media at the Walt Disney Internet Group, where she co-invented Motion, a content system that delivers terabytes of video every day to Disney, ESPN, ABC, FamilyFun, and Movies.com users. She holds graduate degrees in computer science from Yale University and Indiana University. Eric Freeman is a computer scientist with a passion for media and software architectures. He directed the Internet broadband and wireless efforts at the Walt Disney Internet Group for four years. He studied computer science with David Gelernter at Yale University and received his Ph.D. in 1997. Eric implemented tuple-space systems on Thinking Machine CM-5s and created some of the first Internet information systems for NASA in the late 80s. Eric and Elisabeth are the coauthors of the new book Head First Design Patterns (O'Reilly, 2004).
GPAC: generic and progressive processing of mobile queries over mobile data
Authors: Mohamed F. Mokbel, Walid G. Aref
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

This paper introduces a new family of Generic and Progressive algorithms (GPAC, for short) for continuous mobile queries over mobile objects. GPAC provides a general skeleton that can be tuned through a set of methods to behave as various continuous queries (e.g., continuous range queries and continuous k-nearest-neighbor queries). GPAC algorithms aim to provide three goals: (1) Online evaluation through an in-memory processing of the incoming mobile data. (2) Progressive evaluation through employing an incremental evaluation paradigm. (3) Fast query response through employing an anticipation paradigm. Query answer is anticipated and is cached in memory to allow for fast evaluation. GPAC algorithms are encapsulated in physical pipelined query operators. GPAC pipelined operators can be combined with traditional query operators in a query execution plan to support a wide variety of continuous queries. Experimental results based on a real implementation inside a prototype streaming database engine show the efficiency of GPAC operators in providing incremental and fast response for continuous queries.
Genetic Algorithm Based Scheduler for Computational Grids
Authors: Mona Aggarwal, Robert D. Kent, Alioune Ngom
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

In the context of highly scalable distributed resource management architectures for grid computing, we present a Genetic Algorithm based scheduler. A scheduler must use the available resources efficiently, while satisfying competing and mutually conflicting goals. The grid workload may consist of multiple jobs, with quality-of-service constraints. A Directed Acyclic Graph (DAG) represents each job, taking into account arbitrary precedence constraints and arbitrary processing time. The scheduler has been designed to be compatible with other tools being developed by our grid research group. We present the design, implementation and test results for such a scheduler in which we minimize make-span, idle time of the available computational resources, turn-around time and the specified deadlines provided by users. The architecture is hierarchical and the scheduler is usable at either the lowest or the higher tiers. It can also be used in both the intra-grid of a large organization and in a research grid consisting of large clusters, connected through a high bandwidth dedicated network.
Test beds for complex systems
Authors: Albert Jones, Abhijit Deshmukh
Venue: Communications of the ACM (2005)

Global competition requires major manufacturers to increase productivity, quality, and responsiveness while simultaneously decreasing costs and time to market. To achieve these seemingly conflicting requirements, many manufacturers have expanded the outsourcing trends that began in the late 1980s. Now, design, engineering, logistics, as well as production, are outsourced to companies located all over the world.
Authenticated Encryption Schemes with Message Linkage for Threshold Signatures
Authors: Chi-Hsiung Huang, Chia-Yin Lee, Chu-Hsing Lin, Chin-Chen Chang, Kuo-Lun Chen
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Based on the factorization problem, a modified (t, n) threshold group-oriented scheme with message recovery is proposed. In the proposed scheme, any combination of more than t members of the group can cooperate to generate the modified group secret key. By using the proposed scheme, the transmission of the signature will be secure. Besides, the message linkage blocks which are removed by an eavesdropper can be detected.
Minimum power configuration in wireless sensor networks
Authors: Guoliang Xing, Chenyang Lu, Ying Zhang, Qingfeng Huang, Robert Pless
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

This paper proposes the minimum power configuration (MPC) approach to energy conservation in wireless sensor networks. In sharp contrast to earlier research that treats topology control, power-aware routing, and sleep management in isolation, MPC integrates them as a joint optimization problem in which the power configuration of a network consists of a set of active nodes and the transmission powers of the nodes. We show through analysis that the minimum power configuration of a network is inherently dependent on the data rates of sources. We propose several approximation algorithms with provable performance bounds compared to the optimal solution, and a practical Minimum Power Configuration Protocol (MPCP) that can dynamically (re)configure a network to minimize the energy consumption based on current data rates. Simulations based on realistic radio models of the Mica2 motes show that MPCP can conserve significantly more energy than existing minimum power routing and topology control protocols.
Integration of Security Parameters in the Service Level Specification to Improve QoS Management of Secure Distributed Multimedia Services
Authors: Sandrine Duflos, Valerie Gay, Brigitte Kervella, Eric Horlait
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

This paper proposes to integrate security parameters into the Service Level Specification (SLS). Integrating those parameters in the QoS part of the Service Level Agreement (SLA) specification is essential in particular for secure multimedia services since the QoS is negotiated when the multimedia service is deployed. Security mechanisms need to be negotiated at that time when sensible multimedia information is exchanged. In this paper we show that including security parameters in the SLA specification improves the negotiation, deployment and use of the secure multimedia service. The parameters this paper proposes to integrate have the advantage to be understandable by both the end-users and service providers.
Alternative form of Dempster's rule for binary variables: Research Articles
Authors: Rajendra P. Srivastava
Venue: International Journal of Intelligent Systems (2005)

This article develops an alternative form of Dempster's rule of combination for binary variables. This alternative form does not only provide a closed form formula for efficient computation but also enables researchers to develop closed form analytical formulas for assessing risks such as information security risk, fraud risk, audit risk, independence risk, and so on involved in assurance services. We demonstrate the usefulness of the alternative form in calculating the overall information security risk and also in developing an analytical model for assessing fraud risk. &copy; 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 789&ndash;797, 2005.
A perfectly matched layer for the Helmholtz equation in a semi-infinite strip
Authors: I. Singer, E. Turkel
Venue: Journal of Computational Physics (2004)

The perfectly matched layer (PML) has become a widespread technique for preventing reflections from far field boundaries for wave propagation problems in both the time dependent and frequency domains. We develop a discretization to solve the Helmholtz equation in an infinite two-dimensional strip. We solve the interior equation using high-order finite differences schemes. The combined Helmholtz-PML problem is then analyzed for the parameters that give the best performance. We show that the use of local high-order methods in the physical domain coupled with a specific second order approximation in the PML yields global high-order accuracy in the physical domain. We discuss the impact of the parameters on the effectiveness of the PML. Numerical results are presented to support the analysis.
Control of spatial motion relative to moving external objects
Authors: I. V. Miroshnik, K. A. Sergeev
Venue: Automation and Remote Control (2005)

Consideration was given to the control of spatial motion of dynamic (mechanical) systems with the desired trajectory defined in the coordinate system of an external moving object. New problem-oriented models of the trajectory motion and nonlinear control algorithms that are based on the differential-geometrical methods of the theory of nonlinear multivariable systems and intended to stabilize the system relative to the nonstationary trajectory were obtained.