检索结果-内蒙古大学图书馆

A robust consensus algorithm for current sharing and voltage regulation in DC microgrids

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Cucuzzella, Michele Trip, Sebastian De Persis, Claudio Cheng, Xiaodong Ferrara, Antonella Van Der Schaft, Arjan Jan C. Wilems Center for Systems and Control Enteg Faculty of Science and Engineering University of Groningen Nijenborgh 4 Groningen9747 AG Dipartimento di Ingegneria Industriale e Dell'Informazione University of Pavia via Ferrata 5 Pavia27100 Italy Johann Bernoulli Institute for Mathematics and Computer Science University of Groningen Nijenborgh 9 Groningen9747 AG

In this paper a novel distributed control algorithm for current sharing and voltage regulation in Direct Current (DC) microgrids is proposed. The DC microgrid is composed of several Distributed Generation units (DGUs), including Buck converters and current loads. The considered model permits an arbitrary network topology and is affected by unknown load demand and modelling uncertainties. The proposed control strategy exploits a communication network to achieve proportional current sharing using a consensus-like algorithm. Voltage regulation is achieved by constraining the system to a suitable manifold. Two robust control strategies of Sliding Mode (SM) type are developed to reach the desired manifold in a finite time. The proposed control scheme is formally analyzed, proving the achievement of proportional current sharing, while guaranteeing that the weighted average voltage of the microgrid is identical to the weighted average of the voltage references. Copyright © 2017, The Authors. All rights reserved.

关键词： Topology

Corrigendum to “A probabilistic approach for designing nonlinear optimal robust tracking controllers for unmanned aerial vehicles” [Appl. Soft Comput. 34 (2015) 26–28]

学校读者我要写书评

暂无评论

Applied Soft Computing 2018年 71卷 1216-1216页

作者： Paulo André S. Giacomin Elder M. Hemerly Witold Pedrycz Departamento de Ciências Exatas e Tecnológicas Universidade Estadual de Santa Cruz Ilhéus Bahia Brazil Systems and Control Department Technological Institute of Aeronautics São José dos Campos São Paulo Brazil Department of Electrical & Computer Engineering University of Alberta Edmonton T6R 2V4 AB Canada Department of Electrical and Computer Engineering Faculty of Engineering King Abdulaziz University Jeddah 21589 Saudi Arabia Systems Research Institute Polish Academy of Sciences Warsaw Poland

Optimal distributed control for platooning via sparse coprime factorizations

学校读者我要写书评

暂无评论

Optimal distributed control for platooning via sparse coprim...

2016 American control Conference, ACC 2016

作者： SabǍu, Şerban OarǍ, Cristian Warnick, Sean Jadbabaie, Ali Electrical and Computer Engineering Dept. Stevens Institute of Technology HobokenNJ United States Automatic Control Dept. University Politehnica Bucharest Romania Information and Decision Algorithms Laboratories Faculty of the Computer Science Department Brigham Young University United States Electrical and Systems Engineering Dept. University of Pennsylvania United States

ISBN: (纸本)9781467386821

We introduce a novel distributed control architecture for disturbances attenuation in heterogeneous platoons of linear and time-invariant autonomous agents that inherits the performance achievable by the leader-follower control policies. We provide a Youla-like parameterization for the class of all distributed controllers such that the sparsity constraints are imposed on the controllers' left coprime factors, outlining a new concept of structural constraints in distributed control. The proposed scheme lends itself to optimal controller design via norm based costs, it guarantees string stability and completely eliminates the accordion effect from the behavior of the platoon. The distributed controller is proven to attain global optimality for heterogeneous platoons and H2 costs and can easily reconfigure such as to remain optimal during formation merging/exiting maneuvers. The scheme is amenable to a GPS time base synchronization mechanism, allowing for the exact compensation of the time delays induced by the wireless communications. © 2016 American Automatic control Council (AACC).

关键词：

Towards Realistic Face Photo-Sketch Synthesis via Composition-Aided GANs

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Yu, Jun Shi, Shengjie Gao, Fei Tao, Dacheng Huang, Qingming Key Laboratory of Complex Systems Modeling and Simulation School of Computer Science and Technology Hangzhou Dianzi University Hangzhou310018 China State Key Laboratory of Integrated Services Networks Xidian University Xian710071 China UBTech Sydney Artificial Intelligence Institute The School of Information Technologies Faculty of Engineering and Information Technologies The University of Sydney J12 Cleveland St DarlingtonNSW2008 Australia School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing100190 China

Face photo-sketch synthesis aims at generating a facial sketch/photo conditioned on a given photo/sketch. It is of wide applications including digital entertainment and law enforcement. Precisely depicting face photos/sketches remains challenging due to the restrictions on structural realism and textural consistency. While existing methods achieve compelling results, they mostly yield blurred effects and great deformation over various facial components, leading to the unrealistic feeling of synthesized images. To tackle this challenge, in this work, we propose to use the facial composition information to help the synthesis of face sketch/photo. Specially, we propose a novel composition-aided generative adversarial network (CA-GAN) for face photo-sketch synthesis. In CA-GAN, we utilize paired inputs including a face photo/sketch and the corresponding pixel-wise face labels for generating a sketch/photo. In addition, to focus training on hard-generated components and delicate facial structures, we propose a compositional reconstruction loss. Finally, we use stacked CA-GANs (SCA-GAN) to further rectify defects and add compelling details. Experimental results show that our method is capable of generating both visually comfortable and identity-preserving face sketches/photos over a wide range of challenging data. Our method achieves the state-of-the-art quality, reducing best previous Fréchet Inception distance (FID) by a large margin. Besides, we demonstrate that the proposed method is of considerable generalization ability. We have made our code and results publicly available: Https://***/ca-gan/. Copyright © 2017, The Authors. All rights reserved.

关键词： Generative adversarial networks

On the polynomial parity argument complexity of the Combinatorial Nullstellensatz

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Belovs, Aleksandrs Ivanyos, Gábor Qiao, Youming Santha, Miklos Yang, Siyi Faculty of Computing University of Latvia Institute for Computer Science and Control Hungarian Academy of Sciences Budapest Hungary Centre for Quantum Computation and Intelligent Systems University of Technology Sydney Australia IRIF Université Paris Diderot CNRS Paris75205 France Centre for Quantum Technologies National University of Singapore MajuLab CNRS Singapore117543 Singapore Centre for Quantum Technologies National University of Singapore Singapore117543 Singapore

The complexity class PPA consists of NP-search problems which are reducible to the parity principle in undirected graphs. It contains a wide variety of interesting problems from graph theory, combinatorics, algebra and number theory, but only a few of these are known to be complete in the class. Before this work, the known complete problems were all discretizations or combinatorial analogues of topological fixed point theorems. Here we prove the PPA-completeness of two problems of radically different style. They are PPA-Circuit CNSS and PPA-Circuit Chevalley, related respectively to the Combinatorial Nullstellensatz and to the Chevalley-Warning Theorem over the two elements field F2. The input of these problems contain PPA-circuits which are arithmetic circuits with special symmetric properties that assure that the polynomials computed by them have always an even number of zeros. In the proof of the result we relate the multilinear degree of the polynomials to the parity of the maximal parse subcircuits that compute monomials with maximal multilinear degree, and we show that the maximal parse subcircuits of a PPA-circuit can be paired in polynomial time. Copyright © 2017, The Authors. All rights reserved.

关键词： Polynomial approximation

Computational analysis of the structural properties of economic and financial networks

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Emmert-Streib, Frank Musa, Aliyu Baltakys, Kestutis Kanniainen, Juho Tripathi, Shailesh Yli-Harja, Olli Jodlbauer, Herbert Dehmer, Matthias Predictive Medicine and Data Analytics Lab Department of Signal Processing Tampere University of Technology Finland Institute of Biosciences and Medical Technology Tampere Finland Industrial and Information Management Tampere University of Technology Tampere Finland Institute for Systems Biology Seattle United States Institute for Intelligent Production Faculty for Management University of Applied Sciences Upper Austria Steyr Campus Austria Department for Biomedical Computer Science and Mechatronics UMIT - The Health and Lifesciences University Hall in Tyrol Austria College of Computer and Control Engineering Nankai University Tianjin300350 China

In recent years, methods from network science are gaining rapidly interest in economics and finance. A reason for this is that in a globalized world the interconnectedness among economic and financial entities are crucial to understand and networks provide a natural framework for representing and studying such systems. In this paper, we are surveying the use of networks and network-based methods for studying economy related questions. We start with a brief overview of graph theory and basic definitions. Then we discuss descriptive network measures and network complexity measures for quantifying structural properties of economic networks. Finally, we discuss different network and tree structures as relevant for applications. Copyright © 2017, The Authors. All rights reserved.

关键词： Finance

Hearing loss prevalence and years lived with disability, 1990-2019: Findings from the Global Burden of Disease Study 2019

学校读者我要写书评

暂无评论

The Lancet 2021年第10278期397卷 996-1009页

作者： Haile, Lydia M. Kamenov, Kaloyan Briant, Paul Svitil Orji, Aislyn U. Steinmetz, Jaimie D. Abdoli, Amir Abdollahi, Mohammad Abu-Gharbieh, Eman Afshin, Ashkan Ahmed, Haroon Rashid, Tarik Ahmed Akalu, Yonas Alahdab, Fares Alanezi, Fahad Mashhour Alanzi, Turki M. Al Hamad, Hanadi Ali, Liaqat Alipour, Vahid Al-Raddadi, Rajaa M. Amu, Hubert Arabloo, Jalal Arab-Zozani, Morteza Arulappan, Judie Ashbaugh, Charlie Atnafu, Desta Debalkie Babar, Zaheer-Ud-Din Baig, Atif Amin Banik, Palash Chandra Bärnighausen, Till Winfried Barrow, Amadou Bender, Rose G. Bhagavathula, Akshaya Srikanth Bhardwaj, Nikha Bhardwaj, Pankaj Bibi, Sadia Bijani, Ali Burkart, Katrin Cederroth, Christopher R. Charan, Jaykaran Choudhari, Sonali Gajanan Chu, Dinh-Toi Couto, Rosa A.S. Dagnew, Amare Belachew Dagnew, Baye Dahlawi, Saad M.A. Dai, Xiaochen Dandona, Lalit Dandona, Rakhi Desalew, Assefa Dhamnetiya, Deepak Dhimal, Mandira Lamichhane Dhimal, Meghnath Doyle, Kerrie E. Duncan, Bruce B. Ekholuenetale, Michael Filip, Irina Fischer, Florian Franklin, Richard Charles Gaidhane, Abhay Motiramji Gaidhane, Shilpa Gallus, Silvano Ghamari, Farhad Ghashghaee, Ahmad Ghozali, Ghozali Gilani, Syed Amir Glǎvan, Ionela-Roxana Golechha, Mahaveer Goulart, Barbara Niegia Garcia Gupta, Veer Bala Gupta, Vivek Kumar Hamidi, Samer Hammond, Billy Randall Hay, Simon I. Hayat, Khezar Heidari, Golnaz Hoffman, Howard J. Hopf, Kathleen Pillsbury Hosseinzadeh, Mehdi Househ, Mowafa Hussain, Rabia Hwang, Bing-Fang Iavicoli, Ivo Ibitoye, Segun Emmanuel Ilesanmi, Olayinka Stephen Irvani, Seyed Sina Naghibi Islam, Sheikh Mohammed Shariful Iwagami, Masao Jacob, Louis Jayapal, Sathish Kumar Jha, Ravi Prakash Jonas, Jost B. Kalhor, Rohollah Al-Salihi, Nawzad Kameran Kandel, Himal Kasa, Ayele Semachew Kayode, Gbenga A. Khalilov, Rovshan Khan, Ejaz Ahmad Khatib, Mahalaqua Nazli Kosen, Soewarta Koyanagi, Ai Kumar, G. Anil Landires, Ivan Lasrado, Savita Lim, Stephen S. Liu, Xuefeng Lobo, Stany W. Lugo, Alessandra Makki, Alaa Mendoza, Walter Mersha, Amanual Getnet Mihretie, Kebadnew Mulatu Institute for Health Metrics and Evaluation University of Washington Seattle WA United States Department of Noncommunicable Diseases World Health Organization (WHO) Geneva Switzerland Department of Parasitology and Mycology Jahrom University of Medical Sciences Jahrom Iran The Institute of Pharmaceutical Sciences (TIPS) Tehran University of Medical Sciences Tehran Iran School of Pharmacy Tehran University of Medical Sciences Tehran Iran Clinical Sciences Department University of Sharjah Sharjah United Arab Emirates Department of Health Metrics Sciences School of Medicine University of Washington Seattle WA United States Department of Biosciences COMSATS Institute of Information Technology Islamabad Pakistan Department of Computer Science and Engineering University of Kurdistan Hewler Erbil Iraq Department of Medical Physiology University of Gondar Gondar Ethiopia Mayo Evidence-based Practice Center Mayo Clinic Foundation for Medical Education and Research Rochester MN United States Imam Abdulrahman Bin Faisal University Dammam Saudi Arabia Health Information Management and Technology Department Dammam Saudi Arabia Geriatric and Long Term Care Department Hamad Medical Corporation Doha Qatar Rumailah Hospital Hamad Medical Corporation Doha Qatar Department of Biological Sciences National University of Medical Sciences (NUMS) Rawalpindi Pakistan Health Management and Economics Research Center Tehran Iran Department of Community Medicine King Abdulaziz University Jeddah Saudi Arabia Department of Population and Behavioural Sciences University of Health and Allied Sciences Ho Ghana Social Determinants of Health Research Center Birjand University of Medical Sciences Birjand Iran Department of Maternal and Child Health Sultan Qaboos University Muscat Oman Department of Health System and Health Economics Bahir Dar University Bahir Dar Ethiopia Department of Pharmacy University of Huddersfield Huddersfield United Kingdom Unit of Biochemistry Universiti

Background: Hearing loss affects access to spoken language, which can affect cognition and development, and can negatively affect social wellbeing. We present updated estimates from the Global Burden of Disease (GBD) study on the prevalence of hearing loss in 2019, as well as the condition's associated disability. Methods: We did systematic reviews of population-representative surveys on hearing loss prevalence from 1990 to 2019. We fitted nested meta-regression models for severity-specific prevalence, accounting for hearing aid coverage, cause, and the presence of tinnitus. We also forecasted the prevalence of hearing loss until 2050. Findings: An estimated 1·57 billion (95% uncertainty interval 1·51–1·64) people globally had hearing loss in 2019, accounting for one in five people (20·3% [19·5–21·1]). Of these, 403·3 million (357·3–449·5) people had hearing loss that was moderate or higher in severity after adjusting for hearing aid use, and 430·4 million (381·7–479·6) without adjustment. The largest number of people with moderate-to-complete hearing loss resided in the Western Pacific region (127·1 million people [112·3–142·6]). Of all people with a hearing impairment, 62·1% (60·2–63·9) were older than 50 years. The Healthcare Access and Quality (HAQ) Index explained 65·8% of the variation in national age-standardised rates of years lived with disability, because countries with a low HAQ Index had higher rates of years lived with disability. By 2050, a projected 2·45 billion (2·35–2·56) people will have hearing loss, a 56·1% (47·3–65·2) increase from 2019, despite stable age-standardised prevalence. Interpretation: As populations age, the number of people with hearing loss will increase. Interventions such as childhood screening, hearing aids, effective management of otitis media and meningitis, and cochlear implants have the potential to ameliorate this burden. Because the burden of moderate-to-complete hearing loss is concentrated in countries with low health-ca

关键词：

Delay systems with Meromorphic Functions Design

学校读者我要写书评

暂无评论

Delay Systems with Meromorphic Functions Design

IEEE International Conference on control and Automation

作者： Roman Prokop Jiri Korbel Libor Pekar Department of Mathematics Tomas Bata University in Zlin Faculty of Applied Informatics Department of Computer and Communication Systems Tomas Bata University in Zlin Faculty of Applied Informatics Department of Automation and Control Engineering Tomas Bata University in Zlin Faculty of Applied Informatics

ISBN: (纸本)9781509017393

The paper is focused on systems with delay terms at the left (and the right) side of differential equations. Analysis and synthesis of delay systems can be conveniently studied through a special ring of RQ-meromorphic functions. The control methodology is based on a solution of Diophantine equations in this ring. Final controllers result in the Smith predictor like structure. controller parameters are tuned through a pole-placement problem as a desired multiple root of the characteristic closed loop equation. The methodology is illustrated by a stable second order transfer function with a dead-time term. Then the paper brings an autotuning method as a combination of biased-relay feedback estimation and the proposed algebraic control design. The developed approach is illustrated by examples in the Matlab and Simulink environment.

关键词： Delay systems Rings Diophantine equation Autotuning Relay experiment

First Steps Towards Curriculum Development Decisions From Raw Educational Data

学校读者我要写书评

暂无评论

First Steps Towards Curriculum Development Decisions From Ra...

International Conference on Development and Application systems

作者： Mirela Danubianu Faculty of Electrical Engineering and Computer Science "Stefan cel Mare " University Integrated Center for research development and innovation in Advanced Materials Nanotechnologies and Distributed Systems for fabrication and control Suceava Romania

ISBN: (纸本)9781509019946

The massive use of Information and Communication Technology in education allowed to collect and store a huge amount of various data about all educational aspects. The analysis of these raw data could lead to new, unexpected but valuable knowledge, useful for both teachers and students, and also for faculties and universities managers. In this paper a knowledge discovery in databases process, applied on data collected mainly from a Learning Management System implemented in "Stefan cel Mare" University of Suceava is presented.

关键词： Knowledge discovery in databases CRISP-DM model data mining classification association rules