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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,951 篇 工学
- 1,911 篇 计算机科学与技术...
- 889 篇 软件工程
- 388 篇 信息与通信工程
- 292 篇 电气工程
- 139 篇 电子科学与技术（可...
- 102 篇 控制科学与工程
- 66 篇 网络空间安全
- 32 篇 动力工程及工程热...
- 25 篇 建筑学
- 24 篇 机械工程
- 21 篇 生物医学工程（可授...
- 20 篇 土木工程
- 16 篇 生物工程
- 15 篇 交通运输工程
- 15 篇 安全科学与工程
- 14 篇 环境科学与工程（可...
- 13 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 化学工程与技术
419 篇 理学
- 345 篇 数学
- 42 篇 统计学（可授理学、...
- 40 篇 系统科学
- 38 篇 物理学
- 21 篇 生物学
- 18 篇 化学
353 篇 管理学
- 304 篇 管理科学与工程(可...
- 126 篇 工商管理
- 74 篇 图书情报与档案管...
23 篇 经济学
- 22 篇 应用经济学
14 篇 法学
- 14 篇 社会学
8 篇 农学
7 篇 医学
5 篇 教育学
2 篇 文学
2 篇 军事学

主题

188 篇 parallel process...
155 篇 application soft...
137 篇 graphics process...
130 篇 parallel process...
122 篇 computer archite...
114 篇 hardware
110 篇 computational mo...
102 篇 distributed comp...
101 篇 concurrent compu...
94 篇 computer science
86 篇 runtime
86 篇 distributed comp...
84 篇 parallel program...
67 篇 scalability
65 篇 graphics process...
61 篇 libraries
61 篇 instruction sets
60 篇 resource managem...
56 篇 kernel
55 篇 bandwidth

机构

15 篇 oak ridge natl l...
12 篇 cent s univ sch ...
11 篇 argonne natl lab...
11 篇 univ tennessee k...
10 篇 guangzhou univ s...
10 篇 school of comput...
10 篇 univ manchester ...
10 篇 ohio state univ ...
8 篇 oak ridge natl l...
7 篇 univ chinese aca...
7 篇 hunan univ coll ...
6 篇 chinese acad sci...
6 篇 iit dept comp sc...
6 篇 oak ridge nation...
6 篇 hunan engn lab r...
6 篇 univ illinois de...
6 篇 department of co...
5 篇 univ sci & techn...
5 篇 georgia state un...
5 篇 georgia inst tec...

作者

16 篇 dongarra jack
13 篇 wang guojun
12 篇 sun xian-he
10 篇 cerin christophe
9 篇 schulz martin
9 篇 guo minyi
9 篇 agrawal gagan
9 篇 wolf felix
9 篇 robert yves
8 篇 matsuoka satoshi
8 篇 jin hai
7 篇 li kenli
7 篇 prasad sushil k.
7 篇 banicescu ioana
7 篇 antoniu gabriel
7 篇 kale laxmikant v...
7 篇 zhou xuehai
7 篇 labarta jesus
6 篇 li xi
6 篇 hoefler torsten

语言

2,572 篇 英文
1 篇 葡萄牙文
1 篇 其他

检索条件"任意字段=13th IEEE International Symposium on Parallel and Distributed Processing with Applications"

共 2574 条记录，以下是221-230 订阅

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

详细简洁

排序：

SenseLE: Exploiting Spatial Locality in Decentralized Sensing Environments 15

SenseLE: Exploiting Spatial Locality in Decentralized Sensin...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Bozdog, Nicolae Vladimir Makkes, Marc X. Uta, Alexandru Das, Roshan Bharath van Halteren, Aart Bal, Henri Vrije Univ Amsterdam Dept Comp Sci Amsterdam Netherlands

ISBN: (纸本)9781538637906

Generally, smart devices, such as smartphones, smartwatches, or fitness trackers, communicate with each other indirectly, via cloud data centers. Sharing sensor data with a cloud data center as intermediary invokes transmission methods with high battery costs, such as 4G LTE or WiFi. By sharing sensor information locally and without intermediaries, we can use other transmission methods with low energy cost, such as Bluetooth or BLE. In this paper, we introduce Sense Low Energy (SenseLE), a decentralized sensing framework which exploits the spatial locality of nearby sensors to save energy in Internet-of-things (IoT) environments. We demonstrate the usability of SenseLE by building a real-life application for estimating waiting times at queues. Furthermore, we evaluate the performance and resource utilization of our SenseLE Android implementation for different sensing scenarios. Our empirical evaluation shows that by exploiting spatial locality, SenseLE is able to reduce application response times (latency) by up to 74% and energy consumption by up to 56%.

关键词： Sensors Smart phones Cloud computing Bluetooth Monitoring Performance evaluation Time factors

来源：评论

学校读者我要写书评

暂无评论

Point-of-Interest Recommendations: Capturing the Geographical Influence from Local Trajectories 15

Point-of-Interest Recommendations: Capturing the Geographica...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Shi, Yangkai Jiang, Wenjun Hunan Univ Coll Comp Sci & Elect Engn Changsha Hunan Peoples R China

ISBN: (纸本)9781538637906

Location-based social networks (LBSNs) provides rich information for Point-of-Interest (POI) recommendation. Previous researches tend to capture the geographical influence from the distance between every pair of locations visited by the same user, neglecting two key facts: (1) users usually visit most locations in a small area (we call local activity area);(2) not all locations are equally important: some locations are being visited multiple times, while others not. In order to better capturing those facts, we present the concept of local exploration and local trajectories. Based on this, we further propose the local trajectory movement model (LTMM), which determines user's movement probability via the local trajectories. We also propose the local activity similarity (LAS) to compute the similarity between users. Finally, we propose a fusion POI recommendation framework to combine LTMM and LAS. We evaluate the performance using two real-world data sets. the experimental results show that our work produces better recommendation accuracy than the popular POI recommendation algorithms.

关键词： Location-based social networks POI recommendation geographical influence local trajectory

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical VDB Scheme with Scalable Verification and Tampered Record Localization 15

A Hierarchical VDB Scheme with Scalable Verification and Tam...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Zhang, Zhiwei Chen, Xiaofeng Li, Jin Ma, Jianfeng Xiang, Yang Xidian Univ State Key Lab Integrated Serv Networks ISN Xian Shaanxi Peoples R China Guangzhou Univ Sch Comp Sci Guangzhou Guangdong Peoples R China Swinburne Univ Technol Digital Res & Innovat Capabil Platform Hawthorn Vic Australia

ISBN: (纸本)9781538637906

the notion of verifiable database (VDB) plays an important role in secure outsourcing of data storage, which allows a client, typically a resource-limited one, to outsource a large-scale database to an untrusted server and make retrieval and update queries. For each query request, the server responds with a query result and a proof that is used to verify the result. Many VDB schemes have been proposed to provide the verification of outsourced databases, however, the existing VDB schemes are impracticable because of their inefficiency of initialization and query, unacceptable public key size and inability of tampered record localization scope. therefore, in this paper, we present a new VDB scheme based on the Vector Commitments Tree (VCT) which is a new extension of the traditional Vector Commitments (VC). Our VDB scheme is superior to exiting schemes in at least two aspects: one is that the efficiency of initialization and query is greatly improved, and the other is that hierarchical scalable verification and tampered record localization are realized.

关键词： Verifiable Databases Vector Commitments Tree Outsourced Storage Cloud Computing Tampered Record Localization

来源：评论

学校读者我要写书评

暂无评论

Who should be my co-author? Recommender System to Suggest a List of Collaborators 15

Who should be my co-author? Recommender System to Suggest a ...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Alinani, Karim Wang, Guojun Alinani, Annadil Narejo, Dua Hussain Guangzhou Univ Sch Comp Sci & Educ Software Guangzhou 510006 Guangdong Peoples R China Cent S Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China

ISBN: (纸本)9781538637906

Recommender systems have evolved for last few decades and now are an integral part of fairly every field available out there. On the contrary, many efforts need to put forward in the area of research as it is the backbone of any technological growth and uplift of modern society. Individual Researchers could have a high impact of their scientific research building a team of collaborators who bring up their skill set to enhance the quality of contribution. An individual could have an idea of different aspects but can't be an expert in every field. Hence a competent team up is required. To find a qualified contributor with the field knowledge and level of expertise is a quite a tedious task and needs a ton of precious time of the researcher to find the best match contributor for his research. this paper proposes a recommender system that generates a list of authors based on the correlation between researcher, authors with the similar field, taking into account their existing related publications to compute the skills required by a researcher for his next publication.

关键词： recommender system author correlation co-author relationship collaborator co-author

来源：评论

学校读者我要写书评

暂无评论

PCERE: Fine-grained parallel Benchmark Decomposition for Scalability Prediction 29

PCERE: Fine-grained Parallel Benchmark Decomposition for Sca...

引用

29th ieee international parallel and distributed processing symposium (IPDPS)

作者： Popov, Mihail Akel, Chadi Conti, Florent Jalby, William Castro, Pablo de Oliveira Univ Versailles St Quentin En Yveline Exascale Comp Res Versailles France

ISBN: (纸本)9781479986484

Evaluating the strong scalability of OpenMP applications is a costly and time-consuming process. It traditionally requires executing the whole application multiple times with different number of threads. We propose the parallel Codelet Extractor and REplayer (PCERE), a tool to reduce the cost of scalability evaluation. PCERE decomposes applications into small pieces called codelets: each codelet maps to an OpenMP parallel region and can be replayed as a standalone program. To accelerate scalability prediction, PCERE replays codelets while varying the number of threads. Prediction speedup comes from two key ideas. First, the number of invocations during replay can be significantly reduced. Invocations that have the same performance are grouped together and a single representative is replayed. Second, sequential parts of the programs do not need to be replayed for each different thread configuration. PCERE codelets can be captured once and replayed accurately on multiple architectures, enabling cross-architecture parallel performance prediction. We evaluate PCERE on a C version of the NAS 3.0 parallel Benchmarks (NPB). We achieve an average speed-up of 25 x on evaluating OpenMP applications scalability with an average error of 4.9% (median error of 1.7%).

关键词： OpenMP applications program replay checkpoint restart parallel code isolation scalability prediction cross-architecture performance prediction

来源：评论

学校读者我要写书评

暂无评论

A Multi-Authority Attribute-Based Encryption Scheme with Attribute Hierarchy 15

A Multi-Authority Attribute-Based Encryption Scheme with Att...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Qi, Fang Li, Ke Tang, Zhe Cent S Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China

ISBN: (纸本)9781538637906

the existing attribute based encryption with attribute hierarchy program has only one authority, which causes serious performance bottlenecks. In order to solve the problem in hierarchical attribute based encryption, we proposes a multi-authority hierarchical attribute based encryption scheme. the scheme removes the trusted central authority, and prevents the communication between authorities, thereby ensuring the users' privacy and improving the system performance. We require that all the attributes in the system construct the attribute trees, and any attribute is represented by the attribute trees and the attribute path, which ensure that the users and ciphertexts attributes quickly matching. A user must have satisfactory attributes in order to decrypt. Additionally, we propose a more reasonable way of dividing attribute trees by using hierarchical clustering algorithm. Finally, we give out the correctness analysis and performance comparison analysis of the scheme. It meets the security of IND-sAtr-CPA based on the DBDH assumption in the standard model.

关键词： Multi-authority Attribute-Based Encryption Attribute Hierarchy Attribute-path

来源：评论

学校读者我要写书评

暂无评论

LBFM: Multi-dimensional Membership Index for Block-level Data Skipping 15

LBFM: Multi-dimensional Membership Index for Block-level Dat...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Wang, Yong Yun, Xiaochun Wang, Xi Wang, Shupeng Wu, Yongshang Chinese Acad Sci Inst Informat Engn Beijing Peoples R China CNCERT CC Beijing Peoples R China Nanjing Univ Sch Software Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781538637906

Data skipping has been a promising technique to reduce data access in query engines. By maintaining metadata for each block of tuples, a query may skip a block if the metadata indicates that the block does not contain relevant data. Obviously, the key factor is how to build effective metadata by extracting representative features of blocks. In this paper, we propose a multi-dimensional index, Layered Bloom Filter Matrix (LBFM), which adopts a recursively layered framework, and represents the matrix as an ordered hierarchy of hashmap and bitmap to compress space consumption instead of space-consuming bit matrix. Additionally, LBFM supports dimension combination cutting, and optimal indexing strategy could be generated according to it, thus the space efficiency could be further improved. We demonstrate time complexity of LBFM, and theoretically prove that LBFM has lower space consumption than Bloom Filter Matrix algorithm. We proto-typed our index technique on Spark SQL. Our experiments on TPC-H and a real-world workload show that LBFM gains significant improvement in aspect of query response time over traditional methods.

关键词： data skipping membership index bloom filter bitmap

来源：评论

学校读者我要写书评

暂无评论

Quiet neighborhoods: Key to Protect Job Performance Predictability 29

Quiet neighborhoods: Key to Protect Job Performance Predicta...

引用

29th ieee international parallel and distributed processing symposium (IPDPS)

作者： Jokanovic, Ana Carlos Sancho, Jose Labarta, Jesus Rodriguez, German Minkenberg, Cyriel Lucero, Alejandro Barcelona Supercomp Ctr Barcelona Spain IBM Res Zurich Zurich Switzerland Netronome Cambridge England

ISBN: (纸本)9781479986484

Interference of nearby jobs has been recently identified as the dominant reason for the high performance variability of parallel applications running on High Performance Computing (HPC) systems. Typically, HPC systems are dynamic with multiple jobs coming and leaving in an unpredictable fashion, sharing simultaneously the system interconnection network. In such environment contention for network resources is causing random stalls in the progress of application execution degrading application and system performance overall. Eliminating job interactions in their neighborhoods is key for guaranteeing performance predictability of applications. In this paper we are proposing the concept of quiet neighborhoods that significantly reduce job interactions. Quiet neighborhoods are created by the system resource manager in two phases. First, multiple virtual network blocks are defined on the top of the physical network resources based on typical workload distributions. Second, newly arriving jobs are allocated in these virtual blocks based on their size.

关键词： Performance predictability Performance reproducibility applications' interference Network contention Resource management Virtual network topologies Infiniband

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Resource Management and Task Scheduling for IoT Services in Edge Computing Paradigm 15

Energy Efficient Resource Management and Task Scheduling for...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Li, Songyuan Huang, Jiwei Beijing Univ Posts & Telecommun Sch Comp Sci Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

ISBN: (纸本)9781538637906

With the growing popularity of the Internet of things (IoT), energy efficiency has been a critical concern during the design and development of IoT service systems. Meanwhile, edge computing has drawn significant attention as a burgeoning computing paradigm. this paper studies the energy efficiency issue of IoT systems by proposing a joint scheme of resource allocation and task scheduling under the edge computing paradigm. Specifically, dynamic processes of the IoT services and system are formulated by generalized queueing network models, based on which quantitative analyses of performance and energy consumption are conducted. the resource management and task scheduling are formulated by Markov Decision Process (MDP), which can balance the tradeoff between energy costs and QoS requirements. To attack the challenge of MDP search space explosion due to the large scale of IoT systems, Ordinal Optimization (OO) techniques are applied to the MDP algorithms, which are able to significantly narrow the search of MDP by slightly softening the optimization objective to a good enough subset. Finally, we conduct simulation experiments based on real-world IoT data. Evaluations and comparisons demonstrate that our approach is effective and efficient in practice.

关键词： Internet of things (IoT) resource management task scheduling energy efficiency Markov Decision Process Ordinal Optimization

来源：评论

学校读者我要写书评

暂无评论

A Fog-based Hierarchical Trust Mechanism for Sensor-Cloud Underlying Structure 15

A Fog-based Hierarchical Trust Mechanism for Sensor-Cloud Un...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Zhang, Guangxue Wang, Tian Bhuiyan, Md Zakirul Alam Wang, Guojun Huaqiao Univ Coll Comp Sci & Technol Xiamen Peoples R China Fordham Univ Dept Comp & Informat Sci New York NY 10023 USA Guangzhou Univ Sch Comp Sci & Educ Software Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781538637906

In recent years, Sensor-Cloud has become a hot issue. In this structure, there are some security problems that can be well solved by trust mechanism. However, there are some deficiencies in existing trust mechanism, especially for the Sensor-Cloud underlying structure. We propose a fog-based hierarchical trust mechanism for these deficiencies. this hierarchical structure is not only easy to establish and implement, but also moves heavy and fine-grained data analysis tasks to the fog layer. the experimental results indicate that this fog-based hierarchical structure can deal well in saving network energy, guaranteeing a fast malicious node detect speed, detecting hidden data attacks and recovering misjudgment nodes in an allowable delay range.

关键词： Sensor-Cloud fog-based trust mechanism hidden data attacks misjudgment nodes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：