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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,895 篇 期刊文献
1,874 篇 会议
82 册 图书

馆藏范围

3,851 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,123 篇 工学
- 1,331 篇 计算机科学与技术...
- 1,066 篇 软件工程
- 481 篇 信息与通信工程
- 296 篇 生物医学工程（可授...
- 268 篇 控制科学与工程
- 261 篇 生物工程
- 233 篇 电气工程
- 228 篇 光学工程
- 212 篇 电子科学与技术（可...
- 180 篇 核科学与技术
- 136 篇 仪器科学与技术
- 129 篇 机械工程
- 95 篇 化学工程与技术
- 90 篇 动力工程及工程热...
- 78 篇 安全科学与工程
- 77 篇 材料科学与工程（可...
1,645 篇 理学
- 864 篇 物理学
- 488 篇 数学
- 348 篇 生物学
- 178 篇 统计学（可授理学、...
- 119 篇 系统科学
- 111 篇 化学
589 篇 管理学
- 341 篇 管理科学与工程(可...
- 257 篇 图书情报与档案管...
- 187 篇 工商管理
377 篇 医学
- 297 篇 临床医学
- 263 篇 基础医学(可授医学...
- 150 篇 药学(可授医学、理...
- 134 篇 公共卫生与预防医...
95 篇 法学
- 81 篇 社会学
69 篇 教育学
67 篇 经济学
60 篇 农学
11 篇 文学
5 篇 军事学
5 篇 艺术学

主题

115 篇 informatics
98 篇 artificial intel...
96 篇 hadron colliders
85 篇 machine learning
69 篇 deep learning
64 篇 higgs bosons
57 篇 computer network...
50 篇 accuracy
47 篇 proton-proton in...
47 篇 training
41 篇 computational mo...
40 篇 internet of thin...
40 篇 computer archite...
37 篇 quality of servi...
35 篇 large hadron col...
35 篇 standard model (...
35 篇 costs
35 篇 protocols
35 篇 forecasting
33 篇 hadron-hadron sc...

机构

415 篇 department for p...
408 篇 faculty of scien...
401 篇 kirchhoff-instit...
398 篇 department of ph...
384 篇 department of ph...
383 篇 department of ph...
378 篇 institute of phy...
368 篇 institute of phy...
365 篇 fakultät für phy...
334 篇 instituto de fís...
307 篇 department of ph...
286 篇 department of ph...
284 篇 nikhef national ...
283 篇 graduate school ...
279 篇 department of ph...
279 篇 dipartimento di ...
278 篇 universidade fed...
277 篇 yerevan physics ...
269 篇 department of ph...
267 篇 ictp trieste

作者

338 篇 c. alexa
335 篇 j. m. izen
334 篇 g. bella
333 篇 d. calvet
333 篇 c. amelung
331 篇 j. strandberg
324 篇 g. spigo
324 篇 f. siegert
317 篇 r. ströhmer
317 篇 m. rijssenbeek
317 篇 s. jin
317 篇 g. gaudio
317 篇 s. mohapatra
308 篇 s. guindon
305 篇 a. kaczmarska
299 篇 y. tayalati
299 篇 j. schaarschmidt
290 篇 a. d. pilkington
285 篇 l. chevalier
283 篇 m. klein

语言

3,271 篇 英文
545 篇 其他
42 篇 中文
2 篇 德文
2 篇 日文

检索条件"机构=Computer Engineering and Informatics Department & Research Academic Computer Technology Institute"

共 3851 条记录，以下是3021-3030 订阅

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

详细简洁

排序：

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games

Efficient Computation of Approximate Pure Nash Equilibria in...

引用

Annual IEEE Symposium on Foundations of computer Science

作者： Ioannis Caragiannis Angelo Fanelli Nick Gravin Alexander Skopalik Research Academic Computer Technology Institute & Department of Computer Engineering and Informatics University of Patras Rio Greece Division of Mathematical Sciences School of Physical and Mathematical Sciences Nanyang Technological University Singapore

Congestion games constitute an important class of games in which computing an exact or even approximate pure Nash equilibrium is in general PLS-complete. We present a surprisingly simple polynomial-time algorithm that computes O(1)-approximate Nash equilibria in these games. In particular, for congestion games with linear latency functions, our algorithm computes (2 +ε)-approximate pure Nash equilibria in time polynomial in the number of players, the number of resources and 1/ε. It also applies to games with polynomial latency functions with constant maximum degree d: there, the approximation guarantee is d o(d) . The algorithm essentially identifies a polynomially long sequence of best-response moves that lead to an approximate equilibrium; the existence of such short sequences is interesting in itself. These are the first positive algorithmic results for approximate equilibria in non-symmetric congestion games. We strengthen them further by proving that, for congestion games that deviate from our mild assumptions, computing ρ-approximate equilibria is PLS-complete for any polynomial-time computable ρ.

关键词： Games Polynomials Approximation algorithms Nash equilibrium Approximation methods Heuristic algorithms Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised object recognition using flickr images

Semi-supervised object recognition using flickr images

引用

International Workshop on Content-Based Multimedia Indexing

作者： Chatzilari, Elisavet Nikolopoulos, Spiros Papadopoulos, Symeon Zigkolis, Christos Kompatsiaris, Yiannis Centre for Research and Technology Hellas Informatics and Telematics Institute Greece Centre for Vision Speech and Signal Processing University of Surrey Guildford United Kingdom School of Electronic Engineering and Computer Science QueenMary University of London United Kingdom Aristotle University Department of Informatics 54124 Thessaloniki Greece

ISBN: (纸本)9781612844336

In this work we present an algorithm for extracting region level annotations from flickr images using a small set of manually labelled regions to guide the selection process. More specifically, we construct a set of flickr images that focuses on a certain concept and apply a novel graph based clustering algorithm on their regions. Then, we select the cluster or clusters that correspond to the examined concept guided by the manually labelled data. Experimental results show that although the obtained regions are of lower quality compared to the manually labelled regions, the gain in effort compensates for the loss in performance. © 2011 IEEE.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Testing static single cell faults using static and dynamic data background

Testing static single cell faults using static and dynamic d...

引用

2011 IEEE Student Conference on research and Development, SCOReD 2011

作者： Zakaria, Nor Azura Hasan, W.Z.W. Abdul Halin, Izhal Sidek, R.M. Wen, Xiaoqing Microelectronic Department PDSI Technology Park Malaysia Bukit Jalil Kuala Lumpur Malaysia Department of Electrical and Electronic Engineering Faculty Engineering University Putra Malaysia Serdang Selangor Malaysia Department of Creative Informatics Graduate School of Computer Science and System Engineering Kyushu Institute of Technology Iizuka Japan

ISBN: (纸本)9781467301022

This work proposes a bit-adjacent Data Background (DB) management scheme to improve fault coverage of March algorithms while simultaneously maintaining the shortest test cycle. Both static and dynamic DB transitions are used in order to detect Deceptive Read Destructive Faults (DRDFs) and Write Disturb Faults (WDFs) that are not detected by previous algorithms. A conventional March Test Algorithm can be modified by using the DB management scheme to form a new March Test Algorithm (referred to as Mod March Test Algorithm), e.g., MATS++(6N) becoming Mod MATS++(6N). This paper shows that Mod March SR (14N) and Mod March CL (12N) can detect DRDFs and WDFs while the corresponding conventional algorithms cannot. It is also shown that Mod March CL(12N) and Mod March SR(14N) with DB management can detect all Static Single Cell Faults based on the Bit-Oriented-Memories (BOM) test method. Comparisons on test cycle time for Mod March SR, March SR, and March SS in the context of memory Built-In-Self-Test (BIST) are also presented. From the simulation result, it shows that by including Data Backgrounds (DBs) management in Bit-Oriented Memories (BOM), the cycle test time is the same after a given multiple of DBs in the test algorithm. © 2011 IEEE.

关键词： Built-in self test

来源：评论

学校读者我要写书评

暂无评论

Partial power recovery of bend-induced loss using a hybrid index-guiding photonic crystal fiber

Partial power recovery of bend-induced loss using a hybrid i...

引用

Conference on Lasers and Electro-Optics Europe

作者： Markos, Christos Vlachos, Kyriakos Kakarantzas, George Department of Computer Engineering and Informatics University of Patras Rio 26504 Greece Theoretical and Physical Chemistry Institute National Hellenic Research Foundation 48 Vas. Constantinou Ave. 16635 Athens Greece

ISBN: (纸本)9781457705335

Photonic crystal fibers are typically all-silica optical fibers in which a pattern of air-holes running along their entire length [1]. Such fibers allow for the introduction of polymers (and other active materials such as liquid crystals, high index fluids, etc.) into the air regions yielding hybrid polymer/silica waveguides that allow enhanced tunability of guiding properties due to the strong temperature dependence of the polymer refractive index [2, 3]. In this work, we present a solid-core endlessly single mode (ESM) PCF infiltrated with PDMS elastomer conserving index-guiding mechanism. PDMS (poly-dimethylsiloxane) is a polymeric widely used material in optoelectronics (particularly in opto/microfluidics) with refractive index lower than silica (around 1.41). Normally, the temperature dependence of the refractive index is described by the thermo-optic coefficient dn/dT ( 4.5/C for PDMS-Sylgard 184), which quantifies the shift of the refractive index arising from an infinitesimal change of the temperature. Here, we demonstrate the combination of a conventional PCF with the aforomentioned polymeric material and we show how the thermo-optic effect can act in a way to partially reconstruct the fundamental guiding mode highly attenuated by bending losses. © 2011 IEEE.

关键词： Refractive index

来源：评论

学校读者我要写书评

暂无评论

A development of knowledge representation for Thalassemia prevention and control program

A development of knowledge representation for Thalassemia pr...

引用

7th International Conference on Natural Language Processing and Knowledge engineering, NLP-KE 2011

作者： Assawamakin, Anunchai Chalortham, Nopphadol Ruangrajitpakorn, Taneth Limwongse, Chanin Supnithi, Thepchai Tongsima, Sissades Biostatistics and Informatics Laboratory Genome Institute National Center for Genetic Engineering and Biotechnology Pathumthani Thailand Department of Health-Related Informatics Faculty of Pharmacy Silpakorn University Nakornpathom Thailand Language and Semantic Technology Laboratory National Electronics and Computer Technology Center Pathumthani Thailand Department of Research and Development Faculty of Medicine Siriraj Hospital Mahidol University Bangkok Thailand

ISBN: (纸本)9781612847283

The spreading of thalassemia, the most common genetic disease in tropical areas, is increasing due to a migration thus the prevention and control program (PCP) of Thalassemia has been established. To better promote the yet unsuccessful PCP for thalassemia, ontology called PCPThalOnto is developed. The proposed ontology represents domain knowledge while a list of executable production rule is generated to represent operational knowledge. The PCPThalOnto consists of 1) class component to represent concepts of strategies, methodologies, techniques and activities of the PCP and 2) relation component to link between those classes or class and its instance. In the production rules, conditions for individual case determination are employed to execute a proper action. The well-constructed knowledge representation of PCP for thalassemia is developed as an electronic knowledge base for future applications to efficiently disseminate the underlying knowledge to people bridging the gap that deter the success of PCP. © 2011 IEEE.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

A note on parallel finite element approximate inverses using openMP on multicore systems

A note on parallel finite element approximate inverses using...

引用

15th Panhellenic Conference on informatics, PCI 2011

作者： Matskanidis, P.I. Gravvanis, G.A. Giannoutakis, K.M. Department of Electrical and Computer Engineering University Campus Democritus University of Thrace Kimmeria GR 67100 Xanthi Greece Centre for Research and Technology Hellas Informatics and Telematics Institute 6th km Charilaou-Thermi GR 57001 Thermi Thessaloniki Greece

ISBN: (纸本)9780769543895

During the last decades, explicit finite element approximate inverse preconditioning methods have been extensively used for solving efficiently sparse linear systems on multiprocessor and multicomputer systems. New parallel computational techniques are proposed for the parallelization of explicit finite element approximate inverse methods, based on the concept of the "fish bone" computational approach, and explicit preconditioned conjugate gradient type methods, implemented in OpenMP for multicore systems. Finally, numerical results for the performance of the finite element explicit approximate inverse preconditioning for solving characteristic two dimensional boundary value problems on multicore computer systems are presented. Theoretical estimates on speedups and efficiency are also presented. © 2011 IEEE.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Reports of the aaai 2011 Spring symposia

Reports of the aaai 2011 Spring symposia

引用

作者： Buller, Mark Cuddihy, Paul Davis, Ernest Doherty, Patrick Doshi-Velez, Finale Erdem, Esra Fisher, Douglas Green, Nancy Hinkelmann, Knut McLurkin, James Maher, Mary Lou Maheswaran, Rajiv Rubinelli, Sara Schurr, Nathan Scott, Donia Shell, Dylan Szekely, Pedro Thönssen, Barbara Urken, Arnold B. U.S. Army Research Institute of Environmental Medicine Natick MA United States General Electric Research Niskayuna NY United States Department of Computer Science Courant Institute of Mathematical Sciences New York University United States Department of Computer and Information Sciences IDA Linkoping University Sweden Massachusetts Institute of Technology Cambridge MA United States Computer Science and Engineering Department Sabanci University Turkey Department of Electrical Engineering and Computer Science Vanderbilt University United States Department of Computer Science University of North Carolina Greensboro United States Business Information Systems and Studies School of Business University of Applied Sciences Northwestern Switzerland Department of Computer Science Rice University United States Human-Computer Interaction Lab. University of Maryland United States Computer Science Department University of Southern California United States Department of Health Sciences and Health Policy University of Lucerne Swiss Paraplegic Research Switzerland Aptima Inc. United States Department of Informatics University of Sussex United Kingdom Department of Computer Science and Engineering Texas A and M University United States School of Business University of Applied Sciences Northwestern Switzerland College of Engineering University of Arizona United States

The Association for the Advancement of Artificial Intelligence presented the 2011 Spring Symposium Series Monday through Wednesday, March 21-23, 2011, at Stanford University. This report summarizes the eight symposia. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Zeroth-Level Classifier System for Real Time Strategy Games

A Zeroth-Level Classifier System for Real Time Strategy Game...

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： Michalis T. Tsapanos Kyriakos C. Chatzidimitriou Pericles A. Mitkas Department of Electrical and Computer Engineering Aristotle University of Thessaloniki Thessaloniki Greece Informatics and Telematics Institute Centre for Research and Technology Hellas Greece Department of Electrical and Computer Engineering Aristotle University of Thessaloniki Greece

Real Time Strategy games (RTS) provide an interesting test bed for agents that use Reinforcement Learning (RL) algorithms. From an agent's point of view, RTS games constitute a Markovian, partially observable and dynamic environment with a huge state space. In this paper, we present an agent that uses a Zeroth-level Classifier System (ZCS) in order to construct winning policies for this type of games. We also combine ZCS with the replacing traces method in an attempt to improve the behaviour of our agent. We tested the learning abilities of our agent against a static opponent. For the evaluation of our agent, we compare its results with those of a random-acting agent and an agent that uses the SARSA RL algorithm. Results are encouraging since, our ZCS agent managed to outperform the SARSA agent. On the other hand, applying replacing traces to ZCS did not yield the expected results.

关键词： Games Zero current switching Genetic algorithms Minerals Learning systems Real time systems

来源：评论

学校读者我要写书评

暂无评论

A small-gain methodology for networks of iISS retarded systems based on Lyapunov-Krasovskii functionals

A small-gain methodology for networks of iISS retarded syste...

引用

作者： Ito, Hiroshi Jiang, Zhong-Ping Pepe, Pierdomenico Department of Systems Design and Informatics Kyushu Institute of Technology Iizuka Fukuoka 820-8502 Japan Department of Electrical and Computer Engineering Polytechnic Institute of New York University Brooklyn NY 11201 United States Department of Electrical and Information Engineering University of l'Aquila 67040 Poggio di Roio L'Aquila Italy

ISBN: (纸本)9783902661937

A problem of assessing stability of retarded dynamical networks is solved in this paper. Subsystems are assumed to be integral input-to-state stable (iISS). Time-delays are allowed to reside in both subsystems and interconnection channels, and may be both discrete and distributed. No assumption is made on the interconnection topology. This paper develops a small-gain methodology for constructing a Lyapunov-Krasovskii functional of such a network. © 2011 IFAC.

关键词： Time delay

来源：评论

学校读者我要写书评

暂无评论

Dynamic viewing pattern exploitation in Peer-to-Peer Video-on-Demand

Dynamic viewing pattern exploitation in Peer-to-Peer Video-o...

引用

Consumer Communications and Networking Conference, CCNC IEEE

作者： Filippos Koravos Leandros Tassiulas Department of Computer & Communication Engineering University of Thessally Volos Greece Informatics & Telematics Institute Centre for Research and Technology Hellas Thessaloniki Greece

Unstructured BitTorrent-like Peer-to-Peer networks have been extensively studied as an important enabling technology for Video-on-Demand. While most studies maintain the pull-based nature of unstructured Peer-to-Peer networks, recent ones are investigating the combination of pull and push operations. The goal of the proposed push/pull protocols is to make more effcient use of the available bandwidth, however, this paper proposes a different use, the exploitation of users' viewing patterns (random seek patterns) in Video-on-Demand applications. As viewing pattern exploitation has not been given signif cant attention so far, we propose a scheme to prioritize chunk distribution based on the video's points of interest.

关键词： Streaming media Peer to peer computing Protocols Servers Media Electronic mail History

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共386页 << < 299 300 301 302 303 304 305 306 307 308 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：