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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

82 篇 期刊文献
52 篇 会议

馆藏范围

134 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

117 篇 工学
- 86 篇 计算机科学与技术...
- 45 篇 电气工程
- 15 篇 信息与通信工程
- 14 篇 软件工程
- 5 篇 控制科学与工程
- 3 篇 仪器科学与技术
- 2 篇 机械工程
- 2 篇 电子科学与技术（可...
- 1 篇 力学（可授工学、理...
- 1 篇 动力工程及工程热...
- 1 篇 测绘科学与技术
- 1 篇 石油与天然气工程
- 1 篇 交通运输工程
- 1 篇 环境科学与工程（可...
- 1 篇 生物医学工程（可授...
- 1 篇 风景园林学（可授工...
- 1 篇 网络空间安全
19 篇 理学
- 11 篇 数学
- 3 篇 生物学
- 2 篇 物理学
- 2 篇 地球物理学
- 2 篇 生态学
- 1 篇 化学
- 1 篇 地理学
- 1 篇 系统科学
9 篇 管理学
- 7 篇 管理科学与工程(可...
6 篇 农学
5 篇 医学
- 3 篇 基础医学(可授医学...
1 篇 经济学
- 1 篇 应用经济学
1 篇 法学
- 1 篇 法学
1 篇 教育学
- 1 篇 教育学

主题

134 篇 graph models
5 篇 complex networks
4 篇 genetic programm...
4 篇 reliability
4 篇 fault tolerance
4 篇 social networks
4 篇 queueing models
4 篇 boundary detecti...
4 篇 perceptual organ...
4 篇 complexity
3 篇 reconfigurable a...
3 篇 edge detection
3 篇 graph theory
3 篇 heuristics
3 篇 machine learning
3 篇 game theory
3 篇 cyber-physical s...
3 篇 webbed models
3 篇 emergency manage...
3 篇 networks

机构

4 篇 univ s carolina ...
4 篇 univ new mexico ...
2 篇 penn state univ ...
2 篇 brock univ dept ...
2 篇 cnrs f-72251 par...
2 篇 brock univ st ca...
2 篇 univ paris 07 f-...
2 篇 natl univ singap...
2 篇 univ ca foscari ...
1 篇 department of co...
1 篇 pontifcia univ c...
1 篇 albert ludwigs u...
1 篇 univ politecn ma...
1 篇 graz univ dept s...
1 篇 southern fed uni...
1 篇 tejas networks b...
1 篇 univ wisconsin d...
1 篇 johannes kepler ...
1 篇 consortium techn...
1 篇 carnegie mellon ...

作者

4 篇 ventresca mario
3 篇 lim a
3 篇 berline c
3 篇 christodoulou ch...
3 篇 stahl joachim s.
3 篇 wang song
3 篇 costantine josep...
2 篇 bruno giulia
2 篇 christodoulou c....
2 篇 bailey alexander
2 篇 razouk rr
2 篇 desmet antoine
2 篇 weninger tim
2 篇 villa agostino
2 篇 salibra a
2 篇 hayes jp
2 篇 antonelli dario
2 篇 taurino teresa
2 篇 barbin silvio e.
2 篇 ombuki-berman be...

语言

126 篇 英文
6 篇 其他
2 篇 中文

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

共 134 条记录，以下是11-20 订阅

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

详细简洁

排序：

Investigating Fitness Measures for the Automatic Construction of graph models 18

引用

18th European Conference on Applications of Evolutionary Computation (EvoApplications) as part of EvoSTAR Conference

作者： Harrison, Kyle Robert Ventresca, Mario Ombuki-Berman, Beatrice M. Brock Univ Dept Comp Sci St Catharines ON Canada Purdue Univ Sch Ind Engn W Lafayette IN USA

ISBN: (纸本)9783319165486;9783319165493

graph models are often constructed as a tool to better understand the growth dynamics of complex networks. Traditionally, graph models have been constructed through a very time consuming and difficult manual process. Recently, there have been various methods proposed to alleviate the manual efforts required when constructing these models, using statistical and evolutionary strategies. A major difficulty associated with automated approaches lies in the evaluation of candidate models. To address this difficulty, this paper examines a number of well-known network properties using a proposed meta-analysis procedure. The meta-analysis demonstrated how these network measures interacted when used together as classifiers to determine network, and thus model, (dis)similarity. The analytical results formed the basis of a fitness evaluation scheme used in a genetic programming (GP) system to automatically construct graph models for complex networks. The GP-based automatic inference system was used to reproduce two well-known graph models, the results of which indicated that the evolved models exemplified striking similarity when compared to their respective targets on a number of structural network properties.

关键词： Complex networks graph models Centrality measures Meta-analysis Genetic programming

来源：评论

学校读者我要写书评

暂无评论

Spread of Influence on the Basis of the graph models in Network Community State Space

Spread of Influence on the Basis of the Graph Models in Netw...

引用

10th IEEE International Conference on e-Business Engineering (ICEBE)

作者： Tsukanova, O. A. Maltseva, S. V. Natl Res Univ Higher Sch Econ Fac Business Informat Moscow Russia

ISBN: (纸本)9780769551111

Different types of graph models for network community information-resource potential modeling are considered. Both the agent structure and the information structure of the network community are described. Hypotheses of the influence spread on the basis of the graph models are put forward. Dynamic behavior of the network community is described.

关键词： network community graph models spread of influence

来源：评论

学校读者我要写书评

暂无评论

Indoor Robot Navigation Using graph models Based on BIM/IFC 18th

Indoor Robot Navigation Using Graph Models Based on BIM/IFC

引用

18th International Conference on Artificial Intelligence and Soft Computing (ICAISC)

作者： Palacz, Wojciech Slusarczyk, Grazyna Strug, Barbara Grabska, Ewa Jagiellonian Univ Fac Phys Astron & Appl Comp Sci Ul Lojasiewicza 11 PL-30348 Krakow Poland

ISBN: (纸本)9783030209155;9783030209148

This paper deals with a method of path planning for indoor robots in buildings which is based on the building-related knowledge. Knowledge extracted from the IFC data model is used to construct a hypergraph model of the building layout. Information needed for route planning, e.g., room dimensions, directionality and types of doors, is stored in attributes attached to the hypergraph. As the declarative knowledge is represented by a graph-based structure, an artificial intelligence method in the form of a heuristic search of this structure is applied. A modified shortest-path search algorithm used to calculate the optimal route with regard to costs incurred by the robot during passing through different spaces and opening doors is proposed.

关键词： Mobile robots Route planning graph models Knowledge representation BIM/IFC

来源：评论

学校读者我要写书评

暂无评论

ASSESSING graph models FOR DESCRIPTION OF BRAIN NETWORKS

ASSESSING GRAPH MODELS FOR DESCRIPTION OF BRAIN NETWORKS

引用

8th IEEE International Symposium on Biomedical Imaging (ISBI) - From Nano to Macro

作者： Yuan, Yixuan Guo, Lei Lv, Peili Hu, Xintao Zhang, Degang Han, Junwei Xie, Li Liu, Tianming Northwest Polytech Univ Sch Automat Xian 710072 Peoples R China Univ Georgia Dept Comp Sci & Bioimaging Res Ctr Athens GA 30602 USA Zhejiang Univ Dept Informat Sci & Elect Engn Hangzhou Peoples R China

ISBN: (纸本)9781424441280

Both structural and functional brain networks have been investigated in the literature with enthusiasm via graph-theoretical methods. However, an important issue that has not been adequately addressed before is: what is the optimal graph model for describing brain networks, both in structural and functional aspects? We address this question in the following three aspects. First, multi-resolution structural brain networks are reconstructed via cortical surface parcellation based on white matter fiber density information. Second, the global and local graph properties of the constructed networks are measured using state-of-the-art graph analysis algorithms and tools, and are further compared with five popular random graph models. Third, a functional simulation study is conducted to evaluate the synchronizability of the five models. Our results suggest that the STICKY graph model fits brain networks the best in terms of global and local graph properties, and the fastest speed of functional synchronization.

关键词： multi-resolution structural brain networks graph models graph properties

来源：评论

学校读者我要写书评

暂无评论

Learning Chinese Polarity Lexicons by Integration of graph models and Morphological Features

引用

6th Asia Information Retrieval Societies Conference

作者： Lu, Bin Song, Yan Zhang, Xing Tsou, Benjamin K. City Univ Hong Kong Dept Chinese Translat & Linguist Kowloon Hong Kong Peoples R China

ISBN: (纸本)9783642171864

This paper presents a novel way to learn Chinese polarity lexicons by using both external relations and internal formation of Chinese words, i.e. by integrating two kinds of different but complementary models: graph models and morphological feature-based models. The polarity detection is first treated as a semi-supervised learning in a graph, and then machine learning is used based on morphological features of Chinese words. The results show that the the integration of morphological feature-based models and graph models significantly outperforms the baselines.

关键词： Polarity Lexicon induction graph models Chinese Morphology

来源：评论

学校读者我要写书评

暂无评论

Automatic Inference of Hierarchical graph models using Genetic Programming with an Application to Cortical Networks 13

Automatic Inference of Hierarchical Graph Models using Genet...

引用

15th Genetic and Evolutionary Computation Conference (GECCO)

作者： Bailey, Alexander Ombuki-Berman, Beatrice Ventresca, Mario Brock Univ St Catharines ON L2S 3A1 Canada Univ Toronto Toronto ON Canada

ISBN: (纸本)9781450319638

The pathways that relay sensory information within the brain form a network of connections, the precise organization of which is unknown. Communities of neurons can be discerned within this tangled structure, with inhomogeneously distributed connections existing between cortical areas. Classification and modelling of these networks has led to advancements in the identification of unhealthy or injured brains, however, the current models used are known to have major deficiencies. Specifically, the community structure of the cortex is not accounted for in existing algorithms, and it is unclear how to properly design a more representative graph model. It has recently been demonstrated that genetic programming may be useful for inferring accurate graph models, although no study to date has investigated the ability to replicate community structure. In this paper we propose the first GP system for the automatic inference of algorithms capable of generating, to a high accuracy, networks with community structure. We utilize a common cat cortex data set to highlight the efficacy of our approach. Our experiments clearly show that the inferred graph model generates a more representative network than those currently used in scientific literature.

关键词： Complex networks genetic programming graph models automatic inference cortical networks

来源：评论

学校读者我要写书评

暂无评论

Altgraph: Redesigning Quantum Circuits Using Generative graph models for Efficient Optimization 24

AltGraph: Redesigning Quantum Circuits Using Generative Grap...

引用

34th Great Lakes Symposium on VLSI (GLSVLSI)

作者： Beaudoin, Collin Phalak, Koustubh Ghosh, Swaroop Penn State Univ University Pk PA 16802 USA

ISBN: (纸本)9798400706059

Quantum circuit transformation aims to optimize circuits for depth, gate count, and compatibility with Noisy Intermediate Scale Quantum (NISQ) devices that suffer from various error sources. Prior methods use combinations of expert-defined rules and Reinforcement Learning (RL). We introduce Altgraph, a novel approach employing generative graph models to generate functionally equivalent quantum circuits using-specifically, Direct Acyclic graph (DAG) Variational Autoencoder (D-VAE) variants (GRU and GCN) and Deep Generative Model for graphs (DeepGMG). Altgraph perturbs the latent space to generate quantum circuits optimized for hardware coupling maps, reducing gate count by 37.55% and circuit depth by 37.75% post-transpiling, with 0.0074 Mean Squared Error (MSE) in the density matrix-outperforming state-of-the-art methods by 2.56%.

关键词： Circuit transformation graph models DAG generation

来源：评论

学校读者我要写书评

暂无评论

Network Hypothesis Testing Using Mixed Kronecker Product graph models

Network Hypothesis Testing Using Mixed Kronecker Product Gra...

引用

IEEE 13th International Conference on Data Mining (ICDM)

作者： Moreno, Sebastian Neville, Jennifer Purdue Univ Dept Comp Sci W Lafayette IN 47906 USA Purdue Univ Dept Stat W Lafayette IN 47906 USA

ISBN: (纸本)9781479913282

The recent interest in networks-social, physical, communication, information, etc.-has fueled a great deal of research on the analysis and modeling of graphs. However, many of the analyses have focused on a single large network (e.g., a subnetwork sampled from Facebook). Although several studies have compared networks from different domains or samples, they largely focus on empirical exploration of network similarities rather than explicit tests of hypotheses. This is in part due to a lack of statistical methods to determine whether two large networks are likely to have been drawn from the same underlying graph distribution. Research on across-network hypothesis testing methods has been limited by (i) difficulties associated with obtaining a set of networks to reason about the underlying graph distribution, and (ii) limitations of current statistical models of graphs that make it difficult to represent variations across networks. In this paper, we exploit the recent development of mixed-Kronecker Product graph models, which accurately capture the natural variation in real world graphs, to develop a model-based approach for hypothesis testing in networks.

关键词： Network science graph models hypothesis testing

来源：评论

学校读者我要写书评

暂无评论

Easiness in graph models

Easiness in graph models

引用

3rd International Workshop on Algebraic Methods in Language Processing

作者： Berline, C Salibra, A CNRS F-72251 Paris 05 France Univ Paris 07 F-72251 Paris 05 France Univ Ca Foscari Venezia Dipartimento Informat I-30172 Venice Italy

We generalize Baeten and Boerboom's method of forcing to show that there is a fixed sequence (u(k))(k is an element of omega) of closed (untyped) lambda-terms satisfying the following properties: (a) For any countable sequence (g(k))(k is an element of omega) of Scott continuous functions (of arbitrary arity) on the power set of an arbitrary countable set, there is a graph model such that (lambda ***)(lambda ***)u(k) represents g(k) in the model. (b) For any countable sequence (t(k))(k is an element of omega) of Closed -terms there is a graph model that satisfies (lambda ***)(lambda ***)u(k) for all k. We apply these two results, which are corollaries of a unique theorem, to prove the existence of (1) a finitely axiomatized lambda-theory L such that the interval lattice constituted by the lambda-theories extending L is distributive;(2) a continuum of pairwise inconsistent graph theories (= lambda-theories that can be realized as theories of graph models);(3) a congruence distributive variety of combinatory algebras (lambda abstraction algebras, respectively). (c) 2005 Elsevier B.V. All rights reserved.

关键词： untyped lambda-calculus graph models easy terms Scott's continuous semantics lattice of lambda-theories webbed models combinatory algebras lambda abstraction algebras

来源：评论

学校读者我要写书评

暂无评论

Automatic Generation of graph models for Complex Networks by Genetic Programming 12

Automatic Generation of Graph Models for Complex Networks by...

引用

14th International Conference on Genetic and Evolutionary Computation Conference (GECCO)

作者： Bailey, Alexander Ventresca, Mario Ombuki-Berman, Beatrice Brock Univ St Catharines ON L2S 3A1 Canada

ISBN: (纸本)9781450311779

Complex networks have attracted a large amount of research attention, especially over the past decade, due to their prevalence and importance in our daily lives. Numerous human-designed models have been proposed that aim to capture and model different network structures, for the purpose of improving our understanding the real-life phenomena and its dynamics in different situations. Groundbreaking work in genetics, medicine, epidemiology, neuroscience, telecommunications, social science and drug discovery, to name some examples, have directly resulted. Because the graph models are human made (a very time consuming process) using a small subset of example graphs, they often exhibit inaccuracies when used to model similar structures. This paper represents the first exploration into the use of genetic programming for automating the discovery and algorithm design of graph models, representing a totally new approach with great interdisciplinary application potential. We present exciting initial results that show the potential of GP to replicate existing complex network algorithms.

关键词： Complex networks genetic programming graph models computer automated design

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：