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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,918 篇 会议
230 篇 期刊文献
173 册 图书
3 篇 学位论文

馆藏范围

11,324 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

6,681 篇 工学
- 6,110 篇 计算机科学与技术...
- 2,915 篇 软件工程
- 1,181 篇 电气工程
- 1,069 篇 信息与通信工程
- 482 篇 电子科学与技术（可...
- 358 篇 控制科学与工程
- 176 篇 仪器科学与技术
- 152 篇 机械工程
- 117 篇 动力工程及工程热...
- 113 篇 生物医学工程（可授...
- 101 篇 生物工程
- 87 篇 光学工程
- 87 篇 建筑学
- 69 篇 土木工程
- 68 篇 网络空间安全
- 65 篇 化学工程与技术
- 63 篇 材料科学与工程（可...
- 58 篇 安全科学与工程
1,468 篇 理学
- 976 篇 数学
- 311 篇 物理学
- 156 篇 系统科学
- 140 篇 统计学（可授理学、...
- 136 篇 生物学
- 83 篇 化学
898 篇 管理学
- 648 篇 管理科学与工程(可...
- 307 篇 图书情报与档案管...
- 290 篇 工商管理
145 篇 医学
- 120 篇 临床医学
- 62 篇 基础医学(可授医学...
62 篇 经济学
- 62 篇 应用经济学
56 篇 法学
34 篇 农学
26 篇 教育学
18 篇 文学
11 篇 军事学

主题

1,464 篇 parallel process...
584 篇 computer archite...
555 篇 distributed comp...
534 篇 application soft...
531 篇 computational mo...
528 篇 concurrent compu...
342 篇 hardware
319 篇 graphics process...
309 篇 scalability
308 篇 parallel program...
306 篇 graphics process...
304 篇 computer science
285 篇 runtime
263 篇 big data
262 篇 optimization
250 篇 parallel process...
226 篇 throughput
225 篇 processor schedu...
214 篇 resource managem...
209 篇 bandwidth

机构

31 篇 national laborat...
23 篇 science and tech...
21 篇 department of co...
19 篇 national laborat...
18 篇 university of ch...
17 篇 school of comput...
17 篇 institute of com...
16 篇 school of comput...
15 篇 college of compu...
15 篇 georgia inst tec...
15 篇 barcelona superc...
15 篇 intel corporatio...
14 篇 school of comput...
14 篇 chinese acad sci...
14 篇 department of co...
13 篇 tsinghua univ de...
13 篇 ibm thomas j. wa...
13 篇 cent s univ sch ...
13 篇 college of compu...
13 篇 ohio state univ ...

作者

21 篇 jack dongarra
16 篇 badia rosa m.
16 篇 liu jie
15 篇 wang guojun
15 篇 yijie wang
15 篇 a. choudhary
14 篇 anon
14 篇 kurt rothermel
13 篇 jun wang
13 篇 koldehofe boris
13 篇 mencagli gabriel...
13 篇 prodan radu
13 篇 wang yijie
12 篇 fahringer thomas
12 篇 dongsheng li
12 篇 zomaya albert y.
12 篇 navaux philippe ...
12 篇 yong dou
11 篇 fernandes luiz g...
11 篇 guangwen yang

语言

11,155 篇 英文
135 篇 其他
36 篇 中文
2 篇 俄文
2 篇 土耳其文
1 篇 德文

检索条件"任意字段=International Conference on Parallel and Distributed Processing Techniques and Applications"

共 11324 条记录，以下是1501-1510 订阅

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

详细简洁

排序：

Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach 48th

Efficient Label-Constrained Shortest Path Queries on Road Ne...

引用

48th international conference on Very Large Data Bases, VLDB 2022

作者： Zhang, Unhua Yuan, Long Li, Wentao Qin, Lu Zhang, Ying Nanjing University of Science and Technology China University of Technology Sydney Australia

Computing the shortest path between two vertices is a fundamental problem in road networks. Most of the existing works assume that the edges in the road networks have no labels, but in many real applications, the edges have labels and label constraints may be placed on the edges appearing on a valid shortest path. Hence, we study the label-constrained shortest path queries in this paper. In order to process such queries efficiently, we adopt an index-based approach and propose a novel index structure, LSD-Index, based on tree decomposition. With LSD-Index, we design an efficient query processing algorithm with good performance guarantees. Moreover, we also propose an algorithm to construct LSD-Index and further improve the efficiency of index construction by exploiting the parallel computing techniques. We conduct extensive performance studies using large real road networks including the whole USA road network. Compared with the state-of-the-art approach, the experimental results demonstrate that our algorithm not only achieves up to 2 orders of magnitude speedup in query processing time but also consumes much less index space. Meanwhile, the indexing time is also competitive, especially that for the parallel index construction algorithm. © 2021, VLDB Endowment. All rights reserved.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

distributed-Memory Sparse Kernels for Machine Learning

Distributed-Memory Sparse Kernels for Machine Learning

引用

international Symposium on parallel and distributed processing (IPDPS)

作者： Vivek Bharadwaj Aydı n Buluç James Demmel EECS Department University of California Berkeley USA Computational Research Division Lawrence Berkeley National Laboratory Berkeley USA

ISBN: (数字)9781665481069

ISBN: (纸本)9781665481076

Sampled Dense Times Dense Matrix Multiplication (SDDMM) and Sparse Times Dense Matrix Multiplication (SpMM) appear in diverse settings, such as collaborative filtering, document clustering, and graph embedding. Frequently, the SDDMM output becomes the input sparse matrix for a sub-sequent SpMM operation. Existing work has focused on shared memory parallelization of these primitives. While there has been extensive analysis of communication-minimizing distributed 1.5D algorithms for SpMM, no such analysis exists for SDDMM or the back-to-back sequence of SDDMM and SpMM, termed FusedMM. We show that distributed memory 1.5D and 2.5D algorithms for SpMM can be converted to algorithms for SD-DMM with identical communication costs and input / output data layouts. Further, we give two communication-eliding strategies to reduce costs further for FusedMM kernels: either reusing the replication of an input dense matrix for the SDDMM and SpMM in sequence, or fusing the local SDDMM and SpMM kernels. We benchmark FusedMM algorithms on Cori, a Cray XC40 at LBNL, using Erdos-Renyi random matrices and large real-world sparse matrices. On 256 nodes with 68 cores each, 1.5D FusedMM algorithms using either communication eliding approach can save at least 30% of time spent exclusively in communication compared to executing a distributed-memory SpMM and SDDMM kernel in sequence. Our 2.5D communication-eliding algorithms save 21 % of communication time compared to the unoptimized sequence. On real-world matrices with hundreds of millions of edges, all of our algorithms exhibit at least a 10x speedup over the SpMM algorithm in PETSc. On these matrices, our communication-eliding techniques exhibit runtimes up to 1.6 times faster than an unoptimized sequence of SDDMM and SpMM. We embed and test the scaling of our algorithms in real-world applications, including collaborative filtering via alternating-least-squares and inference for attention-based graph neural networks.

关键词： Machine learning algorithms Costs Runtime Collaborative filtering Layout Machine learning Inference algorithms

来源：评论

学校读者我要写书评

暂无评论

A Fully Decentralized Autoscaling Algorithm for Stream processing applications 25th

A Fully Decentralized Autoscaling Algorithm for Stream Proce...

引用

25th international conference on parallel and distributed Computing (Euro-Par)

作者： Belkhiria, Mehdi Mokhtar Tedeschi, Cedric Univ Rennes IRISA CNRS Inria Rennes France

ISBN: (纸本)9783030483401;9783030483395

Stream processing deals with the efficient, real-time processing of continuous streams of data. Stream processing engines ease the development and deployment of such applications which are commonly pipelines of operators to be traversed by each data item. Due to the varying velocity of the streams, autoscaling is needed to dynamically adapt the number of instances of each operator. With the advent of geographically-dispersed computing platforms such as Fog platforms, operators are dispersed accordingly, and autoscaling needs to be decentralized as well. In this paper, we propose an algorithm allowing for scaling decisions to be taken and enforced in a fully-decentralized way. In particular, in spite of scaling actions being triggered concurrently, each operator maintains a view of its neighbours in the graph so as no data message is lost. The protocol is detailed and its correctness discussed. Its performance is captured through early simulation experiments.

关键词： Stream processing Decentralized Management Autoscaling

来源：评论

学校读者我要写书评

暂无评论

The design of a mechanical force feedback VR data glove

The design of a mechanical force feedback VR data glove

引用

IEEE international Symposium on parallel and distributed processing with applications and IEEE international conference on Ubiquitous Computing and Communications (ISPA/IUCC)

作者： Jiliang Lin Bin Hu Jiahao Pang Jingjie Liao School of international education Xiamen University of technology Xiamen China School of Arts Soochow University Suzhou China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Wuzhou China school of big data and software engineering Wuzhou University Wuzhou China

With the development of virtual reality technology, data gloves began to widely popularize various fields. Some of the force feedback data gloves at this stage still have problems such as high cost and complex structure. The mechanical force feedback data glove proposed in this paper uses the principle of mechanical rotation, using a potentiometer as the rotating shaft and a nylon rope to drive the potentiometer to rotate, so that it records the relevant data instead of sensors, and uses a servo to bring force feedback experience. Experiments indicate that the force feedback glove in this paper has both the force feedback effect of the existing force feedback data gloves and is lower in cost than the existing data gloves and has good generalizability.

关键词： Shafts Mechanical sensors Costs Force feedback Virtual reality Data gloves Potentiometers

来源：评论

学校读者我要写书评

暂无评论

Development and Operation of Elastic parallel Tree Search applications Using TASKWORK 1

引用

9th international conference on Cloud Computing and Services Science (CLOSER)

作者： Kehrer, Stefan Blochinger, Wolfgang Reutlingen Univ Parallel & Distributed Comp Grp Alteburgstr 150 D-72762 Reutlingen Germany

ISBN: (数字)9783030494322

ISBN: (纸本)9783030494315;9783030494322

Cloud resources can be dynamically provisioned according to application-specific requirements and are payed on a per-use basis. This gives rise to a new concept for parallel processing: Elastic parallel computations. However, it is still an open research question to which extent parallel applications can benefit from elastic scaling, which requires resource adaptation at runtime and corresponding coordination mechanisms. In this work, we analyze how to address these system-level challenges in the context of developing and operating elastic parallel tree search applications. Based on our findings, we discuss the design and implementation of TASKWORK, a cloud-aware runtime system specifically designed for elastic parallel tree search, which enables the implementation of elastic applications by means of higher-level development frameworks. We show how to implement an elastic parallel branch-and-bound application based on an exemplary development framework and report on our experimental evaluation that also considers several benchmarks for parallel tree search.

关键词： Cloud computing parallel computing Task parallelism Elasticity Branch-and-bound

来源：评论

学校读者我要写书评

暂无评论

Engineering for efficient hardware utilization 27

Engineering for efficient hardware utilization

引用

27th international conference on Principles and Practice of Constraint Programming, CP 2021

作者： Fichte, Johannes K. Hecher, Markus Roland, Valentin TU Dresden Germany TU Wien Austria Universität Potsdam Germany

ISBN: (纸本)9783959772112

Propositional model counting (MC) and its extensions as well as applications in the area of probabilistic reasoning have received renewed attention in recent years. As a result, also the need for quickly solving counting-based problems with automated solvers is critical for certain areas. In this paper, we present experiments evaluating various techniques in order to improve the performance of parallel model counting on general purpose graphics processing units (GPGPUs). Thereby, we mainly consider engineering efficient algorithms for model counting on GPGPUs that utilize the treewidth of a propositional formula by means of dynamic programming. The combination of our techniques results in the solver GPUSAT3, which is based on the programming framework Cuda that "compared to other frameworks"shows superior extensibility and driver support. When combining all findings of this work, we show that GPUSAT3 not only solves more instances of the recent Model Counting Competition 2020 (MCC 2020) than existing GPGPU-based systems, but also solves those significantly faster. A portfolio with one of the best solvers of MCC 2020 and GPUSAT3 solves 19% more instances than the former alone in less than half of the runtime. © Johannes K. Fichte, Markus Hecher, and Valentin Roland.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A distributed Business-Aware Storage Execution Environment Towards Large-Scale applications 20th

A Distributed Business-Aware Storage Execution Environment T...

引用

20th international conference on Algorithms and Architectures for parallel processing (ICA3PP)

作者： Jiang, Feng Cheng, Yongyang Dong, Changkun Hui, Zhao Yan, Ruibo China Telecom Cloud Comp Corp Beijing Peoples R China Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China

ISBN: (纸本)9783030602390;9783030602383

The rapid development of distributed storage technology has attracted growing attention from both industry and academia. Although distributed system has been studied for many years, however, it is widely applied to engineering practice since the rise of cloud computing recently. Cloud storage constructs a storage resource pool with massive common storage devices through networks, which could be allocated to authorized users on demand. In this paper, we present a distributed business-aware storage execution environment towards large-scale applications. Initially, we present the overall of our proposed storage execution environment and different data delivery models according to corresponding business needs. Furthermore, we design a globally shared and cross-regional deployed metadata service to minimize the access delay of metadata. Finally, the approach presented in this paper has been validated to be effective through a series of evaluation experiments and actual use cases.

关键词： Cloud computing Object-oriented storage distributed system Large scale applications High-performance architecture

来源：评论

学校读者我要写书评

暂无评论

A CVAE-GAN-based Approach to Process Imbalanced Datasets for Intrusion Detection in Marine Meteorological Sensor Networks

A CVAE-GAN-based Approach to Process Imbalanced Datasets for...

引用

IEEE international conference on Big Data and Cloud Computing (BdCloud)

作者： Xin Su Tian Tian Lei Cai Baoliu Ye Hongyan Xing College of IOT Engineering Hohai University Changzhou Jiangsu China Information Department Hohai University Nanjing Jiangsu China Collaborative Innovation Center for Meteorological Disaster Prediction and Evaluation Nanjing University of Information Science and Technology Nanjing Jiangsu China Jiangsu Key Laboratory of Meteorological Detection and Information Processing Nanjing University of Information Science and Technology Nanjing Jiangsu China

In marine meteorological sensor networks (MMSN), there are massive data flows transmitted within numerous nodes, resulting in serious potential consequences once any anomalous traffic implied launches an attack. Therefore, accurate identification and fast response to abnormal traffic is vital for intrusion detection system (IDS) constructions. Dataset imbalances cause classification models to erroneously bias to normal traffic, significantly restricting IDS developments and applications. This paper proposes an approach to deal with dataset imbalances in intrusion detections. This approach mitigates dataset imbalance impacts on IDSs from the data perspective, which is liable to process the input data in classification models. In this approach, CVAE-GAN is adopted as the data generation module to synthesize specified minority class samples, thus reducing dataset imbalance rate. ordering points to identify the clustering structure (OPTICS) is taken as the denoising algorithm to remove outliers and decrease the overlap extent between majority classes. An experiment on NSL-KDD dataset demonstrates that the proposed method obtains a high-quality dataset with reasonable distribution. This approach improves the classifier's identification ability for potential anomalous traffic.

关键词： Training Measurement Noise reduction Intrusion detection Clustering algorithms Optics Data models

来源：评论

学校读者我要写书评

暂无评论

parallel Semantic Trajectory Similarity Join 36

Parallel Semantic Trajectory Similarity Join

引用

IEEE 36th international conference on Data Engineering (ICDE)

作者： Chen, Lisi Shang, Shuo Jensen, Christian S. Yao, Bin Kalnis, Panos UESTC Chengdu Peoples R China Aalborg Univ Aalborg Denmark Shanghai Jiao Tong Univ Shanghai Peoples R China KAUST Thuwal Saudi Arabia

ISBN: (纸本)9781728129037

Matching similar pairs of trajectories, called trajectory similarity join, is a fundamental functionality in spatial data management. We consider the problem of semantic trajectory similarity join (STS-Join). Each semantic trajectory is a sequence of Points-of-interest (POIs) with both location and text information. Thus, given two sets of semantic trajectories and a threshold 6, the STS-Join returns all pairs of semantic trajectories from the two sets with spatio-textual similarity no less than theta. This join targets applications such as term-based trajectory near-duplicate detection, geo-text data cleaning, personalized ridesharing recommendation, keyword-aware route planning, and travel itinerary recommendation. With these applications in mind, we provide a purposeful definition of spatio-textual similarity. To enable efficient STS-Join processing on large sets of semantic trajectories, we develop trajectory pair filtering techniques and consider the parallel processing capabilities of modern processors. Specifically, we present a two-phase parallel search algorithm. We first group semantic trajectories based on their text information. The algorithm's pergroup searches are independent. of each other and thus can be performed in parallel. For each group, the trajectories are further partitioned based on the spatial domain. We generate spatial and textual summaries for each trajectory hatch, based on which we develop hatch filtering and trajectory-hatch filtering techniques to prune unqualified trajectory pairs in a batch mode. Additionally, we propose an efficient divide-and-conquer algorithm to derive bounds of spatial similarity and textual similarity between two semantic trajectories, which enable us prune dissimilar trajectory pairs without the need of computing the exact value of spatio-textual similarity. Experimental study with large semantic trajectory data confirms that our algorithm of processing semantic trajectory join is capable of outperforming our

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Building an English-Chinese parallel Corpus Annotated with Sub-sentential Translation techniques 12

Building an English-Chinese Parallel Corpus Annotated with S...

引用

12th international conference on Language Resources and Evaluation (LREC)

作者： Zhai, Yuming Liu, Lufei Zhong, Xinyi Illouz, Gabriel Vilnat, Anne Univ Paris Saclay LIMSI CNRS F-91400 Orsay France Univ Paris Diderot F-75013 Paris France Univ Sorbonne Nouvelle Paris 3 F-75005 Paris France

ISBN: (纸本)9791095546344

Human translators often resort to different non-literal translation techniques besides the literal translation, such as idiom equivalence, generalization, particularization, semantic modulation, etc., especially when the source and target languages have different and distant origins. Translation techniques constitute an important subject in translation studies, which help researchers to understand and analyse translated texts. However, they receive less attention in developing Natural Language processing (NLP) applications. To fill this gap, one of our long term objectives is to have a better semantic control of extracting paraphrases from bilingual parallel corpora. Based on this goal, we suggest this hypothesis: it is possible to automatically recognize different sub-sentential translation techniques. For this original task, since there is no dedicated data set for English-Chinese, we manually annotated a parallel corpus of eleven genres. Fifty sentence pairs for each genre have been annotated in order to consolidate our annotation guidelines. Based on this data set, we conducted an experiment to classify between literal and non-literal translations. The preliminary results confirm our hypothesis. The corpus and code are available. We hope that this annotated corpus will be useful for linguistic contrastive studies and for fine-grained evaluation of NLP tasks, such as automatic word alignment and machine translation.

关键词： corpus annotation translation technique automatic classification

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 147 148 149 150 151 152 153 154 155 156 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：