Mathematical Programming Models for Influence Maximization on Social Networks

In this dissertation, we apply mathematical programming techniques (i.e., integer programming and polyhedral combinatorics) to develop exact approaches for influence maximization on social networks. We study four combinatorial optimization problems that deal with maximizing influence at minimum cost over a social network. To our knowl- edge, all previous work to date involving influence maximization problems has focused on heuristics and approximation. We start with the following viral marketing problem that has attracted a significant amount of interest from the computer science literature. Given a social network, find a target set of customers to seed with a product. Then, a cascade will be caused by these initial adopters and other people start to adopt this product due to the influence they re- ceive from earlier adopters. The idea is to find the minimum cost that results in the entire network adopting the product. We first study a problem called the Weighted Target Set Selection (WTSS) Prob- lem. In the WTSS problem, the diffusion can take place over as many time periods as needed and a free product is given out to the individuals in the target set. Restricting the number of time periods that the diffusion takes place over to be one, we obtain a problem called the Positive Influence Dominating Set (PIDS) problem. Next, incorporating partial incentives, we consider a problem called the Least Cost Influence Problem (LCIP). The fourth problem studied is the One Time Period Least Cost Influence Problem (1TPLCIP) which is identical to the LCIP except that we restrict the number of time periods that the diffusion takes place over to be one. We apply a common research paradigm to each of these four problems. First, we work on special graphs: trees and cycles. Based on the insights we obtain from special graphs, we develop efficient methods for general graphs. On trees, first, we propose a polynomial time algorithm. More importantly, we present a tight and compact extended formulation. We also project the extended formulation onto the space of the natural vari- ables that gives the polytope on trees. Next, building upon the result for trees---we derive the polytope on cycles for the WTSS problem; as well as a polynomial time algorithm on cycles. This leads to our contribution on general graphs. For the WTSS problem and the LCIP, using the observation that the influence propagation network must be a directed acyclic graph (DAG), the strong formulation for trees can be embedded into a formulation on general graphs. We use this to design and implement a branch-and-cut approach for the WTSS problem and the LCIP. In our computational study, we are able to obtain high quality solutions for random graph instances with up to 10,000 nodes and 20,000 edges (40,000 arcs) within a reasonable amount of time.

Real-time load-side control of electric power systems

Two trends are emerging from modern electric power systems: the growth of renewable (e.g., solar and wind) generation, and the integration of information technologies and advanced power electronics. The former introduces large, rapid, and random fluctuations in power supply, demand, frequency, and voltage, which become a major challenge for real-time operation of power systems. The latter creates a tremendous number of controllable intelligent endpoints such as smart buildings and appliances, electric vehicles, energy storage devices, and power electronic devices that can sense, compute, communicate, and actuate. Most of these endpoints are distributed on the load side of power systems, in contrast to traditional control resources such as centralized bulk generators. This thesis focuses on controlling power systems in real time, using these load side resources. Specifically, it studies two problems.

(1) Distributed load-side frequency control: We establish a mathematical framework to design distributed frequency control algorithms for flexible electric loads. In this framework, we formulate a category of optimization problems, called optimal load control (OLC), to incorporate the goals of frequency control, such as balancing power supply and demand, restoring frequency to its nominal value, restoring inter-area power flows, etc., in a way that minimizes total disutility for the loads to participate in frequency control by deviating from their nominal power usage. By exploiting distributed algorithms to solve OLC and analyzing convergence of these algorithms, we design distributed load-side controllers and prove stability of closed-loop power systems governed by these controllers. This general framework is adapted and applied to different types of power systems described by different models, or to achieve different levels of control goals under different operation scenarios. We first consider a dynamically coherent power system which can be equivalently modeled with a single synchronous machine. We then extend our framework to a multi-machine power network, where we consider primary and secondary frequency controls, linear and nonlinear power flow models, and the interactions between generator dynamics and load control.

(2) Two-timescale voltage control: The voltage of a power distribution system must be maintained closely around its nominal value in real time, even in the presence of highly volatile power supply or demand. For this purpose, we jointly control two types of reactive power sources: a capacitor operating at a slow timescale, and a power electronic device, such as a smart inverter or a D-STATCOM, operating at a fast timescale. Their control actions are solved from optimal power flow problems at two timescales. Specifically, the slow-timescale problem is a chance-constrained optimization, which minimizes power loss and regulates the voltage at the current time instant while limiting the probability of future voltage violations due to stochastic changes in power supply or demand. This control framework forms the basis of an optimal sizing problem, which determines the installation capacities of the control devices by minimizing the sum of power loss and capital cost. We develop computationally efficient heuristics to solve the optimal sizing problem and implement real-time control. Numerical experiments show that the proposed sizing and control schemes significantly improve the reliability of voltage control with a moderate increase in cost.

An adaptive neighborhood search algorithm for optimizing stochastic mining complexes

Les métaheuristiques sont très utilisées dans le domaine de l'optimisation discrète. Elles permettent d’obtenir une solution de bonne qualité en un temps raisonnable, pour des problèmes qui sont de grande taille, complexes, et difficiles à résoudre. Souvent, les métaheuristiques ont beaucoup de paramètres que l’utilisateur doit ajuster manuellement pour un problème donné. L'objectif d'une métaheuristique adaptative est de permettre l'ajustement automatique de certains paramètres par la méthode, en se basant sur l’instance à résoudre. La métaheuristique adaptative, en utilisant les connaissances préalables dans la compréhension du problème, des notions de l'apprentissage machine et des domaines associés, crée une méthode plus générale et automatique pour résoudre des problèmes. L’optimisation globale des complexes miniers vise à établir les mouvements des matériaux dans les mines et les flux de traitement afin de maximiser la valeur économique du système. Souvent, en raison du grand nombre de variables entières dans le modèle, de la présence de contraintes complexes et de contraintes non-linéaires, il devient prohibitif de résoudre ces modèles en utilisant les optimiseurs disponibles dans l’industrie. Par conséquent, les métaheuristiques sont souvent utilisées pour l’optimisation de complexes miniers. Ce mémoire améliore un procédé de recuit simulé développé par Goodfellow & Dimitrakopoulos (2016) pour l’optimisation stochastique des complexes miniers stochastiques. La méthode développée par les auteurs nécessite beaucoup de paramètres pour fonctionner. Un de ceux-ci est de savoir comment la méthode de recuit simulé cherche dans le voisinage local de solutions. Ce mémoire implémente une méthode adaptative de recherche dans le voisinage pour améliorer la qualité d'une solution. Les résultats numériques montrent une augmentation jusqu'à 10% de la valeur de la fonction économique.

An adaptive neighborhood search algorithm for optimizing stochastic mining complexes

Les métaheuristiques sont très utilisées dans le domaine de l'optimisation discrète. Elles permettent d’obtenir une solution de bonne qualité en un temps raisonnable, pour des problèmes qui sont de grande taille, complexes, et difficiles à résoudre. Souvent, les métaheuristiques ont beaucoup de paramètres que l’utilisateur doit ajuster manuellement pour un problème donné. L'objectif d'une métaheuristique adaptative est de permettre l'ajustement automatique de certains paramètres par la méthode, en se basant sur l’instance à résoudre. La métaheuristique adaptative, en utilisant les connaissances préalables dans la compréhension du problème, des notions de l'apprentissage machine et des domaines associés, crée une méthode plus générale et automatique pour résoudre des problèmes. L’optimisation globale des complexes miniers vise à établir les mouvements des matériaux dans les mines et les flux de traitement afin de maximiser la valeur économique du système. Souvent, en raison du grand nombre de variables entières dans le modèle, de la présence de contraintes complexes et de contraintes non-linéaires, il devient prohibitif de résoudre ces modèles en utilisant les optimiseurs disponibles dans l’industrie. Par conséquent, les métaheuristiques sont souvent utilisées pour l’optimisation de complexes miniers. Ce mémoire améliore un procédé de recuit simulé développé par Goodfellow & Dimitrakopoulos (2016) pour l’optimisation stochastique des complexes miniers stochastiques. La méthode développée par les auteurs nécessite beaucoup de paramètres pour fonctionner. Un de ceux-ci est de savoir comment la méthode de recuit simulé cherche dans le voisinage local de solutions. Ce mémoire implémente une méthode adaptative de recherche dans le voisinage pour améliorer la qualité d'une solution. Les résultats numériques montrent une augmentation jusqu'à 10% de la valeur de la fonction économique.

UT Austin | Portugal Workshop on Nonlinear Mechanics and Applications in Life Sciences

This is a CoLab Workshop organized as an initiative of the UT Austin | Portugal Program to reinforce the Portuguese competences in Nonlinear Mechanics and in complex problems arising from applications to the mathematical modeling and simulations in the Life Sciences. The Workshop provides a place to exchange recent developments, discoveries and progresses in this challenging research field. The main goal is to bring together doctoral candidates, postdoctoral scientists and graduates interested in the field, giving them the opportunity to make scientific interactions and new connections with established experts in the interdisciplinary topics covered by the event. Another important goal of the Workshop is to promote collaboration between members of the different areas of the UT Austin | Portugal community.

Implementación de un algoritmo genético para la asignación de aulas en un centro de estudio (ING)

The genetic algorithm is a very efficient tool to solve optimization problems. On the other hand, the classroom assignation in any education center, particularly those that does not have enough quantity of classrooms for the courseʼs demand converts it in an optimization problem. In the Department of Computer Science (Universidad de Costa Rica) this work is carried out manually every six months. Besides, at least two persons of the department are dedicated full time to this labor for one week or more. The present article describes an automatic solution that not only reduces the response time to seconds but it also finds an optimal solution in the majority of the cases. In addition gives flexibility in using the program when the information involved with classroom assignation has to be updated. The interface is simple an easy to use.

La traduzione e ricezione della letteratura cinese in Italia: questioni e strategie a partire dal caso delle traduzioni di alcuni romanzi di Su Tong, Yu Hua, Zhang Jie e Mo Yan

Negli ultimi anni, in Italia sono stati tradotti un gran numero di opere letterarie cinesi grazie all’impegno e alla passione di numerosi sinologi, studiosi e traduttori italiani. Tuttavia, gli studi sulla traduzione della letteratura cinese sono, sia in Cina che in Italia, relativamente pochi e non sempre uniformi: in Cina è difficile trovare dati completi, sistematici e dotati di un certo valore di riferimento, e in Italia, una ricerca di questo tipo ha avuto origine nell’ambito degli studi sinologici italiani, piuttosto che in quello degli studi sulla traduzione. A partire da una rassegna dei principali approcci agli studi sulla traduzione (letteraria) dalla seconda metà del XX secolo fino ai nostri giorni, questo lavoro di tesi tenta di analizzare da un lato le tendenze generali relative alla traduzione e alla pubblicazione delle opere letterarie cinesi in Italia in un arco temporale che va dal 1942 al 2018, tramite alcune analisi di tipo sia quantitativo che qualitativo basate su una tabella di dati concernenti la letteratura cinese sul mercato editoriale italiano che è stata costruita appositamente; dall’altro, questa ricerca intende investigare le strategie utilizzate per tradurre i diversi riferimenti culturali riscontrati nel corpus di testi scelti e che sono stati suddivisi nelle seguenti categorie: antroponimi, intertestualità, riferimenti al contesto politico e culturale, gastronomia e altri riferimenti culturali. Attraverso un’analisi comparativa e descrittiva dei testi di partenza e dei testi di arrivo, ai fini della tesi si sono indagate le problematiche riguardanti la traduzione e la ricezione della letteratura cinese in Italia e le tendenze che tale letteratura ha avuto sia in ambito editoriale che nel campo della traduzione letteraria.

Colocated multiple-input multiple-output radars for smart mobility

In recent years, radars have been used in many applications such as precision agriculture and advanced driver assistant systems. Optimal techniques for the estimation of the number of targets and of their coordinates require solving multidimensional optimization problems entailing huge computational efforts. This has motivated the development of sub-optimal estimation techniques able to achieve good accuracy at a manageable computational cost. Another technical issue in advanced driver assistant systems is the tracking of multiple targets. Even if various filtering techniques have been developed, new efficient and robust algorithms for target tracking can be devised exploiting a probabilistic approach, based on the use of the factor graph and the sum-product algorithm. The two contributions provided by this dissertation are the investigation of the filtering and smoothing problems from a factor graph perspective and the development of efficient algorithms for two and three-dimensional radar imaging. Concerning the first contribution, a new factor graph for filtering is derived and the sum-product rule is applied to this graphical model; this allows to interpret known algorithms and to develop new filtering techniques. Then, a general method, based on graphical modelling, is proposed to derive filtering algorithms that involve a network of interconnected Bayesian filters. Finally, the proposed graphical approach is exploited to devise a new smoothing algorithm. Numerical results for dynamic systems evidence that our algorithms can achieve a better complexity-accuracy tradeoff and tracking capability than other techniques in the literature. Regarding radar imaging, various algorithms are developed for frequency modulated continuous wave radars; these algorithms rely on novel and efficient methods for the detection and estimation of multiple superimposed tones in noise. The accuracy achieved in the presence of multiple closely spaced targets is assessed on the basis of both synthetically generated data and of the measurements acquired through two commercial multiple-input multiple-output radars.

Trajectory planning of single and dual-arm robots for time-optimal handling of liquids and objects

This Thesis studies the optimal control problem of single-arm and dual-arm serial robots to achieve the time-optimal handling of liquids and objects. The first topic deals with the planning of time-optimal anti-sloshing trajectories of an industrial robot carrying a cylindrical container filled with a liquid, considering 1-dimensional and 2-dimensional planar motions. A technique for the estimation of the sloshing height is presented, together with its extension to 3-dimensional motions. An experimental validation campaign is provided and discussed to assess the thoroughness of such a technique. As far as anti-sloshing trajectories are concerned, 2-dimensional paths are considered and, for each one of them, three constrained optimizations with different values of the sloshing-height thresholds are solved. Experimental results are presented to compare optimized and non-optimized motions. The second part focuses on the time-optimal trajectory planning for dual-arm object handling, employing two collaborative robots (cobots) and adopting an admittance-control strategy. The chosen manipulation approach, known as cooperative grasping, is based on unilateral contact between the cobots and the object, and it may lead to slipping during motion if an internal prestress along the contact-normal direction is not prescribed. Thus, a virtual penetration is considered, aimed at generating the necessary internal prestress. The stability of cooperative grasping is ensured as long as the exerted forces on the object remain inside the static-friction cone. Constrained-optimization problems are solved for 3-dimensional paths: the virtual penetration is chosen among the control inputs of the problem and friction-cone conditions are treated as inequality constraints. Also in this case experiments are presented in order to prove evidence of the firm handling of the object, even for fast motions.

Preparação profissional em educação fisica : a questão dos estagios

Universidade Estadual de Campinas . Faculdade de Educação Física

Perfil sociodemográfico e padrão de utilização dos serviços de saúde do Sistema Único de Saúde (SUS), 2003- 2008

O objetivo foi analisar a evolução do perfil de utilização de serviços de saúde, entre 2003 e 2008, no Brasil e nas suas macrorregiões. Foram utilizados dados da PNAD. A utilização de serviços de saúde foi medida pela proporção de pessoas que procuraram e foram atendidas nas 2 semanas anteriores e pelos que relataram internação nos últimos 12 meses, segundo SUS e não SUS. Foram analisadas as características socioeconômicas dos usuários, o tipo de atendimento e de serviço e os motivos da procura. A proporção de indivíduos que procuraram serviços de saúde não se alterou, assim como a parcela dos que conseguiram atendimento (96%), entre 2003 e 2008. O SUS respondeu por 56,7% dos atendimentos, realizando a maior parte das internações, vacinação e consultas e somente 1/3 das consultas odontológicas. Em 2008, manteve-se o gradiente de redução de utilização de serviços de saúde SUS conforme o aumento de renda e escolaridade. Houve decréscimo da proporção dos que procuraram serviços de saúde para ações de prevenção e aumento de procura para problemas odontológicos, acidentes e lesões e reabilitação. O padrão de utilização do SUS por região esteve inversamente relacionado à proporção de indivíduos com posse de planos privados de saúde.

Identification and Validation of Brazilian Chronic Pain Descriptors

Appropriate pain assessment is very important for managing chronic pain. Given the cultural differences in verbally expressing pain and in psychosocial problems, specific tools are needed. The goal of this study was to identify and validate Brazilian pain descriptors. A purposive sample of health professionals and chronic pain patients was recruited. Four studies were conducted using direct and indirect psychophysical methods: category estimation, magnitude estimation, and magnitude estimation and tine-length. Results showed the descriptors which best describe chronic pain in Brazilian culture and demonstrated that there is not a significant correlation between patients and health professionals and that the psychophysical scale of judgment of pain descriptors is valid, stable, and consistent. Results reinforced that the translations of word descriptors and research tools into another language may be inappropriate, owing to differences in perception and communication and the inadequacy of exact translations to reflect the intended meaning. Given the complexity of the chronic pain, personal suffering involved, and the need for accurate assessment of chronic pain using descriptors stemming from Brazilian culture and language, it is essential to investigate the most adequate words to describe chronic pain. Although it requires more refinement, the Brazilian chronic pain descriptors can be used further to develop a multidimensional pain assessment tool that is culturally sensitive. (C) 2009 by the American Society for Pain Management Nursing

A generalized modified Weibull distribution for lifetime modeling

A four parameter generalization of the Weibull distribution capable of modeling a bathtub-shaped hazard rate function is defined and studied. The beauty and importance of this distribution lies in its ability to model monotone as well as non-monotone failure rates, which are quite common in lifetime problems and reliability. The new distribution has a number of well-known lifetime special sub-models, such as the Weibull, extreme value, exponentiated Weibull, generalized Rayleigh and modified Weibull distributions, among others. We derive two infinite sum representations for its moments. The density of the order statistics is obtained. The method of maximum likelihood is used for estimating the model parameters. Also, the observed information matrix is obtained. Two applications are presented to illustrate the proposed distribution. (C) 2008 Elsevier B.V. All rights reserved.

Prevalence of Adverse Life Events, Depression and Suicidal Thoughts and Behaviour among a Community Sample of Young People aged 15-24 Years

Objective: To provide prevalence data on several key mental health indicators for young people aged 15 to 24 years. Methods: A cross-sectional household survey, using telephone recruitment followed by a postal pencil-and-paper questionnaire. The overall response rate was 67.3%. Results: Difficulties with interpersonal relationships are common causes of distress for young people, in particular problems with parents, problems with friends and relationship break-ups. Depressive symptomatology is common among young people with approximately one in eight males and one in four females reporting current depressive symptomatology. One in three young people reported that they had had suicidal thoughts at some time in the past, 1.2% of young people reported that they had made a plan on how to kill themselves in the four-week period prior to completing the survey and 6.9% of young people reported that they had tried to kill themselves at some time during their life time (4.2% of males and 9.0% of females). Conclusions and implications: The prevalence figures for the various mental health indicators presented in this paper represent good baseline information upon which to examine the progress over time of interventions designed to improve the mental health of young people.

Young children's performance on the balance scale: The influence of relational complexity

Three experiments investigated the effect of complexity on children's understanding of a beam balance. In nonconflict problems, weights or distances varied, while the other was held constant. In conflict items, both weight and distance varied, and items were of three kinds: weight dominant, distance dominant, or balance (in which neither was dominant). In Experiment 1, 2-year-old children succeeded on nonconflict-weight and nonconflict-distance problems. This result was replicated in Experiment 2, but performance on conflict items did not exceed chance. In Experiment 3, 3- and 4-year-olds succeeded on all except conflict balance problems, while 5- and 6-year-olds succeeded on all problem types. The results were interpreted in terms of relational complexity theory. Children aged 2 to 4 years succeeded on problems that entailed binary relations, but 5- and 6-year-olds also succeeded on problems that entailed ternary relations. Ternary relations tasks from other domains-transitivity and class inclusion-accounted for 93% of the age-related variance in balance scale scores. (C) 2002 Elsevier Science (USA).