Efficient Secure Computation for Real-world Settings and Security Models

Secure computation involves multiple parties computing a common function while keeping their inputs private, and is a growing field of cryptography due to its potential for maintaining privacy guarantees in real-world applications. However, current secure computation protocols are not yet efficient enough to be used in practice. We argue that this is due to much of the research effort being focused on generality rather than specificity. Namely, current research tends to focus on constructing and improving protocols for the strongest notions of security or for an arbitrary number of parties. However, in real-world deployments, these security notions are often too strong, or the number of parties running a protocol would be smaller. In this thesis we make several steps towards bridging the efficiency gap of secure computation by focusing on constructing efficient protocols for specific real-world settings and security models. In particular, we make the following four contributions: - We show an efficient (when amortized over multiple runs) maliciously secure two-party secure computation (2PC) protocol in the multiple-execution setting, where the same function is computed multiple times by the same pair of parties. - We improve the efficiency of 2PC protocols in the publicly verifiable covert security model, where a party can cheat with some probability but if it gets caught then the honest party obtains a certificate proving that the given party cheated. - We show how to optimize existing 2PC protocols when the function to be computed includes predicate checks on its inputs. - We demonstrate an efficient maliciously secure protocol in the three-party setting.

Use of flucinolone acetonide for patients with diabetic macular oedema:patient selection criteria and early outcomes in real world setting

Introduction: Fluocinolone acetonide slow release implant (Iluvien®) was approved in December 2013 in UK for treatment of eyes which are pseudophakic with DMO that is unresponsive to other available therapies. This approval was based on evidence from FAME trials which were conducted at a time when ranibizumab was not available. There is a paucity of data on implementation of guidance on selecting patients for this treatment modality and also on the real world outcome of fluocinolone therapy especially in those patients that have been unresponsive to ranibizumab therapy. Method: Retrospective study of consecutive patients treated with fluocinolone between January and August 2014 at three sites were included to evaluate selection criteria used, baseline characteristics and clinical outcomes at 3-month time point. Results: Twenty two pseudophakic eyes of 22 consecutive patients were included. Majority of patients had prior therapy with multiple intravitreal anti-VEGF injections. Four eyes had controlled glaucoma. At baseline mean VA and CRT were 50.7 letters and 631 μm respectively. After 3 months, 18 patients had improved CRT of which 15 of them also had improved VA. No adverse effects were noted. One additional patient required IOP lowering medication. Despite being unresponsive to multiple prior therapies including laser and anti-VEGF injections, switching to fluocinolone achieved treatment benefit. Conclusion: The patient level selection criteria proposed by NICE guidance on fluocinolone appeared to be implemented. This data from this study provides new evidence on early outcomes following fluocinolone therapy in eyes with DMO which had not responded to laser and other intravitreal agents.

Clinical characteristics and selection of treatment modality for patients with vitreomacular traction:real-world implementation of NICE guidance (TA297)

Aim: To investigate the qualitative aspects in patient selection and the quantitative impact of disease burden in real world treatment of vitreomacular traction (VMT) and implementation of the National Institute for Health and Care Excellence (NICE) guidance (TA297). Methods: A monocentric, retrospective review of consecutive patients undergoing optical coherence tomography (OCT) imaging over a 3 month period. Patients with VMT in at least one eye were identified for further data collection on laterality, visual acuity, symptoms, presence of epiretinal membrane, macular hole and treatment selection. Results: A total of 3472 patients underwent OCT imaging with a total of 6878 eyes scanned. Out of 87 patients, 74 patients had unilateral VMT (38 right, 36 left) and 13 patients had bilateral VMT. Eighteen patients with unilateral VMT satisfied NICE criteria of severe sight problems in the affected eye. Eight were managed for a coexisting pathology, one refused treatment, one patient did not attend, two closed spontaneously, and one received ocriplasmin prior to the study start date. Only two patients with unilateral VMT received ocriplasmin and three underwent vitrectomy. Those failing to meet NICE criteria for unilateral VMT were predominantly asymptomatic (n=49) or had coexisting ERM (n=5) or both (n=2). Conclusion: Ocriplasmin provides an alternative treatment for patients with symptomatic VMT. Our data shows that the majority of patients with VMT do not meet NICE TA297 primarily due to lack of symptoms. Those meeting NICE criteria, but not treated, tended to have coexisting macular pathology. Variation in patient selection due to subjective factors not outlined in NICE guidance suggests that real world outcomes of ocriplasmin therapy should be interpreted with caution.

The blue side of diabetes: assessing the impact of depression in people with type 2 diabetes using real-world data

The aim of the thesis is to assess the impact of depression in people with type 2 diabetes. Using Healthcare Utilization Databases, I estimated in a large population-based cohort with type 2 diabetes the incidence of depression over 10 year-period, identified the demographic and clinical predictors of depression, and determined the extent to which depression is a risk factor for acute and long-term complications and mortality. In the context of COVID-19 pandemic, I evaluated whether the presence of a history of depression in type 2 diabetes increased the Emergency Department (ED) access rate for diabetes-related complications, and I investigated changes in the incidence of depression during the first year of the pandemic. Findings from the first study indicated that developing depression was associated with being a woman, being over 65 years, living in rural areas, having insulin as initial diabetes medication and having comorbid conditions; the study also confirmed that depression was associated with an increased risk for acute and long-term diabetes complications and all-cause mortality. The second observational study showed a higher rate of ED access for diabetes-related complications during the pandemic in people with type 2 diabetes and a history of depression than in those without a history of depression, similar to what was observed in a pre-pandemic period. As shown in the third population-based study, the incidence of depression decreased in 2020 compared to 2019, mainly during the first and the second waves of the COVID-19 pandemic, when people probably had difficulty reaching healthcare services. This new real-world evidence will help healthcare professionals identify timely patients at high risk of developing depression. Lastly, policymakers and physicians will benefit from new evidence of the effects of the COVID-19 pandemic on depression in people with type 2 diabetes to ensure a high level of care during crisis periods.

Read-only-memory-based quantum computation: Experimental explorations using nuclear magnetic resonance and future prospects

Read-only-memory-based (ROM-based) quantum computation (QC) is an alternative to oracle-based QC. It has the advantages of being less magical, and being more suited to implementing space-efficient computation (i.e., computation using the minimum number of writable qubits). Here we consider a number of small (one- and two-qubit) quantum algorithms illustrating different aspects of ROM-based QC. They are: (a) a one-qubit algorithm to solve the Deutsch problem; (b) a one-qubit binary multiplication algorithm; (c) a two-qubit controlled binary multiplication algorithm; and (d) a two-qubit ROM-based version of the Deutsch-Jozsa algorithm. For each algorithm we present experimental verification using nuclear magnetic resonance ensemble QC. The average fidelities for the implementation were in the ranges 0.9-0.97 for the one-qubit algorithms, and 0.84-0.94 for the two-qubit algorithms. We conclude with a discussion of future prospects for ROM-based quantum computation. We propose a four-qubit algorithm, using Grover's iterate, for solving a miniature real-world problem relating to the lengths of paths in a network.

Kaivoskoneiden kustannusseurannan ja -raportoinnin kehittäminen

Työn tavoitteena oli kehittää kaivoskoneita valmistavalle yritykselle raportointimalli uusittujen tuotteiden kustannusten seuraamiseksi. Raporttien toivottiin olevan tarvelähtöisiä, sisällöltään luotettavia, vaivattomia päivittää sekä helposti saatavissa. Tutkimuksen toisena tavoitteena oli kartoittaa kohdeyrityksen tuotekohtaisenkustannusseurannan nykytilaa ja sen kehityskohteita. Tutkimuksen aineistoa kerättiin strukturoimattomilla haastatteluilla, yrityksen dokumentteihin tutustumalla, havainnoinnilla, keskusteluilla sekä benchmarking-menetelmällä. Luonteeltaan tutkimus oli konstruktiivinen eli sen tavoitteena oli luoda uusi ratkaisumalliongelmalliseksi koettuun tilanteeseen. Tutkimuksen tuloksena syntyi pitkälle automatisoitu kustannusraportointimalli, joka sisältää kaksi tuotekohtaista kustannusraporttityyppiä. Raportit ovat ns. on-line -raportteja eli käyttäjien on mahdollisuus lukea niitä yrityksen intranetin kautta haluamanaan aikana. Prototyyppiraportit laadittiin erään nykyisen tuoterakenteen mukaisen koneen tiedoilla.Raporttien avulla voidaan tehokkaasti seurata konekohtaisia kustannuksia ja tunnistaa ne tekijät joihin vaikuttamalla voidaan saavuttaa asetetut tavoitekustannukset. Mallissa määriteltiin myös raporttien käyttäjät, jakelu, vastuut ja päivitykset. Todellinen hyöty raportointimallista saadaan siinä vaiheessa, kun sen avulla voidaan seurata uuden tuoterakenteen kustannuksia. Tutkimuksen perusteella annettiin lisäksi suosituksia kohdeyrityksen kustannusseurannan kehittämiseksi tulevaisuudessa.

Anisotropic adaptive resolution of boundary layers for heat conduction problems

We deal with the numerical solution of heat conduction problems featuring steep gradients. In order to solve the associated partial differential equation a finite volume technique is used and unstructured grids are employed. A discrete maximum principle for triangulations of a Delaunay type is developed. To capture thin boundary layers incorporating steep gradients an anisotropic mesh adaptation technique is implemented. Computational tests are performed for an academic problem where the exact solution is known as well as for a real world problem of a computer simulation of the thermoregulation of premature infants.

On intentional and social agents with graded attitudes

La principal contribución de esta Tesis es la propuesta de un modelo de agente BDI graduado (g-BDI) que permita especificar una arquitetura de agente capaz de representar y razonar con actitudes mentales graduadas. Consideramos que una arquitectura BDI más exible permitirá desarrollar agentes que alcancen mejor performance en entornos inciertos y dinámicos, al servicio de otros agentes (humanos o no) que puedan tener un conjunto de motivaciones graduadas. En el modelo g-BDI, las actitudes graduadas del agente tienen una representación explícita y adecuada. Los grados en las creencias representan la medida en que el agente cree que una fórmula es verdadera, en los deseos positivos o negativos permiten al agente establecer respectivamente, diferentes niveles de preferencias o de rechazo. Las graduaciones en las intenciones también dan una medida de preferencia pero en este caso, modelan el costo/beneficio que le trae al agente alcanzar una meta. Luego, a partir de la representación e interacción de estas actitudes graduadas, pueden ser modelados agentes que muestren diferentes tipos de comportamiento. La formalización del modelo g-BDI está basada en los sistemas multi-contextos. Diferentes lógicas modales multivaluadas se han propuesto para representar y razonar sobre las creencias, deseos e intenciones, presentando en cada caso una axiomática completa y consistente. Para tratar con la semántica operacional del modelo de agente, primero se definió un calculus para la ejecución de sistemas multi-contextos, denominado Multi-context calculus. Luego, mediante este calculus se le ha dado al modelo g-BDI semántica computacional. Por otra parte, se ha presentado una metodología para la ingeniería de agentes g-BDI en un escenario multiagente. El objeto de esta propuesta es guiar el diseño de sistemas multiagentes, a partir de un problema del mundo real. Por medio del desarrollo de un sistema recomendador en turismo como caso de estudio, donde el agente recomendador tiene una arquitectura g-BDI, se ha mostrado que este modelo es valioso para diseñar e implementar agentes concretos. Finalmente, usando este caso de estudio se ha realizado una experimentación sobre la flexibilidad y performance del modelo de agente g-BDI, demostrando que es útil para desarrollar agentes que manifiesten conductas diversas. También se ha mostrado que los resultados obtenidos con estos agentes recomendadores modelizados con actitudes graduadas, son mejores que aquellos alcanzados por los agentes con actitudes no-graduadas.

Activity modeling in practice: a case-based guide to human-centered software engineering

The purpose of this study was to identify whether activity modeling framework supports problem analysis and provides a traceable and tangible connection from the problem identification up to solution modeling. Methodology validation relied on a real problem from a Portuguese teaching syndicate (ASPE), regarding courses development and management. The study was carried out with a perspective to elaborate a complete tutorial of how to apply activity modeling framework to a real world problem. Within each step of activity modeling, we provided a summary elucidation of the relevant elements required to perform it, pointed out some improvements and applied it to ASPE’s real problem. It was found that activity modeling potentiates well structured problem analysis as well as provides a guiding thread between problem and solution modeling. It was concluded that activity-based task modeling is key to shorten the gap between problem and solution. The results revealed that the solution obtained using activity modeling framework solved the core concerns of our customer and allowed them to enhance the quality of their courses development and management. The principal conclusion was that activity modeling is a properly defined methodology that supports software engineers in problem analysis, keeping a traceable guide among problem and solution.

Comparative study between RBF and radial-PPS neural networks

The study of function approximation is motivated by the human limitation and inability to register and manipulate with exact precision the behavior variations of the physical nature of a phenomenon. These variations are referred to as signals or signal functions. Many real world problem can be formulated as function approximation problems and from the viewpoint of artificial neural networks these can be seen as the problem of searching for a mapping that establishes a relationship from an input space to an output space through a process of network learning. Several paradigms of artificial neural networks (ANN) exist. Here we will be investigated a comparative of the ANN study of RBF with radial Polynomial Power of Sigmoids (PPS) in function approximation problems. Radial PPS are functions generated by linear combination of powers of sigmoids functions. The main objective of this paper is to show the advantages of the use of the radial PPS functions in relationship traditional RBF, through adaptive training and ridge regression techniques.

Sequenciamento de lotes em prensas de alta capacidade com tempo de setup dependente da sequência

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Tricuspid Valve Injury After Heart Transplantation Due to Endomyocardial Biopsy: An Analysis of 3550 Biopsies

Introduction. Tricuspid regurgitation (TR) is the most commonly valvular dysfunction found after heart transplantation (HTx). It may be related to endomyocardial biopsy (EMB) performed for allograft rejection surveillance. Objective. This investigation evaluated the presence of tricuspid valve tissue fragments obtained during routine EMB performed after HTx and its possible effect on short-term and long-term hemodynamic status. Method. This single-center review included prospectively collected and retrospectively analyzed data. From 1985 to 2010, 417 patients underwent 3550 EMB after HTx. All myocardial specimens were reviewed to identify the presence of tricuspid valve tissue by 2 observers initially and in doubtful cases by a third observer. The echocardiographic and hemodynamic parameters were only considered for valvular functional damage analysis in cases of tricuspid tissue inadvertently removed during EMB. Results. The 417 HTx patients to 3550 EMB, including 17,550 myocardial specimens. Tricuspid valve tissue was observed in 12 (2.9%) patients corresponding to 0.07% of the removed fragments. The echocardiographic and hemodynamic parameters of these patients before versus after the biopsy showed increased TR in 2 cases (2/12; 16.7%) quantified as moderate without progression in the long term. Only the right atrial pressure showed a significant increase (P = .0420) after tricuspid injury; however, the worsening of the functional class was not significant enough in any of the subjects. Thus, surgical intervention was not required. Conclusions. Histological evidence of chordal tissue in EMB specimens is a real-world problem of relatively low frequency. Traumatic tricuspid valve injury due to EMB rarely leads to severe valvular regurgitation; only a minority of patients develop significant clinical symptoms. Hemodynamic and echocardiographic alterations are also less often observed in most patients.

Application-oriented Mixed Integer Non-Linear Programming

In the most recent years there is a renovate interest for Mixed Integer Non-Linear Programming (MINLP) problems. This can be explained for different reasons: (i) the performance of solvers handling non-linear constraints was largely improved; (ii) the awareness that most of the applications from the real-world can be modeled as an MINLP problem; (iii) the challenging nature of this very general class of problems. It is well-known that MINLP problems are NP-hard because they are the generalization of MILP problems, which are NP-hard themselves. However, MINLPs are, in general, also hard to solve in practice. We address to non-convex MINLPs, i.e. having non-convex continuous relaxations: the presence of non-convexities in the model makes these problems usually even harder to solve. The aim of this Ph.D. thesis is to give a flavor of different possible approaches that one can study to attack MINLP problems with non-convexities, with a special attention to real-world problems. In Part 1 of the thesis we introduce the problem and present three special cases of general MINLPs and the most common methods used to solve them. These techniques play a fundamental role in the resolution of general MINLP problems. Then we describe algorithms addressing general MINLPs. Parts 2 and 3 contain the main contributions of the Ph.D. thesis. In particular, in Part 2 four different methods aimed at solving different classes of MINLP problems are presented. Part 3 of the thesis is devoted to real-world applications: two different problems and approaches to MINLPs are presented, namely Scheduling and Unit Commitment for Hydro-Plants and Water Network Design problems. The results show that each of these different methods has advantages and disadvantages. Thus, typically the method to be adopted to solve a real-world problem should be tailored on the characteristics, structure and size of the problem. Part 4 of the thesis consists of a brief review on tools commonly used for general MINLP problems, constituted an integral part of the development of this Ph.D. thesis (especially the use and development of open-source software). We present the main characteristics of solvers for each special case of MINLP.

Efficient Deployment of Mobile Detectors for Security Applications

We present a real-world problem that arises in security threat detection applications. The problem consists of deploying mobile detectors on moving units that follow predefined routes. Examples of such units are buses, coaches, and trolleys. Due to a limited budget not all available units can be equipped with a detector. The goal is to equip a subset of units such that the utility of the resulting coverage is maximized. Existing methods for detector deployment are designed to place detectors in fixed locations and are therefore not applicable to the problem considered here. We formulate the planning problem as a binary linear program and present a coverage heuristic for generating effective deployments in short CPU time. The heuristic has theoretical performance guarantees for important special cases of the problem. The effectiveness of the coverage heuristic is demonstrated in a computational analysis based on 28 instances that we derived from real-world data.

Generating Automated News to Explain the Meaning of Sensor Data

An important competence of human data analysts is to interpret and explain the meaning of the results of data analysis to end-users. However, existing automatic solutions for intelligent data analysis provide limited help to interpret and communicate information to non-expert users. In this paper we present a general approach to generating explanatory descriptions about the meaning of quantitative sensor data. We propose a type of web application: a virtual newspaper with automatically generated news stories that describe the meaning of sensor data. This solution integrates a variety of techniques from intelligent data analysis into a web-based multimedia presentation system. We validated our approach in a real world problem and demonstrate its generality using data sets from several domains. Our experience shows that this solution can facilitate the use of sensor data by general users and, therefore, can increase the utility of sensor network infrastructures.