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

An energy constraint position-based dynamics with corrected SPH kernel

science China(Information sciences) 2023年第1期66卷 144-157页

作者： Wei CAO Luan LYU Zhixin YANG Enhua WU College of Computer Science and Technology China University of Petroleum Faculty of Science and Technology University of Macau State Key Laboratory of Internet of Things for Smart City University of Macau State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Guangzhou Greater Bay Area Virtual Reality Research Institute

We introduce an improved position-based dynamics method with corrected smoothed particle hydrodynamics(SPH) kernel to simulate deformable solids. Using a strain energy constraint that follows the continuum mechanics, the method can maintain the efficiency and stability of the position-based approach while improving the physical plausibility of the simulation. We can easily simulate the behavior of anisotropic and plastic materials because the method is based on physics. Unlike the previous position-based simulations of continuous materials, we use weakly structured particles to discretize the model for the convenience of deformable object cutting. In this case, a corrected SPH kernel function is adopted to measure the deformation gradient and calculate the strain energy on each particle. We also propose a solution for the interparticle inversion and penetration in large deformation. To perform complex interaction scenarios, we provide a simple method for collision detection. We demonstrate the flexibility, efficiency, and robustness of the proposed method by simulating various scenes, including anisotropic elastic deformation, plastic deformation, model cutting, and large-scale elastic collision.

关键词： position-based dynamics deformable solids continuum mechanics

来源：评论

学校读者我要写书评

暂无评论

Wireless Charging Scheduling for Long-term Utility Optimization

引用

ACM Transactions on Sensor Networks 2025年第1期21卷 1-31页

作者： Xu, Jia Chen, Wenbin Dai, Haipeng Xu, Lijie Xiao, Fu Liu, Linfeng Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China The State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

Wireless power transmission has been widely used to replenish energy for wireless sensor networks, where the energy consumption rate of sensor nodes is usually time varying and indefinite. However, few works have investigated the problem of long-term charging scheduling with random variable. This article designs an optimization model for the long-term scheduling of chargers to maximize the time-averaged charging utility while ensuring its time-averaged constraints of budget and response rate. The Lyapunov optimization technique is adopted to transform the stochastic optimization problem into a deterministic optimization problem, which remains NP-hard. Thus, an approximation algorithm following greedy approach is proposed to solve the deterministic optimization problem. We further provide the theoretical analysis of feasibility and performance guarantee of the proposed scheduling algorithm. The simulation results show that our algorithm outperforms three comparison algorithms by 6.53%, 20.04%, and 19.97% in terms of time-averaged charging utility, as well as by 11.25%, 4.42%, and 3.73% in terms of time-averaged response rate on average. © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Inductive power transmission

来源：评论

学校读者我要写书评

暂无评论

Multilabel Black-Box Adversarial Attacks Only With Predicted Labels

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1284-1297页

作者： Kong, Linghao Luo, Wenjian Ye, Zipeng Zhou, Qi Jia, Yan Harbin Institute of Technology Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Computer Science and Technology Shenzhen518055 China Peng Cheng Laboratory Shenzhen518055 China

Multilabel adversarial examples have become a threat to deep neural network models (DNNs). Most of the current work on multilabel adversarial examples are focused on white-box environments. In this article, we focus on a black-box environment where the available information is extremely limited: a label-only black-box environment. Under the label-only black-box environment, the attacker can only obtain the predicted labels, and cannot obtain any other information such as the model's internal structure, parameters, the training dataset, and the output prediction confidence. We propose a label-only black-box attack framework, and through this framework to implement two black-box adversarial attacks: multi-label boundary-based attack (ML-BA) and multilabel label-only black-box attack (ML-LBA). The ML-BA is developed by transplanting the boundary-based attack in the multiclass domain to the multilabel domain, and the ML-LBA is based on differential evolution. Experimental results show that both the proposed algorithms can achieve the hiding single label attack in label-only black-box environments. Besides, ML-LBA requires fewer queries and its perturbations are significantly less. This demonstrates the effectiveness of the proposed label-only black-box attack framework and the advantageous of differential evolution in optimizing high-dimensional problems. © 2020 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

A Privacy Preservation Method for Attributed Social Network Based on Negative Representation of Information

引用

computer Modeling in Engineering & sciences 2024年第7期140卷 1045-1075页

作者： Hao Jiang Yuerong Liao Dongdong Zhao Wenjian Luo Xingyi Zhang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei230601China Chongqing Research Institute School of Computer Science and Artificial IntelligenceWuhan University of TechnologyWuhan430070China Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Computer Science and TechnologyHarbin Institute of TechnologyShenzhen518055China

Due to the presence of a large amount of personal sensitive information in social networks,privacy preservation issues in social networks have attracted the attention of many *** by the self-nonself discrimination paradigmin the biological immune system,the negative representation of information indicates features such as simplicity and efficiency,which is very suitable for preserving social network ***,we suggest a method to preserve the topology privacy and node attribute privacy of attribute social networks,called ***,a negative survey-based method is developed to disturb the relationship between nodes in the social network so that the topology structure can be kept ***,a negative database-based method is proposed to hide node attributes,so that the privacy of node attributes can be preserved while supporting the similarity estimation between different node attributes,which is crucial to the analysis of social *** evaluate the performance of the AttNetNRI,empirical studies have been conducted on various attribute social networks and compared with several state-of-the-art methods tailored to preserve the privacy of social *** experimental results show the superiority of the developed method in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topology disturbing and attribute hiding *** experimental results show the superiority of the developed methods in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topological interference and attribute-hiding components.

关键词： Attributed social network topology privacy node attribute privacy negative representation of information negative survey negative database

来源：评论

学校读者我要写书评

暂无评论

AE-TPGG:a novel autoencoder-based approach for single-cell RNA-seq data imputation and dimensionality reduction

引用

Frontiers of computer science 2023年第3期17卷 217-234页

作者： Shuchang ZHAO Li ZHANG Xuejun LIU MIIT Key Laboratory of Pattern Analysis and Machine Intelligence College of Computer Science and TechnologyNanjing University of Aeronautics and AstronauticsNanjing 211106China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing 210023China College of Computer Science and Technology Nanjing Forestry UniversityNanjing 210037China

Single-cell RNA sequencing(scRNA-seq)technology has become an effective tool for high-throughout transcriptomic study,which circumvents the averaging artifacts corresponding to bulk RNA-seq technology,yielding new perspectives on the cellular diversity of potential superficially homogeneous *** various sequencing techniques have decreased the amplification bias and improved capture efficiency caused by the low amount of starting material,the technical noise and biological variation are inevitably introduced into experimental process,resulting in high dropout events,which greatly hinder the downstream *** the bimodal expression pattern and the right-skewed characteristic existed in normalized scRNA-seq data,we propose a customized autoencoder based on a twopart-generalized-gamma distribution(AE-TPGG)for scRNAseq data analysis,which takes mixed discrete-continuous random variables of scRNA-seq data into account using a twopart model and utilizes the generalized gamma(GG)distribution,for fitting the positive and right-skewed continuous *** adopted autoencoder enables AE-TPGG to captures the inherent relationship between *** addition to the ability of achieving low-dimensional representation,the AETPGG model also provides a denoised imputation according to statistical characteristic of gene *** on real datasets demonstrate that our proposed model is competitive to current imputation methods and ameliorates a diverse set of typical scRNA-seq data analyses.

关键词： scRNA-seq autoencoder TPGG data imputation dimensionality reduction

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous Federated Knowledge Graph Embedding Learning and Unlearning 23

Heterogeneous Federated Knowledge Graph Embedding Learning a...

引用

2023 World Wide Web Conference, WWW 2023

作者： Zhu, Xiangrong Li, Guangyao Hu, Wei State Key Laboratory for Novel Software Technology Nanjing University China State Key Laboratory for Novel Software Technology National Institute of Healthcare Data Science Nanjing University China

ISBN: (纸本)9781450394161

Federated Learning (FL) recently emerges as a paradigm to train a global machine learning model across distributed clients without sharing raw data. Knowledge Graph (KG) embedding represents KGs in a continuous vector space, serving as the backbone of many knowledge-driven applications. As a promising combination, federated KG embedding can fully take advantage of knowledge learned from different clients while preserving the privacy of local data. However, realistic problems such as data heterogeneity and knowledge forgetting still remain to be concerned. In this paper, we propose FedLU, a novel FL framework for heterogeneous KG embedding learning and unlearning. To cope with the drift between local optimization and global convergence caused by data heterogeneity, we propose mutual knowledge distillation to transfer local knowledge to global, and absorb global knowledge back. Moreover, we present an unlearning method based on cognitive neuroscience, which combines retroactive interference and passive decay to erase specific knowledge from local clients and propagate to the global model by reusing knowledge distillation. We construct new datasets for assessing realistic performance of the state-of-the-arts. Extensive experiments show that FedLU achieves superior results in both link prediction and knowledge forgetting. © 2023 ACM.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

QAAS:quick accurate auto-scaling for streaming processing

引用

Frontiers of computer science 2024年第1期18卷 5-15页

作者： Shiyuan LIU Yunchun LI Hailong YANG Ming DUN Chen CHEN Huaitao ZHANG Wei LI State Key Laboratory of Software Development Environment Beijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China School of Cyber Science and Technology Beihang UniversityBeijing 100191China School of Computer Science and Technology Xi’an Jiaotong UniversityXi’an 710049China

In recent years,the demand for real-time data processing has been increasing,and various stream processing systems have *** the amount of data input to the stream processing system fluctuates,the computing resources required by the stream processing job will also *** resources used by stream processing jobs need to be adjusted according to load changes,avoiding the waste of computing *** present,existing works adjust stream processing jobs based on the assumption that there is a linear relationship between the operator parallelism and operator resource consumption(e.g.,throughput),which makes a significant deviation when the operator parallelism *** paper proposes a nonlinear model to represent operator *** divide the operator performance into three stages,the Non-competition stage,the Non-full competition stage,and the Full competition *** our proposed performance model,given the parallelism of the operator,we can accurately predict the CPU utilization and operator *** with actual experiments,the prediction error of our model is below 5%.We also propose a quick accurate auto-scaling(QAAS)method that uses the operator performance model to implement the auto-scaling of the operator parallelism of the Flink *** to previous work,QAAS is able to maintain stable job performance under load changes,minimizing the number of job adjustments and reducing data backlogs by 50%.

关键词： stream processing performance model auto-scaling

来源：评论

学校读者我要写书评

暂无评论

Container-Aware Service Function Chains Placement and Optimization in Vehicular Edge Computing 22

Container-Aware Service Function Chains Placement and Optimi...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Zhang, Kaixin Hu, Shihong Qu, Zhihao Ye, Baoliu Hohai University School of Computer Science and Software Engineering China Nanjing University National Key Laboratory for Novel Software Technology China

ISBN: (纸本)9798331509712

In the domain of Vehicular Edge Computing (VEC), this paper addresses the complex problem of Service Function Chain (SFC) placement, which is crucial for the efficient deployment of cloud applications in vehicular environments. Our approach leverages Virtual Network Function (VNF) technology, transitioning network services from traditional hardware to more flexible, container-based edge computing frameworks. The primary objective is to organize these VNFs into functional SFCs, thereby minimizing service delays in VEC systems. SFC placement faces two significant challenges. The first is the sequential dependency among VNFs within an SFC, which adds substantial complexity to container deployment. The second challenge is the cold start delay of VNF containers, a critical issue in scenarios requiring swift response times, which negatively impacts service quality in VEC applications. To address these challenges, we propose a comprehensive model for SFC placement that considers the deployment status of VNF containers, acknowledging the complexity of this NP-hard problem. The core of our contribution is the development of the Single SFC Placement Algorithm (SSPA), a sophisticated, greedy-based approach designed for the effective placement of individual SFCs. We enhance this algorithm by incorporating a Particle Swarm Optimization (PSO) technique, making it capable of efficiently handling the placement of multiple SFCs. Our solution aims to improve edge resource utilization and mitigate startup delays associated with the initial activation of containers, thereby reducing service delays. Extensive experimental evaluations demonstrate that our algorithm achieves a 34.3% average reduction in service delay compared to four baselines and a 5.8% average reduction compared to other container-aware algorithms. © 2024 IEEE.

关键词： service function chain SFC placement vehicle edge computing virtual network function

来源：评论

学校读者我要写书评

暂无评论

A Crowdsensing Service Pricing Method in Vehicular Edge Computing 22

A Crowdsensing Service Pricing Method in Vehicular Edge Comp...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Li, Zheng Tang, Sizhe Tian, Hao Xiang, Haolong Xu, Xiaolong Dou, Wanchun Nanjing University State Key Laboratory of Novel Software Technology Nanjing China Nanjing University of Information Science and Technology School of Software Nanjing China

ISBN: (纸本)9798331509712

The rapid advancements in vehicular networking technology have enabled onboard users to access a variety of emerging services like precise navigation and real-time hazard avoidance. However, as the diversity and volume of required data expand and demands intensify, most of vehicular services are unable to satisfy user expectations. Although crowdsensing architectures based on edge computing have been proposed in vehicular networks, how to optimally allocate the sensing service time of roadside units and set appropriate prices for services to maximize user benefits still remain significant challenges. To solve the above issue, in this paper, a crowdsensing service pricing method is proposed in vehicular edge computing. Specifically, a vehicular networking crowdsensing framework based on the edge computing is designed. Then, the optimization problem of perception time pricing during the crowdsensing process is modeled into a Stackelberg game and further the multi-agent deep deterministic policy gradient-based algorithm is employed to obtain the optimal pricing strategy with user profits maximization. Finally, simulation results demonstrate that the proposed method significantly increases the payoff for all participants during the crowdsensing process. © 2024 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

COMPRESSO: Latency-Aware Transmission of Compressed IoT Measurement Data Over SDN

引用

IEEE Internet of Things Journal 2025年第12期12卷 20462-20472页

作者： Feng, Wendi Dou, Xintan Taherkordi, Amirhosein Cheng, Bo Zhang, Wei State Key Laboratory of Networking and Switching Technology China University of Oslo College of Computer Science Dept. of Informatics Norway State Key Laboratory of Networking and Switching Technology China

Measurement data obtained from "things"in the Internet of Things (IoT) faces challenges in efficient transmission due to the low-bandwidth data transmission *** observe that measurement data are fixed in size and format, and low-entropy in the time domain, indicating that compression can be benefited. Rather than employing a single compression algorithm as advocated in existing literature, we argue that optimal transmission can be achieved by jointly considering compression overheads and network status, where software-defined networking (SDN) is employed to enforce network statistics and packet forwarding. This paper presents a new paradigm that achieves optimal transmission of SDN-empowered compressed measurement data. We formulate the problem as an optimization problem and prove its non-polynomial hardness time complexity. Due to this complexity, we introduce COMPRESSO, a heuristic algorithm that efficiently solves the problem. We conduct rigorous simulations, and the results demonstrate the efficiency of the new paradigm and COMPRESSO, i.e., attaining comparable performance to the optimal solution with 50% time usage reduction. © 2014 IEEE.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：