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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

2,031 篇 工学
- 1,809 篇 计算机科学与技术...
- 832 篇 软件工程
- 528 篇 信息与通信工程
- 388 篇 电气工程
- 160 篇 控制科学与工程
- 90 篇 生物工程
- 69 篇 电子科学与技术（可...
- 59 篇 动力工程及工程热...
- 54 篇 网络空间安全
- 41 篇 机械工程
- 33 篇 生物医学工程（可授...
- 29 篇 仪器科学与技术
- 26 篇 环境科学与工程（可...
- 22 篇 交通运输工程
- 22 篇 安全科学与工程
- 20 篇 建筑学
390 篇 理学
- 223 篇 数学
- 98 篇 生物学
- 59 篇 统计学（可授理学、...
- 52 篇 物理学
- 43 篇 系统科学
- 35 篇 化学
260 篇 管理学
- 161 篇 管理科学与工程(可...
- 123 篇 图书情报与档案管...
- 88 篇 工商管理
59 篇 法学
- 44 篇 社会学
37 篇 医学
- 32 篇 临床医学
- 24 篇 基础医学(可授医学...
29 篇 教育学
- 21 篇 教育学
25 篇 经济学
- 25 篇 应用经济学
10 篇 文学
8 篇 农学
4 篇 军事学
2 篇 艺术学

主题

306 篇 cloud computing
152 篇 distributed comp...
133 篇 social networkin...
90 篇 computational mo...
75 篇 computer archite...
74 篇 distributed comp...
70 篇 resource managem...
66 篇 distributed data...
65 篇 servers
63 篇 grid computing
61 篇 protocols
58 篇 mobile computing
53 篇 wireless sensor ...
51 篇 monitoring
51 篇 security
50 篇 edge computing
41 篇 big data
41 篇 data models
40 篇 internet of thin...
40 篇 computer science

机构

15 篇 beijing univ pos...
14 篇 state key labora...
8 篇 key laboratory o...
7 篇 institute of com...
7 篇 school of cybers...
6 篇 college of compu...
6 篇 beijing univ pos...
5 篇 school of comput...
5 篇 shandong normal ...
5 篇 school of comput...
5 篇 ibm thomas j. wa...
5 篇 school of comput...
5 篇 tu wien distribu...
4 篇 univ sci & techn...
4 篇 school of inform...
4 篇 poznan supercomp...
4 篇 north china inst...
4 篇 beijing universi...
4 篇 aalto univ dept ...
4 篇 school of engine...

作者

12 篇 dustdar schahram
9 篇 yang yang
8 篇 buyya rajkumar
7 篇 wehrle klaus
7 篇 soman k. p.
7 篇 wu xu
6 篇 liu yang
6 篇 xu wu
6 篇 zhang peng
6 篇 jin hai
5 篇 wang jing
5 篇 yao wenbin
5 篇 tomforde sven
5 篇 liu pangfeng
5 篇 xiangyu bai
5 篇 wu jingchen
5 篇 roy nirmalya
5 篇 edenhofer sarah
5 篇 rothermel kurt
5 篇 yan zheng

语言

2,857 篇 英文
94 篇 其他
43 篇 中文
1 篇 俄文

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

共 2984 条记录，以下是1091-1100 订阅

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

详细简洁

排序：

Comparison of surveillance strategies to identify undesirable behaviour in multi-agent systems 8

Comparison of surveillance strategies to identify undesirabl...

引用

8th international conference on Agents and Artificial Intelligence, ICAART 2016

作者： Edenhofer, Sarah Stifter, Christopher Tomforde, Sven Kantert, Jan Müller-Schloer, Christian Hahner, Jorg Organic Computing Group University of Augsburg Augsburg Germany Institute of Systems Engineering Leibniz University Hannover Hannover Germany

ISBN: (纸本)9789897581724

Open, distributed systems face the challenge to maintain an appropriate operation performance even in the presence of bad behaving or malicious agents. A promising mechanism to counter the resulting negative impact of such agents is to establish technical trust. In this paper, we investigate strategies to improve the efficiency of trust mechanisms regarding the isolation of undesired participants by means of reputation and accusation techniques. We demonstrate the potential benefit of the developed techniques within simulations of a Trusted Desktop computing Grid. Copyright © 2016 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Does Location Matter? the Efficiency of Request Propagation Based on Location in Online Social Networks 8th

Does Location Matter? The Efficiency of Request Propagation ...

引用

8th international conference on Social computing and Social Media (SCSM) Held as Part of 18th international conference on Human-Computer Interaction (HCI international)

作者： Othman, Salem Khan, Javed I. Nafa, Fatema Kent State Univ Dept Comp Sci Networking & Media Commun Res Labs Kent OH 44240 USA

ISBN: (纸本)9783319399096;9783319399102

the centrality metrics such as Closeness and Betweenness in Online Social Network (OSN) determine how much end-to-end delay and queue-load of a node can have as a source or as a destination through Social Routing. Experimentally, we find that nodes with high Out-Closeness centrality in OSN suffer from high end-to-end delay as a target, but not as a source. We show that the cause of this end-to-end delay is that most nodes with high Out-Closeness centrality have low In-Closeness centrality. Moreover, we show that the increase in the local In-Degree centrality will increase the global In-Closeness centrality. We also find that the promised level to increase the In-Closeness centrality of a node is its Friends of Friends-Of-Friends (Level-3). An agent-based Model for Social Routing is proposed and a set of large-scale Google+ Graphs are used. A simulation study is also completed by propagating a set of requests in different societies with different routing schemes and diverse queue disciplines, in order to compare the average end-to-end delays from the source and target perspectives.

关键词： Online social networks Requests Social routing and forwarding Simulation of online social networks Network centrality

来源：评论

学校读者我要写书评

暂无评论

Scalable and Cost-Efficient Algorithms for Reliable and distributed Cloud Storage 3rd

Scalable and Cost-Efficient Algorithms for Reliable and Dist...

引用

5th international conference on Cloud computing and Services Science (CLOSER)

作者： Hadji, Makhlouf Technol Res Inst SystemX 8 Ave Vauve F-91120 Palaiseau France

ISBN: (纸本)9783319295824;9783319295817

this paper focuses on minimizing jointly data storage and networking costs in a distributed cloud storage environment. We present two new efficient algorithms to place encrypted data chunks and enhance data availability when guaranteeing a minimum cost of storage and communication in the same time. the proposed underlying solutions, based on linear programming approach lead to an exact formulation with convergence times feasible for small and medium network sizes. A new polynomial time algorithm is presented and shown to scale to much larger network sizes. Performance assessment results, using simulations, show the scalability and cost-efficiency of the proposed distributed cloud storage solutions.

关键词： Cloud computing distributed storage Data replication Commodity flow Encryption Broker Optimization

来源：评论

学校读者我要写书评

暂无评论

Research and Implementation of Hierarchical Control of Large Scale Video conference based on conference Management System 8

Research and Implementation of Hierarchical Control of Large...

引用

8th international conference on Cyber-Enabled distributed computing and Knowledge Discovery (CyberC)

作者： Yuan, Zhou Li, Guochun Wang, Qiaomu Xu, Xinzhi Wen, Tao State Grid Informat & Telecommun Branch Beijing Peoples R China

ISBN: (纸本)9781509051540

the Integrated Video conference System of State Grid hosts many video conference applications. It is an important office assistant system, comprises a massive number of discrete components. In order to meet the growing demands and expectations of customers, stability and reliability of the system need to be further enhanced. In this paper, we study the system architecture, maintenance routine, system capacity, etc., and propose a hierarchical conference control strategy based on the conference Management System. the proposing strategy can improve the reliability and efficiency of large scale video conferences via a conference assistant mode, which can guarantee unity of command and achieve hierarchical maintenance.

关键词： Video conference Multi Control Unit Hierarchical Control RBAC model

来源：评论

学校读者我要写书评

暂无评论

A Workload Sensitive Dynamic Scaling Matrix Multiplier Structure 8

A Workload Sensitive Dynamic Scaling Matrix Multiplier Struc...

引用

8th international conference on Computational Intelligence and Communication Networks (CICN)

作者： Qiao, Yuran Shen, Junzhong Xiao, Tao Yang, Qianming Natl Univ Def Technol Coll Comp Natl Key Lab Parallel & Distributed Proc Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781509011445

Matrix multiplication is one of the most widely used computational kernels in scientific computing and machine learning. Using dedicated circuit for matrix multiplication can reduce the computational time and energy consumption. Traditional matrix multipliers always adopt linear array architecture, which works inefficiently when the size of matrix sub-block is much smaller than the array length. Using short array structure can improve the computational efficiency at the cost of occupying more memory bandwidth. In this paper, we present a workload sensitive dynamic scaling matrix multiplier structure, which can dynamically adjust the array length according to the matrix size. We build a prototype system on a Xilinx Zynq XC7Z045 FPGA. the result shows that compared with a fixed array architecture our design achieves much better performance and needs less memory bandwidth.

关键词： matrix multiplier FPGA dynamic scaling

来源：评论

学校读者我要写书评

暂无评论

An Experimental Evaluation of Giraph and GraphChi

An Experimental Evaluation of Giraph and GraphChi

引用

8th IEEE/ACM international conference on Advances in Social Networks Analysis and Mining (ASONAM)

作者： Lu, Junnan thomo, Alex Univ Victoria Victoria BC V8W 2Y2 Canada

ISBN: (纸本)9781509028467

We focus on the vertex-centric (VC) model introduced in Pregel, a Google system for distributed graph processing. In particular, we consider two popular implementations of the VC model: Apache Giraph and GraphChi. the first is a VC system for cluster computing, while the second is a VC system for a single PC. Apache Giraph became very popular after careful engineering by Facebook researchers in 2012 to scale the computation of PageRank to a trillion-edge graph of user interactions using 200 machines. On the other hand, GraphChi became popular, around the same time in 2012, as it made possible to perform intensive graph computations in a single PC, in just under 59 minutes, whereas the distributed systems were taking 400 minutes using a cluster of about 1,000 computers (as reported also by MIT Technology Review). Since then, new versions of Apache Giraph and GraphChi have been released, where new ideas and optimizations have been implemented. therefore, it is time to validate again the claims made four years ago. In this work, we embark in this validation. We consider three cornerstone graph problems: computing PageRank, shortest-paths, and weakly-connected-components. Based on current experiments, we conclude that in the present, even for a moderate number of simple machines, Apache Giraph outperforms GraphChi for all the algorithms and datasets tested. this is in contrast to the claims of the GraphChi authors in 2012.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

Design Architecture Enterprise Service Bus to Support Multi-Tenant Client and Resource Provider 8

Design Architecture Enterprise Service Bus to Support Multi-...

引用

8th international conference on Information Technology and Electrical Engineering (ICITEE)

作者： Sulaeman, Taufik Albarda Bandung Inst Technol Informat Bandung Indonesia

ISBN: (纸本)9781509041398

Heterogeneous data and various system that manage data in organization can be one of the difficult factor to manage data and application. SOA proposed several years ago boast an open standard based on loosely coupled architecture for better integrating application in distributed and heterogeneous environment. ESB is introduced as infrastructure for SOA service connection and message exchange that can mediates different environment to be managed. Web service as a technology drive the application to use data by requesting via network. this condition is the background to do research on designing Enterprise Service Bus Architecture to support multi-tenant client and provider. this research results the model of ESB and implement it design to be an application that can provide the organization to integrated heterogeneous data and various systems.

关键词： SOA Web Service Cloud computing PaaS SaaS Enterprise Service Bus

来源：评论

学校读者我要写书评

暂无评论

Extending TLS with KMIP protocol for Cloud computing 8

Extending TLS with KMIP protocol for Cloud Computing

引用

8th IFIP international conference on New Technologies, Mobility and Security (NTMS)

作者： Msahli, Mounira Serhrouchni, Ahmed Badra, Mohamed Inst Mines Telecoms F-75013 Paris France Zayed Univ Abu Dhabi U Arab Emirates

ISBN: (纸本)9781509029143

Any information system using encryption tends to have its own key management infrastructure. In practice, we find a separate key management systems dedicated to application encryption, or database encryption, or file encryption etc. this emergent needs to several key management systems and multiple cryptographic algorithms are resolved by the new Key Management Interoperability Protocol (KMIP). this work specifies how the Key Management Interoperability Protocol (KMIP) can be included in Transport Layer Security (TLS) protocol in order to provide additional security features, flexibility, interoperability and authentication specially in distributed systems like Cloud computing. Till now, authentication in TLS is limited to digital certificate and Kerberos. In this paper, we use the Key Management Interoperability Protocol to make an additional authentication option for TLS and we reduce handshake latency to 0-RTT for repeated handshakes and 1-RTT for full handshakes. We specify also the KMIP-TLS extension and its formal validation with AVISPA tool.

关键词： Key Management Interoperability Protocol Cloud TLS Security AVISPA Authentication

来源：评论

学校读者我要写书评

暂无评论

A threatmodel for trust-based systems consisting of open, heterogeneous and distributed agents 8

A threatmodel for trust-based systems consisting of open, he...

引用

8th international conference on Agents and Artificial Intelligence, ICAART 2016

作者： Kantert, Jan Klejnowski, Lukas Edenhofer, Sarah Tomforde, Sven Müller-Schloer, Christian Institute of Systems Engineering Leibniz University Hanover Appelstr. 4 Hanover30167 Germany Organic Computing Group Augsburg University Eichleitnerstr. 30 Augsburg86159 Germany

ISBN: (纸本)9789897581724

Information and communication technology witnesses a raise of open, distributed systems that consist of various heterogeneous elements. Within such an environment, individual elements have to efficiently fulfil their goals, which may require cooperation with others. As a consequence, a variety of threats appears that need to be handled and circumvented in the entity's behaviour. One major technical approach to provide a working environment for such systems is to introduce technical trust. In this paper, we present a basic threat model that comprises the most important challenges in this context - related to the basic system and the trust management, respectively. In order to illustrate the particular hazardous aspects, we discuss a Desktop computing Grid application as scenario. Copyright © 2016 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Tendency-Based Caching in Content-Centric networking 8

Tendency-Based Caching in Content-Centric Networking

引用

8th international conference on Ubiquitous and Future Networks (ICUFN)

作者： Xia, YuSheng Liu, YaPing Su, JinShu Natl Univ Def Technol Coll Comp Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Natl Key Lab Parallel & Distributed Proc Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781467399913

In content-centric networking, the schemes of in-network caching can affect the performance of the whole network. Existing schemes lack of the global view, which results in inefficient caches. In this paper, we aim to analyze the real-time distribution of contents among caches from multiple perspectives. this paper proposes TCBRP, a scheme that analyzes caching tendency of various contents in reverse path, based on centrality of nodes, popularity of contents and replacement rate of nodes, to cache in-network contents. this scheme also has decent scalability and can be expended conveniently. the experimental results reflect that TCBRP report savings in average hops and balance cache hit rate, compared with BetwRep and LCE.

关键词： Content-Centric networking Tendency-based Caching Popularity

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共299页 << < 106 107 108 109 110 111 112 113 114 115 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：