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

30th Annual Network and Distributed System Security Symposium, NDSS 2023

作者： Chen, Tianyang Xu, Peng Picek, Stjepan Luo, Bo Susilo, Willy Jin, Hai Liang, Kaitai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering China Cluster and Grid Computing Lab School of Computer Science and Technology China Huazhong University of Science and Technology Wuhan430074 China Digital Security Group Radboud University Nijmegen Netherlands Department of EECS Institute of Information Sciences The University of Kansas LawrenceKS United States Institute of Cybersecurity and Cryptology School of Computing and Information Technology University of Wollongong WollongongNSW2522 Australia Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft2628 CD Netherlands

ISBN: (纸本)1891562835

Dynamic searchable symmetric encryption (DSSE) enables users to delegate the keyword search over dynamically updated encrypted databases to an honest-but-curious server without losing keyword privacy. This paper studies a new and practical security risk to DSSE, namely, secret key compromise (e.g., a user’s secret key is leaked or stolen), which threatens all the security guarantees offered by existing DSSE schemes. To address this open problem, we introduce the notion of searchable encryption with key-update (SEKU) that provides users with the option of non-interactive key updates. We further define the notion of post-compromise secure with respect to leakage functions to study whether DSSE schemes can still provide data security after the client’s secret key is compromised. We demonstrate that post-compromise security is achievable with a proposed protocol called "Bamboo". Interestingly, the leakage functions of Bamboo satisfy the requirements for both forward and backward security. We conduct a performance evaluation of Bamboo using a real-world dataset and compare its runtime efficiency with the existing forward-and-backward secure DSSE schemes. The result shows that Bamboo provides strong security with better or comparable performance. © 2023 30th Annual Network and Distributed System Security Symposium, NDSS 2023. All Rights Reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Chain-Based Outlier Detection for Complex data Scenarios

Chain-Based Outlier Detection for Complex Data Scenarios

引用

2023 IEEE International Conference on Big data, Bigdata 2023

作者： Dong, Huiwen Wang, Qing-Guo Ding, Wei Institute of Artificial Intelligence and Future Networks Beijing Normal University Beijing China Institute for Advanced Study Guangdong Key Lab of Ai and Mm Data ProcessingGuangdong Provincial Key Laboratory Irads Ias Dst BNU-HKBU United International College Zhuhai China Changshu Institute of Technology Faculty of Electrical Engineering and Automation Changshu China

ISBN: (纸本)9798350324457

Outlier detection is a challenging problem due to the complexity of real-life data. Specifically, an effective outlier detection method should be able to handle (1) different types of outliers: local outliers, global outliers, and cluster outliers;(2) a lack of prior knowledge of outlier number or percentage;(3) neighboring clusters with different densities;and (4) real-time detection. Unfortunately, few algorithms can tackle all these challenges simultaneously. In this paper, we propose a chain-based theory to address these issues, where a minority of data points will be considered outliers if their distances from normal data points change abruptly. We present the parallel chaining method based on this theory. Experiments demonstrate that the proposed method exhibits comparable performance to other state-of-the-art methods in the synthetic datasets and outperform other methods in the real-life datasets. © 2023 IEEE.

关键词： Chain-based theory Cluster outlier Complex data scenarios. Local outlier Outlier detection

来源：评论

学校读者我要写书评

暂无评论

Domain adaptation for large-vocabulary object detectors 24

Domain adaptation for large-vocabulary object detectors

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Kai Jiang Jiaxing Huang Weiying Xie Jie Lei Yunsong Li Ling Shao Shijian Lu State Key Laboratory of Integrated Services Networks Xidian University Xi'an China S-lab School of Computer Science and Engineering Nanyang Technological University School of Electrical and Data Engineering at the University of Technology Sydney UCAS-Terminus AI Lab University of Chinese Academy of Sciences China

ISBN: (纸本)9798331314385

Large-vocabulary object detectors (LVDs) aim to detect objects of many categories, which learn super objectness features and can locate objects accurately while applied to various downstream data. However, LVDs often struggle in recognizing the located objects due to domain discrepancy in data distribution and object vocabulary. At the other end, recent vision-language foundation models such as CLIP demonstrate superior open-vocabulary recognition capability. This paper presents KGD, a Knowledge Graph Distillation technique that exploits the implicit knowledge graphs (KG) in CLIP for effectively adapting LVDs to various downstream domains. KGD consists of two consecutive stages: 1) KG extraction that employs CLIP to encode downstream domain data as nodes and their feature distances as edges, constructing KG that inherits the rich semantic relations in CLIP explicitly; and 2) KG encapsulation that transfers the extracted KG into LVDs to enable accurate cross-domain object classification. In addition, KGD can extract both visual and textual KG independently, providing complementary vision and language knowledge for object localization and object classification in detection tasks over various downstream domains. Experiments over multiple widely adopted detection benchmarks show that KGD outperforms the state-of-the-art consistently by large margins.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on Classification label Denoising Algorithm Based on Granular Ball 7

Research on Classification Label Denoising Algorithm Based o...

引用

7th International Conference on Cloud Computing and Big data Analytics, ICCCBDA 2022

作者： Kong, Weiyu Wu, Yanmin Qi, Jinli Chen, Yanyi Chongqing Key Lab. of Comp. Sci. and Technology Chongqing University of Posts and Telecommunications ChongQing China ChongQing College of Electronic Engineering Department of Artificial Intelligence and Big Data ChongQing China Chongqing University of Posts and Telecommunications Department of Software Engineering ChongQing China

ISBN: (纸本)9781665487115

This paper presents a granular ball denoising method (GBD) which can effectively improve the accuracy and robustness of classification algorithm. GBD method first uses the self-Adaptive hypersphere to cover the data space, then eliminates the data not contained in the hypersphere and the noise data in the sphere, and finally uses only the hypersphere data for training, so as to reduce the sample data and improve the data quality. Experiments show that using the data obtained by this method for training can greatly improve the accuracy of the classification algorithm. In addition, because the hypersphere has good adaptive ability, GBD also has excellent robustness. The experiment shows that GBD sampling data training can still get good results after adding noise to the data set. Therefore, GBD is an efficient and robust denoising method. © 2022 IEEE.

关键词： Training Cloud computing data integrity Noise reduction Big data Robustness Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

Potential Transmission Choice for Internet of Things(IoT):Wireless and Batteryless Communications and Open Problems

引用

China Communications 2021年第2期18卷 241-249页

作者： Zhan Xu Guanjie Hu Minzheng Jia Lan Dong School of Information and Communication Engineering and with Key Laboratory of Modern Measurement&Control Technology Ministry of EducationBeijing Information Science&Technology UniversityChina Beijing Key Lab of Transportation Data Analysis and Mining School of Computer and Information TechnologyBeijing Jiaotong UniversityBeijingChina Department of Information Engineering Beijing Polytechnic CollegeBeijingChina

The 5th generation mobile communications aims at connecting everything and future Internet of Things(IoT)will get everything smartly *** realize it,there exist many *** key challenge is the battery problem for small devices,such as sensors or *** backscatter,also referred to as or battery-free backscatter,is a new potential technology to address this *** early and typical type of batteryless backscatter is ambient ***,batteryless backscatter utilizes environmental wireless signals to enable battery-free devices to communicate with each *** devices first harvest energy from ambient wireless signals and then backscatter these signals so as to transmit their own *** paper reviews the current studies about batteryless backscatter,including various backscatter schemes and theoretical works,and then introduces open problems for future research.

关键词： batteryless backscatter battery-free channel state information(CSI) channel estimation multiple antennas signal detection symbiotic communication

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic Geometric Latent Diffusion Model for Graph Generation 41

Hyperbolic Geometric Latent Diffusion Model for Graph Genera...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Fu, Xingcheng Gao, Yisen Wei, Yuecen Sun, Qingyun Peng, Hao Li, Jianxin Li, Xianxian Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin China Institute of Artificial Intelligence Beihang University Beijing China School of Software Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing School of Computer Science and Engineering Beihang University Beijing China

Diffusion models have made significant contributions to computer vision, sparking a growing interest in the community recently regarding the application of them to graph generation. Existing discrete graph diffusion models exhibit heightened computational complexity and diminished training efficiency. A preferable and natural way is to directly diffuse the graph within the latent space. However, due to the non-Euclidean structure of graphs is not isotropic in the latent space, the existing latent diffusion models effectively make it difficult to capture and preserve the topological information of graphs. To address the above challenges, we propose a novel geometrically latent diffusion framework HypDiff. Specifically, we first establish a geometrically latent space with interpretability measures based on hyperbolic geometry, to define anisotropic latent diffusion processes for graphs. Then, we propose a geometrically latent diffusion process that is constrained by both radial and angular geometric properties, thereby ensuring the preservation of the original topological properties in the generative graphs. Extensive experimental results demonstrate the superior effectiveness of HypDiff for graph generation with various topologies. Copyright 2024 by the author(s)

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

BIM: Improving Graph Neural Networks with Balanced Influence Maximization 40

BIM: Improving Graph Neural Networks with Balanced Influence...

引用

40th IEEE International Conference on data engineering, ICDE 2024

作者： Zhang, Wentao Gao, Xinyi Yang, Ling Cao, Meng Huang, Ping Shan, Jiulong Yin, Hongzhi Cui, Bin Peking University Center for Machine Learning Research China Institute of Advanced Algorithms Research Shanghai China National Engineering Labratory for Big Data Analytics and Applications The University of Queensland Australia Peking University Key Lab of High Confidence Software Technologies China Apple Inc. Institute of Computational Social Science Peking University Qingdao China

ISBN: (纸本)9798350317152

The imbalanced data classification problem has aroused lots of concerns from both academia and industry since data imbalance is a widespread phenomenon in many real-world scenarios. Although this problem has been well researched from the view of imbalanced class samples, we further argue that graph neural networks (GNNs) expose a unique source of imbalance from the influenced nodes of different classes of labeled nodes, i.e., labeled nodes are imbalanced in terms of the number of nodes they influenced during the influence propagation in GNNs. To tackle this previously unexplored influence-imbalance issue, we connect social influence maximization with the imbalanced node classification problem and propose balanced influence maximization (BIM). Specifically, BIM greedily assigns the pseudo label to the node which can maximize the number of influenced nodes in GNN training while making the influence of each class more balance. Experimental results on five public datasets demonstrate the effectiveness of our method in relieving the influence-imbalance issue. For example, when training a GCN with an imbalance ratio of 0.1, BIM significantly outperforms the most competitive baseline by 0.6% -9.8% in five public datasets in terms of the F1 score. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Individual tree detection and counting based on high-resolution imagery and the canopy height model data

引用

地球空间信息科学学报（英文版） 2024年第6期27卷中插23,2162-2178页

作者： Ye Zhang Moyang Wang Joseph Mango Liang Xin Chen Meng Xiang Li Key Laboratory of Geographic Information Science(Ministry of Education)and School of Geographic Sciences East China Normal UniversityShanghaiChina Department of Transportation and Geotechnical Engineering University of Dar es SalaamDar es salaamTanzania College of Surveying and Geographic Informatics Tongji UniversityShanghaiChina Cadre School of Shanghai Municipal Bureau of Planning and Natural Resources ShanghaiChina School of Ecology and Environmental Sciences East China Normal UniversityShanghaiChina Key Laboratory of Geographic Information Science(Ministry of Education)and School of Geographic Sciences East China Normal UniversityShanghaiChina Shanghai Key Lab for Urban Ecological Processes and Eco-Restoration East China Normal UniversityShanghaiChina Key Laboratory of Spatial-Temporal Big Data Analysis and Application of Natural Resources in Megacities(Ministry of Natural Resources) East China Normal UniversityShanghaiChina

Individual Tree Detection-and-Counting(ITDC)is among the important tasks in town areas,and numerous methods are proposed in this *** their many advantages,still,the proposed methods are inadequate to provide robust results because they mostly rely on the direct field *** paper presents a novel approach involving high-resolution imagery and the Canopy-Height-Model(CHM)data to solve the ITDC *** new approach is studied in six urban scenes:farmland,woodland,park,industrial land,road and residential ***,it identifies tree canopy regions using a deep learning network from high-resolution *** then deploys the CHM-data to detect treetops of the canopy regions using a local maximum algorithm and individual tree canopies using the region ***,it calculates and describes the number of individual trees and tree *** proposed approach is experimented with the data from Shanghai,*** results show that the individual tree detection method had an average overall accuracy of 0.953,with a precision of 0.987 for woodland ***,the R2 value for canopy segmentation in different urban scenes is greater than 0.780 and 0.779 for canopy area and diameter size,*** results confirm that the proposed method is robust enough for urban tree planning and management.

关键词： Individual tree detection-and-counting(ITDC) deep learning high-resolution imagery Canopy Height Model data(CHM)

来源：评论

学校读者我要写书评

暂无评论

Unlearnable 3D Point Clouds: Class-wise Transformation Is All You Need

arXiv

引用

arXiv 2024年

作者： Wang, Xianlong Li, Minghui Liu, Wei Zhang, Hangtao Hu, Shengshan Zhang, Yechao Zhou, Ziqi Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China

Traditional unlearnable strategies have been proposed to prevent unauthorized users from training on the 2D image data. With more 3D point cloud data containing sensitivity information, unauthorized usage of this new type data has also become a serious concern. To address this, we propose the first integral unlearnable framework for 3D point clouds including two processes: (i) we propose an unlearnable data protection scheme, involving a class-wise setting established by a category-adaptive allocation strategy and multi-transformations assigned to samples;(ii) we propose a data restoration scheme that utilizes class-wise inverse matrix transformation, thus enabling authorized-only training for unlearnable data. This restoration process is a practical issue overlooked in most existing unlearnable literature, i.e., even authorized users struggle to gain knowledge from 3D unlearnable data. Both theoretical and empirical results (including 6 datasets, 16 models, and 2 tasks) demonstrate the effectiveness of our proposed unlearnable framework. Our code is available at https://***/CGCL-codes/UnlearnablePC Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Joint Participation Incentive and Network Pricing Design for Federated Learning 42

Joint Participation Incentive and Network Pricing Design for...

引用

42nd IEEE International Conference on Computer Communications, INFOCOM 2023

作者： Ding, Ningning Gao, Lin Huang, Jianwei Northwestern University Department of Electrical and Computer Engineering EvanstonIL60208 United States Shenzhen Research Institute of Big Data Shenzhen518172 China Harbin Institute of Technology Sch. of Electronics and Info. Eng. and the Guangdong Prov. Key Lab. of Aerosp. Commun. and Networking Technol. Shenzhen China The Chinese University of Hong Kong Shenzhen School of Science and Engineering Shenzhen Research Institute of Big Data Shenzhen518172 China

ISBN: (纸本)9798350334142

Federated learning protects users' data privacy though sharing users' local model parameters (instead of raw data) with a server. However, when massive users train a large machine learning model through federated learning, the dynamically varying and often heavy communication overhead can put significant pressure on the network operator. The operator may choose to dynamically change the network prices in response, which will eventually affect the payoffs of the server and users. This paper considers the under-explored yet important issue of the joint design of participation incentives (for encouraging users' contribution to federated learning) and network pricing (for managing network resources). Due to heterogeneous users' private information and multi-dimensional decisions, the optimization problems in Stage I of multi-stage games are non-convex. Nevertheless, we are able to analytically derive the corresponding optimal contract and pricing mechanism through proper transformations of constraints, variables, and functions, under both vertical and horizontal interaction structures of the participants. We show that the vertical structure is better than the horizontal one, as it avoids the interests misalignment between the server and the network operator. Numerical results based on real-world datasets show that our proposed mechanisms decrease server's cost by up to 24.87% comparing with the state-of-the-art benchmarks. © 2023 IEEE.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：