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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

306 篇 cloud computing
151 篇 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
49 篇 edge computing
41 篇 big data
41 篇 data models
40 篇 computer science
39 篇 internet of thin...

机构

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,915 篇 英文
42 篇 中文
34 篇 其他
1 篇 俄文

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

共 2982 条记录，以下是801-810 订阅

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

详细简洁

排序：

Cost-efficient Datacentre Consolidation for Cloud Federations 8

Cost-efficient Datacentre Consolidation for Cloud Federation...

引用

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

作者： Kecskemeti, Gabor Markus, Andras Kertesz, Attila Liverpool John Moores Univ Dept Comp Sci Liverpool Merseyside England Univ Szeged Software Engn Dept Dugon Ter 13 H-6720 Szeged Hungary

ISBN: (纸本)9789897582950

Cloud computing has become mature enough to enable the virtualized management of multiple datacentres. Datacentre consolidation is an important method for the efficient operation of such distributed infrastructures. Several approaches have been developed to improve the efficiency e.g. in terms of power consumption, but only a few attention has been turned to combining pricing methods with consolidation techniques. In this paper we discuss how we introduced cost models to the DISSECT-CF simulator to foster the development of cost efficient datacentre consolidation solutions. We also exemplify the usage of this extended simulator by performing cost-aware datacentre consolidation. We apply real world traces to simulate cloud load, and propose 7 strategies to address the problem.

关键词： Cloud computing Datacentre Consolidation Simulation

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 8th international conference Confluence 2018 on Cloud computing, Data Science and Engineering, Confluence 2018

Proceedings of the 8th International Conference Confluence 2...

引用

8th international conference Confluence on Cloud computing, Data Science and Engineering, Confluence 2018

ISBN: (纸本)9781538617182

the proceedings contain 158 papers. the topics discussed include: a new clustering method using an augmentation to the self organizing maps;a study on machine learning based generalized automated seizure detection system;maximum correlation with migration control based on modified knapsack(MC-MC) approach for VM selection for green cloud computing;detection of rumor in social media;a comparative study of security features provided by different cloud services to enterprises;a comparative analysis of various congestion control schemes in wireless sensor networks;IoT based weather and location aware recommender system;importance of user's profile attributes in identity matching across multiple online social networking sites;and random grid based extended visual secret sharing scheme for image authentication.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A distributed Algorithm for Controller Placement in Software Defined Vehicular Networks 8

A Distributed Algorithm for Controller Placement in Software...

引用

8th international conference on Networks, Communication and computing, ICNCC 2019

作者： Wang, Junpeng Fu, Zhumu Si, Pengju Tao, Fazhan Henan University of Science and Technology Henan Key Laboratory of Robot and Intelligent Systems Luoyang Henan471023 China School of Information Engineering Henan University of Science and Technology Luoyang Henan471023 China

ISBN: (纸本)9781450377027

With the rise of autonomous driving technology and the growing demand for real-time traffic information, there is a growing demand for Internet of Vehicle (IoV). Vehicle Ad-hoc Network (VANET) is purposed to avoid long-distance data transmission for situations where only local information is needed. However, it is difficult to update the routing protocol in VANET, so the Software Defined Network (SDN) technology is applied to the VANET network. the SDN structure consists of a data layer and a control layer, and how to arrange the control layer structure will affect system performance. In this paper, we approximate the placement problem of the control layer as a facility location problem, and propose a distributed algorithm to better solve this problem. the simulation in the actual problem verifies that the proposed algorithm can effectively solve the problem of the placement of the control layer. © 2019 ACM.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Building Dynamic Mapping with CUPS for Next Generation Automotive Edge computing

Building Dynamic Mapping with CUPS for Next Generation Autom...

引用

IEEE international conference on Cloud networking (CLOUDNET)

作者： Zhaoxia Sun Ping Du Akihiro Nakao Lei Zhong Ryokichi Onishi The University of Tokyo Japan Toyota Motor Corporation Japan

ISBN: (数字)9781728148328

ISBN: (纸本)9781728148335

With the development of IoT and 5G networks, the demand for the next-generation intelligent transportation system has been growing at a rapid pace. Dynamic mapping has been considered one of the key technologies to reduce traffic accidents and congestion in the intelligent transportation system. However, as the number of vehicles keeps growing, a huge volume of mapping traffic may overload the central cloud, leading to serious performance degradation. In this paper, we propose and prototype a CUPS (control and user plane separation)-based edge computing architecture for the dynamic mapping and quantify its benefits by prototyping. there are a couple of merits of our proposal: (i) we can mitigate the overhead of the networks and central cloud because we only need to abstract and send global dynamic mapping information from the edge servers to the central cloud; (ii) we can reduce the response latency since the dynamic mapping traffic can be isolated from other data traffic by being generated and distributed from a local edge server that is deployed closer to the vehicles than the central server in cloud. the capabilities of our system have been quantified. the experimental results have shown our system achieves throughput improvement by more than four times, and response latency reduction by 67.8% compared to the conventional central cloud-based approach. Although these results are still obtained from the preliminary evaluations using our prototype system, we believe that our proposed architecture gives insight into how we utilize CUPS and edge computing to enable efficient dynamic mapping applications.

关键词： Vehicle dynamics Cloud computing Edge computing Servers Prototypes Computer architecture Logic gates

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

引用

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

作者： Cavalcante, Denis M. Farias, Victor A. Sousa, Flavio R. C. Paula, Manoel Rui P. Machado, Javam C. Souza, Neuman Univ Fed Ceara LSBD Dept Comp Sci Fortaleza Ceara Brazil

ISBN: (纸本)9789897582950

distributed key-value stores (KVS) are a well-established approach for cloud data-intensive applications, but they were not designed to consider workloads with data access skew, mainly caused by popular data. In this work, we analyze the problem of replica placement on KVS for workloads with data access skew. We formally define our problem as a multi-objective optimization and present the PopRing approach based on genetic algorithm to find a new replica placement scheme. We also use OpenStack-Swift as the baseline to evaluate the performance improvements of PopRing under different configurations. A moderate PopRing configuration reduced in 52% the load imbalance and in 32% the replica placement maintenance while requiring the reconfiguration (data movement) of only 6% of total system data.

关键词： Replica Placement Consistent Hashing Data Access Skew Multi-objective Optimization Genetic Algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

KaliGreen: A distributed Scheduler for Energy Saving 9

KaliGreen: A distributed Scheduler for Energy Saving

引用

9th international conference on Emerging Ubiquitous Systems and Pervasive Networks (EUSPN) / 8th international conference on Current and Future Trends of Information and Communication Technologies in Healthcare (ICth)

作者： Lvarez-Valera, Hernn H. Roose, Philippe Dalmau, Marc Herzog, Christina Respicio, Kyle Univ PAU Comp Sci Lab LIUPPA Alle Parc Montaury F-64600 Anglet France EFFICIT SAS 6 Route Carpentier Cabirol Mauzac France

A commonplace issue with portable technology is battery efficiency. While many industries are trying their best to improve battery life without sacrificing a products quality and efficiency, we believe that further can be done to improve battery consumption on ones mobile devicefrom tablets to smartphones to laptops to everything else. Many applications on these devices are based on a micro service architecture. In this article, we introduce a new algorithm KaliGreen that can maneuver the microservices within a network of devices in order to maximize the run-time of a microservice-based application;moreover, KaliGreen allows a 54% increase in the average run-time of an application by shifting microservices from 6 devices (as example) with low battery or inefficient processing ratios to devices in better conditions. To achieve this, KaliGreen utilizes KaliMucho middleware, which is able manipulate microservices in run-time. this algorithm provides a plausible solution to maximizing energy consumption within a network of devices. (C) 2018 the Authors. Published by Elsevier Ltd.

关键词： Green computing distributed applicatioggns Microservices Smartphones

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共299页 << < 77 78 79 80 81 82 83 84 85 86 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：