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

arXiv 2025年

作者： Prayoonyong, Chawaphon Szydzik, Crispin Ren, Guanghui Corcoran, Bill Dubey, Aditya Murray, Caitlin E. Mitchell, Toby Mitchell, Arnan Photonic Communications Laboratory Dept. Electrical and Computer Systems Engineering Monash University ClaytonVIC Australia MelbourneVIC Australia

We propose an alternative way to determine GaAs carrier lifetime using pump-probe measurement based on fibre optics and integrated waveguides. We find that our GaAs samples have the lifetime ranging from 30-80 ps, supporting the bandwidth ≥ 12.5 GHz. The platform utilised in this work could offer a cost-effective way to investigate photocarrier lifetime. Moreover, it may have the potential for high-speed switches and detectors, or could be exploited for possible all-optical modulation. © 2025, CC BY-NC-ND.

关键词： Gallium arsenide

来源：评论

学校读者我要写书评

暂无评论

Iterative Motion Planning in Multi-agent systems with Opportunistic Communication under Disturbance

arXiv

引用

arXiv 2025年

作者： Thelasingha, Neelanga Julius, Agung Humann, James Dotterweich, James Dept. of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute NY United States James Humann and James Dotterweich are with DEVCOM Army Research Laboratory MD United States

— In complex multi-agent systems involving heterogeneous teams, uncertainty arises from numerous sources like environmental disturbances, model inaccuracies, and changing tasks. This causes planned trajectories to become infeasible, requiring replanning. Further, different communication architectures used in multi-agent systems give rise to asymmetric knowledge of planned trajectories across the agents. In such systems, replanning must be done in a communication-aware fashion. This paper establishes the conditions for synchronization and feasibility in epistemic planning scenarios introduced by opportunistic communication architectures. We also establish conditions on task satisfaction based on quantified recoverability of disturbances in an iterative planning scheme. We further validate these theoretical results experimentally in a UAV–UGV task assignment problem. © 2025, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LEARNING EFFICIENT POSITIONAL ENCODINGS WITH GRAPH NEURAL NETWORKS

arXiv

引用

arXiv 2025年

作者： Kanatsoulis, Charilaos I. Choi, Evelyn Jegelka, Stephanie Leskovec, Jure Ribeiro, Alejandro Dept. of Computer Science Stanford University United States School of Computation Information and Technology Technical University of Munich Computer Science & Artificial Intelligence Laboratory Massachusetts Institute of Technology United States Dept. of Electrical and Systems Engineering University of Pennsylvania United States

Positional encodings (PEs) are essential for effective graph representation learning because they provide position awareness in inherently position-agnostic transformer architectures and increase the expressive capacity of Graph Neural Networks (GNNs). However, designing powerful and efficient PEs for graphs poses significant challenges due to the absence of canonical node ordering and the scale of the graph. In this work, we identify four key properties that graph PEs should satisfy: stability, expressive power, scalability, and genericness. We find that existing eigenvector-based PE methods often fall short of jointly satisfying these criteria. To address this gap, we introduce PEARL, a novel framework of learnable PEs for graphs. Our primary insight is that message-passing GNNs function as nonlinear mappings of eigenvectors, enabling the design of GNN architectures for generating powerful and efficient PEs. A crucial challenge lies in initializing node attributes in a manner that is both expressive and permutation equivariant. We tackle this by initializing GNNs with random node inputs or standard basis vectors, thereby unlocking the expressive power of message-passing operations, while employing statistical pooling functions to maintain permutation equivariance. Our analysis demonstrates that PEARL approximates equivariant functions of eigenvectors with linear complexity, while rigorously establishing its stability and high expressive power. Experimental evaluations show that PEARL outperforms lightweight versions of eigenvector-based PEs and achieves comparable performance to full eigenvector-based PEs, but with one or two orders of magnitude lower complexity. Our code is available at https://***/ehejin/Pearl-PE. Copyright © 2025, The Authors. All rights reserved.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Lightweight Task-Oriented Semantic Communication Empowered by Large-Scale AI Models

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Liu, Chuanhong Guo, Caili Yang, Yang Chen, Mingzhe Quek, Tony Q. S. Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing100876 China Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing100876 China University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL United States Singapore University of Technology and Design Dept. of Information Systems Technology and Design 487372 Singapore

Recent studies have focused on leveraging large-scale artificial intelligence (LAI) models to improve semantic representation and compression capabilities. However, the substantial computational demands of LAI models pose significant challenges for real-time communication scenarios. To address this, this paper proposes utilizing knowledge distillation (KD) techniques to extract and condense knowledge from LAI models, effectively reducing model complexity and computation latency. Nevertheless, the inherent complexity of LAI models leads to prolonged inference times during distillation, while their lack of channel awareness compromises the distillation performance. These limitations make standard KD methods unsuitable for task-oriented semantic communication scenarios. To address these issues, we propose a fast distillation method featuring a pre-stored compression mechanism that eliminates the need for repetitive inference, significantly improving efficiency. Furthermore, a channel adaptive module is incorporated to dynamically adjust the transmitted semantic information based on varying channel conditions, enhancing communication reliability and adaptability. In addition, an information bottleneck-based loss function is derived to guide the fast distillation process. Simulation results verify that the proposed scheme outperform baselines in term of task accuracy, model size, computation latency, and training data requirements. © 1967-2012 IEEE.

关键词： NP-hard

来源：评论

学校读者我要写书评

暂无评论

A FRAMEWORK FOR SOURCE CODE SEARCH USING PROGRAM PATTERNS

引用

IEEE TRANSACTIONS ON SOFTWARE engineering 1994年第6期20卷 463-475页

作者： PAUL, S PRAKASH, A Software Systems Research Laboratory Dept. of Electrical Engineering & Computer Science University of Michigan Ann Arbor MI 48105 USA

For maintainers involved in understanding and reengineering large software. locating source code fragments that match certain patterns is a critical task. Existing solutions to the problem are few, and they either involve manual, painstaking scans of the source code using tools based on regular expressions, or the use of large, integrated software engineering environments that include simple pattern-based query processors in their tool-kits. We present a framework in which pattern languages are used to specify interesting code features. The pattern languages are derived by extending the source programming language with pattern-matching symbols. We describe SCRUPLE, a finite state machine-based source code search tool, that efficiently implements this framework. We also present experimental performance results obtained from a SCRUPLE prototype, and the user interface of a source code browser built on top of SCRUPLE.

关键词： REVERSE engineering SOFTWARE MAINTENANCE SOFTWARE REengineering PROGRAM UNDERSTANDING PATTERN MATCHING QUERY LANGUAGE

来源：评论

学校读者我要写书评

暂无评论

Intentional dropping: A novel scheme for SYN flooding mitigation

Intentional dropping: A novel scheme for SYN flooding mitiga...

引用

INFOCOM 2006: 25th IEEE International Conference on computer Communications

作者： Al-Duwairi, Basheer Manimaran, G. Dependable Computing and Networking Laboratory Dept. of Electrical and Computer Engineering Iowa State University Ames IA 50011

ISBN: (纸本)1424402212

This paper presents a novel scheme to mitigate the effect of SYN flooding attacks. The scheme, called intentional dropping based filtering, is based on the observation of client's persistence (i.e., client's reaction to packet loss by subsequent retransmissions) which is very widespread as it is built in TCP's connection setup. The main idea is to intentionally drop the first SYN packet of each connection request. Subsequent SYN packet from a request is passed only if it adheres to the TCP's timeout mechanism. Our analysis shows that the proposed scheme reduces attacker's effective attack rate significantly with an acceptable increase in connection establishment latency. ©2005 IEEE.

关键词： Packet loss

来源：评论

学校读者我要写书评

暂无评论

Sustained petaflop and beyond: Can parallel computing systems meet the challenges?

Sustained petaflop and beyond: Can parallel computing system...

引用

19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

作者： Gao, Guang R. Computer Architecture and Parallel System Laboratory Dept. of Electrical and Computer Engineering University of Delaware Department of Electrical and Computer Engineering University of Delaware

ISBN: (纸本)0769523129

Breakthrough-quality scientific discoveries in the new millennium (such as those expected in computation biology and others), along with optimal engineering designs, have created a demand for High-End Computing (HEC) systems with sustained performance requirements at a petaflop scale and beyond. Despite the very pessimistic (if not negative) views on parallel computing systems that have prevailed in 1990s, there seems to be no other viable alternatives for such HEC systems. In this talk, we present a fresh look at the problems facing the design of petascale parallel computing systems. We review several fundamental issues that such HEC parallel computing systems must resolve. These issues include: execution models that support dynamic and adaptive multithreading, fine-grain synchronization, and global name-space and memory consistency. Related issues in parallel programming, dynamic compilation models, and system software design will also be discussed. Present solutions and future direction will be discussed based on (1) application demand (e.g. computation biology and others), (2) the recent trend as demonstrated by the HTMT, HPCS, and the Blue-Gene Cyclops (e.g. Cyclops-64) architectures, and (3) a historical perspective on influential models such as dataflow, along with concepts learned from these models.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

ROBOT_S: An interactive robot simulation language

引用

Robotics and Autonomous systems 1988年第3期4卷 245-256页

作者： O'Neill, S.R. Jamshidi, M. CAD Laboratory for Systems and Robotics Dept. of Electrical and Computer Engineering University of New Mexico AlbuquerqueNew Mexico87131 United States

While it may not be practical to realize a tentative robot design as an actual robot, there is no question of the practicality of a simulation, ROBOT_S is a program in which the foundation for a comprehensive simulation environment is laid. A graphical robot is created to which physical attributes may be assigned, and whose movement may be dictated by a user-installed dynamic model and control law. A simple robot command language has been developed, by which the manipulator may be commanded to move, during which simulation data of state variables is collected and graphed. © 1988

关键词： computer simulation languages

来源：评论

学校读者我要写书评

暂无评论

Leveraging processor performance counters for security and performance 5

Leveraging processor performance counters for security and p...

引用

5th International Workshop on Trustworthy Embedded Devices, TrustED 2015

作者： Szefer, Jakub Computer Architecture and Security Laboratory Dept. of Electrical Engineering Yale University United States

ISBN: (纸本)9781450338288

Modern processors come equipped with hundreds of hardware performance counters, which count variety of events in the processor, anything from floating point operations retired to cache misses. In recent years researchers have begun to use these performance counters to characterize and detect malicious software. In parallel, researchers have also explored using the performance counter data for performance and energy usage optimizations. Prior research has done quite well at detecting malware, but most of the efforts have not explored proactive schemes where the system is actually able to react to the potentially suspicious behavior in real time. Also, security and performance work has been done separately. In this talk we introduce our recent research project dealing with leveraging processor performance counters to characterize program behavior, predict upcoming program phases, and schedule applications based on the predicted behavior in order to improve both security and performance. The project leverages machine learning and resulting prototype runs in real-time on commodity hardware in a modified Linux scheduler. This is joint work with Junaid Nomani.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

A new fault-tolerant technique for improving schedulability in multiprocessor real-time systems 15

A new fault-tolerant technique for improving schedulability ...

引用

15th International Parallel and Distributed Processing Symposium, IPDPS 2001

作者： Al-Omari, R. Somani, A.K. Manimaran, G. Dependable Computing and Networking Laboratory Dept. of Electrical and Computer Engineering Iowa State University AmesIA50011 United States

ISBN: (纸本)0769509908

In real-time systems, tasks have deadlines to be met despite the presence of faults. Primary-Backup (PB) scheme is one of the most common schemes that has been employed for fault-tolerant scheduling of real-time tasks, wherein each task has two versions and the versions are scheduled on two different processors with time exclusion. There have been techniques proposed for improving schedulability of the PB-based scheduling. One of the more popular ones include Backup-Backup (BB) overloading, wherein two or more backups can share/overlap in time on a processor. In this paper we propose a new schedulability enhancing technique, called primary-backup (PB) overloading, in which the primary of a task can share/overlap in time with the backup of another task an a processor. The intuition is that, for both primary and backup of a task, the PB-overloading can assign an earlier start time than that of the BB-overloading, thereby increasing the schedulability. We conduct schedulability and reliability analysis of PB- and BB-overloading techniques through simulation and analytical studies. Our studies show that PB-overloading offers better schedulability (25% increase in the guarantee ratio) than that of BB-overloading, and offers reliability comparable to that of BB-overloading. The proposed PB-overloading is a general technique that can be employed in any static or dynamic fault-tolerant scheduling algorithm. © 2001 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：