检索结果-南通市图书馆

graph Regularized L_p Smooth Non-negative Matrix Factorization for Data Representation

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2019年第2期6卷 584-595页

作者： Chengcai Leng Hai Zhang Guorong Cai Irene Cheng Anup Basu the School of Mathematics Northwest University School of Mathematics and Information Sciences Nanchang Hangkong University Nanchang 330063 China the Department of Computing Science University of Alberta the Faculty of Information Technology & State Key Laboratory of Quality Research in Chinese Medicines Macao University of Science and Technology the College of Computer Engineering Jimei University the Department of Computing Science University of Alberta

This paper proposes a graph regularized Lpsmooth non-negative matrix factorization(GSNMF) method by incorporating graph regularization and L_p smoothing constraint, which considers the intrinsic geometric information of a data set and produces smooth and stable solutions. The main contributions are as follows: first, graph regularization is added into NMF to discover the hidden semantics and simultaneously respect the intrinsic geometric structure information of a data set. Second,the Lpsmoothing constraint is incorporated into NMF to combine the merits of isotropic(L_2-norm) and anisotropic(L_1-norm)diffusion smoothing, and produces a smooth and more accurate solution to the optimization problem. Finally, the update rules and proof of convergence of GSNMF are given. Experiments on several data sets show that the proposed method outperforms related state-of-the-art methods.

关键词： Data clustering dimensionality reduction graph regularization Lp smooth non-negative matrix factorization(SNMF)

graph-ranking collective Chinese entity linking algorithm

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2020年第2期14卷 291-303页

作者： Tao XIE Bin WU Bingjing JIA Bai WANG Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and TelecommunicationsBeijing 100876China

Entity linking(EL)systems aim to link entity mentions in the document to their corresponding entity records in a reference knowledge *** EL approaches usually ignore the semantic correlation between the mentions in the text,and are limited to the scale of the local knowledge *** this paper,we propose a novel graphranking collective Chinese entity linking(GRCCEL)algorithm,which can take advantage of both the structured relationship between entities in the local knowledge base and the additional background information offered by external knowledge *** improved weighted word2vec textual similarity and improved PageRank algorithm,more semantic information and structural information can be captured in the *** an incremental evidence mining process,more powerful discrimination capability for similar entities can be *** evaluate the performance of our algorithm on some open domain *** results show the effectiveness of our method in Chinese entity linking task and demonstrate the superiority of our method over state-of-the-art methods.

关键词： collective entity linking knowledge mapping word embedding entity correlation graph PageRank

graph Embedding Based API graph Search and Recommendation

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2019年第5期34卷 993-1006页

作者： Chun-Yang Ling Yan-Zhen Zou Ze-Qi Lin Bing Xie Key Laboratory of High Confidence Software Technologies Ministry of EducationBeijing 100871China School of Electronics Engineering and Computer Science Peking UniversityBeijing 100871China

Searching application programming interfaces (APIs) is very important for developers to reuse software projects. Existing natural language based API search mainly faces the following challenges. 1) More accurate results are required as software projects evolve to be more heterogeneous and complex. 2) The semantic relationships between APIs (e.g., inheritances between classes, and invocations between methods) need to be illustrated so that developers can better understand their usage scenarios. To deal with these issues, we propose GeAPI, a novel graph embedding based approach for API graph search and recommendation in this paper. First, we build a software project’s API graph automatically from its source code and represent each API using graph embedding methods. Second, we search the API graph with a question in natural language, and return the corresponding subgraph that is composed of relevant code elements and their associated relationships, as the best answer of the question. In experiments, we select three well-known open source projects, JodaTime, Apache Lucene and POI, as examples to perform API search tasks. The experimental results show that our approach GeAPI improves F1-score by 10% compared with the existing shortest path based API search approach, while reduces the average response time about 60 times.

关键词： application programming interface (API) recommendation API graph graph embedding software reuse

The Strategy of Third-Party Mediation Based on the Option Prioritization in the graph Model

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science and Systems Engineering 2019年第4期28卷 399-414页

作者： Zhenggao Wu Haiyan Xu Ginger Y. Ke College of Economics and Management Nanjing University of Aeronautics and Astronautics Nanjing 211106 China Faculty of Business Administration Memorial University of Newfoundland St. John's Newfoundland and Labrador A1B 3X5 Canada

The resolution of real-world conflicts is often supported by third-party intervention (i.e., media? tion). This paper proposes a possible mediation support in the form of a reverse optimization procedure under the framework of the graph Model for Conflict Resolution (GMCR). The approach computes minimal priority adjustments of preference statements that are necessary to achieve a desired agreement. A mathematical model, based on the matrix form of GMCR, is developed to analyze this third-party mediation problem. Thereby;this study makes a first attempt to obtain option-based mediation strategies, which add comprehensiveness to the traditional state-based strategies, yet are easier to understand and hence more acceptable to the conflict participants. To illustrate the practicality;the proposed procedure is applied to a medical dispute between a patient and a hospital, with the aim to suggest changes in the ordering of preference statements that lead to a desired outcome.

关键词： graph Model for Conflict Resolution third party mediation option prioritization minimal adjustment

A feedback control method for the stabilization of a nonlinear diffusion system on a graph

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Physics B 2014年第8期23卷 240-245页

作者：于欣许超林群 Ningbo Institute of Technology Zhejiang University The State Key Laboratory of Industrial Control Technology and Institute of Cyber-Systems & Control Zhejiang University Department of Mathematics and Statistics Curtin University

In this paper, we consider the internal stabilization problems of FitzHugh-Nagumo （FHN） systems on the locally finite connected weighted graphs, which describe the process of signal transmission across axons in neurobiology. We will establish the proper condition on the weighted Dirichlet-Laplace operator on a graph such that the nonlinear FHN system can be stabilized exponentially and globally only using internal actuation over a sub-domain with a linear feedback form.

关键词： FitzHugh-Nagumo system graph stabilization internal controller

graph-theoretic algorithms for cyber-physical vulnerability analysis of power grid with incomplete information

在线全文

学校读者我要写书评

暂无评论

Journal of Modern Power Systems and Clean Energy 2018年第5期6卷 887-899页

作者： Anurag K.SRIVASTAVA Timothy A.ERNSTER Ren LIU Vignesh G.KRISHNAN Department of Electrical Engineering and Computer Science Washington State University U.S. Army Corps of Engineers Dominion Power

A key focus recently has been on assessing therisk of a coordinated cyber-physical attack and minimizing the impact of a successful attack. Most of the cyberattackers will have limited system information and conventional power grid N-1 security analysis cannot be extended to assess the risk. Centrality measures are widely used in the network science and an attacker with incomplete information can use it to identify power system vulnerabilities by defining the system as a complex network but without real-time system measurements. This paper presents a graph theory based centrality indices for vulnerability assessment of the power system due to various bus and branch contingencies using limited system information and provides a preliminary defense mechanism to prevent such an attack. Proposed work answers the fundamental question of possible attack scenarios by balancing risk(limited information with low risk to get caught orhigh risk attack to access more system information) and impact(identifying contingencies with maximal impact on system operation). Statistical comparisons are made between the graph theory measures compared to the corresponding DC power flow based N-X linear sensitivity measures. A unified N-X centrality based performance index is proposed and validated against the AC power flow based performance index by doing the real-time simulations of an N-3 attack scenario. Defensive mechanisms using topology-based performance indices are also presented.

关键词： Cyber-physical security graph theory Transmission system Contingency Defense mechanism Incomplete information

A reliability evaluation method for embryonic cellular array based on Markov status graph model

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2020年第2期31卷 432-446页

作者： WANG Tao CAI Jinyan MENG Yafeng ZHU Sai Department of Electronic and Optical Engineering Army Engineering UniversityShijiazhuang 050003China

Due to the limitations of the existing fault detection methods in the embryonic cellular array(ECA), the fault detection coverage cannot reach 100%. In order to evaluate the reliability of the ECA more accurately, embryonic cell and its input and output(I/O) resources are considered as a whole, named functional unit(FU). The FU fault detection coverage parameter is introduced to ECA reliability analysis, and a new ECA reliability evaluation method based on the Markov status graph model is *** experiment results indicate that the proposed ECA reliability evaluation method can evaluate the ECA reliability more effectively and accurately. Based on the proposed reliability evaluation method, the influence of parameters change on the ECA reliability is studied, and simulation experiment results show that ECA reliability can be improved by increasing the FU fault detection coverage and reducing the FU failure rate. In addition, by increasing the scale of the ECA, the reliability increases to the maximum first, and then it will decrease continuously. ECA reliability variation rules can not only provide theoretical guidance for the ECA optimization design, but also point out the direction for further research.

关键词： embryonic Markov status graph model reliability fault detection evaluation

Cacheap:Portable and Collaborative I/O Optimization for graph Processing

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2019年第3期34卷 690-706页

作者： Peng Zhao Chen Ding Lei Liu Jiping Yu Wentao Han Xiao-Bing Feng State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of Sciences Beijing 100190China University of Chinese Academy of Sciences Beijing 100049China Department of Computer Science University of RochesterRochester 14623U.S.A. Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China

Increasingly there is a need to process graphs that are larger than the available memory on today's *** systems have been developed with grapli representations that are efficient and compact for out-of-core processing.A necessary task in these systems is memory *** paper presents a system called Cacheap which automatically and efficiently manages the available memory to maximize the speed of grapli processing,minimize the amount of disk access,and maximize the utilization of memory for graph *** has a simple interface that can be easily adopted by existing graph *** paper describes the new system,uses it in recent graph engines,and demonstrates its integer factor improvements in the speed of large-scale grapli processing.

关键词： out-of-core graph processing system I/O optimization memory cache graph analytics locality

Theory and Implementation of Sensitivity Analyses Based on Their Algebraic Representation in the graph Model

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science and Systems Engineering 2019年第5期28卷 580-601页

作者： Jinshuai Zhao Haiyan Xu Keith W.Hipel Baohua Yang College of Economics and Management Nanjing University of Aeronautics and Astronautics Nanjing 211106 China College of Computer Science and Technology Jiangsu Normal University Xuzhou 221116 China Department of Systems Design Engineering University of Waterloo Waterloo Canada School of Business Jiangsu Normal University Xuzhou 221116 China

Sensitivity analyses based on an algebraic representation in the graph model for conflict resolution (GMCR) are generalized for ascertaining the robustness of stability results by varying decision makers' preference *** ordinal preferences in GMCR are advantageous to carry out sensitivity analyses with respect to systematically identifying the influence of preference alterations upon the four basic stabilities consisting of Nash stability,general metarationality,symmetric metarationality and sequential *** proposed algebraic representation of the four basic stabilities is not only effective and convenient for computer implementation of sensitivity analysis,but also makes it easier to understand the meaning of the four stabilities when compared with the existing matrix ***,these sensitivity analyses results are embedded into the latest version of the decision support system NUAAGMCR,which can be used to study real-world *** illustrate how these contributions to sensitivity analyses can be applied in practice and provide valuable strategic insights,they are used to investigate the civil war conflict in South Sudan.

关键词： Sensitivity analyses algebraic expression graph model ordinal preference conflict resolution