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

Autonomous dynamic formation for maritime target tracking using multi-agent reinforcement learning

Engineering Applications of Artificial Intelligence 2025年 154卷

作者： Wang, Hua Li, Jiaxin Tao, Hao Liu, Junnan Li, Chaochao Wang, Ke Xu, Mingliang School of Computer Science and Artificial Intelligence Zhengzhou University Zhengzhou450001 China Engineering Research Center of Intelligent Swarm Systems Ministry of Education Zhengzhou450001 China National Supercomputing Center in Zhengzhou Zhengzhou450001 China China Ship Development and Design Center Wuhan430064 China School of Geo-Science & Technology Zhengzhou University Zhengzhou450001 China

In various maritime missions such as escort and roundup, dynamic formation target tracking plays a crucial role. Most existing dynamic formation methods require user intervention before formation changes, resulting in poor flexibility and low automation. And they do not consider variations in the abilities of individual members. To address the above issue, we propose an autonomous dynamic formation planning method based on multi-agent reinforcement learning, integrating formation configuration into the strategy. This method can automatically adjust the formation based on the current state of the formation, providing greater flexibility and adaptability. Simultaneously, a staged reward function is devised for the training process to guide agents in progressively learning dynamic formation tasks. Finally, we validate the effectiveness and generalization of our proposed method through various experiments. © 2025 Elsevier Ltd

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A SCHEME TO ENFORCE DATA DEPENDENCE ON LARGE MULTIPROCESSOR SYSTEMS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1987年第6期13卷 726-739页

作者： ZHU, CQ YEW, PC Center for Supercomputing Research and Development University of Illinois at Urbana-Champaign

Enforcement of data dependence in parallel algorithms demands certain synchronization primitives. For simple data dependence, synchronization primitives such as Full/Empty bit in a HEP machine can be quite effective. However, if data dependence cannot be determined at compile time, or if it is very complicated, more efficient synchronization schemes and algorithms are required. A synchronization scheme is proposed that is very useful in enforcing data dependence on a large multiprocessor system. A possible hardware implementation of this scheme also is suggested. Using very large-scale integration technology, the proposed scheme can be implemented efficiently by incorporating some simple processing capabilities on the shared memories.

关键词： Synchronization Data Dependence Multiprocessor Program Vectorization

来源：评论

学校读者我要写书评

暂无评论

IMPROVING THE PERFORMANCE OF PARALLEL RELAXATION-BASED CIRCUIT SIMULATORS

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1993年第11期12卷 1762-1774页

作者： HUNG, GG WEN, YC GALLIVAN, KA SALEH, RA Center for Supercomputing Research and Development University of Illinois Urbana IL USA

In this paper, we describe methods of increasing parallelism, thereby improving the performance, of waveform relaxation-based parallel circuit simulators. The key contribution is the use of parallel nonlinear relaxation and parallel model evaluation to solve large subcircuits that may lead to load balancing problems. These large subcircuits are further partitioned and solved on clusters of tightly-coupled multiprocessors. This paper describes a general hybrid/hierarchical approach for waveform relaxation, and then focuses on the implementation issues regarding parallel nonlinear relaxation and parallel model evaluation. A number of benchmark circuits are used to demonstrate the improved performance of this approach and its range of applicability in parallel circuit simulation.

关键词： Circuit simulation Load management Relaxation methods Parallel processing Runtime Processor scheduling Feedback loop Degradation US Department of Energy Delta modulation

来源：评论

学校读者我要写书评

暂无评论

AUTOMATIC DETECTION OF PARALLELISM - A GRAND CHALLENGE FOR HIGH-PERFORMANCE COMPUTING

引用

IEEE PARALLEL & DISTRIBUTED TECHNOLOGY 1994年第3期2卷 37-47页

作者： BLUME, W EIGENMANN, R HOEFLINGER, J PADUA, D PETERSEN, P RAUCHWERGER, L TU, P Center for Supercomputing Research and Development University of Illinois Urbana-Champaign USA

The limited ability of compilers to find the parallelism in programs is a significant barrier to the use of high-performance computers. However, a combination of static and runtime techniques can improve compilers to ... 详细信息

关键词： Parallel processing Concurrent computing Program processors Read-write memory High performance computing Runtime research and development Computer aided instruction Hardware Supercomputers

来源：评论

学校读者我要写书评

暂无评论

ON REDUCING DATA SYNCHRONIZATION IN MULTIPROCESSED LOOPS

引用

IEEE TRANSACTIONS ON COMPUTERS 1987年第1期36卷 105-109页

作者： LI, ZY ABUSUFAH, W Center for Supercomputing Research and Development University of Illinois Urbana IL 6180

In this correspondence we present and prove the correctness of an algorithm for reducing the number of synchronized memory references to shared data elements in multiprocessed loops. Optimizing compilers for shared memory multiprocessors can use this algorithm to reduce synchronization overhead. The algorithm has been implemented as a new module in the multiprocessors version of Parafrase, the restructuring system of the University of Illinois. We present a brief discussion of experiments we performed to asses the effectiveness of this algorithm in reducing the synchronization overhead for the 61 subroutines of EISPACK, a package for computing matrix eigenvectors and eigenvalues.

关键词： Data synchronization overhead multiprocessed loops optimizing compilers for multiprocessors shared memory multiprocessors small granularity multiprocessing

来源：评论

学校读者我要写书评

暂无评论

EXPERIMENTALLY CHARACTERIZING THE BEHAVIOR OF MULTIPROCESSOR MEMORY-SYSTEMS - A CASE-STUDY

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1990年第2期16卷 216-223页

作者： GALLIVAN, K GANNON, D JALBY, W MALONY, A WIJSHOFF, H Center for Supercomputing Research and Development University of Illinois at Urbana-Champaign Urbana IL 61801

Although architectural improvements in memory organization of multiprocessor systems can increase effective data bandwidth, the actual performance achieved is highly dependent upon the characteristics of the memory address streams; e.g., the data access rate, and the temporal and spatial distributions. Accurately quantifying the performance behavior of a multiprocessor memory system across a broad range of algorithmic parameters is crucial if users (and restructuring compilers) are to achieve high-performance codes. In this paper, we demonstrate how the behavior of a cache-based multivector processor memory system can be systematically characterized and its performance experimentally correlated with key features of the address stream. The approach is based on the definition of a family of parameterized kernels used to explore specific aspects of the memory system's performance. The empirical results from this kernel suite provide the data from which architectural or algorithmic characteristics can be studied. The results of applying the approach to an Alliant FX/8 are presented. [ABSTRACT FROM AUTHOR]

关键词： Characterization memory systems multiprocessor performance

来源：评论

学校读者我要写书评

暂无评论

GUIDED SELF-SCHEDULING - A PRACTICAL SCHEDULING SCHEME FOR PARALLEL SUPERCOMPUTERS

引用

IEEE TRANSACTIONS ON COMPUTERS 1987年第12期36卷 1425-1439页

作者： POLYCHRONOPOULOS, CD KUCK, DJ Center for Supercomputing Research and Development University of Illinois at Urbana-Champaign Urbana IL 6180

This paper proposes guided self-scheduling, a new approach for scheduling arbitrarily nested parallel program loops on shared memory multiprocessor systems. Utilizing loop parallelism is clearly most crucial in achieving high system and program performance. Because of its simplicity, guided self-scheduling is particularly suited for implementation on real parallel machines. This method achieves simultaneously the two most important objectives: load balancing and very low synchronization overhead. For certain types of loops we show analytically that guided self-scheduling uses minimal overhead and achieves optimal schedules. Two other interesting properties of this method are its insensitivity to the initial processor configuration (in time) and its parameterized nature which allows us to tune it for different systems. Finally we discuss experimental results that clearly show the advantage of guided self-scheduling over the most widely known dynamic methods.

关键词： Parallel Fortran programs parallel loops parallel supercomputers run-time overhead self-scheduling synchronization

来源：评论

学校读者我要写书评

暂无评论

PARALLEL supercomputing TODAY AND THE CEDAR APPROACH

引用

SCIENCE 1986年第4741期231卷 967-974页

作者： KUCK, DJ DAVIDSON, ES LAWRIE, DH SAMEH, AH Center for Supercomputing Research and Development University of Illinois at Urbana-Champaign Urbana IL 61801.

More and more scientists and engineers are becoming interested in using supercomputers. Earlier barriers to using these machines are disappearing as software for their use improves. Meanwhile, new parallel supercomputer architectures are emerging that may provide rapid growth in performance. These systems may use a large number of processors with an intricate memory system that is both parallel and hierarchical; they will require even more advanced software. Compilers that restructure user programs to exploit the machine organization seem to be essential. A wide range of algorithms and applications is being developed in an effort to provide high parallel processing performance in many fields. The Cedar supercomputer, presently operating with eight processors in parallel, uses advanced system and applications software developed at the University of Illinois during the past 12 years. This software should allow the number of processors in Cedar to be doubled annually, providing rapid performance advances in the next decade.

关键词： Algorithms Supercomputers Parallel computing Computer software Mathematical vectors Computer memory Computer programming Conference proceedings Multiprocessors International conferences

来源：评论

学校读者我要写书评

暂无评论

RRGMambaFormer: A hybrid Transformer-Mamba architecture for radiology report generation

引用

Expert Systems with Applications 2025年 279卷

作者： Li, Hongzhao Liu, Siwei Wang, Hui Jiang, Xiaoheng Jiu, Mingyuan Chen, Li Lu, Yang Li, Shupan Xu, Mingliang School of Computer and Artificial Intelligence Zhengzhou University No. 100 Kexue Avenue Zhengzhou High-tech Industrial Development Zone Zhengzhou450001 China Engineering Research Center of Intelligent Swarm Systems Ministry of Education No. 100 Kexue Avenue Zhengzhou High-tech Industrial Development Zone Zhengzhou450001 China National Supercomputing Center in Zhengzhou Changchun Road and Fengyang Street High-tech Zone Zhengzhou450001 China Department of Machine Learning Mohamed bin Zayed University of Artificial Intelligence Masdar City Abu Dhabi United Arab Emirates

Radiology report generation (RRG) is a critical yet time-consuming task in clinical practice, requiring a high level of expertise to ensure accuracy. Automating this process using generative AI has the potential to significantly enhance efficiency and alleviate the burden on radiologists. In this paper, we introduce RRGMambaFormer, a novel hybrid architecture specifically designed for cross-modal radiology report generation that processes both medical images and text data. Our architecture synergistically combines Transformer modeling with Mamba sequence processing technology to handle the unique challenges of cross-modal medical data generation. This approach addresses key challenges in processing cross-modal medical data, including modality alignment, semantic gap bridging, and the computational inefficiency of traditional Transformer architectures. By replacing traditional positional encoding with a Mamba preprocessing block and incorporating an additional Mamba layer in the decoder, RRGMambaFormer enhances dynamic adaptability to both visual and textual modalities, improves sequence modeling, and reduces computational overhead. Furthermore, a multi-granularity contextual memory block is introduced to balance local visual details with global textual context, ensuring semantic consistency between image features and generated reports. Experimental results demonstrate that RRGMambaFormer not only improves the quality of radiology reports through better cross-modal feature integration but also significantly reduces computational complexity and inference time, achieving superior performance with fewer model parameters compared to existing Transformer-based models. Our source code is available here. © 2025 Elsevier Ltd

关键词： Radiology

来源：评论

学校读者我要写书评

暂无评论

The performance of the cedar multistage switching network

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1997年第4期8卷 321-336页

作者： Torrellas, J Zhang, Z Center for Supercomputing Research and Development University of Illinois Urbana-Champaign Urbana-Champaign IL USA

While multistage switching networks for vector multiprocessors have been studied extensively, detailed evaluations of their performance are rare. Indeed, analytical models, simulations with pseudosynthetic loads, studies focused on average-value parameters, and measurements of networks disconnected from the machine, all provide limited information. In this paper, instead, we present an in-depth empirical analysis of a multistage switching network in a realistic selling: We use hardware probes to examine the performance of the omega network of the Cedar shared-memory machine executing real applications. The machine is configured with 16 vector processors. The analysis suggests that the performance of multistage switching networks is limited by traffic nonuniformities. We identify two major nonuniformities that degrade Cedar's performance and are likely to slow down other networks too. The first one is the contention caused by the return messages in a vector access as they converge from the memories to one processor port. This traffic convergence penalizes vector reads and, more importantly, causes tree saturation. The second nonuniformity is the uneven contention delays induced by a relatively fair scheme to resolve message collisions. Based on our observations, we argue that intuitive optimizations for multistage switching networks may not be the most cost-effective ones. Instead, we suggest changes to increase the network bandwidth at the root of the traffic convergence tree and to delay traffic convergence up until the final stages of the network.

关键词： multistage switching networks vector multiprocessors performance evaluation experimental analysis address tracing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：