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

arXiv 2020年

作者： Pan, Liming Yang, Dan Wang, Wei Cai, Shimin Zhou, Tao Lai, Ying-Cheng School of Computer Science and Technology Nanjing Normal University Nanjing Jiangsu210023 China Complex Lab School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu611731 China Cybersecurity Research Institute Sichuan University Chengdu610065 China Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of China Chengdu610054 China Big Data Research Center University of Electronic Science and Technology of China Chengdu610054 China School of Electrical Computer and Energy Engineering Arizona State University TempeAZ85287 United States

Epidemic spreading processes in the real world can interact with each other in a cooperative, competitive or asymmetric way, requiring a description based on coevolution dynamics. Rich phenomena such as discontinuous outbreak transitions and hystereses can arise, but a full picture of these behaviors in the parameter space is lacking. We develop a theory for coevolving spreading dynamics on complex networks through spectral dimension reduction. In particular, we derive from the microscopic quenched mean-field equations a two-dimensional system in terms of the macroscopic variables, which enables a full Phase diagram to be determined analytically. The diagram not only generates critical phenomena that have been known, but also predicts those that were previously unknown such as the interplay between discontinuous transition and hysteresis as well as the emergence and role of tri-critical points. Copyright © 2020, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

A SURVEY OF AUTOMATIC GENERATION OF SOURCE CODE COMMENTS: ALGORITHMS AND TECHNIQUES

arXiv

引用

arXiv 2019年

作者： Song, Xiaotao Sun, Hailong Wang, Xu Yan, Jiafei School of Software Taiyuan University of Technology China SKLSDE Lab School of Computer Science and Engineering Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing China

As an integral part of source code files, code comments help improve program readability and comprehension. However, developers sometimes do not comment on their program code adequately due to the incurred extra efforts, lack of relevant knowledge, unawareness of the importance of code commenting or some other factors. As a result, code comments can be inadequate, absent or even mismatched with source code, which affects the understanding, reusing and the maintenance of software. To solve these problems of code comments, researchers have been concerned with generating code comments automatically. In this work, we aim at conducting a survey of automatic code commenting researches. First, we generally analyze the challenges and research framework of automatic generation of program comments. Second, we present the classification of representative algorithms, the design principles, strengths and weaknesses of each category of algorithms. Meanwhile, we also provide an overview of the quality assessment of the generated comments. Finally, we summarize some future directions for advancing the techniques of automatic generation of code comments and the quality assessment of comments. Copyright © 2019, The Authors. All rights reserved.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Priority-Based Optimization of I/O Isolation for Hybrid Deployed Services 15th

Priority-Based Optimization of I/O Isolation for Hybrid Depl...

引用

15th EAI International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2019

作者： Zhang, Jiancheng Li, Youhuizi Zhou, Li Ren, Zujie Wan, Jian Wang, Yuan Key Laboratory of Complex Systems Modeling and Simulation Ministry of Education Hangzhou Dianzi University Hangzhou China School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China Zhejiang Lab Hangzhou China School of Information and Electronic Engineering Zhejiang University of Science and Technology Hangzhou China Key Enterprise Research Institute of NetEase Big Data of Zhejiang Province Netease Hangzhou Network Co.Ltd Hangzhou China

ISBN: (纸本)9783030301453

With the increasing of software complexity and user demands, collaborative service is becoming more and more popular. Each service focuses on its own specialty, their cooperation can support complicated task with high efficiency. To improve the resources utilization, virtualization technology like container is used and it enables multiple services running in the same physical machine. However, since the host physical machine is shared by several services, the resource competition is inevitable. Isolation is an effective solution, but the weak isolation mechanisms of container cannot handle such complicated scenarios. In the worst situation, the performance of services cannot meet the requirements and the system may crash. In order to solve this problem, we propose a priority-based optimization mechanism for I/O isolation after analyzing the characteristics of typical service workloads. Based on the real-time performance data, priority is automatically assigned to each service and corresponding optimization methods are applied. We evaluate the optimization effects of the priority-based mechanism in both static and dynamic workload cases, besides, the influence of different priority order is also analyzed. The experimental results show that our approach can indeed improve the system performance and guarantee the requirements of all the running services are satisfied. © 2019, ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

A hybrid NSGA-II for matching biomedical ontology 14th

A hybrid NSGA-II for matching biomedical ontology

引用

14th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2018

作者： Xue, Xingsi Chen, Jie Chen, Junfeng Chen, Dongxu College of Information Science and Engineering Fujian University of Technology FuzhouFujian350118 China Intelligent Information Processing Research Center Fujian University of Technology FuzhouFujian350118 China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology FuzhouFujian350118 China Fujian Key Lab for Automotive Electronics and Electric Drive Fujian University of Technology FuzhouFujian350118 China College of IOT Engineering Hohai University ChangzhouJiangsu China Fujian Medical University Union Hospital FuzhouFujian350001 China

ISBN: (纸本)9783030037444

Over the recent years, ontologies are widely used in the biomedical domains. However, biomedical ontology heterogeneity problem hamper the cooperation between intelligent applications based on biomedical ontologies. It is crucial to establish correspondences between the heterogeneous biomedical concepts in different ontologies, which is so-called biomedical ontology matching. Approaches based on Multi-Objective Evolutionary Algorithm (MOEA), such as NSGA-II, are emerging as a new methodology to solve the ontology matching problem. In this paper, to further improve the quality of biomedical ontology alignments, a hybrid NSGA-II is proposed, which modifies the knee solutions in the Pareto front by using a local search method. Experiment utilizes two biomedical ontology matching tracks provided by Ontology Alignment Evaluation Initiative (OAEI 2017). The experimental results show that our approach outperforms the participants of OAEI 2017 and NSGA-II based ontology matching technique. © Springer Nature Switzerland AG 2019.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Keyword Extraction Method Based on Chinese Patent Clustering

Unsupervised Keyword Extraction Method Based on Chinese Pate...

引用

IEEE International Conference on big Knowledge (ICBK)

作者： Yuxin Xie Xuegang Hu Yuhong Zhang Shi Li Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei China Intelligent Connected Vehicle Research Institute (JAC Technical Center) Anhui Jianghuai Automobile Group Corp.Ltd Hefei China

Recently, patent data analysis has attracted a lot of attention, and patent keyword extraction is a hot problem. Most existing methods for patent keyword extraction are based on the frequency of words without semantic information. In this paper, we propose an Unsupervised Keyword Extraction Method (UKEM) based on Chinese patent clustering. More specifically, we use a Skip-gram model to train word embeddings based on a Chinese patent corpus. Then each patent is represented as a vector called patent vector. These patent vectors are clustered to obtain several cluster centroids. Next, the distance between each word vector in patent abstract and cluster centroid is computed to indicate the semantic importance of this word. The experimental results on several Chinese patent datasets show that the performance of our proposed method is better than several competitive methods.

关键词： Patents Semantics data mining Knowledge engineering Neural networks big data Computer science

来源：评论

学校读者我要写书评

暂无评论

Efficient semi-supervised gross target volume of nasopharyngeal carcinoma segmentation via uncertainty rectified pyramid consistency

arXiv

引用

arXiv 2020年

作者： Luo, Xiangde Liao, Wenjun Chen, Jieneng Song, Tao Chen, Yinan Zhang, Shichuan Chen, Nianyong Wang, Guotai Zhang, Shaoting School of Mechanical and Electrical Engineering University of Electronic Science and Technology of China Chengdu Chengdu China West China Hospital Sichuan University Chengdu China College of Electronics and Information Technology Tongji University Shanghai China SenseTime Research Shanghai China Sichuan Cancer Hospital & Institute China West China Hospital-SenseTime Joint Lab West China Biomedical Big Data Center Sichuan University West China Hospital Chengdu China

Gross Target Volume (GTV) segmentation plays an irreplaceable role in radiotherapy planning for Nasopharyngeal Carcinoma (NPC). Despite that Convolutional Neural Networks (CNN) have achieved good performance for this task, they rely on a large set of labeled images for training, which is expensive and time-consuming to acquire. In this paper, we propose a novel framework with Uncertainty Rectified Pyramid Consistency (URPC) regularization for semisupervised NPC GTV segmentation. Concretely, we extend a backbone segmentation network to produce pyramid predictions at different scales. The pyramid predictions network (PPNet) is supervised by the ground truth of labeled images and a multi-scale consistency loss for unlabeled images, motivated by the fact that prediction at different scales for the same input should be similar and consistent. However, due to the different resolution of these predictions, encouraging them to be consistent at each pixel directly has low robustness and may lose some fine details. To address this problem, we further design a novel uncertainty rectifying module to enable the framework to gradually learn from meaningful and reliable consensual regions at different scales. Experimental results on a dataset with 258 NPC MR images showed that with only 10% or 20% images labeled, our method largely improved the segmentation performance by leveraging the unlabeled images, and it also outperformed five state-of-the-art semi-supervised segmentation methods. Moreover, when only 50% images labeled, URPC achieved an average Dice score of 82.74% that was close to fully supervised learning. © 2020, CC BY-NC-ND.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Deep learning for optoelectronic properties of organic semiconductors

arXiv

引用

arXiv 2019年

作者： Lu, Chengqiang Liu, Qi Sun, Qiming Hsieh, Chang-Yu Zhang, Shengyu Shi, Liang Lee, Chee-Kong Anhui Province Key Lab of Big Data Analysis and Application University of Science and Technology of China Anhui Hefei230026 China Tencent America Palo AltoCA94306 United States Tencent Guangdong Shenzhen518057 China Chemistry and Chemical Biology University of California MercedCA95343 United States

Atomistic modeling of energetic disorder in organic semiconductors (OSCs) and its effects on the optoelectronic properties of OSCs requires a large number of excited-state electronic-structure calculations, a computationally daunting task for many OSC applications. In this work, we advocate the use of deep learning to address this challenge and demonstrate that state-of-the-art deep neural networks (DNNs) are capable of predicting the electronic properties of OSCs at an accuracy comparable with the quantum chemistry methods used for generating training data. We extensively investigate the performances of four recent DNNs (deep tensor neural network, SchNet, message passing neural network, and multilevel graph convolutional neural network) in predicting various electronic properties of an important class of OSCs, i.e., oligothiophenes (OTs), including their HOMO and LUMO energies, excited-state energies and associated transition dipole moments. We find that SchNet shows the best performance for OTs of different sizes (from bithiophene to sexithiophene), achieving average prediction errors in the range of 20-80meV compared to the results from (time-dependent) density functional theory. We show that SchNet also consistently outperforms shallow feed-forward neural networks, especially in difficult cases with large molecules or limited training data. We further show that SchNet could predict the transition dipole moment accurately, a task previously known to be difficult for feed-forward neural networks, and we ascribe the relatively large errors in transition dipole prediction seen for some OT configurations to the charge-transfer character of their excited states. Finally, we demonstrate the effectiveness of SchNet by modeling the UV-Vis absorption spectra of OTs in dichloromethane and a good agreement is observed between the calculated and experimental spectra. Our results show the great promise of DNNs in depicting the rugged energy landscapes encountered in OSCs, se

关键词： Density functional theory

来源：评论

学校读者我要写书评

暂无评论

MalScan: Fast Market-Wide Mobile Malware Scanning by Social-Network Centrality Analysis

MalScan: Fast Market-Wide Mobile Malware Scanning by Social-...

引用

IEEE International Conference on Automated Software engineering (ASE)

作者： Yueming Wu Xiaodi Li Deqing Zou Wei Yang Xin Zhang Hai Jin Cluster and Grid Computing Lab Services Computing Technology and System Lab National Engineering Research Center for Big Data Technology and System School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China University of Texas at Dallas Shenzhen Huazhong University of Science and Technology Research Institute School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Malware scanning of an app market is expected to be scalable and effective. However, existing approaches use either syntax-based features which can be evaded by transformation attacks or semantic-based features which are usually extracted by performing expensive program analysis. Therefor, in this paper, we propose a lightweight graph-based approach to perform Android malware detection. Instead of traditional heavyweight static analysis, we treat function call graphs of apps as social networks and perform social-network-based centrality analysis to represent the semantic features of the graphs. Our key insight is that centrality provides a succinct and fault-tolerant representation of graph semantics, especially for graphs with certain amount of inaccurate information (e.g., inaccurate call graphs). We implement a prototype system, MalScan, and evaluate it on datasets of 15,285 benign samples and 15,430 malicious samples. Experimental results show that MalScan is capable of detecting Android malware with up to 98% accuracy under one second which is more than 100 times faster than two state-of-the-art approaches, namely MaMaDroid and Drebin. We also demonstrate the feasibility of MalScan on market-wide malware scanning by performing a statistical study on over 3 million apps. Finally, in a corpus of dataset collected from Google-Play app market, MalScan is able to identify 18 zero-day malware including malware samples that can evade detection of existing tools.

关键词： Malware Social networking (online) Feature extraction Semantics Analysis of variance Static analysis Robustness

来源：评论

学校读者我要写书评

暂无评论

Domain Knowledge Guided Deep Learning with Electronic Health Records

Domain Knowledge Guided Deep Learning with Electronic Health...

引用

IEEE International Conference on data Mining (ICDM)

作者： Changchang Yin Rongjian Zhao Buyue Qian Xin Lv Ping Zhang School of Computer Science and Technology Xi’an Jiaotong University Xi’an China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Xi’an China The Ohio State University Columbus Ohio USA

Due to their promising performance in clinical risk prediction with Electronic Health Records (EHRs), deep learning methods have attracted significant interest from healthcare researchers. However, there are 4 challenges: (i) data insufficiency. Many methods require large amounts of training data to achieve satisfactory results. (ii) Interpretability. Results from many methods are hard to explain to clinicians (e.g., why the models make particular predictions and which events cause clinical outcomes). (iii) Domain knowledge integration. No existing method dynamically exploits complicated medical knowledge (e.g., relations such as cause and is-caused-by between clinical events). (iv) Time interval information. Most existing methods only consider the relative order of visits from EHRs, but ignore the irregular time intervals between neighboring visits. In the study, we propose a new model, Domain Knowledge Guided Recurrent Neural Networks (DG-RNN), by directly introducing domain knowledge from the medical knowledge graph into an RNN architecture, as well as taking the irregular time intervals into account. Experimental results on heart failure risk prediction tasks show that our model not only outperforms state-of-the-art deep-learning based risk prediction models, but also associates individual medical events with heart failure onset, thus paving the way for interpretable accurate clinical risk predictions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust unsupervised feature selection by nonnegative sparse subspace learning

引用

Neurocomputing 2019年 334卷 156-171页

作者： Wei Zheng Hui Yan Jian Yang School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing PR China School of Computer Engineering Jinling Institute of Technology Nanjing PR China PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education and Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiaozhuang University Nanjing PR China

Sparse subspace learning has been demonstrated to be effective in data mining and machine learning. In this paper, we cast the unsupervised feature selection scenario as a matrix factorization problem from the viewpoint of sparse subspace learning. By minimizing the reconstruction residual, the learned feature weight matrix with the l 2,1 -norm and the non-negative constraints not only removes the irrelevant features, but also captures the underlying low dimensional structure of the data points. Meanwhile in order to enhance the model's robustness, l 1 -norm error function is used to resistant to outliers and sparse noise. An efficient iterative algorithm is introduced to optimize this non-convex and non-smooth objective function and the proof of its convergence is given. Although, there is a subtraction item in our multiplicative update rule, we validate its non-negativity. The superiority of our model is demonstrated by comparative experiments on various original datasets with and without malicious pollution.

关键词： Subspace learning Non-negative matrix factorization Unsupervised feature selection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：