Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns

In Boolean games, agents try to reach a goal formulated as a Boolean formula. These games are attractive because of their compact representations. However, few methods are available to compute the solutions and they are either limited or do not take privacy or communication concerns into account. In this paper we propose the use of an algorithm related to reinforcement learning to address this problem. Our method is decentralized in the sense that agents try to achieve their goals without knowledge of the other agents’ goals. We prove that this is a sound method to compute a Pareto optimal pure Nash equilibrium for an interesting class of Boolean games. Experimental results are used to investigate the performance of the algorithm.

Achieving optimal dose intensity with adjuvant chemotherapy in elderly breast cancer patients:A 10-year retrospective study in a UK institution

The study was to determine if breast cancer patients aged 65 and above could be given adjuvant chemotherapy safely while achieving an acceptable relative dose intensity of at least 85%. We identified all patients aged 65 and over who received adjuvant chemotherapy over the 10 year period, November 1999 to October 2009, and determined the proportion that achieved a relative dose intensity of at least 85% as well as the tolerability of their treatment. A total of 101 patients were identified, with a median age of 69 years (range 65-78).Of these, 25.7% of patients had at least one major comorbidity, 84.2% had a tumor size of 5 cm or less, 73.3% were node positive and 58.4% were hormone receptor positive. The chemotherapy regimens used were AC (Doxorubicin and Cyclophosphamide), FEC (Fluorouracil, Epirubicin, and Cyclophosphamide), CMF (Cyclophosphamide, Methotrexate, and Fluorouracil) and ECMF (Epirubicin followed by CMF). Seventy-nine patients (78.2%) achieved the relative dose intensity of at least 85%. With respect to toxicity, 11.9% of patients developed febrile neutropenia and 23.8% of patients required hospital admission during the treatment period, but there were no treatment-related deaths in the group. A significant proportion of patients aged 65 and above achieved the intended dose intensity of at least 85% over this 10-year period, with manageable toxicity levels. This supports the use of these regimens as adjuvant chemotherapy for breast cancer in this age group. © 2011 Wiley Periodicals, Inc.

Comparison of optimal designs of steel portal frames including topological asymmetry considering rolled, fabricated and tapered sections

A structural design optimisation has been carried out to allow for asymmetry and fully tapered portal frames. The additional weight of an asymmetric structural shape was found to be on average 5–13% with additional photovoltaic (PV) loading having a negligible effect on the optimum design. It was also shown that fabricated and tapered frames achieved an average percentage weight reduction of 9% and 11%, respectively, as compared to comparable hot-rolled steel frames. When the deflection limits recommended by the Steel Construction Institute were used, frames were shown to be deflection controlled with industrial limits yielding up to 40% saving.

Optimal deployment of geographically distributed workflow engines on the cloud

When orchestrating Web service workflows, the geographical placement of the orchestration engine (s) can greatly affect workflow performance. Data may have to be transferred across long geographical distances, which in turn increases execution time and degrades the overall performance of a workflow. In this paper, we present a framework that, given a DAG-based workflow specification, computes the optimal Amazon EC2 cloud regions to deploy the orchestration engines and execute a workflow. The framework incorporates a constraint model that solves the workflow deployment problem, which is generated using an automated constraint modelling system. The feasibility of the framework is evaluated by executing different sample workflows representative of scientific workloads. The experimental results indicate that the framework reduces the workflow execution time and provides a speed up of 1.3x-2.5x over centralised approaches.

Preoperative characteristics and compliance with follow-up after trabeculectomy surgery in rural southern China

Purpose: To evaluate preoperative characteristics and follow-up in rural China after trabeculectomy, the primary treatment for glaucoma there. Methods: Patients undergoing trabeculectomy at 14 rural hospitals in Guangdong and Guangxi Provinces and their doctors completed questionnaires concerning clinical and sociodemographic information, transportation, and knowledge and attitudes about glaucoma. Follow-up after surgery was assessed as cumulative score (1 week: 10 points, 2 weeks: 7 points, 1 month: 5 points). Results Among 212 eligible patients, mean preoperative presenting acuity in the operative eye was 6/120, with 61.3% (n=130) blind (≤6/60). Follow-up rates were 60.8% (129/212), 75.9% (161/212) and 26.9% (57/212) at 1 week, 2 weeks and 1 month, respectively. Patient predictors of poor follow-up included elementary education or less (OR=0.37, 95% CI 0.20 to 0.70, p=0.002), believing follow-up was not important (OR=0.62, 95% CI 0.41 to 0.94, p=0.02), lack of an accompanying person (OR=0.14, 95% CI 0.07 to 0.29, p<0.001), family annual income <US$800 (OR=0.28, 95% CI 0.11 to 0.72, p=0.008) and not requiring removal of scleral flap sutures postoperatively (OR=0.11, 95% CI 0.06 to 0.22, p<0.001). Age, sex, employment, travel distance/time/costs, patient preoperative clinical factors and physician factors were unassociated with follow-up. Conclusions: Follow-up after 2 weeks was inadequate to provide optimal clinical care, and surgery is being applied too late to avoid blindness in the majority of patients. Earlier surgery, support for return visits and better explanations of the importance of follow-up are needed. Directing all patients to return for possible scleral flap suture removal may be a valid strategy to improve follow-up.

Manufacturing System Simulation & Human Robot Interaction in VR:Manufacturing system simulation: Methodologies, software tools, case study in transportation design

Virtual Reality techniques are relatively new, having experienced significant development only during the last few years, in accordance with the progress achieved by computer science and hardware and software technologies. The study of such advanced design systems has led to the realization of an immersive environment in which new procedures for the evaluation of product prototypes, ergonomics and manufacturing operations have been simulated. The application of the environment realized to robotics, ergonomics, plant simulations and maintainability verifications has allowed us to highlight the advantages offered by a design methodology: the possibility of working on the industrial product in the first phase of conception; of placing the designer in front of the virtual reproduction of the product in a realistic way; and of interacting with the same concept. The aim of this book is to present an updated vision of VM through different aspects. We will describe the trends and results achieved in the automotive, aerospace and railway fields, in terms of the Digital Product Creation Process to design the product and the manufacturing process.

Regularization and Bang-bang conjugate times in optimal control

Consideramos o problema de controlo óptimo de tempo mínimo para sistemas de controlo mono-entrada e controlo afim num espaço de dimensão finita com condições inicial e final fixas, onde o controlo escalar toma valores num intervalo fechado. Quando aplicamos o método de tiro a este problema, vários obstáculos podem surgir uma vez que a função de tiro não é diferenciável quando o controlo é bang-bang. No caso bang-bang os tempos conjugados são teoricamente bem definidos para este tipo de sistemas de controlo, contudo os algoritmos computacionais directos disponíveis são de difícil aplicação. Por outro lado, no caso suave o conceito teórico e prático de tempos conjugados é bem conhecido, e ferramentas computacionais eficazes estão disponíveis. Propomos um procedimento de regularização para o qual as soluções do problema de tempo mínimo correspondente dependem de um parâmetro real positivo suficientemente pequeno e são definidas por funções suaves em relação à variável tempo, facilitando a aplicação do método de tiro simples. Provamos, sob hipóteses convenientes, a convergência forte das soluções do problema regularizado para a solução do problema inicial, quando o parâmetro real tende para zero. A determinação de tempos conjugados das trajectórias localmente óptimas do problema regularizado enquadra-se na teoria suave conhecida. Provamos, sob hipóteses adequadas, a convergência do primeiro tempo conjugado do problema regularizado para o primeiro tempo conjugado do problema inicial bang-bang, quando o parâmetro real tende para zero. Consequentemente, obtemos um algoritmo eficiente para a computação de tempos conjugados no caso bang-bang.

Optimal control and numerical optimization applied to epidemiological models

A relação entre a epidemiologia, a modelação matemática e as ferramentas computacionais permite construir e testar teorias sobre o desenvolvimento e combate de uma doença. Esta tese tem como motivação o estudo de modelos epidemiológicos aplicados a doenças infeciosas numa perspetiva de Controlo Ótimo, dando particular relevância ao Dengue. Sendo uma doença tropical e subtropical transmitida por mosquitos, afecta cerca de 100 milhões de pessoas por ano, e é considerada pela Organização Mundial de Saúde como uma grande preocupação para a saúde pública. Os modelos matemáticos desenvolvidos e testados neste trabalho, baseiam-se em equações diferenciais ordinárias que descrevem a dinâmica subjacente à doença nomeadamente a interação entre humanos e mosquitos. É feito um estudo analítico dos mesmos relativamente aos pontos de equilíbrio, sua estabilidade e número básico de reprodução. A propagação do Dengue pode ser atenuada através de medidas de controlo do vetor transmissor, tais como o uso de inseticidas específicos e campanhas educacionais. Como o desenvolvimento de uma potencial vacina tem sido uma aposta mundial recente, são propostos modelos baseados na simulação de um hipotético processo de vacinação numa população. Tendo por base a teoria de Controlo Ótimo, são analisadas as estratégias ótimas para o uso destes controlos e respetivas repercussões na redução/erradicação da doença aquando de um surto na população, considerando uma abordagem bioeconómica. Os problemas formulados são resolvidos numericamente usando métodos diretos e indiretos. Os primeiros discretizam o problema reformulando-o num problema de optimização não linear. Os métodos indiretos usam o Princípio do Máximo de Pontryagin como condição necessária para encontrar a curva ótima para o respetivo controlo. Nestas duas estratégias utilizam-se vários pacotes de software numérico. Ao longo deste trabalho, houve sempre um compromisso entre o realismo dos modelos epidemiológicos e a sua tratabilidade em termos matemáticos.

Computational methods in the fractional calculus of variations and optimal control

The fractional calculus of variations and fractional optimal control are generalizations of the corresponding classical theories, that allow problem modeling and formulations with arbitrary order derivatives and integrals. Because of the lack of analytic methods to solve such fractional problems, numerical techniques are developed. Here, we mainly investigate the approximation of fractional operators by means of series of integer-order derivatives and generalized finite differences. We give upper bounds for the error of proposed approximations and study their efficiency. Direct and indirect methods in solving fractional variational problems are studied in detail. Furthermore, optimality conditions are discussed for different types of unconstrained and constrained variational problems and for fractional optimal control problems. The introduced numerical methods are employed to solve some illustrative examples.

On the application of optimal control techniques in lossy fieldbuses

The performance of real-time networks is under continuous improvement as a result of several trends in the digital world. However, these tendencies not only cause improvements, but also exacerbates a series of unideal aspects of real-time networks such as communication latency, jitter of the latency and packet drop rate. This Thesis focuses on the communication errors that appear on such realtime networks, from the point-of-view of automatic control. Specifically, it investigates the effects of packet drops in automatic control over fieldbuses, as well as the architectures and optimal techniques for their compensation. Firstly, a new approach to address the problems that rise in virtue of such packet drops, is proposed. This novel approach is based on the simultaneous transmission of several values in a single message. Such messages can be from sensor to controller, in which case they are comprised of several past sensor readings, or from controller to actuator in which case they are comprised of estimates of several future control values. A series of tests reveal the advantages of this approach. The above-explained approach is then expanded as to accommodate the techniques of contemporary optimal control. However, unlike the aforementioned approach, that deliberately does not send certain messages in order to make a more efficient use of network resources; in the second case, the techniques are used to reduce the effects of packet losses. After these two approaches that are based on data aggregation, it is also studied the optimal control in packet dropping fieldbuses, using generalized actuator output functions. This study ends with the development of a new optimal controller, as well as the function, among the generalized functions that dictate the actuator’s behaviour in the absence of a new control message, that leads to the optimal performance. The Thesis also presents a different line of research, related with the output oscillations that take place as a consequence of the use of classic co-design techniques of networked control. The proposed algorithm has the goal of allowing the execution of such classical co-design algorithms without causing an output oscillation that increases the value of the cost function. Such increases may, under certain circumstances, negate the advantages of the application of the classical co-design techniques. A yet another line of research, investigated algorithms, more efficient than contemporary ones, to generate task execution sequences that guarantee that at least a given number of activated jobs will be executed out of every set composed by a predetermined number of contiguous activations. This algorithm may, in the future, be applied to the generation of message transmission patterns in the above-mentioned techniques for the efficient use of network resources. The proposed task generation algorithm is better than its predecessors in the sense that it is capable of scheduling systems that cannot be scheduled by its predecessor algorithms. The Thesis also presents a mechanism that allows to perform multi-path routing in wireless sensor networks, while ensuring that no value will be counted in duplicate. Thereby, this technique improves the performance of wireless sensor networks, rendering them more suitable for control applications. As mentioned before, this Thesis is centered around techniques for the improvement of performance of distributed control systems in which several elements are connected through a fieldbus that may be subject to packet drops. The first three approaches are directly related to this topic, with the first two approaching the problem from an architectural standpoint, whereas the third one does so from more theoretical grounds. The fourth approach ensures that the approaches to this and similar problems that can be found in the literature that try to achieve goals similar to objectives of this Thesis, can do so without causing other problems that may invalidate the solutions in question. Then, the thesis presents an approach to the problem dealt with in it, which is centered in the efficient generation of the transmission patterns that are used in the aforementioned approaches.

Optimal alarms systems and its application to financial time series

This thesis focuses on the application of optimal alarm systems to non linear time series models. The most common classes of models in the analysis of real-valued and integer-valued time series are described. The construction of optimal alarm systems is covered and its applications explored. Considering models with conditional heteroscedasticity, particular attention is given to the Fractionally Integrated Asymmetric Power ARCH, FIAPARCH(p; d; q) model and an optimal alarm system is implemented, following both classical and Bayesian methodologies. Taking into consideration the particular characteristics of the APARCH(p; q) representation for financial time series, the introduction of a possible counterpart for modelling time series of counts is proposed: the INteger-valued Asymmetric Power ARCH, INAPARCH(p; q). The probabilistic properties of the INAPARCH(1; 1) model are comprehensively studied, the conditional maximum likelihood (ML) estimation method is applied and the asymptotic properties of the conditional ML estimator are obtained. The final part of the work consists on the implementation of an optimal alarm system to the INAPARCH(1; 1) model. An application is presented to real data series.

Optimal design of geometrically non- linear laminated structures

The mechanical properties of a laminate are strongly dependent of the fiber directions and because of that the lamenate should be designed to meet the specific requirements of each particular application in order to obtain the maximum advantages.