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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,712 篇 会议
29 册 图书
24 篇 期刊文献

馆藏范围

1,765 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,296 篇 工学
- 1,195 篇 计算机科学与技术...
- 535 篇 软件工程
- 235 篇 电气工程
- 203 篇 信息与通信工程
- 72 篇 控制科学与工程
- 45 篇 电子科学与技术（可...
- 31 篇 机械工程
- 31 篇 生物工程
- 19 篇 动力工程及工程热...
- 17 篇 力学（可授工学、理...
- 16 篇 网络空间安全
- 14 篇 仪器科学与技术
- 13 篇 化学工程与技术
- 13 篇 石油与天然气工程
- 12 篇 建筑学
- 12 篇 生物医学工程（可授...
- 11 篇 土木工程
- 10 篇 材料科学与工程（可...
- 10 篇 交通运输工程
243 篇 理学
- 172 篇 数学
- 33 篇 生物学
- 33 篇 系统科学
- 31 篇 物理学
- 20 篇 化学
- 19 篇 统计学（可授理学、...
164 篇 管理学
- 116 篇 管理科学与工程(可...
- 58 篇 图书情报与档案管...
- 49 篇 工商管理
65 篇 医学
- 60 篇 临床医学
18 篇 经济学
- 18 篇 应用经济学
11 篇 法学
5 篇 教育学
4 篇 农学
3 篇 文学
1 篇 军事学

主题

154 篇 distributed comp...
84 篇 distributed comp...
77 篇 parallel process...
67 篇 cloud computing
51 篇 artificial intel...
50 篇 computational mo...
46 篇 computer archite...
46 篇 software enginee...
46 篇 distributed data...
44 篇 parallel program...
38 篇 parallel computi...
35 篇 application soft...
32 篇 big data
31 篇 parallel algorit...
31 篇 optimization
31 篇 intelligent netw...
31 篇 protocols
30 篇 concurrent compu...
30 篇 fault tolerance
29 篇 resource managem...

机构

7 篇 chinese acad sci...
6 篇 univ adelaide sc...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 univ stuttgart i...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 institute of com...
4 篇 national laborat...
3 篇 huazhong univ sc...
3 篇 univ sydney sch ...
3 篇 univ chinese aca...
3 篇 reutlingen univ ...
3 篇 centre for distr...
3 篇 chinese acad sci...
3 篇 lomonosov moscow...
3 篇 huazhong univ sc...
3 篇 university of el...

作者

14 篇 zomaya albert y.
11 篇 rothermel kurt
10 篇 shen hong
7 篇 jack dongarra
6 篇 li y
6 篇 albert y. zomaya
6 篇 roman wyrzykowsk...
5 篇 fahringer thomas
5 篇 duerr frank
5 篇 jerzy waśniewski
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 nakayama shigeru
5 篇 konrad karczewsk...
5 篇 huang z.
5 篇 lee young choon
4 篇 leung k.
4 篇 yang yang
4 篇 prodan radu

语言

1,727 篇 英文
30 篇 俄文
4 篇 其他
3 篇 中文
1 篇 乌克兰文

检索条件"任意字段=10th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1765 条记录，以下是431-440 订阅

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

详细简洁

排序：

parallel implementation of local similarity search for unstructured text using prefix filtering 18

Parallel implementation of local similarity search for unstr...

引用

18th international conference on parallel and distributed computing, applications and technologies, PDCAT 2017

作者： Agrawal, Manu Manchanda, Kartik Soni, Ribhav Lal, Anurag Chowdary, Ravindranath Varanasi221005 India

ISBN: (纸本)9781538631515

Identifying partially duplicated text segments among documents is an important research problem with applications in plagiarism detection and near-duplicate web page detection. We investigate the problem of local similarity search for finding partially replicated text, focusing on its parallel implementation. Our aim is to find text windows that are approximately similar in two documents, using a filter verification framework. We present various parallel approaches to the problem, of which input data partitioning along with the reduction of individual index maps was found to be most suitable. We analyzed the effect of varying similarity threshold and number of processes on speedup, and also performed cost analysis. Experimental results show that the proposed method achieves up to 13x speedup on a 24-core processor. © 2017 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

A Privacy-Aware Conceptual Framework for Coordination 15

A Privacy-Aware Conceptual Framework for Coordination

引用

15th IEEE international Symposium on parallel and distributed Processing with applications (ISPA) / 16th IEEE international conference on Ubiquitous computing and Communications (IUCC)

作者： Elahi, Haroon Wang, Guojun Zhang, Wei Guangzhou Univ Sch Comp Sci & Educ Software Guangzhou 510006 Guangdong Peoples R China

ISBN: (纸本)9781538637906

Enterprise architects and information system designers need to understand and manage workflows, data flows, and social interactions to design tools and systems for well-coordinated organizational operations. However, the organizational-nature has drastically transformed over the recent years due to wide-scale use of new computing technologies. Disintegrated structures, large quantities of frequently-generated data, and dubious system and interaction boundaries are some of the obvious identifiers of a modern enterprise, where poorly designed coordination can lead to serious privacy risks. Old coordination modeling frameworks do not set well for the new organizational settings, and a need for alternative models and frameworks has been felt. In this paper, we propose a privacy-aware conceptual framework for understanding coordination by identifying and mapping work, data, and interaction patterns in organizational environments. these propositions intend to help practitioners in developing an updated understanding of the coordination that serves privacy needs, as well.

关键词： Coordination Computer Supported Cooperative Work Information System Design Privacy distributed Environments

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised distributed Clustering for Bioinformatics - Comparison Study 10

Semi-supervised Distributed Clustering for Bioinformatics - ...

引用

10th international Joint conference on Biomedical Engineering Systems and technologies (BIOSTEC)

作者： Li, Huayiing Jeremic, Aleksandar McMaster Univ Dept Elect & Comp Engn Hamilton ON Canada

ISBN: (纸本)9789897582127

Clustering analysis is a widely used technique in bioinformatics and biochemistry for variety of applications such as detection of new cell types, evaluation of drug response, etc. Since different applications and cells may require different clustering algorithms combining multiple clustering results into a consensus clustering using distributed clustering is a popular and efficient method to improve the quality of clustering analysis. Currently existing solutions are commonly based on supervised techniques which do not require any a priori knowledge. However in certain cases, a priori information on particular labelings may be available a priori. In these cases it is expected that performance improvement can be achieved by utilizing this prior information. To this purpose in this paper, we propose two semi-supervised distributed clustering algorithms and evaluate their performance for different base clusterings.

关键词： Information Fusion Bioinformatics distributed Clustering

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of dynamic programming problems using wavefront and rank convergence with full resource utilization 18

Parallel implementation of dynamic programming problems usin...

引用

18th international conference on parallel and distributed computing, applications and technologies, PDCAT 2017

作者： Sourabh, Vivek Pahariya, Parth Agarwal, Isha Gautam, Ankit Chowdary, C. Ravindranath Varanasi221005 India

ISBN: (纸本)9781538631515

In this paper, we propose a novel approach which uses full processor utilization to compute a particular class of dynamic programming problems parallelly. this class includes algorithms such as Longest Common Subsequence and Needleman-Wunsch. In a dynamic programming, a larger problem is divided into smaller problems which are then solved, and the results are used to compute the final result. Each subproblem can be considered as a stage. If computations made in a stage are independent of the computations made in other stages, then these stages can be calculated in parallel. the idling of processors bottlenecks the performance of the currently existing parallel algorithms. In this paper, we are using rank convergence for computation of each stage ensuring full processor utilization. this increases the efficiency and speedup of the parallel algorithm. © 2017 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

A Kernel Support Vector Machine Trained Using Approximate Global and Exhaustive Local Sampling 17

A Kernel Support Vector Machine Trained Using Approximate Gl...

引用

10th international conference on Utility and Cloud computing (UCC) / 4th international conference on Big Data computing, applications and technologies (BDCAT)

作者： Bryant, Benjamin Sari-Sarraf, Hamed Long, Rodney Antani, Sameer Texas Tech Univ Appl Vis Lab Lubbock TX 79409 USA Natl Lib Med Commun Engn Branch MSC 3824 Bethesda MD 20894 USA

ISBN: (纸本)9781450355490

AGEL-SVM is an extension to a kernel Support Vector Machine (SVM) and is designed for distributed computing using Approximate Global Exhaustive Local sampling (AGEL)-SVM. the dual form of SVM is typically solved using sequential minimal optimization (SMO) which iterates very fast if the full kernel matrix can fit in a computer's memory. AGEL-SVM aims to partition the feature space into sub problems such that the kernel matrix per problem can fit in memory by approximating the data outside each partition. AGEL-SVM has similar Cohen's Kappa and accuracy metrics as the underlying SMO implementation. AGEL-SVM's training times greatly decreased when running on a 128 worker MATLAB pool on Amazon's EC2. Predictor evaluation times are also faster due to a reduction in support vectors per partition.

关键词： AGEL AGEL-SVM SVM Kernel distributed MATLAB EC2 AMAZON

来源：评论

学校读者我要写书评

暂无评论

An Efficient Hardware Prefetcher Exploiting the Prefetch Potential of Long-Stride Access Pattern on Virtual Address 15

An Efficient Hardware Prefetcher Exploiting the Prefetch Pot...

引用

15th IEEE international Symposium on parallel and distributed Processing with applications (ISPA) / 16th IEEE international conference on Ubiquitous computing and Communications (IUCC)

作者： Tian, Teng Wang, Tianqi Jin, Xi Univ Sci & Technol China Chinese Acad Sci Sch Phys Sci Key Lab Strongly Coupled Quantum Matter Phys Hefei Anhui Peoples R China

ISBN: (纸本)9781538637906

Large scale computing and applications with large data sets often cause high cache miss rate because of using array of structures or linked-list data structure. When traversing these data structures, the memory accesses may have constant long strides across pages on virtual address (VA), but mostly scatter over the physical address (PA). therefore, conventional stride prefetcher (SP) based on PA cannot prefetch data efficiently here. In this paper, we propose a hardware data prefetching design named Virtual Address-based Stride Prefetcher (VASP) to exploit the prefetch potential of long-stride access pattern on VA. VASP detects the access strides on VA including those cross pages, then it predicts a new VA and prefetches data after address translation. We implement VASP in the gem5 simulator and use SPEC CPU2006 integer benchmarks to evaluate its performance. Our simulation results show that, compared with SP, applying VASP to caches offers up to 43% performance improvement in the mcf benchmark, and improves the overall performance by 6%.

关键词： prefetcher virtual address performance

来源：评论

学校读者我要写书评

暂无评论

distributed Anomaly Detection Algorithm for Spatio-Temporal Trajectories of Vehicles 15

Distributed Anomaly Detection Algorithm for Spatio-Temporal ...

引用

15th IEEE international Symposium on parallel and distributed Processing with applications (ISPA) / 16th IEEE international conference on Ubiquitous computing and Communications (IUCC)

作者： Lu, Liping Cheng, Hao Xiong, Shengwu Duan, Pengfei Xiao, Yuan Wuhan Univ Technol Sch Comp Sci & Technol Wuhan 430070 Hubei Peoples R China Wuhan Univ Technol Hubei Key Lab Transportat Internet Things Wuhan 430070 Hubei Peoples R China

ISBN: (纸本)9781538637906

With extensive use of Internet of Vehicle (IoV) technologies in vehicle traffic management, real-time analysis of vehicle behavior trajectories is of great significance to the assessment of traffic conditions and the avoidance of abnormal conditions. this paper presents a solution which can efficiently deal with real-time streaming data of trajectory and excavate temporal and spatial abnormal information. In order to represent the local feature information of the trajectory and solve the problem of large loss of information in the feature point extraction algorithm, a trajectory partitioning strategy based on multi-motion feature and a similarity measure method based on trajectory structure are proposed. And based on the proposed strategy and method, a distributed clustering algorithm is designed for streaming trajectories to improve the efficiency of clustering algorithm. In order to solve the problem of massive calculation of distance and neighborhood density in trajectory anomaly detection algorithm, the data set is pruned by track clustering results, and the efficiency of the algorithm increases the real-time performance of abnormal trajectory detection.

关键词： spatio-temporal trajectory division trajectory similarity measure distributed trajectory clustering

来源：评论

学校读者我要写书评

暂无评论

Dynamic Load Balancing and Channel Strategy for Apache Flume Collecting Real-time Data Stream 15

Dynamic Load Balancing and Channel Strategy for Apache Flume...

引用

15th IEEE international Symposium on parallel and distributed Processing with applications (ISPA) / 16th IEEE international conference on Ubiquitous computing and Communications (IUCC)

作者： Shu, Buqing Chen, Haopeng Sun, Meng Shanghai Jiao Tong Univ Sch Software Shanghai Peoples R China

ISBN: (纸本)9781538637906

With the development of information technology, real-time data stream processing(RTDSP) has become a popular research topic. the first step of RTDSP is collecting data, requiring a data collector to receive data from the source and send them to the sink. Apache Flume, a distributed and reliable framework, used for this purpose, has some limitations and drawbacks on load balancing and storage. In this paper, we aim to improve performance and availability for collecting unstable real-time big data stream. So we propose a new load balancing strategy based on the free memory size and a storage strategy of integration memory channel with the multi-file channel to reduce the overhead of disk and network. Finally, the experimental results show that the availability and performance are improved under the condition of a poor network, high availability requirements, intense competition in memory resources and large data size. Specifically, the availability is higher than 99.999%, and the performance can be improved by 10%-50% under different conditions.

关键词： Load management Real-time systems distributed databases throughput Monitoring Dynamic scheduling Memory management

来源：评论

学校读者我要写书评

暂无评论

A Study on the Minimum Dominating Set Problem Approximation in parallel 10

A Study on the Minimum Dominating Set Problem Approximation ...

引用

10th international conference on Contemporary computing (IC3)

作者： Gambhir, Mahak Kothapalli, Kishore Int Inst Informat Technol Hyderabad 500032 Andhra Pradesh India

ISBN: (纸本)9781538630778

A dominating set of a small size is useful in several settings including wireless networks, document summarization, secure system design, and the like. In this paper, we start by studying three distributed algorithms that produce a small sized dominating sets in a few rounds. We interpret these algorithms in the natural shared memory setting and experiment with these algorithms on a multi-core CPU. Based on the observations from these experimental results, we propose variations to the three algorithms and also show how the proposed variations offer interesting trade-offs with respect to the size of the dominating set produced and the time taken.

关键词： Dominating set parallel algorithms Multicore CPU algorithms

来源：评论

学校读者我要写书评

暂无评论

A Service-reliability-based Resource Mapping Method in Smart Grid Virtual Networks 15

A Service-reliability-based Resource Mapping Method in Smart...

引用

15th IEEE international Symposium on parallel and distributed Processing with applications (ISPA) / 16th IEEE international conference on Ubiquitous computing and Communications (IUCC)

作者： Sun, Li-Qian Chen, Xing-Yu Feng, Qi Guo, Shao-Yong Xu, Si-Ya Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China

ISBN: (纸本)9781538637906

In order to guarantee the reliability of services and reduce the waste of resources in traditional dual-path protection method, a service-reliability-based resources mapping method is proposed in this paper. the virtualization technology is adopted in our method for smart grid Fiber-Wireless access networks. Firstly, a priority-and fault-probability based primary link mapping model is set up. It classifies the service priorities level and provides high-priority services with high-reliability links to improve service reliability of the whole network. then, a resource-saving aimed backup link mapping model is established to allocate the multiple services as many as possible for one backup link to save resources. At last, the genetic algorithm is used to solve the mapping model. the evaluation results show that our proposed method increases service reliability, and improves resource utilization.

关键词： SDN communication networks resource mapping failure probability resource saving ubiquitous network

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 40 41 42 43 44 45 46 47 48 49 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：