发布求助
文献互助 智能选刊 最新文献

2018 IEEE Workshop on Complexity in Engineering (COMPENG)最新文献

筛选
英文 中文
Logic Gates Implementation with Coupled Oscillators 用耦合振荡器实现逻辑门
2018 IEEE Workshop on Complexity in Engineering (COMPENG) Pub Date : 2018-10-01 DOI: 10.1109/CompEng.2018.8536222
M. Bonnin, F. Bonani, F. Traversa
{"title":"Logic Gates Implementation with Coupled Oscillators","authors":"M. Bonnin, F. Bonani, F. Traversa","doi":"10.1109/CompEng.2018.8536222","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536222","url":null,"abstract":"The rapid request increase for computing resources is leading to explore novel and often intriguing computing architectures. Among them, coupled oscillators have been rediscovered as a potential “beyond Moore” solution for several applications. We discuss in this work the realization of a complete set of logic gates (NOT and MAJORITY operators) as well as an inverter and a register employing coupled RLC oscillators with non-linear (cubic) resistance. The simple design allows for both analytical and numerical analysis, and it is ultimately realizable as discrete component hardware for testing purposes. It represents a simple tool to explore applications involving new computing paradigms.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"33 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":"121245031","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}
引用次数: 2
Advanced Testing Chain Supporting the Validation of Smart Grid Systems and Technologies 支持智能电网系统和技术验证的先进测试链
2018 IEEE Workshop on Complexity in Engineering (COMPENG) Pub Date : 2018-10-01 DOI: 10.1109/CompEng.2018.8536223
R. Brandl, P. Kotsampopoulos, G. Lauss, Marios Maniatopoulos, M. Nuschke, Juan Montoya, T. Strasser, Diana Strauss-Mincu
{"title":"Advanced Testing Chain Supporting the Validation of Smart Grid Systems and Technologies","authors":"R. Brandl, P. Kotsampopoulos, G. Lauss, Marios Maniatopoulos, M. Nuschke, Juan Montoya, T. Strasser, Diana Strauss-Mincu","doi":"10.1109/CompEng.2018.8536223","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536223","url":null,"abstract":"New testing and development procedures and methods are needed to address topics like power system stability, operation and control in the context of grid integration of rapidly developing smart grid technologies. In this context, individual testing of units and components has to be reconsidered and appropriate testing procedures and methods need to be described and implemented. This paper addresses these needs by proposing a holistic and enhanced testing methodology that integrates simulation/software- and hardware-based testing infrastructure. This approach presents the advantage of a testing environment, which is very close to field testing, includes the grid dynamic behavior feedback and is risks-free for the power system, for the equipment under test and for the personnel executing the tests. Furthermore, this paper gives an overview of successful implementation of the proposed testing approach within different testing infrastructure available at the premises of different research institutes in Europe.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"89 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":"122162192","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}
引用次数: 8
Agent-Based Model and Simulations of the Management of Ports: The Import Processes at the Port of Genoa 基于代理的港口管理模型与仿真:热那亚港的进口流程
2018 IEEE Workshop on Complexity in Engineering (COMPENG) Pub Date : 2018-10-01 DOI: 10.1109/CompEng.2018.8536243
O. Senturk, N. Tala, L. Ponta, S. Cincotti
{"title":"Agent-Based Model and Simulations of the Management of Ports: The Import Processes at the Port of Genoa","authors":"O. Senturk, N. Tala, L. Ponta, S. Cincotti","doi":"10.1109/CompEng.2018.8536243","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536243","url":null,"abstract":"Ports have an integral role of our economy, they are strategic places of exchange, and especially over the last few decades and with the phenomenon of globalization, the ports are a reality in continuous movement and growth. Therefore, they are operating places of extreme complexity, especially in their logistics functions of transport management. The paper deals with the modelling and implementation of the import process of goods in a port in order to make more organized, fast and efficient complex logistics network, through ad-hoc development policies. To this purpose, we develop an agent-based model (ABM) of a port, populated by the real main actors (stakeholders) involved in the port activities. The model simulates the actual port processes, i.e., the sending of goods, the acceptation or not of imported goods, the planning of transports etc. With this framework, the business process is implemented for developing a computer supported management tool to handle the port activities flow. The tool is designed for the integration in a virtual infrastructure that allows an advanced operational management of port traffics. By modelling the time documentation according to the specification of the Genoa case, the business case of the port of Genoa is tested. Results show that the mechanism implemented simulates the actual process. Moreover some bottleneck are discovered, such as delays to the handling of the containers and queues formation due to missing documentation or documentation with errors or not ready.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"12 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":"126406483","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}
引用次数: 1
Highly Stable Rotating Machine Models Using the State-Space-Nodal Real-Time Solver 基于状态-空间-节点实时求解器的高稳定旋转机械模型
2018 IEEE Workshop on Complexity in Engineering (COMPENG) Pub Date : 2018-10-01 DOI: 10.1109/CompEng.2018.8536236
C. Dufour
{"title":"Highly Stable Rotating Machine Models Using the State-Space-Nodal Real-Time Solver","authors":"C. Dufour","doi":"10.1109/CompEng.2018.8536236","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536236","url":null,"abstract":"This paper presents a set of rotating machine models, namely synchronous, asynchronous and permanent magnet synchronous machines, with increased stability characteristics compared to traditional state-space based methods. In this work, the machine models are all derived using the state-space-nodal (SSN) theory. This results in machine models that are stable without any parasitic load or numerical snubber. This is an important improvement for these models in solver packages based on the state-space approach, such as SimPowerSystems or PLECS.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"41 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":"132322872","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}
引用次数: 5
Collective Effects and Performance of Algorithmic Electric Vehicle Charging Strategies 算法电动汽车充电策略的集体效应与性能
2018 IEEE Workshop on Complexity in Engineering (COMPENG) Pub Date : 2018-10-01 DOI: 10.1109/CompEng.2018.8536246
Miroslav Gardlo, L. Buzna, Rui Carvalho, R. Gibbens, F. Kelly
{"title":"Collective Effects and Performance of Algorithmic Electric Vehicle Charging Strategies","authors":"Miroslav Gardlo, L. Buzna, Rui Carvalho, R. Gibbens, F. Kelly","doi":"10.1109/CompEng.2018.8536246","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536246","url":null,"abstract":"We combine the power flow model with the proportionally fair optimization criterion to study the control of congestion within a distribution electric grid network. The form of the mathematical optimization problem is a convex second order cone that can be solved by modern non-linear interior point methods and constitutes the core of a dynamic simulation of electric vehicles (EV) joining and leaving the charging network. The preferences of EV drivers, represented by simple algorithmic strategies, are conveyed to the optimizing component by realtime adjustments to user-specific weighting parameters that are then directly incorporated into the objective function. The algorithmic strategies utilize a small number of parameters that characterize the user's budgets, expectations on the availability of vehicles and the charging process. We investigate the collective behaviour emerging from individual strategies and evaluate their performance by means of computer simulation.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"343 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":"115889431","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}
引用次数: 0
Online Learning Search for Stackelberg Game Strategy 在线学习搜索Stackelberg游戏策略
2018 IEEE Workshop on Complexity in Engineering (COMPENG) Pub Date : 2018-10-01 DOI: 10.1109/CompEng.2018.8536234
J. Janáček, Marek Kvet
{"title":"Online Learning Search for Stackelberg Game Strategy","authors":"J. Janáček, Marek Kvet","doi":"10.1109/CompEng.2018.8536234","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536234","url":null,"abstract":"This paper deals with the public service system design problem, in which we consider more service providers competing for the profit. We assume that the profit of a provider is proportional to transportation performance necessary to satisfy the demands of system users. The considered profit may be enlarged by system reengineering, which consists in changing current positions of some centers operated by the considered provider. Since each center relocation causes some reaction of other providers to maximize their profit, the providers' behavior can be modelled by Stackelberg's game. In this paper, we introduce an approximate solving technique for a special Stackelberg's game played by a leading service provider and other mutually cooperating providers represented by the follower. The strategy of the leading service provider may be sensitive to some parameters. To find their suitable settings, we suggest an online learning algorithm.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"84 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":"114362124","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}
引用次数: 1
A Data-Driven Method to Dissect the Dynamics of the Causal Influence in Complex Dynamical Systems 复杂动力系统因果影响动力学分析的数据驱动方法
2018 IEEE Workshop on Complexity in Engineering (COMPENG) Pub Date : 2018-10-01 DOI: 10.1109/CompEng.2018.8536232
Violet Mwaffo, J. Keshavan, T. Hedrick, J. Humbert
{"title":"A Data-Driven Method to Dissect the Dynamics of the Causal Influence in Complex Dynamical Systems","authors":"Violet Mwaffo, J. Keshavan, T. Hedrick, J. Humbert","doi":"10.1109/CompEng.2018.8536232","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536232","url":null,"abstract":"In several natural and physical systems, reconstructing the graph underlying the interactions is fundamental to understand the interplay between units and the mechanisms at the base of their collective behavior. This is the case of coupled networked dynamical systems where due to several environmental and physical factors such as obstacles, sensors limited range, or components failure, the interaction network might vary in time and space. Currently, such dynamics cannot be fully captured by most existing tools nor there exists any available tools to capture these changes in real time. Here, we present a novel method to infer changes in the causal influence of units of a coupled dynamical system. The approach builds on network and information theories to propose a metric evaluating the influence as time evolves of any node on others. The method is validated on self-propelled particles where particles influence status is subject to vary over time. Our proposed method is expected to enrich the toolbox for reconstructing directed interactions in quasi-real time with few data.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"23 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":"114884508","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}
引用次数: 2
A Bilateral Teleoperation Approach for Interface Algorithms in Distributed Real-Time Simulations 分布式实时仿真中接口算法的双边遥操作方法
2018 IEEE Workshop on Complexity in Engineering (COMPENG) Pub Date : 2018-10-01 DOI: 10.1109/CompEng.2018.8536241
M. Stevic, A. Monti
{"title":"A Bilateral Teleoperation Approach for Interface Algorithms in Distributed Real-Time Simulations","authors":"M. Stevic, A. Monti","doi":"10.1109/CompEng.2018.8536241","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536241","url":null,"abstract":"Distributed simulation has an emerging role in enabling flexible environment for assessment of next-generation power systems. Geographically distributed real-time simulation (GD-RTS) environment established by virtual interconnection of Digital Real-Time Simulators (DRTS) located at geographically dispersed laboratories allows for holistic testing of novel devices and concepts. Main challenges associated with establishing GD-RTS environment are ensuring simulation stability and providing simulation fidelity of high degree. The issue of designing a cosimulation Interface Algorithm (IA) that meets these requirements is closely related to the bilateral teleoperation concept in robotics. In this work we analyze applicability of wave variables, one of the most widely used method for bilateral teleoperation. Wave variables ensure simulation stability in presence of large time delays. Simulation fidelity of IA has been improved by introducing transformation of wave variables to dynamic phasor domain.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"7 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":"131232578","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}
引用次数: 6
Emergency Medical System Design Using Kernel Search 基于核搜索的应急医疗系统设计
2018 IEEE Workshop on Complexity in Engineering (COMPENG) Pub Date : 2018-10-01 DOI: 10.1109/CompEng.2018.8536240
L. Jánošíková, P. Jankovič
{"title":"Emergency Medical System Design Using Kernel Search","authors":"L. Jánošíková, P. Jankovič","doi":"10.1109/CompEng.2018.8536240","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536240","url":null,"abstract":"The paper deals with location of the standby sites of emergency vehicles in a large-scale area. We propose a mathematical programming model that preserves the current number of vehicles and looks for better station location. The optimization criterion is to minimize the average response time. Large problem instances are intractable in a reasonable amount of time and that is why a modification of the kernel search heuristic is proposed to get an approximate solution. A computer simulation model is used to evaluate the current and the proposed system in the Slovak Republic. The model was calibrated using real data on emergency trips.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"123 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":"124188974","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}
引用次数: 2
On the Complexity of Robust Stability Analysis of Polytopic LTI Systems 多面体LTI系统鲁棒稳定性分析的复杂性
2018 IEEE Workshop on Complexity in Engineering (COMPENG) Pub Date : 2018-10-01 DOI: 10.1109/CompEng.2018.8536239
G. Chesi
{"title":"On the Complexity of Robust Stability Analysis of Polytopic LTI Systems","authors":"G. Chesi","doi":"10.1109/CompEng.2018.8536239","DOIUrl":"https://doi.org/10.1109/CompEng.2018.8536239","url":null,"abstract":"Robust stability analysis of polytopic linear time-invariant (LTI) systems is a basic problem in engineering. This paper analyzes the complexity of three fundamental methods used to address this problem, all of them providing a sufficient and necessary condition (with finite and known sizes) for robust stability. The first method is based on the use of a polynomially parameter-dependent Lyapunov function. The second method is a simplified version of the Routh-Hurwitz stability criterion. Lastly, the third method is based on eigenvalue combinations. It is explained that the robust stability conditions provided by these three methods require to establish positive definiteness of symmetric matrix forms (SMFs) over the simplex. Also, it is explained that a sufficient condition for the latter problem can be given in terms of a linear matrix inequality (LMI) feasibility test. Hence, the complexity of the three methods is analyzed and compared by deriving the number of scalar variables in the LMI feasibility tests. A numerical example is also presented to investigate the computational time of these tests.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"35 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":"127786678","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}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信