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

Spirometer and sEMG respiratory patterns for clinical decision support system

学校读者我要写书评

暂无评论

Spirometer and sEMG respiratory patterns for clinical decisi...

IEEE Instrumentation and Measurement Technology Conference

作者： Amit Krishan Kumar Mansour H. Assaf Voicu Z. Groza Emil M. Petriu Faculty of Electrical-Electronic Engineering Duy Tan University Da Nang Vietnam Key Laboratory of Complex System Intelligent Control and Decision School of Automation Beijing Institute of Technology Beijing China School of Information Technology Engineering Mathematics and Physics The University of the South Pacific Suva Republic of Fiji School of Electrical Engineering and Computer Science University of Ottawa Ottawa Canada

To improve support system for subjects with respiratory ailments, this work analyses the respiratory patterns from spirometer and surface electromyography (sEMG). The patterns are integrated with risk and biochemical systems model to optimise the clinical decision support system (CDSS). The work considers terminal events for the spirometer and sEMG. The events and their associated patterns are correlated and projected on a hyperspace prior implementing it in decision support system. The proposed method shows that the different characteristics of breathing indicate some essential hidden information which when used as 4D scattered projection, optimises the decision making in CDSS. The analysis shows the effectiveness of bimodal respiratory patterns for different breathing capacities, which is promising for the modelled conditions.

关键词：

Integrated Simulation of Process of Steel Casting on the Continuous Steel Casting Unit 2

学校读者我要写书评

暂无评论

Integrated Simulation of Process of Steel Casting on the Con...

2nd International Conference on control Systems, Mathematical Modeling, automation and Energy Efficiency, SUMMA 2020

作者： Galkin, Alexander Pimenov, Vladimer Saraev, Pavel Tyrin, Dmitry Lipetsk State Technical University Faculty of Automation and Computer Science Lipetsk Russia Novolipetsk Steel Corporation Lipetsk Russia Lipetsk State Technical University Department of Automated Control Systems Lipetsk Russia

ISBN: (纸本)9781728188409

Studying technological processes on real production equipment is associated with a large costs of resources: financial, time, etc. Therefore, various types of modeling are actively used to analyze and optimize these processes. With the development of digital technologies, it is possible to collect data about the process directly during the production. This data can be used both for direct control of the process, and for building (adjusting) the model of the process, which allows to get a "digital twin"repeating both the main properties of the modeled object and its current state. Many complex manufacturing processes involve a set of different interconnected models. In this case, the "digital twin"should contain information about the object characteristics, individual models of its functioning, the connections between these models, and the current state. These processes include many stages of metallurgical production. The paper considers complex modeling of the casting process in continuous steel casting unit. The set of models includes a model of the thermal state of the ingot during casting, a model of the stress-strain state, a model of the melt hydrodynamics, structural and concentration models of the ingot. Mathematical models of thermal and stress-strain states and the connections between them are presented. Examples of temperature fields and deformations calculation during the process of casting are given. © 2020 IEEE.

关键词： Steel ingots

Distributed Event-Triggered Bandit Convex Optimization with Time-Varying Constraints

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Wen, Guanghui Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China The Laboratory for Information and Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States The Department of Mathematics Southeast University Nanjing210096 China The Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands 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 the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms require that each agent broadcasts its decision to its neighbors at each iteration. To better utilize the limited communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2024, The Authors. All rights reserved.

关键词： Convex optimization

EDOLAB: An Open-Source Platform for Education and Experimentation with Evolutionary Dynamic Optimization Algorithms

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Peng, Mai Yazdani, Delaram She, Zeneng Yazdani, Danial Luo, Wenjian Li, Changhe Branke, Juergen Nguyen, Trung Thanh Gandomi, Amir H. Yang, Shengxiang Jin, Yaochu Yao, Xin School of Automation China University of Geosciences Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China Research Institute Faculty of Engineering and Technology Liverpool John Moores University United Kingdom School of Computer Science and Technology Harbin Institute of Technology China Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Computer Science and Technology Harbin Institute of Technology Peng Cheng Laboratory China School of Artificial Intelligence Anhui University of Sciences & Technology China Information Systems Management and Analytics in Warwick Business School University of Warwick United Kingdom Faculty of Engineering & Information Technology University of Technology Sydney Australia Obuda University Hungary School of Computer Science and Informatics De Montfort University United Kingdom Department of Artificial Intelligence School of Engineering Westlake University China School of Computer Science University of Birmingham United Kingdom

Many real-world optimization problems exhibit dynamic characteristics, posing significant challenges for traditional optimization techniques. Evolutionary Dynamic Optimization Algorithms (EDOAs) are designed to address these challenges effectively. However, in existing literature, the reported results for a given EDOA can vary significantly. This inconsistency often arises because the source codes for many EDOAs, which are typically complex, have not been made publicly available, leading to error-prone re-implementations. To support researchers in conducting experiments and comparing their algorithms with various EDOAs, we have developed an open-source MATLAB platform called the Evolutionary Dynamic Optimization LABoratory (EDOLAB). This platform not only facilitates research but also includes an educational module designed for instructional purposes. The education module allows users to observe: a) a 2-dimensional problem space and its morphological changes following each environmental change, b) the behaviors of individuals over time, and c) how the EDOA responds to environmental changes and tracks the moving optimum. The current version of EDOLAB features 25 EDOAs and four fully parametric benchmark generators. © 2023, CC BY-NC-SA.

关键词： Optimization algorithms

Heat Transfer Performance of Flat Micro-Heat Pipe with Sintered Multi-Size Copper Powder Wick

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Zhao, Zhengang Peng, Guohong Zhang, Yanhui Zhang, Dacheng Faculty of Information Engineering and Automation Kunming University of Science and Technology Kunming650500 China Yunnan Key Laboratory of Green Energy Electric Power Measurement Digitalization Control and Protection Yunnan Kunming650500 China Yunnan Key Laboratory of Computer Technologies Application Kunming650500 China

Flat Micro-Heat Pipe (FMHP) with sintered copper powder wick is a popular device for heat flux management of highly integrated electronic circuits. To this end, a Sintered Multi-size copper powder wick (SMW) is prepared, basing a Sintered Single-size copper powder wick (SSW). The evaporator and condenser section of the SMW is a doublelayer structure with two copper powder diameters to increase the evaporation and condensation rates inside the FMHP. The adiabatic section is a single-layer structure with single powder diameter to add a capillary gradient force in the liquid channel. Six SSWs with different copper powder diameters are prepared and tested to compare with SMW. The methanol pumping experiment is carried out to evaluate the capillary pressure of different wicks, and the surface temperature experiment is carried out to evaluate the thermal transfer performance of the FMHP with different wicks, respectively. The experimental results show that the liquid transfer time of the SMW is shortened 16.59% compared to the SSW. The dynamic response time constant of the SMW FMHP is decreased by 0.9 s , and the overall thermal resistance is reduced by 14.22%. The SMW can enhance the heat transfer performance of the FMHP. © 2022, The Authors. All rights reserved.

关键词： Heat pipes

On the Design of Secured and Reliable Dynamic Access control Scheme of Patient E-Healthcare Records in Cloud Environment

学校读者我要写书评

暂无评论

Computational Intelligence and Neuroscience 2022年第0期2022卷 3804553页

作者： Zala, Kirtirajsinh Thakkar, Hiren Kumar Jadeja, Rajendrasinh Dholakia, Neel H. Kotecha, Ketan Jain, Deepak Kumar Shukla, Madhu Department of Computer Engineering Marwadi University Gujarat Rajkot360006 India Department of Computer Science and Engineering School of Technology Pandit Deendayal Energy University Gujarat Gandhinagar382007 India Faculty of Technology Marwadi University Gujarat Rajkot360006 India University Pune India Key Laboratory of Intelligent Air-Ground Cooperative Control for Universities in Chongqing College of Automation Chongqing University of Posts and Telecommunications Chongqing China

Traditional healthcare services have changed into modern ones in which doctors can diagnose patients from a distance. All stakeholders, including patients, ward boy, life insurance agents, physicians, and others, have easy access to patients' medical records due to cloud computing. The cloud's services are very cost-effective and scalable, and provide various mobile access options for a patient's electronic health records (EHRs). EHR privacy and security are critical concerns despite the many benefits of the cloud. Patient health information is extremely sensitive and important, and sending it over an unencrypted wireless media raises a number of security hazards. This study suggests an innovative and secure access system for cloud-based electronic healthcare services storing patient health records in a third-party cloud service provider. The research considers the remote healthcare requirements for maintaining patient information integrity, confidentiality, and security. There will be fewer attacks on e-healthcare records now that stakeholders will have a safe interface and data on the cloud will not be accessible to them. End-to-end encryption is ensured by using multiple keys generated by the key conclusion function (KCF), and access to cloud services is granted based on a person's identity and the relationship between the parties involved, which protects their personal information that is the methodology used in the proposed scheme. The proposed scheme is best suited for cloud-based e-healthcare services because of its simplicity and robustness. Using different Amazon EC2 hosting options, we examine how well our cloud-based web application service works when the number of requests linearly increases. The performance of our web application service that runs in the cloud is based on how many requests it can handle per second while keeping its response time constant. The proposed secure access scheme for cloud-based web applications was compared to the Ethereum blo

关键词： Cost effectiveness

Distributed Constrained Online Nonconvex Optimization with Compressed Communication

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Kunpeng Xu, Lei Yi, Xinlei Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Mechanical Engineering University of Victoria VictoriaBCV8W 2Y2 Canada Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai201210 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands 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 nonconvex optimization with time-varying inequality constraints over a network of agents. For a time-varying graph, we propose a distributed online primal–dual algorithm with compressed communication to efficiently utilize communication resources. We show that the proposed algorithm establishes an O(T max{1−θ1,θ1}) network regret bound and an O(T 1−θ1/2) network cumulative constraint violation bound, where T is the number of iterations and θ1 ∈ (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 at all iterations), the network cumulative constraint violation bound is reduced to O(T 1−θ1). These bounds are comparable to the state-of-the-art results established by existing distributed online algorithms with perfect communication for distributed online convex optimization with (time-varying) inequality constraints. Finally, a simulation example is presented to validate the theoretical results. Copyright © 2025, The Authors. All rights reserved.

关键词： Convex optimization

Prototype Model of an IoT-based Digital and Smart Door Locking System with Enhanced Security

学校读者我要写书评

暂无评论

Prototype Model of an IoT-based Digital and Smart Door Locki...

International Conference on Mathematics, Actuarial science, computer science and Statistics (MACS)

作者： M. Adil Khan Kashif Nisar Ehtisham Lodhi Jawad Khan Muhammad Imran Khan Tariq Rahim Soomro Sana Nisar Department of Computer Science and Technology Chang'an University Xi'an China Victorian Institute of Technology (VIT) Adelaide South Australia The SKL for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Department Computer Science Abbottabad University of Science and Technology Havelian KP Pakistan Department of Computer Science Abdul Wali Khan University Mardan Pakistan CCSIS Institute of Business Management Karachi Pakistan Faculty of Computing and Informatics University Malaysia Sabah Jalan UMS Kota Kinabalu Sabah Malaysia

ISBN: (纸本)9781665460729

Biometric-based digital door locking system plays a significant role in providing authentication, reducing the workforce in smart homes, and building automation scenarios. This paper proposes a prototype model of an IoT-based Smart Door Locking System (SDLS) with reliable double-access authentication. The IoT and biometric technology authentication mechanism is adopted to make SDLS more secure and reachable with the alert mechanism on unauthorized access. The SDLS contains a biometric scanner, and a thumb impression is made either from a mobile or a biometric-mounted device on the door and both are connected to the centralized cloud-hosted real-time database. The proposed system was tested in real-time and has shown competitive results compared to other Radio-Frequency Identification (RFID) and password-based door locks. Hence, the overall performance efficiency of SDLS is satisfactory and provides biometric-based remote access to control and monitor door locks with the alert system on unauthorized access.

关键词： Biometrics (access control) Biological system modeling Authentication Prototypes Smart homes Real-time systems Security

Decentralized Nonconvex Robust Optimization over Unsafe Multiagent Systems: System Modeling, Utility, Resilience, and Privacy Analysis

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hu, Jinhui Chen, Guo Li, Huaqing Cheng, Huqiang Guo, Xiaoyu Huang, Tingwen School of Automation Central South University Changsha410083 China Department of Biomedical Engineering City University of Hong Kong Kowloon Hong Kong School of Electrical Engineering and Telecommunications University of New South Wales SydneyNSW2052 Australia Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing400715 China Key Laboratory of Dependable Services Computing in Cyber Physical Society Ministry of Education College of Computer Science Chongqing University Chongqing400044 China Faculty of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen518055 China

Privacy leakage and Byzantine failures are two adverse factors to the intelligent decision-making process of multiagent systems (MASs). Considering an unsafe MAS with these two issues, this paper targets the resolution of a class of nonconvex optimization problems under the Polyak-Lojasiewicz (P-L) condition. To address this problem, we first identify and construct the unsafe MAS model. Under this kind of unfavorable MASs, we mask the local gradients with Gaussian noises and adopt a resilient aggregation method self-centered clipping (SCC) to design a differentially private (DP) decentralized Byzantine-resilient algorithm, namely DP-SCC-PL, which simultaneously achieves differential privacy and Byzantine resilience. The convergence analysis of DP-SCC-PL is challenging since the convergence error can be contributed jointly by privacy-preserving and Byzantine-resilient mechanisms, as well as the nonconvex relaxation, which is addressed via seeking the contraction relationships among the disagreement measure of reliable agents before and after SCC aggregation, together with the optimal gap. Theoretical results reveal that DP-SCC-PL achieves consensus among all reliable agents and sublinear (inexact) convergence with well-designed step-sizes. It has also been proved that if there are no privacy issues and Byzantine agents, then the asymptotic exact convergence can be recovered. Numerical experiments verify the utility, resilience, and differential privacy of DP-SCC-PL by tackling a nonconvex optimization problem satisfying the P-L condition under various Byzantine attacks. Copyright © 2024, The Authors. All rights reserved.

关键词： Differential privacy