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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,682 篇 工学
- 1,477 篇 计算机科学与技术...
- 670 篇 软件工程
- 490 篇 信息与通信工程
- 355 篇 电气工程
- 93 篇 控制科学与工程
- 82 篇 网络空间安全
- 65 篇 生物工程
- 56 篇 电子科学与技术（可...
- 42 篇 动力工程及工程热...
- 39 篇 仪器科学与技术
- 33 篇 机械工程
- 28 篇 建筑学
- 26 篇 交通运输工程
- 26 篇 安全科学与工程
- 25 篇 环境科学与工程（可...
- 24 篇 光学工程
- 20 篇 生物医学工程（可授...
- 17 篇 材料科学与工程（可...
323 篇 理学
- 192 篇 数学
- 67 篇 生物学
- 46 篇 系统科学
- 45 篇 统计学（可授理学、...
- 44 篇 物理学
216 篇 管理学
- 143 篇 管理科学与工程(可...
- 85 篇 图书情报与档案管...
- 73 篇 工商管理
50 篇 法学
- 34 篇 社会学
27 篇 医学
- 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...
83 篇 computational mo...
75 篇 security
69 篇 mobile computing
66 篇 routing
66 篇 servers
61 篇 resource managem...
60 篇 peer-to-peer com...
59 篇 internet of thin...
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,687 篇 英文
62 篇 其他
6 篇 中文
2 篇 法文

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

共 2756 条记录，以下是831-840 订阅

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

详细简洁

排序：

Do we really need cloud? Estimating the fog computing capacities in the city of Barcelona 11

Do we really need cloud? Estimating the fog computing capaci...

引用

11th IEEE/ACM international conference on Utility and Cloud computing (UCC-Companion) / 5th IEEE/ACM international conference on Big Data computing, Applications and Technologies (BDCAT)

作者： Garcia, Jordi Simo, Ester Masip-Bruin, Xavier Marin-Tordera, Eva Sanchez-Lopez, Sergi UPC BarcelonaTech Adv Network Architectures Lab CRAAX Barcelona Spain

ISBN: (纸本)9781728103594

Fog computing has emerged as a novel and challenging technology intended to complement the features of the cloud computing paradigm by exploiting the opportunities of locality. Moving some computation to the edge of the network is especially attractive in a smart city scenario, where a vast network of heterogeneous resources is widely distributed all over the city. In such scenario, using the available fog resources allows the deployment of a rich family of new services that combine the advantages of both, cloud and fog technologies. In fact, the amount of computing load that can be moved down to the edge will actually depend on the edge devices capacity. But, in this context, some key questions arise;for example, how much computing capacity is there at the edge? Are there enough resources to execute efficiently some deep computing applications? And the most relevant, could the cloud layer be ignored in case of sufficient fog resources? In this paper, we analyze and estimate the fog computing capacity in a major European smart city: Barcelona. To this end, we analyze the available information about Barcelona and estimate the number of computing devices in the city that could be part of a fog environment, including personal computers, smartphones, on-board car computers, WiFi routers, and some other embedded computers deployed as part of city services. then, we estimate an average computing capacity for each type of computing device, and obtain the potential computing peak performance for an eventual fog cluster of Barcelona. We believe the results of this work will be useful to provide insights into the aforementioned open questions, but also for fog technology researchers and developers to understand the order of magnitude of a real fog computing scenario.

关键词： Smart city cloud computing fog computing edge computing resources management computing capacity

来源：评论

学校读者我要写书评

暂无评论

Re-running Large-scale Parallel Programs Using Two Nodes 16

Re-running Large-scale Parallel Programs Using Two Nodes

引用

16th IEEE ISPA / 17th IEEE IUCC / 8th IEEE BDCloud / 11th IEEE SocialCom / 8th IEEE SustainCom

作者： Guo, Yayu Lin, Fang Liu, Yi Qian, Depei Beihang Univ Sch Comp Sci & Engn Beijing Peoples R China

ISBN: (纸本)9781728111414

With the increasing of scale and complexity of high performance computing (HPC) systems, the programming, debugging, and tuning of large-scale parallel programs face a series of challenges, one of which is that programmers often need to repeatedly run their programs with large number of processes on HPC systems to identify sources of errors and performance bottlenecks in their programs, which means large amounts of resource consumptions. Furthermore, since most HPC systems use job scheduling system to manage their resources and schedule multiple jobs from different users, programmers cannot interact with their programs during the execution of programs, which further increases complexities of debugging and tuning. To address this challenge, this paper proposes a system that reruns large-scale MPI parallel programs using two nodes. According to an approach of one real-execution + multiple emulation-executions, the parallel program is firstly executed with desired number of processes on an HPC system, which is referred as real-execution, and during the execution, our system records MPI messages transmitted among processes as well as control information of processes;after that, one or more processes can be re-run on a two-node local system under the scale the same with the real-execution. In the meantime, programmers can interact with their programs by attaching the GDB, a commonly used debugger, to the re-running process. therefore, not only can our system reduce resource-consumptions in debugging and tuning of large-scale parallel programs significantly, but also support interactions between developers and their programs during the execution of the programs, which makes programmers easier to identify sources of the errors and performance bottlenecks in their parallel programs.

关键词： high performance computing HPC debugging tool performance tool large-scale parallel programs

来源：评论

学校读者我要写书评

暂无评论

Adaptive Congestion Control for Handover in Heterogeneous Mobile Content-Centric networking 11

Adaptive Congestion Control for Handover in Heterogeneous Mo...

引用

11th international conference on Mobile computing and Ubiquitous Network (ICMU)

作者： Iwamoto, Daiki Sugahara, Daisuke Bandai, Masaki Yamamoto, Miki Kansai Univ Grad Sch Sci & Engn Osaka Japan Sophia Univ Fac Sci & Technol Tokyo Japan Kansai Univ Fac Engn Sci Osaka Japan

ISBN: (纸本)9784907626341

CCN (Content-Centric networking) is receiver-driven architecture whose communication is triggered by consumer requests. When a consumer changes its access point (handover), it cannot receive requested Data packets. However, the consumer can retransmit in-flight Interest packets to a new route and reconstruct its route to obtain corresponding Data packets. Each consumer has its own parameters for congestion control, e.g. congestion window size, congestion threshold and timeout value. In the case of a handover to a heterogeneous network, e.g. from LTE to Wi-Fi, when congestion parameters set just before the handover are carried over, they probably are inadequate for new network environments. In this paper, we propose an effective receiver-driven control, Congestion Parameter Initialization. Our policy is quite simple and a consumer initializes its congestion parameters just after the handover. Our simulation results show that our proposal can adapt its congestion parameters to new network environment quickly.

关键词： Content-Centric networking wireless mobile networks consumer mobility

来源：评论

学校读者我要写书评

暂无评论

Ubiquitous and Pervasive computing for Real-Time Energy Management and Saving A System Architecture 11th

Ubiquitous and Pervasive Computing for Real-Time Energy Mana...

引用

11th international conference on Innovative Mobile and Internet Services in Ubiquitous computing (IMIS)

作者： Scannapieco, Simone Tomazzoli, Claudio Real TR & TD Dept Verona Italy Parco Sci E Tecnol Verona Italy

ISBN: (纸本)9783319615424;9783319615417

In the present paper we investigate one of the emerging applicability fields of pervasive computing, that is, energy management and saving. We exploit innovative technologies to define a brand new system architecture for (i) centralized monitoring and (ii) real-time energy saving in distributed sub-networks of power consuming electric appliances. the architecture allows the definition of reactive and intelligent systems that take autonomous courses of action on electric devices. We also introduce a prototype which is an embodiment of such architecture, called MyElettra.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Fisher Discriminant Analysis Random Forest for Online Class Incremental Learning 16

Fisher Discriminant Analysis Random Forest for Online Class ...

引用

16th IEEE ISPA / 17th IEEE IUCC / 8th IEEE BDCloud / 11th IEEE SocialCom / 8th IEEE SustainCom

作者： Xiong, Wang Wang, Yijie Cheng, Li Natl Univ Def Technol Sci & Technol Parallel & Distributed Proc Lab Changsha Hunan Peoples R China Natl Univ Def Technol Coll Comp Changsha Hunan Peoples R China

ISBN: (纸本)9781728111414

Class incremental learning needs to deal with a dynamic environment where data class appears incrementally, it is a challenge to learn new knowledge while preserving what has already been learned. On the other hand, due to the limited storage of the online scenario, algorithm is usually obstructed to frequently scan or simply store all historical data, it is another challenge to reduce the historical data storage for algorithm. Few existing work have addressed above challenges simultaneously. In this paper, we propose Fisher Discriminant Analysis Random Forest (FDARF), which consists of two parts, GHS (Generate Hierarchical Split) and RRS (Random Reform Subtree), that cooperatively operate. GHS combines FDA (Fisher Discriminant Analysis) with tree hierarchy to learn a hierarchical split of data space that provides strong ability for classification. the statistics in leaves (i.e. historical data) can be described by covariance matrix and further optimized by matrix sketching algorithm to reduce storage;for every tree initialized by GHS, RRS randomly reforms certain state subtree, which creates diversity that can be ensemble for ensuring effectiveness of class incremental learning. Extensive experiments on diverse datasets validate that FDARF can well adapt to the online class incremental learning.

关键词： Fisher Discriminant Analysis Matrix Sketching Random Forest Online Class Incremental Learning

来源：评论

学校读者我要写书评

暂无评论

Loop Perforation in OpenACC 16

Loop Perforation in OpenACC

引用

16th IEEE ISPA / 17th IEEE IUCC / 8th IEEE BDCloud / 11th IEEE SocialCom / 8th IEEE SustainCom

作者： Lashgar, Ahmad Atoofian, Ehsan Baniasadi, Amirali Univ Victoria Elect & Comp Engn Dept Victoria BC Canada Lakehead Univ Elect Engn Dept Thunder Bay ON Canada

ISBN: (纸本)9781728111414

High-level programming models such as OpenMP and OpenACC are used to accelerate loop-parallelizable applications. In such applications, a very large number of loop iterations are launched as threads on the accelerator, where every iteration executes the same code sequence (loop body or kernel) but on different data. In such workloads, similarities in the input lead to wide similarities in the outputs. Motivated by this observation, we propose to run only a subset of loop iterations, accurately calculating some outputs and approximating the rest. To this end, we propose employing a new directive in OpenACC to trade off performance for accuracy by perforating loop iterations. the directive is only applicable to parallel loops with a perforation rate adjusted by the programmer. Moreover, we investigate the quality and runtime impact of this directive. In summary, first, we show that naively applying loop perforation to OpenACC, degrades performance significantly. this is because OpenACC parallel loops are often output-parallelized and every iteration calculates one single entry in the output. Consequently, dropping k iterations leads to k erroneous entries in the output. Second and in order to address this we propose an efficient low-overhead mechanism to recover the value of these missing output entries. third, we show that due to the SIMD organization of accelerators, perforation does not always translate to runtime improvements. Our study shows that perforation can change the memory coalescing behavior and negatively impact runtime. In order to provide better insight we present workload characteristics that benefit from perforation the most. Our evaluations using a diverse set of benchmarks indicate that our proposed technique can improve performance up to 93%, while maintaining the quality loss at a rate below 10%.

关键词： Approximate computing GPGPU OpenACC Loop perforation CUDA

来源：评论

学校读者我要写书评

暂无评论

Secure Spatial Network Queries on Cloud Platform 16

Secure Spatial Network Queries on Cloud Platform

引用

16th IEEE ISPA / 17th IEEE IUCC / 8th IEEE BDCloud / 11th IEEE SocialCom / 8th IEEE SustainCom

作者： Teng, Yiping Liu, Jinyan Liu, Xiaoting Ding, Guohui Fan, Chunlong Shenyang Aerosp Univ Sch Comp Shenyang Liaoning Peoples R China

ISBN: (纸本)9781728111414

With massive real-world networks added with spatial attributes, query processing in spatial networks has been widely used in real-life applications. Considering the high costs of spatial network queries, outsourcing querying services to cloud provides a cost-effective way for data owners. However, directly outsourcing such services may cause serious privacy concerns. To address this privacy problem, existing studies apply anonymous or differential privacy techniques on spatial network queries, which are not under the semi-trusted secure model. Other existing works primarily focus on query processing over either encrypted spatial or network data, which cannot directly be applied to work out the secure spatial network query problem. To this end, we define and study Secure Spatial Network kNN Query (SSNQ) problem on cloud platform. We first present Basic Secure Spatial Network kNN Query (BSSNQ) method, in which we compute secure kNN for the query node to construct candidate sequences using secure subprotocols. With pre-encrypted network distances, we then compute shortest paths between the query node and each candidate, and securely update the candidate sequences according to Euclidean restriction to derive final query results. To improve the efficiency of BSSNQ, we further propose Heuristic Secure Spatial Network kNN Query (HSSNQ) method, which securely calculates shortest paths from the query node to the visiting nodes iteratively, and use optimistic estimate distances as the key to lead the heuristic search within a priority queue. thorough analysis shows the security and complexity of the proposed methods, and extensive experimental results on real datasets demonstrate the efficiency of the query performance.

关键词： spatial networks secure kNN queries data outsourcing cloud computing

来源：评论

学校读者我要写书评

暂无评论

A Migratable Container-Based Replication Management for Inter-cloud 11th

A Migratable Container-Based Replication Management for Inte...

引用

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

作者： Chen, Mingkang Sun, Jingtao China Cent Normal Univ Dept Elect & Informat Engn Wuhan 430079 Peoples R China Natl Inst Informat Informat Syst Architecture Res Div Tokyo 1018430 Japan

ISBN: (纸本)9783030027384;9783030027377

this paper proposes a novel approach to rapidly deploy a migratable container-based replication management for inter-cloud. the key idea behind the proposed approach is to introduce the coordination of multiple autonomic managers in inter-cloud environments. Compared with existing researches, we can not only absorb features from heterogeneous clouds through the Base Container, but also we can periodically update the deployed container-based replication mechanism through asynchronous processes, in order to improve data consistency problem. In addition, this paper analyzes the feasibility through comparing between file reading and writing in same and different clouds in the proposed approach.

关键词： distributed storage Replication Container Adaptability Inter-cloud

来源：评论

学校读者我要写书评

暂无评论

Financial Application on an Openstack Based Private Cloud 1

引用

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

作者： Bajpai, Deepak Vinayak, Muskan thulasiram, Ruppa K. thulasiraman, Parimala Univ Manitoba Dept Comp Sci Winnipeg MB Canada

ISBN: (数字)9783030027384

ISBN: (纸本)9783030027384;9783030027377

We build a private Cloud using off-the-shelf servers and do extensive experiments for application and performance testing. We studied a real-world application of financial option pricing by implementing two algorithms (Monte-Carlo simulation and binomial lattice for option pricing) on this private Cloud and used this application for the purpose of accuracy testing in comparison to a well established closed-form solution available as Black-Scholes-Merton formula. Also, using these algorithms we analyze performance of Cloud VMs. We compare the performance with standalone servers and found that the performance of Cloud VM is better to standalone servers when (a) the number of vCPUs are limited to a single node and (b) load balancing issues are not considered.

关键词： Cloud computing Private cloud Openstack Financial option pricing Performance

来源：评论

学校读者我要写书评

暂无评论

Blockchain Based Secure Package Delivery via Ridesharing

Blockchain Based Secure Package Delivery via Ridesharing

引用

international conference on Wireless Communications and Signal Processing (WCSP)

作者： Xuefei Zhang Junjie Liu Yijing Li Qimei Cui Xiaofeng Tao Ren Ping Liu National Engineering Lab for Mobile Network Technologies Beijing University of Posts and Telecommunications Beijing China University of Technology Sydney Sydney Austrilia

Delivery service via ridesharing is a promising service to share travel costs and improve vehicle occupancy. Existing ridesharing systems require participating vehicles to periodically report individual private information (e.g., identity and location) to a central controller, which is a potential central point of failure, resulting in possible data leakage or tampering in case of controller break down or under attack. In this paper, we propose a Blockchain secured ridesharing delivery system, where the immutability and distributed architecture of the Blockchain can effectively prevent data tampering. However, such tamper-resistance property comes at the cost of a long confirmation delay caused by the consensus process. A Hash-oriented Practical Byzantine Fault Tolerance (PBFT) based consensus algorithm is proposed to improve the Blockchain efficiency and reduce the transaction confirmation delay from 10 minutes to 15 seconds. the Hash-oriented PBFT effectively avoids the double-spending attack and Sybil attack. Security analysis and simulation results demonstrate that the proposed Blockchain secured ridesharing delivery system offers strong security guarantees and satisfies the quality of delivery service in terms of confirmation delay and transaction throughput.

关键词： Contracts Servers Delays Peer-to-peer computing Vehicles

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共276页 << < 80 81 82 83 84 85 86 87 88 89 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：