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

Discrimination-Aware Domain Adversarial Neural Network

Journal of Computer Science & Technology 2020年第2期35卷 259-267页

作者： Yun-Yun Wang Jian-Min Gu Chao Wang Song-Can Chen Hui Xue College of Computer Science and Engineering Nanjing University of Posts and Telecommunications Nanjing 210046China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing 210046China College of Computer Science and Technology/College of Artificial Intelligence Nanjing University of Aeronautics and AstronauticsNanjing 210023China Key Laboratory of Pattern Analysis and Machine Intelligence Ministry of Industry and Information Technology Nanjing 210023China School of Computer Science and Engineering Southeast UniversityNanjing 210096China

The domain adversarial neural network(DANN)methods have been successfully proposed and attracted much attention *** DANNs,a discriminator is trained to discriminate the domain labels of features generated by a generator,whereas the generator attempts to confuse it such that the distributions between domains are *** a result,it actually encourages the whole alignment or transfer between domains,while the inter-class discriminative information across domains is not *** this paper,we present a Discrimination-Aware Domain Adversarial Neural Network(DA2NN)method to introduce the discriminative information or the discrepancy of inter-class instances across domains into deep domain ***2NN considers both the alignment within the same class and the separation among different classes across domains in knowledge transfer via multiple *** results show that DA2NN can achieve better classification performance compared with the DANN methods.

关键词： adversarial learning inter-class separation deep neural network discrimination-aware domain adaptation

来源：评论

学校读者我要写书评

暂无评论

Estimating Power Consumption of Containers and Virtual Machines in data Centers

Estimating Power Consumption of Containers and Virtual Machi...

引用

IEEE International Conference on Cluster Computing

作者： Xusheng Zhang Ziyu Shen Bin Xia Zheng Liu Yun Li Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications

ISBN: (数字)9781728166773

ISBN: (纸本)9781728166780

Virtualization technologies provide solutions of 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 effective models for estimating power consumption of virtual machines (VM) have been proposed, few power estimation models of containers have been put forth. In this paper, we offer a fast-training piecewise regression model based on decision tree to build a VM power estimation model and estimate the containers' power by treating the container as a group of processes on the VM. In our model, we characterize the nonlinear relationship between power and features and realize the effective estimation of the containers on the VM. We evaluate the proposed model on 13 workloads in PARSEC and compare it with several models. The experimental results prove the effectiveness of our proposed model on most workloads. Moreover, the estimated power of the containers is in line with expectations.

关键词： Power demand Processor scheduling Estimation Containers Virtual machining data models Virtualization

来源：评论

学校读者我要写书评

暂无评论

A Lexical Updating Algorithm for Sentiment Analysis on Chinese Movie Reviews 5

A Lexical Updating Algorithm for Sentiment Analysis on Chine...

引用

5th International Conference on Advanced Cloud and Big data, CBD 2017

作者： Song, Yiwei Gu, Kaiwen Li, Huakang Sun, Guozi Bell Honor School Nanjing University of Posts and Telecommunications Nanjing China 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: (纸本)9781538610725

With the prevalence of Internet, sentiment analysis gets popularity among the world. Researchers have made use of kinds of online documents like commodities reivews and movie reviews as training samples to train their models and classfiers, by which they could speculate the underlying emotion in new ones. Douban is a Chinese online community where users share their personal reviews to express their feelings about movies. Those Chinese movie reviews were utilized by us to train our lexicon-based model. Yet multiple words in a ready-made lexicon do not agree with the movie reviews in a specific domain, which means the original lexicon acquires being updated to gain higher accuracy. In this paper we introduce a lexical updating algorithm based on a widely used lexicon. After turns of training of updating, this lexicon is capable of classifying sentiment among movie reviews. The experimental result shows our model using the updated lexicon could get a better performance than the primitive lexicon-based model. © 2017 IEEE.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised Deep Closest Point Method for Point Cloud Registration

Semi-supervised Deep Closest Point Method for Point Cloud Re...

引用

2021 International Conference on Robotics Automation and intelligent Control, ICRAIC 2021

作者： Wu, Yong Shen, Lingfeng Li, Ping Jiangsu Power Transmission and Transformation Co. Ltd. Nanjing211106 China College of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China

Point cloud registration is one of the key issues in fields that need 3D scenes with global vision, including 3D scene reconstruction in robot technology, high-accuracy 3D map reconstruction in automatic driving, 3D reconstruction of real-time monitoring underground tunnel. Recently, point cloud registration methods based on deep neural networks have made great progress by learning from a large amount of well-aligned point cloud pairs. However, these large-scale labelled samples are usually difficult to obtain in the real-world applications such as visual simultaneous location and mapping of mobile robots which obtains unlabelled scene images in real time. To solve this problem, we propose a deep point cloud registration method based on the semi-supervised learning. Specifically, for the problem of less supervised data, we use Iterative Closest Point (ICP) algorithm to generate pseudo labels for the point cloud samples with unknown rigid transformations, effectively increasing the number of supervised data;in order to amend the pseudo labels, we design an alternating optimization algorithm to jointly learn the pseudo labels and deep point cloud registration model. The deep point cloud registration model and ICP are used alternately to continuously improve the precision of pseudo labels and the performance of the deep model. Experimental results show that this method can still obtain a reliable point cloud registration model even when just observing a small amount of point cloud samples with ground truth labels. © 2022 Institute of Physics Publishing. All rights reserved.

关键词： Surface measurement

来源：评论

学校读者我要写书评

暂无评论

GNEA: A Novel GCN-based Network Embedding Algorithm for Semantic Social Network 10

GNEA: A Novel GCN-based Network Embedding Algorithm for Sema...

引用

10th International Symposium on System security, Safety, and Reliability, ISSSR 2024

作者： Zhao, Jinbo He, Jinling Du, Yuanhan Tang, Ming Xu, Xiaolong Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China State Grid Jiangsu Electric Power Company Limited Nanjing China Nanjing University of Posts and Telecommunications School of Computer Science Nanjing China

ISBN: (纸本)9798350362930

With the development of semantic social networks, social networks become more complex and their size expands rapidly, which brings significant challenges to social network analysis. Network Embedding can transform the network from a high-dimensional adjacency matrix to a low-dimensional one, which has excellent foreground in link prediction, vertex classification, and graph visualization. Nowadays, most algorithms are proposed for static networks with little consideration of the dynamic changes in the network. However, most real-world networks change over time. Directly applying static network embedding algorithms to dynamic networks will result in poor stability, flexibility, and efficiency. Because of these shortcomings, we propose a graph convolution-based dynamic network representation learning algorithm (GNEA), which combines Graph Convolutional Network (GCN) with Long Short-Term Memory (LSTM) to train the time series networks. GCN is applied to extract features in the network, and LSTM is utilized to capture temporal information. GNEA can not only perform characterization learning on the network but also obtain more abundant information during the dynamic evolution of the network. GNEA is compared with several typical algorithms on the datasets Stochastic Block Model (SBM), Autonomous Systems (AS), and digital Bibliography and Library Project (DBLP). The results prove that GNEA has good performance in MAP and precision@k. © 2024 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Learning Task-aware Robust Deep Learning Systems

arXiv

引用

arXiv 2020年

作者： Han, Keji Li, Yun Long, Xianzhong Ge, Yao Nanjing University of Posts and Telecommunications China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing

Many works demonstrate that deep learning system is vulnerable to adversarial attack. A deep learning system consists of two parts: the deep learning task and the deep model. Nowadays, most existing works investigate the impact of the deep model on robustness of deep learning systems, ignoring the impact of the learning task. In this paper, we adopt the binary and interval label encoding strategy to redefine the classification task and design corresponding loss to improve robustness of the deep learning system. Our method can be viewed as improving the robustness of deep learning systems from both the learning task and deep model. Experimental results demonstrate that our learning task-aware method is much more robust than traditional classification while retaining the accuracy. © 2020, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

A relation prediction method based on PU learning

A relation prediction method based on PU learning

引用

International Conference on intelligent System and Knowledge Engineering, ISKE

作者： Gao-Jing Peng Ke-Jia Chen Shijun Xue Bin Liu Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing Jiangsu China

This paper studies relation prediction in heterogeneous information networks under PU learning context. One of the challenges of this problem is the imbalance of data number between the positive set P (the set of node pairs with the target relation) and the unlabeled set U (the set of node pairs without the target relation). We propose a K-means and voting mechanism based technique SemiPUclus to extract the reliable negative set RN from U under a new relation prediction framework PURP. The experimental results show that PURP achieves better performance than comparative methods in DBLP co-authorship network data.

关键词： Reliability Artificial neural networks Clustering algorithms Algorithm design and analysis Prediction methods Sun

来源：评论

学校读者我要写书评

暂无评论

An optimal profit route planning scheme based on ACO-OPP 21

An optimal profit route planning scheme based on ACO-OPP

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Qiu, Yuhua Xu, Xiaolong Xia, Fei Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Information and communication Branch State Grid Jiangsu Electric Power Company Nanjing China

ISBN: (纸本)9781728120584

Taxi plays an important role of urban public transportation system. However, without appropriate route planning scheme, taxi drivers can only choose to wait or seek passengers in the absence of orders, leading to wasting a lot of time and fuel. In this paper, an optimal profit route planning scheme for taxi drivers with Ant Colony Optimization Algorithm based on Optimal Profit Points (ACO-OPP) is proposed. First, the taxi trajectory data are preprocessed and the pick-up and drop-off points are extracted to obtain high-quality data;second, the data spatiotemporal distribution is analyzed to plan a more appropriate and rational route;the clustering algorithm is used to obtain the optimal profit points to increase the occupancy rate of taxis;then, ACO-OPP is utilized to plan the profit routes for each taxi. A series of experiments are implemented based on the real taxi trajectory dataset to test and compare the performance of the simulated annealing algorithm, the genetic algorithm, the ant colony algorithm and ACO-OPP on the optimal route length and the profitability with the unit time profit function. The experimental results show that ACO-OPP has the shortest optimal route length and the best profit per unit time. © 2019 IEEE.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

A Point Cloud Registration Method for Substations Based on an Improved SAC-IA Algorithm

A Point Cloud Registration Method for Substations Based on a...

引用

2023 China Automation Congress, CAC 2023

作者： Wang, Lei Chen, Yiping Zong, Haonan Wang, Lulu Yin, Jun School of Computer Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China School of Internet of Things Nanjing University of Posts and Telecommunications Nanjing210023 China

ISBN: (纸本)9798350303759

This paper proposes a point cloud registration method for substations based on an improved SAC-IA algorithm. This method optimizes the SAC-IA algorithm by filtering the randomly selected point pairs to ensure that the triangles formed by the selected points in the model and scene point clouds have certain similarities. Furthermore, the registration error judgment of the SAC-IA algorithm has been improved. In addition to using the Euclidean distance between the registered model and scene point clouds as the judgment standard, this method also considers the SHOT difference and average curvature difference. Successful registration is only considered when all three standards are satisfied. The experimental research shows that the time performance of this method is twice as high as that of the traditional SAC-IA algorithm on average, and the recognition accuracy is improved in the recognition results. © 2023 IEEE.

关键词： Electric substations

来源：评论

学校读者我要写书评

暂无评论

CROA: A content-based recommendation optimization algorithm for personalized knowledge services 21

CROA: A content-based recommendation optimization algorithm ...

引用

作者： Sun, Xiao Xu, Xiaolong Xia, Fei Jiangsu Key Laboratory Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Information and communication Branch State Grid Jiangsu Electric Power Company Nanjing China

ISBN: (纸本)9781728120584

Information explosion is a typical feature of the Big data. Learners can easily find a wide variety of knowledge information online. However, the expansion of information also makes it difficult for learners to retrieve the information they want and fall into the problem of knowledge overload. In order to solve this problem effectively, we propose a content-based recommendation optimization algorithm for personalized knowledge services (CROA). First, the feature vector model is established, where each item information is represented by specific words and key information is highlighted by weighting. Second, a dynamic user vector model is then established to capture the latest preference information of the user. Finally, the feature vector model is combined with the multi-user comparison results thereby obtaining a list of recommendations. Experimental results indicate that CROA outstands in knowledge recommendation mechanism and can also alleviate knowledge overload. © 2019 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：