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

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Haorun Ding Xuesong Jiang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Quan Cheng Laboratory Jinan China State Key Laboratory of High-end Server & Storage Technology Jinan China

Post-hoc explanations are important for people to understand the predictions of explanation models. One class of methods in post-hoc explanation is the generation of counterfactuals, where a hypothetical example is obtained by perturbing the inputs to show how one could obtain a different prediction from the decision model. Counter-factual explanations should satisfy several properties: One is that counterfactuals generated under specific scenarios and constraints should be feasible for users, i.e., they should accommodate different causal constraints. The other is that it is more desirable for users to have a wider variety of viable examples, i.e., counterfactual diversity. To this end, we propose a parallelizable method based on gradient optimization. We partition the input feasible domains, perform counterfactual generation independently for each feasible domain, and then parallelize the counterfactual generation process for each feasible domain. Experimental results show that our approach effectively improves the diversity, sparsity, and proximity of the generated counterfactual instances on the public datasets Adult-Income, Lending-Club, German-Credit, and COMPAS compared to other models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Wei Ding Luyao Wang Wei Zhang Myung Jin Lee Ling Wang Kwang Woo Nam Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Industry-University Cooperstion Foundation Chungbuk National University Cheongju Korea School of Computer Science Northeast Electric Power University Jilin China School of Computer Science and Engineering Kunsan National University Gunsan Korea

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

In this paper, we propose a new UAV video similarity measurement algorithm to cluster and analyze UAV videos by measuring the similarity between UAV videos and train them in sub-groups, which in turn improves the efficiency of UAV video data mining. Our preliminary work introduces the maximum common view subsequence (LCVS) to compute the similarity between UAV videos, but LCVS needs to frequently compute the common visible region of video frames generating extremely high time cost. In order to solve the problem of high computational cost of LCVS, we propose a similarity algorithm based on minimum tilted outer rectangle clustering (MTORC) for UAV videos. The MTORC algorithm adopts minimum tilted outer rectangle to cluster the field of view of the marked points in each frame, which reduces the time complexity of calculating the common visible region. By comparing experiments with LCSS and LCVS, the experimental results prove that MTORC is better than the present previous research in terms of algorithm accuracy and time cost.

关键词： Training Visualization Costs Accuracy Clustering algorithms Autonomous aerial vehicles Time measurement

来源：评论

学校读者我要写书评

暂无评论

Map2Schedule: An End-to-End Link Scheduling Method for Urban V2V Communications

Map2Schedule: An End-to-End Link Scheduling Method for Urban...

引用

IEEE International Conference on Communications (ICC)

作者： Lihao Zhang Haijian Sun Jin Sun Ramviyas Parasuraman Yinghui Ye Rose Qingyang Hu School of Electrical and Computer Engineering University of Georgia Athens GA USA School of Computing University of Georgia Athens GA USA Shanxi Key Laboratory of Information Communication Network and Security Xi'an University of Posts & Telecommunications China Electrical and Computer Engineering Department at Utah State University Logan UT USA

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

Urban vehicle-to-vehicle (V2V) link scheduling with shared spectrum is a challenging problem. Its main goal is to find the scheduling policy that can maximize system performance (usually the sum capacity of each link or their energy efficiency). Given that each link can experience interference from all other active links, the scheduling becomes a combinatorial integer programming problem and generally does not scale well with the number of V2V pairs. Moreover, link scheduling requires accurate channel state information (CSI), which is very difficult to estimate with good accuracy under high vehicle mobility. In this paper, we propose an end-to-end urban V2V link scheduling method called Map2Schedule, which can directly generate V2V scheduling policy from the city map and vehicle locations. Map2Schedule delivers comparable performance to the physical-model-based methods in urban settings while maintaining low computation complexity. This enhanced performance is achieved by machine learning (ML) technologies. Specifically, we first deploy the convolutional neural network (CNN) model to estimate the CSI from street layout and vehicle locations and then apply the graph embedding model for optimal scheduling policy. The results show that the proposed method can achieve high accuracy with much lower overhead and latency.

关键词： Wireless communication Accuracy Processor scheduling Computational modeling System performance Urban areas Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Exploiting Meta-Path with Attention Mechanism for Fine-Grained User Location Prediction in LBSNs

Exploiting Meta-Path with Attention Mechanism for Fine-Grain...

引用

2019 3rd International Conference on Data Mining, Communications and information Technology (DMCIT 2019)

作者： Zhixiao Wang Wenyao Yan Wendong Wang Ang Gao Lei Yu Shaobo Yang GaoYang Nie School of Computer Science and Engineering Xi'an University of Technology Telematics Group the University of Goettingen Shaanxi Key Laboratory of Network Computing and Security School of Electronic and Information Engineering Xi'an Jiaotong University College of Xi'an Innovation Yan'an University Yan'an University National Satellite Meteorological Center China Meteorological Administration

Based on the huge volumes of user check-in data in LBSNs,users’ intrinsic mobility patterns can be well explored,which is fundamental for predicting where a user will visit next given his/her historical check-in *** there are various types of nodes and interactions in LBSNs,they can be treated as Heterogeneous information network（HIN） where multiple semantic meta-paths can be *** by the recent success of meta-path context based embedding techniques in HIN,in this paper,we design a deep neural network framework leveraging various meta-path contexts for fine-grained user location *** results based on two real-world LBSN datasets demonstrate the best effectiveness of the proposed approach using various evaluation metrics than others.

关键词：

来源：评论

学校读者我要写书评

暂无评论

$\textsf{LoPub}$ : High-Dimensional Crowdsourced Data Publication With Local Differential Privacy

引用

IEEE Transactions on information Forensics and security 2018年第9期13卷 2151-2166页

作者： Xuebin Ren Chia-Mu Yu Weiren Yu Shusen Yang Xinyu Yang Julie A. McCann Philip S. Yu School of Electronic and Information Engineering Xi’an Jiaotong University Xi’an China Taiwan Information Security Center Taipei Taiwan Department of Computer Science and Engineering National Chung Hsing University Taichung Taiwan Department of Computing Imperial College London London U.K. School of Engineering and Applied Science Aston University Birmingham U.K. Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an China Department of Computer Science University of Illinois at Chicago Chicago IL USA

High-dimensional crowdsourced data collected from numerous users produces rich knowledge about our society; however, it also brings unprecedented privacy threats to the participants. Local differential privacy (LDP), a variant of differential privacy, is recently proposed as a state-of-the-art privacy notion. Unfortunately, achieving LDP on high-dimensional crowdsourced data publication raises great challenges in terms of both computational efficiency and data utility. To this end, based on the expectation maximization (EM) algorithm and Lasso regression, we first propose efficient multi-dimensional joint distribution estimation algorithms with LDP. Then, we develop a local differentially private high-dimensional data publication algorithm (LoPub) by taking advantage of our distribution estimation techniques. In particular, correlations among multiple attributes are identified to reduce the dimensionality of crowdsourced data, thus speeding up the distribution learning process and achieving high data utility. Extensive experiments on real-world datasets demonstrate that our multivariate distribution estimation scheme significantly outperforms existing estimation schemes in terms of both communication overhead and estimation speed. Moreover, LoPub can keep, on average, 80% and 60% accuracy over the released datasets in terms of support vector machine and random forest classification, respectively.

关键词： Privacy Data privacy Servers Correlation Estimation Frequency estimation Sensors

来源：评论

学校读者我要写书评

暂无评论

Active power Control for Off-Shore Wind Turbines Against FDI Attack

Active Power Control for Off-Shore Wind Turbines Against FDI...

引用

IEEE International Conference on Communications in China Workshops (ICCC)

作者： Xuguo Jiao Hao Luo Liuyang Jiang Lin Wang Xin Wang Zuqiang Huang State Key Laboratory of Industrial Control Technology College of Control Science and Engineering Zhejiang University Hangzhou China School of Information and Control Engineering Qingdao University of Technology Qingdao China Zhejiang Windey Co. Ltd. Hangzhou China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Shandong Academy of Sciences Qilu University of Technology Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China School of Civil Engineering Zhengzhou University Zhengzhou China

ISBN: (数字)9798350377675

ISBN: (纸本)9798350377682

Recently, offshore wind power has rapidly developed due to its low environmental interference and abundant wind resources. However, due to its remote geographical location and high demand for communication infrastructure, off-shore wind turbines (OWTs) are vulnerable to potential threats from false data injection (FDI) attack. FDI attack can interfere with active power control strategies by tampering with the rotor speed data measured by sensors and pose a threat to the stability of the power grid. To ensure that OWTs can accurately track the active power instructions set by wind farm's control center under FDI attack, this paper proposes a rotor speed control (RSC) strategy based on Kalman filtering technology (RSC- KF). This strategy can estimate the rotor speed of the wind turbine in real-time, and then a residual detection and compensation mechanism is designed to effectively detect and correct attacked rotor speed information caused by FDI attack. Further, based on the corrected rotor speed, the RSC method is developed, which can flexibly switch control strategies according to different rotor speed values, ensuring the efficient operation of OWTs under different wind speed conditions. The proposed approach's effectiveness is proved via simulations conducted on the OpenFAST platform.

关键词： Filtering Velocity control power control Rotors power system stability Stability analysis Real-time systems Wind turbines Kalman filters Cyberattack

来源：评论

学校读者我要写书评

暂无评论

FEST: Feature Enhancement Swin Transformer for Remote Sensing Image Semantic Segmentation

FEST: Feature Enhancement Swin Transformer for Remote Sensin...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Ronghuan Zhang Jing Zhao Ming Li Qingzhi Zou Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China School of Intelligence and Information Engineering Shandong University of Traditional Chinese Medicine Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

The global context is crucial for the precise segmentation of remote sensing images. However, the large volumes and high spatial resolutions of remote sensing images make efficient analysis of the entire scene challenging for most convolutional neural network (CNN)-based methods. To address this issue, we propose to design an innovative framework for semantic segmentation of remote sensing images called Feature Enhancement Swin Transformer (FEST). Firstly, we utilize the Swin Transformer as the encoder and incorporates a Global information Enhancement Model (GIEM) within each Swin Transformer block to reduce information loss and enable encoding of more accurate spatial information. Secondly, we introduce an enhanced decoding structure called Enhanced Feature Fusion Module (EFFM) with added enhanced channel and spatial attention modules to retain localized information while obtaining extensive contextual information. Finally, for loss calculation, we utilize the dice and cross-entropy loss to jointly supervise the model, aiming to achieve a competitive performance. We comprehensively evaluated FEST on the ISPRS-Vaihingen and Potsdam datasets. The results indicate that our approach has achieved significant improvements in semantic segmentation tasks compared to existing methods.

关键词： Deep learning Federated learning Semantic segmentation Semantics Transformers information retrieval Encoding

来源：评论

学校读者我要写书评

暂无评论

Hybrid Deep Relation Matrix Bidirectional Approach for Relational Triple Extraction

Hybrid Deep Relation Matrix Bidirectional Approach for Relat...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Yushuai Hu Jing Zhao Ming Li Lin Yuan Qingzhi Zou Ronghuan Zhang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China School of Intelligence and Information Engineering Shandong University of Traditional Chinese Medicine Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Relation extraction is a crucial task within information extraction, and numerous models have demonstrated impressive results. However, most of the tagging-based relation triple extraction methods employ unidirectional approaches to extract subjects, objects, and relations, which may overlook crucial information. In this paper, we introduce a novel deep matrix-based bidirectional relation extraction model. Firstly, we extract forward and backward entity pairs. During the bidirectional extraction process,there may be some redundant relationships,so we use a shared encoder to connect and enhance the extraction process. Secondly, we design a low-complexity relation extraction matrix to allocate all possible relations. We assess our model using diverse benchmark datasets, and comprehensive experiments show that our approach effectively addresses subsequent triple extraction issues stemming from entity extraction failures.

关键词： Learning systems Federated learning Computational modeling Benchmark testing information retrieval Data mining Task analysis

来源：评论

学校读者我要写书评

暂无评论

A Design of the Common Platform of Wireless Communication Based on FPGA

A Design of the Common Platform of Wireless Communication Ba...

引用

IEEE Conference on Energy Internet and Energy System Integration

作者： Lei Qiao Zhe Zheng Wenpeng Cui Weilong Zhang Xueping Jiang Research Department of Smart Chip Global Energy Interconnection Research Institute State Grid Key Laboratory of Information & Network Security State Grid Laboratory of Electric Power Communication Network Technology

ISBN: (纸本)9781538614280

We present a design of the common platform of wireless communication based on FPGA. The platform, developed by us, allows researchers to modify transport protocols on any layer of an OSI reference model, from physical layer to application one, thereby it is feasible to implement multiple wireless communication protocols on different layers.

关键词： Wireless communication OFDM FPGA

来源：评论

学校读者我要写书评

暂无评论

FedLRDP: Federated Learning Framework with Local Random Differential Privacy

FedLRDP: Federated Learning Framework with Local Random Diff...

引用

International Joint Conference on Neural networks (IJCNN)

作者： Runtian Zhou Anming Dong Jiguo Yu Qingyan Ding Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China School of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Big Data Institute Qilu University of Technology (Shandong Academy of Sciences) Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Federated learning (FL) is a distributed machine learning framework enabling multiple clients to collaboratively train a shared ML model without sharing raw data. Despite its aim to safeguard data security and privacy, FL faces risks from advanced adversarial attacks like membership inference attack (MIA), potentially leaking sensitive information. To counter these threats, differential privacy (DP) methods add noise to shared model parameters. However, traditional DP methods struggle with balancing model accuracy, training efficiency, and privacy protection, often compromising one for the other. Additionally, uniform DP mechanisms may not cater to varying client privacy and performance needs. To tackle these challenges, we propose a federated learning framework based on localized random differential privacy (FedLRDP). This approach empowers each client to control noise levels based on their privacy requirements, enhancing model performance while preserving data privacy. We further optimize client-side loss functions to enhance model performance. Theoretical analysis establishes the convergence bounds for FedLRDP, demonstrating its superior convergence performance. Experimental results on MNIST reveal that FedLRDP improves model accuracy by 3.28% compared to traditional DP methods while mitigating MIA with a 72.48% lower attack success rate than FedAvg. Moreover, on EMNIST, FedLRDP boosts model accuracy by 7.31% compared to traditional DP methods, maintaining a 59.4% lower attack success rate than FedAvg. These findings underscore FedLRDP’s efficacy in meeting client privacy needs while enhancing model performance.

关键词： Training Differential privacy Privacy Accuracy Federated learning Noise Data models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：