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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是861-870 订阅

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

详细简洁

排序：

SYSTOR 2018 - Proceedings of the 11th ACM international Systems and Storage conference

SYSTOR 2018 - Proceedings of the 11th ACM International Syst...

引用

11th ACM international Systems and Storage conference, SYSTOR 2018

ISBN: (纸本)9781450358491

the proceedings contain 23 papers. the topics discussed include: Lerna: parallelizing dependent loops using speculation;chaperone - runtime system for instrumenting applications via partial binary translation;DLIRS: improving low inter-reference recency set cache replacement policy with dynamics;the quick migration of file servers;how to build an insecure system out of perfectly good cryptography;how to best share a big secret;Inkpack: a secure, data-exposure resistant storage system;seamless fail-over for PCIe switched networks;Memomania: from huge to huge-huge pages;collusion in cloud computing auctions;shared cloud object store, governed by permissioned blockchain;space efficient elephant flow detection;Hyplets - multi exception level kernel towards Linux RTOS;towards serverless NFV for 5G media applications;an intelligent recycle bin for smart cities;RestAssured: securing cloud analytics;efficient analytics on encrypted data;accelerating unmodified databases using persistent memory and flash storage tiers;PM aware storage engine for MongoDB;privacy enforcement at a large scale for GDPR compliance;Teechain: reducing storage costs on the blockchain with offline payment channels;applying deep learning to object store caching;and distributed fault-tolerant backup-placement in overloaded wireless sensor networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deterministic Dispersion of Mobile Robots in Dynamic Rings 18

Deterministic Dispersion of Mobile Robots in Dynamic Rings

引用

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

作者： Agarwalla, Ankush Augustine, John Moses, William K., Jr. Sankar, Madhav K. Sridhar, Arvind Krishna Natl Inst Technol Rourkela Dept Comp Sci & Engn Rourkela Odisha India Indian Inst Technol Madras Dept Comp Sci & Engn Chennai Tamil Nadu India Natl Inst Technol Tiruchirappalli Dept Comp Sci & Engn Tiruchirappalli Tamil Nadu India

ISBN: (纸本)9781450363723

In this work, we study the problem of dispersion of mobile robots on dynamic rings. the problem of dispersion of n robots on an n node graph, introduced by Augustine and Moses Jr. [2], requires robots to coordinate with each other and reach a configuration where exactly one robot is present on each node. this problem has real world applications and applies whenever we want to minimize the total cost of n agents sharing n resources, located at various places, subject to the constraint that cost of an agent moving to a different resource is comparatively much smaller than cost of multiple agents sharing a resource (e.g. smart electric cars sharing recharge stations). Study of this problem also provides indirect benefits to the studies of scattering on graphs, exploration by mobile robots, and load balancing on graphs. We solve the problem of dispersion in presence of two types of dynamism in the underlying graph: (i) vertex permutation and (ii) 1-interval connectivity. We introduce the notion of vertex permutation dynamism and have it mean that for a given set of nodes, in every round, the adversary ensures a ring structure is maintained, but the connections between the nodes may change. We use the idea of 1-interval connectivity from Di Luna et al. [11], where for a given ring, in each round, the adversary chooses at most one edge to remove. We assume robots have full visibility and present asymptotically time optimal algorithms to achieve dispersion in the presence of both types of dynamism when robots have chirality. When robots do not have chirality, we present asymptotically time optimal algorithms to achieve dispersion subject to certain constraints. Finally, we provide impossibility results for dispersion when robots have no visibility.

关键词： Dispersion Load balancing Mobile robots Collective robot exploration Scattering Dynamic graph algorithms Dynamic networks Deterministic algorithms distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Accuracy Is Not Enough: Serendipity Should Be Considered More 11th

Accuracy Is Not Enough: Serendipity Should Be Considered Mor...

引用

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

作者： Yu, Huan Wang, Ying Fan, Yaning Meng, Sachula Huang, Rui Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China China Acad Informat & Commun Technol CTTL Terminals Beijing 100191 Peoples R China

ISBN: (纸本)9783319615424;9783319615417

In recent years, information overload has led to the development of a wide variety of different types of recommender systems (RSs), which aim at harnessing the problem in different domains. Most RSs spare no effort to improve the accuracy to help users find items matching their latest preferences. However, RSs with high accuracy not always capture user satisfaction due to that users might get bored with the items which are similar to what they liked in the past. Furthermore, they narrow the horizon of users and limiting the dynamic nature of user interests. Given this, serendipity draws more attention when evaluating RSs. In this paper, we review the studies on serendipity. Working toward this direction, we propose a new metric aiming at evaluating serendipity of RSs and a new strategy to balance the tension between accuracy and serendipity in movie recommender domain.

关键词： Serendipity Accuracy Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Supporting Hypothesis Generation by Machine Learning in Smart Health 11th

Supporting Hypothesis Generation by Machine Learning in Smar...

引用

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

作者： Amato, Alba Coronato, Antonio Natl Res Council CNR Inst High Performance Comp & Networking ICAR Naples Italy

ISBN: (纸本)9783319615424;9783319615417

the health care process involves a set of massive data that can be of different types and placed in different places. the digitization of information, if properly analysed, leads to an increase in the quality of processes and services in the Healthcare sector. In this context, Machine Learning (ML) is the key enabling technology to reduce the costs of health care extracting knowledge from data. the goal of ML is to improve a system without any continuous human intervention. Medical Decision Support Systems (MDSS) are an added value on the one hand by speeding up diagnosis and care processes, on the other hand reducing the time of medical staff or specialized learning. the paper proposes a new method to enable medical decision making improving collaboration between machine learning experts and clinicians in order to model individual treatments. the idea is to adapt machine learning models and decision support systems to address the challenging task of the decision of individual treatments in order to make more efficient decision-making and more effective therapies.

关键词： Machine learning Decision support system Smart health

来源：评论

学校读者我要写书评

暂无评论

Collaborative computing: networking, Applications, and Worksharing: 11th international conference, CollaborateCom 2015, Wuhan, November 10-11, 2015, China. Proceedings 1

引用

丛书名： Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 163

2016年

作者： Song Guo, Xiaofei Liao, Fangming Liu, Yanmin Zhu (eds.)

ISBN: (数字)9783319289106

ISBN: (纸本)9783319289090;9783319289106

this book constitutes the thoroughly refereed proceedings of the 11th international conference on Collaborative computing: networking, Applications, and Worksharing, CollaborateCom 2015, held in Wuhan, China, in November 2015. the 24 full papers and 8 short papers presented were carefully reviewed and selected from numerous submissions. they address topics around networking, technology and systems, including but not limited to collaborative cloud computing, architecture and evaluation, collaborative applications, sensors and Internet of things (IoT), security.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Benchmark Model for the Creation of Compute Instance Performance Footprints 1

引用

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

作者： Ullrich, Markus Laessig, Joerg Sun, Jingtao Gaedke, Martin Aida, Kento Univ Appl Sci Zittau Gorlitz Bruckenstr 1 Gorlitz Germany Natl Inst Informat Chiyoda Ku 2-1-2 Hitotsubashi Tokyo Japan Tech Univ Chemnitz Str Nationen 62 Chemnitz Germany

ISBN: (数字)9783030027384

ISBN: (纸本)9783030027384;9783030027377

Cloud benchmarking has become a hot topic in cloud computing research. the idea to attach performance footprints to compute resources in order to select an appropriate setup for any application is very appealing. Especially in the scientific cloud, a lot of resources can be preserved by using just the right setup instead of needlessly over-provisioned instances. In this paper, we briefly list existing efforts that have been made in this area and explain the need for a generic benchmark model to combine the results found in previous work to reduce the benchmarking effort for new resources and applications. We propose such a model which is build on our previously presented resource and application model and highlight its advantages. We show how the model can be used to store benchmarking data and how the data is linked to the application and the resources. Also, we explain how the data, in combination with an infrastructure as code tool, can be utilized to automatically create and execute any application and any micro benchmark in the cloud with low manual effort. Finally, we present some of the observations we made while benchmarking compute instances at two major cloud providers.

关键词： Cloud computing Performance footprints Cloud benchmarking Compute instances

来源：评论

学校读者我要写书评

暂无评论

Lightweight Authentication for distributed Mobile P2P Communications 11th

Lightweight Authentication for Distributed Mobile P2P Commun...

引用

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

作者： Lim, Jiyoung Doh, Inshil Chae, Kijoon Korean Bible Univ Dept Comp Software Seoul South Korea Ewha Womans Univ Dept Comp Sci & Engn Seoul South Korea

ISBN: (纸本)9783319615424;9783319615417

Peer-to-Peer (P2P) service has gained a great popularity for content sharing among distributed users. Even if it brings a lot of attraction as a good content distribution method, security becomes a very critical issue because a service user needs to communicate with the other persons who could be untrustworthy. Traditional authentication mechanisms usually adopted public key mechanisms, and they are heavy and time consuming. Because of the randomness and mobility of mobile P2P service, the authentication should be lightweight and dynamic. In our work, we propose a mechanism based on visual cryptography and steganography for the mutual authentication between two users for P2P service, and for the P2P multicast service authentication. Our proposed authentication mechanism is lightweight and efficient because it is based on users' vision by adopting visual cryptography and steganography, and most computation for image generation is only concentrated on authentication server.

关键词： P2P Authentication Security Visual cryptography Steganography

来源：评论

学校读者我要写书评

暂无评论

#metoo through the Lens of Social Media 11th

#metoo Through the Lens of Social Media

引用

11th international conference on Social computing, Behavioral-Cultural Modeling, and Prediction (SBP) / conference of the Behavioral-Representation-in-Modeling-and-Simulation- Society (BRiMS)

作者： Manikonda, Lydia Beigi, Ghazaleh Kambhampati, Subbarao Liu, Huan Arizona State Univ Tempe AZ 85281 USA

ISBN: (纸本)9783319933726;9783319933719

Sexual abuse - a highly stigmatized topic in the society has spurred a revolution in the recent days especially through the shared posts on social media platforms via attaching the hashtag #metoo. Individuals from different backgrounds and ethnicities began sharing on the online venues about their personal experiences of getting sexually assaulted. this paper makes an initial attempt to asses the public reactions and emotions by utilizing the publicly shared #metoo posts by performing a comparative analysis of the tweets shared on Twitter as well as on Reddit. though nearly equal ratios of negative and positive posts are shared on both platforms, Reddit posts are focused on the sexual assaults within families and workplaces while Twitter posts are on showing empathy and encouraging others to continue the #metoo movement. the data collected in this research helps in the preliminary analysis of the user engagement, discussion topics, word connotations and sentiment with respect to the #metoo movement.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Scheduling the Execution of Tasks at the Edge 11

Scheduling the Execution of Tasks at the Edge

引用

11th IEEE international conference on Evolving and Adaptive Intelligent Systems (EAIS)

作者： Kolomvatsos, Kostas Loukopoulos, thanasis Univ Athens Dept Informat & Telecommun Athens 15784 Greece Univ Thessaly Dept Comp Sci Lamia 35100 Greece Univ Thessaly Dept Biomed Informat Lamia 35100 Greece

ISBN: (纸本)9781538613764

the Internet of things provides a huge infrastructure where numerous devices produce, collect and process data. these data are the basis for offering analytics to support novel applications. the processing of huge volumes of data is a demanding process, thus, the power of Cloud is already utilized. However, latency, privacy and the drawbacks of this centralized approach became the motivation for the emerge of edge computing. In edge computing, data could be processed at the edge of the network;at the IoT nodes to deliver immediate results. Due to the limited resources of IoT nodes, it is not possible to have a high number of demanding tasks locally executed to support applications. In this paper, we propose a scheme for selecting the most significant tasks to be executed at the edge while the remaining are transferred into the Cloud. Our distributed scheme focuses on mobile IoT nodes and provides a decision making mechanism and an optimization module for delivering the tasks that will be executed locally. We take into consideration multiple characteristics of tasks and optimize the final decision. With our mechanism, IoT nodes can be adapted to, possibly, unknown environments evolving their decision making. We evaluate the proposed scheme through a high number of simulations and give numerical results.

关键词： IoT Edge computing Energy Requirements Task Execution

来源：评论

学校读者我要写书评

暂无评论

Fast and Scalable distributed Loopy Belief Propagation on Real-World Graphs 18

Fast and Scalable Distributed Loopy Belief Propagation on Re...

引用

11th ACM international conference on Web Search and Data Mining

作者： Jo, Saehan Yoo, Jaemin Kang, U. Seoul Natl Univ Seoul South Korea

ISBN: (纸本)9781450355810

Given graphs with millions or billions of vertices and edges, how can we efficiently make inferences based on partial knowledge? Loopy Belief Propagation (LBP) is a graph inference algorithm widely used in various applications including social network analysis, malware detection, recommendation, and image restoration. the algorithm calculates approximate marginal probabilities of vertices in a graph within a linear running time proportional to the number of edges. However, when it comes to real-world graphs with millions or billions of vertices and edges, this cost overwhelms the computing power of a single machine. Moreover, this kind of large-scale graphs does not fit into the memory of a single machine. Although several distributed LBP methods have been proposed, previous works do not consider the properties of real-world graphs, especially the effect of power-law degree distribution on LBP. therefore, our work focuses on developing a fast and scalable LBP for such large real-world graphs on distributed environment. In this paper, we propose DLBP, a distributed Loopy Belief Propagation algorithm which efficiently computes LBP in a distributed manner across multiple machines. By setting the correct convergence criterion and carefully scheduling the computations, DLBP provides up to 10.7x speed up compared to standard distributed LBP. We show that DLBP demonstrates near-linear scalability with respect to the number of machines as well as the number of edges.

关键词： real-world graphs distributed graph processing loopy belief propagation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共276页 << < 83 84 85 86 87 88 89 90 91 92 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：