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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

2,094 篇 期刊文献
822 篇 会议
24 篇 学位论文
7 册 图书
1 篇 资讯

馆藏范围

2,947 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,331 篇 工学
- 2,087 篇 计算机科学与技术...
- 525 篇 软件工程
- 349 篇 电气工程
- 132 篇 测绘科学与技术
- 131 篇 土木工程
- 130 篇 信息与通信工程
- 130 篇 建筑学
- 79 篇 控制科学与工程
- 34 篇 电子科学与技术（可...
- 22 篇 网络空间安全
- 19 篇 生物工程
- 18 篇 材料科学与工程（可...
- 14 篇 交通运输工程
- 13 篇 仪器科学与技术
- 11 篇 化学工程与技术
- 11 篇 石油与天然气工程
- 11 篇 安全科学与工程
1,066 篇 理学
- 957 篇 数学
- 79 篇 统计学（可授理学、...
- 61 篇 生物学
- 51 篇 物理学
- 27 篇 化学
- 23 篇 系统科学
191 篇 管理学
- 142 篇 管理科学与工程(可...
- 62 篇 图书情报与档案管...
- 38 篇 工商管理
36 篇 经济学
- 35 篇 应用经济学
33 篇 医学
- 16 篇 临床医学
- 11 篇 基础医学(可授医学...
19 篇 法学
- 14 篇 社会学
9 篇 教育学
8 篇 文学
6 篇 农学
1 篇 艺术学

主题

2,948 篇 graph algorithms
140 篇 approximation al...
106 篇 algorithms
96 篇 parallel algorit...
65 篇 computational co...
63 篇 graph theory
58 篇 parameterized co...
52 篇 combinatorial pr...
49 篇 analysis of algo...
46 篇 planar graphs
44 篇 shortest paths
44 篇 treewidth
39 篇 social networks
36 篇 data structures
36 篇 distributed comp...
33 篇 distributed algo...
30 篇 complexity
29 篇 parameterized al...
29 篇 np-completeness
26 篇 interval graphs

机构

24 篇 univ bergen dept...
19 篇 univ elect sci &...
16 篇 ben gurion univ ...
15 篇 ben gurion univ ...
12 篇 carnegie mellon ...
12 篇 stanford univ de...
10 篇 ist austria klos...
10 篇 carleton univ sc...
9 篇 univ vienna fac ...
9 篇 technion israel ...
9 篇 natl inst inform...
9 篇 carnegie mellon ...
9 篇 univ rostock ins...
8 篇 indian inst tech...
8 篇 simon fraser uni...
8 篇 chinese univ hon...
8 篇 swiss fed inst t...
8 篇 carnegie mellon ...
8 篇 tel aviv univ sc...
8 篇 national univers...

作者

31 篇 xiao mingyu
23 篇 tsur dekel
18 篇 saurabh saket
17 篇 panda b. s.
16 篇 fomin fedor v.
13 篇 bader david a.
13 篇 bodlaender hans ...
13 篇 pandey arti
13 篇 lokshtanov danie...
12 篇 kratsch dieter
11 篇 karthick t.
11 篇 de figueiredo ce...
11 篇 henzinger monika
11 篇 bodlaender hl
11 篇 nanongkai danupo...
10 篇 mcmillan scott
10 篇 dondi riccardo
10 篇 nagamochi hirosh...
10 篇 low tze meng
10 篇 dragan feodor f.

语言

2,328 篇 英文
612 篇 其他
8 篇 中文
2 篇 斯洛文尼亚文
1 篇 德文
1 篇 土耳其文

检索条件"主题词=Graph Algorithms"

共 2948 条记录，以下是1771-1780 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Optimizing Approximate Weighted Matching on Nvidia Kepler K40 22

Optimizing Approximate Weighted Matching on Nvidia Kepler K4...

引用

22nd International Conference on High Performance Computing

作者： Naim, Md. Manne, Fredrik Halappanavar, Mahantesh Tumeo, Antonino Langguth, Johannes Univ Bergen Bergen Norway Pacific Northwest Natl Lab Washington DC USA Simula Res Lab Oslo Norway

ISBN: (纸本)9781467384889

Matching is a fundamental graph problem with numerous applications in science and engineering. While algorithms for computing optimal matchings are difficult to parallelize, approximation algorithms on the other hand generally compute high quality solutions and are amenable to parallelization. In this paper, we present efficient implementations of the current best algorithm for half-approximate weighted matching, the Suitor algorithm, on Nvidia Kepler K-40 platform. We develop four variants of the algorithm that exploit hardware features to address key challenges for a GPU implementation. We also experiment with different combinations of work assigned to a warp. Using an exhaustive set of 269 inputs, we demonstrate that the new implementation outperforms the previous best GPU algorithm by 10 to 100x for over 100 instances, and from 100 to 1000x for 15 instances. We also demonstrate up to 20x speedup relative to 2 threads, and up to 5x relative to 16 threads on Intel Xeon platform with 16 cores for the same algorithm. The new algorithms and implementations provided in this paper will have a direct impact on several applications that repeatedly use matching as a key compute kernel. Further, algorithm designs and insights provided in this paper will benefit other researchers implementing graph algorithms on modern GPU architectures.

关键词： Weighted matching graph algorithms GPU Kepler K40

来源：评论

学校读者我要写书评

暂无评论

Analysis of Subgraph-centric Distributed Shortest Path Algorithm 29

Analysis of Subgraph-centric Distributed Shortest Path Algor...

引用

29th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Dindokar, Ravikant Choudhury, Neel Simmhan, Yogesh Indian Inst Sci Supercomp Educ & Res Ctr Bangalore 560012 Karnataka India

ISBN: (纸本)9781467376846

Path-based graph algorithms are key building blocks for several link prediction and spatial mining applications. As the sizes of social, transport and communication networks expand, performing scalable traversal algorithms like SSSP are critical. While there is heightened interest in vertex-centric platforms for scalable graph analysis, there is limited literature on understanding the behavior of distributed algorithms designed using them. Consequently, it is often difficult to offer a tight bound on their algorithm's complexity. Here, using SSSP as a canonical algorithm on a subgraph-centric abstraction, we perform an algorithmic analysis of its characteristics using meta-graph sketches. We then analyze its empirical performance using real-world graphs to correlate the expected and observed outcomes. Our analysis shows that the runtime behavior of the SSSP algorithm meets the expected behavior, and confirms the bounds on the number of times Dijkstra's is performed, based on the traversal visit of the meta-graph.

关键词： algorithmic analysis distributed systems experiments graph algorithms shortest path

来源：评论

学校读者我要写书评

暂无评论

Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in graphs 9th

Faster Computation of the Maximum Dissociation Set and Minim...

引用

9th International Frontiers of Algorithmics Workshop (FAW)

作者： Xiao, Mingyu Kou, Shaowei Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Peoples R China

ISBN: (纸本)9783319196473;9783319196466

A dissociation set in a graph G = (V, E) is a vertex subset D such that the subgraph G[D] induced on D has vertex degree at most 1. A 3-path vertex cover in a graph is a vertex subset C such that every path of three vertices contains at least one vertex from C. Clearly, a vertex set D is a dissociation set if and only if V \ D is a 3-path vertex cover. There are many applications for dissociation sets and 3path vertex covers. However, it is NP-hard to compute a dissociation set of maximum size or a 3-path vertex cover of minimum size in graphs. Several exact algorithms have been proposed for these two problems and they can be solved in O*(1.4658(n)) time in n-vertex graphs. In this paper, we reveal some interesting structural properties of the two problems, which allow us to solve them in O*(1.4656(n)) time and polynomial space or O*(1.3659(n)) time and exponential space.

关键词： Dissociation number 3-Path Vertex Cover Exact algorithms graph algorithms Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Distributed Recovery for Enterprise Services 9

Distributed Recovery for Enterprise Services

引用

9th IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO)

作者： Clark, Shane S. Beal, Jacob Pal, Partha Raytheon BBN Technol Cambridge MA 02138 USA

ISBN: (纸本)9781467375351

Small-to medium-scale enterprise systems are typically complex and highly specialized, but lack the management resources that can be devoted to large-scale (e.g., cloud) systems, making them extremely challenging to manage. Here we present an adaptive algorithm for addressing a common management problem in enterprise service networks: safely and rapidly recovering from the failure of one or more services. Due to poorly documented and shifting dependencies, a typical industry practice for this situation is to bring the entire system down, then to restart services one at a time in a predefined order. We improve on this practice with the Dependency-Directed Recovery (DDR) algorithm, which senses dependencies by observing network interactions and recovers near-optimally from failures following a distributed graph algorithm. Our Java-based implementation of this system is suitable for deployment with a wide variety of networked enterprise services, and we validate its correct operation and advantage over fixed-order restart with emulation experiments on networks of up to 20 services.

关键词： computer networks graph theory small-to-medium enterprises DDR algorithm dependency-directed recovery algorithm distributed graph algorithm enterprise service recovery management resources networked enterprise services small-to medium-scale enterprise system Databases Electronic mail Logic gates Monitoring Reliability Servers Sockets aggregate programming distributed algorithms enterprise systems protelis Power outlets Socket electronic mail distributed algorithms computer network Logic gates Servers graph theory management of resources Database Legal Services small and medium enterprises graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Utilizing Covariates in Partially Observed Networks 18

Utilizing Covariates in Partially Observed Networks

引用

18th International Conference on Information Fusion (Fusion)

作者： Marchette, David J. Hohman, Elizabeth L. Naval Surface Warfare Ctr 18444 Frontage Rd Dahlgren VA 22448 USA

ISBN: (纸本)9780982443866

In many applications of network analysis one observes the network of interest imperfectly. Inference on such networks requires one to either impute the unobserved information, or to be robust to the missing information. In many applications, such as social networks, brain connectomes, communications networks, etc. these graphs can be extremely large, which can make imputation problematic. Typically one has little to no control over the missing information. Additionally, there is often meta-data associated with the network, and incorporating these covariates can improve the inference and provide some level of robustness under the missing data. We will describe a family of spectral graph algorithms that allow one to utilize covariates in a natural way, and will illustrate the methodology on a large graph derived from Twitter, in which one observes most of the tweets containing geographic information ( latitude and longitude of the device used to send the tweet) and builds the mentions graph, in which a directed edge indicates that a tweet from one user mentioned another user. Note that since we observe only those tweets with a location, we do not observe tweets from many of the users mentioned, and so do not have information about their outward edges or such covariates as their location, the languages they speak, etc. Note that in the case of the latter, we observe the meta-data partially as well - we observe the language of the tweets mentioning these users, but not those sent by them. We will describe a method to utilize the geographic information of the subset of users for which this is observed to perform inference on the overall graph, such as inferring missing edges and inferring the location of users whose devices do not provide this information.

关键词： TWITTER Consumers Metadata geographical information graph algorithms Language Network Line graph longitude missing data

来源：评论

学校读者我要写书评

暂无评论

Scheduling Loop-free Network Updates: It's Good to Relax! 15

Scheduling Loop-free Network Updates: It's Good to Relax!

引用

34th Annual ACM Symposium on Principles of Distributed Computing (PODC)

作者： Ludwig, Arne Marcinkowski, Jan Schmid, Stefan TU Berlin Berlin Germany Univ Wroclaw Wroclaw Poland T Labs Berlin Germany

ISBN: (纸本)9781450336178

We consider the problem of updating arbitrary routes in a software-defined network in a (transiently) loop-free manner. We are interested in fast network updates, i.e., in schedules which minimize the number of interactions (i.e., rounds) between the controller and the network nodes. We first prove that this problem is difficult in general: The problem of deciding whether a k-round schedule exists is NP-complete already for k = 3, and there are problem instances requiring Omega(n) rounds, where n is the network size. Given these negative results, we introduce an attractive, relaxed notion of loopfreedom. We prove that O( log n)-round relaxed loop-free schedules always exist, and can also be computed efficiently.

关键词： Software-Defined Networking graph algorithms Scheduling NP-hardness

来源：评论

学校读者我要写书评

暂无评论

Parallel Methods for Verifying the Consistency of Weakly-Ordered Architectures 24

Parallel Methods for Verifying the Consistency of Weakly-Ord...

引用

24th International Conference on Parallel Architecture and Compilation (PACT)

作者： McLaughlin, Adam Merrill, Duane Garland, Michael Bader, David A. Georgia Inst Technol Atlanta GA 30332 USA NVIDIA Santa Clara CA USA

ISBN: (纸本)9781467395243

Contemporary microprocessors use relaxed memory consistency models to allow for aggressive optimizations in hardware. This enhancement in performance comes at the cost of design complexity and verification effort. In particular, verifying an execution of a program against its system's memory consistency model is an NP-complete problem. Several graph-based approximations to this problem based on carefully constructed randomized test programs have been proposed in the literature;however, such approaches are sequential and execute slowly on large graphs of interest. Unfortunately, the ability to execute larger tests is tremendously important, since such tests enable one to expose bugs more quickly. Successfully executing more tests per unit time is also desirable, since it allows for one to check for a greater variety of errors in the memory subsystem by utilizing a more diverse set of tests. This paper improves upon existing work by introducing an algorithm that not only reduces the time complexity of the verification process, but also facilitates the development of parallel algorithms for solving these problems. We first show performance improvements from a sequential approach and gain further performance from parallel implementations in OpenMP and CUDA. For large tests of interest, our GPU implementation achieves an average application speedup of 26.36x over existing techniques in use at NVIDIA.

关键词： Memory Consistency Verification Relaxed Memory Models graph algorithms Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Routing Enhancements based on Evolutionary Algorithm 11

Routing Enhancements based on Evolutionary Algorithm

引用

11th IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)

作者： Florea, Iulia Maria Gheorghe, Laura Carabas, Mihai Tapus, Nicolae Univ Politehn Bucuresti Fac Comp Sci & Automat Control Bucharest Romania

ISBN: (纸本)9781467382007

OSPF is one of the most commonly used interior gateway protocols due to the ability to run between pieces of equipment produced by different vendors and its capacity of splitting the network into areas and fast convergence. In this paper, we propose an approach for setting OSPF weights, using Cisco onePK API, in order to minimize congestion in small networks. It is based on a genetic algorithm, combined with two evaluation functions. The first evaluation function is based on getting loads on links depending on costs, while the other is based on getting the maximum flow in the network. Information about link load is obtained through onePK SDK, a Software Defined Networking solution developed by Cisco.

关键词： OSPF weights traffic engineering graph algorithms onePK Software Defined Networking

来源：评论

学校读者我要写书评

暂无评论

Improved algorithms for One-Pair and k-Pair Streett Objectives 15

Improved Algorithms for One-Pair and k-Pair Streett Objectiv...

引用

Annual ACM/IEEE Symposium on Logic in Computer Science

作者： Chatterjee, Krishnendu Henzinger, Monika Loitzenbauer, Veronika IST Austria Vienna Austria Univ Vienna Fac Comp Sci A-1010 Vienna Austria

ISBN: (纸本)9781479988754

The computation of the winning set for one-pair Streett objectives and for k-pair Streett objectives in (standard) graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We give faster algorithms for the computation of the winning set for (1) one-pair Streett objectives (aka parity-3 problem) in game graphs and (2) for k-pair Streett objectives in graphs. For both problems this represents the first improvement in asymptotic running time in 15 years.

关键词： Computer-aided verification Synthesis graph games Parity games Streett automata graph algorithms

来源：评论

学校读者我要写书评

暂无评论

CITEX: A new citation index to measure the relative importance of authors and papers in scientific publications

CITEX: A new citation index to measure the relative importan...

引用

IEEE International Conference on Communications (ICC)

作者： Pal, Arindam Ruj, Sushmita TCS Innovat Labs Kolkata India Indian Stat Inst Kolkata India

ISBN: (纸本)9781467364324

Evaluating the performance of researchers and measuring the impact of papers written by scientists is the main objective of citation analysis. Various indices and metrics have been proposed for this. In this paper, we propose a new citation index CITEX, which gives normalized scores to authors and papers to determine their rankings. To the best of our knowledge, this is the first citation index which simultaneously assigns scores to both authors and papers. Using these scores, we can get an objective measure of the reputation of an author and the impact of a paper. We model this problem as an iterative computation on a publication graph, whose vertices are authors and papers, and whose edges indicate which author has written which paper. We prove that this iterative computation converges in the limit, by using a powerful theorem from linear algebra. We run this algorithm on several examples, and find that the author and paper scores match closely with what is suggested by our intuition. The algorithm is theoretically sound and runs very fast in practice. We compare this index with several existing metrics and find that CITEX gives far more accurate scores compared to the traditional metrics.

关键词： CITATION ANALYSIS graph algorithms MATRIX COMPUTATIONS EIGENVALUES AND EIGENVECTORS INFORMATION RETRIEVAL

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共295页 << < 174 175 176 177 178 179 180 181 182 183 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：