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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

5,675 篇 会议
3,457 篇 期刊文献
42 篇 学位论文
4 册 图书
1 篇 资讯

馆藏范围

9,179 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,484 篇 工学
- 4,478 篇 计算机科学与技术...
- 1,617 篇 软件工程
- 1,420 篇 电气工程
- 448 篇 信息与通信工程
- 296 篇 控制科学与工程
- 268 篇 电子科学与技术（可...
- 94 篇 仪器科学与技术
- 75 篇 机械工程
- 74 篇 力学（可授工学、理...
- 63 篇 动力工程及工程热...
- 63 篇 化学工程与技术
- 61 篇 生物工程
- 55 篇 生物医学工程（可授...
- 51 篇 农业工程
- 45 篇 材料科学与工程（可...
- 44 篇 土木工程
- 40 篇 光学工程
- 30 篇 建筑学
2,405 篇 理学
- 1,984 篇 数学
- 312 篇 物理学
- 149 篇 统计学（可授理学、...
- 113 篇 系统科学
- 97 篇 生物学
- 89 篇 化学
508 篇 管理学
- 391 篇 管理科学与工程(可...
- 124 篇 图书情报与档案管...
- 77 篇 工商管理
81 篇 医学
- 58 篇 临床医学
68 篇 农学
- 62 篇 作物学
35 篇 经济学
- 33 篇 应用经济学
28 篇 法学
13 篇 文学
7 篇 教育学
5 篇 艺术学
4 篇 军事学

主题

9,179 篇 parallel algorit...
1,158 篇 concurrent compu...
847 篇 algorithm design...
672 篇 parallel process...
616 篇 computer science
460 篇 computational mo...
374 篇 computer archite...
289 篇 phase change ran...
233 篇 application soft...
224 篇 parallel archite...
215 篇 hypercubes
200 篇 very large scale...
198 篇 costs
196 篇 parallel program...
176 篇 sorting
175 篇 scalability
165 篇 hardware
152 篇 data mining
147 篇 routing
144 篇 clustering algor...

机构

26 篇 carnegie mellon ...
19 篇 school of electr...
17 篇 department of co...
17 篇 ibm thomas j. wa...
16 篇 department of co...
15 篇 old dominion uni...
15 篇 hiroshima univ d...
13 篇 purdue univ dept...
13 篇 univ texas dept ...
12 篇 georgia inst tec...
12 篇 univ maryland de...
12 篇 old dominion uni...
12 篇 school of comput...
11 篇 swiss fed inst t...
11 篇 univ maryland co...
11 篇 univ maryland in...
10 篇 georgia inst tec...
10 篇 department of co...
10 篇 department of co...
10 篇 eth zurich

作者

35 篇 shun julian
33 篇 olariu s
30 篇 p. banerjee
30 篇 blelloch guy e.
26 篇 nakano koji
24 篇 bader david a.
18 篇 dhulipala laxman
18 篇 gu yan
17 篇 ito yasuaki
16 篇 schwing jl
15 篇 v. kumar
15 篇 khan maleq
14 篇 sun yihan
14 篇 shi-jinn horng
14 篇 vishkin uzi
13 篇 ballard grey
13 篇 takefuji y
13 篇 banerjee p
13 篇 han yj
12 篇 ramachandran v

语言

8,732 篇 英文
367 篇 其他
61 篇 中文
9 篇 俄文
4 篇 德文
3 篇 西班牙文
2 篇 法文

检索条件"主题词=Parallel algorithms"

共 9179 条记录，以下是4381-4390 订阅

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

详细简洁

排序：

A parallel algorithm of polygons packing based on ant colony

A parallel algorithm of polygons packing based on ant colony

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Wen Peng Ruofeng Tong Min Tang Jinxiang Dong State Key Laboratory of CAD d CG University of Zhejiang Hangzhou China Zhejiang University Hangzhou Zhejiang CN Inst. of Artificial Intelligence Zhejiang Univ. China

ISBN: (纸本)184000025

This paper presents a novel algorithm for optimal packing problem by combining ant colony algorithm with BLF (bottom-left-fill) heuristic approach. The proposed algorithm not only automatically looks for the best sequence of the polygons and each polygon's optimum rotation by ant colony algorithm but also implements the exact layout with the BLF heuristic algorithm. Moreover, the algorithm supports the parallel computation and facilitates quick convergence to the optimal solution. The experimental results show the effectiveness of our algorithm comparing with the other methods.

关键词： parallel algorithms Heuristic algorithms Genetic algorithms Computational modeling Concurrent computing Manufacturing Computational complexity Simulated annealing Shape Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for correlating event streams

A parallel algorithm for correlating event streams

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： D.M. Zimmerman K.M. Chandy Computer Science 256-80 California Institute of Technology Pasadena CA USA

This paper describes a parallel algorithm for correlating or "fusing" streams of data from sensors and other sources of information. The algorithm is useful for applications where composite conditions over multiple data streams must be detected rapidly, such as intrusion detection or crisis management. The implementation of this algorithm on a multithreaded system and the performance of this implementation are also briefly described.

关键词： parallel algorithms Temperature sensors Power system modeling Hurricanes Condition monitoring Intrusion detection Noise generators Diseases Hospitals History

来源：评论

学校读者我要写书评

暂无评论

Approximate String Matching Algorithm Using parallel Methods for Molecular Sequence Camparisons

Approximate String Matching Algorithm Using Parallel Methods...

引用

Portuguese Conference on Artificial Intelligence, EPIA

作者： Carla Correa Tavares dos Reis Oswaldo Cruz Foundation Brazil

This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity of time. The parallel program implementation has carried out in C on an available twenty processing nodes clustering architecture using a model of parallel programming systems, the MPI (message-passing interface), which is as library of subroutines. In this paper we are also concerned with reporting the speedup and efficiency measures. More precisely, we present a parallel algorithm for approximate sequence matching, showing its implementation and reporting its measures in comparison to its sequential version. We use one of the possible approaches to reduce the time spent on comparisons of molecular database sequences by distributing the data among processors, which achieves a linear speedup (time) and requires constant space memory per processor (Reis, 2001)

关键词： Sequences Databases Clustering algorithms parallel programming Velocity measurement parallel algorithms DNA Proteins Libraries Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A highly parallel algorithm for the numerical simulation of unsteady diffusion processes

A highly parallel algorithm for the numerical simulation of ...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： Y. Zhuang X.-H. Sun Department of Computer Science Texas Tech University Lubbock TX USA Department of Computer Science Illinois Institute of Technology Chicago IL USA

Stabilized explicit implicit domain decomposition (SEIDD) is a class of globally non-iterative domain decomposition methods for the numerical simulation of unsteady diffusion processes on parallel computers. By adding a communication-cost-free stabilization step to the explicit-implicit domain decomposition (EIDD) methods, the SEIDD methods achieve high stability but with the restriction that the interface boundaries have no crossing-overs inside the domain. In this paper, we present a parallelized SEIDD algorithm with parallelism higher than the number of subdomains, eliminating the disadvantage of non-crossing-over interface boundaries at a slight computation cost.

关键词： parallel algorithms Numerical simulation Diffusion processes Concurrent computing Equations Computer science Computer interfaces Computational efficiency Thermal pollution Iterative algorithms

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for extracting transcriptional regulatory network motifs

A parallel algorithm for extracting transcriptional regulato...

引用

IEEE Symposium on Bioinformatics and Bioengineering (BIBE)

作者： Tie Wang J.W. Touchman Weiyi Zhang E.B. Suh Guoliang Xue Department of Computer Science and Engineering Arizona State University Tempe AZ USA Translational Genomics Research Institute Phoenix AZ USA School of Life Sciences Arizona State University Tempe AZ USA Translational Genomics Research Institute Phoenix AZ

Network motifs have been demonstrated to be the building blocks in many biological networks such as transcriptional regulatory networks. Finding network motifs plays a key role in understanding system level functions and design principles of molecular interactions. In this paper, we present a novel definition of the neighborhood of a node. Based on this concept, we formally define and present an effective algorithm for finding network motifs. The method seeks a neighborhood assignment for each node such that the induced neighborhoods are partitioned with no overlap. We then present a parallel algorithm to find network motifs using a parallel cluster. The algorithm is applied on an E. coli transcriptional regulatory network to find motifs with size up to six. Compared with previous algorithms, our algorithm performs better in terms of running time and precision. Based on the motifs that are found in the network, we further analyze the topology and coverage of the motifs. The results suggest that a small number of key motifs can form the motifs of a bigger size. Also, some motifs exhibit a correlation with complex functions. This study presents a framework for detecting the most significant recurring subgraph patterns in transcriptional regulatory networks.

关键词： parallel algorithms Iterative algorithms Clustering algorithms Partitioning algorithms Bioinformatics Systems biology Proteins Computer networks Frequency Sampling methods

来源：评论

学校读者我要写书评

暂无评论

parallel lattice implementation for option pricing under mixed state-dependent volatility models

Parallel lattice implementation for option pricing under mix...

引用

IEEE International Symposium on High Performance Computing Systems and Applications (HPCS)

作者： G. Campolieti R. Makarov Mathematics Department Wilfrid Laurier University Waterloo ONT Canada

With the principal goal of developing an alternative, relatively simple and tractable pricing framework for accurately reproducing a market implied volatility surface, this paper presents two new asset price return models for option pricing and calibration. We consider a class of hidden Markov models based on Markov switching and a mixture model that embeds two diffusion processes whereby the underlying asset price dynamics obeys a mixed state-dependent non-linear volatility model. In particular, we study the so-called two-state mixture CEV diffusion model. Among possible nonlinear mixed state-dependent models, this proposed model offers a good balance between computational tractability and multiple parameter flexibility in the calibration process. The model also captures most of the empirical features such as leptokurtosis and volatility clustering of asset price returns. We present efficient higher order multinomial lattice methods for calibrating our model and for pricing European and American style equity options. Finally, we discuss two parallel algorithms for implementing the lattice methods: the shared memory and distributed memory algorithms.

关键词： Lattices Pricing Hidden Markov models Diffusion processes Mathematical model Computational modeling Mathematics Calibration parallel algorithms Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A modified word serial bit parallel algorithm for FPGA implementation of digital ionospheric radar

A modified word serial bit parallel algorithm for FPGA imple...

引用

Asia-Pacific Conference on Microwave

Digital signal processing (DSP) has become an integral part of wireless communication systems and equivalent traditional analog systems can be developed with required fidelity at reasonable cost. In a previous work, a DSP technique is employed for radar upconversion using combinations of upsampling and narrow band FIR filtering. An efficient FPGA implementation of the DSP modulator is possible exploiting filter symmetry since symmetrical properties of word serial bits parallel (WSBP) FIR filters improve system throughput. However arithmetic processing rate for the WSBP symmetric models is higher than that of the non-symmetric models. In this paper we present a modified WSBP symmetrical algorithm to reduce the arithmetic processing for implementation of direct conversion ionospheric radar. In WSBP approach processing is performed in integers as block of bits. Matching and buffering criterion are used to reduce computations up to fifty percent. The algorithm can be extended to applications with similar characteristics particularly for system on chip (SOC) techniques.

关键词： parallel algorithms Field programmable gate arrays Radar Digital signal processing Finite impulse response filter Arithmetic Signal processing algorithms Wireless communication Costs Narrowband

来源：评论

学校读者我要写书评

暂无评论

An O(1) Time parallel Algorithm for the Dominance Counting and 3D Block-Based Medial Axis Transform on AROB

An O(1) Time Parallel Algorithm for the Dominance Counting a...

引用

IEEE International Conference on parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Shih-Ying Lin Shi-Jinn Horng Tzong-Wann Kao Yuh-Rau Wang Lan Yang Institute of Technology Taiwan National Taiwan University of Science and Technology Taipei Taiwan Northern Taiwan Institute of Science and Technology Taipei Taiwan Saint Johns and Saint Marys University of Technology Taipei Taiwan

In this paper, we present a constant time algorithm for solving three dimensional block-based medial axis transform (3D BB-MAT, for short) on the array with reconfigurable optical buses (AROB). The main contribution of this work is to exploit the dominance counting method for solving the 3D BB-MAT that was never done previously in the literature. With the advantages of both optical transmission and electronic computation on the AROB model, the constant algorithm is proposed for the medial axis transform of a 3D N x N x N binary image on a 4D AROB using N^4 processors. To the best of our knowledge, this presented result of the dominance counting technique for medial axis transform of block-based is the best O(1) time algorithm known.

关键词： parallel algorithms Optical arrays Image processing Concurrent computing Optical computing Shape Computer vision Application software Pixel Phase change random access memory

来源：评论

学校读者我要写书评

暂无评论

Scalable parallel Quadrilateral Mesh Generation Coupled with Mesh Partitioning

Scalable Parallel Quadrilateral Mesh Generation Coupled with...

引用

IEEE International Conference on parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Jianjun Chen Yao Zheng Xia Ning Center for Engineering and Scientific Computation and College of Computer Science University of Zhejiang Hangzhou Zhejiang China

In this paper, we present our efforts to parallelize an unstructured quadrilateral mesh generator. Its serial version is based on the divider-and-conquer idea, and mainly includes two stages, i.e. geometry decomposition and mesh generation. Both stages are parallelized separately. A highly efficient fine-grain level parallel scheme is presented to parallelize the stage of geometry decomposition. A SubDomain Graph (SDG), which represents the connections of subdomains, is constructed. The task of parallel mesh generation is then reduced to that of the SDG partitioning. Since the number of elements in subdomains could be pre-computed before meshing, a static load balancing scheme to partition the SDG performs well with the aid of Metis tools. Numerical results show that scalable timing performance could be achieved by using the parallel mesh generator with resulting meshes nicely partitioned among processors, which enables a fast parallel simulation environment by eliminating the traditional I/O-busy process of mesh repartitioning.

关键词： Mesh generation Geometry Concurrent computing Computational modeling Educational institutions Computer science Load management Timing Computational efficiency parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm for mining frequent itemsets

Parallel algorithm for mining frequent itemsets

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： You-Lin Ruan Gan Liu Qing-Hua Li School of Information Engineering Huazhong University of Science and Technology Wuhan China School of Information Engineering Wuhan University of Technology Wuhan China

parallel mining frequent itemsets is a key issue in data mining research. A parallel mining algorithm PMFI in distributed database is proposed in this paper, which attempts to make each processor to do independently and decrease the number of candidate of global frequent itemsets according to the relation between local frequent itemsets and global frequent itemsets. Thus, PMFI uses far less communication overhead and fewer synchronization steps, improves efficiency of mining global frequent itemsets.

关键词： parallel algorithms Data mining Itemsets Distributed databases Iterative algorithms Frequency synchronization Transaction databases Machine learning algorithms Gallium nitride Data engineering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 435 436 437 438 439 440 441 442 443 444 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：