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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

7,403 篇 会议
348 篇 期刊文献
57 册 图书
17 篇 学位论文

馆藏范围

7,825 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,450 篇 工学
- 3,422 篇 计算机科学与技术...
- 1,717 篇 软件工程
- 1,076 篇 电气工程
- 714 篇 信息与通信工程
- 343 篇 控制科学与工程
- 342 篇 电子科学与技术（可...
- 304 篇 光学工程
- 233 篇 机械工程
- 224 篇 生物医学工程（可授...
- 178 篇 仪器科学与技术
- 154 篇 生物工程
- 90 篇 测绘科学与技术
- 59 篇 化学工程与技术
- 56 篇 航空宇航科学与技...
- 53 篇 材料科学与工程（可...
- 47 篇 土木工程
- 42 篇 动力工程及工程热...
- 40 篇 力学（可授工学、理...
1,599 篇 理学
- 781 篇 物理学
- 690 篇 数学
- 181 篇 生物学
- 145 篇 统计学（可授理学、...
- 142 篇 系统科学
- 80 篇 化学
556 篇 医学
- 456 篇 临床医学
- 103 篇 特种医学
- 80 篇 基础医学(可授医学...
446 篇 管理学
- 288 篇 管理科学与工程(可...
- 176 篇 图书情报与档案管...
- 74 篇 工商管理
37 篇 法学
36 篇 农学
23 篇 经济学
20 篇 文学
17 篇 教育学
7 篇 艺术学
6 篇 军事学

主题

868 篇 parallel process...
693 篇 image processing
326 篇 image segmentati...
297 篇 concurrent compu...
273 篇 distributed comp...
259 篇 computational mo...
252 篇 computer archite...
250 篇 feature extracti...
215 篇 image reconstruc...
195 篇 image edge detec...
186 篇 image coding
177 篇 graphics process...
170 篇 iterative method...
166 篇 hardware
165 篇 algorithm design...
164 篇 neural networks
160 篇 deep learning
159 篇 computer science
142 篇 pixel
140 篇 graphics process...

机构

47 篇 national laborat...
25 篇 college of compu...
21 篇 natl univ def te...
20 篇 natl univ def te...
19 篇 science and tech...
14 篇 natl univ def te...
13 篇 school of comput...
12 篇 univ chinese aca...
11 篇 king saud univer...
11 篇 university of ch...
11 篇 natl univ def te...
10 篇 national univers...
9 篇 natl univ def te...
9 篇 institute of inf...
9 篇 national laborat...
8 篇 natl univ def te...
8 篇 department of co...
8 篇 national laborat...
8 篇 college of compu...
8 篇 school of comput...

作者

37 篇 dou yong
28 篇 luo zhigang
27 篇 yong dou
21 篇 zhang xiang
19 篇 zhigang luo
18 篇 li dongsheng
17 篇 naiyang guan
17 篇 qiao peng
15 篇 huang xuhui
15 篇 jie liu
14 篇 niu xin
13 篇 yijie wang
13 篇 lan long
13 篇 wang huaimin
12 篇 anon
11 篇 xiang zhang
11 篇 yang yang
11 篇 liu jie
11 篇 wang yijie
11 篇 pesquet jean-chr...

语言

7,657 篇 英文
112 篇 其他
52 篇 中文
7 篇 土耳其文
3 篇 俄文

检索条件"任意字段=Conference on Parallel and Distributed Methods for Image Processing"

共 7825 条记录，以下是4961-4970 订阅

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

详细简洁

排序：

A Scalable parallel Approach for Peptide Identification from Large-scale Mass Spectrometry Data

A Scalable Parallel Approach for Peptide Identification from...

引用

38th International conference on parallel processing

作者： Kulkarni, Gaurav Kalyanaraman, Ananth Cannon, William R. Baxter, Douglas Washington State Univ Sch Elect Engn & Comp Sci Pullman WA 99164 USA Pacific Northwest Natl Lab Richland WA USA

ISBN: (纸本)9781424449231

Identifying peptides, which are short polymeric chains of amino acid residues in a protein sequence, is of fundamental importance in systems biology research. The most popular approach to identify peptides is through database search. In this approach, an experimental spectrum ("query") generated from fragments of a target peptide using mass spectrometry is computationally compared with a database of already known protein sequences. The goal is to detect database peptides that are most likely to have generated the target peptide. The exponential growth rates and overwhelming sizes of biomolecular databases make this an ideal application to benefit from parallel computing. However, the present generation of software tools is not expected to scale to the magnitudes and complexities of data that will be generated in the next few years. This is because they are all either serial algorithms or parallel strategies that have been designed over inherently serial methods, thereby requiring high space- and time-requirements. In this paper, we present an efficient parallel approach for peptide identification through database search. Three key factors distinguish our approach from that of existing solutions: i) (space) Given p processors and a database with N residues, we provide the first space-optimal algorithm (O(N/p)) under distributed memory machine model;ii) (time) Our algorithm uses a combination of parallel techniques such as one-sided communication and masking of communication with computation to ensure that the overhead introduced due to parallelism is minimal;and iii) (quality) The run-time savings achieved using parallel processing has allowed us to incorporate highly accurate statistical models that have previously been demonstrated to ensure high quality prediction albeit on smaller scale data. We present the design and evaluation of two different algorithms to implement our approach. Experimental results using 2.65 million microbial proteins show linear scaling up

关键词： parallel peptide identification mass spectrometry

来源：评论

学校读者我要写书评

暂无评论

processing transactions with greater accuracy and availability in copar

Processing transactions with greater accuracy and availabili...

引用

21st IASTED International conference on parallel and distributed Computing and Systems, PDCS 2009

作者： Beharry, Sharda Hosein, Michael Hartley, Stephen Crichlow, Joel M. University of the West Indies Trinidad and Tobago Rowan University Glassboro NJ 08028 United States

ISBN: (纸本)9780889868113

This paper investigates the accuracy and availability of COPAR, a distributed service that integrates optimistic and pessimistic methods for managing updates to counter like replicas at a predetermined, tolerable, penalty. The service utilizes a variable, system cost bound, which captures the level of inconsistency the system can bear. Optimistic processing increments and decrements a server's share of the cost bound as dictated by transactions while pessimistic processing calculates a new system cost bound every time a transaction is committed and the new quantity is subsequently distributed among the servers. It is demonstrated that the use of the formula previously applied for calculating the new system cost bound whenever a transaction is committed may result in unacceptable, over allocation of resources and a simple alternate formula that reduces such potentially expensive inaccuracies is presented. The service runs over the Internet and there are different classes of failure that may affect the servers and communication links involved and modest attention has been given to these failure types in the context of the combination concurrency control technique. This paper outlines modifications to server behaviour in COPAR that enhance availability.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Theoretical and Empirical Analysis of a GPU based parallel Bayesian Optimization Algorithm

Theoretical and Empirical Analysis of a GPU based Parallel B...

引用

10th International conference on parallel and distributed Computing, Applications and Technologies

作者： Munawar, Asim Wahib, Mohamed Munetomo, Masaharu Akama, Kiyoshi Hokkaido Univ Grad Sch Informat Sci & Technol Sapporo Hokkaido Japan Hokkaido Univ Informat Initiat Ctr Sapporo Hokkaido Japan

ISBN: (纸本)9781424452910

General Purpose computing over Graphical processing Units (GPGPUs) is a huge shift of paradigm in parallel computing that promises a dramatic increase in performance. But GPGPUs also bring an unprecedented level of complexity in algorithmic design and software development. In this paper we describe the challenges and design choices involved in parallelization of Bayesian Optimization Algorithm (BOA) to solve complex combinatorial optimization problems over nVidia commodity graphics hardware using Compute Unified Device Architecture (CUDA). BOA is a well-known multivariate Estimation of Distribution Algorithm (EDA) that incorporates methods for learning Bayesian Network (BN). It then uses BN to sample new promising solutions. Our implementation is fully compatible with modern commodity GPUs and therefore we call it gBOA (BOA on GPU). In the results section, we show several numerical tests and performance measurements obtained by running gBOA over an nVidia Tesla C1060 GPU. We show that in the best case we can obtain a speedup of up to 13x.

关键词： General Purpose computing over GPU (GPGPU) Estimation of Distribution Algorithms (EDAs)

来源：评论

学校读者我要写书评

暂无评论

distributed volumetric scene geometry reconstructionwith a network of distributed smart cameras

Distributed volumetric scene geometry reconstructionwith a n...

引用

2009 IEEE conference on Computer Vision and Pattern Recognition, CVPR 2009

作者： Liu, Shubao Kang, Kongbin Tarel, Jean-Philippe Cooper, David B. Division of Engineering Brown University Providence RI 02912 United States Paris France

ISBN: (纸本)9781424439935

Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless communication capability is the "efficient" reconstruction of the 3D geometry structure in the scene. What is meant by "efficient" reconstruction? In this paper we investigate this from different aspects in the context of visual sensor networks and offer a distributed reconstruction algorithm roughly meeting the following goals: 1. Close to achievable 3D reconstruction accuracy and robustness;2. Minimization of the processing time by adaptive computing-job distribution among all the cameras in the network and asynchronous parallel processing;3. Communication Optimization and minimization of the (batterystored) energy, by reducing and localizing the communications between cameras. A volumetric representation of the scene is reconstructed with a shape from apparent contour algorithm, which is suitable for distributed processing because it is essentially a local operation in terms of the involved cameras, and apparent contours are robust to ourdoor illumination conditions. Each camera processes its own image and performs the computation for a small subset of voxels, and updates the voxels through collaborating with its neighbor cameras. By exploring the structure of the reconstruction algorithm, we design the minimumspanning- tree (MST) message passing protocol in order to minimize the communication. Of interest is that the resulting system is an example of "swarm behavior". 3D reconstruction is illustrated using two real image sets, running on a single computer. The iterative computations used in the single processor experiment are exactly the same as are those used in the network computations. distributed concepts and algorithms for network control and communication performance are theoretical designs and estimates.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

parallel Transistor Level Circuit Simulation using Domain Decomposition methods

Parallel Transistor Level Circuit Simulation using Domain De...

引用

14th Asia and South Pacific Design Automation conference

作者： Peng, He Cheng, Chung-Kuan Univ Calif San Diego Dept Comp Sci & Engn La Jolla CA 92093 USA

ISBN: (纸本)9781424427482

This paper presents an efficient parallel transistor level full-chip circuit simulation tool with SPICE-accuracy. The new approach partitions the circuit into a linear domain and several non-linear domains based on circuit non-linearity and connectivity. The linear domain is solved by parallel fast linear solver while nonlinear domains are parallelly distributed into different processors and solved by direct solver. parallel domain decomposition technique is used to iteratively solve the different partitions of the circuit and ensure convergence. Different domain decomposition techniques are discussed. Orders of magnitude speedup over SPICE is observed for sets of large-scale VLSI circuits.

关键词： SPICE

来源：评论

学校读者我要写书评

暂无评论

Comparing methods for the efficient analysis of PEPA models of non-repudiation protocols

Comparing methods for the efficient analysis of PEPA models ...

引用

15th International conference on parallel and distributed Systems, ICPADS '09

作者： Zhao, Yishi Thomas, Nigel Newcastle University United Kingdom

ISBN: (纸本)9780769539003

In this paper we study the overhead introduced by secure functions in considering two models of non-repudiation protocols. The models are specified using the Markovian process algebra PEPA. The basic model suffers from the well known state space explosion problem when tackled using Markov chain analysis. Following previous study of performance modelling on security protocols, mean value analysis and fluid flow approximation based on ordinary differential equations (ODEs) have been chosen as efficient analysis techniques. Mean value analysis is an efficient exact method for deriving a limited set of metrics for large numbers of clients involved in the protocols. Fluid flow approximations can be adopted to solve the system with extremely large populations and potentially derive a wider range of metrics. The models are analyzed numerically and results derived from mean value analysis are compared with the ODE solution. © 2009 IEEE.

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

image Enlargement Using Symmetric B-Spline Basis on Closed Periodic Zone

Image Enlargement Using Symmetric B-Spline Basis on Closed P...

引用

IEEE International conference on Intelligent Computing and Intelligent Systems

作者： Zhou, Kaiting Zheng, Lixin Lin, Fuyong Huaqiao Univ Coll Informat Sci & Engn Quanzhou Peoples R China

ISBN: (纸本)9781424447541

Aiming at the weakness of ignoring symmetry property and using complicated iterative algorithms to solve for interpolation coefficients in the existing time domain B-spline interpolation methods, this paper presents a novel B-spline interpolation method using symmetric B-spline basis on closed periodic zone where interpolation coefficients can be fast computed by parallel algorithms. First we shift naive B-spline basis to establish symmetric B-spline basis, next we use orthogonality properties of complex exponentials to establish orthogonal B-spline basis on closed periodic zone and derive parallel computing formula for coefficients of orthogonal B-spline basis;we further use relation between coefficients of orthogonal B-spline basis and coefficients of symmetric B-spline basis to achieve parallel computing formulas for interpolation coefficients of symmetric B-spline basis. At last, we extend the method to image enlargement. Experiment results show that, the new theory established in this paper can be used to explain result of B-spline interpolation from standpoint of signal processing. The method presented in this paper can easily carry out parallel computation for interpolation coefficients of symmetric B-spline basis and brings no phase deviation to enlarged image. Compared with neighborhood-based bilinear and bicubic interpolation methods, the new method produces enlargement with higher Peak Signal to Noise Ratio (PSNR) and sharper visual quality.

关键词： parallel algorithms series expansion methods spline and piecewise polynomial interpolation

来源：评论

学校读者我要写书评

暂无评论

Key Elements Tracing Method for parallel XML Parsing in Multi-core System

Key Elements Tracing Method for Parallel XML Parsing in Mult...

引用

10th International conference on parallel and distributed Computing, Applications and Technologies

作者： Li, Xiaosong Wang, Hao Liu, Taoying Li, Wei Chinese Acad Sci Inst Comp Technol Beijing 100080 Peoples R China

ISBN: (纸本)9781424452910

Though XML is applied intensively in a lot of applications, XML parsing is not practical in many fields because of its poor performance. parallel XML parsing on multi-core is a promising choice. Previous methods all adopt data parallel approach on XML parsing. As the semi-structured nature of XML, they were obliged to divide the data into well-formed XML chunks and then parse these chunks parallel. The division process is named as preparsing. As the preparsing is serial, it becomes the bottleneck of parallel XML parsing. Related work Simultaneous Finite Transducer (SFTXP) :parallelized the preparsing stage. It maintained multiple preparser results for each equal sized chunk according to enumerated all possible parsing states. In spite of finite states for each XML, the overhead by SFTXP is tremendous, including CPU time and memory for multiple results generating and storing, respectively. In this work, we address parallel XML parsing by Key Element Parse Tracing (KEPT) method which parallelizes the preparsing and parsing at element level. It remolds the preparsing as a key element extracting process and schedules the processing of key elements in 1:he framework of KEPT. Then parsing process is parallelized as a whole. To demonstrate the effectiveness, we implement it on libxml2 and obtain good scalability on both an 8-core Linux machine and an 8-core 24 SMT Sun machine running Solaris.

关键词： XML parsing parallel multi-core key element tracing

来源：评论

学校读者我要写书评

暂无评论

Towards a 3D Real Time Renal Calculi Tracking for Extracorporeal Shock Wave Lithotripsy

引用

13th International conference on Biomedical Engineering (ICBME)

作者： Manousakas, I. Li, J. J. I Shou Univ Dept Biomed Engn Kaohsiung Cty 840 Taiwan

ISBN: (纸本)9783540928409

Extracorporeal shock wave lithotripsy can fragment renal stones so that they can pass out during urination. Breathing can induce motion of the kidneys which results in reduced efficiency of the treatment. This study attempts to evaluate if a three dimensional method of stone tracking could be possible with existing hardware and software components. A gelatin phantom was imaged with ultrasound to create a three dimensional volume image. Subsequently, two dimensional images acquired in parallel and perpendicular directions to the scans that produced the volume image were registered within the image volume. It is shown that data reduction methods and optimized software can achieve processing times suitable for real time processing.

关键词： ESWL renal stone image analysis

来源：评论

学校读者我要写书评

暂无评论

Lifting factorization based on block parallel system of m-channel perfect reconstruction filter banks

Lifting factorization based on block parallel system of m-ch...

引用

17th European Signal processing conference, EUSIPCO 2009

作者： Suzuki, Taizo Ikehara, Masaaki Department of Electronics and Electrical Engineering Keio University Yokohama Kanagawa 223-8522 Japan

Several lifting-based filter banks (LBFBs) are proposed for lossless-to-lossy image coding. However, the conventional methods can not achieve good coding performance due to many rounding operations, and they may have wide dynamic range of lifting coefficients due to inverse matrix. This paper presents a more practical lifting factorization of M-channel perfect reconstruction filter bank (PRFB). Using the block parallel system of PRFBs with an imposed condition, we can factorize them into a novel lifting structure which is called the parallel lifting. The validity of our structures is shown by applying them to lossless-to-lossy image coding. © EURASIP, 2009.

关键词： Filter banks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：