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

American Control Conference (ACC)

作者： Dejin Ren Taoran Wu Bai Xue State Key Lab. of Computer Science CAS Institute of Software Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (数字)9798350382655

ISBN: (纸本)9798350382662

This paper focuses on addressing the problem of computing controlled reach-avoid sets for continuous-time systems modeled by polynomial ordinary differential equations with control inputs in order to ensure the safety and reachability of safety-critical systems. In a controlled reach-avoid set (CRAS), there exists a feedback controller capable of driving the closed-loop system into a target set of desired states while avoiding hazardous regions. The computation of a controlled reach-avoid set can be transformed into a search for a guidance-barrier function in existing literature. However, existing guidance-barrier functions tend to produce conservative CRASs due to certain flaws. To overcome this issue, a new guidance-barrier function is introduced, which generates less conservative CRASs compared to existing ones. Given the inherent nonlinearity associated with searching for guidance-barrier functions in the control setting, an iterative computational approach is proposed. This approach modifies controllers from previous iterations to find these functions and expand CRASs by solving convex optimizations. Finally, numerical results demonstrate the efficiency of our method in generating less conservative CRASs.

关键词： Three-dimensional displays Computational modeling Ordinary differential equations Polynomials Mathematical models Convex functions Safety

来源：评论

学校读者我要写书评

暂无评论

Collision-resistant hash-shuffles on the reals

arXiv

引用

arXiv 2025年

作者： Barmpalias, George Zhang, Xiaoyan State Key Lab of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

Oneway real functions are effective maps on positive-measure sets of reals that preserve randomness and have no effective probabilistic inversions. We construct a oneway real function which is collision-resistant: the probability of effectively producing distinct reals with the same image is zero, and each real has uncountable inverse image. Copyright © 2025, The Authors. All rights reserved.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

On Efficient Packet Batching and Resource Allocation for GPU based NFV Acceleration 31

On Efficient Packet Batching and Resource Allocation for GPU...

引用

31st IEEE/ACM International Symposium on Quality of Service, IWQoS 2023

作者： Zeng, Deze Zhu, Andong Gu, Lin Chen, Quan Guo, Minyi School of Computer Science China University of Geosciences Hubei Wuhan China Nanjing University State Key Lab. for Novel Software Technology Nanjing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai China

ISBN: (纸本)9798350399738

Network Function Virtualization (NFV) has already become an essential technology for improving the scalab.lity and flexibility of modern computer networks. The performance gap has become the main issue that impedes the development of NFV. GPUs, with massive parallel processors, are advocated to accelerate the Virtualized Network Functions (VNFs). However, the special architecture and workflow of GPUs introduce new challenges, especially on the batched processing, and resource allocation. In this paper, we propose GPU-based NFV Acceleration framework (GNFA) with an efficient packet batching and resource allocation solution. Considering the increased latency caused by the accumulation of the GPU kernel invoking overhead, we first invent a latency reduction mechanism called SM Performance Compensation (SPC). A Partition and Adjustment based Batching and Resource Allocation (PABARA) algorithm that jointly considers batch size tuning and GPU thread allocation is also proposed. We have practically implemented GNFA and extensively evaluated its performance on some well-known VNFs. The experiment results show that GNFA can effectively promote the GPU resource utilization and improve the NFV performance in terms of per-packet latency. © 2023 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Understanding Transaction Bugs in Database Systems 24

Understanding Transaction Bugs in Database Systems

引用

44th ACM/IEEE International Conference on software Engineering, ICSE 2024

作者： Cui, Ziyu Dou, Wensheng Gao, Yu Wang, Dong Song, Jiansen Zheng, Yingying Wang, Tao Yang, Rui Xu, Kang Hu, Yixin Wei, Jun Huang, Tao State Key Lab of Computer Science at Iscas China University of Cas Beijing China Nanjing Institute of Software Technology China University of Cas Nanjing China Sun Yat-sen University Guangzhou China

ISBN: (纸本)9798400702174

Transactions are used to guarantee data consistency and integrity in Database Management Systems (DBMSs), and have become an indispensable component in DBMSs. However, faulty designs and implementations of DBMSs' transaction processing mechanisms can introduce transaction bugs, and lead to severe consequences, e.g., incorrect database states and DBMS crashes. An in-depth understanding of real-world transaction bugs can significantly promote effective techniques in combating transaction bugs in DBMSs. In this paper, we conduct the first comprehensive study on 140 transaction bugs collected from six widely-used DBMSs, i.e., MySQL, PostgreSQL, SQLite, MariaDB, CockroachDB, and TiDB. We investigate these bugs from their bug manifestations, root causes, bug impacts and bug fixing. Our study reveals many in-teresting findings and provides useful guidance for transaction bug detection, testing, and verification. © 2024 ACM.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Safe Exit Controllers Synthesis for Continuous-time Stochastic Systems

Safe Exit Controllers Synthesis for Continuous-time Stochast...

引用

IEEE Conference on Decision and Control

作者： Bai Xue Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Lab. of Computer Science Institute of Software CAS Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

This paper tackles the problem of generating safe exit controllers for continuous-time systems described by stochastic differential equations (SDEs). The primary aim is to develop controllers that maximize the lower bounds of the exit probability that the system escapes from a safe but uncomfortable set within a specified time frame and guide it towards a comfortable set. The paper considers two distinct cases: one in which the boundary of the safe set is a subset of the boundary of the uncomfortable set, and the other where the boundaries of the two sets do not intersect. To begin, we present a sufficient condition for establishing lower bounds on the exit probability in the first case. This condition serves as a guideline for constructing a point-wise optimization using linear programs. The linear programming problem is designed to implicitly synthesize an optimal exit controller online that maximizes the lower bounds of the exit probability. The method employed in the first case is then extended to the second one. Finally, we demonstrate the effectiveness of the proposed approaches on one example.

关键词： Lower bound Sufficient conditions Stochastic systems Differential equations Linear programming Control systems Trajectory Optimization Guidelines

来源：评论

学校读者我要写书评

暂无评论

GoT: Effective Graph-of-Thought Reasoning in Language Models

GoT: Effective Graph-of-Thought Reasoning in Language Models

引用

2024 Findings of the Association for Computational Linguistics: NAACL 2024

作者： Yao, Yao Li, Zuchao Zhao, Hai Department of Computer Science and Engineering Shanghai Jiao Tong University China MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University China National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan430072 China

ISBN: (纸本)9798891761193

With the widespread use of language models (LMs) in NLP tasks, researchers have discovered the potential of Chain-of-thought (CoT) to assist LMs in accomplishing complex reasoning tasks by generating intermediate steps. However, human thought processes are often non-linear, rather than simply sequential chains of thoughts. Therefore, we propose Graph-of-Thought (GoT) reasoning, which models human thought processes not only as a chain but also as a graph. By representing thought units as nodes and connections between them as edges, our approach captures the non-sequential nature of human thinking and allows for a more realistic modeling of thought processes. GoT adopts a two-stage framework with an additional GoT encoder for thought graph representation and fuses the graph representation with the original input representation through a gated fusion mechanism. We evaluate GoT's performance on a text-only reasoning task (AQUA-RAT) and a multimodal reasoning task (scienceQA). Our model achieves significant improvement over the strong CoT baseline on the AQUA-RAT test set and boosts accuracy from 85.19% to 87.59% using the T5-base model over the state-of-the-art Multimodal-CoT (Zhang et al., 2023) on the scienceQA test set. Our code is publicly availab.e at https://***/Zoeyyao27/Graphof-Thought. © 2024 Association for Computational Linguistics.

关键词： Rats

来源：评论

学校读者我要写书评

暂无评论

CLIMS++: Cross Language Image Matching with Automatic Context Discovery for Weakly Supervised Semantic Segmentation

引用

International Journal of computer Vision 2025年 1-20页

作者： Xie, Jinheng Deng, Songhe Hou, Xianxu Luo, Zhaochuan Shen, Linlin Huang, Yawen Zheng, Yefeng Shou, Mike Zheng Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Computer Science Wenzhou-Kean University Wenzhou325060 China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China Show Lab National University of Singapore Singapore639798 Singapore School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University Suzhou215400 China Jarvis Research Center Tencent YouTu Lab Shenzhen518703 China

While promising results have been achieved in weakly-supervised semantic segmentation (WSSS), limited supervision from image-level tags inevitably induces discriminative reliance and spurious relations between target classes and background regions. Thus, Class Activation Map (CAM) usually tends to activate discriminative object regions and falsely includes lots of class-related backgrounds. Without pixel-level supervisions, it could be very difficult to enlarge the foreground activation and suppress those false activation of background regions. In this paper, we propose a novel framework of Cross Language Image Matching with Automatic Context Discovery (CLIMS++), based on the recently introduced Contrastive Language-Image Pre-training (CLIP) model, for WSSS. The core idea of our framework is to introduce natural language supervision to activate more complete object regions and suppress class-related background regions in CAM. In particular, we design object, background region, and text lab.l matching losses to guide the model to excite more reasonable object regions of each category. In addition, we propose to automatically find spurious relations between foreground categories and backgrounds, through which a background suppression loss is designed to suppress the activation of class-related backgrounds. The above designs enable the proposed CLIMS++ to generate a more complete and compact activation map for the target objects. Extensive experiments on PASCAL VOC 2012 and MS COCO 2014 datasets show that our CLIMS++ significantly outperforms the previous state-of-the-art methods. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Computable one-way functions on the reals

arXiv

引用

arXiv 2024年

作者： Barmpalias, George Zhang, Xiaoyan State Key Lab of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

A major open problem in computational complexity is the existence of a one-way function, namely a function from strings to strings which is computationally easy to compute but hard to invert. Levin (2023) formulated the notion of one-way functions from reals (infinite bit-sequences) to reals in terms of computability, and asked whether partial computable one-way functions exist. We give a strong positive answer using the hardness of the halting problem and exhibiting a total computable one-way function. Copyright © 2024, The Authors. All rights reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Dimensionality and randomness

arXiv

引用

arXiv 2024年

作者： Barmpalias, George Zhang, Xiaoyan State Key Lab of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

Arranging the bits of a random string or real into k columns of a two-dimensional array or higher dimensional structure is typically accompanied with loss in the Kolmogorov complexity of the columns, which depends on k. We quantify and characterize this phenomenon for arrays and trees and its relationship to negligible classes. Copyright © 2024, The Authors. All rights reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Formally Verified C Code Generation from Hybrid Communicating Sequential Processes

Formally Verified C Code Generation from Hybrid Communicatin...

引用

IEEE/ACM International Conference on Cyber-Physical Systems (ICCPS)

作者： Shuling Wang Zekun Ji Xiong Xu Bohua Zhan Qiang Gao Naijun Zhan State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (数字)9798350369274

ISBN: (纸本)9798350369281

Hybrid Communicating Sequential Processes (HCSP) is a formal model for hybrid systems, including primitives for evolution along an ordinary differential equation (ODE), communication, and parallel composition. Code generation is needed to convert HCSP models into code that can be executed in practice, and the correctness of this conversion is essential to ensure that the generated code accurately reflects the formal model. In this paper, we propose a code generation algorithm from HCSP to C with POSIX library for concurrency. The main difficulties include how to bridge the gap between the synchronized communication model in HCSP and the use of mutexes for synchronization in C, and how to discretize evolution along ODEs and support interrupt of ODE evolution by communication. To prove the correctness of code generation, we define a formal semantics for POSIX C, and build transition system models for both HCSP and C programs. We then define an approximate bisimulation relation between traces of transition systems, and show that under certain robustness conditions for HCSP, the generated C program is approximately bisimilar to the original model. Finally, we evaluate the code generation algorithm on a detailed model for automatic cruise control, showing its utility on real-world examples.

关键词： Industries Codes Semantics Ordinary differential equations Mathematical models Robustness Hybrid power systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：