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

ANALYTIC MODELS OF ADAPTIVE LOAD SHARING SCHEMES IN DISTRIBUTED real-time SYSTEMS

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1993年第7期4卷 740-761页

作者： SHIN, KG HOU, CJ Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

In a distributed real-time system, nonuniform task arrivals may temporarily overload some nodes while leaving some other nodes idle. As a result, some of the tasks on an overloaded node may miss their deadlines even if the overall system has the capacity to meet the deadlines of all tasks. In a companion paper [1], we proposed, without any modeling analysis, a decentralized, dynamic load sharing (LS) scheme as a solution to this problem. In this paper, we develop analytic queueing models to comparatively evaluate the proposed LS scheme as well as three other schemes: no LS, LS with random selection of a receiver node, and LS with perfect information. The evolution of a node's load state is modeled as a continuous-time semi-Markov process, where cumulative execution time (CET), rather than the commonly-used queue length (QL), is employed to describe the workload of a node. Not only fundamental differences among the different LS schemes are addressed in the analytic models, but also implementation overheads are taken into account Several metrics relevant to real-time performance are derived from these models: in particular, we evaluate the probability of a task missing its deadline, called the probability of dynamic failure. The proposed scheme is compared against other LS schemes using these performance metrics. The validity of analytic models is checked with simulations. Both analytic and simulation results indicate that by using judicious exchange/use of state information and Bayesian decision mechanism, the proposed scheme makes a significant improvement over other existing LS schemes in minimizing the probability of dynamic failure.

关键词： BAYESIAN ANALYSIS CONTINUOUS-time MARKOV CHAINS DEADLINES DISTRIBUTED real-time SYSTEMS LOAD SHARING LOCATION AND TRANSFER POLICIES PERFORMANCE EVALUATION RANDOM PROBING AND SELECTION

来源：评论

学校读者我要写书评

暂无评论

DERIVATION AND APPLICATION OF HARD DEADLINES FOR real-time CONTROL-SYSTEMS

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1992年第6期22卷 1403-1413页

作者： SHIN, KG KIM, HB Real Time Computing Laboratory the Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The computation-time delay in the feedback controller of a real-time control system may cause failure to update the control input during one or more sampling periods. If this delay exceeds a certain limit called a hard deadline, either the necessary conditions for system stability are violated or the system leaves the allowed state-space. In such a case a dynamic failure is said to occur to the system. A method for calculating the hard deadlines in linear time-invariant control systems by considering system stability and the allowed state-space is presented. To derive necessary conditions for (asymptotic) system stability, the state difference equation is modified based on an assumed maximum delay and the probability distribution of delays whose magnitudes are less than, or equal to, the assumed maximum delay. Moreover, the allowed state-space-which is derived from given input and state constraints-is used to calculate the hard deadline as a function of time and the system state. A one-shot delay model in which a single event causes a dynamic failure is also considered. The knowledge of hard deadline is then applied to the design of error recovery in a triple modular redundant (TMR) controller computer.

关键词： real time systems Control systems Delay effects Stability Feedback Sampling methods Difference equations computer errors Error correction Process control

来源：评论

学校读者我要写书评

暂无评论

FAULT-TOLERANT ROUTING IN MESH ARCHITECTURES

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1994年第11期5卷 1225-1232页

作者： OLSON, A SHIN, KG Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science Computer Science and Engineering Division University of Michigan Ann Arbor MI USA

It is important for a distributed computing system to be able to route messages around whatever faulty links or nodes may be present. We present a fault-tolerant routing algorithm that assures the delivery of every message as long as there is a path between its source and destination;The algorithm works on many common mesh architectures such as the torus and hexagonal mesh. The proposed scheme can also detect the nonexistence bf path between a pair of nodes in a finite amount of time. Moreover, the scheme requires each node in the system to know only the state (faulty or not) of each of its own links. The performance of the routing scheme is simulated for both square and hexagonal meshes while varying the physical distribution of faulty components. It is shown that a shortest path between the source and destination of each message is taken with a high probability, and, if a path exists, it is usually found very quickly.

关键词： HEXAGONAL MESH DISTRIBUTED SYSTEMS ROUTING FAULTY LINKS CYCLES INCISIONS

来源：评论

学校读者我要写书评

暂无评论

Exoplanet Detection via Differentiable Rendering

arXiv

引用

arXiv 2025年

作者： Feng, Brandon Y. Ferrer-Chávez, Rodrigo Levis, Aviad Wang, Jason J. Bouman, Katherine L. Freeman, William T. The Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology United States The Department of Physics & Astronomy Northwestern University United States The Department of Computer Science The University of Toronto Canada The Departments of Computing and Mathematical Sciences Electrical Engineering and Astronomy California Institute of Technology United States

Direct imaging of exoplanets is crucial for advancing our understanding of planetary systems beyond our solar system, but it faces significant challenges due to the high contrast between host stars and their planets. Wavefront aberrations introduce speckles in the telescope science images, which are patterns of diffracted starlight that can mimic the appearance of planets, complicating the detection of faint exoplanet signals. Traditional post-processing methods, operating primarily in the image intensity domain, do not integrate wavefront sensing data. These data, measured mainly for adaptive optics corrections, have been overlooked as a potential resource for post-processing, partly due to the challenge of the evolving nature of wavefront aberrations. In this paper, we present a differentiable rendering approach that leverages these wavefront sensing data to improve exoplanet detection. Our differentiable renderer models wave-based light propagation through a coronagraphic telescope system, allowing gradient-based optimization to significantly improve starlight subtraction and increase sensitivity to faint exoplanets. Simulation experiments based on the James Webb Space Telescope configuration demonstrate the effectiveness of our approach, achieving substantial improvements in contrast and planet detection limits. Our results showcase how the computational advancements enabled by differentiable rendering can revitalize previously underexploited wavefront data, opening new avenues for enhancing exoplanet imaging and characterization. © 2025, CC BY.

关键词： Adaptive optics

来源：评论

学校读者我要写书评

暂无评论

HetEC: Architectures for Heterogeneous Quantum Error Correction Codes 25

HetEC: Architectures for Heterogeneous Quantum Error Correct...

引用

30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2025

作者： Stein, Samuel Xu, Shifan Cross, Andrew W. Yoder, Theodore J. Javadi-Abhari, Ali Liu, Chenxu Liu, Kun Zhou, Zeyuan Guinn, Charlie Ding, Yufei Ding, Yongshan Li, Ang Future Computing Technologies Pacific Northwest National Laboratory RichlandWA United States Departments of Applied Physics Yale Quantum Institute Yale University New HavenCT United States Ibm Quantum Ibm T.J Watson Research Center Yorktown HeightsNY United States Department of Physics Princeton University PrincetonNJ United States Department of Computer Science and Engineering University of California San Diego San DiegoCA United States Departments of Applied Physics Yale Quantum Institute Department of Computer Science Yale University New HavenCT United States Department of Electrical and Computer Engineering University of Washington SeattleWA United States

ISBN: (纸本)9798400710797

Quantum Error Correction (QEC) is essential for future quantum computers due to its ability to exponentially suppress physical errors. The surface code is a leading error-correcting code candidate because of its local topological structure, experimentally achievable thresholds, and support for universal gate operations with magic states. However, its physical overhead scales quadratically with number of correctable errors. Conversely, quantum low-density parity-check (qLDPC) codes offer superior scaling but lack, on their own, a clear path to universal logical computation. Therefore, it is becoming increasingly evident that there are significant advantages to designing architectures using multiple codes. Heterogeneous architectures provide a clear path to universal logical computation as well as the ability to access different resource trade offs. To address this, we propose integrating the surface code and gross code using an ancilla bus for inter-code data movement. This approach involves managing trade-offs, including qubit overhead, a constrained instruction set, and gross code (memory) routing and management. While our focus is on the gross-surface code architecture, our method is adaptable to any code combination and the constraints generated by that specific architecture. Motivated by the potential reduction of physical qubit overhead, an important feature in the realization of fault-tolerant computation, we perform the first full system study of heterogeneous error-correcting codes, discovering architectural trade-offs and optimizing around them. We demonstrate physical qubit reductions of up to 6.42x when executing an algorithm to a logical error rate, at the cost of up to a 3.43x increase in algorithm time. © 2025 ACM.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

A Survey of Integrating Generative Artificial Intelligence and 6G Mobile Services: Architectures, Solutions, Technologies and Outlooks

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Liu, Yi-Jing Du, Hongyang Xu, Xinyi Zhang, Ruichen Feng, Gang Cao, Bin Niyato, Dusit Kim, Dong In Jamalipour, Abbas Letaief, Khaled B. Tafazolli, Rahim University of Electronic Science and Technology of China National Key Lab on Wireless Communications Chengdu China University of Hong Kong Department of Electrical and Electronic Engineering Pok Fu Lam Hong Kong Nanyang Technological University College of Computing and Data Science Singapore Singapore Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing China Sungkyunkwan University Department of Electrical and Computer Engineering Suwon Korea Republic of University of Sydney School of Electrical and Computer Engineering Sydney Australia Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Hong Kong Hong Kong University of Surrey Institute for Communication Systems School of Computer Science and Electronic Engineering United Kingdom

Generative artificial intelligence (GenAI) is rapidly driving a new phase of artificial intelligence revolution, marked by various applications such as ChatGPT, Sora and DeepSeek. With powerful capabilities in content generation, personalization and user interaction, GenAI can drive significant enhancements in various mobile services to satisfy individual user preferences. Meanwhile, mobile services offer substantial support for accessibility, functionality and intelligence of GenAI applications. However, current research on integrating GenAI and mobile services remains nascent, lacking necessary theoretical and technical support. In this survey, we break down a new vision to guide research on integrating GenAI and mobile services, aiming to improve 6G intelligence levels and enable 6G mobile networks to support the integration of GenAI and mobile services effectively. We begin by examining the necessity of integrating GenAI with 6G mobile services and exploring potential learning architectures of GenAI models within mobile networks. Next, we analyze potential solutions from two perspectives: how 6G mobile networks empower GenAI and how GenAI enables mobile services. We subsequently explore a promising use case, along with essential features and techniques, to facilitate the integration of GenAI and mobile services. Finally, we discuss future research directions, aiming at realizing intelligent 6G networks. © 2015 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

PAC-MC: An Efficient Password-Based Access Control Framework for time Sequence Aware Media Cloud

引用

IEEE Transactions on Mobile computing 2025年

作者： Wang, Haiyan Liu, Penghui Zhong, Xiaoxiong Luo, Fucai Xiao, Bin Yang, Yuanyuan Peng Cheng Laboratory Department of New Networks Shenzhen518000 China Zhejiang Gongshang University School of Computer Science and Technology Hangzhou China Hong Kong Polytechnic University Department of Computing Hong Kong Stony Brook University Department of Electrical and Computer Engineering Stony BrookNY11794 United States

Cloud storage makes it easier for users to access and share data remotely, but it often requires integration with cryptographic technologies to address consumer-oriented applications, such as fine-grained data access, secure data sharing and retrieval. This paper focuses on the fine-grained access problem of media applications based on time sequence, that is, certain critical media applications based on time sequences should ideally be accessible only to authorized clients. The traditional keyword-based searchable encryption (SE) allows effective search and access over encrypted data while preserving data privacy, but most existing solutions do not support temporal access control (i.e., a mechanism that grants access permissions to users within a specified time range). In this paper, we propose PAC-MC, an efficient password-based access control framework for media cloud relying on content control with the time sequence attribute. PAC-MC not only supports multi-keyword search using any monotonic boolean formulas but also allows media owners to control content-encryption keys for different time periods with an updatable password. Furthermore, it supports the self-retrieval of content-encryption keys. In addition, PAC-MC is provably secure under the standard model. Finally, the detailed performance evaluation results and experimental comparisons indicate that PAC-MC is very efficient and outperforms the previous solutions in terms of computation, communication, and storage costs. © 2025 IEEE.

关键词： Access control content protection media cloud password searchable encryption time sequence

来源：评论

学校读者我要写书评

暂无评论

Towards Intelligent Transportation with Pedestrians and Vehicles In-the-Loop: A Surveillance Video-Assisted Federated Digital Twin Framework

arXiv

引用

arXiv 2025年

作者： Li, Xiaolong Wei, Jianhao Wang, Haidong Dong, Li Chen, Ruoyang Yi, Changyan Cai, Jun Niyato, Dusit Shen, Xuemin The Xiangjiang Laboratory Hunan Provincial General University Key Laboratory of IoT Intelligent Sensing and Distributed Collaborative Optimization Hunan University of Technology and Business Changsha410205 China The College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics China The Department of Electrical and Computer Engineering University of Concordia Montreal Canada The College of Computing and Data Science Nanyang Technological University Singapore The Department of Electrical and Computer Engineering University of Waterloo Canada

In intelligent transportation systems (ITSs), incorporating pedestrians and vehicles in-the-loop is crucial for developing realistic and safe traffic management solutions. However, there is falls short of simulating complex real-world ITS scenarios, primarily due to the lack of a digital twin implementation framework for characterizing interactions between pedestrians and vehicles at different locations in different traffic environments. In this article, we propose a surveillance video assisted federated digital twin (SV-FDT) framework to empower ITSs with pedestrians and vehicles in-the-loop. Specifically, SVFDT builds comprehensive pedestrian-vehicle interaction models by leveraging multi-source traffic surveillance videos. Its architecture consists of three layers: (i) the end layer, which collects traffic surveillance videos from multiple sources;(ii) the edge layer, responsible for semantic segmentation-based visual understanding, twin agent-based interaction modeling, and local digital twin system (LDTS) creation in local regions;and (iii) the cloud layer, which integrates LDTSs across different regions to construct a global DT model in realtime. We analyze key design requirements and challenges and present core guidelines for SVFDT’s system implementation. A testbed evaluation demonstrates its effectiveness in optimizing traffic management. Comparisons with traditional terminal-server frameworks highlight SV-FDT’s advantages in mirroring delays, recognition accuracy, and subjective evaluation. Finally, we identify some open challenges and discuss future research directions. Copyright © 2025, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

A 3D Memristive Cubic Map with Dual Discrete Memristors: Design, Implementation, and Application in Image Encryption

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Gao, Suo Iu, Herbert Ho-Ching Erkan, Ugur Simsek, Cemaleddin Toktas, Abdurrahim Cao, Yinghong Wu, Rui Mou, Jun Li, Qi Wang, Chunpeng Dalian Polytechnic University School of Information Science and Engineering Dalian116034 China The University of Western Australia School of Electrical Electronic and Computer Engineering Perth6009 Australia Faculty of Engineering Electrical and Electronics Engineering Respectively Karamanoglu Mehmetbey University Karaman70200 Turkey Ankara University Engineering Faculty Department of Artificial Intelligence and Data Engineering Ankara06830 Turkey Harbin Institute of Technology School of Computer Science and Technology Harbin150001 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan250000 China

Discrete chaotic systems based on memristors exhibit excellent dynamical properties and are more straightforward to implement in hardware, making them highly suitable for generating cryptographic keystreams. However, most existing memristor-based chaotic systems rely on a single memristor. This paper introduces a novel discrete chaotic system employing dual memristors, named the 3D memristive cubic map with dual discrete memristors (3D-MCM). The 3D-MCM system demonstrates richer and more intricate dynamical behaviors compared to its single-memristor counterparts, as verified through bifurcation diagrams, Lyapunov exponent spectra, and complexity analyses. Notably, the system exhibits coexisting attractors, substantially enhancing its dynamical complexity. Hardware implementation of the 3D-MCM attractors confirms its feasibility for industrial applications. To illustrate the system's potential in encryption tasks, this study integrates the quaternary-based permutation and dynamic emanating diffusion (QPDED-IE) scheme for image encryption with the *** results demonstrate that the QPDED-IE scheme based on the 3D-MCM exhibits strong diffusion and confusion properties, effectively resisting cryptanalytic attacks. © 1991-2012 IEEE.

关键词： Bifurcation (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Oblivtime: Oblivious and Efficient Interval Skyline Query Processing Over Encrypted time-Series Data

引用

IEEE Transactions on Services computing 2025年

作者： Ouyang, Huajie Zheng, Yifeng Wang, Songlei Hua, Zhongyun Harbin Institute of Technology School of Computer Science and Technology Guangdong Shenzhen518055 China The Hong Kong Polytechnic University Department of Electrical and Electronic Engineering Hong Kong Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518055 China

time-series data is prevalent in many applications like smart homes, smart grids, and healthcare. And it is now increasingly common to store and query time-series data in the cloud. Despite the benefits, data privacy concerns in such outsourced services are pressing, making it imperative to embed privacy assurance mechanisms from the outset. Most existing related works have been focused on querying for different types of aggregate statistics. In this paper, we instead focus on the secure support for advanced interval skyline queries, which allow to identify time series that are not dominated by any other time series within a query time interval. This is valuable for time-series data analytics in applications like remote health monitoring (e.g., identifying patients with high heart rates in a certain week). We present Oblivtime, a new system framework for oblivious and efficient interval skyline query processing over encrypted time-series data. Oblivtime is built from a synergy of time-series data analytics, lightweight cryptography, and GPU parallel computing, achieving stronger security guarantees and lower online query latency over the state-of-the-art prior work. Extensive experiments demonstrate that Oblivtime can achieve up to 666\times speedup in online query latency over the state-of-the-art prior work. © 2008-2012 IEEE.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：