Dissertationen zum Thema „Algorithmic decision systems“

The healthcare sector has become a key area for the development and application of new technology and, not least, Artificial Intelligence (AI). New reports are constantly being published about how this algorithm-based technology supports or performs various medical tasks. These illustrates the rapid development of AI that is taking place within healthcare and how algorithms are increasingly involved in systems and medical devices designed to support medical decision-making.  The digital revolution and the advancement of AI technologies represent a step change in the way healthcare may be delivered, medical services coordinated and well-being supported. It could allow for easier and faster communication, earlier and more accurate diagnosing and better healthcare at lower costs. However, systems and devices relying on AI differs significantly from other, traditional, medical devices. AI algorithms are – by nature – complex and partly unpredictable. Additionally, varying levels of opacity has made it hard, sometimes impossible, to interpret and explain recommendations or decisions made by or with support from algorithmic decision systems. These characteristics of AI technology raise important technological, practical, ethical and regulatory issues. The objective of this thesis is to analyse the relationship between the EU regulation on medical devices (MDR) and algorithmic decision systems (ADS) used within the medical domain. The principal question is whether the MDR is enough to guarantee safe and robust ADS within the European healthcare sector or if complementary (or completely different) regulation is necessary. In essence, it will be argued that (i) while ADS are heavily reliant on the quality and representativeness of underlying datasets, there are no requirements with regard to the quality or composition of these datasets in the MDR, (ii) while it is believed that ADS will lead to historically unprecedented changes in healthcare , the regulation lacks guidance on how to manage novel risks and hazards, unique to ADS, and that (iii) as increasingly autonomous systems continue to challenge the existing perceptions of how safety and performance is best maintained, new mechanisms (for transparency, human control and accountability) must be incorporated in the systems. It will also be found that the ability of ADS to change after market certification, will eventually necessitate radical changes in the current regulation and a new regulatory paradigm might be needed.

The subject chosen to develop this thesis project on is developing an algorithm or methodology for system selection. The specific problem studied involves a procedure to determine anion computer system alternative is the best choice for a given user situation.The general problem to be addressed is the need for one to choose computing hardware, software, systems, or services in a -Logical approach from a user perspective, considering cost, performance and human factors. Most existing methods consider only cost and performance factors, combining these factors in ad hoc, subjective fashions to react: a selection decision. By not considering factors treat measure effectiveness and functionality of computer services for a user, existing methods ignore some of the most important measures of value to the user.In this work, a systematic and comprehensive approach to computer system selection has been developed. Also developed were methods for selecting and organizing various criteria.Also ways to assess the importance and value of different service attributes to a end-user are discussed.Finally, the feasibility of a systematic approach to computer system selection has been proven by establishing a general methodology and by proving it through a demonstration of a specific application.

Multiple-centered clustering method and decision making system algorithm on menopause data set depending on multiple-centered clustering are described in this study. This method consists of two stages. At the first stage, fuzzy C-means (FCM) clustering algorithm is applied on the data set under consideration with a high number of cluster centers. As the output of FCM, cluster centers and membership function values for each data member is calculated. At the second stage, original cluster centers obtained in the first stage are merged till the new numbers of clusters are reached. Merging process relies upon a &ldquo<br>similarity measure&rdquo<br>between clusters defined in the thesis. During the merging process, the cluster center coordinates do not change but the data members in these clusters are merged in a new cluster. As the output of this method, therefore, one obtains clusters which include many cluster centers. In the final part of this study, an application of the clustering algorithms &ndash<br>including the multiple centered clustering method &ndash<br>a decision making system is constructed using a special data on menopause treatment. The decisions are based on the clusterings created by the algorithms already discussed in the previous chapters of the thesis. A verification of the decision making system / v decision aid system is done by a team of experts from the Department of Department of Obstetrics and Gynecology of Hacettepe University under the guidance of Prof. Sinan Beksa&ccedil<br>.

Thesis (Ph. D.)--University of California, Riverside, 2008.<br>Includes abstract. Title from first page of PDF file (viewed March 10, 2010). Available via ProQuest Digital Dissertations. Includes bibliographical references (p. 166-170). Also issued in print.

La thèse est motivée par une étude de cas intéressante liée à l’évaluation du risque nucléaire. Le cas d’étude consiste à évaluer l’impact d’un accident nucléaire survenu dans le milieu marin. Ce problème comporte des caractéristiques spatiales, différents enjeux économiques et environnementaux, des connaissances incomplètes sur les potentiels acteurs et un nombre élevé de scénarios d’accident possibles. Le cas d’étude a été résolu en utilisant différentes techniques d’analyse décisionnelle telles que la comparaison des loteries et les outils MCDA (Multiple Criteria Decision Analysis).Une nouvelle méthode de classification ordinale, nommée Dynamic-R, est née de cette thèse, visant à fournir une notation complète et convaincante. La méthode développée a fourni des résultats intéressants au cas d’étude et des propriétés théoriques très intéressantes qui sont présenté dans les chapitres 6 et 7 de ce manuscrit<br>The thesis is motivated by an interesting case study related to environmental risk assessment. The case study problem consists on assessing the impact of a nuclear accident taking place in the marine environment. This problem is characterized by spatial characteristics, different assets characterizing the spatial area, incomplete knowledge about the possible stakeholders, and a high number of possible accident scenarios. A first solution of the case study problem was proposed where different decision analysis techniques were used such as lotteries comparison, and MCDA (Multiple Criteria Decision Analysis) tools. A new MCDA rating method, named Dynamic-R, was born from this thesis, aiming at providing a complete and convincing rating. The developed method provided interesting results to the case study, and very interesting theoretical properties that will be presented in chapters 6 and 7 of this manuscript

Cette thèse contient quelques problèmes de décision financière en ligne et des solutions. Les problèmes sont formulés comme des problèmes en ligne (OP) et des algorithmes en ligne (OA) sont créés pour résoudre. Comme il peut y avoir plusieurs OAs pour le même OP, il doit y avoir un critère afin de pouvoir faire des indications au sujet de la qualité d’un OA. Dans cette thèse ces critères sont le ratio compétitif (c), la différence compétitive (cd) et la performance numérique. Un OA qui a un c ou cd plus bas qu’un autre est à préférer. Un OA qui possède le c le plus petit est appelé optimal. Nous considérons les OPs suivants. Le problème de conversion en ligne (OCP), le problème de sélection de portefeuille en ligne (PSP) et le problème de gestion de trésorerie en ligne (CMP). Après le premier chapitre d’introduction, les OPs, la notation et l’état des arts dans le champ des OPs sont présentés. Dans le troisième chapitre on résoudre trois variantes des OCP avec des prix interconnectés. En Chapitre 4 on travaille encore sur le problème de recherche de série chronologie avec des prix interconnectés et on construit des nouveaux OAs. À la fin de ce chapitre l’OA k-DIV est créé pour le problème de recherche générale des k maximums. k-DIV est aussi optimal. En Chapitre 5 on résout le PSP avec des prix interconnectés. L’OA créé s’appelle OPIP et est optimal. En utilisant les idées de OPIP, on construit un OA pour le problème d’échange bidirectionnel qui s’appelle OCIP et qui est optimal. Avec OPIP, on construit un OA optimal pour le problème de recherche bidirectionnel (OA BUND) sachant les valeurs de θ_1 et θ_2. Pour des valeurs inconnues, on construit l’OA RUN qui est aussi optimal. Les chapitres 6 et 7 traitent sur le CMP. Dans les deux chapitres il y a des tests numériques afin de pouvoir comparer la performance des OAs nouveaux avec celle des OAs déjà établies. En Chapitre 6 on construit des OAs optimaux ; en chapitre 7 on construit des OA qui minimisent cd. L’OA BCSID résoudre le CMP avec des demandes interconnectées ; LOA aBBCSID résoudre le problème lorsqu’ on connaît les valeurs de θ_1,θ_2,m et M. L’OA n’est pas optimal. En Chapitre 7 on résout le CMP par rapport à m et M en minimisant cd (OA MRBD). Ensuite on construit l’OA HMRID et l’OA MRID pour des demandes interconnectées. MRID minimise cd et HMRID est un bon compromis entre la performance numérique et la minimisation de cd<br>This thesis contains several online financial decision problems and their solutions. The problems are formulated as online problems (OP) and online algorithms (OA) are created to solve them. Due to the fact that there can be various OA for the same OP, there must be some criteria with which one can make statements about the quality of an OA. In this thesis these criteria are the competitive ratio (c), the competitive difference (cd) and the numerical performance. An OA with a lower c is preferable to another one with a higher value. An OA that has the lowest c is called optimal. We consider the following OPS. The online conversion problem (OCP), the online portfolio selection problem (PSP) and the cash management problem (CMP). After the introductory chapter, the OPs, the notation and the state of the art in the field of OPs is presented. In the third chapter, three variants of the OCP with interrelated prices are solved. In the fourth chapter the time series search with interrelated prices is revisited and new algorithms are created. At the end of the chapter, the optimal OA k-DIV for the general k-max search with interrelated prices is developed. In Chapter 5 the PSP with interrelated prices is solved. The created OA OPIP is optimal. Using the idea of OPIP, an optimal OA for the two-way trading is created (OCIP). Having OCIP, an optimal OA for the bi-directional search knowing the values of θ_1 and θ_2 is created (BUND). For unknown θ_1 and θ_2, the optimal OA RUNis created. The chapter ends with an empirical (for OPIP) and experimental (for OCIP, BUND and RUN) testing. Chapters 6 and 7 deal with the CMP. In both of them, a numerical testing is done in order to compare the numerical performance of the new OAs to the one of the already established ones. In Chapter 6 an optimal OA is constructed; in Chapter 7, OAs are designed which minimize cd. The OA BCSID solves the CMP with interrelated demands to optimality. The OA aBBCSID solves the CMP when the values of de θ_1, θ_2,m and M are known; however, this OA is not optimal. In Chapter 7 the CMP is solved, knowing m and M and minimizing cd (OA MRBD). For the interrelated demands, a heuristic OA (HMRID) and a cd-minimizing OA (MRID) is presented. HMRID is good compromise between the numerical performance and the minimization of cd. The thesis concludes with a short discussion about shortcomings of the considered OPs and the created OAs. Then some remarks about future research possibilities in this field are given

Bikes sharing systems have known a growing success all over the world. Several attempts have been made since the 1960s. The latest developments in ICT have enabled the system to become efficient. People can obtain real-time information about the position of the vehicles. More than 200 cities have already introduced the system and this trend keeps on with the launching of the NYC system in spring 2013. A new avatar of these means of transportation has arrived with the introduction of Autolib in Paris end of 2011.The objective of this thesis is to propose algorithms that may help to improve this system efficiency. Indeed, operating these systems induces several issues, one of which is the regulation problem. Regulation should ensures users that a right number of vehicles are present at any station anytime in order to fulfill the demand for both vehicles and parking racks. This regulation is often executed thanks to trucks that are travelling the city. This regulation issue is crucial since empty and full stations increase users' dissatisfaction. Finding the optimal strategy for regulating a network appears to be a difficult question. This thesis is divided into two parts. The first one deals with the "static" case. In this part, users' impact on the network is neglected. This is the case at night or when the system is closed. The operator faces a given repartition of the vehicles. He wants the repartition to match a target one that is known a priori. The one-truck and multiple-truck balancing problems are addressed in this thesis. For each one, an algorithm is proposed and tested on several instances. To deal with the "dynamic" case in which users interact with the system, a simulator has been developed. It is used to compare several strategies and to monitor redistribution by using trucks. Strategies not using trucks, but incentive policies are also tested: regularly updated prices are attached to stations to deter users from parking their vehicle at specified stations. At last, the question to find the best initial inventory is also addressed. It corresponds to the case when no truck are used within the day. Two local searches are presented and both aim at minimizing the total time lost by users in the system. The results obtained can be used as inputs for the target repartitions used in the first part. During my thesis, I participated to two EURO-ROADEF challenges, the 2010 edition proposed by EDF and the 2012 one by Google. In both case, my team reached the final phase. In 2010, our method was ranked fourth over all the participants and led to the publication of an article. In 2012, we ranked eighteenth over all the participants. Both works are added in the appendix

The goal of this master’s thesis is to identify and evaluate data mining algorithms which are commonly implemented in modern Medical Decision Support Systems (MDSS). They are used in various healthcare units all over the world. These institutions store large amounts of medical data. This data may contain relevant medical information hidden in various patterns buried among the records. Within the research several popular MDSS’s are analyzed in order to determine the most common data mining algorithms utilized by them. Three algorithms have been identified: Naïve Bayes, Multilayer Perceptron and C4.5. Prior to the very analyses the algorithms are calibrated. Several testing configurations are tested in order to determine the best setting for the algorithms. Afterwards, an ultimate comparison of the algorithms orders them with respect to their performance. The evaluation is based on a set of performance metrics. The analyses are conducted in WEKA on five UCI medical datasets: breast cancer, hepatitis, heart disease, dermatology disease, diabetes. The analyses have shown that it is very difficult to name a single data mining algorithm to be the most suitable for the medical data. The results gained for the algorithms were very similar. However, the final evaluation of the outcomes allowed singling out the Naïve Bayes to be the best classifier for the given domain. It was followed by the Multilayer Perceptron and the C4.5.

As context-aware systems are becoming popular in modern society, artificial intelligence will have to consider the norms of society. However, norms and personal goals can conflict with eachother complicating how an artificial intelligence should act. In this thesis I will present a decision making algorithm for evaluating contexts where the user has preferences and are affected by norms with deadlines. The norms and user preferences can have varying levels of importance. The algorithm is demonstrated with a operational example of the algorithm on a use case of planning a user’s visit to a smart city.

Les systèmes de vélos en libre-service ont connu ces dernières années un développement sans précédent. Bien que les premières tentatives de mise en place remontent aux années 60, l'arrivée de technologies permettant un suivi des différents véhicules mis à la disposition du grand public et de l'état des bornes de stationnement en temps réel a rendu ces systèmes plus attractifs. Plus de 200 villes disposent de tels systèmes et cette tendance se poursuit avec l'entrée en fonctionnement du système de New York prévue pour mars 2013. La fin de l'année 2011 a été marquée par l'arrivée d'un nouvel avatar de ce type de transport avec la mise en place d'Autolib à Paris. L'objectif de cette thèse est de proposer des algorithmes d'aide à la décision pour l'optimisation de réseaux de transport en libre-service. L'exploitation de ces systèmes, qui fleurissent actuellement un peu partout dans le monde, pose en effet de nombreux problèmes, l'un des plus cruciaux étant celui de la régulation. Cette dernière a pour objectif de maintenir dans chaque station un nombre de vélos ni trop faible, ni trop élevé, afin de satisfaire au mieux la demande. Cette régulation se fait souvent par le biais de camions qui effectuent des tournées sur le réseau. Il apparaît rapidement que la question d'une régulation optimale à l'aide d'une flotte fixée de camions est une question difficile. La thèse est divisée en deux parties. Dans la première partie, le cas “statique” est considéré. Les déplacements de véhicules dus aux usagers sont négligés. Cela traduit la situation la nuit ou lorsque le système est fermé à la location. L'opérateur doit redistribuer les véhicules afin que ceux-ci soient disposés selon une répartition définie. Les problèmes de rééquilibrage avec un ou plusieurs camions sont traités. Pour chacun des deux cas, un algorithme est proposé et utilisé pour résoudre des instances de tailles variées. La seconde partie traite du cas “dynamique” dans lequel les utilisateurs interagissent avec le système. Afin d'étudier ce système complexe, un simulateur a été développé. Il est utilisé pour comparer différentes stratégies de redistribution des véhicules. Certaines utilisent des camions se déplaçant dans la ville pendant la journée. D'autres tentent d'organiser une régulation intrinsèque du système par le biais d'une politique d'incitation : des prix mis à jour régulièrement encouragent les usagers à rendre leur véhicule dans certaines stations. Enfin, si on choisit de ne pas utiliser de camion durant la journée, la question de la détermination du nombre optimal de véhicules à disposer à chaque station se pose. Deux méthodes de recherche locale visant à minimiser le temps total perdu par les usagers sont présentées. Les résultats obtenus peuvent servir pour la définition des répartitions cibles de la première partie. Durant ma thèse, j'ai pu participer à deux challenges EURO/ROADEF, celui de 2010 proposé par EDF et celui de 2012 proposé par Google. Dans les deux cas, mon équipe a atteint les phases finales. Lors de l'édition de 2010, notre méthode est arrivée quatrième et a donné lieu à une publication. En 2012, notre méthode est arrivée dix-huitième sur tous les participants. Les travaux menés dans ces cadres sont ajoutés en annexe<br>Bikes sharing systems have known a growing success all over the world. Several attempts have been made since the 1960s. The latest developments in ICT have enabled the system to become efficient. People can obtain real-time information about the position of the vehicles. More than 200 cities have already introduced the system and this trend keeps on with the launching of the NYC system in spring 2013. A new avatar of these means of transportation has arrived with the introduction of Autolib in Paris end of 2011.The objective of this thesis is to propose algorithms that may help to improve this system efficiency. Indeed, operating these systems induces several issues, one of which is the regulation problem. Regulation should ensures users that a right number of vehicles are present at any station anytime in order to fulfill the demand for both vehicles and parking racks. This regulation is often executed thanks to trucks that are travelling the city. This regulation issue is crucial since empty and full stations increase users' dissatisfaction. Finding the optimal strategy for regulating a network appears to be a difficult question. This thesis is divided into two parts. The first one deals with the “static” case. In this part, users' impact on the network is neglected. This is the case at night or when the system is closed. The operator faces a given repartition of the vehicles. He wants the repartition to match a target one that is known a priori. The one-truck and multiple-truck balancing problems are addressed in this thesis. For each one, an algorithm is proposed and tested on several instances. To deal with the “dynamic” case in which users interact with the system, a simulator has been developed. It is used to compare several strategies and to monitor redistribution by using trucks. Strategies not using trucks, but incentive policies are also tested: regularly updated prices are attached to stations to deter users from parking their vehicle at specified stations. At last, the question to find the best initial inventory is also addressed. It corresponds to the case when no truck are used within the day. Two local searches are presented and both aim at minimizing the total time lost by users in the system. The results obtained can be used as inputs for the target repartitions used in the first part. During my thesis, I participated to two EURO-ROADEF challenges, the 2010 edition proposed by EDF and the 2012 one by Google. In both case, my team reached the final phase. In 2010, our method was ranked fourth over all the participants and led to the publication of an article. In 2012, we ranked eighteenth over all the participants. Both works are added in the appendix

Unscheduled aircraft maintenance causes a lot problems and costs for aircraft operators. This is due to the fact that aircraft cause significant costs if flights have to be delayed or canceled and because spares are not always available at any place and sometimes have to be shipped across the world. Reducing the number of unscheduled maintenance is thus a great costs factor for aircraft operators. This thesis describes three methods for aircraft health monitoring and prediction; one method for system monitoring, one method for forecasting of time series and one method that combines the two other methods for one complete monitoring and prediction process. Together the three methods allow the forecasting of possible failures. The two base methods use decision trees for decision making in the processes and genetic optimization to improve the performance of the decision trees and to reduce the need for human interaction. Decision trees have the advantage that the generated code can be fast and easily processed, they can be altered by human experts without much work and they are readable by humans. The human readability and modification of the results is especially important to include special knowledge and to remove errors, which the automated code generation produced.

The demand for automated decision making, learning and inference in uncertain, risk sensitive and dynamically changing situations presents a challenge: to design computational approaches that promise to be widely deployable and flexible to adapt on the one hand, while offering reliable guarantees on safety on the other. The tension between these desiderata has created a gap that, in spite of intensive research and contributions made from a wide range of communities, remains to be filled. This represents an intriguing challenge that provided motivation for much of the work presented in this thesis. With these desiderata in mind, this thesis makes a number of contributions towards the development of algorithms for automated decision-making and inference under uncertainty. To facilitate inference over unobserved effects of actions, we develop machine learning approaches that are suitable for the construction of models over dynamical laws that provide uncertainty bounds around their predictions. As an example application for conservative decision-making, we apply our learning and inference methods to control in uncertain dynamical systems. Owing to the uncertainty bounds, we can derive performance guarantees of the resulting learning-based controllers. Furthermore, our simulations demonstrate that the resulting decision-making algorithms are effective in learning and controlling under uncertain dynamics and can outperform alternative methods. Another set of contributions is made in multi-agent decision-making which we cast in the general framework of optimisation with interaction constraints. The constraints necessitate coordination, for which we develop several methods. As a particularly challenging application domain, our exposition focusses on collision avoidance. Here we consider coordination both in discrete-time and continuous-time dynamical systems. In the continuous-time case, inference is required to ensure that decisions are made that avoid collisions with adjustably high certainty even when computation is inevitably finite. In both discrete-time and finite-time settings, we introduce conservative decision-making. That is, even with finite computation, a coordination outcome is guaranteed to satisfy collision-avoidance constraints with adjustably high confidence relative to the current uncertain model. Our methods are illustrated in simulations in the context of collision avoidance in graphs, multi-commodity flow problems, distributed stochastic model-predictive control, as well as in collision-prediction and avoidance in stochastic differential systems. Finally, we provide an example of how to combine some of our different methods into a multi-agent predictive controller that coordinates learning agents with uncertain beliefs over their dynamics. Utilising the guarantees established for our learning algorithms, the resulting mechanism can provide collision avoidance guarantees relative to the a posteriori epistemic beliefs over the agents' dynamics.

In advanced robot applications, the challenge today is that the robot should perform different successive subtasks to achieve one or more complicated tasks similar to human. Hence, this kind of tasks required to combine different kind of sensors in order to get full information about the work environment. However, from the point of view of control, more sensors mean more possibilities for the structure of the control system. As shown previously, vision and force sensors are the most common external sensors in robot system. As a result, in scientific papers it can be found numerous control algorithms and different structures for vision/force robot control, e.g. shared, traded control etc. The lacks in integration of vision/force robot control could be summarized as follows: • How to define which subspaces should be vision, position or force controlled? • When the controller should switch from one control mode to another one? • How to insure that the visual information could be reliably used? • How to define the most appropriated vision/force control structure? In many previous works, during performing a specified task one kind of vision/force control structure has been used which is pre-defined by the programmer. In addition to that, if the task is modified or changed, it would be much complicated for the user to describe the task and to define the most appropriated vision/force robot control especially if the user is inexperienced. Furthermore, vision and force sensors are used only as simple feedback (e.g. vision sensor is used usually as position estimator) or they are intended to avoid the obstacles. Accordingly, much useful information provided by the sensors which help the robot to perform the task autonomously is missed. In our opinion, these lacks of defining the most appropriate vision/force robot control and the weakness in the utilization from all the information which could be provided by the sensors introduce important limits which prevent the robot to be versatile, autonomous, dependable and user-friendly. For this purpose, helping to increase autonomy, versatility, dependability and user-friendly in certain area of robotics which requires vision/force integration is the scope of this thesis. More concretely: 1. Autonomy: In the term of an automatic decision system which defines the most appropriated vision/force control modes for different kinds of tasks and chooses the best structure of vision/force control depending on the surrounding environments and a priori knowledge. 2. Versatility: By preparing some relevant scenarios for different situations, where both the visual servoing and force control are necessary and indispensable. 3. Dependability: In the term of the robot should depend on its own sensors more than on reprogramming and human intervention. In other words, how the robot system can use all the available information which could be provided by the vision and force sensors, not only for the target object but also for the features extraction of the whole scene. 4. User-friendly: By designing a high level description of the task, the object and the sensor configuration which is suitable also for inexperienced user. If the previous properties are relatively achieved, the proposed robot system can: • Perform different successive and complex tasks. • Grasp/contact and track imprecisely placed objects with different poses. • Decide automatically the most appropriate combination of vision/force feedback for every task and react immediately to the changes from one control cycle to another because of occurrence of some unforeseen events. • Benefit from all the advantages of different vision/force control structures. • Benefit from all the information provided by the sensors. • Reduce the human intervention or reprogramming during the execution of the task. • Facilitate the task description and entering of a priori-knowledge for the user, even if he/she is inexperienced.

Thesis (M.Tech.) - Central University of Technology, Free State, 2006<br>The ultimate goal regarding this research was to make an intelligent learning machine, thus a new method had to be developed. This was to be made possible by creating a programme that generates another programme. By constantly changing the generated programme to improve itself, the machines are given the ability to adapt to there surroundings and, thus, learn from experience. This generated programme had to perform a specific task. For this experiment the programme was generated for a simulated PIC microcontroller aboard a simulated robot. The goal was to get the robot as close to a specific position inside a simulated maze as possible. The robot therefore had to show the ability to avoid obstacles, although only the distance to the destination was given as an indication of how well the generated programme was performing. The programme performed experiments by randomly changing a number of instructions in the current generated programme. The generated programme was evaluated by simulating the reactions of the robot. If the change to the generated programme resulted in getting the robot closer to the destination, then the changed generated programme was kept for future use. If the change resulted in a less desired reaction, then the newly generated programme was removed and the unchanged programme was kept for future use. This process was repeated for a total of one hundred thousand times before the generated program was considered valid. Because there was a very slim chance that the instruction chosen will be advantageous to the programme, it will take many changes to get the desired instruction and, thus, the desired result. After each change an evaluation was made through simulation. The amount of necessary changes to the programme is greatly reduced by giving seemingly desirable instructions a higher chance of being chosen than the other seemingly unsatisfactory instructions. Due to the extensive use of the random function in this experiment, the results differ from one another. To overcome this barrier, many individual programmes had to be generated by simulating and changing an instruction in the generated programme a hundred thousand times. This method was compared against Genetic Algorithms, which were used to generate a programme for the same simulated robot. The new method made the robot adapt much faster to its surroundings than the Genetic Algorithms. A physical robot, similar to the virtual one, was build to prove that the programmes generated could be used on a physical robot. There were quite a number of differences between the generated programmes and the way in which a human would generally construct the programme. Therefore, this method not only gives programmers a new perspective, but could also possibly do what human programmers have not been able to achieve in the past.

Due to a variety of political, economic, and technological factors, many national electricity industries around the globe are transforming from non-competitive monopolies with centralized systems to decentralized operations with competitive business units. This process, commonly referred to as deregulation (or liberalization) is driven by the belief that a monopolistic industry fails to achieve economic efficiency for consumers over the long run. Deregulation has occurred in a number of industries such as: aviation, natural gas, transportation, and telecommunications. The most recent movement involving the deregulation of the electricity marketplace is expected to yield consumer benefit as well. <P> To facilitate deregulation of the electricity marketplace, competitive business units must be established to manage various functions and services independently. In addition, these business units must be given physical property rights for certain parts of the transmission and distribution network in order to provide reliable service and make effective business decisions. However, partitioning a physical power grid into economically viable districts involves many considerations. We refer to this complex problem as the electrical power districting problem. <P> This research is intended to identify the necessary and fundamental characteristics to appropriately model and solve an electrical power districting problem. Specifically, the objectives of this research are five-fold. First, to identify the issues relevant to electrical power districting problems. Second, to investigate the similarities and differences of electrical power districting problems with other districting problems published in the research literature. Third, to develop and recommend an appropriate solution methodology for electrical power districting problems. Fourth, to demonstrate the effectiveness of the proposed solution method for a specific case of electric power districting in the Republic of Ghana, with data provided by the World Bank. Finally, to develop a decision support system for the decision makers at the World Bank for solving Ghana's electrical power districting problem.<br>Ph. D.

Automated decision making is becoming the norm across large parts of society, which raises interesting liability challenges when human control over technical systems becomes increasingly limited. This article defines "quasi-automation" as inclusion of humans as a basic rubber-stamping mechanism in an otherwise completely automated decision-making system. Three cases of quasi- automation are examined, where human agency in decision making is currently debatable: self- driving cars, border searches based on passenger name records, and content moderation on social media. While there are specific regulatory mechanisms for purely automated decision making, these regulatory mechanisms do not apply if human beings are (rubber-stamping) automated decisions. More broadly, most regulatory mechanisms follow a pattern of binary liability in attempting to regulate human or machine agency, rather than looking to regulate both. This results in regulatory gray areas where the regulatory mechanisms do not apply, harming human rights by preventing meaningful liability for socio-technical decision making. The article concludes by proposing criteria to ensure meaningful agency when humans are included in automated decision-making systems, and relates this to the ongoing debate on enabling human rights in Internet infrastructure.

An islanded power system indicates a geographical and logical detach between a portion<br />of a power system and the major grid, and often accompanies with the loss of system<br />observability. A power system islanding contingency could be one of the most severe<br />consequences of wide-area system failures. It might result in enormous losses to both the power utilities and the consumers. Even those relatively small and stable islanding events may largely disturb the consumers\' normal operation in the island. On the other hand, the power consumption in the U.S. has been largely increasing since 1970s with the respect to the bloom of global economy and mass manufacturing, and the daily increased requirements from the modern customers. Along with the extreme weather and natural disaster factors, the century old U.S. power grid is under severely tests for potential islanding disturbances. After 1980s, the invention of synchronized phasor measurement units (PMU) has broadened the horizon for system monitoring, control and protection. Its real time feature and reliable measurements has made possible many online system schemes. The recent revolution of computers and electronic devices enables the implementation of complex methods (such as data mining methods) requiring large databases in power system analysis. The proposed method presented in this dissertation is primarily focused on two studies: one power system islanding contingency detection, identification, classification and state evaluation algorithm using a decision tree algorithm and topology approach, and its application in Dominion Virginia power system; and one optimal PMU placement strategy using a binary integral programming algorithm with the consideration of system islanding and redundancy issues.<br>Ph. D.

The focus of this thesis is to develop a generic approach for solving reliability design optimisation problems which could be applicable to a diverse range of real engineering systems. The basic problem in optimal reliability design of a system is to explore the means of improving the system reliability within the bounds of available resources. Improving the reliability reduces the likelihood of system failure. The consequences of system failure can vary from minor inconvenience and cost to significant economic loss and personal injury. However any improvements made to the system are subject to the availability of resources, which are very often limited. The objective of the design optimisation problem analysed in this thesis is to minimise system unavailability (or unreliability if an unrepairable system is analysed) through the manipulation and assessment of all possible design alterations available, which are subject to constraints on resources and/or system performance requirements. This thesis describes a genetic algorithm-based technique developed to solve the optimisation problem. Since an explicit mathematical form can not be formulated to evaluate the objective function, the system unavailability (unreliability) is assessed using the fault tree method. Central to the optimisation algorithm are newly developed fault tree modification patterns (FTMPs). They are employed here to construct one fault tree representing all possible designs investigated, from the initial system design specified along with the design choices. This is then altered to represent the individual designs in question during the optimisation process. Failure probabilities for specified design cases are quantified by employing Binary Decision Diagrams (BDDs). A computer programme has been developed to automate the application of the optimisation approach to standard engineering safety systems. Its practicality is demonstrated through the consideration of two systems of increasing complexity; first a High Integrity Protection System (HIPS) followed by a Fire Water Deluge System (FWDS). The technique is then further-developed and applied to solve problems of multi-phased mission systems. Two systems are considered; first an unmanned aerial vehicle (UAV) and secondly a military vessel. The final part of this thesis focuses on continuing the development process by adapting the method to solve design optimisation problems for multiple multi-phased mission systems. Its application is demonstrated by considering an advanced UAV system involving multiple multi-phased flight missions. The applications discussed prove that the technique progressively developed in this thesis enables design optimisation problems to be solved for systems with different levels of complexity. A key contribution of this thesis is the development of a novel generic optimisation technique, embedding newly developed FTMPs, which is capable of optimising the reliability design for potentially any engineering system. Another key and novel contribution of this work is the capability to analyse and provide optimal design solutions for multiple multi-phase mission systems. Keywords: optimisation, system design, multi-phased mission system, reliability, genetic algorithm, fault tree, binary decision diagram

The aim of the present study is to develop a statistical algorithm and model associ- ated with breast and lung cancer patients. In this study, we developed several statistical softwares, R packages, and models using our new statistical approach. In the present study, we used the five parameters logistic model for determining the optimal doses of a pharmaceutical drugs, including dynamic initial points, an automatic process for outlier detection and an algorithm that develops a graphic user interface(GUI) program. The developed statistical procedure assists medical scientists by reducing their time in determining the optimal dose of new drugs, and can also easily identify which drugs need more experimentation. Secondly, in the present study, we developed a new classification method that is very useful in the health sciences. We used a new decision tree algorithm and a random forest method to rank our variables and to build a final decision tree model. The decision tree can identify and communicate complex data systems to scientists with minimal knowledge in statistics. Thirdly, we developed statistical packages using the Johnson SB probability distribu- tion which is important in parametrically studying a variety of health, environmental, and engineering problems. Scientists are experiencing difficulties in obtaining estimates for the four parameters of the subject probability distribution. The developed algorithm com- bines several statistical procedures, such as, the Newtwon Raphson, the Bisection, the Least Square Estimation, and the regression method to develop our R package. This R package has functions that generate random numbers, calculate probabilities, inverse probabilities, and estimate the four parameters of the SB Johnson probability distribution. Researchers can use the developed R package to build their own statistical models or perform desirable statistical simulations. The final aspect of the study involves building a statistical model for lung cancer sur- vival time. In developing the subject statistical model, we have taken into consideration the number of cigarettes the patient smoked per day, duration of smoking, and the age at diagnosis of lung cancer. The response variables the survival time. The significant factors include interaction. the probability density function of the survival times has been obtained and the survival function is determined. The analysis is have on your groups the involve gender and with factors. A companies with the ordinary survival function is given.

A Decision Support model for planning Intercity Railways is presented in this research. The main aim of the model is to generate inputs for the logit model existing in the Virginia Tech Transportation Systems Analysis Model (TSAM). The inputs required by the TSAM logit model are travel time, travel cost and schedule delay. Travel times and travel costs for different rail technologies are calculated using a rail network and actual or proposed rail schedules. The concept of relational databases is used in the development of the network topology. Further, an event graph approach is used for analysis of the generated network. Shortest travel times and their corresponding travel costs between origin-destination pairs are found using Floydâ s algorithm. Complete itineraries including transfers (if involved) are intrinsically held in the precedence matrix generated after running the algorithm. A standard mapping technique is used to obtain the actual routes. The algorithms developed, have been implemented in MATLAB. Schedules from the North American Passenger rail system AMTRAK are used to generate the sample network for this study. The model developed allows the user to evaluate what-if scenarios for various route frequencies and rail technologies such as Accelerail, High Speed Rail and Maglev. The user also has the option of modifying route information. Comparison of travel time values for the mentioned technology types in different corridors revealed that frequency of service has a greater impact on the total travel time in shorter distance corridors, whereas technology/line-haul speed has a greater influence on the total travel time in the longer distance corridors. This tool could be useful to make preliminary assessments of future rail systems. The network topology generated by the algorithm can further be used for network flow assignment, especially time-dependent assignment if used with dynamic graph algorithms.<br>Master of Science

This thesis investigates the efficiency of a design optimisation scheme that is appropriate for systems which require a high likelihood of functioning on demand. Traditional approaches to the design of safety critical systems follow the preliminary design, analysis, appraisal and redesign stages until what is regarded as an acceptable design is achieved. For safety systems whose failure could result in loss of life it is imperative that the best use of the available resources is made and a system which is optimal, not just adequate, is produced. The object of the design optimisation problem is to minimise system unavailability through manipulation of the design variables, such that limitations placed on them by constraints are not violated. Commonly, with mathematical optimisation problem; there will be an explicit objective function which defines how the characteristic to be minimised is related to the variables. As regards the safety system problem, an explicit objective function cannot be formulated, and as such, system performance is assessed using the fault tree method. By the use of house events a single fault tree is constructed to represent the failure causes of each potential design to overcome the time consuming task of constructing a fault tree for each design investigated during the optimisation procedure. Once the fault tree has been constructed for the design in question it is converted to a BDD for analysis. A genetic algorithm is first employed to perform the system optimisation, where the practicality of this approach is demonstrated initially through application to a High-Integrity Protection System (HIPS) and subsequently a more complex Firewater Deluge System (FDS). An alternative optimisation scheme achieves the final design specification by solving a sequence of optimisation problems. Each of these problems are defined by assuming some form of the objective function and specifying a sub-region of the design space over which this function will be representative of the system unavailability. The thesis concludes with attention to various optimisation techniques, which possess features able to address difficulties in the optimisation of safety critical systems. Specifically, consideration is given to the use of a statistically designed experiment and a logical search approach.

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.<br>Includes bibliographical references (leaves 132-138).<br>by Stephen David Patek.<br>Ph.D.

Thesis (M.S.)--University of Missouri-Columbia, 2009.<br>The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Thesis advisor: Yang Gong. "May 2009" Includes bibliographical references.

A management decision-support framework for a coal-fired power plant with solvent based post combustion CO2 capture (PCC) (integrated plant) is proposed and developed in this thesis. A brief introduction pertaining to the solvent-based PCC technology, thesis motivations and objectives are given in Chapter 1. Chapter 2 comprises a comprehensive literature review of solvent-based PCC plant from the bottom level (PCC instrumentation level) until the top level (managerial decision of PCC system). Chapter 3 describes the development of solvent-based PCC dynamic model via empirical methods. Open-loop dynamic analyses are presented to provide a deeper understanding of the dynamic behaviour of key variables in solvent-based PCC plant. Chapter 4 presents the design of the control architecture for solvent-based PCC plant. Two control algorithms developed, which utilise conventional proportional, integral and derivative (PID) controller and advanced model predictive control (MPC). Chapter 5 proposes a conceptual framework for optimal operation of the integrated plant. The MPC scheme is chosen as the control algorithm while mixed integer non-linear programming (MINLP) using genetic algorithm (GA) function is employed in the optimization algorithm. Both algorithms are integrated to produce a hybrid MPC-MINLP algorithm. Capability and applicability of the algorithm is evaluated based on 24 hours and annual operation of integrated plant. Chapter 6 extends the scope of Chapter 5 by evaluating the relevance of solvent-based PCC technology in the operation of black coal-fired power plant in Australia. This chapter considers a prevailing climate policy established in Australia namely Emission Reduction Fund (ERF). Finally, the concluding remarks and future extensions of this research are presented in Chapter 7.

This thesis presents a framework to verify asynchronous real-time systems based on model checking. These systems are modeled by using a common modeling formalism named Labeled Petri-nets(LPNs). In order to verify the real-time systems algorithmically, the zone-based timing analysis method is used for LPNs. It searches the state space with timing information (represented by zones). When there is a high degree of concurrency in the model, firing concurrent enabled transitions in different order may result in different zones, and these zones may be combined without affecting the verification result. Since the zone-based method could not deal with this problem efficiently, the POSET timing analysis method is adopted for LPNs. It separates concurrency from causality and generates an exactly one zone for a single state. But it needs to maintain an extra POSET matrix for each state. In order to save time and memory, an improved zone-based timing analysis method is introduced by integrating above two methods. It searches the state space with zones but eliminates the use of the POSET matrix, which generates the same result as with the POSET method. To illustrate these methods, a circuit example is used throughout the thesis. Since the state space generated is usually very large, a graph data structure named multi-value decision diagrams (MDDs) is implemented to store the zones compactly. In order to share common clock value of dierent zones, two zone encoding methods are described: direct encoding and minimal constraint encoding. They ignore the unnecessary information in zones thus reduce the length of the integer tuples. The effectiveness of these two encoding methods is demonstrated by experimental result of the circuit example.

Thesis (m.s.)--University of Kentucky, 2004.<br>Title from document title page (viewed Jan. 5, 2005). Document formatted into pages; contains vii, 32p. : ill. Includes abstract and vita. Includes bibliographical references (p. 30-31).

Дисертаційна робота присвячена дослідженню особливостей логічних та алгоритмічних дерев класифікації, деяких питань їх застосування в задачах інтелектуального аналізу даних, розпізнавання образів шляхом створення ефективних моделей класифікації та аналізу великих масивів даних, універсальних систем розпізнавання дискретних об’єктів. Проаналізовано та досліджено деревоподібні моделі класифікації різних типів. Розроблено комплексний метод побудови деревоподібних моделей класифікації, який базується на поетапній апроксимації масиву початкових даних НВ набором відібраних та оцінених незалежних алгоритмів розпізнавання. Розроблено метод Т – опорних множин, який полягає у відборі, фіксації набору ознак разом зі своїми значеннями – класифікаторів в структурі ЛДК. Розроблено моделі та методи побудови структур АДК двох типів, де отримані дерева класифікації складаються з різних алгоритмів та методів розпізнавання й в свою чергу представляють собою нові алгоритми, схеми класифікації. Розроблено модель та метод побудови обмежених структур АДК, які спрямовані на добудову лише тих шляхів, ярусів конструкції дерева класифікації, де є найбільша кількість помилок усіх типів класифікації. Розроблено методи знаходження подібності конструкцій логічних дерев в задачах мінімізації їх структур. Здійснено числову оцінку впливу процедури обрізки побудованого ЛДК – перестановки ярусів, рівнів, блоків структури ЛДК в конструкції регулярного логічного дерева на його загальну складність. Здійснено оцінку збіжності процедури побудови моделей дерев класифікації, запропонованих в дослідженні структур АДК для умов слабкого та сильного розділення класів початкової НВ. Present thesis is devoted to studying the specific features of both logical and algorithmic classification trees, some issues of their use in the problems of intelligence data analysis and image recognition by creating the efficient models of classification and analysis of large and super-large data arrays and universal systems of discrete object recognition. Tree-like classification models of various types are analyzed and studied. The concept of constructing tree-like classification models based on a step-by-step approximation of an array of initial TS data with a set of selected and evaluated independent recognition algorithms is proposed. The concept of T – reference sets is proposed, which consists in selecting and fixing a set of features together with their classifier values in the LCT structure. Models and methods for constructing ACT structures of two types are developed, where the resulting classification trees consist of various algorithms and recognition methods, which in turn represent new algorithms and classification schemes. A model and method for constructing bounded ACT structures are developed, which are aimed at completing only those paths, tiers of the classification tree structure where there are the largest number of errors of all classification types. Methods for finding the similarity of logical tree structures in problems of minimizing their structures are developed. A numerical estimate of the impact of the pruning procedure of the constructed LCT – rearrangement of tiers, levels, and blocks of the LCT structure in the construction of a regular logical tree on its overall complexity is given. The convergence of the procedure for constructing classification tree models proposed in the study of ACT structures for conditions of weak and strong separation of initial TS classes is estimated. Диссертационная работа посвящена исследованию особенностей логических и алгоритмических деревьев классификации, некоторых вопросов их применения в задачах интеллектуального анализа данных, распознавания образов путем создания эффективных моделей классификации и анализа больших массивов данных, универсальных систем распознавания дискретных объектов. В работе исследована и решена актуальная научно-прикладная проблема развития теории анализа и синтеза деревьев решений, разработки моделей, методов, прикладного инструментария интеллектуального анализа данных на основе логических и алгоритмических деревьев классификации с большей точностью, уменьшенной сложностью моделей и повышенной эффективностью классификации дискретных объектов. Проанализированы и исследованы древовидные модели классификации различных типов. Предложен комплексный метод построения древовидных моделей классификации, который базируется на поэтапной аппроксимации массива начальных данных набором отобранных и оцененных независимых алгоритмов распознавания. Предложен метод Т – опорных множеств, который заключается в отборе, фиксации набора признаков вместе со своими значениями – классификаторов в структуре ЛДК. Разработаны модели и методы построения структур АДК двух типов, где полученные деревья классификации состоят из различных алгоритмов и методов распознавания и в свою очередь представляют собой новые алгоритмы, схемы классификации. Разработана модель и метод построения ограниченных структур АДК, которые направлены на достройку только тех путей, ярусов конструкции дерева классификации, где есть наибольшее количество ошибок всех типов классификации. Разработаны методы нахождения сходства конструкций логических деревьев в задачах минимизации их структур. Дана числовая оценка влияния процедуры обрезки построенного ЛДК – перестановки ярусов, уровней, блоков структуры ЛДК в конструкции регулярного логического дерева на его общую сложность. Дана оценка сходимости процедуры построения моделей деревьев классификации, предложенных в исследовании структур АДК для условий слабого и сильного разделения классов начальной ОВ. Разработан программный инструментарий построения структур ЛДК/АДК (моделей деревьев классификации различных типов), который позволяет решать широкий спектр разнотипных прикладных задач распознавания образов. По результатам диссертационного исследования проведено экспериментальное моделирование, апробация разработанных моделей и методов на практических задачах, а определения эффективности предложенных в работе методов построения АДК осуществлено на основе интегральных показателей качества моделей.

In todays society, a growing number of users are demanding more sophisticated services from wireless communication devices. In order to meet these rising demands, it has been proposed to increase the capacity of the wireless channel by using more than one antenna at the transmitter and receiver, thereby creating multiple-input multiple-output (MIMO) channels. Using MIMO communication techniques is a promising way to improve wireless communication technology because in a rich-scattering environment the capacity increases linearly with the number of antennas. However, increasing the number of transmit antennas also increases the complexity of detection at an exponential rate. So while MIMO channels have the potential to greatly increase the capacity of wireless communication systems, they also force a greater computational burden on the receiver. Even suboptimal MIMO detectors that have relatively low complexity, have been shown to achieve unprecedented high spectral efficiency. However, their performance is far inferior to the optimal MIMO detector, meaning they require more transmit power. The fact that the optimal MIMO detector is an impractical solution due to its prohibitive complexity, leaves a performance gap between detectors that require reasonable complexity and the optimal detector. The objective of this research is to bridge this gap and provide new solutions for managing the inherent performance-complexity trade-off in MIMO detection. The optimally-ordered decision-feedback (BODF) detector is a standard low-complexity detector. The contributions of this thesis can be regarded as ways to either improve its performance or reduce its complexity - or both. We propose a novel algorithm to implement the BODF detector based on noise-prediction. This algorithm is more computationally efficient than previously reported implementations of the BODF detector. Another benefit of this algorithm is that it can be used to easily upgrade an existing linear detector into a BODF detector. We propose the partial decision-feedback detector as a strategy to achieve nearly the same performance as the BODF detector, while requiring nearly the same complexity as the linear detector. We propose the family of Chase detectors that allow the receiver to trade performance for reduced complexity. By adapting some simple parameters, a Chase detector may achieve near-ML performance or have near-minimal complexity. We also propose two new detection strategies that belong to the family of Chase detectors called the B-Chase and S-Chase detectors. Both of these detectors can achieve near-optimal performance with less complexity than existing detectors. Finally, we propose the double-sorted lattice-reduction algorithm that achieves near-optimal performance with near-BODF complexity when combined with the decision-feedback detector.

The renewal of derelict inner-city urban districts suffering from high levels of socio-economic deprivation and sustainability problems is one of the key research areas in urban planning and regeneration. Subject to a wide range of social, economical and environmental factors, decision support for an optimal allocation of residential and service lots within such districts is regarded as a complex task. Pre-assessment of various neighbourhood factors before the commencement of actual location allocation of various public services is considered paramount to the sutainable outcome of regeneration projects. Spatial assessment in such derelict built-up areas requires planning of lot assignment for residential buildings in a way to maximize accessibility to public services while minimizing the deprivation of built neighbourhood areas. However, the prediction of socio-economic deprivation impact on the regeneration districts in order to optimize the location-allocation of public service infrastructure is a complex task. This is generally due to the highly conflicting nature of various service structures with various socio-economic and environmental factors. In regards to the problem given above, this thesis presents the development of an evolutionary AI-based decision support systemto assist planners with the assessment and optimization of regeneration districts. The work develops an Adaptive Network Based Fuzzy Inference System (ANFIS) based module to assess neighbourhood districts for various deprivation factors. Additionally an evolutionary genetic algorithms based solution is implemented to optimize various urban regeneration layouts based upon the prior deprivation assessment model. The two-tiered framework initially assesses socio-cultural deprivation levels of employment, health, crime and transport accessibility in neighbourhood areas and produces a deprivation impact matrix overthe regeneration layout lots based upon a trained, network-based fuzzy inference system. Based upon this impact matrix a genetic algorithm is developed to optimize the placement of various public services (shopping malls, primary schools, GPs and post offices) in a way that maximize the accessibility of all services to regenerated residential units as well as contribute to minimize the measure of deprivation of surrounding neighbourhood areas. The outcome of this research is evaluated over two real-world case studies presenting highly coherent results. The work ultimately produces a smart urban regeneration toolkit which provides designer and planner decision support in the form of a simulation toolkit.

Given the increasing problem of fraud, crime, and national security threats, assessing credibility is a recurring research topic in Information Systems and in other disciplines. Decision support systems can help. But the success of the system depends on reliable cues that can distinguish deceptive/truthful behavior and on a proven classification algorithm. This investigation aims to identify linguistic cues that distinguish deceivers from truthtellers; and it aims to demonstrate how the cues can successfully classify deception and truth.Three new datasets were gathered: 202 fraudulent and nonfraudulent financial disclosures (10-Ks), a laboratory experiment that asked twelve questions of participants who answered deceptively to some questions and truthfully to others (Cultural Interviews), and a mock crime experiment where some participants stole a ring from an office and where all participants were interviewed as to their guilt or innocence (Mock Crime). Transcribed participant responses were investigated for distinguishing cues and used for classification testing.Disfluencies (e.g., um, uh, repeated phrases, etc.), hedging words (e.g., perhaps, may, etc.), and interjections (e.g., okay, like, etc.) are theoretically developed as potential cues to deception. Past research provides conflicting evidence regarding disfluency use and deception. Some researchers opine that deception increases cognitive load, which lowers attentional resources, which increases speech errors, and thereby increases disfluency use (i.e., Cognitive-Load Disfluency theory). Other researchers argue against the causal link between disfluencies and speech errors, positing that disfluencies are controllable and that deceivers strategically avoid disfluencies to avoid appearing hesitant or untruthful (i.e., Suppression-Disfluency theory). A series of t-tests, repeated measures GLMs, and nested-model design regressions disconfirm the Suppression-Disfluency theory. Um, uh, and interjections are used at an increased rate by deceivers in spontaneous speech. Reverse order questioning did not increase disfluency use. Fraudulent 10-Ks have a higher mean count of hedging words.Statistical classifiers and machine learning algorithms are demonstrated on the three datasets. A feature reduction by backward Wald stepwise with logistic regression had the highest classification accuracies (69%-87%). Accuracies are compared to professional interviewers and to previously researched classification models. In many cases the new models demonstrated improvements. 10-Ks are classified with 69% overall accuracy.

Despite the rapid growth of machine learning in the past decades, deploying automated decision making systems in practice remains a challenge for most companies. On an average day, data scientists face substantial barriers to serving models into production. Production environments are complex ecosystems, still largely based on on-premise technology, where modifications are timely and costly. Given the rapid pace with which the machine learning environment changes these days, companies struggle to stay up-to-date with the latest software releases, the changes in regulation and the newest market trends. As a result, machine learning often fails to deliver according to expectations. And more worryingly, this can result in unwanted risks for users, for the company itself and even for the society as a whole, insofar the negative impact of these risks is perpetuated in time. In this context, adaptation is an instrument that is both necessary and crucial for ensuring a sustainable deployment of industrial machine learning. This dissertation is devoted to developing theoretical and practical tools to enable adaptation of machine learning models in company production environments. More precisely, we focus on devising mechanisms to exploit the knowledge acquired by models to train future generations that are better fit to meet the stringent demands of a changing ecosystem. We introduce copying as a mechanism to replicate the decision behaviour of a model using another that presents differential characteristics, in cases where access to both the models and their training data are restricted. We discuss the theoretical implications of this methodology and show how it can be performed and evaluated in practice. Under the conceptual framework of actionable accountability we also explore how copying can be used to ensure risk mitigation in circumstances where deployment of a machine learning solution results in a negative impact to individuals or organizations.<br>A pesar del rápido crecimiento del aprendizaje automático en últimas décadas, la implementación de sistemas automatizados para la toma de decisiones sigue siendo un reto para muchas empresas. Los científicos de datos se enfrentan a diario a numerosas barreras a la hora de desplegar los modelos en producción. Los entornos de producción son ecosistemas complejos, mayoritariamente basados en tecnologías on- premise, donde los cambios son costosos. Es por eso que las empresas tienen serias dificultades para mantenerse al día con las últimas versiones de software, los cambios en la regulación vigente o las nuevas tendencias del mercado. Como consecuencia, el rendimiento del aprendizaje automático está a menudo muy por debajo de las expectativas. Y lo que es más preocupante, esto puede derivar en riesgos para los usuarios, para las propias empresas e incluso para la sociedad en su conjunto, en la medida en que el impacto negativo de dichos riesgos se perpetúe en el tiempo. En este contexto, la adaptación se revela como un elemento necesario e imprescindible para asegurar la sostenibilidad del desarrollo industrial del aprendizaje automático. Este trabajo está dedicado a desarrollar las herramientas teóricas y prácticas necesarias para posibilitar la adaptación de los modelos de aprendizaje automático en entornos de producción. En concreto, nos centramos en concebir mecanismos que permitan reutilizar el conocimiento adquirido por los modelos para entrenar futuras generaciones que estén mejor preparadas para satisfacer las demandas de un entorno altamente cambiante. Introducimos la idea de copiar, como un mecanismo que permite replicar el comportamiento decisorio de un modelo utilizando un segundo que presenta características diferenciales, en escenarios donde el acceso tanto a los datos como al propio modelo está restringido. Es en este contexto donde discutimos las implicaciones teóricas de esta metodología y demostramos como las copias pueden ser entrenadas y evaluadas en la práctica. Bajo el marco de la responsabilidad accionable, exploramos también cómo las copias pueden explotarse como herramienta para la mitigación de riesgos en circunstancias en que el despliegue de una solución basada en el aprendizaje automático pueda tener un impacto negativo sobre las personas o las organizaciones.

Safety systems are designed to prevent the occurrence of certain conditions and their future development into a hazardous situation. The consequence of the failure of a safety system of a potentially hazardous industrial system or process varies from minor inconvenience and cost to personal injury, significant economic loss and death. To minimise the likelihood of a hazardous situation, safety systems must be designed to maximise their availability. Therefore, the purpose of this thesis is to propose an effective safety system design optimization scheme. A multi-objective genetic algorithm has been adopted, where the criteria catered for includes unavailability, cost, spurious trip and maintenance down time. Analyses of individual system designs are carried out using the latest advantages of the fault tree analysis technique and the binary decision diagram approach (BDD). The improved strength Pareto evolutionary approach (SPEA2) is chosen to perform the system optimization resulting in the final design specifications. The practicality of the developed approach is demonstrated initially through application to a High Integrity Protection System (HIPS) and subsequently to test scalability using the more complex Firewater Deluge System (FDS). Computer code has been developed to carry out the analysis. The results for both systems are compared to those using a single objective optimization approach (GASSOP) and exhaustive search. The overall conclusions show a number of benefits of the SPEA2 based technique application to the safety system design optimization. It is common for safety systems to feature dependency relationships between its components. To enable the use of the fault tree analysis technique and the BDD approach for such systems, the Markov method is incorporated into the optimization process. The main types of dependency which can exist between the safety system component failures are identified. The Markov model generation algorithms are suggested for each type of dependency. The modified optimization tool is tested on the HIPS and FDS. Results comparison shows the benefit of using the modified technique for safety system optimization. Finally the effectiveness and application to general safety systems is discussed.

Water is an essential resource from an environmental, biological, economic or social point of view. In basin management, the irregular distribution in time and in space of this resource is well known. This issue is worsened by extreme climate conditions, generating drought periods or flood events. For both situations, optimal management is necessary. In one case, different water uses should be supplied efficiently using the available surface and groundwater resources. In another case, the most important goal is to avoid damages in flood areas, including the loss of human lives, but also to optimize the revenue of energy production in hydropower plants, or in other uses. The approach presented in this thesis proposes to obtain optimal management rules in water resource systems. With this aim, evolutionary algorithms were combined with simulation models. The first ones, as optimization tools, are responsible for guiding the process iterations. In each iteration, a new management rule is defined in the simulation model, which is computed to comprehend the situation of the system after applying this new management. For testing the proposed methodology, four evolutionary algorithms were assessed combining them with two simulation models. The methodology was implemented in four real case studies. This thesis is presented as a compendium of five manuscripts: three scientific papers published in journals (which are indexed in the Journal Citation Report), another under review, and the last manuscript from Conference Proceedings. In the first manuscript, the Pikaia optimization algorithm was combined with the network flow SIMGES simulation model for obtaining four different types of optimal management rules in the Júcar River Basin. In addition, the parameters of the Pikaia algorithm were also analyzed to identify the best combination of them to use in the optimization process. In the second scientific paper, the multi-objective NSGA-II algorithm was assessed to obtain a parametric management rule in the Mijares River basin. In this case, the same simulation model was linked with the evolutionary algorithm. In the Conference manuscript, an in-depth analysis of the Tirso-Flumendosa-Campidano (TFM) system using different scenarios and comparing three water simulation models for water resources management was developed. The third published manuscript presented the assessment and comparison of two evolutionary algorithms for obtaining optimal rules in the TFM system using SIMGES model. The algorithms assessed were the SCE-UA and the Scatter Search. In this research paper, the parameters of both algorithms were also analyzed as it was done with the Pikaia algorithm. The management rules in the three first manuscripts were focused to avoid or minimize deficits in urban and agrarian demands and, in some case studies, also to minimize the water pumped. Finally, in the last document, two of the algorithms used in previous manuscripts were assessed, the mono-objective SCE-UA and the multi-objective NSGA-II. For this research, the algorithms were combined with RS MINERVE software to manage flood events in Visp River basin minimizing damages in risk areas and losses in hydropower plants. Results reached in the five manuscripts demonstrate the validity of the approach. In all the case studies and with the different evolutionary algorithms assessed, the obtained management rules achieved a better system management than the base scenario of each case. These results usually mean a decrease of the economic costs in the management of water resources. However, comparing the four algorithms assessed, SCE-UA algorithm proved to be the most efficient due to the different stop/convergence criteria and its formulation. Nevertheless, NSGA-II is the most recommended due to its multi-objective search focus on the enhancement of different objectives with the same importance where the decision makers can make the best decision for the management of the system.<br>El agua es un recurso esencial desde el punto de vista ambiental, biológico, económico o social. En la gestión de cuencas, es bien conocido que la distribución del recurso en el tiempo y el espacio es irregular. Este problema se agrava debido a condiciones climáticas extremas, generando períodos de sequía o inundaciones. Para ambas situaciones, una gestión óptima es necesaria. En un caso, el suministro de agua a los diferentes usos del sistema debe realizarte eficientemente empleando los recursos disponibles, tanto superficiales como subterráneos. En el otro caso, el objetivo más importante es evitar daños en las zonas de inundación, incluyendo la pérdida de vidas humanas, pero al mismo tiempo, optimizar los beneficios de centrales hidroeléctricas, o de otros usos. El enfoque presentado en esta tesis propone la obtención de reglas de gestión óptimas en sistemas reales de recursos hídricos. Con este objetivo, se combinaron algoritmos evolutivos con modelos de simulación. Los primeros, como herramientas de optimización, encargados de guiar las iteraciones del proceso. En cada iteración se define una nueva regla de gestión en el modelo de simulación, que se evalúa para conocer la situación del sistema después de aplicar esta nueva gestión. Para probar la metodología propuesta, se evaluaron cuatro algoritmos evolutivos combinándolos con dos modelos de simulación. La metodología se implementó en cuatro casos de estudio reales. Esta tesis se presenta como un compendio de cinco publicaciones: tres de ellas en revistas indexadas en el Journal Citation Report, otra en revisión y la última como publicación de un congreso. En el primer manuscrito, el algoritmo de optimización Pikaia se combinó con el modelo de simulación SIMGES para obtener reglas de gestión óptimas en la cuenca del río Júcar. Además, se analizaron los parámetros del algoritmo para identificar la mejor combinación de los mismos en el proceso de optimización. El segundo artículo evaluó el algoritmo multi-objetivo NSGA-II para obtener una regla de gestión paramétrica en la cuenca del río Mijares. En el trabajo presentado en el congreso se desarrolló un análisis en profundidad del sistema Tirso-Flumendosa-Campidano utilizando diferentes escenarios y comparando tres modelos de simulación para la gestión de los recursos hídricos. En el tercer manuscrito publicado se evaluó y comparó dos algoritmos evolutivos (SCE-UA y Scatter Search) para obtener reglas de gestión óptimas en el sistema Tirso-Flumendosa-Campidano. En dicha investigación también se analizaron los parámetros de ambos algoritmos. Las reglas de gestión de estas cuatro publicaciones se enfocaron en evitar o minimizar los déficits de las demandas urbanas y agrarias y, en ciertos casos, también en minimizar el caudal bombeado, utilizando para ello el modelo de simulación SIMGES. Finalmente, en la última publicación se evaluó el algoritmo mono-objetivo SCE-UA y el multi-objetivo NSGA-II. Para esta investigación, los algoritmos se combinaron con el software RS MINERVE para gestionar los eventos de inundación en la cuenca del río Visp minimizando los daños en las zonas de riesgo y las pérdidas en las centrales hidroeléctricas. Los resultados obtenidos en las cinco publicaciones demuestran la validez del enfoque. En todos los casos de estudio y, con los diferentes algoritmos evolutivos evaluados, las reglas de gestión obtenidas lograron una mejor gestión del sistema que el escenario base de cada caso. Estos resultados suelen representar una disminución de los costes económicos en la gestión de los recursos hídricos. Comparando los cuatro algoritmos, el SCE-UA demostró ser el más eficiente debido a los diferentes criterios de convergencia. No obstante, el NSGA-II es el más recomendado debido a su búsqueda multi-objetivo enfocada en la mejora, con la misma importancia, de diferentes objetivos, donde los tomadores de decisiones pueden sel<br>L'aigua és un recurs essencial des del punt de vista ambiental, biològic, econòmic o social. En la gestió de conques, és ben conegut que la distribució del recurs en el temps i l'espai és irregular. Este problema s'agreuja a causa de condicions climàtiques extremes, generant períodes de sequera o inundacions. Per a ambdúes situacions, una gestió òptima és necessària. En un cas, el subministrament d'aigua als diferents usos del sistema ha de realitzar-se eficientment utilitzant els recursos disponibles, tant superficials com subterranis. En l'altre cas, l'objectiu més important és evitar danys en les zones d'inundació, incloent la pèrdua de vides humanes, però al mateix temps, optimitzar els beneficis de centrals hidroelèctriques, o d'altres usos. La proposta d'esta tesi és l'obtenció de regles de gestió òptimes en sistemes reals de recursos hídrics. Amb este objectiu, es van combinar algoritmes evolutius amb models de simulació. Els primers, com a ferramentes d'optimització, encarregats de guiar les iteracions del procés. En cada iteració es definix una nova regla de gestió en el model de simulació, que s'avalua per a conéixer la situació del sistema després d'aplicar esta nova gestió. Per a provar la metodologia proposada, es van avaluar quatre algoritmes evolutius combinant-los amb dos models de simulació. La metodologia es va implementar en quatre casos d'estudi reals. Esta tesi es presenta com un compendi de cinc publicacions: tres d'elles en revistes indexades en el Journal Citation Report, una altra en revisió i l'última com a publicació d'un congrés. En el primer manuscrit, l'algoritme d'optimització Pikaia es va combinar amb el model de simulació SIMGES per a obtindre regles de gestió òptimes en la conca del riu Xúquer. A més, es van analitzar els paràmetres de l'algoritme per a identificar la millor combinació dels mateixos en el procés d'optimització. El segon article va avaluar l'algoritme multi-objectiu NSGA-II per a obtindre una regla de gestió paramètrica en la conca del riu Millars. En el treball presentat en el congrés es va desenvolupar una anàlisi en profunditat del sistema Tirso-Flumendosa-Campidano utilitzant diferents escenaris i comparant tres models de simulació per a la gestió dels recursos hídrics. En el tercer manuscrit publicat es va avaluar i va comparar dos algoritmes evolutius (SCE-UA i Scatter Search) per a obtindre regles de gestió òptimes en el sistema Tirso-Flumendosa-Campidano. En dita investigació també es van analitzar els paràmetres d'ambdós algoritmes. Les regles de gestió d'estes quatre publicacions es van enfocar a evitar o minimitzar els dèficits de les demandes urbanes i agràries i, en certs casos, també a minimitzar el cabal bombejat, utilitzant per a això el model de simulació SIMGES. Finalment, en l'última publicació es va avaluar l'algoritme mono-objectiu SCE-UA i el multi-objetiu NSGA-II. Per a esta investigació, els algoritmes es van combinar amb el programa RS MINERVE per a gestionar els esdeveniments d'inundació en la conca del riu Visp minimitzant els danys en les zones de risc i les pèrdues en les centrals hidroelèctriques. Els resultats obtinguts en les cinc publicacions demostren la validesa de la metodología. En tots els casos d'estudi i, amb els diferents algoritmes evolutius avaluats, les regles de gestió obtingudes van aconseguir una millor gestió del sistema que l'escenari base de cada cas. Estos resultats solen representar una disminució dels costos econòmics en la gestió dels recursos hídrics. Comparant els quatre algoritmes, el SCE-UA va demostrar ser el més eficient a causa dels diferents criteris de convergència. No obstant això, el NSGA-II és el més recomanat a causa de la seua cerca multi-objectiu enfocada en la millora, amb la mateixa importància, de diferents objectius, on els decisors poden seleccionar la millor opció per a la gestió del sistema.<br>Lerma Elvira, N. (2017). Assessment and implementation of evolutionary algorithms for optimal management rules design in water resources systems [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/90547<br>TESIS

Reducing unscheduled maintenance is important for aircraft operators. There are significant costs if flights must be delayed or cancelled, for example, if spares are not available and have to be shipped across the world. This thesis describes three methods of aircraft health condition monitoring and prediction; one for system monitoring, one for forecasting and one combining the two other methods for a complete monitoring and prediction process. Together, the three methods allow organizations to forecast possible failures. The first two use decision trees for decision-making and genetic optimization to improve the performance of the decision trees and to reduce the need for human interaction. Decision trees have several advantages: the generated code is quickly and easily processed, it can be altered by human experts without much work, it is readable by humans, and it requires few resources for learning and evaluation. The readability and the ability to modify the results are especially important; special knowledge can be gained and errors produced by the automated code generation can be removed. A large number of data sets is needed for meaningful predictions. This thesis uses two data sources: first, data from existing aircraft sensors, and second, sound and vibration data from additionally installed sensors. It draws on methods from the field of big data and machine learning to analyse and prepare the data sets for the prediction process.

Unmanned Aerial Vehicles (UAVs) are emerging as an ideal platform for a wide range of civil applications such as disaster monitoring, atmospheric observation and outback delivery. However, the operation of UAVs is currently restricted to specially segregated regions of airspace outside of the National Airspace System (NAS). Mission Flight Planning (MFP) is an integral part of UAV operation that addresses some of the requirements (such as safety and the rules of the air) of integrating UAVs in the NAS. Automated MFP is a key enabler for a number of UAV operating scenarios as it aids in increasing the level of onboard autonomy. For example, onboard MFP is required to ensure continued conformance with the NAS integration requirements when there is an outage in the communications link. MFP is a motion planning task concerned with finding a path between a designated start waypoint and goal waypoint. This path is described with a sequence of 4 Dimensional (4D) waypoints (three spatial and one time dimension) or equivalently with a sequence of trajectory segments (or tracks). It is necessary to consider the time dimension as the UAV operates in a dynamic environment. Existing methods for generic motion planning, UAV motion planning and general vehicle motion planning cannot adequately address the requirements of MFP. The flight plan needs to optimise for multiple decision objectives including mission safety objectives, the rules of the air and mission efficiency objectives. Online (in-flight) replanning capability is needed as the UAV operates in a large, dynamic and uncertain outdoor environment. This thesis derives a multi-objective 4D search algorithm entitled Multi- Step A* (MSA*) based on the seminal A* search algorithm. MSA* is proven to find the optimal (least cost) path given a variable successor operator (which enables arbitrary track angle and track velocity resolution). Furthermore, it is shown to be of comparable complexity to multi-objective, vector neighbourhood based A* (Vector A*, an extension of A*). A variable successor operator enables the imposition of a multi-resolution lattice structure on the search space (which results in fewer search nodes). Unlike cell decomposition based methods, soundness is guaranteed with multi-resolution MSA*. MSA* is demonstrated through Monte Carlo simulations to be computationally efficient. It is shown that multi-resolution, lattice based MSA* finds paths of equivalent cost (less than 0.5% difference) to Vector A* (the benchmark) in a third of the computation time (on average). This is the first contribution of the research. The second contribution is the discovery of the additive consistency property for planning with multiple decision objectives. Additive consistency ensures that the planner is not biased (which results in a suboptimal path) by ensuring that the cost of traversing a track using one step equals that of traversing the same track using multiple steps. MSA* mitigates uncertainty through online replanning, Multi-Criteria Decision Making (MCDM) and tolerance. Each trajectory segment is modeled with a cell sequence that completely encloses the trajectory segment. The tolerance, measured as the minimum distance between the track and cell boundaries, is the third major contribution. Even though MSA* is demonstrated for UAV MFP, it is extensible to other 4D vehicle motion planning applications. Finally, the research proposes a self-scheduling replanning architecture for MFP. This architecture replicates the decision strategies of human experts to meet the time constraints of online replanning. Based on a feedback loop, the proposed architecture switches between fast, near-optimal planning and optimal planning to minimise the need for hold manoeuvres. The derived MFP framework is original and shown, through extensive verification and validation, to satisfy the requirements of UAV MFP. As MFP is an enabling factor for operation of UAVs in the NAS, the presented work is both original and significant.

With increasing global change pressures such as urbanization and climate change, cities of the future will experience difficulties in efficiently managing scarcer and less reliable water resources. However, projections of future global change pressures are plagued with uncertainties. This increases the difficulty in developing urban water systems that are adaptable to future uncertainty. A major component of an urban water system is the distribution system, which constitutes approximately 80-85% of the total cost of the water supply system (Swamee and Sharma, 2008). Traditionally, water distribution systems (WDS) are designed using deterministic assumptions of main model input variables such as water availability and water demand. However, these deterministic assumptions are no longer valid due to the inherent uncertainties associated with them. Hence, a new design approach is required, one that recognizes these inherent uncertainties and develops more adaptable and flexible systems capable of using their active capacity to act or respond to future alterations in a timely, performance-efficient, and cost-effective manner. This study develops a framework for the design of flexible WDS that are adaptable to new, different, or changing requirements. The framework consists of two main parts. The first part consists of several components that are important in the pre and post--processing of the least-cost design methodology of a flexible WDS. These components include: the description of uncertainties affecting WDS design, identification of potential flexibility options for WDS, generation of flexibility through optimization, and a method for assessing of flexibility. For assessment a suite of performance metrics is developed that reflect the degree of flexibility of a distribution system. These metrics focus on the capability of the WDS to respond and react to future changes. The uncertainties description focuses on the spatial and temporal variation of future demand. The second part consists of two optimization models for the design of centralized and decentralized WDS respectively. The first model generates flexible, staged development plans for the incremental growth of a centralized WDS. The second model supports the development of clustered/decentralized WDS. It is argued that these clustered systems promote flexibility as they provide internal degrees of freedom, allowing many different combinations of distribution systems to be considered. For both models a unique genetic algorithm based flexibility optimization (GAFO) model was developed that maximizes the flexibility of a WDS at the least cost. The efficacy of the developed framework and tools are demonstrated through two case study applications on real networks in Uganda. The first application looks at the design of a centralized WDS in Mbale, a small town in Eastern Uganda. Results from this application indicate that the flexibility framework is able to generate a more flexible design of the centralized system that is 4% - 50% less expensive than a conventionally designed system when compared against several future scenarios. In addition, this application highlights that the flexible design has a lower regret under different scenarios when compared to the conventionally designed system (a difference of 11.2m3/US$). The second application analyzes the design of a decentralized network in the town of Aura, a small town in Northern Uganda. A comparison of a decentralized system to a centralized system is performed, and the results indicate that the decentralized system is 24% - 34% less expensive and that these cost savings are associated with the ability of the decentralized system to be staged in a way that traces the urban growth trajectory more closely. The decentralized clustered WDS also has a lower regret (a difference of 17.7m3/US$) associated with the potential future conditions in comparison with the conventionally centralized system and hence is more flexible.