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

H∞ gain-scheduled dynamic output feedback control with transient performance applied to electrical microgrid

Journal of the Franklin Institute 2024年第7期361卷

作者： Fuentes, R.M. Lacerda, M.J. Morais, C.F. Oliveira, R.C.L.F. Palma, J.M. Engineering Systems Doctoral Program Faculty of Engineering Universidad de Talca Curicó3340000 Chile Centre for Communications Technology School of Computing and Digital Media London Metropolitan University LondonN7 8DB United Kingdom Pontifical Catholic University of Campinas – PUC-Campinas Polythecnic School Postgraduate Program in Telecommunication Networks Management SP Campinas13086-900 Brazil SP Campinas13083-852 Brazil Department of Electrical Engineering Faculty of Engineering Universidad de Talca Curicó334000 Chile

This paper introduces an approach for designing gain-scheduled dynamic output feedback controllers for continuous-time Linear Parameter-Varying (LPV) systems. The aim is to improve transient response by incorporating both D-stability and H∞ criteria into the synthesis conditions. We achieve this by employing changes of variables and congruence transformations, which lead to new synthesis conditions expressed as linear matrix inequalities. Additional fine-tuned scalar parameters can be used to enhance further the controller performance in terms of less conservative H∞ guaranteed costs. To assess the effectiveness of our proposed synthesis procedure, we conduct computational experiments in the context of a microinverter-based distributed power generation system. These experiments take into account real-world operational characteristics, providing a comprehensive evaluation of our approach. The results demonstrate that the designed controller effectively ensures the desired closed-loop system behavior, even when dealing with state noise and discretization errors originating from digital implementation. © 2024 The Franklin Institute

关键词： Transient analysis

来源：评论

学校读者我要写书评

暂无评论

eVision: Forecasting the spread of Tuberculosis in India with Deep Learning

eVision: Forecasting the spread of Tuberculosis in India wit...

引用

International Conference on Computational Science and Computational Intelligence (CSCI)

作者： Juan Zuluaga Michael Castillo Divya Syal Andres Calle Navid Shaghaghi Department of Bioengineering (BIOE) Computer Science & Engineering (CSEN) Ethical Pragmatic & Intelligent Computing (EPIC) Laboratory in collaboration with the Healthcare Innovation & Design (HID) Program Information Systems & Analytics (ISA) and Mathematics & Computer Science (MCS) Santa Clara University Santa Clara California USA

Humanity has battled tuberculosis for all of recorded history. Some studies estimate that Mycobacterium tuberculosis may have been around as long as 3 million years but it was only in 1834 when Johann Schonlein officially presented the characteristics of it. Even though the TB epidemic has touched all corners of the world, Africa and Asia are the regions that currently suffer the worst consequences. The purpose of this study is to construct a model within the eVision forecasting environment, capable of forecasting the trend of Tuberculosis cases in India, as India is the country that accounts for the largest percentage of TB cases and deaths worldwide. And being able to make predictions for India may also lead to successful results for other regions in Asia and Africa. In order to do so, this study presents different test cases that show the effectiveness of the model, varying the number of steps for each one of the data sets created. It's important to note, that these data sets are combinations of data gathered from the states with the most TB cases in India in the last years, as well as the total data for India, and supplemental data from Google Trends, as a way to facilitate the machine learning model. Even though the final results were respectable compared to past research done on India and other countries, the model nevertheless has a limitation on the number of weeks ahead which the predictions are still considered to be good; with 7 weeks being the optimal result.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal pattern analysis and prediction of air quality in Taiwan

Spatial-Temporal pattern analysis and prediction of air qual...

引用

IEEE International Conference on Ubi-Media computing

作者： Ping-Wei Soh Kai-Hsiang Chen Jen-Wei Huang Hone-Jay Chu Institute of Computer and Communication Engineering National Cheng Kung University Tainan Taiwan PhD Program for Multimedia Systems and Intelligent Computing National Cheng Kung University and Academia Sinica Tainan Taiwan Department of Electrical Engineering National Cheng Kung University Tainan Taiwan Department of Geomatics National Cheng Kung University Tainan Taiwan

This study explores the spatial-temporal patterns of particulate matter (PM) in Taiwan. Probability map of PM and daily patterns are discussed in this study. Data mining provides more detailed spatial-temporal information for PM variations and trends. The proposed model will show that data mining provides a relatively high goodness of fit and sufficient space-time explanatory power, particularly air pollution frequency and affect areas. In the proposed model, a method using Dynamic Time Warping is proposed to analyse temporal similarity between stations. The proposed model can eliminate global effect on a single station through the performance of multiple stations. The proposed model will further be used for prediction of PM2.5. The prediction results will discuss the spatial-temporal relations between stations. This study will investigate the distribution of PM and its cyclicality.

关键词： Predictive models Time series analysis Atmospheric modeling Air pollution Conferences Data mining

来源：评论

学校读者我要写书评

暂无评论

Classifying Ore Deposits Based on La-Icp-Ms Geochemistry of Natural Gold

SSRN

引用

SSRN 2024年

作者： Verbel, Angel Augusto Schutesky, Maria Emilia Gregory, Daniel D. Verbel, Arturo University of Brasilia Institute of Geosciences Graduate Program in Geology DF Brasília70910-900 Brazil University of Toronto Department of Earth Sciences TorontoONM5S 3B1 Canada Universidad de los Andes Systems and Computing Engineering Department School of Engineering Bogotá111711 Colombia

Systematic sampling of gold grains and their characterization in abundance and morphology can be used as a vectoring tool for mineral deposits. However, the processes that lead to the formation of an ore deposit are multiscale and nonlinear. As a result, the elemental compositions recorded in gold grains during the mineralization process seem mostly irregular and unpredictable. Here, we took advantage of the capabilities of neural networks to approximate, a natural nonlinear function that better explains the chemical variability observed in gold allowing us to make predictions. this was achieved by using published data of trace elements in gold of four types of gold deposits (i.e., Orogenic, VMS, porphyry and epithermal) from 47 different localities, obtained by laser ablation-inductively coupled plasma-mass spectrometry (LA- ICP-MS). The model was optimized by training five different architectures on the most influential elements, determined by principal component analysis (PCA). As a result, it was found that two hidden layers with 10 neurons each, is the best architecture for using trace elements as predictors of the type of deposit that formed a natural gold grain. In order to encourage the use of the findings made in this paper, we introduce OreGenes, an app developed in Matlab2023b based on the best-obtained model. It allows any user who possesses compatible data, the ability to import and process it to obtain a prediction with an average accuracy level of 88.9% confidence to determine the mineral deposit type that an unknown gold grain came from which grants the user the ability to have a powerful tool for exploration or research. © 2024, The Authors. All rights reserved.

关键词： Deposits

来源：评论

学校读者我要写书评

暂无评论

FaSTrack: A modular framework for real-time motion planning and guaranteed safe tracking

arXiv

引用

arXiv 2021年

作者： Chen, Mo Herbert, Sylvia L. Hu, Haimin Pu, Ye Fisac, Jaime F. Bansal, Somil Han, SooJean Tomlin, Claire J. School of Computing Science Simon Fraser University Canada Department of Mechanical and Aerospace Engineering UC San Diego United States Department of Electrical Engineering Princeton University United States Department of Electrical and Electronic Engineering University of Melbourne Australia Department of Electrical Engineering and Computer Sciences UC Berkeley United States Control and Dynamical Systems Program California Institute of Technology United States

Real-time, guaranteed safe trajectory planning is vital for navigation in unknown environments. However, real-time navigation algorithms typically sacrifice robustness for computation speed. Alternatively, provably safe trajectory planning tends to be too computationally intensive for real-time replanning. We propose FaSTrack, Fast and Safe Tracking, a framework that achieves both real-time replanning and guaranteed safety. In this framework, real-time computation is achieved by allowing any trajectory planner to use a simplified planning model of the system. The plan is tracked by the system, represented by a more realistic, higher-dimensional tracking model. We precompute the tracking error bound (TEB) due to mismatch between the two models and due to external disturbances. We also obtain the corresponding tracking controller used to stay within the TEB. The precomputation does not require prior knowledge of the environment. We demonstrate FaSTrack using Hamilton-Jacobi reachability for precomputation and three different real-time trajectory planners with three different tracking-planning model pairs. Copyright © 2021, The Authors. All rights reserved.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

IoT-based Wireless Sensor Networks for Monitoring Drinking Water Treatment Plants

IoT-based Wireless Sensor Networks for Monitoring Drinking W...

引用

International Workshop on Secure Internet of Things (SIoT)

作者： Luiz Octávio Martini Lima Lucas Carvalho Goncalves Gustavo Campos Menezes Lucas Silva de Oliveira Gleb Wataghin Institute of Physics UNICAMP Campinas SP Brazil Master Degree Program in Automation and Systems CEFET-MG Leopoldina MG Brazil Department of Electronics and Computing CEFET-MG Contagem MG Brazil Department of Mechatronics Engineering CEFET-MG Divinópolis MG Brazil

ISBN: (数字)9798331507466

ISBN: (纸本)9798331507473

The increasing need for efficient monitoring of parameters in challenging industrial environments, such as basic sanitation, has led to the search for integrated and user-friendly solutions that can address specific challenges of this setting. This project aims to develop a solution to meet monitoring requirements in water treatment plants. The proposed solution involves the development of both hardware and software for collecting data from the water treatment process using sensors and transmitting this information to a server structure, database, and communication interface with the cloud-based user. The effectiveness of the proposed device is being evaluated in six water treatment units located in the states of Alagoas, Mato Grosso, Paraná, Rio de Janeiro, and São Paulo. Preliminary results indicate that the proposed solution is capable of monitoring the variables involved in the water flocculation stage and generating a comprehensive set of information about the process over time.

关键词： Cloud computing Chemical sensors Wireless sensor networks User interfaces Hardware Software Sensors Social Internet of Things Servers Monitoring

来源：评论

学校读者我要写书评

暂无评论

DLM: A distributed Large Memory System using remote memory swapping over cluster nodes

DLM: A distributed Large Memory System using remote memory s...

引用

IEEE International Conference on Cluster computing

作者： Hiroko Midorikawa Motoyoshi Kurokawa Ryutaro Himeno Mitsuhisa Sato Department of Computer and Information Science Seikei University Musashino Tokyo Japan Graduate School of Systems and Information Engineering University of Tsukuba Tennodai Tsukuba Ibaraki Japan Advanced Center of Computing and Communication Wako Saitama Japan Research Program for Computational Science RIKEN Wako Saitama Japan

Emerging 64 bitOSpsilas supply a huge amount of memory address space that is essential for new applications using very large data. It is expected that the memory in connected nodes can be used to store swapped pages efficiently, especially in a dedicated cluster which has a high-speed network such as 10 GbE and Infiniband. In this paper, we propose the distributed large memory system (DLM), which provides very large virtual memory by using remote memory distributed over the nodes in a cluster. The performance of DLM programs using remote memory is compared to ordinary programs using local memory. The results of STREAM, NPB and Himeno benchmarks show that the DLM achieves better performance than other remote paging schemes using a block swap device to access remote memory. In addition to performance, DLM offers the advantages of easy availability and high portability, because it is a user-level software without the need for special hardware. To obtain high performance, the DLM can tune its parameters independently from kernel swap parameters. We also found that DLMpsilas independence of kernel swapping provides more stable behavior.

关键词： Kernel Arrays Memory management Servers Bandwidth Performance evaluation Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Dynamic programming Algorithm using Furniture Industry 0/1 Knapsack Problem

Dynamic Programming Algorithm using Furniture Industry 0/1 K...

引用

International Conference on Cybernetics and Intelligent System (ICORIS)

作者： Mietha Anditta Natashya Amartya Laurens Spits Warnars Harco Leslie Hendric Spits Warnars Arief Ramadhan Teddy Siswanto Teddy Mantoro Nurulhuda Noordin Computer Science Departement School of Computer Science Bina Nusantara University Jakarta Indonesia Information Systems Departement School of Information Systems Bina Nusantara University Jakarta Indonesia Computer Science Departement BINUS Graduate Program - Computer Science Bina Nusantara University Jakarta Indonesia PJJ Informatika Telkom University Bandung Indonesia Information Systems Department Trisakti University Jakarta Indonesia Faculty of Engineering and Technology Sampoerna University Jakarta Indonesia School of Computing Sciences College of Computing Informatics and Mathematics Universiti Teknologi MARA Selangor Malaysia

Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack problem. A 0/1 knapsack problem can be seen from industrial production cost. It is prevalent that a production cost has to be as efficient as possible, but the expectation is to get the proceeds of the products higher. Thus, the dynamic programming algorithm can be implemented to solve the diverse knapsack problem, one of which is the 0/1 knapsack problem, which would be the main focus of this paper. The implementation was implemented using C language. This paper was created as an early implementation algorithm using a Dynamic program algorithm applied to an Automatic Identification System (AIS) dataset.

关键词：

来源：评论

学校读者我要写书评

暂无评论

One Day Smart Grid Supersession - Analytics and Integration

One Day Smart Grid Supersession - Analytics and Integration

引用

General Meeting of the IEEE-Power-and-Energy-Society (PES)

作者： Liu, W-H Edwin McArthur, Stephen Giri, Jay Miu, Karen Pratt, Rob Wen, Jun Uluski, Bob Dow, Luther Labut, Gerard IEEE Computing and Analytical Methods Subcommittee United States IEEE PES Intelligent Systems Subcommittee United States IEEE PES Multi-Agent System Working Group United States Power Systems Technology and Strategic Initiatives ALSTOM Grid Redmond WA United States Electrical and Computer Engineering Department Drexel University United States Pacific Northwest National Laboratory's (PNNL's) Smart Grid R and D Program U.S. Department of Energy United States Transmission and Interconnection Planning Group Southern California Edison (SCE) Company United States WECC Modeling and Validation Working Group United States EPRI Power Delivery and Utilization Area United States Distribution and West Coast Operations Quanta Technology United States Distribution Operations SmartCurrentssm Program Strategy DTE Energy Detroit MI United States

ISBN: (纸本)9781457710018

The effort of "Smart Grid" is to modernize grid infrastructure and build-in intelligence to power grids and delivery systems, and their interfaces to customer premises. However, the perspectives range from an emphasis on infrastructure to an emphasis on new paradigm-shifting applications. Alternatively, the smart grid can be thought of as the advanced information technologies that enable the desired analytical applications. As a general understanding, we believe that Smart Grid needs to integrate power system analysis, computing and economics to enhance grid reliability, efficiency, and security, and contributes to the climate change strategic goal. In this Supersession, the analytics that empowers smart grid applications is discussed;and the practical implementation and integration challenges will be presented.

关键词： smart grid analytical applications system integration

来源：评论

学校读者我要写书评

暂无评论

TEAM: Task-Clustering and Enhanced Adaptability for Meta-Reinforcement Learning on Robotics Through Multi-Task Diffusion and Optimization

TEAM: Task-Clustering and Enhanced Adaptability for Meta-Rei...

引用

IEEE International Conference on Robotic computing (IRC)

作者： Joshua Ho Chien-Min Wang Chung-Ta King Chi-Wei Feng Shih-Yun Sunkuan Social Networks and Human-Centered Computing Program Taiwan International Graduate Program Institute of Information Science Academia Sinica Taipei Taiwan Institute of Information Systems and Applications National Tsing Hua University Hsinchu Taiwan Department of Computer Science National Tsing Hua University Hsinchu Taiwan Department of Electrical Engineering National Taiwan University Taipei Taiwan

ISBN: (数字)9798331521554

ISBN: (纸本)9798331521561

The ability of robots to imitate human learning strategies-rapidly adapting to new tasks without large datasets-has garnered significant attention in meta-learning. Meta-reinforcement learning seeks to enhance robotic agent flexibility across diverse tasks and contexts, offering promise where single-task learning often fails. Despite advancements like multi-task diffusion models and task-weighted optimization mechanisms, effectively training tasks with varying complexities simultaneously remains a major challenge. This paper introduces a novel meta-reinforcement learning method that addresses this issue by clustering the training tasks of robotic arms based on semantic and trajectory similarities, while leveraging adaptive learning rates and task-specific weights proposed by the multitask optimization techniques. Our approach, TEAM, emphasizes performance-driven semantic clustering, optimizing based on robotic task similarity, complexity, and convergence objectives. We also integrate fast adaptive and multi-task optimization of the diffusion model to enhance computational efficiency and adaptability. More specifically, we introduce a cluster-specific optimization technique, using specialized parameters for each group to allow more refined task handling. The experimental validation demonstrates the effectiveness of this scalable method in improving performance, adaptability, and efficiency in real-world, heterogeneous robotic tasks, further advancing robotic computing in meta-reinforcement learning.

关键词： Training Metalearning program processors Semantics Multitasking Diffusion models Complexity theory Trajectory Robots Optimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：