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

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic Control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying 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 static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-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(T1-c). Moreover, if the loss functions are strongly convex, then static 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 tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Evaluation Methodologies in Software Protection Research

arXiv

引用

arXiv 2023年

作者： Sutter, Bjorn D.E. Schrittwieser, Sebastian Coppens, Bart Kochberger, Patrick Computing Systems Lab Ghent University Belgium Christian Doppler Laboratory for Assurance and Transparency in Software Protection Faculty of Computer Science University of Vienna Austria St. Pölten University of Applied Sciences Austria

Man-at-the-end (MATE) attackers have full control over the system on which the attacked software runs, and try to break the confidentiality or integrity of assets embedded in the software. Both companies and malware authors want to prevent such attacks. This has driven an arms race between attackers and defenders, resulting in a plethora of different protection and analysis methods. However, it remains difficult to measure the strength of protections because MATE attackers can reach their goals in many different ways and a universally accepted evaluation methodology does not exist. This survey systematically reviews the evaluation methodologies of papers on obfuscation, a major class of protections against MATE attacks. For 571 papers, we collected 113 aspects of their evaluation methodologies, ranging from sample set types and sizes, over sample treatment, to performed measurements. We provide detailed insights into how the academic state of the art evaluates both the protections and analyses thereon. In summary, there is a clear need for better evaluation methodologies. We identify nine challenges for software protection evaluations, which represent threats to the validity, reproducibility, and interpretation of research results in the context of MATE attacks and formulate a number of concrete recommendations for improving the evaluations reported in future research papers. Copyright © 2023, The Authors. All rights reserved.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Exploring Data Geometry for Continual Learning

arXiv

引用

arXiv 2023年

作者： Gao, Zhi Xu, Chen Li, Feng Jia, Yunde Harandi, Mehrtash Wu, Yuwei Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Department of Electrical and Computer Systems Eng. Monash University Data61 Australia

Continual learning aims to efficiently learn from a non-stationary stream of data while avoiding forgetting the knowledge of old data. In many practical applications, data complies with non-Euclidean geometry. As such, the commonly used Euclidean space cannot gracefully capture non-Euclidean geometric structures of data, leading to inferior results. In this paper, we study continual learning from a novel perspective by exploring data geometry for the non-stationary stream of data. Our method dynamically expands the geometry of the underlying space to match growing geometric structures induced by new data, and prevents forgetting by keeping geometric structures of old data into account. In doing so, making use of the mixed curvature space, we propose an incremental search scheme, through which the growing geometric structures are encoded. Then, we introduce an angular-regularization loss and a neighbor-robustness loss to train the model, capable of penalizing the change of global geometric structures and local geometric structures. Experiments show that our method achieves better performance than baseline methods designed in Euclidean space. Copyright © 2023, The Authors. All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Safety Guaranteed Power-Delivered-to-Load Maximization for Magnetic Wireless Power Transfer

Safety Guaranteed Power-Delivered-to-Load Maximization for M...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Wangqiu Zhou Xinyu Wang Hao Zhou Shenyao Jiang Zhi Liu Yusheng Ji LINKE Lab School of Computer Science and Technology University of Science and Technology of China CAS Key Laboratory of Wireless-Optical Communications University of Science and Technology of China Deqing Alpha Innovation Institute Huzhou China Department of Computer and Network Engineering The University of Electro-Communications Tokyo Japan Information Systems Architecture Science Research Division National Institute of Informatics Tokyo Japan

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Electromagnetic radiation (EMR) safety has always been a critical reason for hindering the development of magneticenabled wireless power transfer technology. People focus on the actual received energy at charging devices while paying attention to their health. Thus, we study this significant problem in this paper, and propose a universal safety guaranteed power-delivered-to-load (PDL) maximization scheme (called SafeGuard). Technically, we first utilize the off-the-shelf electromagnetic simulator to perform the EMR distribution analysis to ensure the universality of the method. Then, we innovatively introduce the concept of multiple importance sampling for achieving efficient EMR safety constraint extraction. Finally, we treat the proposed optimization problem as an optimal boundary point search problem from the perspective of space geometry, and devise a brand-new grid-based multi-constraint parallel processing algorithm to efficiently solve it. We implement a system prototype for SafeGuard, and conduct extensive experiments to evaluate it. The results indicate that our SafeGuard can obviously improve the achieved PDL by up to 1.75× compared with the state-of-the-art baseline while guaranteeing EMR safety. Furthermore, SafeGuard can accelerate the solution process by 29.12× compared with the traditional numerical method to satisfy the fast optimization requirement of wireless charging systems.

关键词： Performance evaluation Monte Carlo methods System performance Inductive charging Prototypes Wireless power transfer Parallel processing

来源：评论

学校读者我要写书评

暂无评论

Self-Paced Sample Selection for Barely-Supervised Medical Image Segmentation

arXiv

引用

arXiv 2024年

作者： Su, Junming Shen, Zhiqiang Cao, Peng Yang, Jinzhu Zaiane, Osmar R. Computer Science and Engineering Northeastern University Shenyang China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Shenyang China National Frontiers Science Center for Industrial Intelligence and Systems Optimization Shenyang China Alberta Machine Intelligence Institute University of Alberta Edmonton Canada

The existing barely-supervised medical image segmentation (BSS) methods, adopting a registration-segmentation paradigm, aim to learn from data with very few annotations to mitigate the extreme label scarcity problem. However, this paradigm poses a challenge: pseudo-labels generated by image registration come with significant noise. To address this issue, we propose a self-paced sample selection framework (SPSS) for BSS. Specifically, SPSS comprises two main components: 1) self-paced uncertainty sample selection (SU) for explicitly improving the quality of pseudo labels in the image space, and 2) self-paced bidirectional feature contrastive learning (SC) for implicitly improving the quality of pseudo labels through enhancing the separability between class semantics in the feature space. Both SU and SC are trained collaboratively in a self-paced learning manner, ensuring that SPSS can learn from high-quality pseudo labels for BSS. Extensive experiments on two public medical image segmentation datasets demonstrate the effectiveness and superiority of SPSS over the state-of-the-art. Our code is release at https://***/SuuuJM/SPSS. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Distributed Prescribed-Time Observer for Nonlinear systems in Block-Triangular Form

arXiv

引用

arXiv 2025年

作者： de Heij, Vincent Niazi, M.B. Umar Johansson, Karl H. Ahmed, Saeed Faculty of Science and Engineering University of Groningen Groningen9747 AG Netherlands Division of Decision and Control Systems Digital Futures KTH Royal Institute of Technology StockholmSE-100 44 Sweden Division of Decision and Control Systems Digital Futures KTH Royal Institute of Technology StockholmSE-100 44 Sweden Laboratory for Information and Decision Systems Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States

This paper proposes a distributed prescribed-time observer for nonlinear systems representable in a block-triangular observable canonical form. Using a weighted average of neighbor estimates exchanged over a strongly connected digraph, each observer estimates the system state despite the limited observability of local sensor measurements. The proposed design guarantees that distributed state estimation errors converge to zero at a user-specified convergence time, irrespective of observers’ initial conditions. To achieve this prescribed-time convergence, distributed observers implement time-varying local output injection gains that monotonically increase and approach infinity at the prescribed time. The theoretical convergence is rigorously proven and validated through numerical simulations, where some implementation issues due to increasing gains have also been clarified. Copyright © 2025, The Authors. All rights reserved.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

Exploring Data Geometry for Continual Learning

Exploring Data Geometry for Continual Learning

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Zhi Gao Chen Xu Feng Li Yunde Jia Mehrtash Harandi Yuwei Wu Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Department of Electrical and Computer Systems Eng. Monash University and Data61 Australia

Continual learning aims to efficiently learn from a non-stationary stream of data while avoiding forgetting the knowledge of old data. In many practical applications, data complies with non-Euclidean geometry. As such, the commonly used Euclidean space cannot gracefully capture non-Euclidean geometric structures of data, leading to in-ferior results. In this paper, we study continual learning from a novel perspective by exploring data geometry for the non-stationary stream of data. Our method dynamically expands the geometry of the underlying space to match growing geometric structures induced by new data, and pre-vents forgetting by keeping geometric structures of old data into account. In doing so, making use of the mixed cur-vature space, we propose an incremental search scheme, through which the growing geometric structures are en-coded. Then, we introduce an angular-regularization loss and a neighbor-robustness loss to train the model, capa-ble of penalizing the change of global geometric structures and local geometric structures. Experiments show that our method achieves better performance than baseline methods designed in Euclidean space.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Two routers network architecture and scheduling algorithms under packet category classification constraint 5

Two routers network architecture and scheduling algorithms u...

引用

5th International Conference on Future Networks and Distributed systems: The Premier Conference on Smart Next Generation Networking Technologies, ICFNDS 2021

作者： Sarhan, Akram Jemmali, Mahdi Ben Hmida, Abir Department of Information Systems College of Computing and Information Technology University of Jeddah Jeddah Saudi Arabia Department of Computer Science and Information College of Science at Zulfi Majmaah University Majmaah 11952 Saudi Arabia Mars Laboratory University of Sousse Sousse Tunisia Department of Computer Science Higher Institute of Computer Science and Mathematics Monastir University Monastir5000 Tunisia

ISBN: (纸本)9781450387347

The sending and exchanging of data have become essential in the current revolution of industry 4.0 and digital transformation and all aspects of life. Ensuring the security of transmitted data continues to be a critical issue due to the fast advancement in technology. The studied problem is proven to be NP-hard in the strong sense. The contribution of this paper is twofold. First, we propose a network architecture that enables multilevel data sharing through two routers based on a data category classification constraint. Second, we propose a set of heuristic algorithms for an NP-Hard problem. The constraint of the studied problem is described as follows. Two files belonging to the same category of confidential level should not be transmitted simultaneously through the routers. The proposed architecture involves a scheduler component responsible for finding a schedule that minimizes the maximum estimated transmission time respecting the data category classification constraint. An experimental result is carried out to show the performance of the proposed algorithms. Several indicators are used to measure the performance of algorithms. The best algorithm is the Modified decreasing estimated-transmission time algorithm in 91.6% of cases. The experimental results confirm the practicality of the proposed scheme in terms of two-machines scheduling problems. © 2021 ACM.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Cyber-Security Knowledge Graph Generation by Hierarchical Nonnegative Matrix Factorization

arXiv

引用

arXiv 2024年

作者： Barron, Ryan Eren, Maksim E. Bhattarai, Manish Wanna, Selma Solovyev, Nicholas Rasmussen, Kim Alexandrov, Boian S. Nicholas, Charles Matuszek, Cynthia Theoretical Division Los Alamos National Laboratory Los Alamos United States Advanced Research in Cyber Systems Los Alamos National Laboratory Los Alamos United States Department of Computer Science and Electrical Engineering University of Maryland Baltimore CountyMD United States

Much of human knowledge in cybersecurity is encapsulated within the ever-growing volume of scientific papers. As this textual data continues to expand, the importance of document organization methods becomes increasingly crucial for extracting actionable insights hidden within large text datasets. Knowledge Graphs (KGs) serve as a means to store factual information in a structured manner, providing explicit, interpretable knowledge that includes domain-specific information from the cybersecurity scientific literature. One of the challenges in constructing a KG from scientific literature is the extraction of ontology from unstructured text. In this paper, we address this topic and introduce a method for building a multi-modal KG by extracting structured ontology from scientific papers. We demonstrate this concept in the cybersecurity domain. One modality of the KG represents observable information from the papers, such as the categories in which they were published or the authors. The second modality uncovers latent (hidden) patterns of text extracted through hierarchical and semantic non-negative matrix factorization (NMF), such as named entities, topics or clusters, and keywords. We illustrate this concept by consolidating more than two million scientific papers uploaded to arXiv into the cyber-domain, using hierarchical and semantic NMF, and by building a cyber-domain-specific KG. Copyright © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

SecBCS: a secure and privacy-preserving blockchain-based crowdsourcing system

引用

science China(Information sciences) 2020年第3期63卷 20-33页

作者： Chao LIN Debiao HE Sherali ZEADALLY Neeraj KUMAR Kim-Kwang Raymond CHOO Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of EducationSchool of Cyber Science and Engineering Wuhan University State Key Laboratory of Cryptology College of Communication and Information University of Kentucky Department of Computer Science and Engineering Thapar University Department of Information Systems and Cyber Security and Department of Electrical and Computer Engineering University of Texas at San Antonio

A robust and scalable crowd management infrastructure is crucial in addressing operational challenges when deploying high-density sensors and actuators in a smart city. While crowdsourcing is widely used in crowd management, conventional solutions, such as Upwork and Amazon Mechanical Turk, generally depend on a trusted third-party platform. There exist several potential security concerns(e.g., sensitive leakage, single point of failure and unfair judgment) in such a centralized paradigm. Hence, a recent trend in crowdsourcing is to leverage blockchain(a decentralized ledger technology) to address some of the existing limitations. A small number of blockchain-based crowdsourcing systems(BCSs) with incentive mechanisms have been proposed in the literature, but they are generally not designed with security in mind. Thus, we study the security and privacy requirements of a secure BCS and propose a concrete solution(i.e., SecBCS)with a prototype implementation based on JUICE.

关键词： crowdsourcing blockchain secure privacy-preserving smart contract

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：