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

Adaptive loitering anomaly detection based on motion states

Multimedia Tools and Applications 2024年 1-25页

作者： Li, Hongjun Huang, Xiezhou School of Information Science and Technology Nantong University 9 Seyuan Road Jiangsu Province Nantong226019 China State Key Laboratory of Novel Software Technology Nanjing University Jiangsu Nanjing210023 China

In the field of video surveillance security in public places, loitering anomaly detection is a very critical part. Currently, the detection targets often face difficulties in loitering anomaly detection due to the complexity of the public scene, the density of pedestrians, or the varied motion states of the detection targets. This paper designs a self-adaptive loitering detection model based on motion states, and proposes a tracking method that combines local features with spatial information to enhance the correlation between adjacent frames of the same target. This model effectively reduce the impact of interleaving, occlusion, and out-of-frame situations that often occur in public places. In the detector part, a model combining frame-by-frame queue storage and self-adaptive loitering detection algorithm based on motion states is designed to solve the problem of frequent changes in motion states leading to the failure to detect loitering anomalies and to more accurately locate loitering abnormal frames. The loitering anomaly detection algorithm in this paper was tested on the IITB-Corridor dataset. Compared with the Learning regularity in skeleton trajectories (LRST) model the accuracy is improved by 4.7%, the recall is improved by 5.6%, and the precision is improved by 0.2%. The overall performance of loitering anomaly detection is improved. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Adaptive algorithms

来源：评论

学校读者我要写书评

暂无评论

Constraint-aware and multi-objective optimization for micro-service composition in mobile edge computing

Constraint-aware and multi-objective optimization for micro-...

引用

作者： Wu, Jintao Zhang, Jingyi Zhang, Yiwen Wen, Yiping School of Software Nanjing University of Information Science and Technology Nanjing China School of Computer Science and Technology Anhui University Anhui China Hunan Key Laboratory for Service Computing and Novel Software Technology Hunan University of Science and Technology Hunan China

As a new paradigm of distributed computing, mobile edge computing (MEC) has gained increasing attention due to its ability to expand the capabilities of centralized cloud computing. In MEC environments, a software application typically consists of multiple micro-services, which can be composed together in a flexible manner to achieve various user requests. However, the composition of micro-services in MEC is still a challenging research issue arising from three aspects. Firstly, composite micro-services constructed by ignoring the processing capabilities of different micro-services may cause waste of edge resources. Secondly, edge servers' limitations in terms of computational power can easily cause service occupancy between composite micro-services, severely affecting the user experience. Thirdly, in dynamic and unstable mobile environments, different edge users have different sensitivities to request latency, which increases the complexity of micro-service composition. In order to improve edge resource utilization and user experience on micro-service invocations, in this paper, we comprehensively consider the above three factors, and we first model the micro-services composition problem in MEC as a constrained multi-objective optimization problem. Then, a micro-service composition optimization method M3C combining graph search and branch-and-bound strategy is proposed to find a composition solution set with low energy consumption and high success rate for multiple edge users. Finally, we perform a series of experiments on two widely used datasets. Experimental results show that our proposed approach significantly outperforms the four competing baseline approaches, and that it is sufficiently efficient for practical deployment. © 2023 John Wiley & Sons Ltd.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

A sharding blockchain-based UAV system for search and rescue missions

引用

Frontiers of computer science 2025年第3期19卷 103-118页

作者： Xihan ZHANG Jiashuo ZHANG Jianbo GAO Libin XIA Zhi GUAN Hao HU Zhong CHEN School of Computer Science Peking UniversityBeijing 100871China Peking University Chongqing Research Institute of Big Data Chongqing 401329China National Engineering Research Center for Software Engineering Peking UniversityBeijing 100871China State Key Lab for Novel Software Technology Nanjing UniversityNanjing 210023China

Sharding is a promising technique to tackle the critical weakness of scalability in blockchain-based unmanned aerial vehicle(UAV)search and rescue(SAR)*** breaking up the blockchain network into smaller partitions called shards that run independently and in parallel,shardingbased UAV systems can support a large number of search and rescue UAVs with improved scalability,thereby enhancing the rescue ***,the lack of adaptability and interoperability still hinder the application of sharded blockchain in UAV SAR *** refers to making adjustments to the blockchain towards real-time surrounding situations,while interoperability refers to making cross-shard interactions at the mission *** address the above challenges,we propose a blockchain UAV system for SAR missions based on dynamic sharding *** from the benefits in scalability brought by sharding,our system improves adaptability by dynamically creating configurable and mission-exclusive shards,and improves interoperability by supporting calls between smart contracts that are deployed on different *** implement a prototype of our system based on Quorum,give an analysis of the improved adaptability and interoperability,and conduct experiments to evaluate the *** results show our system can achieve the above goals and overcome the weakness of blockchain-based UAV systems in SAR scenarios.

关键词： blockchain sharding unmanned aerial vehicle search and rescue blockchain interoperability

来源：评论

学校读者我要写书评

暂无评论

Explainable AI: A Way to Achieve Trustworthy AI 10

Explainable AI: A Way to Achieve Trustworthy AI

引用

10th IEEE Conference on Big Data Security on Cloud, BigDataSecurity 2024

作者： Li, Yanlu Xiao, Yufeng Gong, Yinyan Zhang, Ronglin Huo, Yingzi Wu, Yanbing Hunan Key Laboratory for Service Computing Novel Software Technology Xiangtan411201 China Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan411201 China

ISBN: (纸本)9798350389524

AI is black-box and non-explainable, in other words, due to the complexity of the decision-making process of AI, people are unable to know why and how AI makes the decision. For these reasons, people will question and worry about AI's decision-making. Against this background, researchers have proposed the concept of Explainable Artificial Intelligence (XAI). The aim of this paper is to help readers be able to better understand XAI through extensive surveys. In this paper, we discuss the concept of XAI, the motivation of the research, the current status of the research, and the difficulties in the research process. At the same time, we also discuss the specific methods to realize AI explainability by dividing AI explainability methods into two ways: transparent design and ex post facto interpretation. In addition, we select the three fields of healthcare, finance, and autonomous driving, discuss the application of XAI in these three fields, and select some representative results as examples through surveys. Finally, we summarize this article and present our outlook on the future development of XAI. © 2024 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Quantum Pseudorandom Scramblers 22nd

Quantum Pseudorandom Scramblers

引用

22nd Theory of Cryptography Conference, TCC 2024

作者： Lu, Chuhan Qin, Minglong Song, Fang Yao, Penghui Zhao, Mingnan Computer Science Department Portland State University Portland United States State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China Hefei National Laboratory Hefei230088 China

ISBN: (纸本)9783031780165

Quantum pseudorandom state generators (PRSGs) have stimulated exciting developments in recent years. A PRSG, on a fixed initial (e.g., all-zero) state, produces an output state that is computationally indistinguishable from a Haar random state. However, pseudorandomness of the output state is not guaranteed on other initial states. In fact, known PRSG constructions provably fail on some initial states. In this work, we propose and construct quantum Pseudorandom state Scramblers (PRSSs), which can produce a pseudorandom state on an arbitrary initial state. In the information-theoretical setting, we obtain a scrambler which maps an arbitrary initial state to a distribution of quantum states that is close to Haar random in total variation distance. As a result, our scrambler exhibits a dispersing property. Loosely, it can span an ϵ-net of the state space. This significantly strengthens what standard PRSGs can induce, as they may only concentrate on a small region of the state space provided that the average output state approximates a Haar random state. Our PRSS construction develops a parallel extension of the famous Kac’s walk, and we show that it mixes exponentially faster than the standard Kac’s walk. This constitutes the core of our proof. We also describe a few applications of PRSSs. While our PRSS construction assumes a post-quantum one-way function, PRSSs are potentially a weaker primitive and can be separated from one-way functions in a relativized world similar to standard PRSGs. © International Association for Cryptologic Research 2025.

关键词： Distribution functions

来源：评论

学校读者我要写书评

暂无评论

Specification and counterexample generation for cyber-physical systems

引用

Soft Computing 2024年第17-18期28卷 9137-9155页

作者： Li, Zhen Cao, Zining Wang, Fujun Xing, Chao College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Jiangsu Nanjing211106 China Science and Technology on Electro-optic Control Laboratory Henan Luoyang471000 China Collaborative Innovation Center of Novel Software Technology and Industrializaton Nanjing University of Aeronautics and Astronautics Jiangsu Nanjing210023 China Key Laboratory of Safety-Critical Software Ministry of Industry and Information Technology Jiangsu Nanjing211106 China

Cyber-Physical Systems (CPS) are complex systems that integrate information control devices with physical resources, which can be automatically and formalized verified by model checking according to the expected requirements in the formal specification. The counterexamples in model checking are witnesses to the violation of the specification properties of the system and can provide important diagnostic information for debugging, controlling, and synthesizing CPS. Designing a rational specification language for CPS and generating effective counterexamples allows security vulnerabilities to be detected and addressed early in the system development. However, CPS involve frequent interactions between cyber and physical systems and often operate in unreliable environments, which poses new challenges for comprehensive modeling and designing specification languages for CPSs with discrete, continuous, time, probabilistic, and concurrent behaviors. Moreover, finding the smallest counterexample of CPS with probabilistic behavior in the shortest possible time has been identified as a Non-Deterministic Polynomial-complete (NP-complete) problem. Although a number of heuristics have been devised to address this challenge, the accuracy and efficiency of the solved counterexamples need to be improved due to the difficulty in determining the heuristic functions. We first provide a comprehensive model for CPS by introducing the Hybrid Probabilistic Time Labeled Transition System (HPTLTS). Subsequently, we design a specification language HPTLTS Temporal Logic (HPTLTS-TL) that can describe the properties of CPS. In addition, we propose an optimization algorithm CACO-A, which combines the Ant Colony Optimization (ACO) algorithm and the A-algorithm to efficiently generate the counterexample of CPS, which is represented as the diagnostic subgraph. Finally, we discuss a typical CPS example to demonstrate the feasibility of our approach. © The Author(s), under exclusive licence to Springer-

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

Evaluation of TCP Variants on Dynamic UAV Networks 26

Evaluation of TCP Variants on Dynamic UAV Networks

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Fei, Junkai Zhu, Xiaojun Zhang, Ruyan Nanjing University of Aeronautics and Astronautics College of Computer Science and Technology China Nanjing University State Key Laboratory of Novel Software Technology Nanjing China

ISBN: (纸本)9798350331684

UAV networks are wireless networks composed of dynamic UAVs, characterized by a complex and constantly changing wireless environment. A recent TCP variant, BBR, has been verified to significantly improve packet loss resistance when compared to traditional TCP variants on wired networks. In this paper, we evaluate multiple TCP variants on dynamic UAV networks, taking into account wireless dynamics caused by factors such as mobility, malicious attacks, and traffic from other legitimate users. Our results demonstrate that BBR does not always perform better than other TCP variants in a wireless environment, as opposed to wired networks. Depending on the cause of wireless environment dynamics, other TCP variants may work more effectively. Our findings suggest that no single TCP variant consistently outperforms others in UAV networks. Therefore, when selecting a TCP variant, careful consideration of the different UAV missions is necessary. © 2023 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Weighted Attribute Based Conditional Proxy Re-Encryption in the Cloud

引用

computers, Materials & Continua 2025年第4期83卷 1399-1414页

作者： Xixi Yan Jing Zhang Pengyu Cheng Henan Key Laboratory of Network Cryptography Technology Network Information Security and Cryptography LaboratorySchool of SoftwareHenan Polytechnic UniversityJiaozuo454003China School of Computer Science and Technology Henan Polytechnic UniversityJiaozuo454000China

Conditional proxy re-encryption(CPRE)is an effective cryptographic primitive language that enhances the access control mechanism and makes the delegation of decryption permissions more granular,but most of the attribute-based conditional proxy re-encryption(AB-CPRE)schemes proposed so far do not take into account the importance of user attributes.A weighted attribute-based conditional proxy re-encryption(WAB-CPRE)scheme is thus designed to provide more precise decryption rights *** introducing the concept of weight attributes,the quantity of system attributes managed by the server is reduced *** the same time,a weighted tree structure is constructed to simplify the expression of access structure *** conditional proxy re-encryption,large amounts of data and complex computations are outsourced to cloud servers,so the data owner(DO)can revoke the user’s decryption rights directly with minimal *** scheme proposed achieves security against chosen plaintext attacks(CPA).Experimental simulation results demonstrated that the decryption time is within 6–9 ms,and it has a significant reduction in communication and computation cost on the user side with better functionality compared to other related schemes,which enables users to access cloud data on devices with limited resources.

关键词： Cloud service conditional proxy re-encryption user revocation weighted attribute

来源：评论

学校读者我要写书评

暂无评论

Space Complexity of Euclidean Clustering 40

Space Complexity of Euclidean Clustering

引用

40th International Symposium on Computational Geometry, SoCG 2024

作者： Zhu, Xiaoyi Tian, Yuxiang Huang, Lingxiao Huang, Zengfeng School of Data Science Fudan University Shanghai China State Key Laboratory of Novel Software Technology Nanjing University China

ISBN: (纸本)9783959773164

The (k,z)-Clustering problem in Euclidean space Rd has been extensively studied. Given the scale of data involved, compression methods for the Euclidean (k,z)-Clustering problem, such as data compression and dimension reduction, have received significant attention in the literature. However, the space complexity of the clustering problem, specifically, the number of bits required to compress the cost function within a multiplicative error Ε, remains unclear in existing literature. This paper initiates the study of space complexity for Euclidean (k,z)-Clustering and offers both upper and lower bounds. Our space bounds are nearly tight when k is constant, indicating that storing a coreset, a well-known data compression approach, serves as the optimal compression scheme. Furthermore, our lower bound result for (k,z)-Clustering establishes a tight space bound of Θ(nd) for terminal embedding, where n represents the dataset size. Our technical approach leverages new geometric insights for principal angles and discrepancy methods, which may hold independent interest. © Xiaoyi Zhu, Yuxiang Tian, Lingxiao Huang, and Zengfeng Huang.

关键词： Data compression

来源：评论

学校读者我要写书评

暂无评论

On the robustness of median sampling in noisy evolutionary optimization

引用

science China(Information sciences) 2021年第5期64卷 32-44页

作者： Chao BIAN Chao QIAN Yang YU Ke TANG State Key Laboratory for Novel Software Technology Nanjing University Shenzhen Key Laboratory of Computational Intelligence Department of Computer Science and EngineeringSouthern University of Science and Technology

Evolutionary algorithms(EAs) are a sort of nature-inspired metaheuristics, which have wide applications in various practical optimization problems. In these problems, objective evaluations are usually inaccurate, because noise is almost inevitable in real world, and it is a crucial issue to weaken the negative effect caused by noise. Sampling is a popular strategy, which evaluates the objective a couple of times, and employs the mean of these evaluation results as an estimate of the objective value. In this work, we introduce a novel sampling method, median sampling, into EAs, and illustrate its properties and usefulness theoretically by solving OneMax, the problem of maximizing the number of 1 s in a bit string. Instead of the mean, median sampling employs the median of the evaluation results as an estimate. Through rigorous theoretical analysis on OneMax under the commonly used onebit noise, we show that median sampling reduces the expected runtime exponentially. Next, through two special noise models, we show that when the 2-quantile of the noisy fitness increases with the true fitness, median sampling can be better than mean sampling; otherwise,it may fail and mean sampling can be better. The results may guide us to employ median sampling properly in practical applications.

关键词： evolutionary algorithms noisy optimization median sampling computational complexity runtime analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：