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

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Maria Sofia Bucarelli Matilde Fjeldsø Larsen Chris Schwiegelshohn Mads Bech Toftrup Department of Computer Control and Management Engineering Antonio Ruberti Sapienza University of Rome Italy Department of Computer Science Aarhus University Denmark

Given a set of points, clustering consists of finding a partition of a point set into k clusters such that the center to which a point is assigned is as close as possible. Most commonly, centers are points themselves, which leads to the famous k-median and k-means objectives. One may also choose centers to be j dimensional subspaces, which gives rise to subspace clustering. In this paper, we consider learning bounds for these problems. That is, given a set of n samples P drawn independently from some unknown, but fixed distribution Ɗ, how quickly does a solution computed on P converge to the optimal clustering of Ɗ? We give several near optimal results. In particular,1. For center-based objectives, we show a convergence rate of Õ(√k/n). This matches the known optimal bounds of [Fefferman, Mitter, and Narayanan, Journal of the Mathematical Society 2016] and [Bartlett, Linder, and Lugosi, IEEE Trans. Inf. Theory 1998] for k-means and extends it to other important objectives such as k-median.2. For subspace clustering with j -dimensional subspaces, we show a convergence rate of Õ(√kj2/n). These are the first provable bounds for most of these problems. For the specific case of projective clustering, which generalizes k-means, we show a convergence rate of Ω(√kj/n) is necessary, thereby proving that the bounds from [Fefferman, Mitter, and Narayanan, Journal of the Mathematical Society 2016] are essentially optimal.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Coherence-based Input Design for Sparse System Identification

arXiv

引用

arXiv 2024年

作者： Parsa, Javad Rojas, Cristian R. Hjalmarsson, Håkan Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden

The maximum absolute correlation between regressors, which is called mutual coherence, plays an essential role in sparse estimation. A regressor matrix whose columns are highly correlated may result from optimal input design, since there is no constraint on the mutual coherence, so when this regressor is used to estimate sparse parameter vectors of a system, it may yield a large estimation error. This paper aims to tackle this issue for fixed denominator models, which include Laguerre, Kautz, and generalized orthonormal basis function expansion models, for example. The paper proposes an optimal input design method where the achieved Fisher information matrix is fitted to the desired Fisher matrix, together with a coordinate transformation designed to make the regressors in the transformed coordinates have low mutual coherence. The method can be used together with any sparse estimation method and in a numerical study we show its potential for alleviating the problem of model order selection when used in conjunction with, for example, classical methods such as AIC and BIC. © 2024, CC BY.

关键词： Fisher information matrix

来源：评论

学校读者我要写书评

暂无评论

PSRMER: Proactive Services Recommendation Driven-by Multimodal Emotion Recognition

PSRMER: Proactive Services Recommendation Driven-by Multimod...

引用

IEEE International Conference on Web Services (ICWS)

作者： Zhizhong Liu Guangyu Huang Dianhui Chu Yuhang Sun School of Computer and Control Engineering Yantai University Yantai China School of Computer Science and Technology Harbin Institute of Technology Weihai China

In the past three years, global COVID-19 pandemic not only impacted people’s physical health but also significantly affected their mental health, which resulting in rapid increase of psychological problems. Emotions are a common manifestation of psychological changes, and some services (such as music, video, or psychological counseling services) can help users to adjust their emotions in a timely manner, thus to avoid bringing extreme events (e.g., running away from home or committing suicide). Therefore, how to perceive users’ real-time emotions and then recommend the most appropriate services to users has become a challenge. To address this issue, this work proposes an approach for proactive services recommendation driven-by multimodal emotion recognition (named as PSRMER). Specifically, PSRMER first actively identifies a user’s emotion with a multimodal emotion recognition model based on BiGRU and Transformer; Then, considering the user’s emotion and preferences, PSRMER selects the optimal services based on an index-graph linking different emotions and various services; Finally, PSRMER proactively recommends the selected optimal service to the user. Extensive experiments have been conducted and the effectiveness of our proposed method have been proved. Moreover, the proposed method can also be used in smart education, smart transportation, smart elderly care and other modern industry fields.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On Generalization Bounds for Projective Clustering

arXiv

引用

arXiv 2023年

作者： Bucarelli, Maria Sofia Larsen, Matilde Fjeldsø Schwiegelshohn, Chris Toftrup, Mads Bech Department of Computer Control and Management Engineering Antonio Ruberti Sapienza University of Rome Italy Department of Computer Science Aarhus University Denmark

Given a set of points, clustering consists of finding a partition of a point set into k clusters such that the center to which a point is assigned is as close as possible. Most commonly, centers are points themselves, which leads to the famous k-median and k-means objectives. One may also choose centers to be j dimensional subspaces, which gives rise to subspace clustering. In this paper, we consider learning bounds for these problems. That is, given a set of n samples P drawn independently from some unknown, but fixed distribution D, how quickly does a solution computed on P converge to the optimal clustering of D? We give several near optimal results. In particular, 1. For center-based objectives, we show a convergence rate of Õ (√k/n ) . This matches the known optimal bounds of [Fefferman, Mitter, and Narayanan, Journal of the Mathematical Society 2016] and [Bartlett, Linder, and Lugosi, IEEE Trans. Inf. Theory 1998] for k-means and extends it to other important objectives such as k-median. 2. For subspace clustering with j-dimensional subspaces, we show a convergence rate of Õ (√kj2/n ) . These are the first provable bounds for most of these problems. For the specific case of projective clustering, which generalizes k-means, we show a convergence rate of Ω (√kj/n ) is necessary, thereby proving that the bounds from [Fefferman, Mitter, and Narayanan, Journal of the Mathematical Society 2016] are essentially optimal. © 2023, CC BY.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Progress of Brain Network Studies on Anesthesia and Consciousness: Framework and Clinical Applications

引用

engineering 2023年第1期20卷 77-95页

作者： Jun Liu Kangli Dong Yi Sun Ioannis Kakkos Fan Huang Guozheng Wang Peng Qi Xing Chen Delin Zhang Anastasios Bezerianos Yu Sun Key Laboratory for Biomedical Engineering of Ministry of Education of China Zhejiang UniversityHangzhou 310007China Department of Neurology Sir Run Run Shaw HospitalSchool of MedicineZhejiang UniversityHangzhou 310020China School of Electrical and Computer Engineering National Technical University of AthensAthens 15780Greece Department of Control Science and Engineering College of Electronics and Information EngineeringTongji UniversityShanghai 200092China Department of Anesthesiology The First Affiliated HospitalSchool of MedicineZhejiang UniversityHangzhou 310003China The N1 Institute for Health Center for Life SciencesNational University of SingaporeSingapore 117456Singapore

Although the relationship between anesthesia and consciousness has been investigated for decades, our understanding of the underlying neural mechanisms of anesthesia and consciousness remains rudimentary, which limits the development of systems for anesthesia monitoring and consciousness evaluation. Moreover, the current practices for anesthesia monitoring are mainly based on methods that do not provide adequate information and may present obstacles to the precise application of anesthesia. Most recently, there has been a growing trend to utilize brain network analysis to reveal the mechanisms of anesthesia, with the aim of providing novel insights to promote practical application. This review summarizes recent research on brain network studies of anesthesia, and compares the underlying neural mechanisms of consciousness and anesthesia along with the neural signs and measures of the distinct aspects of neural activity. Using the theory of cortical fragmentation as a starting point, we introduce important methods and research involving connectivity and network analysis. We demonstrate that whole-brain multimodal network data can provide important supplementary clinical information. More importantly, this review posits that brain network methods, if simplified, will likely play an important role in improving the current clinical anesthesia monitoring systems.

关键词： Anesthesia Brain network Connectivity Graph theoretical analysis Clinical monitoring system

来源：评论

学校读者我要写书评

暂无评论

Embedded Multi-Port Converters for Synthesis and Enhancement of Hybrid-Clamped Multilevel Converters

Embedded Multi-Port Converters for Synthesis and Enhancement...

引用

IEEE Energy Conversion Congress and Exposition, ECCE

作者： Yuzhuo Li Pasan Gunawardena Hao Tian Yunwei Li Department of Electrical and Computer Engineering University of Alberta Edmonton Canada School of Control Science and Engineering Shandong University Jinan China

Leveraging a number of inner capacitors/inductors, hybrid-clamped multilevel converters (MLCs) normally face great challenges among good performance (proper charge/discharge of these devices), high efficiency (maintaining low losses) and high power density (compact profile). On the other hand, these multiple-device energy-processing requirements have been addressed well in some promising multi-port converters (MPCs), and, therefore, inspire us to implement well-developed compact MPCs to facilitate the voltage/current level generation process in hybrid-clamped MLCs. Though recently, some researchers started to integrate active cells into hybrid-clamped MLCs and improve capacitor voltage control and generate extra output levels, the systematic synthesis method is still unclear and rarely discussed in the literature. To address this gap, we propose a systematic synthesis method for those hybrid clamped MLCs that can benefit from embedding well-developed MPCs. The approach can be applied for both voltage-source and current-source hybrid-clamped MLCs, covering emerging MLCs. In particular, we also derived and verified a new mixed hybrid MLC family through an emerging current-fed dual-input isolated multi-port converter. This topology features both current-source and voltage-source benefits and is ideal for future renewable generation integration.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On final opinions of the Friedkin-Johnsen model over random graphs with partially stubborn community

arXiv

引用

arXiv 2024年

作者： Wang, Lingfei Xing, Yu Johansson, Karl H. Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology with Digital Futures Stockholm Sweden

This paper studies the formation of final opinions for the Friedkin-Johnsen (FJ) model with a community of partially stubborn agents. The underlying network of the FJ model is symmetric and generated from a random graph model, in which each link is added independently from a Bernoulli distribution. It is shown that the final opinions of the FJ model will concentrate around those of an FJ model over the expected graph as the network size grows, on the condition that the stubborn agents are well connected to other agents. Probability bounds are proposed for the distance between these two final opinion vectors, respectively for the cases where there exist non-stubborn agents or not. Numerical experiments are provided to illustrate the theoretical findings. The simulation shows that, in presence of non-stubborn agents, the link probability between the stubborn and the non-stubborn communities affect the distance between the two final opinion vectors significantly. Additionally, if all agents are stubborn, the opinion distance decreases with the agent stubbornness. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributed Event-Triggered Nash Equilibrium Seeking Under Hybrid Attacks and Dead-Zone Inputs: A Topology Reconstruction Approach

Distributed Event-Triggered Nash Equilibrium Seeking Under H...

引用

Neuromorphic Computing (ICNC), International Conference on

作者： Xiao Lu Shuting Chen Ying Wan Junjie Fu Tingwen Huang School of Mathematics Southeast University Nanjing China Faculty of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen China

ISBN: (数字)9798331508661

ISBN: (纸本)9798331508678

A distributed Nash equilibrium (NE) seeking algorithm is proposed for multi-agent systems under non-cooperative game settings, where players are subject to hybrid attacks composed of Denial-of-service (DoS) and false data injection (FDI) attacks. The unknown dead-zone inputs are also taken into account for each agent. An event-triggered strategy is employed to enhance communication efficiency. With a topology reconstruction scheme, the impacts of hybrid attacks are mitigated. With the proposed event-triggered NE-seeking algorithm, the convergence of the distributed NE-seeking algorithm is analyzed, and an upper bound for the DoS attack time ratio is provided. Finally, the effectiveness of the algorithm is validated through numerical simulations.

关键词： Upper bound Event detection Neuromorphic engineering Reconstruction algorithms Denial-of-service attack Nash equilibrium Numerical simulation Topology Multi-agent systems Convergence

来源：评论

学校读者我要写书评

暂无评论

Constraint-Based Automatic SBST Generation for RISC-V Processor Families

Constraint-Based Automatic SBST Generation for RISC-V Proces...

引用

IEEE European Test Symposium (ETS)

作者： Tobias Faller Nikolaos I. Deligiannis Markus Schwörer Matteo Sonza Reorda Bernd Becker Department of Computer Science University of Freiburg Freiburg Germany Department of Control and Computer Engineering (DAUIN) Politecnico di Torino Turin Italy

Software-Based Self-Tests (SBST) allow at-speed, native online-testing of processors by running software programs on the processor core, requiring no Design for Testability (DfT) infrastructure. The creation of such SBST programs often requires time-consuming manual labour that is expensive and requires in-depth knowledge of the processor’s architecture to target hard-to-test faults. In contrast, encoding the SBST generation task as a Bounded Model Checking (BMC) problem allows using sophisticated, state-of-the-art BMC solvers to automatically generate an SBST. Constraints for the BMC problem are encoded in a circuit called Validity Checker Module (VCM) and applied during SBST *** this paper, we focus on presenting a VCM architecture and a constraint set that allows building SBSTs that make minimal assumptions about the firmware, targeting hard-to-test faults in the ALU and register file of multiple scalar, in-order RISC-V processor families. The VCM architecture consists of a processor-specific mapping layer and a generic constraint set connected via a well-defined interface. The generic constraint set enforces the desired SBST behaviour, including controlling the processor’s pipeline state, memory accesses, and with that executed instructions, register state, and fault propagations. Using a generic constraint set allows for rapid SBST generation targeting new RISC-V processor families while keeping the generic constraints untouched. Lastly, we evaluate this approach on two RISC-V processor families, namely the DarkRISCV and a proprietary, industrial core showing the portability and strength of the approach, allowing for rapidly targeting new processors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DPPL Hallway Tracker: Hospital Contact Tracing During the COVID-19 Pandemic 9

DPPL Hallway Tracker: Hospital Contact Tracing During the CO...

引用

9th Scholar's Yearly Symposium of Technology, engineering and Mathematics, SYSTEM 2023

作者： Marinoni, Christian Ponzi, Valerio Comminiello, Danilo Dpt. of Information Engineering Electronics and Telecommunications Sapienza University of Rome Via Eudossiana 18 Roma00184 Italy Department of Computer Control and Management Engineering Sapienza University of Rome Via Ariosto 25 Roma00185 Italy Institute for Systems Analysis and Computer Science Italian National Research Council Via dei Taurini 19 Roma00185 Italy

During the COVID-19 pandemic, the use of a people tracking system could have been crucial, particularly in sensitive environments, such as hospitals. DPPL Hallway Tracker is a framework that uses security camera footage to determine which rooms in a corridor a person has entered. It generates a database containing all the people identified and allows quick identification of potential cases of infection based on the time spent in a room and its maximum capacity. DPPL Hallway Tracker is structured in two phases: detection and re-identification. In the first phase, it exploits Mask RCNN to identify people and room doors. In the second one, it uses the deep association metric model from DeepSORT to re-identify a person as he leaves a room. © 2023 Copyright for this paper by its authors.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：