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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,005 篇 会议
1,951 篇 期刊文献
110 册 图书

馆藏范围

4,066 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,214 篇 工学
- 1,327 篇 计算机科学与技术...
- 1,081 篇 软件工程
- 510 篇 信息与通信工程
- 282 篇 生物医学工程（可授...
- 274 篇 生物工程
- 259 篇 控制科学与工程
- 244 篇 电气工程
- 243 篇 电子科学与技术（可...
- 232 篇 光学工程
- 188 篇 仪器科学与技术
- 162 篇 核科学与技术
- 147 篇 机械工程
- 101 篇 化学工程与技术
- 83 篇 动力工程及工程热...
- 69 篇 材料科学与工程（可...
1,764 篇 理学
- 900 篇 物理学
- 592 篇 数学
- 335 篇 生物学
- 203 篇 统计学（可授理学、...
- 133 篇 化学
- 132 篇 系统科学
- 92 篇 地球物理学
536 篇 管理学
- 328 篇 管理科学与工程(可...
- 225 篇 图书情报与档案管...
- 175 篇 工商管理
284 篇 医学
- 241 篇 临床医学
- 219 篇 基础医学(可授医学...
- 148 篇 药学(可授医学、理...
- 94 篇 公共卫生与预防医...
88 篇 法学
- 73 篇 社会学
68 篇 经济学
48 篇 教育学
44 篇 农学
12 篇 文学
6 篇 艺术学
3 篇 军事学

主题

141 篇 informatics
95 篇 artificial intel...
90 篇 hadron colliders
71 篇 machine learning
71 篇 computer network...
63 篇 higgs bosons
58 篇 wireless sensor ...
55 篇 quality of servi...
55 篇 computational mo...
54 篇 deep learning
52 篇 computer archite...
48 篇 protocols
47 篇 proton-proton in...
45 篇 bandwidth
44 篇 mobile communica...
43 篇 costs
42 篇 electronic mail
41 篇 routing
40 篇 image segmentati...
40 篇 resource managem...

机构

412 篇 department for p...
404 篇 faculty of scien...
398 篇 department of ph...
398 篇 kirchhoff-instit...
386 篇 department of ph...
385 篇 department of ph...
380 篇 institute of phy...
366 篇 fakultät für phy...
366 篇 institute of phy...
336 篇 instituto de fís...
306 篇 department of ph...
281 篇 department of ph...
280 篇 department of ph...
280 篇 graduate school ...
278 篇 dipartimento di ...
278 篇 nikhef national ...
270 篇 universidade fed...
267 篇 department of ph...
265 篇 ictp trieste
258 篇 yerevan physics ...

作者

334 篇 c. alexa
332 篇 j. m. izen
330 篇 g. bella
329 篇 d. calvet
329 篇 c. amelung
327 篇 j. strandberg
324 篇 g. spigo
323 篇 f. siegert
316 篇 r. ströhmer
316 篇 m. rijssenbeek
316 篇 s. jin
316 篇 g. gaudio
316 篇 s. mohapatra
307 篇 s. guindon
305 篇 a. kaczmarska
298 篇 j. schaarschmidt
297 篇 y. tayalati
289 篇 a. d. pilkington
286 篇 l. chevalier
281 篇 m. klein

语言

3,821 篇 英文
210 篇 其他
35 篇 中文
4 篇 日文
1 篇 德文

检索条件"机构=RA Computer Technology Institute and Department of Computer Engineering and Informatics"

共 4066 条记录，以下是3591-3600 订阅

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

详细简洁

排序：

Enabling process automation for service delivery excellence and growth in the Sri Lankan healthcare industry

Enabling process automation for service delivery excellence ...

引用

2nd International Conference on Information and Automation, ICIA 2006

作者： Pereira, Nishanie Jayasena, Sanath Department of Computing Informatics Institute of Technology Colombo Sri Lanka Department of Computer Science and Engineering University of Moratuwa Moratuwa Sri Lanka

ISBN: (纸本)1424405556

Process Automation concentrates on automating structured processes of an organization in order to achieve excellent service delivery by enabling the employees to pay more attention to semi structured or unstructured processes. Achieving service delivery excellence adds value to an organization, increases the customer retention and provides opportunity for strategic growth. The growth of the Sri Lankan healthcare sector is a necessity at this stage due to an increasingly ageing community and a significant increase in non-communicable diseases. Despite many regulations that govern the sector, it continues to be inundated with many problems in relation to delivery of healthcare services. This paper examines service delivery issues in the healthcare institutions in the Western province and suggests mechanisms for automating standard processes in order to achieve strategic growth. © 2006 IEEE.

关键词： Health care

来源：评论

学校读者我要写书评

暂无评论

The power of the defender

The power of the defender

引用

26th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS 2006

作者： Gelastou, Marina Mavronicolas, Marios Papadopoulou, Vicky Philippou, Anna Spirakis, Paul Department of Computer Science University of Cyprus Nicosia CY-1678 Cyprus Department of Computer Engineering and Informatics University of Patras 265 00 Patras Greece Research and Academic Computer Technology Institute 261 10 Patras Greece

ISBN: (纸本)0769525415

We consider a security problem on a distributed network. We assume a network whose nodes are vulnerable to infection by threats (e.g. viruses), the attackers. A system security software, the defender, is available in the system. However, due to the network's size, economic and performance reasons, it is capable to provide safety, i.e. clean nodes from the possible presence of attackers, only to a limited part of it. The objective of the defender is to place itself in such a way as to maximize the number of attackers caught, while each attacker aims not to be caught. In [7], a basic case of this problem was modeled as a non-cooperative game, called the Edge model. There, the defender could protect a single link of the network. Here, we consider a more general case of the problem where the defender is able to scan and protect a set of k links of the network, which we call the Tuple model. It is natural to expect that this increased power of the defender should result in a better quality of protection for the network. Ideally, this would be achieved at little expense on the existence and complexity of Nash equilibria (profiles where no entity can improve its local objective unilaterally by switching placements on the network). In this paper we study pure and mixed Nash equilibria in the model. In particular, we propose algorithms for computing such equilibria in polynomial time and we provide a polynomial-time transformation of a special class of Nash equilibria, called matching equilibria, between the Edge model and the Tuple model, and vice versa. Finally, we establish that the increased power of the defender results in higher-quality protection of the network. © 2006 IEEE.

关键词： Viruses

来源：评论

学校读者我要写书评

暂无评论

The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions 06

The price of optimum in Stackelberg games on arbitrary singl...

引用

SPAA 2006: 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures

作者： Kaporis, A.C. Spirakis, P.G. Department of Computer Engineering and Informatics University of Patras 26500 Patras Greece Research Academic Computer Technology Institute University of Patras P.O. Box 1122 Patras Greece

ISBN: (纸本)1595934529

Let M be a single s-t network of parallel links with load dependent latency functions shared by an infinite number of selfish users. This may yield a Nash equilibrium with unbounded Coordination ratio [12, 26]. A Leader can decrease the coordination ratio by assigning flow αr on M, and then all Followers assign selfishly the (1 - α)r remaining flow. This is a Stackelberg Scheduling Instance (M, r, α), 0 ≤ α ≤ 1. It was shown [23] that it is weakly NP-hard to compute the optimal Leader's strategy. For any such network M we efficiently compute the minimum portion βM of flow r needed by a Leader to induce M's optimum cost, as well as his optimal strategy. Unfortunately, Stackelberg routing in more general nets can be arbitrarily hard. Roughgarden presented a modification of Braess's Paradox graph, such that no strategy controlling αr flow can induce ≤ 1/α times the optimum cost. However, we show that our main result also applies to any s-t net G. We take care of the Braess's graph explicitly, as a convincing example. Copyright 2006 ACM.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

QoS-aware multicommodity flows and transportation planning

QoS-aware multicommodity flows and transportation planning

引用

6th Workshop on Algorithmic Methods and Models for Optimization of railways, ATMOS 2006

作者： Tsaggouris, George Zaroliagis, Christos Computer Technology Institute Patras University Campus N. Kazantzaki Str. 26500 Patras Greece Department of Computer Engineering and Informatics University of Patras 26500 Patras Greece

ISBN: (纸本)9783939897019

We consider the QoS-aware Multicommodity Flow problem, a natural generalization of the weighted multicommodity flow problem where the demands and commodity values are elastic to the Quality-of-Service characteristics of the underlying network. The problem is fundamental in transportation planning and also has important applications beyond the transportation domain. We provide a FPTAS for the QoS-aware Multicommodity Flow problem by building upon a Lagrangian relaxation method and a recent FPTAS for the non-additive shortest path problem.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Investigating bandwidth broker's inter-domain operation for dynamic and automatic end to end provisioning 6

Investigating bandwidth broker's inter-domain operation for ...

引用

6th International Network Conference, INC 2006

作者： Bouras, C. Primpas, D. Research Academic Computer Technology Institute N.Kazantzaki Str. RionPatras26500 Greece Department of Computer Engineering and Informatics University of Patras RionPatras26500 Greece

ISBN: (纸本)1841021571

This paper deals with a distributed bandwidth broker that we try to extend in order to perform inter-domain operation. The basic issues for inter-domain operation are discussed and we try to approach the most demanding issues as the selection of the best inter domain routing path. Generally, we discuss three models for inter domain routing through bandwidth broker, analyzing their advantages. Also, a very important point that affects the interdomain operation is the SLAs between adjacent domains and the capability that a bandwidth broker should have to ask and perform dynamic negotiation. Finally, we analyze the best model and present how it should be incorporated in the existing distributed implementation.

关键词： Bandwidth broker End to end provisioning SLA

来源：评论

学校读者我要写书评

暂无评论

A Cost Mechanism for Fair Pricing of Resource Usage

A Cost Mechanism for Fair Pricing of Resource Usage

引用

Algorithmic Aspects of Large and Complex Networks 2005

作者： Mavronicolas, Marios Panagopoulou, Panagiota N. Spirakis, Paul G. Department of Computer Science University of Cyprus NicosiaCY-1678 Cyprus Department of Computer Engineering and Informatics Patras University Greece Research Academic Computer Technology Institute Patras University N. Kazantzaki Str. Rion PatrasGR 26500 Greece

We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand;demands are drawn according to some probability distribution. The cost paid by an agent for a resource she chooses is the total demand put on the resource divided by the number of agents who chose that same resource. So, resources charge costs in an equitable, fair way, while each resource makes no profit out of the agents. We call our model the Fair Pricing model. Its fair cost mechanism induces a non-cooperative game among the agents. To evaluate the Nash equilibria of this game, we introduce the Diffuse Price of Anarchy, as an extension of the Price of Anarchy that takes into account the probability distribution on the demands. We prove: - Pure Nash equilibria may not exist, unless all chosen demands are identical;in contrast, a fully mixed Nash equilibrium exists for all possible choices of the demands. Further on, the fully mixed Nash equilibrium is the unique Nash equilibrium in case there are only two agents. - In the worst-case choice of demands, the Price of Anarchy is Θ(n);for the special case of two agents, the Price of Anarchy is less than 2 − 1/m. - Assume now that demands are drawn from a bounded, independent probability distribution, where all demands are identically distributed and each is at most a (universal for the class) constant times its expectation. Then, the Diffuse Price of Anarchy is at most that same constant, which is just 2 when each demand is distributed symmetrically around its expectation. © 2006 Dagstuhl Seminar Proceedings. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Cost Sharing Mechanisms for Fair Pricing of Resources Usage

Cost Sharing Mechanisms for Fair Pricing of Resources Usage

引用

Algorithmic Aspects of Large and Complex Networks 2005

作者： Mavronicolas, Marios Panagopoulou, Panagiota N. Spirakis, Paul G. Department of Computer Science University of Cyprus Nicosia CY-1678 Cyprus Department of Computer Engineering and Informatics Patras University Greece Research Academic Computer Technology Institute Patras University N. Kazantzaki Str. Rion PatrasGR 26500 Greece

We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand;demands are drawn according to some probability distribution. The cost paid by an agent for a resource she chooses is the total demand put on the resource divided by the number of agents who chose that same resource. So, resources charge costs in an equitable, fair way, while each resource makes no profit out of the agents. We call our model the Fair Pricing model. Its fair cost mechanism induces a non-cooperative game among the agents. To evaluate the Nash equilibria of this game, we introduce the Diffuse Price of Anarchy, as an extension of the Price of Anarchy that takes into account the probability distribution on the demands. We prove: - Pure Nash equilibria may not exist, unless all chosen demands are identical. In contrast, we have been able to prove that pure Nash equilibria do exist for two closely related cost sharing models, namely the Average Cost Pricing and the Serial Cost Sharing models. - A fully mixed Nash equilibrium exists for all possible choices of the demands. Further on, the fully mixed Nash equilibrium is the unique Nash equilibrium in case there are only two agents. - In the worst-case choice of demands, the Price of Anarchy is Θ(n);for the special case of two agents, the Price of Anarchy is less than 2 − 1/m. - Assume now that demands are drawn from a bounded, independent probability distribution, where all demands are identically distributed and each is at most a (universal for the class) constant times its expectation. Then, the Diffuse Price of Anarchy is at most that same constant, which is just 2 when each demand is distributed symmetrically around its expectation. © 2006 Dagstuhl Seminar Proceedings. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

A method for personalized clustering in data intensive web applications

A method for personalized clustering in data intensive web a...

引用

Joint International Workshop on Adaptivity, Personalization and the Semantic Web, APS'06

作者： Rigou, Maria Sirmakessis, Spiros Tzimas, Giannis Computer Engineering and Informatics Department University of Patras Rio GR-26504 Department of Applied Informatics in Administration and Economy TEI of Messolonghi Nea Ktiria Messolonghi GR-30200 Research Academic Computer Technology Institute Patras University N. Kazantzaki Str. Rio GR-26500

ISBN: (纸本)1595934537

The paper introduces an algorithm for personalized clustering based on a range tree structure, used for identifying all web documents satisfying a set of predefined personal user preferences. The returned documents go through a clustering phase before reaching the end user, thus allowing more effective manipulation and supporting the decision making process. The proposed algorithm demonstrates increased applicability in semantic web settings, since they offer the infrastructure for the explicit declaration of web document attributes and their respective values, thus allowing for more automated retrieval. The proposed algorithm improves the k-means range algorithm, as it uses the already constructed range tree (i.e. during the personalized filtering phase) as the basic structure on which the clustering step is based, applying instead of the k-means, the k-windows algorithm. The total number of parameters used for modeling the web documents dictates the number of dimensions of the Euclidean space representation. The time complexity of the algorithm is O(log d-2n+v), where d is the number of dimensions, n is the total number of web documents and v is the size of the answer. Copyright 2006 ACM.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Using context and a genetic algorithm for knowledge-assisted image analysis

Using context and a genetic algorithm for knowledge-assisted...

引用

1st International Conference on Semantic and Digital Media Technologies, SAMT 2006

作者： Dasiopoulou, Stamatia Papadopoulos, George Th. Mylonas, Phivos Avrtihis, Yannis Kompatsiaris, Ioannis Information Processing Laboratory Electrical and Computer Engineering Department Aristotle University Thessaloniki Greece Informatics and Telematics Institute Centre for Research and Technology Greece Image Video and Multimedia Laboratory School of Electrical and Computer Engineering National Technical University Athens Greece

In this poster, we present an approach to contex-tualized semantic image annotation as an optimization problem. Ontologies are used to capture general and contextual knowledge of the domain considered, and a genetic algorithm is applied to realize the final annotation. Experiments with images from the beach vacation domain demonstrate the performance of the proposed approach and illustrate the added value of utilizing contextual information.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Developing corpora for Statistical Graphical Language Models

Developing corpora for Statistical Graphical Language Models

引用

2006 International Conference on Image Processing, computer Vision, and Pattern Recognition, IPCV'06

作者： O'Sullivan, Andrew Keyes, Laura Winstanley, Adam School of Informatics and Engineering Institute of Technology Blanchardstown Dublin 15 Ireland Department of Computer Science NUI Maynooth Co. Kildare Ireland

ISBN: (纸本)9781932415957

In this work Statistical Graphical Language Models (SGLMs), a technique adapted from Statistical Language Models (SLMs), are applied to the task of graphical object recognition. SLMs are used in Natural Language Processing for tasks such as Speech Recognition and Information Retrieval. SGLMs view graphical objects as belonging to graphical languages and use this view to compute probabilistic distributions of graphical objects within graphical documents. SGLMs such as N-grams require large corpora of training data, which consist of graphical objects in contextual use (real world graphical documents). Constructing corpora is an important stage in developing the models and many issues need to be addressed. This paper discusses the development of graphical corpora and presents approaches to some of the problems encountered.

关键词： Speech recognition

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共407页 << < 356 357 358 359 360 361 362 363 364 365 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：