检索结果-南通市图书馆

CSEE Journal of Power and Energy Systems 2024年第2期10卷 797-806页

作者： Edeh Vincent Mehdi Korki Mehdi Seyedmahmoudian Alex Stojcevski Saad Mekhilef school of {1. Computingand Engineering TechnologiesSwinburne University of TechnologyMelbourneAustralia

The massive integration of communication and information technology with the large-scale power grid has enhanced the efficiency, safety, and economical operation of cyber-physical systems. However, the open and diversified communication environment of the smart grid is exposed to cyber-attacks. Data integrity attacks that can bypass conventional security techniques have been considered critical threats to the operation of the grid. Current detection techniques cannot learn the dynamic and heterogeneous characteristics of the smart grid and are unable to deal with non-euclidean data types. To address the issue, we propose a novel Deep-Q-Network scheme empowered with a graph convolutional network (GCN) framework to detect data integrity attacks in cyber-physical systems. The simulation results show that the proposed framework is scalable and achieves higher detection accuracy, unlike other benchmark techniques.

关键词： Deep reinforcement learning graph convolutional network heterogeneous smart grid network

Minimal Context-Switching Data Race Detection with Dataflow Tracking

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer science & {1. 2024年第1期39卷 211-226页

作者：郑龙李洋辛杰刘海峰郑然廖小飞金海 National Engineering Research Center for Big Data technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services computing {1. and System Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Cluster and Grid computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Data race is one of the most important concurrent anomalies in multi-threaded *** con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by any oth-er sound race ***,this constraint-based approach has serious limitations on helping programmers analyze and understand data ***,it may report a large number of false positives due to the unrecognized dataflow propa-gation of the ***,it recommends a wide range of thread context switches to schedule the reported race(in-cluding the false one)whenever this race is exposed during the constraint-solving *** ad hoc recommendation imposes too many context switches,which complicates the data race *** address these two limitations in the state-of-the-art constraint-based race detection,this paper proposes DFTracker,an improved constraint-based race detec-tor to recommend each data race with minimal thread context ***,we reduce the false positives by ana-lyzing and tracking the dataflow in the *** this means,DFTracker thus reduces the unnecessary analysis of false race *** further propose a novel algorithm to recommend an effective race schedule with minimal thread con-text switches for each data *** experimental results on the real applications demonstrate that 1.without removing any true data race,DFTracker effectively prunes false positives by 68%in comparison with the state-of-the-art constraint-based race detector;2)DFTracker recommends as low as 2.6-8.3(4.7 on average)thread context switches per data race in the real world,which is 81.6%fewer context switches per data race than the state-of-the-art constraint based race ***,DFTracker can be used as an effective tool to understand the data race for programmers.

关键词： data race satisfiability modulo theory multi-threaded program dynamic detection

Accumulated-state-error-based event-triggered sampling scheme and its application to H∞ control of sampled-data systems

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

science China(Information sciences) 2024年第6期67卷 328-341页

作者： Xian-Ming ZHANG Qing-Long HAN Bao-Lin ZHANG Xiaohua GE Dawei ZHANG school of {1. Computingand Engineering TechnologiesSwinburne University of Technology College of Automation and Electronic Engineering Qingdao University of Science & Technology school of Mathematics Shandong University

This paper is concerned with event-triggered H∞control of sampled-data systems. Its novelties lie in three aspects:（i） A novel accumulated-state-error-based event-triggered scheme is introduced by comparing the integral of the state error from tk to t with the system state sampled at tk. This condition works well due to the fact that the so-called Zeno behaviour does not occur.（ii） A novel Lyapunov functional is constructed to establish a criterion to ensure some certain H∞performance of the closed-loop system. This Lyapunov functional is dependent on the integral of the state error involved in the event-triggered scheme.（iii） Under the event-triggered sampling scheme, suitable state-feedback controllers can be designed rather than be given a priori. Moreover, a self-triggered implementation of the proposed event-triggered sampling scheme is presented as well. Finally, a batch reactor model and an inverted pendulum system are given to demonstrate the effectiveness of the proposed method.

关键词： event-triggered sampling self-triggered implementation H ∞ control looped-functional

Towards High-Performance Graph Processing: From a Hardware/Software Co-Design Perspective

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer science & {1. 2024年第2期39卷 245-266页

作者：廖小飞赵文举金海姚鹏程黄禹王庆刚赵进郑龙张宇邵志远 National Engineering Research Center for Big Data technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services computing {1. and System Laboratory School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Zhejiang Lab Hangzhou 311121China

Graph processing has been widely used in many scenarios,from scientific computing to artificial *** processing exhibits irregular computational parallelism and random memory accesses,unlike traditional ***,running graph processing workloads on conventional architectures(e.g.,CPUs and GPUs)often shows a significantly low compute-memory ratio with few performance benefits,which can be,in many cases,even slower than a specialized single-thread graph *** domain-specific hardware designs are essential for graph processing,it is still challenging to transform the hardware capability to performance boost without coupled software *** article presents a graph processing ecosystem from hardware to *** start by introducing a series of hardware accelerators as the foundation of this ***,the codesigned parallel graph systems and their distributed techniques are presented to support graph ***,we introduce our efforts on novel graph applications and hardware *** results show that various graph applications can be efficiently accelerated in this graph processing ecosystem.

关键词： graph processing hardware accelerator software system high performance ecosystem

Precise control of page cache for containers

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer science 2024年第2期18卷 17-30页

作者： Kun WANG Song WU Shengbang LI Zhuo HUANG Hao FAN Chen YU Hai JIN National Engineering Research Center for Big Data technology and System Services Computing Technology and System LabCluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Container-based virtualization isbecoming increasingly popular in cloud computing due to its efficiency and *** isolation is a fundamental property of *** works have indicated weak resource isolation could cause significant performance degradation for containerized applications and enhanced resource ***,current studies have almost not discussed the isolation problems of page cache which is a key resource for *** leverage memory cgroup to control page cache ***,existing policy introduces two major problems in a container-based ***,containers can utilize more memory than limited by their cgroup,effectively breaking memory ***,the Os kernel has to evict page cache to make space for newly-arrived memory requests,slowing down containerized *** paper performs an empirical study of these problems and demonstrates the performance impacts on containerized *** we propose pCache(precise control of page cache)to address the problems by dividing page cache into private and shared and controlling both kinds of page cache separately and *** do so,pCache leverages two new technologies:fair account(f-account)and evict on demand(EoD).F-account splits the shared page cache charging based on per-container share to prevent containers from using memory for free,enhancing memory *** EoD reduces unnecessary page cache evictions to avoid the performance *** evaluation results demonstrate that our system can effectively enhance memory isolation for containers and achieve substantial performance improvement over the original page cache management policy.

关键词： page cache memory cgroup container isolation cloud computing

Answering reachability queries with ordered label constraints over labeled graphs

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer science 2024年第1期18卷 105-117页

作者： Daoliang HE Pingpeng YUAN Hai JIN National Engineering Research Center for Big Data technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science&TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Reachability query plays a vital role in many graph analysis *** researches proposed many methods to efficiently answer reachability queries between vertex *** many real graphs are labeled graph,it highly demands Label-Constrained Reachability(LCR)query inwhich constraint includes a set of labels besides vertex *** researches proposed several methods for answering some LCR queries which require appearance of some labels specified in constraints in the *** that constraint may be a label set,query constraint may be ordered labels,namely OLCR(Ordered-Label-Constrained Reachability)queries which retrieve paths matching a sequence of ***,no solutions are available for ***,we propose DHL,a novel bloom filter based indexing technique for answering OLCR *** can be used to check reachability between vertex *** the answers are not no,then constrained DFS is ***,we employ DHL followed by performing constrained DFS to answer OLCR *** show that DHL has a bounded false positive rate,and it's powerful in saving indexing time and *** experiments on 1. real-life graphs and 1. synthetic graphs demonstrate that DHL achieves about 4.8-22.5 times smaller index space and 4.6-1.4 times less index construction time than two state-of-art techniques for LCR queries,while achieving comparable query response *** results also show that our algorithm can answer OLCR queries effectively.

关键词： graph ordered-label-constrained reachability partial index bloom filter query processing

CCM-FL:Covert communication mechanisms for federated learning in crowd sensing IoT

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Digital Communications and Networks 2024年第3期10卷 597-608页

作者： Hongruo Zhang Yifei Zou Haofei Yin Dongxiao Yu Xiuzhen Cheng Institute of Intelligent computing School of Computer Science and TechnologyShandong UniversityQingdao266237China

The past decades have witnessed a wide application of federated learning in crowd sensing,to handle the numerous data collected by the sensors and provide the users with precise and customized ***,how to protect the private information of users in federated learning has become an important research *** with the differential privacy(DP)technique and secure multiparty computation(SMC)strategy,the covert communication mechanism in federated learning is more efficient and energy-saving in training the ma-chine learning *** this paper,we study the covert communication problem for federated learning in crowd sensing Internet-of-Things *** from the previous works about covert communication in federated learning,most of which are considered in a centralized framework and experimental-based,we firstly proposes a centralized covert communication mechanism for federated learning among n learning agents,the time complexity of which is O(log n),approximating to the optimal ***,for the federated learning without parameter server,which is a harder case,we show that solving such a problem is NP-hard and prove the existence of a distributed covert communication mechanism with O(log logΔlog n)times,approximating to the optimal solution.Δis the maximum distance between any pair of learning *** analysis and nu-merical simulations are presented to show the performance of our covert communication *** hope that our covert communication work can shed some light on how to protect the privacy of federated learning in crowd sensing from the view of communications.

关键词： Covert communications Federated learning Crowd sensing SINR model

Communication Resource-Efficient Vehicle Platooning Control With Various Spacing Policies

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2024年第2期11卷 362-376页

作者： Xiaohua Ge Qing-Long Han Xian-Ming Zhang Derui Ding IEEE school of {1. Computing and Engineering TechnologiesSwinburne University of TechnologyMelbourne VIC 3122Australia

Platooning represents one of the key features that connected automated vehicles may possess as it allows multiple automated vehicles to be maneuvered cooperatively with small headways on roads. However, a critical challenge in accomplishing automated vehicle platoons is to deal with the effects of intermittent and sporadic vehicle-to-vehicle data transmissions caused by limited wireless communication resources. This paper addresses the co-design problem of dynamic event-triggered communication scheduling and cooperative adaptive cruise control for a convoy of automated vehicles with diverse spacing policies. The central aim is to achieve automated vehicle platooning under various gap references with desired platoon stability and spacing performance requirements, while simultaneously improving communication efficiency. Toward this aim, a dynamic event-triggered scheduling mechanism is developed such that the intervehicle data transmissions are scheduled dynamically and efficiently over time. Then, a tractable co-design criterion on the existence of both the admissible event-driven cooperative adaptive cruise control law and the desired scheduling mechanism is derived. Finally, comparative simulation results are presented to substantiate the effectiveness and merits of the obtained results.

关键词： Automated vehicles constant time headway spacing constant spacing cooperative adaptive cruise control event-triggered communication vehicle platooning

维普期刊数据库

On the Difference Between the Skew-rank of an Oriented Graph and the Rank of Its Underlying Graph

在线全文

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2024年第1期40卷 129-136页

作者： Jia-min Zhu Bo-jun Yuan Yi Wang school of {1. sciences Anhui UniversityHefei230601China school of {1. Zhejiang University of Science and TechnologyHangzhou310023China

Let G be a simple graph and G~σ be the oriented graph with G as its underlying graph and orientation σ.The rank of the adjacency matrix of G is called the rank of G and is denoted by r(G).The rank of the skew-adjacency matrix of G~σ is called the skew-rank of G~σ and is denoted by sr(G~σ).Let V(G)be the vertex set and E(G) be the edge set of *** cyclomatic number of G,denoted by c(G),is equal to |E(G)|-|V(G)|+ω(G),where ω(G) is the number of the components of *** is proved for any oriented graph G~σ that-2c(G)≤sr(G~σ)-r(G)≤2c(G).In this paper,we prove that there is no oriented graph G~σwith sr(G~σ)-r(G)=2c(G)-1.and in addition,there are infinitely many oriented graphs G~σ with connected underlying graphs such that c(G)=k and sr(G~σ)-r(G)=2c(G)-l for every integers k,l satisfying 0 ≤l≤4k and l≠1.

关键词： cyclomatic number rank skew-rank

维普期刊数据库

RGB oralscan video-based orthodontic treatment monitoring

在线全文

学校读者我要写书评

暂无评论

science China(Information sciences) 2024年第1期67卷 124-139页

作者： Yan TIAN Hanshi FU Hao WANG Yuqi LIU Zhaocheng XU Hong CHEN Jianyuan LI Ruili WANG school of Computer {1. and technology Zhejiang Gongshang University Shining3D Tech Co. Ltd. school of Information and {1. Monash University school of {1. and Computational sciences Massey University Department of Stomatology Zhejiang Provincial People's HospitalHangzhou Medical College school of Computer and {1. science Zhejiang University City College

Orthodontic treatment monitoring involves using current images and previous 3D models to estimate the relative position of individual teeth before and after orthodontic *** process differs from image-based object 6D pose estimation due to the gingiva deformation and varying pose offsets for each tooth during *** by the fact that the poses of molars remain relatively fixed in implicit orthodontics,we design an approach that employs multiview pose evaluation and bidirectional temporal propagation for jaw pose estimation and then employs an iteration-based method for tooth *** handle changes in tooth appearance or location with weak texture across frames,we also introduce an instance propagation module that leverages positional and semantic information to explore instance relations in the temporal *** evaluated the performance of our approach using both the Shining3D tooth pose dataset and the Aoralscan3 tooth registration *** experimental results demonstrate remarkable accuracy improvements compared with existing methods.

关键词： digital dentistry object 6D pose estimation deep learning computer vision