Abstract
Quantum annealing provides a method to solve combinatorial optimization problems in complex energy landscapes by exploiting thermal fluctuations that exist in a physical system. This work introduces the mapping of a graph coloring problem based on pseudo-Boolean constraints to a working graph of the D-Wave Systems Inc. We start from the problem formulated as a set of constraints represented in propositional logic. We use the SATyrus approach to transform this set of constraints to an energy minimization problem. We convert the formulation to a quadratic unconstrained binary optimization problem (QUBO), applying polynomial reduction when needed, and solve the problem using different approaches: (a) classical QUBO using simulated annealing in a von Neumann machine; (b) QUBO in a simulated quantum environment; (c) actual quantum 1, QUBO using the D-Wave quantum machine and reducing polynomial degree using a D-Wave library; and (d) actual quantum 2, QUBO using the D-Wave quantum machine and reducing polynomial degree using our own implementation. We study how the implementations using these approaches vary in terms of the impact on the number of solutions found (a) when varying the penalties associated with the constraints and (b) when varying the annealing approach, simulated (SA) versus quantum (QA). Results show that both SA and QA produce good heuristics for this specific problem, although we found more solutions through the QA approach.

Abstract

Abstract
One important problem in Bioinformatics is the discovery of new interactions between cellular lines and chemical compounds. In silico methods for cell-line screening are fundamental to optimize cost and time in the drug discovery processes. In order to build these methods, we need to computationally represent cell lines. Current methods for modeling cell line interactions rely on comparing genetic expression profiles. However, these profiles are usually unknown. In this work, we present a method to characterize and represent cell lines by text processing the related scientific literature. We collect abstracts of scientific papers about cellular lines from Cellosaurus and PubMed. These documents are then represented as TF-IDF vectors. We build a data set for classification with the document vectors having the cell line identifier as the target class. We then apply a multiclass SVM classification method. We use Support Vector Domain Description to describe and characterize each cell line with its corresponding hyperplane obtained with a one-vs-rest training. We evaluated several configurations of classifiers, using micro-averaged precision as metric to choose the best classifier, and were able to differentiate cellular lines from a set of 200+.

Abstract

Abstract
The proliferation of electronic health (e-Health) initiatives in Brazil over the last 2 decades has resulted in a considerable fragmentation within health information technology (IT), with a strong political interference. The problem regarding this issue became twofold: 1) there are considerable flaws regarding interoperability and security involving patient data; and 2) it is difficult even for an experienced company to enter the Brazilian health IT market. In this article, the authors aim to assess the current state of IT interoperability and security in hospitals in Brazil and evaluate the best business strategy for an IT company to enter this difficult but very promising health IT market. A face-to-face questionnaire was conducted among 11 hospital units to assess their current status regarding IT interoperability and security aspects. Global Brazilian socio-economic data was also collected, and helped to not only identify areas of investment regarding health IT security and interoperability, but also to derive a business strategy, composed out of recommendations listed in the paper.

Abstract
Complex data management on healthcare institutions makes very hard to identify illegitimate accesses which is a serious issue. We propose to develop a system to detect accesses with suspicious behavior for further investigation. We modeled use cases (UC) and sequence diagrams (SD) showing the data flow between users and systems. The algorithms represented by activity diagrams apply rules based on professionals' routines, use data from an audit trail (AT) and classify accesses as suspicious or normal. The algorithms were evaluated between 23rd and 31st July 2019. The results were analyzed using absolute and relative frequencies and dispersion measures. Access classification was in accordance to rules applied. "Check time of activity" UC had 64,78% of suspicious classifications, being 55% of activity period shorter and 9,78% longer than expected, "Check days of activity" presented 2,27% of suspicious access and "EHR read access" 79%, the highest percentage of suspicious accesses. The results show the first picture of HIS accesses. Deeper analysis to evaluate algorithms sensibility and specificity should be done. Lack of more detailed information about professionals' routines and systems. and low quality of systems logs are some limitations. Although we believe this is an important step in this field.