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

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Lei, Dehao Yu, Zhiyong Li, Peiguan Han, Lei Huang, Fangwan College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou China

ISBN: (纸本)9783030642426

Air quality is widely concerned by the governments and people. To save cost, air quality monitoring stations are deployed at only a few locations, and the stations are actuated at partial time. Therefore, it is necessary to study how to actively collect a subset of air quality data to maximize the estimation accuracy of air quality at other locations and time. In order to solve this challenge, we propose the active variational adversarial model (AVAM) that selects the most valuable unlabeled samples through two iterative phases of active learning. In the first phase of our model, a candidate set with unlabeled samples is selected through traditional active learning. In the second phase, variational auto-encoder (VAE) is used to obtain the compressed representation of the candidate set and the training set with labeled samples, then a discriminator based on three-layer neural network is trained from the compressed representation. Finally the discriminator can output the most valuable unlabeled samples from the candidate set. The experimental results show that the AVAM proposed in this paper is superior to active learning models with the first or second phase only. © 2020, Springer Nature Switzerland AG.

关键词： Air quality

来源：评论

学校读者我要写书评

暂无评论

An Improved Sparse Representation Classifier Based on Data Augmentation for Time Series Classification 15th

An Improved Sparse Representation Classifier Based on Data A...

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Lu, Juhong Huang, Fangwan Yu, Zhiyong College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou China

ISBN: (纸本)9783030642426

Sparse Representation-based Classification (SRC), which has achieved good performance in face recognition and other image classification, has been successfully extended to time series classification in recent years. As a generalization of the nearest subspace classifier, the performance of SRC depends on a rich set of training samples for each class, which can span as many variations of each class as possible under testing conditions. However, due to the difficulty of sample collection, many important applications can only provide a few or even a single sample for each class, which inevitably affects the performance of SRC. To address the problem of insufficient training samples, ESRC (Extended SRC) was proposed to put some samples that reflect the variations within the class into the dictionary, to obtain better generalization ability than SRC for under-sampled face recognition. In this paper, a new approach IESRC (Improved extend sparse representation based classification) is developed by splitting the dictionary into an original dictionary and auxiliary dictionary. The proposed model was first evaluated in 30 baseline data sets in the University of California, Riverside time series classification archive and then applied to classify the effects of aerobic exercise intervention in 24 young hypertensive patients based on the time series of the cardiopulmonary exercise test. Experimental results show that the proposed model can achieve better performance than SRC and ESRC in time series classification. © 2020, Springer Nature Switzerland AG.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Learnable Graph Convolutional network and Feature Fusion for Multi-view Learning

arXiv

引用

arXiv 2022年

作者： Chen, Zhaoliang Fu, Lele Yao, Jie Guo, Wenzhong Plant, Claudia Wang, Shiping College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China Faculty of Computer Science University of Vienna Vienna1090 Austria Research Network Data Science @ Uni Vienna University of Vienna Vienna1090 Austria

In practical applications, multi-view data depicting objectives from assorted perspectives can facilitate the accuracy increase of learning algorithms. However, given multi-view data, there is limited work for learning discriminative node relationships and graph information simultaneously via graph convolutional network that has drawn the attention from considerable researchers in recent years. Most of existing methods only consider the weighted sum of adjacency matrices, yet a joint neural network of both feature and graph fusion is still under-explored. To cope with these issues, this paper proposes a joint deep learning framework called Learnable Graph Convolutional network and Feature Fusion (LGCN-FF), consisting of two stages: feature fusion network and learnable graph convolutional network. The former aims to learn an underlying feature representation from heterogeneous views, while the latter explores a more discriminative graph fusion via learnable weights and a parametric activation function dubbed Differentiable Shrinkage Activation (DSA) function. The proposed LGCN-FF is validated to be superior to various state-of-the-art methods in multi-view semi-supervised classification. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

X-Architecture Steiner Minimal Tree Construction Based on Discrete Differential Evolution 15th

X-Architecture Steiner Minimal Tree Construction Based on Di...

引用

15th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2019, co-located with the 5th International Conference on Harmony Search, Soft computing and Applications, ICHSA 2019

作者： Wu, Hailin Xu, Saijuan Zhuang, Zhen Liu, Genggeng College of Mathematics and Computer Sciences Fuzhou University Fuzhou350116 China Department of Information Engineering Fujian Business University Fuzhou350012 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China

ISBN: (纸本)9783030324551

As the best connection model for the multi-pin net of the non-Manhattan architecture global routing problem, the X-architecture Steiner Minimum Tree (XSMT) construction is a Non-deterministic Polynomial hard (NP-hard) problem. The Differential Evolution (DE) algorithm has shown good application effect in solving various NP-hard problems. For this reason, based on the idea of DE algorithm, this paper proposes an XSMT construction algorithm for solving this problem. First of all, because the traditional DE algorithm is designed for continuous problems, the optimization ability is limited in solving discrete problems. This paper proposes a novel crossover operator and mutation operator. At the same time, in order to maintain the effectiveness of the evolutionary algorithm, an Edge-to-Point coding strategy suitable for evolutionary algorithms is proposed to better preserve the optimal substructure of the population. Finally, in order to speed up the convergence speed and quality of the algorithm, this paper proposes an initial solution based on the minimum tree generation algorithm. Experiments show that the effectiveness of the proposed algorithm and related strategies can construct a high-quality XSMT solution. © Springer Nature Switzerland AG, 2020.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

A Time-Driven Cloudlet Placement Strategy for Workflow Applications in Wireless Metropolitan Area networks

Research Square

引用

Research Square 2021年

作者： Zhang, Jianshan Li, Ming Zheng, Xianghan Hsu, Ching-Hsien College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory Network Computing and Intelligent Information Processing Fuzhou China Department of Computer Science and Information Engineering Asia University Taichung Taiwan

With the rapid development of mobile technology, mobile applications have increasing requirements for computational resources, and mobile devices can no longer meet these requirements. Mobile edge computing (MEC) has emerged in this context and has brought innovation into the working mode of traditional cloud computing. By provisioning edge server placement, the computing power of the cloud centre is distributed to the edge of the network. The abundant computational resources of edge servers compensate for the lack of mobile devices and shorten the communication delay between servers and users. Constituting a specific forms of edge servers, cloudlets have been widely studied within academia and industry in recent years. However, existing studies have mainly focused on computation offloading for general computing tasks under fixed cloudlet placement positions. They ignored the impact on computation offloading results from cloudlet placement positions and data dependencies among mobile application components. In this paper, we study the cloudlet placement problem based on Workflow Applications (WAs) in Wireless Metropolitan Area networks (WMANs). We devise a cloudlet placement strategy based on a Particle swarm optimization algorithm using Genetic algorithm operators with the Encoding Library updating mode (PGEL), which enables the cloudlet to be placed in appropriate positions. The simulation results show that the proposed strategy can obtain a near-optimal cloudlets placement scheme, and compared with other classic algorithms, this algorithm can reduce the execution time of WAs by 15.04%-44.99%. © 2021, CC BY.

关键词： computation offloading

来源：评论

学校读者我要写书评

暂无评论

Abnormal network Traffic Detection based on Leaf Node Density Ratio 2019

Abnormal Network Traffic Detection based on Leaf Node Densit...

引用

Proceedings of the 2019 the 9th International Conference on Communication and network Security

作者： Huajun Liu Zhanghui Liu Yanhua Liu Xiaoling Gao College of Mathematics and Computer Science Fuzhou University Fuzhou Fujian China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou Fujian China College of Mathematics and Computer Science Fuzhou University Fuzhou Fujian China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou Fujian China

ISBN: (纸本)9781450376624

As the network evolves, cyber-attacks become more and more diverse. In the process of detecting network traffic, the most complicated but also the most important task is to find unknown abnormal network traffic data in time. In the existing abnormal network traffic detection method based on Extended Isolation Forest, there are limitations such as unbalanced detection accuracy and insufficient generalization ability. An improved abnormal network traffic detection method EIF-LNDR is proposed for the above problems. Based on the leaf node density ratio, the anomaly score of the instance can be calculated differently for each iTree. The experiments show that EIF-LNDR has significant improvement in precision, false negative rate, and detector efficiency compared with Extended Isolation Forest and LOF methods.

关键词： leaf node density ratio extended Isolation Forest network traffic data mining cyber attack Abnormal detection

来源：评论

学校读者我要写书评

暂无评论

Mobile Crowd-Sensing System Based on Participant Selection 15th

Mobile Crowd-Sensing System Based on Participant Selection

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Tu, Chunyu Han, Lei Wang, Leye Yu, Zhiyong College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou China Key Lab of High Confidence Software Technologies Peking University Beijing China

ISBN: (纸本)9783030642426

Mobile Crowdsensing (MCS) is often accompanied by various adverse objectives when performing data collection, which makes it difficult to collect accurate data of the entire target area with low cost. Therefore, how to collect a small part of the data to accurately infer the other data of the entire target area is a crucial issue. People’s daily trajectories usually follow a certain pattern, for example, students go to school, company employees go to work. This pattern allows us to find participants who often pass through fixed areas within a certain time span, leading their collected partial data are near optimal for the entire data collection task. This paper models the problem and develops multiple methods to improve the participant selection and the data recovery. Particularly, we use a random method, reinforcement learning, and greedy algorithm to handle this problem and compare the differences among these methods by experiments. © 2020, Springer Nature Switzerland AG.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A Cost-Driven Fuzzy Scheduling Strategy for Intelligent Workflow Decision Making Systems in Uncertain Edge-Cloud Environments

arXiv

引用

arXiv 2021年

作者： Lin, Bing Lin, Chaowei Chen, Xing College of Physics and Energy Fujian Normal University Fujian Provincial Key Laboratory of Quantum Manipulation and New Energy Materials Fuzhou350117 China Fujian Provincial Collaborative Innovation Center for Advanced High-Field Superconducting Materials and Engineering Fuzhou350117 China School of Computer Science Peking University 100871 China College of Mathematics and Computer Science Fuzhou University Fuzhou350118 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350118 China

Workflow decision making is critical to performing many practical workflow applications. Scheduling in edge-cloud environments can address the high complexity problem of workflow applications, while decreasing the data transmission delay between the cloud and end devices. However, because of the heterogeneous resources in edge-cloud environments and the complicated data dependencies among the tasks in a workflow, significant challenges for workflow scheduling remain, including the selection of an optimal tasks-servers solution from the possible numerous combinations. The existing studies have been mainly done subject to rigorous conditions without fluctuations, ignoring the fact that workflow scheduling is typically present in uncertain environments. In this study, we focus on reducing the execution cost of workflow applications mainly caused by task computation and data transmission, while satisfying the workflow deadline in uncertain edge-cloud environments. The Triangular Fuzzy Numbers (TFNs) are adopted to represent the task processing time and data transferring time. A cost-driven fuzzy scheduling strategy based on an Adaptive Discrete Particle Swarm Optimization (ADPSO) algorithm is proposed, which employs the operators of Genetic Algorithm (GA). This strategy introduces the randomly two-point crossover operator, neighborhood mutation operator, and adaptive multipoint mutation operator of GA to effectively avoid converging on local optima. The experimental results show that our strategy can effectively reduce the workflow execution cost in uncertain edge-cloud environments, compared with other benchmark solutions. Copyright © 2021, The Authors. All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Assessment Method of Asset Importance for key Asset Protection 2019

A Comprehensive Assessment Method of Asset Importance for Ke...

引用

Proceedings of the 2019 the 9th International Conference on Communication and network Security

作者： Xiaoling Gao Yanhua Liu Yanbin Qiu Huajun Liu College of Mathematics and Computer Science Fuzhou University Fuzhou Fujian China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou Fujian China

ISBN: (纸本)9781450376624

In a given system network, an important prerequisite for security risk control is how to accurately calculate the impact of different host assets in the topology on the spread of attack risk. In this regard, we propose a comprehensive asset importance assessment model for critical asset protection. First, the importance of local static assets in the topology was evaluated using three methods: degree centrality, mediation centrality, and closeness centrality. At the same time, PageRank was used to assess the importance of local dynamic assets for asset level changes. By combining the above two methods, and using K-CORE to evaluate the core position of the host in the network topology as the global weight indicator of the importance of assets. The comprehensive evaluation results of the importance of topology-oriented assets was finally obtained, and the validity of the model was verified through the experiment of the simulation ER random network.

关键词： Centrality PageRank Asset importance key asset protection K-CORE

来源：评论

学校读者我要写书评

暂无评论

Attack intent analysis method based on attack path graph 9

Attack intent analysis method based on attack path graph

引用

9th International Conference on Communication and network Security, ICCNS 2019

作者： Chen, Biqiong Liu, Yanhua Li, Shijin Gao, Xiaoling College of Mathematics and Computer Science Fuzhou University Fuzhou Fujian China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou Fujian China

ISBN: (纸本)9781450376624

With the rapid development of network technology, network security problems are gradually increasing, and the network attack situation is very severe. In a complex attack scenario, timely detection of potential attack behaviors and timely identification and pre-judgment of attack intentions are important components of security risks. However, the attack behavior in the network presents complexity, multi-step and uncertainty, which brings new technical challenges to attack intent analysis. Aiming at the problem that the attack intention of multi-step complex attack is difficult to identify, this paper proposes an attack intention analysis method based on attack path graph. Firstly, aiming at the multi-step complex attack behavior analysis problem, the key asset assessment technology is used to find out the key assets in the network system, and the hypothetical attack intention is generated according to the security protection requirements of the network system. Then, it is difficult to manually construct the attack path map in the large-scale network, and the automatic generation of the attack path map is realized. Finally, a method of network attack intent identification is proposed and a calculation method of attack intent probability is designed, which improves the efficiency and accuracy of attack intent recognition. © 2019 Association for computing Machinery.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：