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

AI-Enhanced Secure data Aggregation for Smart Grids with Privacy Preservation

Computers, Materials & Continua 2025年第1期82卷 799-816页

作者： Congcong Wang Chen Wang Wenying Zheng Wei Gu School of Software Nanjing University of Information Science and TechnologyNanjing210044China School of Information Science and Engineering Zhejiang Sci-Tech UniversityHangzhou310018China State Key Laboratory of Public Big Data Guizhou UniversityGuiyang550025China School of Computer Science and Technology(School of Artificial Intelligence) Zhejiang Sci-Tech UniversityHangzhou310018China School of Computer Science(School of Cyber Science and Engineering) Nanjing University of Information Science and TechnologyNanjing210044China

As smart grid technology rapidly advances,the vast amount of user data collected by smart meter presents significant challenges in data security and privacy *** research emphasizes data security and user privacy concerns within smart ***,existing methods struggle with efficiency and security when processing large-scale *** efficient data processing with stringent privacy protection during data aggregation in smart grids remains an urgent *** paper proposes an AI-based multi-type data aggregation method designed to enhance aggregation efficiency and security by standardizing and normalizing various data *** approach optimizes data preprocessing,integrates Long Short-Term Memory(LSTM)networks for handling time-series data,and employs homomorphic encryption to safeguard user *** also explores the application of Boneh Lynn Shacham(BLS)signatures for user *** proposed scheme’s efficiency,security,and privacy protection capabilities are validated through rigorous security proofs and experimental analysis.

关键词： Smart grid data security privacy protection artificial intelligence data aggregation

来源：评论

学校读者我要写书评

暂无评论

Massively parallel algorithms for fully dynamic all-pairs shortest paths

引用

Frontiers of Computer Science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

来源：评论

学校读者我要写书评

暂无评论

MC-PDARTS: Multi-Cell Progressive Differentiable Architecture Search

MC-PDARTS: Multi-Cell Progressive Differentiable Architectur...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Qun Liu Yi Cai Junying Chen School of Software Engineering South China University of Technology Key Laboratory of Big Data and Intelligent Robot (SCUT) Ministry of Education Guangzhou China

Recently, network architecture search has been practiced in more and more tasks, but its high cost makes it difficult for small research teams or individual researchers to follow. Differentiable architecture search (DARTS) algorithm provides an easier available solution in searching effective network architectures. Although DARTS algorithm has greatly reduced the search cost as compared with other evolution based or reinforcement learning based methods, there is still a long way to go before it is widely used, since gradient based methods consume a lot of GPU memory and its search space lacks diversity. Encouraged by the idea of progressive differentiable architecture search (P-DARTS), we propose a multi-cell progressive differentiable architecture search (MC-PDARTS) algorithm, which allows cells at different levels to learn different structures, and progressively searches the best structure for the corresponding level in each search stage. The proposed algorithm greatly enlarges the search space of the search network while reducing the memory consumption and search time in the search process, and alleviates the problem of performance collapse caused by too many skip connections which often occur in previous gradient based methods. Compared with the previous algorithms, the proposed MC-PDARTS algorithm achieves state-of-the-art performance on CIFAR-10 and CIFAR-100 datasets with around 4-hour search on a single Nvidia GTX1080Ti GPU. In order to reduce the performance loss in the transfer process, MC-PDARTS searches directly on a large target dataset (ImageNet) without proxy tasks, achieving state-of-the-art performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Compact and Accurate Adaptive Width Radial Basis Function Neural Network with Discriminative Features for Thyroid Gland Segmentation

Compact and Accurate Adaptive Width Radial Basis Function Ne...

引用

IEEE/RSJ International Conference on intelligent robots and Systems (IROS)

作者： Haijun You Junying Chen School of Software Engineering South China University of Technology Key Laboratory of Big Data and Intelligent Robot (SCUT) Ministry of Education Guangzhou China

The goal of this work is to develop a fast, compact, accurate, and robust neural network for automatic thyroid gland segmentation in medical ultrasound images when the computational resources are limited, such as portable intelligent medical diagnostic devices or robots. An adaptive width radial basis function neural network model with discriminative features is proposed in this work. The model combines the local characteristics and global context of the entire feature space, which improves the performance of the automatic thyroid gland segmentation, and enhances the data fitting capability and robustness of the neural network. A new feature selection method combining the measurements of area under the curve values and Pearson correlation coefficients is proposed to select six discriminative and low correlated features from a set of handcrafted features, which helps to construct a compact yet accurate radial basis function neural network. The proposed method is experimented on thyroid ultrasound images using five-fold cross validation. The proposed method achieves an average accuracy of 0.9770 and an average IoU of 0.7841, achieving competitive segmentation performance compared to convolutional neural networks, with thousands of times faster training speed on a CPU.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on key technologies of edge cache in virtual data space across WAN

引用

Frontiers of Computer Science 2023年第1期17卷 15-34页

作者： Jiantong HUO Yaowen XU Zhisheng HUO Limin XIAO Zhenxue HE State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China High Performance Computing Center Beihang UniversityBeijing 100191China College of Software Beihang UniversityBeijing 100191China Hebei Key Laboratory of Agricultural Big Data Hebei Agricultural UniversityBaoding 071001China College of Computer Science and Technology Zhejiang UniversityHangZhou 310013China

The authors of this paper have previously proposed the global virtual data space system (GVDS) to aggregate the scattered and autonomous storage resources in China’s national supercomputer grid (National Supercomputing Center in Guangzhou, National Supercomputing Center in Jinan, National Supercomputing Center in Changsha, Shanghai Supercomputing Center, and Computer Network Information Center in Chinese Academy of Sciences) into a storage system that spans the wide area network (WAN), which realizes the unified management of global storage resources in China. At present, the GVDS has been successfully deployed in the China National Grid environment. However, when accessing and sharing remote data in the WAN, the GVDS will cause redundant transmission of data and waste a lot of network bandwidth resources. In this paper, we propose an edge cache system as a supplementary system of the GVDS to improve the performance of upper-level applications accessing and sharing remote data. Specifically, we first designs the architecture of the edge cache system, and then study the key technologies of this architecture: the edge cache index mechanism based on double-layer hashing, the edge cache replacement strategy based on the GDSF algorithm, the request routing based on consistent hashing method, and the cluster member maintenance method based on the SWIM protocol. The experimental results show that the edge cache system has successfully implemented the relevant operation functions (read, write, deletion, modification, etc.) and is compatible with the POSIX interface in terms of function. Further, it can greatly reduce the amount of data transmission and increase the data access bandwidth when the accessed file is located at the edge cache system in terms of performance, i.e., its performance is close to the performance of the network file system in the local area network (LAN).

关键词： virtual data space system wide area network edge cache redundant data transmission

来源：评论

学校读者我要写书评

暂无评论

Plausible Heterogeneous Graph k-Anonymization for Social Networks

引用

Tsinghua Science and Technology 2022年第6期27卷 912-924页

作者： Kaiyang Li Ling Tian Xu Zheng Bei Hui School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China School of Information and Software Engineering University of Electronic Science and Technology of ChinaChengdu 610054China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu 610000China

The inefficient utilization of ubiquitous graph data with combinatorial structures necessitates graph embedding methods,aiming at learning a continuous vector space for the graph which is amenable to be adopted in traditional machine learning algorithms in favor of vector *** embedding methods build an important bridge between social network analysis and data analytics as social networks naturally generate an unprecedented volume of graph data *** social network data not only bring benefit for public health,disaster response,commercial promotion,and many other applications,but also give birth to threats that jeopardize each individual’s privacy and ***,most existing works in publishing social graph embedding data only focus on preserving social graph structure with less attention paid to the privacy issues inherited from social *** be specific,attackers can infer the presence of a sensitive relationship between two individuals by training a predictive model with the exposed social network *** this paper,we propose a novel link-privacy preserved graph embedding framework using adversarial learning,which can reduce adversary’s prediction accuracy on sensitive links while persevering sufficient non-sensitive information such as graph topology and node attributes in graph *** experiments are conducted to evaluate the proposed framework using ground truth social network datasets.

关键词： social network graph embedding privacy preservation adversarial learning

来源：评论

学校读者我要写书评

暂无评论

A Feature Distribution Smoothing Network Based on Gaussian Distribution for QoS Prediction

A Feature Distribution Smoothing Network Based on Gaussian D...

引用

2023 IEEE International Conference on Web Services, ICWS 2023

作者： Lu, Tongxin Zhang, Xiaohong Wang, Ziliang Yan, Meng Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing University Ministry of Education China Chongqing University School of Big Data and Software Engineering Chongqing China

ISBN: (纸本)9798350304855

With the increasing number of services and their homogenization, the use of Quality of Service (QoS) for recommendations has become necessary. However, existing QoS prediction solutions have limitations in solving the noise and label imbalance problems of dataset, which greatly limit the improvement of QoS prediction accuracy. In this paper, we propose FSNet that contains a feature distribution smoothing module and an improved W-Huber loss function. The feature distribution smoothing module mitigates the effect of noise problem by fitting potential Gaussian distribution of known features with a supervised feedforward neural network. W-Huber loss function mitigates the impact of label imbalance problem on QoS prediction by reweighting the two components of Huber loss function. We conduct extensive experiments on real large-scale QoS dataset, and the results demonstrate that the proposed FSNet method outperforms existing QoS prediction methods. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Low-Sampling-Frequency Plane wave Medical Ultrasound Imaging based on Adversarial Learning

Low-Sampling-Frequency Plane wave Medical Ultrasound Imaging...

引用

IEEE International Conference on Image Processing

作者： Xiaoteng Chen Junying Chen School of Software Engineering South China University of Technology Guangzhou China Key Laboratory of Big Data and Intelligent Robot (SCUT) Ministry of Education China

In plane wave medical ultrasound imaging, the analog echo signals are received via the transducer, and sampled as digital radio frequency data which is further processed by the beamforming algorithm to obtain the output ultrasound image. The sampling frequency of radio frequency data has a great impact on the image quality. The radio frequency data with higher sampling frequency is closer to the true distribution of the analog echo signals, leading to better image quality. However, high-frequency sampling chips are usually expensive. Thus, improving the plane wave imaging quality for radio frequency data with low sampling frequency has important practical significance. The ultrasound imaging quality is mainly affected by shallow features such as texture and color. However, low-sampling-frequency data has poor shallow features while high-sampling-frequency data has better shallow features. In this work, we propose an adversarial learning method to replace the shallow features of low-frequency data with the shallow features of high-frequency data, but retaining the deep features of low-frequency data. The experiment results demonstrate that the proposed method improves the plane wave imaging quality for low-sampling-frequency data by fusing shallow and deep features.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sequence-to-Sequence Multi-Hop Knowledge Reasoning Based on Retentive Network 7

Sequence-to-Sequence Multi-Hop Knowledge Reasoning Based on ...

引用

7th International Conference on Computer Information Science and Application Technology, CISAT 2024

作者： Su, Ruilin Zhang, Wanshan Yu, Dunhui Hubei University Wuhan China Wuhan430062 China Hubei University School of Computer Science and Information Engineering Wuhan430062 China Hubei University Hubei Key Laboratory of Big Data Intelligent Analysis and Application Wuhan430062 China Engineering and Technical Research Center of Hubei Province in Software Engineering Wuhan430062 China

ISBN: (纸本)9798350375107

Multi-hop Knowledge Reasoning is a task that involves generating an answer given a query and a knowledge graph. Existing sequence-to-sequence reasoning models use the Transformer to encode and decode sequences, but these models have some flaws, such as the inability to effectively handle long-sequence reasoning and susceptibility to exposure bias. To address these issues, we provides a sequence-to-sequence reasoning model named STSR, which is based on Retentive Network. Aiming at improving training efficiency through parallel training, this model leverages the advantages in Retentive Network, reduce time overhead, and enhance reasoning efficiency through iterative reasoning. It effectively mitigates the problems of high spatial overhead and low efficiency in long-sequence reasoning faced by the Transformer. Moreover, it retains and updates historical information during the encoding and decoding process, enhancing the model's memory and generalization capabilities. Additionally, the Scheduled Sampling method is adopted to alleviate the exposure bias introduced during reasoning, which involves using the model's own output as the input for the next moment with a certain probability during training, instead of using the true label. We conduct the experiment on six public datasets, with the results showing that the proposed model outperforms existing baseline models in terms of precision and generation quality. This paper provides a new solution for the task of sequence-to-sequence multihop knowledge reasoning and also demonstrates the potential application of the Retentive Network in natural language processing. © 2024 IEEE.

关键词： Iterative decoding

来源：评论

学校读者我要写书评

暂无评论

Obstacle-Avoidance Path Planning of robot Arm Based on Improved RRT Algorithm 8

Obstacle-Avoidance Path Planning of Robot Arm Based on Impro...

引用

8th Asia-Pacific Conference on intelligent robot Systems, ACIRS 2023

作者： Hu, Chong Mu, Chunyang Xing, Ma Zhang, Chuntao Zhou, Wenya Yang, Ke School of Electrical and Information Engineering North Minzu University Yinchuan China College of Mechanical and Electrical Engineering North Minzu University The Key Laboratory of Intelligent Information and Big Data Processing of Ningxia Province Yinchuan China School of Electrical and Information Engineering North Minzu University The Key Laboratory of Intelligent Information and Big Data Processing of Ningxia Province Yinchuan China College of Mechanical and Electrical Engineering North Minzu University Yinchuan China

ISBN: (纸本)9798350302851

In the application of RRT (Rapidly-exploring Random Trees) algorithm in obstacle avoidance path planning of redundant robot arms in high-dimensional space, the sampling area of random sampling points is large, the search time is long, the path twists and turns, and the redundant points are too many. In this paper, an efficient sampling RRT algorithm with adaptive step size and fast automatic convergence is proposed. Firstly, by adding the optimized gravity function, the step size of the extended tree is changed adaptively and the convergence is stronger. Secondly, the limited sampling of parent node area expansion is proposed to avoid useless point sampling and repeated point sampling, so that the utilization of sampling points is greatly improved. Finally, by changing the way of parent node reconnection and re-selection, the path tortuous degree is lower, the path planning cost and redundancy points are reduced, and MATLAB software is used to carry out the path planning simulation experiment. By comparing RRT, gravitational field RTT and RRT∗ algorithm, the improved RRT algorithm has significantly improved in distance, time and number of nodes. It has important engineering application value. © 2023 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：