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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

889 篇 会议
11 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

487 篇 工学
- 369 篇 计算机科学与技术...
- 348 篇 电气工程
- 212 篇 信息与通信工程
- 92 篇 软件工程
- 21 篇 控制科学与工程
- 14 篇 电子科学与技术（可...
- 12 篇 生物工程
- 11 篇 生物医学工程（可授...
- 9 篇 机械工程
- 8 篇 光学工程
- 6 篇 土木工程
- 6 篇 网络空间安全
- 5 篇 动力工程及工程热...
- 5 篇 航空宇航科学与技...
- 4 篇 建筑学
- 3 篇 力学（可授工学、理...
- 3 篇 石油与天然气工程
- 3 篇 交通运输工程
- 2 篇 水利工程
57 篇 理学
- 36 篇 数学
- 13 篇 物理学
- 13 篇 生物学
- 10 篇 统计学（可授理学、...
35 篇 管理学
- 31 篇 管理科学与工程(可...
- 12 篇 工商管理
- 7 篇 图书情报与档案管...
11 篇 教育学
- 11 篇 教育学
5 篇 法学
- 5 篇 社会学
4 篇 医学
- 3 篇 基础医学(可授医学...
2 篇 经济学
- 2 篇 应用经济学
1 篇 军事学

主题

112 篇 computer network...
73 篇 wireless sensor ...
50 篇 wireless network...
40 篇 throughput
39 篇 bandwidth
38 篇 telecommunicatio...
33 篇 protocols
31 篇 computer science
31 篇 neural networks
31 篇 delay
29 篇 routing
29 篇 computer archite...
28 篇 routing protocol...
27 篇 ad hoc networks
27 篇 quality of servi...
26 篇 costs
24 篇 ip networks
23 篇 traffic control
23 篇 network topology
21 篇 conferences

机构

5 篇 department of co...
4 篇 univ hong kong d...
4 篇 xidian univ stat...
4 篇 tsinghua univ de...
4 篇 institute of com...
4 篇 graduate school ...
4 篇 univ texas austi...
3 篇 univ sci & techn...
3 篇 univ calif river...
3 篇 univ politecnica...
3 篇 tsinghua univ de...
3 篇 univ sci & techn...
3 篇 univ wisconsin m...
3 篇 school of comput...
3 篇 univ calif los a...
3 篇 iit dept comp sc...
3 篇 politecnico di t...
3 篇 tsinghua nationa...
3 篇 tsinghua univ in...
3 篇 imdea networks i...

作者

4 篇 steinmetz ralf
4 篇 ralf steinmetz
3 篇 muntean gabriel-...
3 篇 li xin
3 篇 jayasumana anura...
3 篇 boukerche azzedi...
3 篇 li yong
3 篇 hollick matthias
3 篇 matthias hollick
3 篇 farid naït-abdes...
3 篇 wan peng-jun
3 篇 li xiaoming
3 篇 azzedine boukerc...
3 篇 hossam hassanein
3 篇 leonardi emilio
3 篇 wang xinbing
3 篇 libman lavy
3 篇 anura p. jayasum...
3 篇 wei yang
3 篇 lavy libman

语言

895 篇 英文
5 篇 其他

检索条件"任意字段=IEEE 34th Conference on Local Computer Networks"

共 900 条记录，以下是211-220 订阅

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

详细简洁

排序：

Virtual Machine Placement for Minimizing Connection Cost in Data Center networks

Virtual Machine Placement for Minimizing Connection Cost in ...

引用

34th ieee conference on computer Communications (INFOCOM)

作者： Fukunaga, Takuro Hirahara, Shuichi Yoshikawa, Hiyori Natl Inst Informat Tokyo Japan Univ Tokyo Tokyo 1138654 Japan JST ERATO Kawarabayashi Large Graph Project Tokyo Japan

ISBN: (纸本)9781467371315

Virtualization is a key technology for the efficient operation of massive data centers. To minimize the communication costs among virtual machines (VMs) in a data center network, we formulate an optimization problem for finding efficient VM placements. In this problem, a set of requests is received from customers, where each request is defined as the required number of VMs. the problem seeks to determine those physical machines in the network that host the requested VMs under a capacity constraint such that the number of VMs placed on each physical machine does not exceed that of the available slots. To minimize the load of the networks, for each request, we consider the connection cost of the VM placements, which is defined as the minimum length of networks connecting all physical host machines and the root node. the objective in the problem is to minimize the total connection costs. We present an approximation algorithm for this optimization problem.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Formation Games of Reliable networks 34

Formation Games of Reliable Networks

引用

34th ieee conference on computer Communications (INFOCOM)

作者： Meirom, Eli A. Mannor, Shie Orda, Ariel Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

ISBN: (纸本)9781479983810

We establish a network formation game for the Internet's Autonomous System (AS) interconnection topology. the game includes different types of players, accounting for the heterogeneity of ASs in the Internet. We incorporate reliability considerations in the player's utility function, and analyze static properties of the game as well as its dynamic evolution. We provide dynamic analysis of topological quantities, and explain the prevalence of some "network motifs" in the Internet graph. We assess our predictions with real-world data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

local Face-View Barrier Coverage in Camera Sensor networks 34

Local Face-View Barrier Coverage in Camera Sensor Networks

引用

34th ieee conference on computer Communications (INFOCOM)

作者： Yu, Zuoming Yang, Fan Teng, Jin Champion, Adam C. Xuan, Dong Jiangsu Univ Sci & Technol Dept Basic Courses Nanjing Peoples R China Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

ISBN: (纸本)9781479983810

Barrier coverage in visual camera sensor networks (visual barrier coverage) has important real-world applications like battlefield surveillance, environmental monitoring, and protection of government property. Cost-effective deployment, a fundamental issue of visual barrier coverage, considers how to deploy the fewest camera sensors along the barrier to detect intruders (e.g., capture faces) with desirable performance. Existing visual barrier coverage approaches like full-view coverage require numerous camera sensors for capturing intruders' faces deterministically for any trajectory and facing angle. However, intruders' trajectories and facing angles are bounded and deterministic intruder detection requires many camera sensors for rare intrusion cases. Certain practical applications can tolerate limited intrusion mis-detection given budget limitations. this paper proposes local face-view barrier coverage, a novel concept that achieves statistical barrier coverage in camera sensor networks leveraging intruders' trajectory lengths l along the barrier and head rotation angles delta. Using (l, delta) and other parameters, we derive a rigorous probability bound for intruder detection for local face-view barrier coverage via a feasible deployment pattern. Our detection probability bound and deployment pattern can guide practical camera sensor network deployments with camera sensor budgets. Extensive evaluations show that local face-view barrier coverage requires up to 50% fewer camera sensors than full-view barrier coverage.

关键词： Barrier coverage camera sensor networks

来源：评论

学校读者我要写书评

暂无评论

Supporting WiFi and LTE Co-existence 34

Supporting WiFi and LTE Co-existence

引用

34th ieee conference on computer Communications (INFOCOM)

作者： Yun, Sangki Qiu, Lili Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781479983810

Motivated by the recent push to deploy LTE in unlicensed spectrum, this paper develops a novel system to enable co-existence between LTE and WiFi. Our approach leverages LTE and WiFi antennas already available on smartphones to let LTE and WiFi transmit together and successfully decode the interfered signals. Our system offers several distinct advantages over existing MIMO work: (i) it can decode all the interfering signals under cross technology interference even when the interfering signals have similar power and occupy similar frequency, (ii) it does not need clean reference signals from either WiFi or LTE transmission, (iii) it can decode interfering WiFi MIMO and LTE transmissions, and (iv) it has a simple yet effective carrier sense mechanism for WiFi to access the medium under interfering LTE signals while avoiding other WiFi transmissions. We use USRP implementation and experiments to show its effectiveness.

关键词： Wireless local area networks (WLAN)

来源：评论

学校读者我要写书评

暂无评论

Measuring Cascade Effects in Interdependent networks by Using Effective Graph Resistance

Measuring Cascade Effects in Interdependent Networks by Usin...

引用

34th ieee conference on computer Communications (INFOCOM)

作者： Tauch, Sotharith Liu, William Pears, Russel Auckland Univ Technol Sch Comp & Math Sci Auckland New Zealand

ISBN: (纸本)9781467371315

Understanding the correlation between the underlie network structure and overlay cascade effects in the interdependent networks is one of major challenges in complex network studies. there are some existing metrics that can be used to measure the cascades. However, different metrics such as average node degree interpret different characteristic of network topological structure, especially less metrics have been identified to effectively measure the cascading performance in the interdependent networks. In this paper, we propose to use a combined Laplacian matrix to model the interdependent networks and their interconnectivity, and then use its effective resistance metric as an indicator to its cascading behavior. Moreover, we have conducted extensive comparative studies among different metrics such as average node degree, and the proposed effective resistance. We have found that the effective resistance metric can describe more accurate and finer characteristics of topological structure of the interdependent networks than average node degree which is widely adapted by the existing research studies for measuring the cascading performance in the interdependent networks.

关键词： Interconnected networks Network robustness Topopogical metrics Effective graph resistance Average node degree Cascade effects

来源：评论

学校读者我要写书评

暂无评论

Network Reachability Analysis on Temporally Varying Interaction networks

Network Reachability Analysis on Temporally Varying Interact...

引用

34th ieee conference on computer Communications (INFOCOM)

作者： Xu, Zhonghu Xing, Kai Zhang, Shuo Li, Wei Xu, Jing Univ Sci & Technol China Sch Comp Sci Hefei 230027 Peoples R China

ISBN: (纸本)9781467371315

the Internet has become one of the most important elements in our daily lives. there are plenty of interactive applications available for billions of users that provide different kinds of interactions. these user interactions may form an intermittently connected network for information propagation. In such networks, e.g., interactive forum, website, and tweeter-like online social applications, user behavior generally exhibits temporally varying features due to the extensive temporal-spatial diversity and sparsity among user interactions ( such as users' online/offline activities). It is easy to see that at any time and area, any pair of users in a temporally varying interaction network are not necessarily connected since there may not exist such a path between them. Usually each piece of information between them is transmitted intermittently at different discrete time series, and thus, form a path in a chronological order.

关键词： Information dissemination

来源：评论

学校读者我要写书评

暂无评论

Anticipatory Quality-Resource Allocation for Multi-User Mobile Video Streaming

Anticipatory Quality-Resource Allocation for Multi-User Mobi...

引用

34th ieee conference on computer Communications (INFOCOM)

作者： Bui, Nicola Valentin, Stefan Widmer, Joerg IMDEA Networks Inst Leganes Madrid Spain UC3M Leganes Madrid Spain Huawei Technol FRC Math & Algorithm Sci Lab Boulogne France

ISBN: (纸本)9781467371315

Mobile video delivery forms the largest part of the traffic in cellular networks. thus optimizing the resource allocation to satisfy a user's quality of experience is becoming paramount in modern communications. this paper belongs to the line of research known as anticipatory networking that makes use of prediction of wireless capacity to improve communication performance. In particular, we focus on the problem of optimal resource allocation for steady video delivery under maximum average quality constraints for multiple users. We formulate the problem as a piecewise linear program and provide a heuristic algorithm, which solution is close to optimal. Based on our formulation we are now able to trade off minimum video quality, average quality and offered network capacity.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

WAN as a Service for Cloud via Software-Defined Network and Open APIs

WAN as a Service for Cloud via Software-Defined Network and ...

引用

34th ieee conference on computer Communications (INFOCOM)

作者： Yan, Huan Liu, Jiaqiang Li, Yong Dong, Wenxia Lin, Chengyong Jin, Depeng Tsinghua Univ Dept Elect Engn Beijing Peoples R China Huawei Technol Co Ltd Shenzhen Guangdong Peoples R China

ISBN: (纸本)9781467371315

the performance of wide area network (WAN) has a direct impact on user experience of cloud usage. In order to provide on-demand and performance-assured WAN connections, we design and implement a SDN-based system called Grace, which abstracts the underlying network resources into life-cycle network services to provide the predefined network performance via open APIs. With the advantages of this system, we demonstrate that WAN as a service for cloud can be achieved in event of the deployed Grace.

关键词： Wide area networks

来源：评论

学校读者我要写书评

暂无评论

Partition-based Caching in Information-Centric networks

Partition-based Caching in Information-Centric Networks

引用

34th ieee conference on computer Communications (INFOCOM)

作者： Sourlas, Vasilis Georgatsos, Panos Flegkas, Paris Tassiulas, Leandros UCL London England CERTH Iraklion Greece Yale New Haven CT USA

ISBN: (纸本)9781467371315

We place in the context of Information-Centric networks a special class of segment-based caching, named partition-based caching, whereby information items are cached in partitions at different caches in the network. Our rationale lies in exploiting the merits of parallel data transmission, which however may come at the expense of increased network utilization. the study of this cost-benefit trade-off underlines our work. Following a theoretical analysis on the benefits of partition-based caching over single replication caching, we propose three traffic engineering algorithms for assigning content partitions to caches and respective routes. Simulation results indicate that partition-based caching can indeed improve average content transfer time (up to 65%) at the expense of a tolerable increase in network load (up to 25%), for moderate numbers of content partitions (less than 6), balancing at the same time network load better (at the level of 50%), compared to single replication caching.

关键词： partition-based caching information-centric networks traffic engineering content placement/assignment routing

来源：评论

学校读者我要写书评

暂无评论

Content Caching and Delivery over Heterogeneous Wireless networks 34

Content Caching and Delivery over Heterogeneous Wireless Net...

引用

34th ieee conference on computer Communications (INFOCOM)

作者： Hachem, Jad Karamchandani, Nikhil Diggavi, Suhas Univ Calif Los Angeles Los Angeles CA USA

ISBN: (纸本)9781479983810

Emerging heterogeneous wireless architectures consist of a dense deployment of local-coverage wireless access points (APs) with high data rates, along with sparsely-distributed, large-coverage macro-cell base stations (BS). We design a coded caching-and-delivery scheme for such architectures that equips APs with storage, enabling content pre-fetching prior to knowing user demands. Users requesting content are served by connecting to local APs with cached content, as well as by listening to a BS broadcast transmission. For any given content popularity profile, the goal is to design the caching-and-delivery scheme so as to optimally trade off the transmission cost at the BS against the storage cost at the APs and the user cost of connecting to multiple APs. We design a coded caching scheme for non-uniform content popularity that dynamically allocates user access to APs based on requested content. We demonstrate the approximate optimality of our scheme with respect to information-theoretic bounds. We numerically evaluate it on a YouTube dataset and quantify the trade-off between transmission rate, storage, and access cost. Our numerical results also suggest the intriguing possibility that, to gain most of the benefits of coded caching, it suffices to divide the content into a small number of popularity classes.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共90页 << < 18 19 20 21 22 23 24 25 26 27 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：