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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

7,053 篇 会议
91 篇 期刊文献
52 册 图书

馆藏范围

7,196 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,967 篇 工学
- 3,414 篇 计算机科学与技术...
- 1,569 篇 信息与通信工程
- 1,427 篇 软件工程
- 1,051 篇 电气工程
- 241 篇 控制科学与工程
- 122 篇 电子科学与技术（可...
- 93 篇 网络空间安全
- 76 篇 动力工程及工程热...
- 74 篇 仪器科学与技术
- 64 篇 生物工程
- 52 篇 机械工程
- 37 篇 安全科学与工程
- 34 篇 建筑学
- 34 篇 土木工程
- 33 篇 测绘科学与技术
- 33 篇 交通运输工程
- 31 篇 生物医学工程（可授...
565 篇 管理学
- 417 篇 管理科学与工程(可...
- 187 篇 图书情报与档案管...
- 144 篇 工商管理
520 篇 理学
- 314 篇 数学
- 95 篇 物理学
- 74 篇 生物学
- 73 篇 系统科学
- 66 篇 统计学（可授理学、...
100 篇 法学
- 52 篇 社会学
- 49 篇 法学
63 篇 医学
- 37 篇 基础医学(可授医学...
- 31 篇 公共卫生与预防医...
42 篇 经济学
- 41 篇 应用经济学
26 篇 文学
25 篇 教育学
12 篇 农学
6 篇 军事学
2 篇 艺术学

主题

1,160 篇 distributed comp...
419 篇 software enginee...
361 篇 cloud computing
360 篇 artificial intel...
312 篇 computer archite...
303 篇 computer network...
284 篇 social networkin...
269 篇 protocols
247 篇 computer science
236 篇 computational mo...
221 篇 wireless sensor ...
212 篇 scalability
205 篇 peer to peer com...
205 篇 resource managem...
196 篇 routing
190 篇 bandwidth
189 篇 servers
188 篇 application soft...
183 篇 distributed data...
166 篇 grid computing

机构

110 篇 beijing univ pos...
90 篇 state key labora...
12 篇 department of co...
11 篇 college of compu...
10 篇 tsinghua univers...
10 篇 poznan supercomp...
10 篇 school of comput...
10 篇 department of co...
10 篇 beijing universi...
9 篇 inria
9 篇 beijing universi...
9 篇 research institu...
9 篇 rissho universit...
9 篇 tsinghua univ pe...
9 篇 institute of net...
9 篇 school of cyber ...
9 篇 institute of com...
8 篇 georgia inst tec...
8 篇 department of co...
8 篇 institute of net...

作者

25 篇 yang yang
16 篇 huang lican
16 篇 lican huang
14 篇 wehrle klaus
13 篇 gao zhipeng
12 篇 dustdar schahram
12 篇 buyya rajkumar
12 篇 rothermel kurt
11 篇 duerr frank
11 篇 wu jan-jan
11 篇 rajkumar buyya
11 篇 wang wei
11 篇 liu pangfeng
11 篇 teruhisa hochin
11 篇 qi qi
10 篇 ming chen
10 篇 hoefler torsten
10 篇 m. takizawa
10 篇 cheng shiduan
10 篇 schahram dustdar

语言

6,953 篇 英文
199 篇 其他
48 篇 中文

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

共 7196 条记录，以下是1911-1920 订阅

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

详细简洁

排序：

A Node Rating Based Sharding Scheme for Blockchain

A Node Rating Based Sharding Scheme for Blockchain

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Jianrong Wang Yangyifan Zhou Xuewei Li Tianyi Xu Tie Qiu College of Intelligence and Computing Tianjin University Tianjin China Tianjin Key Laboratory of Advanced Networking Tianjin China Tianjin Key Laboratory of Cognitive Computing and Application Tianjin China Tianjin International Engineering Institute Tianjin University Tianjin China

ISBN: (纸本)9781728125848

The incumbent sharding schemes usually assign the nodes to different committees randomly to meet the demands of security and efficiency at the same time. For example, Elastico protocol obtains a random value by letting the node perform proof of work, and then uses this value for sharding. However, the strategy of random sharding ignores the objective differences between nodes, causing performance gaps between different committees in blockchain. This creates a bottleneck in the transaction throughput of the blockchain. In the paper, we propose a node rating based sharding scheme for blockchain system called NRSS. The key idea of NRSS is to evaluate nodes in the network by both the speeds and results of transactions verification before, and then assign them into different committees by balancing the score to reduce the performance gap between committees and increase the speed of transaction process. We implement NRSS in a local blockchain system, and the experiment results show that NRSS can increase the sharding effect of a blockchain, with an average throughput increase of 32.2% in the simulation environment where the node performance difference is up to 75%, depending on the number of nodes in the committee that are preset in the blockchain.

关键词： Blockchain Sharding technology distributed system Performance rating Performance appraisal distributed Systems Committees Ganglia Simulated Environment Line of nodes

来源：评论

学校读者我要写书评

暂无评论

Towards Island Networks: SDN-Enabled Virtual Private Networks with Peer-to-Peer Overlay Links for Edge computing 1

引用

11th international conference on Internet and distributed computing Systems (IDCS)

作者： Subratie, Kensworth Figueiredo, Renato Univ Florida Gainesville FL 32611 USA

ISBN: (数字)9783030027384

ISBN: (纸本)9783030027384;9783030027377

While solutions to many challenges posed by IoT lie at the network's edge, they cannot forego services available in the cloud which has over a decade of research and engineering to be leveraged. To bridge this gap, hybrid approaches in networking that account for characteristics of both edge and cloud systems are necessary. On cloud data centers, significant progress has been made on applying Software Defined networking (SDN) to address networking challenges such as scalability, addressing, virtualization, and traffic engineering;administrators are now well-versed at managing data center SDN deployments in enterprise systems. However, the applicability of SDN in edge networks has not yet been thoroughly investigated. We propose a hybrid system that incorporates SDN software switches and overlay networks to build dynamic layer 2 virtual networks connecting hosts across the edge (and in the cloud) with links that are peer-to-peer Internet tunnels. These tunnels are terminated as subordinate devices to SDN switches and seamlessly enable the traditional SDN functionalities such that cloud and edge resources can be aggregated.

关键词： IoT Island overlay networks Edge networking Software defined networks distributed computing

来源：评论

学校读者我要写书评

暂无评论

distributed Graph Routing for WirelessHART Networks 18

Distributed Graph Routing for WirelessHART Networks

引用

19th international conference on distributed computing and networking (ICDCN)

作者： Modekurthy, Venkata P. Saifullah, Abusayeed Madria, Sanjay Wayne State Univ Dept Comp Sci Detroit MI 48202 USA Missouri Univ Sci & Tech Dept Comp Sci Rolla MO USA

ISBN: (纸本)9781450363723

Communication reliability in a Wireless Sensor and Actuator Network (WSAN) has a high impact on stability of industrial process monitoring and control. To make reliable and real-time communication in highly unreliable environments, industrial WSANs such as those based on WirelessHART adopt graph routing. In graph routing, each packet is scheduled on multiple time slots using multiple channels, on multiple links along multiple paths on a routing graph between a source and a destination. While high redundancy is crucial to reliable communication, determining and maintaining graph routing is challenging in terms of execution time and energy consumption for resource constrained WSAN. Existing graph routing algorithms use centralized approach, do not scale well in terms of these metrics, and are less suitable under network dynamics. To address these limitations, we propose the first distributed graph routing protocol for WirelessHART networks. Our distributed protocol is based on the Bellman-Ford Algorithm, and generates all routing graphs together using a single algorithm. We prove that our proposed graph routing can include a path between a source and a destination with cost (in terms of hop-count) at most 3 times the optimal cost. We implemented our proposed routing algorithm on TinyOS and evaluated through experiments on TelosB motes and simulations using TOSSIM. The results show that it is scalable and consumes at least 40% less energy and needs at least 65% less time at the cost of 1kB of extra memory compared to the state-of-the-art centralized approach for generating routing graphs.

关键词： Graph Routing Wireless Sensor Actuator Networks WirelessHART distributed Algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamically Negotiating Capacity Between On-demand and Batch Clusters

Dynamically Negotiating Capacity Between On-demand and Batch...

引用

international conference on High Performance computing, networking, Storage, and Analysis (SC)

作者： Liu, Feng Keahey, Kate Riteau, Pierre Weissman, Jon Univ Minnesota Minneapolis MN 55455 USA Argonne Natl Lab Lemont IL USA Univ Chicago Chicago IL 60637 USA

ISBN: (纸本)9781538683842

In the era of rapid experimental expansion data analysis needs are rapidly outpacing the capabilities of small institutional clusters and looking to integrate HPC resources into their workflow. We propose one way of reconciling on-demand needs of experimental analytics with the batch managed HPC resources within a system that dynamically moves nodes between an on-demand cluster configured with cloud technology (OpenStack) and a traditional HPC cluster managed by a batch scheduler (Torque). We evaluate this system experimentally both in the context of real-life traces representing two years of a specific institutional need, and via experiments in the context of synthetic traces that capture generalized characteristics of potential batch and on-demand workloads. Our results for the real-life scenario show that our approach could reduce the current investment in on-demand infrastructure by 82% while at the same time improving the mean batch wait time almost by an order of magnitude (8x).

关键词： Computers and information processing distributed computing Metacomputing Grid computing

来源：评论

学校读者我要写书评

暂无评论

Self-Emerging Data Infrastructures

Self-Emerging Data Infrastructures

引用

international conference on Collaborative computing: networking, Applications and Worksharing (CollaborateCom)

作者： Balaji Palanisamy Chao Li University of Pittsburgh Pittsburgh PA USA Beijing Jiatong University Beijing China

Timed release of data is an important security primitive for various applications. Such timed data release can be supported using a self-emerging data infrastructure that protects the data until a prescribed data release time and automatically releases to the recipient at the release time. While straight-forward centralized approaches such as cloud storage services may provide a straight-forward solution to implement self-emerging data release, unfortunately, they are limited to a single point of trust and involves a single point of control. In this vision paper, we discuss and review new decentralized designs of self-emerging data release systems using large-scale peer-to-peer (P2P) networks as the underlying infrastructure. We analyze the design of decentralized self-emerging data release systems using two P2P network infrastructures, namely distributed Hash Tables (DHTs) and blockchains. We demonstrate how self-emerging data release can be used to support gradual release of private data in a decentralized infrastructure. Finally, we present some promising directions of future research on security primitives and protocols for timed release of private data in decentralized environments.

关键词： distributed databases Peer-to-peer computing Encryption Data privacy Receivers

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Approach for Low Delay distributed MAC using Successive Interference Cancellation in Priority-Based Industrial Wireless Network

A Heuristic Approach for Low Delay Distributed MAC using Suc...

引用

IEEE international Symposium on Parallel and distributed Processing with Applications and IEEE international conference on Ubiquitous computing and Communications (ISPA/IUCC)

作者： Yida Xu Qi Wang Jianmin Liu Chentao He Boyu Diao YongJun Xu Chinese Academy of Sciences Institute of Computing Technology University of Chinese Academy of Scineces Beijing CHINA Chinese Academy of Sciences Institute of Computing Technology Beijing CHINA Chinese Academy of Sciences Institute of Computing Technology

ISBN: (纸本)9781728152103

Wireless sensor networks (WSNs) for industrial manufacturing nowadays are demanding faster delivery of important data than ordinary data. Thus Medium Access Control (MAC) protocols are required to provide low delay media access for traffic of the important data. Successive Interference Cancellation (SIC), which enables multiple-packet reception, gives an opportunity to decrease access delay. Nevertheless, existing MAC protocls are either differetiate access delay for various traffic types without using SIC, or only exploit SIC for unique traffic type. To cover this gap, we propose a distributed MAC protocol that employ SIC to lower access delay for different traffic types in industrial WSNs. By analyzing performance of this protocol, we find a heuristic method to improve adaptability of the proposed protocol and prove the convergence of this heuristic approach. The major contributions of our work are: first, a twostage contention process is adopted in our protocol, which allows multiple transmitters to access edia simutaneously. Second, we analyze performance of the proposed protocol and find a heuristic method to improve it. With the heuristic method, our protocol is available in networks where status of traffic types is unkown. We also prove the convergence of this heuristic method. Simulation results reveal that our protocols performs better on access delay and packet loss rate than the existing good performing priority based distributed MAC protocols.

关键词： access protocols interference suppression telecommunication traffic wireless sensor networks MAC protocol Types of traffic Interference cancellation telecommunication traffic suppression of interference Heuristics protocols Wireless sensor networks Wireless networks Traffic Access heuristic methods MAXIMUM ACCEPTABLE CONTAMINATION Media Access Protocol

来源：评论

学校读者我要写书评

暂无评论

HSAStore: A Hierarchical Storage Architecture for computing Systems Containing Large-Scale Intermediate Data 13th

HSAStore: A Hierarchical Storage Architecture for Computing ...

引用

13th European-Alliance-for-Innovation (EAI) international conference on Collaborative computing - networking, Applications and Worksharing (CollaborateCom)

作者： Zhang, Zhoujie Xiao, Limin Su, Shubin Ruan, Li Wei, Bing Zhou, Nan Liu, Xi Wang, Haitao Wei, Zipeng Beihang Univ State Key Lab Software Dev Environm Beijing 100191 Peoples R China Beihang Univ Sch Comp Sci & Engn Beijing 100191 Peoples R China Space Star Technol Co Ltd Beijing 100086 Peoples R China

ISBN: (纸本)9783030009168;9783030009151

This paper introduces HSAStore, a newly designed storage system whose goal goes to build an efficient storage system for computing systems that containing large-scale intermediate data. HSAStore involves three sub-systems to work together, a distributed file system which is in charge of the intermediate data, a centralized Network Attached Storage (NAS) which stores the raw input data and the results data, and a local file system that serves for the local data. The HSAStore takes full advantage of the network bandwidth of the computing cluster. Moreover, HSAStore adopts the distributed file system, so it is helpful for efficient execution of parallel programs. Experiments show that HSAStore has a significant improvement on efficiency in the computing systems that containing large-scale intermediate data.

关键词： Hierarchical storage architecture Bandwidth bottleneck Large-scale intermediate data distributed file system

来源：评论

学校读者我要写书评

暂无评论

MR-Mafia: Parallel Subspace Clustering Algorithm Based on MapReduce For Large Multi-dimensional Datasets

MR-Mafia: Parallel Subspace Clustering Algorithm Based on Ma...

引用

IEEE international conference on Big Data and Smart computing (BigComp)

作者： Gao, Zhipeng Fan, Yidan Niu, Kun Ying, Zhenyi Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China Beijing Univ Posts & Telecommun Sch Software Engn Beijing Peoples R China

ISBN: (纸本)9781538636497

The mission of subspace clustering is to find hidden clusters exist in different subspaces within a dataset. In recent years, with the exponential growth of data size and data dimensions, traditional subspace clustering algorithms become inefficient as well as ineffective while extracting knowledge in the big data environment, resulting in an emergent need to design efficient parallel distributed subspace clustering algorithms to handle large multi-dimensional data with an acceptable computational cost. In this paper, we introduce MR-Mafia: a parallel mafia subspace clustering algorithm based on MapReduce. The algorithm takes advantage of MapReduce's data partitioning and task parallelism and achieves a good tradeoff between the cost for disk accesses and communication cost. The experimental results show near linear speedups and demonstrate the high scalability and great application prospects of the proposed algorithm.

关键词： Subspace clustering Mafia MapReduce Parallel and distributed

来源：评论

学校读者我要写书评

暂无评论

The Re-expanded Cloud: distributed Uplink Offloading for Mobile Edge computing

The Re-expanded Cloud: Distributed Uplink Offloading for Mob...

引用

IEEE international conference on Communications (ICC) / Workshop on Integrating UAVs into 5G

作者： Ruan, Linna Guo, Shaoyong Rutagemwa, Humphrey Rong, Bo Qiu, Xuesong Li, Wenjing Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China Commun Res Ctr Ottawa ON Canada

ISBN: (纸本)9781538631805

Mobile edge computing (MEC) is envisioned as re-expanded cloud compared to fog computing. As making mobile services computing sank to the edge of network further, performance improvement can be got on time aspect. Therefore, MEC is seemed as a potential technology for delay-sensitive applications. Based on that, a reasonable computation offloading strategy would reduce system consumption for MEC further and release its computational capability. In view of resource shortage, especially bandwidth competition problem among Small Cells and edge computational requirements of HetNet, we focus on distributed uplink offloading for MEC in macro-micro coordination scene. It mainly contains two steps. First, based on Lyapunov to solve offloading decision-making problem for users in each Small Cell. Second, complete offloading update order-making of Small Cells in Macro Cell with proposed deviation update decision algorithm (DUDA). Our strategy makes up for the lack of system stability and uplink analysis in existing research. Numerical results demonstrate the effectiveness of our strategy.

关键词： Task analysis Computational modeling Uplink Servers Interference Decision making Edge computing"

来源：评论

学校读者我要写书评

暂无评论

distributed Hybrid Cloud Management Platform Based On Rule Engine 11

Distributed Hybrid Cloud Management Platform Based On Rule E...

引用

11th IEEE international conference on Cloud computing (CLOUD) Part of the IEEE World Congress on Services

作者： Xu, Peng Su, Jingwei Zhang, Zhongbao Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China Sci & Technol Commun Networks Lab Shijiazhuang Hebei Peoples R China

ISBN: (纸本)9781538672358

In the past few years, there has been a rapid growth in cloud computing, especially IaaS. It's a trend to use hybrid clouds that incorporate components of private and public clouds in order to achieve lower cost, higher availability and better security. Enterprises could get the benefits from it, including high elasticity, efficiency, flexibility, etc. In the meantime, they are faced with a set of challenges in cloud management. However, previous researches have primarily focused on single cloud platform, with lack of efficient management of hybrid clouds. To bridge this gap, in this paper, we propose a distributed hybrid cloud management platform based on rule engine. We design a succinct rule model to define rules and events. Combined with a distributed and reliable architecture, the demands of batch processing, automatic operation could be met, which make it more flexible and efficient to manage cloud resources from multiple IaaS cloud providers.

关键词： Hybrid Cloud Rule Engine IaaS Management

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 188 189 190 191 192 193 194 195 196 197 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：