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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

2,975 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,628 篇 工学
- 1,112 篇 计算机科学与技术...
- 856 篇 软件工程
- 724 篇 信息与通信工程
- 252 篇 电子科学与技术（可...
- 202 篇 控制科学与工程
- 197 篇 电气工程
- 146 篇 生物工程
- 119 篇 动力工程及工程热...
- 106 篇 仪器科学与技术
- 93 篇 生物医学工程（可授...
- 88 篇 机械工程
- 82 篇 光学工程
- 64 篇 安全科学与工程
- 52 篇 交通运输工程
- 49 篇 建筑学
- 46 篇 化学工程与技术
703 篇 理学
- 419 篇 数学
- 161 篇 生物学
- 146 篇 统计学（可授理学、...
- 141 篇 物理学
- 101 篇 系统科学
- 52 篇 化学
386 篇 管理学
- 284 篇 管理科学与工程(可...
- 166 篇 工商管理
- 118 篇 图书情报与档案管...
83 篇 医学
- 70 篇 临床医学
- 65 篇 基础医学(可授医学...
- 44 篇 药学(可授医学、理...
74 篇 法学
- 59 篇 社会学
55 篇 经济学
- 55 篇 应用经济学
40 篇 农学
20 篇 教育学
17 篇 军事学
11 篇 文学
3 篇 艺术学

主题

165 篇 bandwidth
159 篇 quality of servi...
157 篇 computer science
156 篇 wireless sensor ...
152 篇 wireless network...
139 篇 throughput
127 篇 computer network...
121 篇 delay
118 篇 wireless communi...
97 篇 intelligent netw...
96 篇 protocols
91 篇 telecommunicatio...
88 篇 routing
83 篇 laboratories
77 篇 interference
75 篇 energy consumpti...
74 篇 mobile computing
72 篇 resource managem...
70 篇 costs
69 篇 fading

机构

189 篇 department of co...
159 篇 graduate institu...
113 篇 state key labora...
68 篇 department of co...
47 篇 networking and i...
43 篇 institute of inf...
38 篇 wireless network...
32 篇 the state key la...
28 篇 laboratory of mu...
27 篇 department of co...
26 篇 graduate institu...
25 篇 advanced network...
25 篇 department of ne...
24 篇 wireless network...
23 篇 department of co...
22 篇 beijing universi...
22 篇 networking proto...
22 篇 research center ...
21 篇 department of co...
20 篇 department of el...

作者

87 篇 xi zhang
48 篇 s.k. das
40 篇 tei-wei kuo
35 篇 kuo tei-wei
34 篇 nirwan ansari
32 篇 zhang xi
30 篇 wu ja-ling
29 篇 niyato dusit
29 篇 robert w. heath
27 篇 sajal k. das
26 篇 pang ai-chun
25 篇 andrews jeffrey ...
25 篇 han zhu
25 篇 chung-ming huang
25 篇 heath jr. robert...
24 篇 ai-chun pang
24 篇 liu pangfeng
23 篇 n. ansari
23 篇 chi-sheng shih
23 篇 hung yi-ping

语言

2,851 篇 英文
98 篇 其他
27 篇 中文

检索条件"机构=Department of Computer Engineering and Networking"

共 2975 条记录，以下是2931-2940 订阅

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

详细简洁

排序：

The effect of exerting adequate persistence in collision avoidance protocols

The effect of exerting adequate persistence in collision avo...

引用

IEEE International Workshop on Mobile Multimedia Communications, MoMuC

作者： J.J. Garcia-Luna-Aceves A. Tzamaloukas Computer Engineering Department University of California Santa Cruz CA USA Sun Microsystems Laboratories Networking and Security Center Palo Alto CA USA

Many medium access control (MAC) protocols based on a collision-avoidance handshake between the sender and the receiver have been proposed for wireless networks. To date, however, the analysis of these protocols has assumed non-persistent strategies in sending control packets for collision avoidance The persistent strategies discussed In the past for CSMA and CSMA/CD provide performance improvements over non-persistent access only at small traffic loads. We present and analyze a limited persistence approach to the transmission of collision-avoidance control packets. With limited persistence, a node senses the channel before sending collision-avoidance control packets. If the channel is sensed busy, the node persists sensing for an amount of time proportional to the transmission time of a control packet, The node can transmit its control packet if the channel is idle within its persistence waiting time and the channel is known to be available for transmissions; otherwise, the node backs off for a random amount of time and tries sending its control packet at the end of that time. We analyze the effect of limited persistence in source-initiated and receive-initiated collision avoidance protocols by comparing their throughput with and without persistence; the analysis shows that limited persistence makes collision-avoidance protocols more efficient.

关键词： Collision avoidance Proportional control Media Access Protocol Access protocols Multiaccess communication Wireless application protocol Wireless networks Performance analysis Telecommunication traffic Throughput

来源：评论

学校读者我要写书评

暂无评论

Link-state routing in networks with unidirectional links

Link-state routing in networks with unidirectional links

引用

International Conference on computer Communications and Networks (ICCCN)

作者： Lichun Bao J.J. Garcia-Luna-Aceves Computer Engineering Department University of California Santa Cruz CA USA Sun Microsystems Laboratories Networking and Security Center Palo Alto CA USA

It is shown that a unidirectional link of a network can be used for routing only if it has an inclusive cycle, which provides a path to carry routing updates from the downstream node to the upstream node joint by the unidirectional link. A new routing algorithm for networks with unidirectional links is then presented, which incrementally disseminates link-state information and selectively utilizes unidirectional links in networks. The new algorithm is verified to be correct and its complexity is analyzed. Simulations on a 20-node unidirectional network show that the new algorithm is more efficient than topology broadcasting.

关键词： Intelligent networks Circuits Network topology Satellite broadcasting Routing protocols Radio broadcasting Tail computer science Algorithm design and analysis Wireless networks

来源：评论

学校读者我要写书评

暂无评论

A new approach to on-demand loop-free multipath routing

A new approach to on-demand loop-free multipath routing

引用

International Conference on computer Communications and Networks (ICCCN)

作者： J. Raju J.J. Garcia-Luna-Aceves Computer Science Department University of California Santa Cruz CA USA Computer Engineering Department University of California Santa Cruz CA USA Sun Microsystems Laboratories Networking and Security Center Palo Alto CA USA

We present and verify ROAM, an on-demand routing algorithm that maintains multiple loop-free paths to destinations. Each router maintains entries only for those destinations for which data flows through the router which reduces storage space requirements and the amount of bandwidth needed to maintain correct routing tables. In ROAM, routes are established and maintained on demand using diffusing computations. A router does not send updates for active destinations, unless its distance to them increases beyond a given threshold. ROAM maintains a state that informs routers when a destination is unreachable and prevents routers from sending unnecessary search packets attempting to find paths to an unreachable destination. ROAM is shown to converge in a finite time after an arbitrary sequence of topological changes and is shown to be loop-free at every instant. The time and communication complexities of ROAM are analyzed.

关键词： Routing Internet Bandwidth Data security Protocols computer science computer networks Maintenance engineering computer security Sun

来源：评论

学校读者我要写书评

暂无评论

A scalable architecture for providing deterministic guarantees

A scalable architecture for providing deterministic guarante...

引用

International Conference on computer Communications and Networks (ICCCN)

作者： S. Vutukury J.J. Garcia-Luna-Aceves Computer Sciences Department University of California Santa Cruz CA USA Computer Engineering Department University of California Santa Cruz CA USA Sun Microsystems Laboratories Networking and Security Center Palo Alto CA USA

The Internet community has proposed the integrated services architecture (Intserv) and the signaling protocol RSVP to provide deterministic guarantees (bandwidth, delay and jitter) to individual flows. However, experience with practical systems has revealed the severe scalability problems of the Intserv model due to the amount of routing and reservation state that is required to he maintained in the routers. A natural approach to improving scalability of the Intserv architecture is through a reduction of the number of states in the routers by using aggregated flow state instead of per-flow state. We present a novel architecture that uses very few states in the routers, while still providing the deterministic guarantees of the Intserv model.

关键词： Scalability Processor scheduling Web and internet services Routing Intserv networks Protocols Bandwidth Delay Aggregates computer architecture

来源：评论

学校读者我要写书评

暂无评论

Multiplexing VBR video and training sequences on wireless fading channels

Multiplexing VBR video and training sequences on wireless fa...

引用

MILCOM, Military Communications Conference

作者： F. Freiha K. Chandra V. Mehta C. Thompson Center for Advanced Computation and Telecommunication Department of Electrical and Computer Engineering University of Massachusetts Lowell Lowell MA USA Optical Networking Group Lucent Technologies Inc. Andover MA USA

A time slotted multiple access scheme that shares bandwidth between source and training signals is proposed for the transmission of variable bit rate (VBR) video signals over non-ideal channels. The error performance is examined using finite state Markov chains that model both the VBR source traffic and the time variation of fading channels. The characteristic time-scale of the fade duration, the step-size parameter of the LMS equalizer training algorithm, and the number of training sequences allocated per time slot jointly influence the error performance. The consideration of the physical layer characteristics in the design of higher layer protocols enhances the performance of conventional application layer based preventive and reactive error control schemes. Simulation results for fast and slow fading channels show that the proposed channel access scheme can lead to an order of magnitude decrease in the bit error ratio if the combination of training overhead and step-size parameter are chosen judiciously with respect to the fading time-scale. In addition, the multiplexing efficiency of VBR encoded video is shown to be useful for limiting the channel access delays when training overhead is increased.

关键词： Fading Video sharing Bandwidth Bit rate Traffic control Least squares approximation Equalizers Physical layer Access protocols Error correction

来源：评论

学校读者我要写书评

暂无评论

A quantitative approach to nonlinear process design rule scaling [VLSI]

A quantitative approach to nonlinear process design rule sca...

引用

Conference on Advanced Research in VLSI

作者： S.M. Gold B. Bernhardt R.B. Brown Electrical Engineering and Computer Science Department University of Michigan Ann Arbor MI USA Networking and Computing Systems Group Semiconductor Products Sector Motorola Inc. Tempe AZ USA

This paper describes a quantitative methodology for selecting nonlinear design rule scale factors that provide the most cost-efficient improvements in IC performance and area. The methodology includes identifying the design rules which have the greatest impact on the scaling objective and analyzing the area and performance improvements as these rules are scaled through a range of practical scale factors. Power and delay improvement data are then combined with die cost estimates to produce a cost/benefit ratio, a quantitative metric for design rule scaling cost-efficiency. The slopes and inflection points of cost/benefit vs. scale factor plots will guide process engineers in selecting scale factors for the various design rules. This procedure is repeated using the results of one iteration as the starting point for the next. The cost/benefit analysis methodology is demonstrated by comparing embedded static RAMs implemented in a complementary GaAs (CGaAs/sup TM/) process. The SRAMs are generated by a process-independent, optimizing SRAM compiler which can create SRAM macrocells for any complementary technology. A cost/benefit analysis of the CGaAs design rules shows that when operating under a fixed spending cap for process scaling research, development, and capital equipment acquisition, nonlinear scaling can provide greater improvements in area and performance than linear scaling. The results also show that for a 0.5 /spl mu/m CGaAs process to be fabricated in high volume, the first scaling step should be a 30% reduction of the source drain area and via/metal pitch, gate metal to ohmic spacing, and gate metal spacing design rules.

关键词： Process design Performance analysis Delay estimation Cost benefit analysis Random access memory Design engineering Power engineering and energy Gallium arsenide Optimizing compilers Macrocell networks

来源：评论

学校读者我要写书评

暂无评论

Performance of VBR video with equalization on wireless fading channels

Performance of VBR video with equalization on wireless fadin...

引用

Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042)

作者： F. Freiha K. Chandra V. Mehta C. Thompson Center for Advanced Computation and Telecommunications Department of Electrical and Computer Engineering University of Massachusetts Lowell Lowell MA USA Optical Networking Group Lucent Technologies Bell Laboratories North Andover MA USA

The error and delay performance of variable bit rate (VBR) video transmission over non-ideal channels is examined using equalization schemes. The temporal correlation features of the fading signal and the source video are modeled using finite state Markov chains. The source and training signals are multiplexed using a time slotted multiple access scheme. For slow-fading channels, the characteristic time-scale of the fade durations, the step-size parameter of the LMS equalizer training algorithm, and the number of training sequences allocated per time slot are found to jointly influence error performance. Simulation results show that the proposed channel access scheme can lead to an order of magnitude decrease in the bit error ratio if the combination of training overhead and step-size parameter are chosen judiciously with respect to the fading time-scale. In addition, the multiplexing efficiency of VBR encoded video is shown to be useful for limiting the channel access delays when the training overhead is increased.

关键词： Fading Error correction Bit rate Delay Time division multiple access Bandwidth Forward error correction Equalizers Layout Video sharing

来源：评论

学校读者我要写书评

暂无评论

Risk management in software development: a technology overview and the Riskit method 99

Risk management in software development: a technology overvi...

引用

Proceedings of the 21st international conference on Software engineering

作者： Jyrki Kontio Nokia Telecommunications IP Networking P.O. Box 315 00045 NOKIA GROUP Finland and Helsinki University of Technology Department of Computer Science and Engineering P.O. Box 1100 FIN-02015 HUT Finland

No abstract available.

ISBN: (纸本)9781581130744

No abstract available.

关键词： project management

来源：评论

学校读者我要写书评

暂无评论

An algorithm for multipath computation using distance-vectors with predecessor information

An algorithm for multipath computation using distance-vector...

引用

International Conference on computer Communications and Networks (ICCCN)

作者： S. Vutukury J.J. Garcia-Luna-Aceves Comput. Sci. Dept. California Univ. Santa Cruz CA USA Sun Microsystems Laboratories Networking and Security Center Palo Alto CA USA Computer Engineering Department University of California Santa Cruz CA USA

Routing algorithms in the IP Internet provide a single path between each source-destination pair and where more than one path is provided, they are paths of equal length. Single-path routing is inherently slow in responding to congestion and temporary traffic bursts; multiple paths are better suited to handle congestion. Also the paths provided in RIP and OSPF are not free of loops during times of network transition, which can be debilitating to network performance. We present a distributed routing algorithm for computing multiple paths that need not have equal length between each source-destination pair in a computer network such that they are loop-free at every instant - in steady state as well as during network transitions. The algorithm is scalable to large networks as it uses only one-hop synchronization which is unlike diffusing computations that require internodal synchronization spanning multiple hops. The safety and liveness properties of the algorithm are proven and its complexity is analyzed.

关键词： computer networks Partitioning algorithms Internet Distributed computing Steady-state Routing protocols Costs Telecommunication traffic Safety Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for multipath computation

A distributed algorithm for multipath computation

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： S. Vutukury J.J. Garcia-Luna-Aceves Dept. of Comput. Sci. California Univ. Santa Cruz CA USA Networking and Security Center Sun MicroSystems Laboratories Inc. Palo Alto CA USA Computer Engineering Department University of California Santa Cruz CA USA

Today's Internet routing protocols either provide a single path between each source-destination pair, or multiple paths of equal length. Furthermore, the paths provided by RIP and OSPF are not free of loops during times of network transition. Single-path routing algorithms are inherently slow in responding to congestion and temporary traffic bursts; consequently, the delays experienced by packets in these networks are far from optimal. Recently, we developed a framework for designing routing algorithms that offer "near-optimal" delays; a key component In this framework consists of using a fast responsive routing protocol that builds multipaths for each destination in the computer network, such that they are loop-free at all times. This paper studies the performance of MPATH (multipath routing algorithm) by simulation and compares it against the performance of other state-of the-art routing algorithms.

关键词： Distributed algorithms Distributed computing Internet Routing protocols Algorithm design and analysis Costs computer networks Telecommunication traffic Tree graphs Steady-state

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共298页 << < 289 290 291 292 293 294 295 296 297 298 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：