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

arXiv 2023年

作者： Rabino, Paolo Alliegro, Antonio Borlino, Francesco Cappio Tommasi, Tatiana Department of Control and Computer Engineering Politecnico di Torino Italy Italian Institute of Technology Italy

Moving deep learning models from the laboratory setting to the open world entails preparing them to handle unforeseen conditions. In several applications the occurrence of novel classes during deployment poses a significant threat, thus it is crucial to effectively detect them. Ideally, this skill should be used when needed without requiring any further computational training effort at every new task. Out-of-distribution detection has attracted significant attention in the last years, however, the majority of the studies deal with 2D images ignoring the inherent 3D nature of the real-world and often confusing between domain and semantic novelty. In this work, we focus on the latter, considering the objects’ geometric structure captured by 3D point clouds regardless of the specific domain. We advance the field by introducing OpenPatch which builds on a large pretrained model and simply extracts from its intermediate features a set of patch representations that describe each known class. For any new sample, we obtain a novelty score by evaluating whether it can be recomposed mainly by patches of a single known class or rather via the contribution of multiple classes. We present an extensive experimental evaluation of our approach for the task of semantic novelty detection on real-world point cloud samples when the reference known data are synthetic. We demonstrate that OpenPatch excels in both the full and few-shot known sample scenarios, showcasing its robustness across varying pre-training objectives and network backbones. The inherent training-free nature of our method allows for its immediate application to a wide array of real-world tasks, offering a compelling advantage over approaches that need expensive retraining efforts. © 2023, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Optimizing Foundation Model Inference on a Many-Tiny-Core Open-Source RISC-V Platform

IEEE Transactions on Circuits and Systems for Artificial Int...

引用

IEEE Transactions on Circuits and Systems for Artificial Intelligence 2024年第1期1卷 37-52页

作者： Viviane Potocnik Luca Colagrande Tim Fischer Luca Bertaccini Daniele Jahier Pagliari Alessio Burrello Luca Benini Integrated Systems Laboratory (IIS) of ETH Zürich ETZ Züurich Switzerland Department of Control and Computer Engineering Politecnico di Torino Turin Italy Department of Electrical Electronic and Information Engineering University of Bologna Bologna Italy

Transformer-based foundation models have become crucial for various domains, most notably natural language processing (NLP) or computer vision (CV). These models are predominantly deployed on high-performance GPUs or hardwired accelerators with highly customized, proprietary instruction sets. Until now, limited attention has been given to RISC-V-based general-purpose platforms. In our work, we present the first inference results of transformer models on an open-source many-tiny-core RISC-V platform implementing distributed Softmax primitives and leveraging ISA extensions for SIMD floating-point operand streaming and instruction repetition, as well as specialized DMA engines to minimize costly main memory accesses and to tolerate their latency. We focus on two foundational transformer topologies, encoder-only and decoder-only models. For encoder-only models, we demonstrate a speedup of up to 12.8 $\times$ between the most optimized implementation and the baseline version. We reach over 79% FPU utilization and 294 GFLOPS/W, outperforming State-of-the-Art (SoA) accelerators by more than 2 $\times$ utilizing the HW platform while achieving comparable throughput per computational unit. For decoder-only topologies, we achieve 16.1 $\times$ speedup in the Non-Autoregressive (NAR) mode and up to 35.6 $\times$ speedup in the Autoregressive (AR) mode compared to the baseline implementation. Compared to the best SoA dedicated accelerator, we achieve 2.04 $\times$ higher FPU utilization.

关键词： Frequency modulation Transformers computer architecture Computational modeling Kernel Artificial intelligence Hardware

来源：评论

学校读者我要写书评

暂无评论

Laundry Cluster Management Using Cloud

Laundry Cluster Management Using Cloud

引用

Federated Conference on computer Science and Information Systems (FedCSIS)

作者： Mateusz Salach Bartosz Trybus Bartosz Pawłowicz Marcin Hubacz Department of Complex Systems Rzeszow University of Technology Rzeszow Department of Computer and Control Engineering Department of Electronic and Telecommunications Systems

Electronic devices in the 21st century have numerous network components, including wireless or wired Internet access modules. Connecting devices to networks and cloud services enables them to access new functionalities and unlock system updates and device security enhancements. The article presents the concept of an intelligent laundry management system based on RFID and cloud computing. The Internet connection not only unlocks additional features of the washing machine, such as different washing modes, but also allows for selecting the appropriate detergent level and washing parameters based on the textile material being washed. Additionally, the paper presents the solution and measurement studies on the accuracy of textile identification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Recent Progress in Reinforcement Learning and Adaptive Dynamic Programming for Advanced control Applications

引用

IEEE/CAA Journal of Automatica Sinica 2024年第1期11卷 18-36页

作者： Ding Wang Ning Gao Derong Liu Jinna Li Frank L.Lewis IEEE the Faculty of Information Technology Beijing Key Laboratory of Computational Intelligence and Intelligent SystemBeijing Laboratory of Smart Environmental Protectionand Beijing Institute of Artificial IntelligenceBeijing University of TechnologyBeijing 100124China the School of System Design and Intelligent Manufacturing Southern University of Science and TechnologyShenzhen 518055China the Department of Electrical and Computer Engineering University of Illinois at ChicagoChicago IL 60607 USA the School of Information and Control Engineering Liaoning Petrochemical UniversityFushun 113001China the UTA Research Institute the University of Texas at ArlingtonArlington TX 76118 USA

Reinforcement learning(RL) has roots in dynamic programming and it is called adaptive/approximate dynamic programming(ADP) within the control community. This paper reviews recent developments in ADP along with RL and its applications to various advanced control fields. First, the background of the development of ADP is described, emphasizing the significance of regulation and tracking control problems. Some effective offline and online algorithms for ADP/adaptive critic control are displayed, where the main results towards discrete-time systems and continuous-time systems are surveyed, ***, the research progress on adaptive critic control based on the event-triggered framework and under uncertain environment is discussed, respectively, where event-based design, robust stabilization, and game design are reviewed. Moreover, the extensions of ADP for addressing control problems under complex environment attract enormous attention. The ADP architecture is revisited under the perspective of data-driven and RL frameworks,showing how they promote ADP formulation ***, several typical control applications with respect to RL and ADP are summarized, particularly in the fields of wastewater treatment processes and power systems, followed by some general prospects for future research. Overall, the comprehensive survey on ADP and RL for advanced control applications has d emonstrated its remarkable potential within the artificial intelligence era. In addition, it also plays a vital role in promoting environmental protection and industrial intelligence.

关键词： Adaptive dynamic programming(ADP) advanced control complex environment data-driven control event-triggered design intelligent control neural networks nonlinear systems optimal control reinforcement learning(RL)

来源：评论

学校读者我要写书评

暂无评论

Unified Temporal Erasable Itemset Mining with a Lower-Bound Strategy

Unified Temporal Erasable Itemset Mining with a Lower-Bound ...

引用

2022 IEEE International Conference on Big Data, Big Data 2022

作者： Hong, Tzung-Pei Li, Jia-Xiang Tsai, Yu-Chuan Huang, Wei-Ming National University of Kaohsiung Department of Computer Science and Information Engineering Kaohsiung Taiwan National Sun Yat-Sen University Department of Computer Science and Engineering Kaohsiung Taiwan National University of Kaohsiung Library and Information Center Kaohsiung Taiwan China Steel Inc Department of Electrical and Control Kaohsiung Taiwan

ISBN: (纸本)9781665480451

Erasable itemset mining has been a valuable mining problem for manufacturers. It can extract less profitable materials from a product dataset and provide managers with good decision-making and a trade-off between cost and profit. However, the traditional erasable itemset mining methods seldom consider the time factor. For time-sensitive industries such as agro-processors, the time range is important in determining which materials are less profitable. Hong et al. first proposed the concept of temporal erasable itemset mining and seven lifespan options. They also proposed a unified temporal erasable (UTE) mining algorithm for getting incomplete temporal erasable itemsets. Howerever, the UTE algorithm does not satisfy the property of downward closure. In this work, we propose an improved algorithm to improve the performance of the UTE algorithm based on a lower-bound strategy and satisfying the property of downward closure. The proposed algorithm uses a hash table to store information that will be reused during the mining process to avoid scanning a dataset multiple times. The designed lower-bound strategy can preserve the downward closure property, narrowing the search space of candidate itemsets. In numerical experiments, we compare the performance using several metrics between the proposed method and the previous work. From the results of experiments, our proposed method outperforms the existing method on various metrics, such as execution time and the number of candidate erasable itemsets. © 2022 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Risk-Aware Wasserstein Distributionally Robust control of Vessels in Natural Waterways

arXiv

引用

arXiv 2023年

作者： Nadales, Juan Moreno Hakobyan, Astghik de la Peña, David Muñoz Limon, Daniel Yang, Insoon The Department of Automatic Control and System Engineering University of Seville Spain The Department of Electrical and Computer Engineering Seoul National University Korea Republic of

In the realm of maritime transportation, autonomous vessel navigation in natural inland waterways faces persistent challenges due to unpredictable natural factors. Existing scheduling algorithms fall short in handling these uncertainties, compromising both safety and efficiency. Moreover, these algorithms are primarily designed for non-autonomous vessels, leading to labor-intensive operations vulnerable to human error. To address these issues, this study proposes a risk-aware motion control approach for vessels that accounts for the dynamic and uncertain nature of tide islands in a distributionally robust manner. Specifically, a model predictive control method is employed to follow the reference trajectory in the time-space map while incorporating a risk constraint to prevent grounding accidents. To address uncertainties in tide islands, a novel modeling technique represents them as stochastic polytopes. Additionally, potential inaccuracies in waterway depth are addressed through a risk constraint that considers the worst-case uncertainty distribution within a Wasserstein ambiguity set around the empirical distribution. Using sensor data collected in the Guadalquivir River, we empirically demonstrate the performance of the proposed method through simulations on a vessel. As a result, the vessel successfully navigates the waterway while avoiding grounding accidents, even with a limited dataset of observations. This stands in contrast to existing non-robust controllers, highlighting the robustness and practical applicability of the proposed approach. Copyright © 2023, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Complexity results and active-set identification of a derivative-free method for bound-constrained problems

arXiv

引用

arXiv 2024年

作者： Brilli, Andrea Cristofari, Andrea Liuzzi, Giampaolo Lucidi, Stefano Department of Computer Control and Management Engineering Sapienza University of Rome Via Ariosto 25 Rome00185 Italy Department of Civil Engineering and Computer Science Engineering University of Rome "Tor Vergata" Via del Politecnico 1 Rome00133 Italy

In this paper, we analyze a derivative-free line search method designed for bound-constrained problems. Our analysis demonstrates that this method exhibits a worst-case complexity comparable to other derivative-free methods for unconstrained and linearly constrained problems. In particular, when minimizing a function with n variables, we prove that at most O (nϵ−2) iterations are needed to drive a criticality measure below a predefined threshold ǫ, requiring at most O (n2ϵ−2) function evaluations. We also show that the total number of iterations where the criticality measure is not below ǫ is upper bounded by O (n2ϵ−2). Moreover, we investigate the method capability to identify active constraints at the final solutions. We show that, after a finite number of iterations, all the active constraints satisfying the strict complementarity condition are correctly identified. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Stability Enhancement of LCL-Type Grid-Following Inverters Using Capacitor Voltage Active Damping

Stability Enhancement of LCL-Type Grid-Following Inverters U...

引用

IEEE General Meeting Power& Energy Society

作者： Naser Souri Ali Mehrizi-Sani Kambiz Tehrani The Bradley Department of Electrical and Computer Engineering Virginia Tech Blacksburg VA Department of Energy and Control University of Normandy-ESIGELEC-IRSEEM Rouen France

ISBN: (数字)9798350381832

ISBN: (纸本)9798350381849

An LCL filter offers superior attenuation for high-frequency harmonics for three-phase grid-following inverters compared to LC and L filters. However, it also introduces an inherent resonance peak, which can lead to power quality issues or even instability of the inverter control system. Active damping (AD) is widely employed to effectively mitigate this resonance. Capacitor voltage feedback (CVF) and capacitor current feedback (CCF) are effective AD methods for LCL resonance damping. CVF is preferred due to its lower sensor requirement compared to CCF. However, a derivative term appears in the active damping loop, which introduces high-frequency noise into the system. This paper proposes a noise-immune approach by replacing the derivative term with a discrete function suitable for digital implementation. The LCL resonance can be damped effectively, resulting in enhanced stability of the inverter control system. Simulation results verify the proposed effectiveness of the method with grid inductance variation and weak grid conditions.

关键词： Damping Simulation Grid following Capacitors Power quality Noise Power system stability Resonance Stability analysis Power harmonic filters

来源：评论

学校读者我要写书评

暂无评论

A Load Balancing Algorithm For Long-Life Green Edge Systems

A Load Balancing Algorithm For Long-Life Green Edge Systems

引用

IEEE International Conference on Cloud Computing Technology and Science (CloudCom)

作者： Roberto Beraldi Gabriele Proietti Mattia Department of Computer Control and Management Engineering "Antonio Ruberti" Sapienza University of Rome Rome Italy

We consider the case of a set of energy harvesting edge nodes, equipped with photovoltaic panels that implement some kind of monitoring service. To ensure that the service operates in an optimal way, nodes have sometimes offload some of their data to other nodes. We show that this kind of task offloading (migration) can improve service performance by avoiding temporary interruptions and prolonging the overall service lifetime. We present a centralized algorithm based on Linear Programming optimization problem solution and a distributed implementation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adversarial Training with Maximal Coding Rate Reduction

Adversarial Training with Maximal Coding Rate Reduction

引用

Asilomar Conference on Signals, Systems & computers

作者： Hsiang-Yu Chu Hongbo Zhao Markus Flierl Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Department of Control Science and Engineering Harbin Institute of Technology Harbin China

ISBN: (数字)9798350354058

ISBN: (纸本)9798350354065

Deep convolutional networks can solve various complex tasks in the field of image processing. However, adversarial attacks have been shown to have the ability of fooling deep learning models. Adversarial training is one commonly used strategy to improve the robustness of deep learning models against adversarial examples, which is performed by incorporating adversarial examples into the training process. Traditionally, during this process, cross-entropy loss is used as the loss function. In order to improve the robustness of deep learning models against adversarial examples, we propose in this paper two new methods of adversarial training by applying the principle of Maximal Coding Rate Reduction (MCR 2 ). We evaluate the performance of different adversarial training methods by comparing the clean accuracy and adversarial accuracy. It is shown that adversarial training with the MCR 2 loss function yields a more robust network than the traditional adversarial training method. In our experiments, adversarial accuracies are improved by up to 10%. The two loss functions are discussed by using a model.

关键词： Training Deep learning Hands Accuracy Image coding Computational modeling Robustness Data models Encoding Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：