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

Efficient cache replacement framework based on access hotness for spacecraft processors

中国空间科学技术（中英文） 2024年第2期44卷 74-88页

作者： GAO Xin NIAN Jiawei LIU Hongjin YANG Mengfei Beijing Institute of Control Engineering Beijing 100190China Beijing SunWise Space Technology Co. Ltd.Beijing 100190China School of Computer Science and Technology Xidian UniversityXi'an 710071China China Academy of Space Technology Beijing 100094China

A notable portion of cachelines in real-world workloads exhibits inner non-uniform access ***,modern cache management rarely considers this fine-grained feature,which impacts the effective cache capacity of contemporary high-performance spacecraft *** harness these non-uniform access behaviors,an efficient cache replacement framework featuring an auxiliary cache specifically designed to retain evicted hot data was *** framework reconstructs the cache replacement policy,facilitating data migration between the main cache and the auxiliary *** traditional cacheline-granularity policies,the approach excels at identifying and evicting infrequently used data,thereby optimizing cache *** evaluation shows impressive performance improvement,especially on workloads with irregular access *** from fine granularity,the proposal achieves superior storage efficiency compared with commonly used cache management schemes,providing a potential optimization opportunity for modern resource-constrained processors,such as spacecraft ***,the framework complements existing modern cache replacement policies and can be seamlessly integrated with minimal modifications,enhancing their overall efficacy.

关键词： spacecraft processors cache management replacement policy storage efficiency memory hierarchy microarchitecture

来源：评论

学校读者我要写书评

暂无评论

Parallel-Friendly and Work-Efficient Single Source Shortest Path Algorithm on Single-Node System 24

Parallel-Friendly and Work-Efficient Single Source Shortest ...

引用

24th IEEE International Conference on High Performance Computing and Communications, 8th IEEE International Conference on Data Science and Systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Zhang, Jie Zhang, Yuan Sun, Yiming Cao, Huawei An, Xuejun Ye, Xiaochun Institute of Computing Technology Cas State Key Lab of Processors Beijing China School of Computer and Control Engineering Ucas Beijing China Nanjing Institute of Information Superbahn Cas Nanjing China

ISBN: (纸本)9798350319934

The Single-Source Shortest Path (SSSP) algorithm is one of the most important kernels used by a variety of high-level graph processing applications. Although having been extensively studied for single-node scenarios, SSSP algorithm still faces difficulties when being deployed on scale-free graph, which brings about redundant edge traversals, expensive atomic operations and random memory access. In this paper, three parallel-friendly and work-efficient opti-mizations are introduced to improve the performance of parallel SSSP algorithm with shared memory on the single-node system. First, a label-aware pruning technique is proposed to reduce the redundant edge traversals. Then, atomic operations caused by race conditions are eliminated by using destination-driven sub graph partitioning. Finally, we propose a double-ordered bucket strategy to further improve the efficiency of SSSP. The experiment demonstrates that the average speedup reaches to 27.58x compared with original implement for R-MAT graphs. Meanwhile, our method achieves up to 2.12x for R-MAT graphs and 4.45 x for real-world graphs on average compared to previous state-of-the-art parallel implementation. © 2022 IEEE.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Testing and Development of a Multi-Object Tracker Based on Deep Learning Techniques 1st

Testing and Development of a Multi-Object Tracker Based on D...

引用

1st International Conference on Machine Intelligence for Research and Innovations, MAiTRI 2023

作者： Rajput, Shaurya Verma, Sourabh Verma, Om Prakash Gupta, Himanshu Sharma, Tarun Ateya, Abdelhamied A. Centre for Artificial Intelligence Dr. B.R. Ambedkar National Institute of Technology Jalandhar Punjab Jalandhar India Department of Instrumentation and Control Engineering Dr. B.R. Ambedkar National Institute of Technology Jalandhar Punjab Jalandhar India Department of Computer Science-Internet of Things ABES Institute of Technology Ghaziabad201009 India University Meerut India Department of Electronics and Communications Engineering Zagazig University Sharqia Zagazig44519 Egypt EIAS Data Science Lab College of Computer and Information Sciences Prince Sultan University Riyadh11586 Saudi Arabia

ISBN: (纸本)9789819981342

In today’s scenario, computer vision is one of the fundamental research areas of artificial intelligence including object detection and object tracking which are the upcoming trends. In the present work, the TransTrack model has been reimplemented which includes ResNet50 as a backbone network. Further, to improve the overall performance of the TransTrack model, some recently developed backbones such as ResNet152 and SwinT have been incorporated. Moreover, to test the optimum training of the existing model, it has been retrained for higher epochs (such as 160 epochs). However, the accuracy of the existing tracker has improved significantly as the number of epochs increases but, at the same time, it increases the computational complexity. On the contrary, when the existing tracker (yields 68.4% accuracy with ResNet50) is incorporated with ResNet152 and SwinT, the performance has significantly improved (71% for ResNet152 and 71.6% for SwinT) by 1.7% and 2.1%, respectively. The mentioned analysis is enough to prove that the incorporation of a more efficient backbone has the potential to improve the performance of trackers. In the future, the newly introduced backbone may open the window to improve the performance of multi-object tracking (MOT). © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Bayesian hypergame approach to equilibrium stability and robustness in moving target defense 63

Bayesian hypergame approach to equilibrium stability and rob...

引用

63rd IEEE Conference on Decision and control, CDC 2024

作者： Zhang, Hanzheng Cheng, Zhaoyang Chen, Guanpu Johansson, Karl Henrik Shanghai Research Institute for Autonomous Intelligent Systems Tongji University Shanghai China University of Chinese Academy of Science Academy of Mathematics and System Science Chinese Academy of Science Beijing China Kth Royal Institute of Technology and the Digital Futures Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm Sweden

ISBN: (纸本)9798350316339

We investigate the equilibrium stability and robustness in a class of moving target defense problems, in which players have both incomplete information and asymmetric cognition. We first establish a Bayesian Stackelberg game model for incomplete information and then employ a hypergame reformulation to address asymmetric cognition. With the core concept of the hyper Bayesian Nash equilibrium (HBNE), a condition for achieving both the strategic and cognitive stability in equilibria can be realized by solving linear equations. Moreover, to deal with players' underlying perturbed knowledge, we study the equilibrium robustness by presenting a condition of robust HBNE under the given configuration. Experiments evaluate our theoretical results. © 2024 IEEE.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Distributed H2 controller Synthesis for Multi-Agent Systems with Stochastic Packet Loss

Distributed H2 Controller Synthesis for Multi-Agent Systems ...

引用

American control Conference (ACC)

作者： Christian Hespe Adwait Datar Daniel Schneider Hamideh Saadabadi Herbert Werner Hannes Frey Institute of Control Systems Hamburg University of Technology Hamburg Germany Institute for Computer Science University of Koblenz Koblenz Germany

In practical networking scenarios, communication links can rarely be considered to be deterministic, yet the influence of stochastic interconnections on multi-agent systems is neglected most of the time. To bridge this gap, this paper develops synthesis conditions for distributed state- and output-feedback controllers that guarantee an upper bound on the closed-loop H 2 -norm under the effect of Bernoulli distributed packet loss. Utilizing the frameworks of Markov jump linear system and decomposable systems, the synthesis problem is formulated as a linear matrix inequality problem with complexity that scales linearly with the number of agents. Finally, the closed-loop performance is assessed in simulation studies with a signal-to-interference-plus-noise ratio based packet loss model for communication between autonomous underwater vehicles.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Direct data-driven control with signal temporal logic specifications ★

arXiv

引用

arXiv 2023年

作者： van Huijgevoort, Birgit C. Verhoek, Chris Tóth, Roland Haesaert, Sofie Eindhoven University of Technology Netherlands Max Planck Institute for Software Systems Germany The Institute for Computer Science and Control Hungary

Most control synthesis methods under temporal logic properties require a model of the system, however, identifying such a model can be a challenging task. In this work, we develop a direct data-driven control synthesis method for temporal logic specifications, which does not require this explicit modeling step, capable of providing certificates for the general class of linear systems. After collecting a single sequence of input-output data from the system, we construct a data-driven characterization of the behavior. Using this characterization, we synthesize a controller, such that the controlled system satisfies a (possibly unbounded) temporal logic specification. The underlying optimization problem is solved by mixed-integer linear programming. We demonstrate the applicability of the results through simulation examples. © 2023, CC BY-NC-SA.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

Research on Black-Box Adversarial Attack Based on Transformer 4

Research on Black-Box Adversarial Attack Based on Transforme...

引用

4th International Conference on Frontiers technology of Information and computer, ICFTIC 2022

作者： Zheng, Wenjuan Luo, Hanxu Ji, YuXin Li, Haipeng Cong, Longjian National Key Laboratory of Aerospace Intelligent Control Technology Master of Computer Vision Beijing100854 China Beijing Aerospace Automatic Control Institute Beijing100854 China Wuhan University of Technology Department of Information Engineering Hubei Province Wuhan430000 China

ISBN: (纸本)9798350321951

The classic adversarial samples of black-box attacks are all aimed at the models of Convolutional neural networks (CNNs), but they do not perform well on the new recognition networks based on Transformer. In this paper, we propose an adversarial sample generation algorithm based on Vision transformers (VITs)' self-attention mechanism and patch partition. We noticed that different blocks in the VIT have uneven attention distribution, so we first generated a patch-based attention map and performed threshold segmentation, which is used as a mask to perform data enhancement operations based on patches with high weight and patches with low weight, and then exchanged information between patches to generate adversarial samples. The experiment of simulating black-box attack shows that the adversarial samples generated by the algorithm in this paper have a high success rate in all kinds of models based on Transformer of attacks, and also perform well on CNNs. © 2022 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Slow Convergence of Interacting Kalman Filters in Word-of-Mouth Social Learning

Slow Convergence of Interacting Kalman Filters in Word-of-Mo...

引用

Annual Allerton Conference on Communication, control, and Computing

作者： Vikram Krishnamurthy Cristian R. Rojas School of Electrical and Computer Engineering Cornell University Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden

ISBN: (数字)9798331541033

ISBN: (纸本)9798331541040

We consider word-of-mouth social learning involving $m$ Kalman filter agents that operate sequentially. The first Kalman filter receives the raw observations, while each subsequent Kalman filter receives a noisy measurement of the conditional mean of the previous Kalman filter. The prior is updated by the m-th Kalman filter. When $m=2$ , and the observations are noisy measurements of a Gaussian random variable, the covariance goes to zero as $k^{-1/3}$ for $k$ observations, instead of $O(k^{-1})$ in the standard Kalman filter. In this paper we prove that for $m$ agents, the covariance decreases to zero as $k^{-(2^{m}-1)}$ , i.e, the learning slows down exponentially with the number of agents. We also show that by artificially weighing the prior at each time, the learning rate can be made optimal as $k^{-1}$ . The implication is that in word-of-mouth social learning, artificially re-weighing the prior can yield the optimal learning rate.

关键词： Random variables Kalman filters Noise measurement Standards Convergence

来源：评论

学校读者我要写书评

暂无评论

High Efficiency Dual-Active-Bridge Converter with Triple-Phase-Shift control for Battery Charger of Electric Vehicles

引用

Energies 2024年第2期17卷 354页

作者： Kuo, Shih-Hao Chiu, Huang-Jen Chiang, Che-Wei Huang, Ta-Wei Chang, Yu-Chen Bachman, Serafin Piasecki, Szymon Jasinski, Marek Turzyński, Marek Department of Electronic and Computer Engineering National Taiwan University of Science and Technology Taipei106 Taiwan Institute of Control and Industrial Electronics Warsaw University of Technology Warsaw00-662 Poland Faculty of Electrical and Control Engineering Gdańsk University of Technology Gdansk80-233 Poland

An optimal modulation scheme with triple-phase-shift (TPS) control could increase the efficiency in the entire load range for a dual-active-bridge (DAB) converter under wide output voltage range conditions. Therefore, this study proposes a convergent approach to TPS mode selection, coupled with an optimal modulation scheme, ensuring the circuit’s efficiency over the entire range in the realm of a high-power and high-efficiency battery charger for electric vehicles. The convergent approach to TPS mode selection also reduces the numerous cases for small-signal analysis through general average modeling. After verifying the small-signal models under various voltage transfer ratios and load conditions to verify the stability, a converter prototype with a rated power of 15 kW is built and tested. Thus, a peak efficiency of 97.7% can be achieved. © 2024 by the authors.

关键词： Charging (batteries)

来源：评论

学校读者我要写书评

暂无评论

Zero-Order Stochastic Conditional Gradient Sliding Method for Non-smooth Convex Optimization 22nd

Zero-Order Stochastic Conditional Gradient Sliding Method fo...

引用

22nd International Conference on Mathematical Optimization Theory and Operations Research , MOTOR 2023

作者： Lobanov, Aleksandr Anikin, Anton Gasnikov, Alexander Gornov, Alexander Chukanov, Sergey Moscow Institute of Physics and Technology Dolgoprudny Russia ISP RAS Research Center for Trusted Artificial Intelligence Moscow Russia Moscow Aviation Institute Moscow Russia Matrosov Institute for System Dynamics and Control Theory Irkutsk Russia Institute for Information Transmission Problems RAS Moscow Russia Caucasus Mathematical Center Adyghe State University Maikop Russia Federal Research Center "Computer Science and Control" RAS Moscow Russia

ISBN: (纸本)9783031432569

The conditional gradient idea proposed by Marguerite Frank and Philip Wolfe in 1956 was so well received by the community that new algorithms (also called Frank–Wolfe type algorithms) are still being actively created. In this paper, we study a non-smooth stochastic convex optimization problem with constraints. Using a smoothing technique and based on an accelerated batched first-order Stochastic Conditional Gradient Sliding method, we propose a novel gradient-free Frank–Wolfe type algorithm called Zero-Order Stochastic Conditional Gradient Sliding (ZO-SCGS). This algorithm is robust not only for the class of non-smooth problems, but surprisingly also for the class of smooth black box problems, outperforming the SOTA algorithms in the smooth case in term oracle calls. In practical experiments we confirm our theoretical results. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：