A comparison between two optimisation alternatives for mapping in wireless network on chip

Network on Chip (NoC) is a well known approach that aims at improving the performance of many-core systems. The design of such systems involves the optimal mapping of tasks to nodes, and the corresponding scheduling of the tasks at every node, which results in a challenging optimisation problem considering the constraints that need to be respected. In this paper, after formalising the problem and elaborating on its complexity, we present an AI approach to solve the problem and evaluate it against a MIP approach. Our empirical evaluation shows that the AI approach is able to obtain solutions of good quality very quickly

Schedulability analysis and optimization of time-partitioned distributed real-time systems

RESUMEN: La creciente complejidad de los sistemas de control modernos lleva a muchas empresas a tener que re-dimensionar o re-diseñar sus soluciones para adecuarlas a nuevas funcionalidades y requisitos. Un caso paradigmático de esta situación se ha dado en el sector ferroviario, donde la implementación de las aplicaciones de señalización se ha llevado a cabo empleando técnicas tradicionales que, si bien ahora mismo cumplen con los requisitos básicos, su rendimiento temporal y escalabilidad funcional son sustancialmente mejorables. A partir de las soluciones propuestas en esta tesis, además de contribuir a la validación de sistemas que requieren certificación de seguridad funcional, también se creará la tecnología base de análisis de planificabilidad y optimización de sistemas de tiempo real distribuidos generales y también basados en particionado temporal, que podrá ser aplicada en distintos entornos en los que los sistemas ciberfísicos juegan un rol clave, por ejemplo en aplicaciones de Industria 4.0, en los que pueden presentarse problemas similares en el futuro.ABSTRACT:he increasing complexity of modern control systems leads many companies to have to resize or redesign their solutions to adapt them to new functionalities and requirements. A paradigmatic case of this situation has occurred in the railway sector, where the implementation of signaling applications has been carried out using traditional techniques that, although they currently meet the basic requirements, their time performance and functional scalability can be substantially improved. From the solutions proposed in this thesis, besides contributing to the assessment of systems that require functional safety certification, the base technology for schedulability analysis and optimization of general as well as time-partitioned distributed real-time systems will be derived, which can be applied in different environments where cyber-physical systems play a key role, for example in Industry 4.0 applications, where similar problems may arise in the future

Algorithms for vehicle routing problems with heterogeneous fleet, flexible time windows and stochastic travel times

Orientador: Vinícius Amaral ArmentanoTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de ComputaçãoResumo: Este trabalho aborda três variantes multiatributo do problema de roteamento de veículos. A primeira apresenta frota heterogênea, janelas de tempo invioláveis e tempos de viagem determinísticos. Para resolvê-la, são propostos algoritmos ótimos baseados na decomposição de Benders. Estes algoritmos exploram a estrutura do problema em uma formulação de programação inteira mista, e três diferentes técnicas são desenvolvidas para acelerá-los. A segunda variante contempla os atributos de frota heterogênea, janelas de tempo flexíveis e tempos de viagem determinísticos. As janelas de tempo flexíveis permitem o início do serviço nos clientes com antecipação ou atraso limitados em relação às janelas de tempo invioláveis, com custos de penalidade. Este problema é resolvido por extensões dos algoritmos de Benders, que incluem novos algoritmos de programação dinâmica para a resolução de subproblemas com a estrutura do problema do caixeiro viajante com janelas de tempo flexíveis. A terceira variante apresenta frota heterogênea, janelas de tempo flexíveis e tempos de viagem estocásticos, sendo representada por uma formulação de programação estocástica inteira mista de dois estágios com recurso. Os tempos de viagem estocásticos são aproximados por um conjunto finito de cenários, gerados por um algoritmo que os descreve por meio da distribuição de probabilidade Burr tipo XII, e uma matheurística de busca local granular é sugerida para a resolução do problema. Extensivos testes computacionais são realizados em instâncias da literatura, e as vantagens das janelas de tempo flexíveis e dos tempos de viagem estocásticos são enfatizadasAbstract: This work addresses three multi-attribute variants of the vehicle routing problem. The first one presents a heterogeneous fleet, hard time windows and deterministic travel times. To solve this problem, optimal algorithms based on the Benders decomposition are proposed. Such algorithms exploit the structure of the problem in a mixed-integer programming formulation, and three algorithmic enhancements are developed to accelerate them. The second variant comprises a heterogeneous fleet, flexible time windows and deterministic travel times. The flexible time windows allow limited early and late servicing at customers with respect to their hard time windows, at the expense of penalty costs. This problem is solved by extensions of the Benders algorithms, which include novel dynamic programming algorithms for the subproblems with the special structure of the traveling salesman problem with flexible time windows. The third variant presents a heterogeneous fleet, flexible time windows and stochastic travel times, and is represented by a two-stage stochastic mixed-integer programming formulation with recourse. The stochastic travel times are approximated by a finite set of scenarios generated by an algorithm which describes them using the Burr type XII distribution, and a granular local search matheuristic is suggested to solve the problem. Extensive computational tests are performed on instances from the literature, and the advantages of flexible windows and stochastic travel times are stressed.DoutoradoAutomaçãoDoutor em Engenharia Elétrica141064/2015-3CNP

White Paper 11: Artificial intelligence, robotics & data science

198 p. : 17 cmSIC white paper on Artificial Intelligence, Robotics and Data Science sketches a preliminary roadmap for addressing current R&D challenges associated with automated and autonomous machines. More than 50 research challenges investigated all over Spain by more than 150 experts within CSIC are presented in eight chapters. Chapter One introduces key concepts and tackles the issue of the integration of knowledge (representation), reasoning and learning in the design of artificial entities. Chapter Two analyses challenges associated with the development of theories –and supporting technologies– for modelling the behaviour of autonomous agents. Specifically, it pays attention to the interplay between elements at micro level (individual autonomous agent interactions) with the macro world (the properties we seek in large and complex societies). While Chapter Three discusses the variety of data science applications currently used in all fields of science, paying particular attention to Machine Learning (ML) techniques, Chapter Four presents current development in various areas of robotics. Chapter Five explores the challenges associated with computational cognitive models. Chapter Six pays attention to the ethical, legal, economic and social challenges coming alongside the development of smart systems. Chapter Seven engages with the problem of the environmental sustainability of deploying intelligent systems at large scale. Finally, Chapter Eight deals with the complexity of ensuring the security, safety, resilience and privacy-protection of smart systems against cyber threats.18 EXECUTIVE SUMMARY ARTIFICIAL INTELLIGENCE, ROBOTICS AND DATA SCIENCE Topic Coordinators Sara Degli Esposti ( IPP-CCHS, CSIC ) and Carles Sierra ( IIIA, CSIC ) 18 CHALLENGE 1 INTEGRATING KNOWLEDGE, REASONING AND LEARNING Challenge Coordinators Felip Manyà ( IIIA, CSIC ) and Adrià Colomé ( IRI, CSIC – UPC ) 38 CHALLENGE 2 MULTIAGENT SYSTEMS Challenge Coordinators N. Osman ( IIIA, CSIC ) and D. López ( IFS, CSIC ) 54 CHALLENGE 3 MACHINE LEARNING AND DATA SCIENCE Challenge Coordinators J. J. Ramasco Sukia ( IFISC ) and L. Lloret Iglesias ( IFCA, CSIC ) 80 CHALLENGE 4 INTELLIGENT ROBOTICS Topic Coordinators G. Alenyà ( IRI, CSIC – UPC ) and J. Villagra ( CAR, CSIC ) 100 CHALLENGE 5 COMPUTATIONAL COGNITIVE MODELS Challenge Coordinators M. D. del Castillo ( CAR, CSIC) and M. Schorlemmer ( IIIA, CSIC ) 120 CHALLENGE 6 ETHICAL, LEGAL, ECONOMIC, AND SOCIAL IMPLICATIONS Challenge Coordinators P. Noriega ( IIIA, CSIC ) and T. Ausín ( IFS, CSIC ) 142 CHALLENGE 7 LOW-POWER SUSTAINABLE HARDWARE FOR AI Challenge Coordinators T. Serrano ( IMSE-CNM, CSIC – US ) and A. Oyanguren ( IFIC, CSIC - UV ) 160 CHALLENGE 8 SMART CYBERSECURITY Challenge Coordinators D. Arroyo Guardeño ( ITEFI, CSIC ) and P. Brox Jiménez ( IMSE-CNM, CSIC – US )Peer reviewe

ERP implementation methodologies and frameworks: a literature review

Enterprise Resource Planning (ERP) implementation is a complex and vibrant process, one that involves a combination of technological and organizational interactions. Often an ERP implementation project is the single largest IT project that an organization has ever launched and requires a mutual fit of system and organization. Also the concept of an ERP implementation supporting business processes across many different departments is not a generic, rigid and uniform concept and depends on variety of factors. As a result, the issues addressing the ERP implementation process have been one of the major concerns in industry. Therefore ERP implementation receives attention from practitioners and scholars and both, business as well as academic literature is abundant and not always very conclusive or coherent. However, research on ERP systems so far has been mainly focused on diffusion, use and impact issues. Less attention has been given to the methods used during the configuration and the implementation of ERP systems, even though they are commonly used in practice, they still remain largely unexplored and undocumented in Information Systems research. So, the academic relevance of this research is the contribution to the existing body of scientific knowledge. An annotated brief literature review is done in order to evaluate the current state of the existing academic literature. The purpose is to present a systematic overview of relevant ERP implementation methodologies and frameworks as a desire for achieving a better taxonomy of ERP implementation methodologies. This paper is useful to researchers who are interested in ERP implementation methodologies and frameworks. Results will serve as an input for a classification of the existing ERP implementation methodologies and frameworks. Also, this paper aims also at the professional ERP community involved in the process of ERP implementation by promoting a better understanding of ERP implementation methodologies and frameworks, its variety and history

A Polyhedral Study of Mixed 0-1 Set

We consider a variant of the well-known single node fixed charge network flow set with constant capacities. This set arises from the relaxation of more general mixed integer sets such as lot-sizing problems with multiple suppliers. We provide a complete polyhedral characterization of the convex hull of the given set