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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,686 篇 工学
- 1,481 篇 计算机科学与技术...
- 672 篇 软件工程
- 493 篇 信息与通信工程
- 356 篇 电气工程
- 96 篇 控制科学与工程
- 84 篇 网络空间安全
- 65 篇 生物工程
- 57 篇 电子科学与技术（可...
- 43 篇 动力工程及工程热...
- 39 篇 仪器科学与技术
- 33 篇 机械工程
- 29 篇 交通运输工程
- 29 篇 安全科学与工程
- 28 篇 建筑学
- 26 篇 环境科学与工程（可...
- 24 篇 光学工程
- 20 篇 生物医学工程（可授...
- 17 篇 材料科学与工程（可...
324 篇 理学
- 193 篇 数学
- 67 篇 生物学
- 46 篇 系统科学
- 45 篇 统计学（可授理学、...
- 44 篇 物理学
219 篇 管理学
- 146 篇 管理科学与工程(可...
- 87 篇 图书情报与档案管...
- 73 篇 工商管理
50 篇 法学
- 34 篇 社会学
29 篇 医学
- 21 篇 临床医学
- 17 篇 基础医学(可授医学...
23 篇 经济学
- 20 篇 应用经济学
14 篇 教育学
11 篇 农学
6 篇 文学
3 篇 军事学
2 篇 艺术学

主题

285 篇 distributed comp...
267 篇 cloud computing
135 篇 social networkin...
103 篇 computer archite...
93 篇 protocols
91 篇 computer network...
88 篇 computer science
87 篇 peer to peer com...
84 篇 computational mo...
75 篇 security
69 篇 mobile computing
66 篇 routing
66 篇 servers
61 篇 resource managem...
60 篇 internet of thin...
60 篇 peer-to-peer com...
59 篇 grid computing
57 篇 application soft...
56 篇 quality of servi...
51 篇 software enginee...

机构

29 篇 daffodil interna...
21 篇 beijing univ pos...
13 篇 state key labora...
12 篇 daffodil interna...
10 篇 daffodil interna...
10 篇 shandong provinc...
8 篇 institute of com...
8 篇 school of inform...
5 篇 shenyang institu...
5 篇 tokyo denki univ...
5 篇 rissho universit...
5 篇 department of co...
4 篇 univ chinese aca...
4 篇 nokia research c...
4 篇 beijing univ pos...
4 篇 center for compu...
4 篇 university of ch...
4 篇 hosei univ
4 篇 department of co...
4 篇 department of co...

作者

12 篇 abujar sheikh
12 篇 hossain syed akh...
12 篇 sheikh abujar
11 篇 syed akhter hoss...
8 篇 masum abu kaisar...
8 篇 abu kaisar moham...
7 篇 wehrle klaus
7 篇 dustdar schahram
7 篇 kao odej
7 篇 buyya rajkumar
6 篇 m. takizawa
6 篇 yang yang
6 篇 t. enokido
6 篇 wang ying
6 篇 rothermel kurt
5 篇 wu budan
5 篇 wirtz hanno
5 篇 truong hong-linh
5 篇 ramachandran k.i...
5 篇 bhuiyan md. rafi...

语言

2,674 篇 英文
81 篇 其他
6 篇 中文
2 篇 法文

检索条件"任意字段=11th International Conference on Distributed Computing and Networking"

共 2762 条记录，以下是1901-1910 订阅

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

详细简洁

排序：

Radio Network distributed Algorithms in the Unknown Neighborhood Model

Radio Network Distributed Algorithms in the Unknown Neighbor...

引用

11th international conference on distributed computing and networking

作者： Derbel, Bilel Talbi, El-Ghazali Univ Sci & Technol Lille France Lab Informat Fondamentale Lille Lille France

ISBN: (纸本)9783642113215

the paper deals with radio network distributed algorithms where initially no information about node degrees is available. We show that the lack of such an information affects the time complexity of existing fundamental algorithms by only a polylogarithmic factor. More precisely, given an n-node graph modeling a multi-hop radio network, we provide a O(log(2) n) time distributed algorithm that computes w.h.p., a constant approximation value of the degree of each node. We also provide a O(Delta log n + log(2) a) time distributed algorithm that computes will)., constant approximation value of the local maximum degree of each node, where the global maximum degree Delta of the graph is not known. Using our algorithm as a plug-and-play procedure, we show that the local maximum degree can be used instead of Delta to break the symmetry efficiently. We illustrate this claim by revisiting some fundamental algorithms that use Delta as a key parameter. First, we investigate the generic problem of simulating any point-to-point interference-free message passing algorithm in the radio network model. then, we study the fundamental coloring problem in unit disk graphs. the obtained results show that the local maximum degree allows nodes to self-organize in a local manner and to avoid the radio interferences from being a communication bottleneck.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Credit Reputation Propagation: A Strategy to Curb Free-Riding in a Large Bit Torrent Swarm

Credit Reputation Propagation: A Strategy to Curb Free-Ridin...

引用

11th international conference on distributed computing and networking

作者： Paul, Suman Nandi, Subrata Pal, Ajit Indian Inst Technol Dept Elect & Elect Commun Engn Kharagpur 721302 W Bengal India Natl Inst Technol Durgapur Dept Comp Sci & Engn Durgapur 721309 W Bengal India Indian Inst Technol Dept Comp Sci & Engn Kharagpur 721302 W Bengal India

ISBN: (纸本)9783642113215

BitTorrent ensures cooperation among peers through its inbuilt collaborative mechanisms, however due to lack of proper incentives, significant amount of free riding is observed in it. though in the existing literature, there exists some strategies to prevent free-riding, however, in case of large swarm sizes, it can be shown that they fail to stop free riding attempts effectively. To overcome this limitation, this paper presents a novel approach based on propagating the knowledge about the existence of possible free riders in the form of reputation among the peers within the swarm. It is shown, how a possible free riding attempt on a peer is reported to others and how tins knowledge is utilized in deciding whether to upload to a particular peer or not within a Bit Torrent swarm. Simulation results demonstrate how the proposed strategy effectively punishes free riders even in large swarm sizes.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Achieving flow-level controllability in network intrusion detection system

Achieving flow-level controllability in network intrusion de...

引用

11th ACIS international conference on Software Engineering, Artificial Intelligence, networking and Parallel/distributed computing, SNPD2010

作者： Song, Bo Yang, Weibing Chen, Mingyu Zhao, Xiaofang Fan, Jianping Institute of Computing Technology Chinese Academy of Sciences China Graduate School of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769540887

Current network intrusion detection systems are lack of controllability, manifested as significant packet loss due to the long-term resources occupation by a single flow. the reasons can be classified into two kinds. the first kind is known as normal reasons, that is, the processing of mass arriving packets of a large flow can not be limited to a determinable period of time and thus makes other flows starved. the second kind, in which the CPU is trapped in a dead-loop like state due to processing some packets with particular content of a flow, is considered as abnormal reasons. In fact, it is a kind of software crashes. In this paper, we discuss the innate defects of traditional packet-driven NIDS, and implement a flow-driven framework which can achieve finegrained controllability. An Active Two-threshold scheme based on ideal Exit-Point (ATEP) is proposed in order to diminish data preserving overhead during flow switches and to detect crash in time. A quick crash recovery mechanism is also given which can recover the trapped thread from 90% crashes in 0.2ms. the experimental results show that our flow-driven framework with ATEP scheme can achieve higher throughput and less packet loss ratio than the uncontrollable packet-driven systems with less than 1% of extra CPU overhead. What's more, in the case of crash occurrence, the ATEP scheme is still able to maintain rather steady throughput without sudden decrease. © 2010 IEEE.

关键词： Controllability

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Self-stabilizing Vertex Coloring in Unidirectional Anonymous Networks

Probabilistic Self-stabilizing Vertex Coloring in Unidirecti...

引用

11th international conference on distributed computing and networking

作者： Bernard, Samuel Devismes, Stephane Paroux, Katy Potop-Butucaru, Maria Tixeuil, Sebastien Univ Paris 06 F-75252 Paris 05 France Univ Grenoble 1 F-38041 Grenoble France INRIA Bretagne Atlantique Rennes France

ISBN: (纸本)9783642113215

A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without external intervention in finite time. Unidirectional networks preclude many common techniques in self-stabilization from being used, such as preserving local predicates. the focus of this work is on the classical vertex coloring problem, that is a basic building block for many resource allocation problems arising in wireless sensor networks. In this paper, we investigate the gain in complexity that can be obtained through randomization. We present a probabilistically self-stabilizing algorithm that uses k states per process, where k is a parameter of the algorithm. When k = Delta + 1, the algorithm recovers in expected O(Delta n) actions. When k may grow arbitrarily, the algorithm recovers in expected O(n) actions in total. thus, our algorithm can be made optimal with respect to space or time complexity. Our case study hints that randomization could help filling the complexity gap between bidirectionnal and unidirectionnal networks.

关键词： Wireless sensor networks distributed algorithms self-stabilization unidirectional anonymous networks lower and upper bounds coloring problem randomization

来源：评论

学校读者我要写书评

暂无评论

A study on distributed parameter free genetic algorithm

A study on distributed parameter free genetic algorithm

引用

Joint 5th international conference on Soft computing and Intelligent Systems and 11th international Symposium on Advanced Intelligent Systems, SCIS and ISIS 2010

作者： Kondo, Fumitaka Yabushita, Yoshiki Watanabe, Toshihiko Osaka Electro-Communication University 18-8 Hatsu-cho Neyagawa Osaka572-8530 Japan Astec Corporation 2-30 Toyotsu-cho Suita Osaka 564-0051 Japan

Recently, Genetic Algorithm has been studied as an effective approach for large scale optimization problems. However, we have issues of early convergence and settings of many parameters in the GA approach. In order to deal with such issues, parameter free genetic algorithm(PfGA) and distributed genetic algorithm(DGA) were proposed. In this paper, we propose a distributed parameter free genetic algorithm(DPfGA) that keeps parameter free characteristic and improves efficiency of optimization. Besides the distributed construction of GA, we propose the method varying the number of offspring adaptively in accordance with the current performance of optimization. We show effectiveness of the algorithm through application of the algorithm to TSP(Travelling Salesman Problem).

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 2010 ACM Workshop on Cognitive Radio Networks, CoRoNet '10, Co-located with MobiCom'10 and 11th ACM international Symposium on Mobile Ad Hoc networking and computing, MobiHoc'10

Proceedings of the 2010 ACM Workshop on Cognitive Radio Netw...

引用

MobiCom'10 and 11th ACM international Symposium on Mobile Ad Hoc networking and computing, MobiHoc'10

ISBN: (纸本)9781450301411

the proceedings contain 6 papers. the topics discussed include: practical implementation of blind synchronization in NC-OFDM based cognitive radio networks;cognitive spatial degrees of freedom estimation via compressive sensing;a decentralized MAC for opportunistic spectrum access in cognitive wireless networks;energy-efficient communication in next generation rural-area wireless networks;spectrum occupancy validation and modeling using real-time measurements;and network coding relayed dynamic spectrum access.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A framework for recommendation and trust assessment in SNS

A framework for recommendation and trust assessment in SNS

引用

11th international conference on Parallel and distributed computing, Applications and Technologies, PDCAT 2010

作者： Zhang, Rui Qu, Binbin School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology Wuhan University of Technology Wuhan China

ISBN: (纸本)9780769542874

With the development of the network technology, social network services(SNS), which are based on social network theory have gained increasing media, government and popular attention than ever before. In a social networking site, recommendation and trust assessment is of great importance. However, applications are complicated and changeable, so the fixed assessment criteria which are dedicated to one application, may not fit another. After analysis of specific criteria and in accordance with their properties, we divide the criteria into several categories of similar, monotonic, antimonotonic, convertible and inconvertible;meantime, propose methods to deal with these criteria. We define a framework, and experimentally evaluate the effectiveness of our method. © 2010 IEEE.

关键词： Social sciences computing

来源：评论

学校读者我要写书评

暂无评论

On the design of reed-solomon codec for intelligent home networking

On the design of reed-solomon codec for intelligent home net...

引用

Joint 5th international conference on Soft computing and Intelligent Systems and 11th international Symposium on Advanced Intelligent Systems, SCIS and ISIS 2010

作者： Jin, Ik Soo Lee, Hyuek Jae Lee, Sang-Hoon Dept. of Information and Communication Engineering Kyungnam University 449 Woryeong-dong Masanhappo-gu Changwon-si 631-701 Korea Republic of Dept. of Electronic Engineering Kyungnam University 449 Woryeong-dong Masanhappo-gu Changwon-si 631-701 Korea Republic of

Error correction coding is being used on an almost routine basis in most communication systems including intelligent home networking. In addition, critical protocol management information requires high fidelity forward error correction (FEC) coding to ensure that the protocol functions correctly in the worst case situations. A powerful technique in the worst case situations is a Reed-Solomon (RS) code. With this technique, one achieves a high level of performance by trading an increase in overall block length for a reduction in hardware complexity. this paper concerns the design and implementation of RS codec for intelligent home networking. the 3 symbol error correcting RS codec is developed on field programmable gate array (FPGA) chips using very high speed integrated circuit hardware description language (VHDL). the logic functions are confirmed by VHDL simulator tool. the circuits are generated by the synthesis tool. Two FPGA chips are required and the FPGA utilization is 70% and 40%, respectively.

关键词： Reed-Solomon codes

来源：评论

学校读者我要写书评

暂无评论

Adapting distributed Real-Time and Embedded Pub/Sub Middleware for Cloud computing Environments

Adapting Distributed Real-Time and Embedded Pub/Sub Middlewa...

引用

11th international Middleware conference

作者： Hoffert, Joe Schmidt, Douglas C. Gokhale, Aniruddha Vanderbilt Univ Nashville TN 37203 USA

ISBN: (纸本)9783642169540

Enterprise distributed real-time and embedded (DRE) publish/subscribe (pub/sub) systems manage resources and data that are vital to users. Cloud computing-where computing resources are provisioned elastically and leased as a service-is an increasingly popular deployment paradigm. Enterprise DRE pub/sub systems can leverage cloud computing provisioning services to execute needed functionality when on-site computing resources are not available. Although cloud computing provides flexible on-demand computing and networking resources, enterprise DRE pub/sub systems often cannot accurately characterize their behavior a priori for the variety of resource configurations cloud computing supplies (e.g., CPU and network bandwidth), which makes it hard for DRE systems to leverage conventional cloud computing platforms. this paper provides two contributions to the study of how autonomic configuration of DRE pub/sub middleware can provision and use on-demand cloud resources effectively. We first describe how supervised machine learning can configure DRE pub/sub middleware services and transport protocols autonomically to support end-to-end quality-of-service (QoS) requirements based on cloud computing resources. We then present results that empirically validate how computing and networking resources affect enterprise DRE pub/sub system QoS. these results show how supervised machine learning can configure DRE pub/sub middleware adaptively in < 10 mu sec with bounded time complexity to support key QoS reliability and latency requirements.

关键词： Autonomic configuration pub/sub middleware DRE systems cloud computing

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 5th ACM Workshop on Challenged Networks, CHANTS '10, Co-located with MobiCom'10 and 11th ACM international Symposium on Mobile Ad Hoc networking and computing, MobiHoc'10

Proceedings of the 5th ACM Workshop on Challenged Networks, ...

引用

5th ACM Workshop on Challenged Networks, CHANTS '10

ISBN: (纸本)9781450301398

the proceedings contain 15 papers. the topics discussed include: similarity analysis and modeling in mobile societies: the missing link;distributed stochastic optimization in opportunistic networks: the case of optimal relay selection;the state of DTN evaluation;cellular traffic offloading through opportunistic communications: a case study;locus: a location-based data overlay for disruption-tolerant networks;DTN routing in urban public transport systems;achieving anycast in DTNs by enhancing existing unicast protocols;a new mobility trace for realistic large-scale simulation of bus-based DTNs;dynamic, non-interactive key management for the bundle protocol;DTN experiments on the virtual meshtest testbed;making bundle protocol into a game;a relative time implementation for delay-tolerant networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共277页 << < 187 188 189 190 191 192 193 194 195 196 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：