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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

758 篇 会议
478 篇 期刊文献
5 册 图书

馆藏范围

1,241 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

823 篇 工学
- 384 篇 计算机科学与技术...
- 325 篇 信息与通信工程
- 292 篇 软件工程
- 221 篇 电子科学与技术（可...
- 159 篇 光学工程
- 115 篇 电气工程
- 92 篇 仪器科学与技术
- 77 篇 控制科学与工程
- 50 篇 机械工程
- 38 篇 动力工程及工程热...
- 36 篇 生物工程
- 33 篇 航空宇航科学与技...
- 29 篇 交通运输工程
- 23 篇 材料科学与工程（可...
- 18 篇 安全科学与工程
- 17 篇 网络空间安全
- 15 篇 生物医学工程（可授...
424 篇 理学
- 209 篇 物理学
- 172 篇 数学
- 68 篇 统计学（可授理学、...
- 39 篇 生物学
- 39 篇 系统科学
- 17 篇 化学
130 篇 管理学
- 96 篇 管理科学与工程(可...
- 47 篇 工商管理
- 38 篇 图书情报与档案管...
22 篇 医学
- 18 篇 临床医学
- 17 篇 基础医学(可授医学...
20 篇 法学
- 16 篇 社会学
18 篇 经济学
- 18 篇 应用经济学
3 篇 教育学
3 篇 军事学
2 篇 文学
2 篇 艺术学
1 篇 哲学
1 篇 农学

主题

31 篇 bandwidth
29 篇 quality of servi...
28 篇 computer science
24 篇 resource managem...
24 篇 optical fiber co...
23 篇 computational mo...
21 篇 signal to noise ...
21 篇 throughput
21 篇 protocols
20 篇 routing
20 篇 fiber lasers
19 篇 telecommunicatio...
18 篇 communication ne...
17 篇 quantum cryptogr...
16 篇 delays
16 篇 optimization
16 篇 computer network...
15 篇 wireless sensor ...
14 篇 simulation
14 篇 traffic control

机构

117 篇 state key labora...
39 篇 state key labora...
29 篇 science and tech...
28 篇 state key labora...
27 篇 state key labora...
20 篇 peng cheng labor...
20 篇 state key labora...
15 篇 school of electr...
14 篇 school of comput...
12 篇 state key labora...
12 篇 state key labora...
12 篇 peking universit...
12 篇 state key labora...
11 篇 state key labora...
11 篇 computer network...
11 篇 computer network...
10 篇 school of comput...
10 篇 institute of qua...
10 篇 science and tech...
9 篇 state key labora...

作者

47 篇 guo hong
35 篇 reinhard german
27 篇 zhigang zhang
24 篇 xingjun wang
22 篇 hong guo
22 篇 zhang zhigang
20 篇 chen zhangyuan
19 篇 zhang yichen
19 篇 zhiping zhou
18 篇 german reinhard
17 篇 wang xingjun
17 篇 falko dressler
17 篇 luo bin
16 篇 dressler falko
16 篇 yu song
15 篇 cheng xiang
14 篇 xiang cheng
14 篇 aimin wang
14 篇 zhou zhiping
13 篇 wu guohua

语言

1,141 篇 英文
61 篇 中文
38 篇 其他

检索条件"机构=Computer Science in Communication and Networks"

共 1241 条记录，以下是1201-1210 订阅

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

详细简洁

排序：

A closed-form result for the average pairwise error probability of t = 2, r = 1 differential cyclic unitary space-time modulation

A closed-form result for the average pairwise error probabil...

引用

IEEE Conference on Wireless communications and Networking

作者： Zheng Du N.C. Neaulieu Jinkang Zhu ICORE Wireless Communications Laboratory Department of Electrical & Computer Engineering University of Alberta Edmonton AB Canada Personal Communication Networks and Spread Spectrum Laboratory Department of Electronic Engineering and Information Science University of Science and Technology Hefei China Personal Communication Networks and Spread Spectrum Laboratory University of Science and Technology of China Hefei China Personal Communication Networks and Spread Spectrum Laboratory University of Science and Technology of China Hefei P. R. China

A closed-form expression for the pairwise error probability of cyclic unitary space-time codes with t=2 and r=1 is obtained. Additionally, this result is used to obtain an upper bound to the symbol error rate of cyclic unitary differential space-time group codes. It is also shown that these techniques can be used to approximate the symbol error rate of dicyclic unitary differential space-time group codes.

关键词： Pairwise error probability Receiving antennas Error analysis Transmitting antennas Laboratories Closed-form solution Space time codes Fading Modulation coding Upper bound

来源：评论

学校读者我要写书评

暂无评论

When is wavelength conversion contributing to reducing the blocking rate

When is wavelength conversion contributing to reducing the b...

引用

GLOBECOM'05: IEEE Global Telecommunications Conference, 2005

作者： Jaumard, Brigitte Meyer, Christophe Xiao, Yu Department of Computer Science and Operations Research Université de Montréal suce. centre-ville Montréal Que. H3C 3J7 Canada Canada Research Department of Optimization of Communication Networks Department of Electrical Engineering École Polytechnique de Montréal

ISBN: (纸本)0780394143

Although many studies have now appeared on solving the Routing and Wavelength Assignment (RWA) problem with full or partial wavelength conversion, it is still unclear to which extend the addition of wavelength converters has a significant or even measurable impact on network bandwidth efficiency or on the blocking rate. Indeed, several authors have observed that the blocking rate is often unchanged even with the addition of converters depending on the traffic instances and the network topology. For this reason, some authors, e.g., Ramaswami and Sasaki (1998) or Erlebach and Stefanakos (2003) have investigated further the usefulness or the impact of adding converters. In this study, we pursue in this direction and investigate two issues: performing some preprocessing tests when solving the RWA problem with/without conversion by identifying, at the outset, some lightpaths that will be present in the optimal solution, and some of the patterns that the traffic instances must contain in order to observe an advantage of adding converters. Conclusions are that quite particular traffic patterns must be present in order for wavelength conversion to be useful, and in that case, it is sufficient to have conversion features at a very limited number of nodes. © 2005 IEEE.

关键词： Routers

来源：评论

学校读者我要写书评

暂无评论

Network Capacity Optimization for Latency-Sensitive Traffic in Multiservice IP networks

Network Capacity Optimization for Latency-Sensitive Traffic ...

引用

The 19th International Teletraffic Congress-ITC19

作者： Sanaa Sharafeddine Anton Riedl Thomas Bauschert Institute of Communication Networks Munich University of Technology Arcisstr. 21 80290 Munich Germany Department of Physics Computer Science and Engineering Christopher Newport University One University Place Newport News VA 23606 Siemens AG Information and Communication Networks (ICN) Hofmannstr. 51 81379 Munich Germany

In this paper, we address the problem of capacity assignment for latency-sensitive traffic in multi-service IP networks. The capacity assignment (CA) problem is formulated as an optimization problem with nonlinear constraints, where the total link capacity shares allocated to the given service are minimized subject to performance constraints in terms of end-to-end delay requirements. We introduce a new extension to traditional CA problems by setting a statistical bound on the maximum end-to-end delay experienced by all packets associated with the given latency-sensitive service. For a sample IP network scenario with VoIP traffic, we show that only 3% of additional capacity as compared to the classical approach is required to keep the probability of exceeding the maximum end-to-end delay threshold below 0.1%.

关键词： capacity assignment, quality of service, latency-sensitive traffic in IP networks.

来源：评论

学校读者我要写书评

暂无评论

Random and linear address allocation for mobile ad hoc networks

Random and linear address allocation for mobile ad hoc netwo...

引用

IEEE Conference on Wireless communications and Networking

作者： Nakiung Choi C.K. Toh Yongho Seok Dongkyun Kim Yanghee Choi Sch. of Comput. Sci. & Eng. Seoul Nat. Univ. South Korea Communication Networks Queen''s Mary University of London London UK Communication Networks Queen Mary University of London London UK School of Computer Science and Engineering Seoul National University Seoul Korea Department of Computer Engineering Kyungpook National University Daegu Korea

To join an IP network and communicate with others, a node needs to be configured either manually by an administrator or automatically through a DHCP server. However, the former method is impractical for large networks, while the latter is infeasible in the case of a mobile ad hoc network due to the mobility of the nodes. This paper introduces two distributed IP address auto-configuration mechanisms for mobile ad hoc networks, namely (a) RADA (random address allocation) and (b) LiA (linear allocation). RADA is based on random IP address selection, while LiA linearly assigns new addresses by utilizing the current maximum IP address value. We have also introduced an improved version of LiA, known as LiACR (linear allocation with collision resolution), which reduces control overhead. Then, we discuss extensions of these mechanisms capable of handling network partitioning and merging. Performance evaluations of RADA, LiA and LiACR were conducted through simulation. The results related to address allocation time and control overhead are presented and compared.

关键词： Mobile ad hoc networks Routing protocols Internet computer science communication networks computer networks IP networks Network servers Merging Femtocell networks

来源：评论

学校读者我要写书评

暂无评论

When is wavelength conversion contributing to reducing the blocking rate?

When is wavelength conversion contributing to reducing the b...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： B. Jaumard C. Meyer Xiao Yu Canada Research Chair-Optimization of Communication Networks Canada Department of Computer Science and Operations Research Université de Montreal Montreal QUE Canada Department of Electrical Engineering Ecole Polytechnique de Montrèal Canada

Although many studies have now appeared on solving the routing and wavelength assignment (RWA) problem with full or partial wavelength conversion, it is still unclear to which extend the addition of wavelength converters has a significant or even measurable impact on network bandwidth efficiency or on the blocking rate. Indeed, several authors have observed that the blocking rate is often unchanged even with the addition of converters depending on the traffic instances and the network topology. For this reason, some authors, e.g., Ramaswami and Sasaki (1998) or Erlebach and Stefanakos (2003) have investigated further the usefulness or the impact of adding converters. In this study, we pursue in this direction and investigate two issues: performing some preprocessing tests when solving the RWA problem with/without conversion by identifying, at the outset, some lightpaths that will be present in the optimal solution, and some of the patterns that the traffic instances must contain in order to observe an advantage of adding converters. Conclusions are that quite particular traffic patterns must be present in order for wavelength conversion to be useful, and in that case, it is sufficient to have conversion features at a very limited number of nodes

关键词： Optical wavelength conversion Bandwidth Wavelength assignment Telecommunication traffic Optical fiber networks Wavelength routing Wavelength division multiplexing computer science Operations research communication networks

来源：评论

学校读者我要写书评

暂无评论

Traffic modelling and cost optimization for transmitting traffic messages over a hybrid broadcast and cellular network

Traffic modelling and cost optimization for transmitting tra...

引用

International Conference on Intelligent Transportation

作者： Jing Hu R. German A. Heindl R. Kates M. Unbehaun Department of Science and Traffic Policy University Erlangen-Nuremberg Munich Germany Department of Computer Networks and Communication Systems University Erlangen-Nuremberg Erlangen Germany Department of Science and Traffic Policy Traffic Technology BMW Group Germany Department of Science and Traffic Policy Traffic Technology Munich Germany

Broadcast networks are typically used for distributing common information (music, data) to many users within a given service area, while cellular networks provide point-to-point voice or data delivery to individual users. The fundamental difference from an economic point of view is that cellular networks follow a 'pay-per-use' paradigm with 'per minute' or 'per kbyte' charges, whereas commercial broadcast services (e.g. pay-TV) are charged for by long-term (months or years) subscriptions. In this paper, we investigate a hybrid system for carrying traffic information services. It comprises a data broadcast network for providing the base capacity and a cellular network for carrying the peak traffic exceeding this base capacity. Cellular capacity for the excess data traffic can be purchased whenever needed. However, capacity in broadcast networks is typically leased for long periods of time (potentially several years) at a fixed price. The key problem is how to choose depending on the statistic properties of the input data traffic - the fixed broadcast capacity such that the overall operation cost for the hybrid network is minimized. Results for a telematics service delivering traffic information show that indeed considerable cost savings can be achieved by carefully balancing the capacity allocated in the broadcast network against the peak traffic redirected through the cellular network. The simple analytical model proposed to aid in this tradeoff is validated by simulations.

关键词： Telecommunication traffic Traffic control Cost function Land mobile radio cellular systems Radio broadcasting Digital communication Analytical models computer networks communication system traffic Digital audio broadcasting

来源：评论

学校读者我要写书评

暂无评论

Sojourn time approximations in a two-node queueing network

Sojourn time approximations in a two-node queueing network

引用

The 19th International Teletraffic Congress-ITC19

作者： O.J. Boxma R.D. van der Mei J.A.C. Resing K.M.C. van Wingerden Eindhoven University of Technology Mathematics and Computer Science P.O. Box 513 5600 MB Eindhoven The Netherlands CWI Advanced Communication Networks P.O. Box 94079 1090 GB Amsterdam The Netherlands CWI Advanced Communication Networks P.O. Box 94079 1090 GB Amsterdam The Netherlands Vrije Universiteit Faculty of Sciences De Boelelaan 1081a 1081 HV Amsterdam The Netherlands Eindhoven University of Technology Mathematics and Computer Science P.O. Box 513 5600 MB Eindhoven The Netherlands CWI Advanced Communication Networks P.O. Box 94079 1090 GB Amsterdam The Netherlands

We develop a method for approximating sojourn time distributions in open queueing networks. The work is motivated by the performance analysis of distributed information systems, where transactions are handled by iterative server and database actions. In this paper we restrict ourselves to a system with one server and a single database, modelled as an open two-node queueing network with a processor sharing node and a first-come first-served node. Extensive numerical results are presented for approximations of the mean sojourn time. The accuracy of the approximations is validated with simulations.

关键词： two-node open queueing network, sojourn times, approximation.

来源：评论

学校读者我要写书评

暂无评论

Secure routerless routing

Secure routerless routing

引用

Proceedings of the ACM SIGCOMM 2004 Workshops

作者： Grolmusz, Vince Király, Zoltán Department of Computer Science Eötvös University Budapest Hungary Department of Computer Science Communication Networks Laboratory Eötvös University Budapest Hungary

ISBN: (纸本)158113942X

Suppose that there are n Senders and r Receivers. Our goal is to design a communication network such that long messages can be sent from Sender i to Receiver π(i) such that no other receiver can retrieve the message intended for Receiver π(i). The task can easily be completed using some classical interconnection network and routers in the network. Alternatively, if every Receiver is directly connected to all n Senders, then the Senders can choose which channel to use for communication, without using any router. Fast optical networks are slowed down considerably if routers are inserted in their nodes. Moreover, handling queues or buffers at the routers is extremely hard in all-optical setting. An obvious routerless solution, connecting each possible Sender-Receiver pairs with direct channels seems to be infeasible in most cases. The main result of the present work is the mathematical model of two networks and corresponding network-protocols in which the Senders and the Receivers are connected with only ro(1) channels (in practice no more than 32 channels in both networks);there are no switching or routing-elements in the network, just linear combinations of the signals are computed. Such designs would be usable in fast all-optical networks. In the proof of the security of the networks we do not use any unproven cryptographical or complexity theoretical assumptions: the security is information-theoretically proved, and does not depend on cryptographical primitives.

关键词： Routers

来源：评论

学校读者我要写书评

暂无评论

Performance of Middleware Based Architectures: A Quantitative Approach 30

Performance of Middleware Based Architectures: A Quantitativ...

引用

30th International computer Measurement Group Conference, CMG 2004

作者： Harkema, M. Gijsen, B.M.M. van der Mei, R.D. University of Twente Department of Computer Science Enschede Netherlands TNO Telecom Center of Excellence Quality of Service Delft Netherlands CWI Advanced Communication Networks Amsterdam Netherlands Vrije Universiteit Faculty of Sciences Amsterdam Netherlands

Most of today's E-business applications on the Internet are built upon middleware-based architectures. For service providers offering these applications performance is essential: less-than-acceptable performance levels may lead to customer churn, and thus loss of revenue, and as such directly affect the company's competitive edge. This raises the critical need for service providers to be able to predict and control performance. In this paper we demonstrate the usefulness of a quantitative modeling approach to analyze and predict the performance of middleware-based applications. To this end, we develop a quantitative performance model of middleware architectures based on CORBA, the de-facto standard for object middleware. A particular feature of the model is that it explicitly takes into account priority mechanisms that handle the access to the processors among the different threads. To validate the model we have compared performance predictions from simulation runs with results from lab experiments for a variety of parameter settings. The results show that (1) the inclusion of priority mechanisms in the model leads to a significant improvement of the accuracy of the performance predictions based on the model, and (2) a quantitative modeling approach to assess and predict the performance of middleware-based applications is very promising. © 2004 CMG. All Rights Reserved.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

ETAQA truncation models for the MAP/MAP/1 departure process

ETAQA truncation models for the MAP/MAP/1 departure process

引用

International Conference on the Quantitative Evaluation of Systems (QEST)

作者： A. Heindl Q. Zhang E. Smirni Computer Networks and Communication Systems University of Erlangen Nuremberg Erlangen Germany Department of Computer Science College of William and Mary Williamsburg VA USA

We propose a family of finite approximations for the departure process of a MAP/MAP/1 queue. The departure process approximations are derived via an exact aggregate solution technique (called ETAQA) applied to quasi-birth-death processes (QBDs) and require only the computation of the frequently sparse fundamental-period matrix G. The approximations are indexed by a parameter n, which determines the size of the output model as n-1 QBD levels. The marginal distribution of the true departure process and the lag correlations of the interdeparture times up to lag n+1 are preserved exactly. Via experimentation we show the applicability of the proposed approximation in traffic-based decomposition of queueing networks and investigate how correlation propagates through tandem queues.

关键词： Traffic control Telecommunication traffic Design for quality Queueing analysis computer networks communication systems Autocorrelation computer science Educational institutions Aggregates

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共125页 << < 116 117 118 119 120 121 122 123 124 125 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：