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

International Conference on intelligent System and Knowledge Engineering, ISKE

作者： Yixiong Bian Huakang Li Jiangsu Key Lab of Big Data and Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China

With the rapid development of the internet, applications of recommendation systems for online shops and entertainment platforms become more and more popular. In order to improve the effectiveness of recommendation, external information has been incorporated into various algorithms, such as location and social relationship. However, most algorithms only focus on the introduction of external information without depth analysis of the intrinsic mechanism in the external information. This paper proposed a transfer model of social trusted relationship, and optimized the reliability of the transfer model using pruning algorithm based on original trust recommendation. A credible social relationship macro-transfer model based on iterations of new credible relationships is defined by the similarity of social relationships. With a certain interest topic as a source of information, a micro-transfer model achieves the theme of interest and credibility of the expansion using social information dissemination algorithm. To demonstrate the effectiveness of the macro and micro credible transfer models, we used the Mantra search tree pruning algorithm and the optimization algorithm of similar category replacing similar products. The experimental results show that the proposed method based on the macroscopic and microscopic transfer models of the trusted relationship enhances the success rate and stability of the recommended system.

关键词： Collaboration Reliability Social network services Heuristic algorithms Optimization System performance Convergence

来源：评论

学校读者我要写书评

暂无评论

Privacy Protection for Image Sharing Using Reversible Adversarial Examples

Privacy Protection for Image Sharing Using Reversible Advers...

引用

IEEE International Conference on Communications (ICC)

作者： Ping Yin Wei Chen Jiaxi Zheng Yiting Zhang Lifa Wu School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

Online image sharing on social media platforms faces information leakage due to deep learning-aided privacy attacks. To avoid these attacks, this paper proposes a privacy protection mechanism for image sharing without changing the visual effect, which is based on reversible adversarial examples. Specifically, social media platform users can change the class activation feature to convert the original image into an adversarial image before sharing. When users want to restore the adversarial image to the original image, they can use an improved generative adversarial network model to restore it. The experimental results prove that the conversion model in this paper can effectively prevent privacy attacks from analyzing and stealing users' private information while having no visual impact. At the same time, the proposed restoration model can restore the adversarial examples with high accuracy.

关键词： Training Privacy Image recognition Social networking (online) Perturbation methods Visual effects Information leakage

来源：评论

学校读者我要写书评

暂无评论

Application of C4.5 decision tree for scholarship evaluations

引用

Procedia Computer Science 2019年 151卷 179-184页

作者： X. Wang C. Zhou X. Xu College of Overseas Education Nanjing University of Posts and Telecommunications Nanjing 210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing 210023 China

Under the global trend of modern quality education, the set of higher educational scholarship is aimed to reward the students who work hard both inside and outside class activities and achieve great success in kinds of academic competitions. At this time, with great emphasis by governments and outstanding construction on the educational infrastructure, the number of students in universities has been increasing dramatically. Meanwhile, during the development of the education in such a long period, universities generally accumulate a huge amount of the information concerned with the students. What the administrators always do to handle such information are merely storing, querying and doing some other basic manipulations instead of making full use of these data. For example, those manual evaluations of the educational scholarship always revolve around the rank of scholarship and the number of the students who are rewarded rather than analyzing the facts which can influence the achieving of the scholarship. As a result, the evaluation is apparently lack of fairness and efficiency. In this paper, based on C4.5 decision tree, a higher educational scholarship evaluation model is built. By using such algorithm, an efficient and fair scholarship evaluation system can be realized.

关键词： C4.5 Decision Tree Scholarship Evaluation data Mining

来源：评论

学校读者我要写书评

暂无评论

Resource allocation for secure communications in cooperative cognitive wireless powered communication networks

arXiv

引用

arXiv 2018年

作者： Xu, Ding Li, Qun Wireless Communication Key Lab of Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing210003 China Jiangsu Key Lab of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210046 China

We consider a cognitive wireless powered communication network (CWPCN) sharing the spectrum with a primary network who faces security threats from eavesdroppers (EAVs). We propose a new cooperative protocol for the wireless powered secondary users (SU) to cooperate with the primary user (PU). In the protocol, the SUs first harvest energy from the power signals transmitted by the cognitive hybrid access point during the wireless power transfer (WPT) phase, and then use the harvested energy to interfere with the EAVs and gain transmission opportunities at the same time during the wireless information transfer (WIT) phase. Taking the maximization of the SU ergodic rate as the design objective, resource allocation algorithms based on the dual optimization method and the block coordinate descent method are proposed for the cases of perfect channel state information (CSI) and collusive/noncollusive EAVs under the PU secrecy constraint. More PU favorable greedy algorithms aimed at minimizing the PU secrecy outage probability are also proposed. We furthermore consider the unknown EAVs' CSI case and propose an efficient algorithm to improve the PU security performance. Extensive simulations show that our proposed protocol and corresponding resource allocation algorithms can not only let the SU gain transmission opportunities but also improve the PU security performance even with unknown EAVs' CSI. Copyright © 2018, The Authors. All rights reserved.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

Maximum Likelihood Estimation based on Random Subspace EDA: Application to extrasolar planet detection

arXiv

引用

arXiv 2017年

作者： Liu, Bin Chen, Ke-Jia School of Computer Science Nanjing University of Posts and Telecommunications Nanjing Jiangsu210023 China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing Jiangsu210023 China

This paper addresses maximum likelihood (ML) estimation based model fitting in the context of extrasolar planet detection. This problem is featured by the following properties: 1) the candidate models under consideration are highly nonlinear;2) the likelihood surface has a huge number of peaks;3) the parameter space ranges in size from a few to dozens of dimensions. These properties make the ML search a very challenging problem, as it lacks any analytical or gradient based searching solution to explore the parameter space. A population based searching method, called estimation of distribution algorithm (EDA), is adopted to explore the model parameter space starting from a batch of random locations. EDA is featured by its ability to reveal and utilize problem structures. This property is desirable for characterizing the detections. However, it is well recognized that EDAs can not scale well to large scale problems, as it consists of iterative random sampling and model fitting procedures, which results in the well-known dilemma curse of dimensionality. A novel mechanism to perform EDAs in interactive random subspaces spanned by correlated variables is proposed and the hope is to alleviate the curse of dimensionality for EDAs by performing the operations of sampling and model fitting in lower dimensional subspaces. The effectiveness of the proposed algorithm is verified via both benchmark numerical studies and real data analysis. Copyright © 2017, The Authors. All rights reserved.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

A Privacy-preserving and Collusion-resisting Top-k Query processing in WSNs

A Privacy-preserving and Collusion-resisting Top-k Query Pro...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Jianguo Zhou Hua Dai Jie Zhu Rongqi Qi Geng Yang Jian Xu Nanjing University of Post and Telecommunication Nanjing China Jiangsu Security and Intelligent Processing Lab of Big Data Nanjing University of Post and Telecommunication Nanjing China

ISBN: (数字)9781728199160

ISBN: (纸本)9781728192369

In the wireless sensor networks, it is a challenging issue to protect the data privacy from curious users while providing top-k query services. In this paper, a novel privacy-preserving and collusion-resisting top-k query processing interactive protocol is proposed for WSNs. To the best of our knowledge, it is the first work providing the privacy preservation and collusion resistance simultaneously in top-k query processing in WSNs. data encryption with different private keys, the bloom filter and HMAC are adopted to achieve data privacy preservation even there are a few sensors colluding with the adversaries. During the interactive procedures of the query processing, two rounds of secure interactions between the sink and sensors are performed to obtain the query results. The protocol analysis indicates that the protocol can preserve data privacy even a few sensors collude with the adversaries, while the experiment result shows that the proposed protocol has good performance on network communication cost.

关键词： Wireless communication Wireless sensor networks data privacy Protocols Query processing Sensors Encryption

来源：评论

学校读者我要写书评

暂无评论

Implementation and performance op timization of dynamic random forest

Implementation and performance op timization of dynamic rand...

引用

第九届网络分布式计算与知识发现国际会议( 2017 International Conference on Cyber-enabled distributed computing and knowledge discovery)

作者： Xiaolong Xu Wen Chen School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and

Bernard combines the weight updating of the boosting algorithm with the Random Forest(RF),and proposes a new RF induction algorithm called Dynamic Random Forest(DRF).The idea with DRF is to grow only trees that would fit the sub-forest already built,use the existing forest to update the weight of each randomly selected training instance,force the next tree to pay attention to those samples that can not be classified well by the current forest,thus improving the RF ***,this weight updating method is still flawed,which does not make a good distinction between the samples classified correctly and the samples classified wrongly by the current *** this paper,we implement the DRF algorithm,and propose a new weight update method,that is,giving higher weight to the samples classified wrongly by the current forest,giving lower weight to the samples classified correctly by the current forest,so that the next tree will be more concerned with those misclassified *** results show that our method is better than DRF algorithm and traditional RF algorithm.

关键词： Random forest Boosting Dynamic random forest Weight updating

来源：评论

学校读者我要写书评

暂无评论

PM$^{2}$2VE: Power Metering Model for Virtualization Environments in Cloud data Centers

引用

IEEE Transactions on Cloud Computing 2023年第3期11卷 3126-3138页

作者： Ziyu Shen Xusheng Zhang Zheng Liu Yun Li School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory for Big Data Security and Intelligent Processing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

Virtualization technologies provide solutions for cloud computing. Virtual resource scheduling is a crucial task in data centers, and the power consumption of virtual resources is a critical foundation of virtualization scheduling. Containers are the smallest unit of virtual resource scheduling and migration. Although many practical models for estimating the power consumption of virtual machines (VMs) have been proposed, few power estimation models of containers have been put forth. In this article, we propose a fast-training piecewise regression model based on a decision tree for VM power metering and estimate the power of containers configured on the VM by treating the container as a group of processes on the VM. We select appropriate features from the collected metrics of VMs/containers to help our model fit the nonlinear relationship between power and features well. Besides, we optimize the leaf nodes of the regression tree, realizing the effective power metering of virtualization environments. We evaluate the proposed model on 13 tasks in PARSEC and compare it with several commonly used models in data centers. The experimental results prove the effectiveness of the proposed model, and the estimated power of containers is in line with expectations.

关键词： Containers data centers Power demand Estimation data models Virtualization Servers

来源：评论

学校读者我要写书评

暂无评论

SCAlabLE ATTRIBUTION OF ADVERSARIAL ATTACKS VIA MULTI-TASK LEARNING

arXiv

引用

arXiv 2023年

作者： Guo, Zhongyi Han, Keji Ge, Yao Ji, Wei Li, Yun Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

Deep neural networks (DNNs) can be easily fooled by adversarial attacks during inference phase when attackers add imperceptible perturbations to original examples, i.e., adversarial examples. Many works focus on adversarial detection and adversarial training to defend against adversarial attacks. However, few works explore the tool-chains behind adversarial examples, which can help defenders to seize the clues about the originator of the attack, their goals, and provide insight into the most effective defense algorithm against corresponding attacks. With such a gap, it is necessary to develop techniques that can recognize tool-chains that are leveraged to generate the adversarial examples, which is called Adversarial Attribution Problem (AAP). In this paper, AAP is defined as the recognition of three signatures, i.e., attack algorithm, victim model and hyperparameter. Current works transfer AAP into single label classification task and ignore the relationship between these signatures. The former will meet combination explosion problem as the number of signatures is increasing. The latter dictates that we cannot treat AAP simply as a single task problem. We first conduct some experiments to validate the attributability of adversarial examples. Furthermore, we propose a multi-task learning framework named Multi-Task Adversarial Attribution (MTAA) to recognize the three signatures simultaneously. MTAA contains perturbation extraction module, adversarial-only extraction module and classification and regression module. It takes the relationship between attack algorithm and corresponding hyperparameter into account and uses the uncertainty weighted loss to adjust the weights of three recognition tasks. The experimental results on MNIST and ImageNet show the feasibility and scalability of the proposed framework as well as its effectiveness in dealing with false alarms. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Sequential monte carlo method for bayesian multiple testing of pairwise interactions among large number of neurons 14

Sequential monte carlo method for bayesian multiple testing ...

引用

14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2018

作者： Liu, Bin Vinci, Giuseppe Snyder, Adam C. Kass, Robert E. School of Computer Science Jiangsu Key Lab of Big Data Security Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China Department of Statistics Rice University Houston United States Visual Neuroscience Lab University of Pittsburgh Pittsburgh United States Basis of Cognition Carnegie Mellon University Machine Learning Department Center for the Neural Department of Statistics Pittsburgh United States

ISBN: (纸本)9781538680971

The problem of multiple testing arises in many contexts, including testing for pairwise interaction among a large number of neurons. Recently a method was developed to control false positives when covariate information, such as distances between pairs of neurons, is available. This method, however, relies on computationally-intensive Markov Chain Monte Carlo (MCMC). Here we develop an alternative, based on Sequential Monte Carlo, which only requires one pass of the data. This scheme considers data items sequentially, with relevant probabilities being updated at each step. Simulation experiments demonstrate that the proposed algorithm delivers results as accurately as the previous MCMC method. We illustrate the method by using it to analyze neural recordings from extrastriate cortex in a macaque monkey. © 2018 IEEE.

关键词： Neurons

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：