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

An Improved Chimp Optimization Algorithm for Short-term Hydrothermal Scheduling

学校读者我要写书评

暂无评论

IAENG International Journal of Computer Science

IAENG International Journal of Computer Science 2022年第3期49卷 666页

作者： Chen, Gonggui Wang, Shumin He, Yongsheng Shang, Wanfeng Long, Hongyu Key Laboratory of Industrial Internet of Things and Networked Control Ministry of Education Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing University of Posts and Telecommunications Chongqing400065 China State Grid Chongqing Electric Power Company Chongqing400015 China Guangdong Provincial Key Lab of Robotics and Intelligent System Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen Shenzhen518055 China Chongqing Key Laboratory of Complex Systems and Bionic Control Chongqing University of Posts and Telecommunications Chongqing400065 China

The short-term hydrothermal scheduling (STHS) is a complex non-linear, non-convex and high-dimensional mathematical optimization problem. Due to the fact that the original chimp optimization algorithm (ChOA) is likely to fall into local optimum and has the disadvantage of low population diversity, an improved chimp optimization algorithm (IChOA) is proposed to solve the STHS problem. Firstly, Logistic-Tent chaotic mapping is employed to initialize the population and increase the population diversity. Then a new nonlinear convergence factor is introduced to make the optimization search process more applicable to STHS problems. Next, particle swarm algorithm (PSO) and gravitational search algorithm (GSA) are combined to enhance the shortcoming and balance the global search ability and local exploration ability of ChOA. Moreover, Cauchy mutation and opposition-based learning strategy are supplemented as perturbation interference when the optimal position is not updated to improve the ability to leap out of the local optimum. Finally, a graded optimization strategy is adopted for the constraint handing of dynamic reservoir balance and thermal power balance. Three standard hydrothermal power systems are utilized to verify the practicability and validity of the proposed method. Results of simulations reveal that IChOA has significant competitive advantages in addressing the STHS problem. © 2022, IAENG International Journal of Computer Science. All Rights Reserved.

关键词： Particle swarm optimization (PSO)

Fuzzy Rate Analysis of Operators and its Applications in Linear Spaces

学校读者我要写书评

暂无评论

Research Square

Research Square 2021年

作者： Zhang, Yijin Li, Honggang Jin, Maoming Lin, Zongbing Nanjing Changjiang Waterway Engineering Bureau China Key Lab of Intelligent Analysis and Decision on Complex Systems Key Laboratory of Industrial Internet of Things and Networked Control Ministry of Education Chongqing University of Posts and Telecommunications Chongqing400065 China Pass College Chongqing Technology and Business University Chongqing401520 China Institute of Nonlinear Analysis Research Changjiang Normal University Chongqing400803 China School of Mathematics and Computer Science Panzhihua University Panzhihua617000 China

In this paper, a new concept, the fuzzy rate of an operator in linear spaces is proposed for the very first time. Some properties and basic principles of it are studied. Fuzzy rate of an operator B which is specific i... 详细信息

关键词： Membership functions

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater’s Condition

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an O(T max{c,1−c}) network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the number of rounds and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T 1−c). Moreover, if the loss functions are strongly convex, then the network regret bound is reduced to O(log(T)), and the network cumulative constraint violation bound is reduced to O(√log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is the first to achieve reduced (network) cumulative constraint violation bounds for (distributed) online convex optimization with adversarial constraints under Slater’s condition. Finally, the theoretical results are verified through numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

Almost equitable partitions and controllability of leader–follower multi-agent systems

学校读者我要写书评

暂无评论

Automatica 2021年 131卷

作者： Xiufeng Zhang Jian Sun Key Lab of Intelligent Control and Decision of Complex Systems Beijing Institute of Technology Beijing 100081 China Beijing Institute of Technology Chongqing Innovation Center Chonqing 401120 China

In this paper, the controllability of leader–follower multi-agent systems is studied from the perspective of graph theory. It is known that, for a given graph, the number of cells of an almost equitable partition (AEP) provides an upper bound on the controllability index . In this context, the main contribution here is an efficient algorithm to construct the maximal AEP for a given graph with a set of leaders. Specifically, we first establish the relationship between an AEP and the distance partition (DP) for the single-leader setting. It is shown that the cells of an AEP are subsets of cells of the DP. We extend the results to the multiple-leader case and develop a convergent algorithm to efficiently compute the maximal AEP. Finally, numerical examples are provided to show the effectiveness of the proposed method.

关键词：

Procedure Recognition by Knowledge-Driven Segmentation in Robotic-Assisted Vitreoretinal Surgery

学校读者我要写书评

暂无评论

Procedure Recognition by Knowledge-Driven Segmentation in Ro...

IEEE International Conference on Robotics and Automation (ICRA)

作者： Zhen Li Yawen Deng Qiang Ye Weihong Yu Haoxiang Qi Yaliang Liu Zhangguo Yu Gui-Bin Bian School of Electronic and Information Engineering Tongji University Shanghai China Institute of Automation Chinese Academy of Sciences Beijing China School of Mechatronic Engineering Beijing Institute of Technology Beijing China Department of Ophthalmology Peking Union Medical College Hospital Chinese Academy of Medical Sciences and Peking Union Medical College Beijing China Key Laboratory of Biomimetic Robots and Systems Ministry of Education Beijing China International Joint Research Laboratory of Biomimetic Robots and Systems Ministry of Education Beijing China State Key Laboratory of Intelligent Control and Decision of Complex System Beijing China

ISBN: (数字)9798350384574

ISBN: (纸本)9798350384581

Internal limiting membrane (ILM) peeling is a vital vitreoretinal surgery procedure. However, due to the thickness of just 1-2 micrometers and the intricacies associated with its varying density and adhesion, the difficulty of manipulation exceeds the physiological limits of human perception and operation. Surgical robot is characterized by high precision and stability. However, navigating intricate intraocular environments and handling minuscule high-precision areas remain enormous challenges. These include issues of uneven lighting, field-of-view loss, and motion blur. This paper proposed a perception method named ‘Multimodal Surgical Process Recognition based on Domain Knowledge and Segmentation (MSPR-DKS),’ designed to address these challenges and provide input for the precise control of robots. Moreover, a comprehensive dataset focused on ILM peeling during macular hole surgeries was established. Experimental results underscore the efficacy of this approach, with segmentation accuracies exceeding 99.27% for instruments and macular holes and an average accuracy of 98.97% in recognizing surgical processes. This study paves the way for leveraging domain knowledge and image segmentation to improve robot-assisted manipulation of soft tissues in ophthalmology.

关键词： Image segmentation Visualization Accuracy Medical robotics Motion segmentation Surgery Lighting

Large scale online kernel learning

学校读者我要写书评

暂无评论

The Journal of Machine Learning Research

The Journal of Machine Learning Research 2016年第1期17卷

作者： Kevin Murphy Bernhard Schölkopf Jing Lu Steven C. H. Hoi Jialei Wang Peilin Zhao Zhi-Yong Liu Google MPI for Intelligent Systems School of Information Systems Singapore Management University Singapore Department of Computer Science University of Chicago Chicago IL Institute for Infocomm Research A*STAR Connexis Singapore State Key Lab of Management and Control for Complex System Chinese Academy of Sciences Beijing China

In this paper, we present a new framework for large scale online kernel learning, making kernel methods efficient and scalable for large-scale online learning applications. Unlike the regular budget online kernel learning scheme that usually uses some budget maintenance strategies to bound the number of support vectors, our framework explores a completely different approach of kernel functional approximation techniques to make the subsequent online learning task efficient and scalable. Specifically, we present two different online kernel machine learning algorithms: (i) Fourier Online Gradient Descent (FOGD) algorithm that applies the random Fourier features for approximating kernel functions; and (ii) Nyström Online Gradient Descent (NOGD) algorithm that applies the Nyström method to approximate large kernel matrices. We explore these two approaches to tackle three online learning tasks: binary classification, multi-class classification, and regression. The encouraging results of our experiments on large-scale datasets validate the effectiveness and efficiency of the proposed algorithms, making them potentially more practical than the family of existing budget online kernel learning approaches.

关键词： kernel approximation large scale machine learning online learning

Privacy-Preserving Brain-Computer Interfaces: A Systematic Review

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xia, Kun Duch, Wlodzislaw Sun, Yu Xu, Kedi Fang, Weili Luo, Hanbin Zhang, Yi Sang, Dong Xu, Xiaodong Wang, Fei-Yue Wu, Dongrui The Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Zhejiang Lab Hangzhou311121 China The Department of Informatics School of Physics Astronomy and Informatics Neurocognitive Laboratory Center for Modern Interdisciplinary Technologies Nicolaus Copernicus University Torun Poland The Ministry of Education Key Laboratory for Biomedical Engineering Zhejiang University Hangzhou China The Zhejiang University School of Medicine National Clinical Research Center for Child Health Hangzhou China Department of Biomedical Engineering Zhejiang University Hangzhou China The School of Civil and Hydraulic Engineering Huazhong University of Science and Technology Wuhan430074 China The College of Public Administration Huazhong University of Science and Technology Wuhan430074 China The NetsUnion Clearing Corporation Beijing100045 China The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100049 China

A brain-computer interface (BCI) establishes a direct communication pathway between the human brain and a computer. It has been widely used in medical diagnosis, rehabilitation, education, entertainment, etc. Most research so far focuses on making BCIs more accurate and reliable, but much less attention has been paid to their privacy. Developing a commercial BCI system usually requires close collaborations among multiple organizations, e.g., hospitals, universities, and/or companies. Input data in BCIs, e.g., electroencephalogram (EEG), contain rich privacy information, and the developed machine learning model is usually proprietary. Data and model transmission among different parties may incur significant privacy threats, and hence privacy protection in BCIs must be considered. Unfortunately, there does not exist any contemporary and comprehensive review on privacy-preserving BCIs. This paper fills this gap, by describing potential privacy threats and protection strategies in BCIs. It also points out several challenges and future research directions in developing privacy-preserving BCIs. © 2024, CC BY.

关键词： Differential privacy

Mathematical model of brain tumour growth with drug resistance

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Trobia, José Tian, Kun Batista, Antonio M. Grebogi, Celso Ren, Hai-Peng Santos, Moises S. Protachevicz, Paulo R. Borges, Fernando S. Szezech, José D. Viana, Ricardo L. Caldas, Iberê L. Iarosz, Kelly C. Department of Mathematics and Statistics State University of Ponta Grossa Ponta GrossaPR84030-900 Brazil Graduate in Science Program - Physics State University of Ponta Grossa Ponta GrossaPR84030-900 Brazil Shaanxi Key Lab of Complex System Control and Intelligent Information Processing Xi’an University of Technology Xi’anPR710048 China Institute of Physics University of São Paulo São PauloSP05508-900 Brazil Institute for Complex Systems and Mathematical Biology University of Aberdeen AberdeenAB24 3UE United Kingdom Xi’an Technological University Xi’anPR710021 China Center for Mathematics Computation and Cognition Federal University of ABC São Bernardo do CampoSP09606-045 Brazil Department of Physics Federal University of Paraná CuritibaPR80060-000 Brazil Faculdade de Telêmaco Borba FATEB Telêmaco BorbaPR84266-010 Brazil

Brain tumours are masses of abnormal cells that can grow in an uncontrolled way in the brain. There are different types of malignant brain tumours. Gliomas are malignant brain tumours that grow from glial cells and are identified as astrocytoma, oligodendroglioma, and ependymoma. We study a mathematical model that describes glia-neuron interaction, glioma, and chemotherapeutic agent. In this work, we consider drug sensitive and resistant glioma cells. We show that continuous and pulsed chemotherapy can kill glioma cells with a minimal loss of neurons. © 2020, CC BY.

关键词： Tumors

Effects of drug resistance in the tumour-immune system with chemotherapy treatment

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Trobia, José Gabrick, Enrique C. Seifert, Evandro G. Borges, Fernando S. Protachevicz, Paulo R. Szezech, José D. Iarosz, Kelly C. Santos, Moises S. Caldas, Iberê L. Tian, Kun Ren, Hai-Peng Grebogi, Celso Batista, Antonio M. Graduate Program in Science - Physics State University of Ponta Grossa Ponta GrossaPR84030-900 Brazil Department of Mathematics and Statistics State University of Ponta Grossa Ponta GrossaPR84030-900 Brazil Department of Physics State University of Ponta Grossa Ponta GrossaPR84030-900 Brazil Center for Mathematics Computation and Cognition Federal University of ABC São Bernardo do CampoSP09606-045 Brazil Institute of Physics University of São Paulo São PauloSP05508-900 Brazil Faculty of Telêmaco Borba FATEB Telêmaco BorbaPR84266-010 Brazil Graduate Program in Chemical Engineering Federal Technological University of Paraná Ponta Grossa Paraná84016-210 Brazil Shaanxi Key Lab of Complex System Control and Intelligent Information Processing Xi’an University of Technology Xi’an710048 China Xi’an Technological University Xi’an710021 China Institute for Complex Systems and Mathematical Biology University of Aberdeen AberdeenAB24 3UE United Kingdom

Cancer is a term used to refer to a large set of diseases. The cancerous cells grow and divide and, as a result, they form tumours that grow in size. The immune system recognise the cancerous cells and attack them, though, it can be weakened by the cancer. One type of cancer treatment is chemotherapy, which uses drugs to kill cancer cells. Clinical, experimental, and theoretical research has been developed to understand the dynamics of cancerous cells with chemotherapy treatment, as well as the interaction between tumour growth and immune system. We study a mathematical model that describes the cancer growth, immune system response, and chemotherapeutic agents. The immune system is composed of resting cells that are converted to hunting cells to combat the cancer. In this work, we consider drug sensitive and resistant cancer cells. We show that the tumour growth can be controlled not only by means of different chemotherapy protocols, but also by the immune system that attacks both sensitive and resistant cancer cells. Furthermore, for all considered protocols, we demonstrate that the time delay from resting to hunting cells plays a crucial role in the combat against cancer cells. Copyright © 2020, The Authors. All rights reserved.

关键词： Chemotherapy