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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

49 篇 会议
24 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

39 篇 工学
- 31 篇 计算机科学与技术...
- 29 篇 软件工程
- 12 篇 信息与通信工程
- 8 篇 生物工程
- 6 篇 电子科学与技术（可...
- 3 篇 生物医学工程（可授...
- 2 篇 机械工程
- 2 篇 材料科学与工程（可...
- 2 篇 动力工程及工程热...
- 2 篇 电气工程
- 1 篇 力学（可授工学、理...
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 化学工程与技术
18 篇 理学
- 11 篇 数学
- 10 篇 生物学
- 3 篇 物理学
- 3 篇 统计学（可授理学、...
14 篇 管理学
- 6 篇 管理科学与工程(可...
- 5 篇 工商管理
- 4 篇 公共管理
- 4 篇 图书情报与档案管...
9 篇 医学
- 6 篇 临床医学
- 4 篇 公共卫生与预防医...
- 3 篇 基础医学(可授医学...
- 1 篇 药学(可授医学、理...
3 篇 法学
- 2 篇 法学
- 1 篇 社会学
1 篇 经济学
- 1 篇 应用经济学
1 篇 教育学
- 1 篇 教育学

主题

12 篇 computer science
7 篇 wireless sensor ...
5 篇 routing
5 篇 throughput
5 篇 protocols
5 篇 local area netwo...
4 篇 asynchronous tra...
4 篇 intelligent netw...
4 篇 performance eval...
4 篇 testing
4 篇 ip networks
4 篇 computer network...
4 篇 wireless network...
3 篇 deep learning
3 篇 magnetic resonan...
3 篇 application soft...
3 篇 ad hoc networks
3 篇 pervasive comput...
3 篇 switches
3 篇 internet

机构

5 篇 department of co...
5 篇 karachi pakistan
5 篇 health managemen...
5 篇 department of pu...
5 篇 julius centre fo...
5 篇 centre for heart...
5 篇 state key labora...
5 篇 department of co...
4 篇 department of ph...
4 篇 university centr...
4 篇 health systems a...
4 篇 suraj eye instit...
4 篇 biomedical resea...
4 篇 department of co...
4 篇 faculty of medic...
4 篇 networking hardw...
4 篇 division of comp...
3 篇 department of ot...
3 篇 department of co...
3 篇 department of so...

作者

5 篇 yu gu
4 篇 bärnighausen til...
4 篇 dandona rakhi
4 篇 abu-gharbieh ema...
4 篇 dandona lalit
4 篇 alahdab fares
4 篇 yusheng ji
4 篇 s. woolet
4 篇 m. vouk
4 篇 a. rindos
3 篇 abbafati cristia...
3 篇 charan jaykaran
3 篇 zaslavsky arkady
3 篇 shoeibi afshin
3 篇 mirica andreea
3 篇 sharifrazi dania...
3 篇 majeed azeem
3 篇 el sayed zaki ma...
3 篇 chu dinh-toi
3 篇 kandel himal

语言

70 篇 英文
2 篇 其他
1 篇 中文

检索条件"机构=Division of Computer Science and Networking"

共 73 条记录，以下是41-50 订阅

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

详细简洁

排序：

Theoretical treatment of sink scheduling problem in wireless sensor networks

Theoretical treatment of sink scheduling problem in wireless...

引用

2011 IEEE Conference on computer Communications Workshops, INFOCOM WKSHPS 2011

作者： Gu, Yu Ji, Yusheng Li, Jie Zhao, Baohua Information Systems Architecture Science Research Division National Institute of Informatics Tokyo Japan State Key Laboratory of Networking and Switching Technology Beijing 100876 China School of Computer Science Univ. of Science and Technology of China Hefei Anhui 230027 China Department of Computer Science University of Tsukuba Ibaraki 305-8573 Japan

ISBN: (纸本)9781457702488

Sink Scheduling, in the form of scheduling multiple sinks among sink sites to leverage traffic burden, is an effective mechanism for the energy-efficiency of wireless sensor networks (WSNs). Due to the inherent difficulty (NP-hard in general), existing works on this topic mainly focus on heuristic/greedy algorithms and theoretic results remain unknown. In this paper, we fill in the research blank with two algorithms. The first one is based on the Column Generation (CG). It decomposes the original problem into two sub problems and solve them iteratively to approach the optimal solution. However, due to its high computational complexity, this algorithm is only suitable for small scale networks. The other one is a polynomial-time algorithm based on relaxation techniques to obtain an upperbound, which can serve as a performance benchmark for other algorithms on this problem. Through comprehensive simulations, we evaluate the efficiency of proposed algorithms. © 2011 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A probabilistic context-aware approach for quality of experience measurement in pervasive systems 11

A probabilistic context-aware approach for quality of experi...

引用

Proceedings of the 2011 ACM Symposium on Applied Computing

作者： Mitra, Karan Zaslavsky, Arkady Åhlund, Christer Center for Distributed Systems and Software Engineering Monash University 900 Dandenong Road Caulfield East VIC 3145 Australia Computer Science and Electrical Engineering Luleå University of Technology SE-97187 Luleå Sweden Division of Mobile Networking and Computing SE-93187 Skellefteå Sweden

ISBN: (纸本)9781450301138

In this paper, we develop a novel context-aware approach for quality of experience (QoE) modeling, reasoning and inferencing in mobile and pervasive computing environments. The proposed model is based upon a state-space approach and Bayesian networks for QoE modeling and reasoning. We further extend this context model to incorporate influence diagrams for efficient QoE inferencing. Our approach accommodates user, device and quality of service (QoS) related context parameters to determine the overall QoE of the user. This helps in user-related media, network and device adaptation. We perform experimentation to validate the proposed approach and the results verify its modeling and inferencing capabilities. © 2011 ACM.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Scheduling multiple sinks in wireless sensor networks: A column generation based approach

Scheduling multiple sinks in wireless sensor networks: A col...

引用

IEEE Conference on Wireless Communications and networking

作者： Yu Gu Baohua Zhao Yusheng Ji Jie Li Information Systems Architecture Science Research Division National Institute of Information Tokyo Japan State Key Laboratory of Networking and Switching Technology Beijing China Department of Computer Science Tsukuba Science City University of Tsukuba Ibaraki Japan

We address the optimal sink scheduling problem in wireless sensor networks (WSNs). The problem is inherently difficult since sink scheduling and data routing are tightly coupled. Previous approaches either have questionable performance due to no joint considerations, or are based on relaxed constraints. Our aim is to fill in this blank in the research. First, by discretizing continuous time, we develop a novel bound technique to connect time-varying routes with the placement of sinks. This bounding technique transforms time-related constraints into pattern-based ones and allows us to mathematically formulate this optimization in a pattern-based way. The complexity of directly solving this optimization is intractable; therefore, on the basis of column generation (CG), a computationally efficient algorithm is developed to reduce the complexity by decomposing the problem into sub-problems and iteratively solving them to approach optimality. Simulations demonstrate the efficiency of the algorithm and substantiate the importance of sink mobility in energy-constrained sensor networks.

关键词： Wireless sensor networks Optimization Relays Routing Processor scheduling Complexity theory USA Councils

来源：评论

学校读者我要写书评

暂无评论

Theoretical Treatment of Sink Scheduling Problem in Wireless Sensor Networks

Theoretical Treatment of Sink Scheduling Problem in Wireless...

引用

IEEE Conference on computer Communications Workshops

作者： Yu Gu Yusheng Ji Jie Li Baohua Zhao Information Systems Architecture Science Research Division National Institute of Informatics Department of Computer Science University of Tsukuba State Key Laboratory of Networking and Switching Technology

ISBN: (纸本)9781457702495

关键词： Wireless sensor networks Performance metrics Sinks Relaxation Techniques Energy efficiency original problem algorithms

来源：评论

学校读者我要写书评

暂无评论

Vulnerability of selfish routing to attacks: Game-theoretic models and initial results

Vulnerability of selfish routing to attacks: Game-theoretic ...

引用

作者： Genin, D. Marbukh, V. Nakassis, A. National Institute of Standards and Technology Gaithersburg MD 80305 United States Advanced Networking Division United States Mathematics and Computer Science Division United States

ISBN: (纸本)9789881701299

This paper reports on work in progress on assessing and mitigating selfish routing vulnerability to strategic attacks. We explain mechanisms leading to this vulnerability, propose the corresponding game-theoretic model, solve this model for some particular case, and discuss implications of the vulnerability phenomenon. Our approach extends the well established research agenda on selfish routing by incorporating attacker(s) as separate agent(s) in the corresponding game. While each user makes its routing decision in attempt to minimize its transportation cost, the attacker(s) manipulate the link costs for the purpose of increasing the aggregate transportation cost to all or some users, e.g., by damaging the physical infrastructure or inserting malicious traffic as in Denial of Service (DoS) attack. Our initial results demonstrate that even "weak" attacker is capable of inflicting a serious damage measured by increase in the price of anarchy as compared to the case without attacker. Presence of attacker(s) can make Braess's paradox more pronounced. These initial results demonstrate importance of further research on the effect of the adversarial actions on selfish routing and a possibility of mitigating of this effect.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

IT education 2.0 09

IT education 2.0

引用

10th ACM Special Interest Group for Information Technology Education, SIGITE 2009

作者： Sabin, Mihaela Leone, Jim Computer Information Systems Division of Science and Technology University of New Hampshire Manchester NH United States Departments of Information Sciences and Technologies Networking Security and Systems Administration Rochester Institute of Technology Rochester NY United States

ISBN: (纸本)9781605587653

Today's networked computing and communications technologies have changed how information, knowledge, and culture are produced and exchanged. People around the world join online communities that are set up voluntarily and use their members' collaborative participation to solve problems, share interests, raise awareness, or simply establish social connections. Two online community examples with significant economic and cultural impact are the open source software movement and Wikipedia. The technological infrastructure of these peer production models uses current Web 2.0 tools, such as wikis, blogs, social networking, semantic tagging, and RSS feeds. With no control exercised by property-based markets or managerial hierarchies, commons-based peer production systems contribute to and serve the public domain and public good. The body of cultural, educational, and scientific work of many online communities is made available to the public for free and legal sharing, use, repurposing, and remixing. Higher education's receptiveness to these transformative trends deserves close examination. In the case of the Information Technology (IT) education community, in particular, we note that the curricular content, research questions, and professional skills the IT discipline encompasses have direct linkages with the Web 2.0 phenomenon. For that reason, IT academic programs should pioneer and lead efforts to cultivate peer production online communities. We state the case that free access and open engagement facilitated by technological infrastructures that support a peer production model benefit IT education. We advocate that these technologies be employed to strengthen IT educational programs, advance IT research, and revitalize the IT education community. Copyright 2009 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Port-based multihomed mobile IPv6: Load-balancing in mobile ad hoc networks

Port-based multihomed mobile IPv6: Load-balancing in mobile ...

引用

32nd IEEE Conference on Local computer Networks, LCN 2007

作者： Brännström, Robert Åhlund, Christer Zaslavsky, Arkady Division of Mobile Networking and Computing Luleå University of Teohnology Skellefteå Sweden School of Computer Science and Software Engineering Monash University Melbourne Australia

ISBN: (纸本)0769530001

With today's heterogeneous access to the Internet, users will move between wired and wireless environments and between infrastructure mode and ad hoc mode of wireless communication. When a mobile node moves from an infrastructure connection and connects multihop to an Internet gateway, the performance will degrade and it may not be able to send all of its traffic via a single gateway. This highlights the need of load-balancing between Internet gateways, especially since the behavior of users today involves a multitude of parallel activities generating multiple flows. This paper proposes a solution that enables distribution of individual traffic flows via different Internet gateways instead of using one single gateway. The proposal includes extensions to Mobile IP in order to handle flow mobility bindings. The performance of the solution is verified by simulation studies. © 2007 IEEE.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Loop-Free Link-State Routing

Loop-Free Link-State Routing

引用

International Conference on computer Communications and Networks (ICCCN)

作者： Pierre Fransson Lenka Carr-Motyckova Division of Computer Science and Networking Department of Computer Science and Electrical Engineering Luleå University of Technology Lulea Sweden

Improving the robustness of today's intra-domain link-state networks is of increasing importance. This is because it is becoming commonplace for such networks to carry telephony, on-demand video and other kinds of real-time traffic. Since user requirements on real-time traffic are exacting, it is essential that the network is able to respond rapidly to network errors. A way of reaching fast reaction times in response to network errors is to precompute fail-over paths that can be utilized immediately when an error is detected. The fail-over path is thereafter in use until the network has converged, handling traffic that would otherwise have been lost due to the error. During convergence (when new paths are calculated) there is a caveat that needs to be avoided -the formation of temporary loops. Temporary loops can form naturally during convergence in link-state networks and can unfortunately prevent traffic from reaching a fail-over path. Traffic can therefore be lost even though a fail-over path is in place. We present an algorithm that can be used in conjunction with link-state routing, to ensure that temporary loops do not form during convergence. The algorithm improves on previous loop-free algorithms for link-state routing by reducing the number of state transitions necessary before a router can update its routing table to a new, guaranteed to exist, path for a wide variety of topological configurations. Because all new paths are guaranteed to exist at the time of a routing table update, the algorithm is also more robust against loss of data than the proposed loop-free algorithm by Francoise and Bonaventure.

关键词： Routing Telecommunication traffic Convergence Network topology computer science Robustness IP networks Distributed algorithms Algorithm design and analysis Telephony

来源：评论

学校读者我要写书评

暂无评论

Port-based Multihomed Mobile IPv6: Load-balancing in Mobile Ad hoc Networks

Port-based Multihomed Mobile IPv6: Load-balancing in Mobile ...

引用

Conference on Local computer Networks (LCN)

作者： Robert Brannstrom Christer Ahlund Arkady Zaslavsky Division of Mobile Networking & Computing Luleå University of Technology Skelleftea Sweden School of Computer Science & Software Engineering Monash University Melbourne Australia

With today's heterogeneous access to the Internet, users will move between wired and wireless environments and between infrastructure mode and ad hoc mode of wireless communication. When a mobile node moves from an infrastructure connection and connects multihop to an Internet gateway, the performance will degrade and it may not be able to send all of its traffic via a single gateway. This highlights the need of load-balancing between Internet gateways, especially since the behavior of users today involves a multitude of parallel activities generating multiple flows. This paper proposes a solution that enables distribution of individual traffic flows via different Internet gateways instead of using one single gateway. The proposal includes extensions to mobile IP in order to handle flow mobility bindings. The performance of the solution is verified by simulation studies.

关键词： Mobile ad hoc networks IP networks Ad hoc networks Telecommunication traffic Internet Mobile computing Routing protocols computer networks Proposals Spread spectrum communication

来源：评论

学校读者我要写书评

暂无评论

A flow control framework for improving throughput and energy efficiency in CSMA/CA based wireless multihop networks 06

A flow control framework for improving throughput and energy...

引用

WoWMoM 2006: 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks

作者： Pathmasuntharam, Jaya Shankar Das, Amitabha Mohapatra, Prasant Networking Department C and D Division Institute for Infocomm Research Singapore Singapore School of Computer Engineering Nanyang Technological University Singapore Singapore Department of Computer Science University of California Davis Davis CA 95616 United States

ISBN: (纸本)0769525938

In a CSMA/CA based multihop wireless network, excessive interference at a receiver or a potential forwarding node causes severe blocking and reduction in throughput. The unbalanced interference forces the node to consume more time receiving packets rather than sending them, resulting in dropped packets due to buffer overflow. We discuss a novel flow control framework at the MAC layer for regulating the transmission and improving the overall throughput of multihop wireless networks based on CSMA/CA protocol. The framework prevents congestion, reduces packet loss and is attractive because per-flow information at each node is kept to a minimum. The techniques used to improve throughput include a hop-by-hop, hybrid rate and window based flow control scheme that paces the transmission of frames such that competition between frames originating from the same flow is reduced. Simulations show more than five fold improvement in throughput and energy cost over the existing scheme without flow control in some cases. © 2006 IEEE.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共8页 << < 1 2 3 4 5 6 7 8 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：