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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

456 篇 会议
139 篇 期刊文献
12 册 图书

馆藏范围

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

日期分布

学科分类号

348 篇 工学
- 229 篇 计算机科学与技术...
- 187 篇 软件工程
- 99 篇 信息与通信工程
- 44 篇 光学工程
- 43 篇 控制科学与工程
- 41 篇 生物医学工程（可授...
- 38 篇 电子科学与技术（可...
- 32 篇 生物工程
- 30 篇 电气工程
- 14 篇 仪器科学与技术
- 9 篇 机械工程
- 8 篇 动力工程及工程热...
- 8 篇 化学工程与技术
- 8 篇 航空宇航科学与技...
173 篇 理学
- 73 篇 数学
- 72 篇 物理学
- 42 篇 生物学
- 24 篇 统计学（可授理学、...
- 17 篇 系统科学
- 12 篇 化学
91 篇 管理学
- 55 篇 管理科学与工程(可...
- 41 篇 图书情报与档案管...
- 32 篇 工商管理
41 篇 医学
- 34 篇 临床医学
- 28 篇 基础医学(可授医学...
- 18 篇 药学(可授医学、理...
- 13 篇 公共卫生与预防医...
19 篇 经济学
- 18 篇 应用经济学
13 篇 教育学
- 13 篇 教育学
9 篇 法学
- 8 篇 社会学
3 篇 农学
1 篇 文学
1 篇 军事学

主题

53 篇 informatics
33 篇 computer network...
25 篇 optical fiber ne...
23 篇 quality of servi...
19 篇 computer archite...
18 篇 bandwidth
15 篇 routing
15 篇 throughput
15 篇 costs
15 篇 3g mobile commun...
15 篇 protocols
15 篇 delay
15 篇 telecommunicatio...
14 篇 power control
13 篇 traffic control
13 篇 interference
13 篇 internet
13 篇 topology
13 篇 streaming media
11 篇 application soft...

机构

46 篇 research academi...
32 篇 computer enginee...
28 篇 research academi...
24 篇 computer enginee...
16 篇 department of ph...
16 篇 faculty of scien...
16 篇 department of co...
15 篇 kirchhoff-instit...
15 篇 institute of phy...
15 篇 department of ph...
14 篇 department of ph...
14 篇 department of ph...
14 篇 institute of phy...
13 篇 department of ph...
13 篇 infn sezione di ...
13 篇 institute for pa...
13 篇 department for p...
13 篇 department of ph...
13 篇 infn sezione di ...
13 篇 bahcesehir unive...

作者

36 篇 christos bouras
34 篇 bouras christos
18 篇 alexiou antonios
16 篇 antonios alexiou
14 篇 bona m.
14 篇 bachacou h.
14 篇 bressler s.
14 篇 c. bouras
12 篇 k. christodoulop...
11 篇 vasileios kokkin...
10 篇 andreas papazois
9 篇 papazois andreas
9 篇 kyriakos vlachos
9 篇 baranyi péter
8 篇 bellos p.
8 篇 chen h.
8 篇 kaklamanis chris...
8 篇 boumediene d.
8 篇 e. a. varvarigos
8 篇 k. manousakis

语言

582 篇 英文
16 篇 其他
9 篇 中文

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

共 607 条记录，以下是471-480 订阅

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

详细简洁

排序：

An efficient multicast packet delivery scheme for UMTS

An efficient multicast packet delivery scheme for UMTS

引用

ACM MSWiM 2006 - 9th ACM Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems

作者： Alexiou, Antonios Antonellis, Dimitrios Bouras, Christos Papazois, Andreas Research Academic Computer Technology Institute GR 26500 Patras Greece Computer Engineering and Informatics Department University of Patras GR 26500 Patras Greece

ISBN: (纸本)1595934774

In this paper we present an efficient scheme for the multicast transmission of the data in the Universal Mobile Telecommunications System (UMTS). We take advantage of the tree topology of the examined network and we introduce the use of Routing Lists (RLs) in the nodes of the UMTS. The adoption of these lists leads to the decrement of the transmitted packets and the efficient use of network resources during the multicast transmission of the data. We describe in detail the necessary steps for the successful multicast transfer of data. Furthermore, we analyze the handling of special cases such as user mobility scenarios. Especially, the various handover types are examined along with the Serving Radio Network Subsystem (SRNS) relocation procedure. Copyright 2006 ACM.

关键词： Packet switching

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Content-based time sampling for efficient video delivery over networks of low and variable bandwidth

Content-based time sampling for efficient video delivery ove...

引用

International Conference on Digital Telecommunications 2006, ICDT'06

作者： Doulamis, Anastasios D. Kosmopoulos, Dimitrios I. Doulamis, Nikolaos D. National Technical University of Athens Dept. of Electrical and Computer Engineering National Centre for Scientific Research Demokritos Institute of Informatics and Telecommunications

ISBN: (纸本)0769526500

A new content-based algorithm is proposed for efficient delivery of video sequences under networks of low and variable bandwidth. It dynamically discards the audiovisual content that cannot be afforded by the network, (e.g., due to bandwidth variations), at a content cost, which outperforms the popular linear frame skipping method. The algorithm estimates a) the amount of information that can be currently delivered by the network and b) the most representative of the frames that would be normally transmitted. All calculations are performed directly on the MPEG compressed domain requiring minimal decoding of the captured multimedia information. The computational complexity of the proposed scheme is also minimal and thus it can be applied in almost real time. A proposed objective evaluation scheme reveals the validity of the approach. © IEEE.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Mertacor: A successful autonomous trading agent 06

Mertacor: A successful autonomous trading agent

引用

Fifth International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

作者： Toulis, Panos Kehagias, Dionisis Mitkas, Pericles A. Aristotle University of Thessaloniki Dept. of Electrical and Computer Engineering 54124 Thessaloniki Greece Centre for Research and Technology Hellas Informatics and Telematics Institute 57001 Thermi Greece

ISBN: (纸本)1595933034

In this paper we present the internal architecture and bidding mechanisms designed for Mertacor, a successful trading agent, which ended up first in the Classic Trading Agent Competition (TAC) of 2005. TAC provides a realistic benchmarking environment in which different trading agents compete with each other in order to best satisfy their clients' preferences and maximize their total profit. The "travel game" scenario of TAC involves three types of auctions;a) continuous one-sided that sell flight tickets, b) ascending multi-unit auctions for booking hotel rooms, and c) continuous double auctions for entertainment tickets. For each one of these types, we describe the techniques deployed by Mertacor. In flight auctions prices are updated according to a random walk process, thus the accurate prediction of the next update is not feasible. A key element of agent behavior in these auctions is its ability to accurately deduce the specific time in an auction, at which bidding will be profitable. In order to deal with the uncertainty due to price fluctuations in flight auctions and to provide our agent with an efficient decision mechanism, we have designed the z-heuristic framework. The goal of z-heuristic is to figure out when the price assumes its minimum value and recommend bidding at that moment. In the case of hotel auctions, Mertacor used fuzzy reasoning in conjunction with rule-based reasoning in order to predict the closing prices of hotel rooms, when historical data from past auctions are available. In order to bid efficiently in entertainment auctions, we have designed a bidding strategy whose goal is to preserve a pre-specified long-term profit. We finally present and discuss the results of agent benchmarking in the TAC Classic game. Copyright 2006 ACM.

关键词： Autonomous agents

来源：评论

学校读者我要写书评

暂无评论

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 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

来源：评论

学校读者我要写书评

暂无评论

Equation based congestion control for video transmission over WCDMA networks

Equation based congestion control for video transmission ove...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： A. Alexiou D. Antonellis C. Bouras Research Academic Computer Technology Institute Greece and Computer Engineering and Informatics Department University of Patras Greece

The scheme of real time streaming video is one of the newcomers in wireless data communication, raising a number of new requirements in both telecommunication and data communication systems. This scheme is applied when the user experiences real time multimedia content. Rate control is an important issue in video streaming applications for both wired and wireless networks. A widely accepted rate control method in wired networks is equation based rate control. In this work, we focus on a mechanism for equation based congestion control for video transmission over WCDMA networks. With our mechanism, the sender explicitly adjusts its sending rate as a function of the measured rate of loss events, the round trip time and the packet size. Furthermore, we examine the performance of UMTS air interface for real time video transmission using real time protocols, through a number of experiments.

关键词： Equations Multiaccess communication Communication system control Telecommunication control Streaming media Data communication Telecommunication congestion control Real time systems Wireless communication Wireless networks

来源：评论

学校读者我要写书评

暂无评论

A Slow Start Power Control MAC Protocol for Mobile Ad HOC Networks

A Slow Start Power Control MAC Protocol for Mobile Ad HOC Ne...

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Vasilis S. Gkamas Emmanouel A. Varvarigos Computer Engineering and Informatics Research Academic Computer Technology Institute University of Patras Rio-Patras Greece

We propose a MAC protocol for mobile ad hoc networks that uses power control for the RTS/CTS and DATA frame transmissions in order to improve energy and capacity utilization efficiency. Unlike IEEE 802.11, in our scheme the RTS frames are not sent using the maximum transmission power to silence neighbouring nodes, and the CTS frames do not silence all receiving nodes to the same degree. In contrast, the transmission power of the RTS frames follows a slow start principle, while the CTS frames, which are sent at maximum transmission power, prevent the neighbouring nodes from transmitting their DATA frames with power more than a computed threshold, while allowing them to transmit at power levels less than that threshold. This is done by including in the RTS and the CTS frames additional information, such as the power of the transmissions, and the interference tolerance of the nodes. Moreover the DATA frames are sent at the minimum required transmission power increased by a small margin to ensure connectivity with the intended receiver, so as to cause minimal interference to neighbouring nodes and allow for future interference to be added to the receiver of the DATA frames. The power to be used by the transmitter is computed by the recipient of the RTS frame and is included in the CTS frame. It is expected that a network with such a power management scheme would achieve a better throughput performance and more power savings than a network without such a scheme

关键词： Power control Media Access Protocol Mobile ad hoc networks Interference computer networks Power engineering computing Design engineering Power engineering and energy informatics Throughput

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共61页 << < 44 45 46 47 48 49 50 51 52 53 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：