Search

Showing total 4 results
Start Over Topic computer communication networks
4 results

1. Organizational status of quality assurance and end-user perceptions of information technology for information management.

Author

Pendharkar PC, Rodger JA, Paper DJ, and Burky LB

Subjects
Data Interpretation, Statistical, Documentation, Health Facilities standards, Health Facility Administration, New England, Regression Analysis, Research Design, Attitude of Health Personnel, Computer Communication Networks statistics & numerical data, Health Care Sector standards, Information Management statistics & numerical data, Quality Assurance, Health Care organization & administration
Abstract

This article investigates the relationship between quality assurance (QA) and perceptions of the importance of information technology (IT) for information management in the health care industry. This issue is important because effective information management is recognized as a necessary condition for quality management. The unit of analysis of the article is the health care functional department. Data from 34 health care departments were collected and used for the analysis. Four specific hypotheses were proposed and tested. Our results suggest that end-user perceptions of the importance of IT for information management depends on formalization of QA, perceived importance of QA, time since QA was embraced, and number of people in the QA function.

Published
2000

2. Organizational status of quality assurance and end-user perceptions of information technology for information management

Author

P C, Pendharkar, J A, Rodger, D J, Paper, and L B, Burky

Subjects
Computer Communication Networks, Quality Assurance, Health Care, Attitude of Health Personnel, Information Management, New England, Research Design, Data Interpretation, Statistical, Health Care Sector, Regression Analysis, Documentation, Health Facilities, Health Facility Administration
Abstract

This article investigates the relationship between quality assurance (QA) and perceptions of the importance of information technology (IT) for information management in the health care industry. This issue is important because effective information management is recognized as a necessary condition for quality management. The unit of analysis of the article is the health care functional department. Data from 34 health care departments were collected and used for the analysis. Four specific hypotheses were proposed and tested. Our results suggest that end-user perceptions of the importance of IT for information management depends on formalization of QA, perceived importance of QA, time since QA was embraced, and number of people in the QA function.

Published
2000

3. Analyzing the exhaustiveness of the synapse protocol

Author

Vincenzo Ciancaglini, Zoran Ognjanović, Bojan Marinković, Paola Glavan, Luigi Liquori, Petar Maksimovic, Mathematical Institute of the Serbian Academy of Sciences and Arts, Serbian Academy of Sciences and Arts (SASA), Logical Networks: Self-organizing Overlay Networks and Programmable Overlay Computing Systems (LOGNET), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), University of Zagreb, and The work presented in this paper was supported by the Serbian Ministry of Education, Science and Technological Development, projects ON174026 and III44006, through Matematicki Institut SANU and by Ministarstvo znanosti, obrazovanja i sporta republike Hrvatske.

Subjects
Theoretical computer science, Computer Networks and Communications, Computer science, Distributed computing, Overlay network, 0102 computer and information sciences, 02 engineering and technology, Peer-to-peer, computer.software_genre, 01 natural sciences, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], Synapse, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0202 electrical engineering, electronic engineering, information engineering, Abstract State Machines, Protocol (object-oriented programming), Computer communication networks, Retrieval probability, Formal description, Quantitative Biology::Neurons and Cognition, DASM, Peer-to-Peer Protocols, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], DHT-based overlay networks, 010201 computation theory & mathematics, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.2: Network Protocols, Scalability, Abstract state machines, 020201 artificial intelligence & image processing, computer, Software
Abstract

International audience; The Synapse protocol is a scalable protocol designed for information retrieval over inter-connected heterogeneous overlay networks. In this paper, we give a formal description of Synapse using the Abstract State Machines framework. The formal description pertains to Synapse actions that manipulate distributed keys. Based on this formal description, we present results concerning the expected exhaustiveness for a number of scenarios and systems maintained by the Synapse protocol, and provide comparisons to the results of the corresponding simulations and experiments. We show that the predicted theoretical results match the obtained experimental results, and give recommendations on the design of systems using Synapse.

Published
2015

4. Distributed Computing with Advice: Information Sensitivity of Graph Coloring

Author

Andrzej Pelc, Cyril Gavoille, Pierre Fraigniaud, David Ilcinkas, Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Algorithmics for computationally intensive applications over wide scale distributed platforms (CEPAGE), Université Sciences et Technologies - Bordeaux 1-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Département d'Informatique et d'Ingénierie (DII), Université du Québec en Outaouais (UQO), See paper for details., ANR-07-BLAN-0322,ALADDIN,Algorithm Design and Analysis for Implicitly and Incompletely Defined Interaction Networks(2007), Andrzej Pelc was supported in part by NSERC discovery grant and by the Research Chair in Distributed Computing of the Université du Québec en Outaouais., Lars Arge, Christian Cachin, Tomasz Jurdzinski, Andrzej Tarlecki, Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), and Université Sciences et Technologies - Bordeaux 1 (UB)-Inria Bordeaux - Sud-Ouest

Subjects
Network algorithms, Theoretical computer science, Computer Networks and Communications, Computer science, Distributed computing, Computation, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, network algorithm, 01 natural sciences, Oracle, Theoretical Computer Science, Distributed coloring, Greedy coloring, distributed computing, graph coloring, 0202 electrical engineering, electronic engineering, information engineering, Graph coloring, Advice, Computer communication networks, Information sensitivity, Computational Theory and Mathematics, Hardware and Architecture, 010201 computation theory & mathematics, Theory of computation, Graph (abstract data type), 020201 artificial intelligence & image processing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract

International audience; We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required size of the advice enables to measure the information sensitivity of a network problem. A problem is information sensitive if little advice is enough to solve the problem rapidly (i.e., much faster than in the absence of any advice), whereas it is information insensitive if it requires giving a lot of information to the nodes in order to ensure fast computation of the solution. In this paper, we study the information sensitivity of distributed graph coloring.

Published
2007