J. Geisbuesch, S. Karrari, Philip Kreideweis, W. D. Sousa, M. Noe
{"title":"Set-Up of a Dynamic Multi-Purpose Power-Hardware-in-the-Loop System for New Technologies Integration","authors":"J. Geisbuesch, S. Karrari, Philip Kreideweis, W. D. Sousa, M. Noe","doi":"10.1109/CompEng.2018.8536233","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536233","url":null,"abstract":"Future requirements on the energy system give rise to a strong increase of complexity in the electricity grid. This successively prohibits the unreflected incorporation and also testing of new equipment in the grid as well as uninformed changes to its structure. A solution to this challenge is to establish a (laboratory) environment to gain realistic and reliable insights. A viable option constitutes a Power-Hardware-in-the-Loop environment providing real-time simulation and system integration facilities. The successful set-up of a medium power level (30 kVA) Power-Hardware-in-the-Loop laboratory, which represents one of the most flexible and dynamic set-ups of its kind, is described. The requirements on components are detailed and the commissioning of the system is outlined. First results for the integration of new power hardware into the grid obtained with the system are presented.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123969265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Comprehensive Network Arc Characteristic Relative to Public Service System","authors":"Marek Kvet, J. Janáček","doi":"10.1109/CompEng.2018.8536227","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536227","url":null,"abstract":"This paper deals with a way of network analysis aimed at the impact of individual arc travel time elongation on the associated service system performance. To be able to study mentioned impact, we suggest a comprehensive arc characteristic, which consists of the characteristic function and auxiliary series of affected arc sets. Based on this characteristic, the criticality of an arc can be evaluated from the point of given objective. In addition, a secondary criterion is introduced to show the size of workload transferred to other relevant network arcs. We provide a reader with a computational study performed with real road network.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124541377","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Nonlinear Dynamics at the Meso- and Nanoscale: Stochasticity Meets Determinism","authors":"Tao Wang, G. Puccioni, G. Lippi","doi":"10.1109/CompEng.2018.8536235","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536235","url":null,"abstract":"Application-driven technological progress has led to the realization of lasers whose cavity volume is below one cubic emission wavelength. Such nanodevices possess features which differ from those of standard, macroscopic lasers, such as thresh-oldless behaviour. We discuss the dynamics in lasers ranging from the mesoscale down to the nanoscale and highlight the impact of noise on the operation of systems below the macroscopic scale. Experimental and modeling issues are discussed, together with the needs for interpretative tools geared towards the investigation of these new devices, which are poised to play a substantial role in future applications and in the study of the dynamics of small systems, at the crossing points between determinism, stochasticity, finite size, and quantum effects.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116694714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Risk Perception and Epidemics in Complex Computer Networks","authors":"F. Bagnoli, E. Bellini, Emanuele Massaro","doi":"10.1109/CompEng.2018.8536247","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536247","url":null,"abstract":"We present a self-organised method for quickly obtaining the epidemic threshold of infective processes on networks. Starting from simple percolation models, we introduce the possibility that the effective infection probability is affected by the perception of the risk of being infected, given by the fraction of infected neighbours. We then extend the model to multiplex networks considering that agents (computer) can be infected by contacts on the physical network, while the information about the infection level may come from a partially different network. Finally, we consider more complex infection processes, with nonlinear interactions among agents.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128791876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Betweenness Centrality for Networks with Non-Overlapping Community Structure","authors":"Zakariya Ghalmane, M. Hassouni, H. Cherifi","doi":"10.1109/CompEng.2018.8536229","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536229","url":null,"abstract":"Evaluating the centrality of nodes in complex networks is one of the major research topics being explored due to its wide range of applications. Among the various measures that have been developed over the years, Betweenness centrality is one of the most popular. Indeed, it has proved to be efficient in many real-world situations. In this paper, we propose an extension of the Betweenness centrality designed for networks with nonoverlapping community structure. It is a linear combination of the so-called “local” and “global” Betweenness measures. The Local measure takes into account the influence of a node at the community level while the global measure depends only on the interactions between the communities. Depending of the community structure strength, more or less importance is given to each of these two elements. By using the Susceptible-Infected-Recovered (SIR) model in epidemic spreading simulations, we show that the “Weighted Community Betweenness” centrality is more efficient than the traditional Betweenness which is agnostic of the community structure. The proposed measure stands out also the traditional measure by its low complexity, allowing its use in very large scale networks.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"36 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129547650","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"2018 IEEE Workshop on Complexity in Engineering","authors":"","doi":"10.1109/compeng.2018.8536219","DOIUrl":"https://doi.org/10.1109/compeng.2018.8536219","url":null,"abstract":"","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114255174","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computation of Transportation Performance in Public Service Systems","authors":"Peter Czimmermann, M. Koháni","doi":"10.1109/CompEng.2018.8536224","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536224","url":null,"abstract":"In our contribution, we study a particular approach to test the robustness of a public service system design. We can often use scenarios where possible random failures can occur and they can influence the time accessibility of service, which is provided for system users. Construction of a suitable scenario is based on the choice of links of the transportation network, which influence the system performance in a substantial way. In such scenarios one or multiple arcs can be affected by this failure. In our contribution we present characteristics of pairs of critical arcs that can be used to develop an algorithm for the creation of critical scenarios.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126165270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Solving the Capacitated Vehicle Routing Problem Using a Parallel Micro Genetic Algorithm","authors":"Zuzana Borčinová","doi":"10.1109/CompEng.2018.8536230","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536230","url":null,"abstract":"The Capacitated Vehicle Routing Problem (CVRP) is a very extensively studied combinatorial optimization problem that aimes to determine the order in which to visit a set of customers using a homogeneous fleet of vehicles based at a single depot so that the total travel cost is minimized. In this paper, a novel coarse-grained parallel micro genetic algorithm is used for solving CVRP while the conventional migration is replaced by a synchronously seeding the overall best solution to all search processes. The computational experiments examined the behaviour of the proposed approach.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115386704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Self Imaging Configurations for Passive Global Coherent Laser Beam Combining","authors":"A. Lapucci, M. Ciofini","doi":"10.1109/CompEng.2018.8536245","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536245","url":null,"abstract":"Parallel Laser Beam Combining is widely studied as a mean to overcome the physical limits of single laser sources. It can be obtained by injection coupling of several independent laser resonators. This of course represents a complex dynamical problem, the individual lasers being non-linear oscillators. Stable single phase solutions can be obtained for the entire system of lasers as well as local domains of phase-locked elements or chaotic behaviors. In passive systems the elements locking can be pursued by means of next-neighbor coupling or global feedback. We study self-imaging optical schemes for global feedback Coherent Beam Combining (CBC). We propose guided configurations to overcome edge-losses typical of this approach. Numerical Simulations indicate this as a viable solution for fiber lasers CBC.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"332 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132910384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}