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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

486 篇 会议
16 篇 期刊文献
9 册 图书

馆藏范围

511 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

209 篇 工学
- 195 篇 计算机科学与技术...
- 97 篇 软件工程
- 42 篇 电气工程
- 12 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 6 篇 控制科学与工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 力学（可授工学、理...
- 3 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 生物医学工程（可授...
54 篇 理学
- 34 篇 数学
- 6 篇 生物学
- 4 篇 系统科学
- 3 篇 物理学
- 3 篇 化学
- 1 篇 大气科学
- 1 篇 统计学（可授理学、...
16 篇 管理学
- 9 篇 管理科学与工程(可...
- 7 篇 图书情报与档案管...
- 5 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
2 篇 法学
- 2 篇 社会学

主题

97 篇 programming
82 篇 parallel process...
79 篇 parallel archite...
71 篇 parallel program...
63 篇 concurrent compu...
59 篇 computer archite...
46 篇 hardware
43 篇 computational mo...
39 篇 programming prof...
39 篇 algorithm design...
36 篇 parallel algorit...
34 篇 computer science
26 篇 dynamic programm...
24 篇 runtime
24 篇 heuristic algori...
22 篇 program processo...
22 篇 partitioning alg...
21 篇 costs
21 篇 instruction sets
21 篇 clustering algor...

机构

6 篇 school of comput...
5 篇 school of comput...
4 篇 school of comput...
3 篇 department of co...
3 篇 department of co...
3 篇 college of infor...
3 篇 school of electr...
2 篇 department of co...
2 篇 univ minnesota d...
2 篇 school of scienc...
2 篇 soochow univ sch...
2 篇 college of optoe...
2 篇 school of comput...
2 篇 beijing research...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of co...
2 篇 department of co...
2 篇 vision computing...

作者

9 篇 zhong cheng
6 篇 cheng zhong
6 篇 jigang wu
5 篇 hui li
4 篇 shikai guo
4 篇 yeh-cheng chen
4 篇 zhang jinxiong
4 篇 yidong li
4 篇 rong chen
4 篇 sivasankaran raj...
4 篇 hong shen
3 篇 chen danyang
3 篇 wei liu
3 篇 liu jun
3 篇 ruey-shun chen
3 篇 wang shunxu
3 篇 rajamanickam siv...
3 篇 naixue xiong
3 篇 guangzhong sun
3 篇 tonglai liu

语言

508 篇 英文
2 篇 其他
1 篇 中文

检索条件"任意字段=Seventh International Symposium on Parallel Architectures, Algorithms and Programming"

共 511 条记录，以下是371-380 订阅

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

详细简洁

排序：

A simple and efficient parallel disk mergesort

A simple and efficient parallel disk mergesort

引用

11th Annual ACM symposium on parallel algorithms and architectures

作者： Barve, RD Vitter, JS Winphoria Networks Andheri 400093 Mumbai India Duke Univ Dept Comp Sci Ctr Geometr & Biol Comp Durham NC 27708 USA

External sorting-the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks-is a fundamental subroutine in database systems [G], [IBM]. Of prime importance are techniques that use multiple disks in parallel in order to speed up the performance of external sorting. The simple randomized merging (SRM) mergesort algorithm proposed by Barve et al. [BGV] is the first parallel disk sorting algorithm that requires a provably optimal number of passes and that is fast in practice. Knuth [K, Section 5.4.9] recently identified SRM (which he calls "randomized striping") as the method of choice for sorting with parallel disks. In this paper we present an efficient implementation of SRM, based upon novel and elegant data structures. We give a new implementation for SRM's lookahead forecasting technique for parallel prefetching and its forecast and flush technique for buffer management. Our techniques amount to a significant improvement in the way SRM carries out the parallel, independent disk accesses necessary to read blocks of input runs efficiently during external merging. Our implementation is based on synchronous parallel I/O primitives provided by the TPIE programming environment [TPI], whenever our program issues an I/O read (write) operation, one block of data is synchronously read from (written to) each disk in parallel. We compare the performance of SRM over a wide range of input sizes with that of disk-striped mergesort (DSM), which is widely used in practice. DSM consists of a standard mergesort in conjunction with striped I/O for parallel disk access. SRM merges together significantly more runs at a time compared with DSM, and thus it requires fewer merge passes. We demonstrate in practical scenarios that even though the streaming speeds for merging with DSM are a little higher than those for SRM (since DSM merges fewer runs at a time), sorting using SRM is often significantly faster than with DSM

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

MPI backend for an automatic parallelizing compiler

MPI backend for an automatic parallelizing compiler

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： Daesuk Kwon Sangyong Han Heunghwan Kim Seoul National University Gwanak-gu Seoul KR Department of Computer Science Seoul National University South Korea Department of Computer Science Konkuk University South Korea

Many naive parallel processing schemes were not as successful as many researchers thought, because of the heavy cost of communication and synchronization resulting from parallelization. In this paper, we identify the reasons for this poor performance and the compiler requirements for performance improvement. We realized that the parallelizing decisions should be derived from the overhead information. We added this idea to the automatic parallelizing compiler SUIF. We substituted the original backend of SUIF with our backend using MPI, and gave it the capability to validate parallelization decisions based on overhead parameters. This backend converts shared memory-based parallel programs into distributed memory-based parallel programs with MPI function calls without excessive parallelization, which causes performance degradation.

关键词： parallel processing Computer science Costs Multiprocessing systems parallel programming High performance computing Linux Clocks Frequency Microprocessors

来源：评论

学校读者我要写书评

暂无评论

international symposium on Design and Implementation of Symbolic Computation Systems, DISCO 1996

International Symposium on Design and Implementation of Symb...

引用

4th international symposium on Design and Implementation of Symbolic Computation Systems, DISCO 1996

ISBN: (纸本)3540616977

The proceedings contain 35 papers. The special focus in this conference is on Design and Implementation of Symbolic Computation Systems. The topics include: Problem-oriented applications of automated theorem proving;a strongly-typed embeddable computer algebra library;a general framework for implementing calculi and strategies;equality elimination for the tableau method;towards lean proof checking;high performance equational theorem proving;a reflective language based on conditional term rewriting;term rewriting systems;generative geometric modeling in a functional environment;exploiting SML for experimenting with algebraic algorithms;conditional categories and domains;parameterizing object specifications;analyzing the dynamics of a Z specification;integer and rational arithmetic on maspar;parallel 3-primes FFT algorithm;a master-slave approach to parallel term rewriting on a hierarchical multiprocessor;concepts and applications;document-centered presentation of computing software;animating a non-executable formal specification with a distributed symbolic language;uniform representation of basic algebraic structures in computer algebra;integrating computer algebra with proof planning;structures for symbolic mathematical reasoning and computation;an approach to class reasoning in symbolic computation;an intelligent interface to numerical routines;computer algebra and the world wide web;software architectures for computer algebra;a deductive database for mathematical formulas;a system for computer aided constructive algebraic geometry;making systems communicate and cooperate;a database for number fields;compiling residuation for a multiparadigm symbolic programming language and pluggability issues in the multi protocol.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep Just-In-Time Consistent Comment Update via Source Code Changes

Deep Just-In-Time Consistent Comment Update via Source Code ...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Shikai Guo Xihui Xu Hui Li Rong Chen The College of Information Science and Technology Dalian Maritime University Dalian China

ISBN: (纸本)9781665452199

During software development and maintenance, code comments are often missing, inadequate, or they do not match the actual code content. In response to this problem, the research community has proposed a method for updating natural language comments based on code changes. However, there are two major limitations of this method that must be addressed: the long-term and non-temporal dependencies in the source code. To address these limitations, we propose a new model called code semantic learning–comment update (CSL2CU). The code semantic learning component of CSL2CU uses a self-attention mechanism and a positional encoding mechanism. It also uses a relative positional representation to model pairwise relationships between source code tags, thereby improving its ability to capture long-term dependencies and non-temporal dependencies of source code tagging ability. The comment-update component of CSL2CU is used to generate new comments based on old comments and code editing. The experimental results show that the CSL2CU model outperforms the three baselines used in exact match, BLEU, METEOR, and SARI.

关键词： Codes Source coding Semantics Natural languages Tagging programming Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

A communication layer for the construction of global, transparent and quasi-optimal virtual machines for distributed computing

A communication layer for the construction of global, transp...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： A.K.Y. Wong D.S. Yeung Department of Computing Hong Kong Polytechnic University Hong Kong China

The proposed communication layer is a software building block for constructing virtual machines. The construction process is user-transparent. Many distributed communication layers cooperate automatically to form a single global, quasi-optimal virtual machine to be shared by different parallel programs. The virtual machine conceptually sits between the running parallel processes and the underlying physically-distributed processors. It enables inter-process interaction and utilization of physical resources. Its nodes are mapped to different physical processors, and its performance depends on how echo packets are managed in the system. We combine three mechanisms to facilitate the operations in the communication layer; namely the forward rippling mechanism, the echoing mechanism, and the adaptive breadth-first forward successive inferencing mechanism.

关键词： Virtual machining Peer to peer computing Kernel Distributed computing Runtime Libraries parallel programming Load management parallel processing Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Enabling software DSM system for grid computing

Enabling software DSM system for grid computing

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： Tyng-Yeu Liang Chun-Yi Wu Jyh-Biau Chang Ce-Kuen Shieh Pei-Hsin Fan Department of Electrical Engineering National Kaohsiung University of Applied Sciences Kaohsiung Taiwan Department of Electrical Engineering National Cheng Kung University Tainan Taiwan

In this study, we have successfully developed a grid-enabled software distributed shared memory called Teamster-G. This system provides users with not only a shared memory programming interface but also a transparent resource allocation service to easily develop applications and aggregate distributed resources for solving their problems on the grid environment. Moreover, since the communication cost of maintaining data-consistency is a big problem for the performance of the DSM applications, Teamster-G exploits a cluster cache scheme and a two-level consistency protocol to minimize the number of data-consistency messages transferred over wide area network. We will present the framework and the performance of Teamster-G in this paper.

关键词： Software systems Grid computing Resource management Wide area networks Yarn Protocols Costs Processor scheduling parallel architectures Computer applications

来源：评论

学校读者我要写书评

暂无评论

MCVAE: Multi-channel Variational Autoencoder for Anomaly Detection

MCVAE: Multi-channel Variational Autoencoder for Anomaly Det...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Wanzhen Zhang Liheng Xu Zhihui Yu Zikai Zhang Tonglai Liu Shuangyin Liu Engineering Trainning Center Guilin University of Aerospace Technology (College of Information Science and Technology Zhongkai University of Agriculture and Engineering) Guilin China College of Information Science and Technology Zhongkai University of Agriculture and Engineering Guangzhou China State Key Lab of Rail Traffic Control & Safety Beijing Jiaotong University Beijing China

ISBN: (纸本)9781665452199

Unsupervised anomaly detection is a very important problem due to its wide applications in many systems such as the network communication system, the Internet of Things, and the ICS system. Interpretable modeling of heterogeneous data channels is also essential in anomaly detection, due to the intrinsic multi-modality in multi-channel multi-dimension data. Some existing works use variational autoencoder (VAE) for anomaly detection with a single Gaussian distribution model. However, these VAE can not learn the complex distribution between features, and hence cannot make accurate detections. To tackle this challenge, in this paper, we propose a multi-channel VAE model to jointly account for latent relationships across multiple channels. Moreover, we explore the training loss function combining the reconstruction loss of each channel. We also explore the test loss combining the reconstruction probability and reconstruction ratio between global channel information and each channel information. The proposed detector reports an anomaly when the test loss is below a certain threshold. We conduct extensive simulations on a real world dataset and find that our proposed scheme outperforms the state-of-the-art anomaly detection schemes compared with existing methods.

关键词： Training Detectors programming Gaussian distribution Feature extraction parallel architectures Internet of Things

来源：评论

学校读者我要写书评

暂无评论

Cache Optimization Method to Reduce Network Traffic in Communication Systems

Cache Optimization Method to Reduce Network Traffic in Commu...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Ruey-Shun Chen Yu-Xi Hu Xiaopeng Fan Yeh-Cheng Chen Shi-Jinn Horng T.-C. Wang Naixue Xiong Department of computer engineering Dongguan Polytechnic Dongguan P.R. China Department of computer science University of California Davis CA USA The School of Software and Microelectronic Northwestern Polytechnical University Xian P.R. China Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen P.R. China Institute of Information Management National Chiao Tung University School of Computer Science and Technology Tianjin University Tianjin P. R. China

ISBN: (纸本)9781538694046;9781538694039

Using the cloud technology with Smart Protect Network (SPN) to do file virus scanning. The overwhelming increase of population will lead to an increase network traffic usage. In most products, local cache mechanism is implemented for the purpose of reducing the network traffics. However, the database designed to store cache is limited, lot of times, cache will get purged when there are lots of queries sent and replaced by other newest queries. It is not an efficient by using traditional methodology to build or forming cache. In order to reduce the network traffic usage, the paper propose a solution, which utilize data mining technique with clustering concept, by gathering the current feedback data we have from our SPN, we are able to form these data in groups with similarity, and by deploying these data to client side, to achieve the reduction of traffic usage. In prototyping, this design for military communications can really reduce network traffic more than 20%. And the speed of file scanning time can faster more than 12%.

关键词： parallel architectures programming Data mining Optimization Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

Scheduling independent tasks on partitionable hypercube multiprocessors

Scheduling independent tasks on partitionable hypercube mult...

引用

international symposium on parallel Processing

作者： B. Narahari R. Krishnamurti Department of EE&CS George Washington University DC USA School of Computing Science Simon Fraser University Burnaby BC Canada

A partitionable hypercube allows simultaneous execution of multiple tasks, where each task can be executed on a choice of subcubes. This paper considers the problem of static nonpreemptive scheduling of w independent tasks on a n processor partitionable hypercube system to minimize the overall finishing time of the w tasks. Each task can be executed on subcubes of different sizes, with smaller execution times on larger subcubes. A schedule determines the size of the subcube to be assigned to each task and schedules these tasks on the processors in the hypercube system. The problem of finding the optimal schedule, with minimum finishing time, is known to be NP-hard. This paper presents a fast polynomial time approximation algorithm for the problem, and derives a tight worst-case performance bound of 2 for the algorithm.< >

关键词： Hypercubes Optimal scheduling Processor scheduling Partitioning algorithms Finishing Approximation algorithms Computer architecture parallel architectures parallel processing Polynomials

来源：评论

学校读者我要写书评

暂无评论

Differential Privacy Protection and Game Analysis of Intelligent Transportation Data

Differential Privacy Protection and Game Analysis of Intelli...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Junming Zhang Jingru Wang Shigong Long Lun Wang Xuejiao Wang Renrui Zhang Guizhou Polytechnic of Construction Guiyang China College of Computer Science and Technology Guizhou University Guiyang China

ISBN: (纸本)9781665496407

With the informatization and intelligentization of the Internet of Vehicle (IoV), location-based services have brought great convenience to users, but it has also brought about the security problem of privacy exposure. Vehicle users hope that their private data will be protected and at the same time they will be able to obtain good road service quality. In response to the above problems, this paper proposes a location privacy protection method based on local differential privacy. Firstly, we use the Voronoi diagram to divide and number the road network space; then, we perform K-RR random perturbation on the user's location data to make the result meet the local differential privacy. Thirdly, we set up an incentive mechanism, build a game model, and define the user's payment matrix under the verification strategy and the server's cheating strategy is analyzed, and the user's expected revenue is analyzed. The experimental results show that the user's benefit first decreases and then increases with the increase of the privacy protection parameters. The benefit is linear, and the road condition service quality has a relatively large impact on the benefit of users' shared location.

关键词： Differential privacy Privacy Roads Perturbation methods Games programming Smart transportation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 34 35 36 37 38 39 40 41 42 43 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：