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

arXiv 2020年

作者： Li, Zhen Zou, Deqing Xu, Shouhuai Chen, Zhaoxuan Zhu, Yawei Jin, Hai The National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Big Data Security Engineering Research Center School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China School of Cyber Security and Computer Hebei University Baoding071002 China The Department of Computer Science University of Colorado Colorado Springs CO80918 United States University of Texas San Antonio United States

Automatically detecting software vulnerabilities is an important problem that has attracted much attention from the academic research community. However, existing vulnerability detectors still cannot achieve the vulnerability detection capability and the locating precision that would warrant their adoption for real-world use. In this paper, we present a vulnerability detector that can simultaneously achieve a high detection capability and a high locating precision, dubbed Vulnerability Deep learning-based Locator (VulDeeLocator). In the course of designing VulDeeLocator, we encounter difficulties including how to accommodate semantic relations between the definitions of types as well as macros and their uses across files, how to accommodate accurate control flows and variable define-use relations, and how to achieve high locating precision. We solve these difficulties by using two innovative ideas: (i) leveraging intermediate code to accommodate extra semantic information, and (ii) using the notion of granularity refinement to pin down locations of vulnerabilities. When applied to 200 files randomly selected from three real-world software products, VulDeeLocator detects 18 confirmed vulnerabilities (i.e., true-positives). Among them, 16 vulnerabilities correspond to known vulnerabilities;the other two are not reported in the national Vulnerability database (NVD) but have been "silently" patched by the vendor of Libav when releasing newer versions. Copyright © 2020, The Authors. All rights reserved.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

RNC: Reliable network property classifier based on graph embedding 20

RNC: Reliable network property classifier based on graph emb...

引用

20th International Conference on Parallel and Distributed computing, Applications and Technologies, PDCAT 2019

作者： Liao, Hao Liu, Qixin Vidmer, Alexandre Zhou, Mingyang Mao, Rui National Engineering Laboratory for Big Data System Computing Technology Guangdong Province Key Laboratory of Popular High Performance Computers College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China

ISBN: (数字)9781728126166

ISBN: (纸本)9781728126166

In the past two decades, analyzing the information network has been intensively studied from various disciplines. Small world property and scale-free property prevail in network science research. The comparison and classification of different kinds of graphs are extremely important. However, how to design a robust and accurate classification with deep learning techniques for network property still lack enough attention, which is a vital task in various application scenarios. In this paper, we proposed the reliable network property classifier based on graph embedding(RNC) to classify the network property (scale free or small world property). In order to process non-euclidean data, we embedded each network into an image and use dimensional reduction, rasterization, and convolutional neural networks to complete the classification problem. The method can effectively accomplish classification tasks in not only artificial networks but also real networks. Besides, RNC wins greatly in terms of robustness on real networks, showing the robustness of RNC against the incomplete structure of the network. © 2019 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Context aware 3d unet for brain tumor segmentation

arXiv

引用

arXiv 2020年

作者： Ahmad, Parvez Qamar, Saqib Shen, Linlin Saeed, Adnan National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China School of Hydropower and Information Technology Huazhong University of Science and Technology Wuhan430074 China

Deep convolutional neural network (CNN) achieves remarkable performance for medical image analysis. UNet is the primary source in the performance of 3D CNN architectures for medical imaging tasks, including brain tumor segmentation. The skip connection in the UNet architecture concatenates features from both encoder and decoder paths to extract multi-contexual information from image data. The multi-scaled features play an essential role in brain tumor segmentation. However, the limited use of features can degrade the performance of the UNet approach for segmentation. In this paper, we propose a modified UNet architecture for brain tumor segmentation. In the proposed architecture, we used densely connected blocks in both encoder and decoder paths to extract multi-contexual information from the concept of feature reusability. The proposed residual inception blocks (RIB) are used to extract local and global information by merging features of different kernel sizes. We validate the proposed architecture on the multimodal brain tumor segmentation challenges (BRATS) 2020 testing dataset. The dice (DSC) scores of the whole tumor (WT), tumor core (TC), and enhancement tumor (ET) are 89.12%, 84.74%, and 79.12%, respectively. Our proposed work is in the top ten methods based on the dice scores of the testing dataset. © 2020, CC-BY.

关键词： Tumors

来源：评论

学校读者我要写书评

暂无评论

Android malware family classification and characterization using CFG and DFG 13

Android malware family classification and characterization u...

引用

13th International Symposium on Theoretical Aspects of Software engineering, TASE 2019

作者： Xu, Zhiwu Ren, Kerong Song, Fu College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China School of Information Science and Technology ShanghaiTech University Shanghai China

ISBN: (纸本)9781728133423

Android malware has become a serious threat for our daily life, and thus there is a pressing need to effectively mitigate or defend against them. Recently, many approaches and tools to analyze Android malware have been proposed to protect legitimate users from the threat. However, most approaches focus on malware detection, while only a few of them consider malware classification or malware characterization. In this paper, we propose an extension of CDGDroid to classifying and characterizing Android malware families automatically. We first perform static analysis used in CDGDroid to extract control-flow graphs and data-flow graphs on the instruction level. Then we encode the graphs into matrices, and use them to build the family classification models via deep learning. For family characterization, we extract the n-gram sequences from the graphs, which are filtered according to the weights of the classification model built for the target family. And then we construct a vector space model and select the top-k sequences as a characterization of the target family. We have conducted some experiments to evaluate our approach and have identified that the family classification model taking the horizontal combination of CFG and DFG as features offers the best performance in terms of accuracy among all the models. Compared with CDGDroid, Drebin and many antivirus tools gathered in VirusTotal, our family classification model gives a better performance. Finally, We have also conducted experiments on family characterization, and the experimental results have shown that our characterization can capture the malicious behaviors of the testing families. © 2019 IEEE.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Adaptive Transfer Learning for Heterogeneous One-Class Collaborative Filtering

Adaptive Transfer Learning for Heterogeneous One-Class Colla...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xiancong Chen Weike Pan Zhong Ming National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ) Shenzhen University College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9781728169262

ISBN: (纸本)9781728169279

In this paper, we study a recent and important recommendation problem called heterogeneous one-class collaborative filtering (HOCCF), where we have two different types of one-class feedback, i.e., a set of browses and a set of purchases, for preference learning. Previous methods exploit the browses and purchases by extending some existing methods on modeling homogeneous one-class feedback in an integrative or sequential manner. However, an integrative method may be of high complexity in model training due to the expanded prediction rule, and a sequential method is of inconvenience in deployment because more than one parametric models have to be maintained. In this paper, we convert the HOCCF problem to an adaptive transfer learning task, where we first model browses via a factorization model from a perspective of the role of browser, and then adaptively refine the learned model parameters via purchases from a perspective of the dependent role of purchaser. Based on this conversion, we design a novel solution called role-based adaptive factorization (ROAF), and then derive two specific variants with pairwise preference learning and pointwise preference learning. Finally, we conduct extensive empirical studies on two large datasets, and find that our ROAF is a very promising solution in terms of recommendation accuracy, besides its convenience of one single parametric model in deployment.

关键词： Browsers Adaptation models Parametric statistics Training Bayes methods Task analysis

来源：评论

学校读者我要写书评

暂无评论

PAT: Preference-Aware Transfer Learning for Recommendation with Heterogeneous Feedback

PAT: Preference-Aware Transfer Learning for Recommendation w...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Feng Liang Wei Dai Yunfeng Huang Weike Pan Zhong Ming National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ) Shenzhen University College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9781728169262

ISBN: (纸本)9781728169279

In this paper, we study an important recommendation problem with heterogeneous feedback of users' grade scores such as 5-star grade scores and like/dislike binary ratings assigned to items. As a response, we address the problem from a transfer learning perspective, i.e., taking the grade scores as the target data and the binary ratings as the auxiliary data, in order to share knowledge between two different types of data more sufficiently. Technically, besides the observed explicit feedback of grade scores and binary ratings, we propose to exploit the implicit preference context beneath the feedback, which is incorporated into the prediction process of users' grade scores to items. Finally, we develop a novel and generic transfer learning solution, i.e., preference-aware transfer (PAT), which embodies several recent algorithms as parts of our solution and special cases. To verify our novel solution, we then conduct extensive empirical studies on two large and public datasets and find that our PAT performs significantly better than the state-of-the-art methods.

关键词： Collaboration Matrix decomposition Predictive models data models Probabilistic logic Training Context modeling

来源：评论

学校读者我要写书评

暂无评论

引用

International Conference on big data and Smart computing (bigCOMP)

ISBN: (数字)9781728160344

ISBN: (纸本)9781728160351

In this paper, we focus on a recently studied problem in recommendation called heterogeneous one-class collaborative filtering (HOCCF), which consists of different types of feedback, e.g., target feedback and auxiliary feedback. The main challenge of HOCCF is how to make good use of the large-scale and ambiguous auxiliary feedback to assist the task of learning users'true preferences. Inspired by a recent method that jointly learns the similarity among items associated with the target feedback and auxiliary feedback in a transfer learning manner, we further extend this method by learning additional similarity among users for better modeling users' preferences. Specifically, we jointly learn the item-based similarity and user-based similarity by leveraging the target feedback and auxiliary feedback, and then aggregate the dual similarity into one single prediction rule for estimating users' preferences, which is thus termed as dual similarity learning model (DSLM). Extensive empirical studies on three public datasets show that our DSLM with dual similarity is more effective in terms of recommendation accuracy, demonstrating that our method strikes a good balance between the item-based similarity and user-based similarity.

关键词： Collaboration IP networks Aggregates big data Predictive models Indexes Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Sequence-Aware Factored Mixed Similarity Model for Next-Item Recommendation

Sequence-Aware Factored Mixed Similarity Model for Next-Item...

引用

International Conference on big data and Smart computing (bigCOMP)

作者： Liulan Zhong Jing Lin Weike Pan Zhong Ming National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ) Shenzhen University College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9781728160344

ISBN: (纸本)9781728160351

Sequence-aware next-item recommendation has recently been studied because of the noteworthy usefulness of the sequential information integrated into recommendation algorithms. Following the development thread of sequential recommendation methods, especially the factored Markov chains segment, we propose a novel sequence-aware factored mixed similarity model (S-FMSM) based on a well-designed fusing similarity model with factored high-order Markov chains (i.e., Fossil). Unlike the baseline methods that model the general representation and the sequential representation in two divided factorization components, we use a factored mixed similarity model that unites the general similarity and the sequential relationship between two successive items for their sequential representation learning. Experiments on six datasets show that our newly introduced general similarity can notably improve the results of the recommended ranking lists. And a study on tuning the prior tradeoff parameter indicates the importance of the general similarity on different datasets.

关键词： Markov processes Linear programming Probability big data Collaboration Feeds Conferences

来源：评论

学校读者我要写书评

暂无评论

Weakly supervised learning for textbook question answering

TechRxiv

引用

TechRxiv 2021年

作者： Ma, Jie Chai, Qi Huang, Jingyue Liu, Jun You, Yang Zheng, Qinghua National Engineering Lab for Big Data Analytics School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China The High Performance Computing for Artificial intelligence Lab Department of Computer Science National University of Singapore 117417 Singapore

Textbook Question Answering (TQA) is the task of answering diagram and non-diagram questions given large multimodal contexts consisting of abundant text and diagrams. Deep text understandings and effective learning of diagram semantics are important for this task due to its specificity. In this paper, we propose a Weakly Supervised learning method for TQA (WSTQ), which regards the incompletely accurate results of essential intermediate procedures for this task as supervision to develop Text Matching (TM) and Relation Detection (RD) tasks and then employs the tasks to motivate itself to learn strong text comprehension and excellent diagram semantics respectively. Specifically, we apply the result of text retrieval to build positive as well as negative text pairs. In order to learn deep text understandings, we first pre-train the text understanding module of WSTQ on TM and then fine-tune it on TQA. We build positive as well as negative relation pairs by checking whether there is any overlap between the items/regions detected from diagrams using object detection. The RD task forces our method to learn the relationships between regions, which are crucial to express the diagram semantics. We train WSTQ on RD and TQA simultaneously, i.e., multitask learning, to obtain effective diagram semantics and then improve the TQA performance. Extensive experiments are carried out on CK12-QA and AI2D to verify the effectiveness of WSTQ. Experimental results show that our method achieves significant accuracy improvements of 5.02% and 4.12% on test splits of the above datasets respectively than the current state-of-the-art baseline. We have released our code on https://***/dr-majie/WSTQ. © 2021, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

BookChain: Library-Free Book Sharing Based on Blockchain technology

BookChain: Library-Free Book Sharing Based on Blockchain Tec...

引用

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

作者： Jiajie Zeng Xiaohai Dai Jiang Xiao Wenhui Yang Weifeng Hao Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9781728152127

ISBN: (纸本)9781728152134

Modern bookcrossing leverages the mobile networks to help readers share books via convenient connection, and thus expedites the dissemination of information. However, the lack of traceability has significantly hindered the wide adoption of mobile bookcrossing, leading to loss of books. Meanwhile, the managerial inefficiency of current mobile bookcrossing systems becomes another obstacle for advancing the book circulation. To overcome these problems, we propose to leverage the promising blockchain technology with the merits of its immutability and cryptographic smart contract. In this paper, we present BookChain, a traceable and efficient blockchain-based innercampus book sharing system. BookChain stores the complete sharing data of an interested book permanently on blockchain, such that every reader can trace the borrowing history, which reduces the potential for loss of book. BookChain also introduces the use of smart contract to automate the circulation of books with minimal human intervention, resulting in the improvement of efficiency. The experimental results show the effectiveness and low-cost of the proposed system under high concurrent users.

关键词： Contracts Web servers Web pages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：