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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

258 篇 会议
11 篇 期刊文献
7 册 图书

馆藏范围

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

日期分布

学科分类号

192 篇 工学
- 167 篇 计算机科学与技术...
- 103 篇 软件工程
- 42 篇 信息与通信工程
- 30 篇 电气工程
- 21 篇 控制科学与工程
- 10 篇 电子科学与技术（可...
- 9 篇 生物工程
- 7 篇 动力工程及工程热...
- 6 篇 仪器科学与技术
- 6 篇 交通运输工程
- 5 篇 光学工程
- 5 篇 安全科学与工程
- 5 篇 网络空间安全
- 4 篇 建筑学
- 4 篇 生物医学工程（可授...
- 3 篇 力学（可授工学、理...
- 3 篇 机械工程
- 3 篇 化学工程与技术
72 篇 理学
- 47 篇 数学
- 22 篇 系统科学
- 13 篇 统计学（可授理学、...
- 10 篇 物理学
- 10 篇 生物学
- 3 篇 化学
- 3 篇 地球物理学
35 篇 管理学
- 18 篇 管理科学与工程(可...
- 17 篇 图书情报与档案管...
- 12 篇 工商管理
6 篇 医学
5 篇 法学
- 4 篇 社会学
5 篇 教育学
- 5 篇 教育学
2 篇 经济学
2 篇 农学
1 篇 文学
1 篇 军事学

主题

10 篇 genetic algorith...
8 篇 artificial intel...
8 篇 constraint theor...
6 篇 machine learning
6 篇 game theory
6 篇 clustering algor...
5 篇 computer science
5 篇 algorithm design...
4 篇 quality of servi...
4 篇 computational mo...
4 篇 graph theory
4 篇 computers
4 篇 decision making
4 篇 computer vision
4 篇 computer network...
3 篇 computer simulat...
3 篇 object detection
3 篇 systems engineer...
3 篇 algorithms
3 篇 logic gates

机构

3 篇 univ penn dept c...
3 篇 electronics and ...
3 篇 division of comp...
2 篇 ben-gurion unive...
2 篇 univ cambridge 6...
2 篇 duke univ dept e...
2 篇 tu wien austria
2 篇 institute of sys...
2 篇 school of mathem...
2 篇 department of co...
2 篇 dacya complutens...
2 篇 med mobile 535 2...
2 篇 college of compu...
2 篇 deis universit d...
2 篇 school of comput...
1 篇 lahore pakistan
1 篇 department of co...
1 篇 university of ca...
1 篇 dept. of mechani...
1 篇 key laboratory o...

作者

3 篇 parlato gennaro
3 篇 sokolsky oleg
3 篇 park junkil
3 篇 pajic miroslav
3 篇 lee insup
3 篇 la torre salvato...
3 篇 fischer bernd
2 篇 holeman isaac
2 篇 mohd azlishah ot...
2 篇 tomasco ermenegi...
2 篇 inverso omar
2 篇 segal michael
2 篇 lengál ondřej
2 篇 ross peter
2 篇 hamzah asyrani s...
2 篇 yahaya abd rahim
2 篇 mohd fairuz iska...
2 篇 marchetti-spacca...
2 篇 corne david
1 篇 roihan ahmad

语言

275 篇 英文
2 篇 中文

检索条件"任意字段=1st International ICST Conference on Theory and Practice of Algorithms in Computer Systems"

共 276 条记录，以下是131-140 订阅

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

详细简洁

排序：

Research on Multi-evidence Combination Based on Mahalanobis Distance Weight Coefficients

Research on Multi-evidence Combination Based on Mahalanobis ...

引用

1st international conference on Logic, Information, Control and Computation

作者： Su, Si Xu, Runping 3 Wanshou Rd Beijing 100036 Peoples R China

ISBN: (纸本)9783642192623

To solve the contradiction in using Dempster's method for the combination of highly conflicting evidences, an improved evidence combination method is presented based on Mahalanobis distance weight coefficients. First of all, the similarities between evidences are used as an approach to judge whether conflict exists. If there are more than 3 evidences consisting of conflicts, the Mahalanobis Distance algorithm can be used to calculate the,distance between each evidence and the others to obtain the evidences' weight coefficients, which could be transformed into BPA functions by means of the coefficients, and finally the Dempster's method is used for the combination. stimulation results show that this method can deal with conflicting evidences effectively, calculate faster than traditional algorithms, reduce more uncertainty in recognizing results, and retain the advantages of Dempster's method in tackling non-conflicting evidences.

关键词： conflicting evidence D-S evidence theory information fusion

来源：评论

学校读者我要写书评

暂无评论

Using Hyperlink Texts to Improve Quality of Identifying Document Topics Based on Wikipedia

Using Hyperlink Texts to Improve Quality of Identifying Docu...

引用

1st international conference on Knowledge and systems Engineering

作者： Dat T. Huynh Tru H. Cao Phuong H. T. Pham Toan N. Hoang Ho Chi Minh City Univ Technol Fac Comp Sci & Engn Ho Chi Minh City Vietnam

ISBN: (纸本)9781424450862

This paper presents a method to identify the topics of documents based on Wikipedia category network. It is to improve the method previously proposed by Schonhofen by taking into account the weights of words in hyperlink texts in Wikipedia articles. The experiments on Computing and Team Sport domains have been carried out and showed that our proposed method outperforms the Schonhofen's one.

关键词： Wikipedia Ontologies Web sites Knowledge engineering systems engineering and theory computer science Humans Machine learning Machine learning algorithms Crawlers

来源：评论

学校读者我要写书评

暂无评论

Dataset-driven research for improving recommender systems for learning 11

Dataset-driven research for improving recommender systems fo...

引用

1st international conference on Learning Analytics and Knowledge, LAK'11

作者： Verbert, Katrien Drachsler, Hendrik Manouselis, Nikos Wolpers, Martin Vuorikari, Riina Duval, Erik Department of Computer Science K.U. Leuven Celestijnenlaan 200A B-3001 Leuven Belgium P.O. Box 2960 6401 DL Heerlen Netherlands Agro-Know Technologies Athens Greece University of Alcala Spain Schloss Birlinghoven 53754 Sankt Augustin Germany Rue de Trèves 61 1040 Brussels Belgium

ISBN: (纸本)9781450310574

In the world of recommender systems, it is a common practice to use public available datasets from different application environments (e.g. MovieLens, Book-Crossing, or Each- Movie) in order to evaluate recommendation algorithms. These datasets are used as benchmarks to develop new recommendation algorithms and to compare them to other algorithms in given settings. In this paper, we explore datasets that capture learner interactions with tools and resources. We use the datasets to evaluate and compare the performance of different recommendation algorithms for learning. We present an experimental comparison of the accuracy of several collaborative filtering algorithms applied to these TEL datasets and elaborate on implicit relevance data, such as downloads and tags, that can be used to improve the performance of recommendation algorithms. © 2011 ACM.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Database modeling of empirical games 1

Database modeling of empirical games

引用

1st international Workshop on Data Science for Macro-Modeling, DSMM 2014 - In Conjunction with the ACM SIGMOD/PODS conference

作者： Cassell, Ben-Alexander Wellman, Michael P. Computer Science and Engineering University of Michigan United States

ISBN: (纸本)9781450330121

There is a growing interest in computational game theory, the study of algorithms for analyzing multi-agent strategic interaction cast as games. Work in this field has primarily focused on algorithmic complexity of solving given game forms, with relatively little attention paid to concerns about managing data underlying game models. We propose a model of game-play data implementable by a relational database system, designed to scale to the vast quantities of observations needed to describe real-world strategic scenarios with sufficient fidelity. Our model enables performing common game-theoretic analysis in the database, using a flexible, compact representation of games. Copyright 2014 ACM.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

1st Annual international conference on Computing and Combinatorics, COCOON 1995

1st Annual International Conference on Computing and Combina...

引用

1st Annual international Computing and Combinatorics conference, COCOON 1995

ISBN: (纸本)354060216X

The proceedings contain 77 papers. The special focus in this conference is on Complexity theory and Graph Drawing. The topics include: The complexity of mean payoff games;approximation of coNP sets by NP-complete sets;an efficient orthogonal grid drawing algorithm for cubic graphs;constrained independence system and triangulations of planar point sets;three dimensional weak visibility;rectangulating rectilinear polygons in parallel;efficient randomized incremental algorithm for the closest pair problem using leafary trees;computing infinite relations using finite expressions;set-term unification in a logic database language;computations with finite closure systems and implications;optimal algorithms for finding connected components of an unknown graph;the multi-weighted spanning tree problem;algorithmic graph embeddings;a highly fault-tolerant quorum consensus method for managing replicated data;constructing craig interpolation formulas;currying of order-sorted term rewriting systems;stack and queue number of 2-trees;shortest paths in random weighted graphs;small weight bases for hamming codes;toeplitz words, generalized periodicity and periodically iterated morphisms;a construction for enumerating k-coloured motzkin paths;on public-key cryptosystem based on church-rosser string-rewriting systems;extending the hong-kung model to memory hierarchies;on log-time alternating turing machines of alternating depth k;new bound for affine resolvable designs and its application to authentication codes;efficient parallel algorithms for some tree layout problems and conservative algorithms for parallel and sequential integer sorting.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Situated simplification 1st

Situated simplification

引用

CP 95 / 1st international conference on Principles and practice of Constraint Programming

作者： Podelski, A Smolka, G GERMAN RES CTR ARTIFICIAL INTELLIGENCE DFKI PROGRAMMING SYST LAB D-66123 SAARBRUCKEN GERMANY

ISBN: (纸本)3540602992

Testing satisfaction of guards is the essential operation of concurrent constraint programming (CCP) systems. We present and prove correct, for the first time, an incremental algorithm for the simultaneous tests of entailment and disentailment of rational tree constraints to be used in CCP systems with deep guards (e.g., in AKL or in Oz). The algorithm is presented as the simplification of the constraints which form the (possibly deep) guards and which are situated at different nodes in a tree (of arbitrary depth). The nodes correspond to local computation spaces. In this algorithm, a variable may have multiple bindings (which each represent a constraint on that same variable in a different node). These may be realized in various ways. We give a simple fixed-point algorithm and use it for proving that the tests implemented by another, practical algorithm are correct and complete for entailment and disentailment. We formulate the results in this paper for rational tree constraints;they can be adapted to finite and feature trees.

关键词： Constraint theory

来源：评论

学校读者我要写书评

暂无评论

Programmed graph rewriting with time for simulation-based design

Programmed graph rewriting with time for simulation-based de...

引用

1st international conference on Model Transformations

作者： Syriani, Eugene Vangheluwe, Hans McGill Univ Sch Comp Sci Montreal PQ Canada

ISBN: (纸本)9783540699262

The Discrete EVent system Specification (DEVS) formalism allows for highly modular, hierarchical modelling of timed, reactive systems. DEVS can be used to describe complex control structures for programmed graph transformation. A side-effect of this approach is the introduction of an explicit notion of time. In this paper we show how the explicit notion of time allows for the simulation-based design of reactive systems such as modern computer games. We use the well-known game of PacMan as an example and model its dynamics with programmed graph transformation based on DEVS. This also allows the modelling of player behaviour, incorporating data about human players' behaviour and reaction times. Thus, a model of both player and game is obtained which can be used to evaluate, through simulation, the playability of a game design. We propose a playability performance measure and vary parameters of the PacMan game. For each variant of the game thus obtained, simulation yields a value for the quality of the game. This allows us to choose an "optimal" (from a playability point of view) game configuration. The user model is subsequently replaced by a visual interface to a real player and the game model is executed using a real-time DEVS simulator.

关键词： computer games

来源：评论

学校读者我要写书评

暂无评论

Automatic clustering based on Cluster Nearest Neighbor Distance (CNND) algorithm

引用

1st international conference on Frontiers in Intelligent Computing: theory and Applications, FICTA 2012

作者： Sur, Arghya Chowdhury, Aritra Chowdhury, Jaydeep Ghosh Das, Swagatam Dept. of Electronics and Telecomunication Engg. Jadavpur University Kolkata 700032 India Electronics and Computer Sciences Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9783642353130

This article describes a simple and fast algorithm that can automatically detect any number of well separated clusters, which may be of any shape e.g. convex and/or non-convex. This is in contrast to most of the existing clustering algorithms that assume a value for the number of clusters and/or a particular cluster structure. This algorithm is based on the principle that there is a definite threshold in the intra-cluster distances between nearest neighbors in the same cluster. Promising results on both real and artificial datasets have been included to show the effectiveness of the proposed technique. © 2013 Springer-Verlag.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A closed loop algorithms based on chaos theory for global optimization

A closed loop algorithms based on chaos theory for global op...

引用

1st international conference on Natural Computation (ICNC 2005)

作者： Zhu, XL Wang, HG Zhao, MY Zhou, JP Chinese Acad Sci Shenyang Inst Automat Robot Lab Shenyang 110016 Peoples R China Yangzhou Univ Mech Engn Coll Yangzhou 225009 Jiangsu Peoples R China

ISBN: (纸本)354028320X

Numerical optimization problems enjoy a significant popularity in chaos theory fields. All major chaotic techniques use such problems for various tests and experiments. However, many of these techniques encounter difficulties in solving some real-world problems which include non-trivial constrains. This paper discusses a closed loop algorithms (CLA) which based on chaos theory. Thus, for many constrained numerical optimization problems it might be beneficial to add a constraint, and make up of closed loop, using feedback theory. Given an initial best function value (BFV), after the first runs computation we subtract variable increment from obtained BFV, and name it as the new value. That the new value subtracts the new BFV in the next runs computation is defined the accessional constraints. Substituting the new BFV in the next AN runs for the old BFV and go on, until the global solution is searched. Eventually, some difficult test cases illustrate this approach is very available.

关键词： Closed loop control systems

来源：评论

学校读者我要写书评

暂无评论

1st international conference on Self-Organizing Networks, ICSON 2015

1st International Conference on Self-Organizing Networks, IC...

引用

1st international conference on Self-Organizing Networks, ICSON 2015

ISBN: (纸本)9783319197456

The proceedings contain 25 papers. The special focus in this conference is on key technologies and challenges of self-Organizing networks. The topics include: A green SON scheme based on SFFR in future cellular networks;a graph coloring based resource allocation in cognitive networks;analyses of the interference mitigation in ad hoc network by using a heuristic scheme;blind symbol synchronization based on cyclic prefix for OFDM systems in multipath fading channels;connectivity performance of bidirectional transmission in mobile ad hoc networks;incident signals estimation based on a modified MCA learning algorithm;self-optimised coordinated traffic shifting scheme for LTE cellular systems;a survey of fast algorithms for inter-prediction high efficiency video coding;research on self-organizing network based on MIMO technology;the key technology of LTE system in self-organized network;a video transmission system based on the self-organizing networks;fast intra prediction mode decision algorithm for HEVC;on using game theory to solve the scalable video multicasting problem in mobile ad-hoc networks;research on rate control combined with joint source-channel coding;a three-staged improved OSIC algorithm with lower complexity in MIMO system and improvement of the LR-aided MIMO SIC detection through a layered system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共28页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：