Search results for "Operations"

Telemedicine the role of the patient-doctor relationship

The aim of this work is to study whether and how the characteristics of the existing relationship between a patient and her/his doctor impact the patient’s propensity to switch to telemedicine. We build a conceptual model which hypothesizes a direct effect of the patient-doctor relationship on the propensity to telemedicine, with the perceived efficacy of the healthcare service as the mediator. To collect data, we used the survey methodology. The results confirm the hypothesis about the positive effects of both a good patient-doctor relationship and the patients’ perceived value on the patients’ propensity to switch to telemedicine.

Satisfaction with and reliability of in-hospital video-EEG monitoring systems in epilepsy diagnosis – A German multicenter experience

2021

OBJECTIVE: To analyze satisfaction with and reliability of video-electroencephalography-monitoring systems (VEMS) in epilepsy diagnostics.; METHODS: A survey was conducted between December 2020 and January 2021 among German epilepsy centers using well-established customer satisfaction (CS) and quality assurance metrics.; RESULTS: Among 16 participating centers, CS with VEMS was low, with only 13% of customers actively recommending their system. Only 50% of users were satisfied with the overall performance of their VEMS, and a low 18% were satisfied with the manufacturer's customer service. User interface, software stability, lack of regular updates, and missing customer-oriented improvement…

Graph-based exploration and clustering analysis of semantic spaces

2019

Abstract The goal of this study is to demonstrate how network science and graph theory tools and concepts can be effectively used for exploring and comparing semantic spaces of word embeddings and lexical databases. Specifically, we construct semantic networks based on word2vec representation of words, which is “learnt” from large text corpora (Google news, Amazon reviews), and “human built” word networks derived from the well-known lexical databases: WordNet and Moby Thesaurus. We compare “global” (e.g., degrees, distances, clustering coefficients) and “local” (e.g., most central nodes and community-type dense clusters) characteristics of considered networks. Our observations suggest that …

Globalization and its impact on operational decisions

2009

PurposeThis paper aims to analyse the impact of globalization on the manufacturing operations of industries and industrial districts and how it influences the specialization and diversification of manufacturing decisions.Design/methodology/approachThe sample includes 9,684 Spanish manufacturing textile firms and the analysis is both cross‐sectional and longitudinal.FindingsThe results show that globalization tends to diminish the district and subsector effects over time, but they also show the positive impact of specialization on productivity and of diversification on business growth.Originality/valueThe paper indicates to managers that the production function in textile firms has viability…

Senti chi parla. Su un aspetto dell’attività di parola a partire da Lacan.

2017

Underlying Simple Graphs

2019

Summary In this article the notion of the underlying simple graph of a graph (as defined in [8]) is formalized in the Mizar system [5], along with some convenient variants. The property of a graph to be without decorators (as introduced in [7]) is formalized as well to serve as the base of graph enumerations in the future.

Tabu search for the dynamic Bipartite Drawing Problem

2018

Abstract Drawings of graphs have many applications and they are nowadays well-established tools in computer science in general, and optimization in particular. Project scheduling is one of the many areas in which representation of graphs constitutes an important instrument. The experience shows that the main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion to achieve it. Incremental or dynamic graph drawing is an emerging topic in this context, where we seek to preserve the layout of a graph over successive drawings. In this paper, we target the edge crossing reduction in the context of incremental graph drawing. Specifically…

Heuristics for the Constrained Incremental Graph Drawing Problem

2019

Abstract Visualization of information is a relevant topic in Computer Science, where graphs have become a standard representation model, and graph drawing is now a well-established area. Within this context, edge crossing minimization is a widely studied problem given its importance in obtaining readable representations of graphs. In this paper, we focus on the so-called incremental graph drawing problem, in which we try to preserve the user’s mental map when obtaining successive drawings of the same graph. In particular, we minimize the number of edge crossings while satisfying some constraints required to preserve the position of vertices with respect to previous drawings. We propose heur…

Convex semi-infinite games

1986

This paper introduces a generalization of semi-infinite games. The pure strategies for player I involve choosing one function from an infinite family of convex functions, while the set of mixed strategies for player II is a closed convex setC inRn. The minimax theorem applies under a condition which limits the directions of recession ofC. Player II always has optimal strategies. These are shown to exist for player I also if a certain infinite system verifies the property of Farkas-Minkowski. The paper also studies certain conditions that guarantee the finiteness of the value of the game and the existence of optimal pure strategies for player I.

Identification of efficient equilibria in multiproduct trading with indivisibilities and non-monotonicity

2018

Abstract This paper focuses on multiproduct trading with indivisibilities and where a representative agent may have non-monotonic preferences. In this framework, the set of firms’ profits (which comes from efficient subgame perfect Nash equilibria) is the Pareto frontier of some projection of the core of the game. We show that under monotonicity efficient subgame perfect Nash equilibria are achieved by single offers and the equilibrium characterization is easy to obtain. When dealing with non-monotonic preferences the problem becomes more challenging. Then, we define a pair of primal–dual linear programming problems that fully identifies the core of the game. A set of modified versions of t…