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

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

作者： Chang, Hong Ma, Shang-Chih Lee, Chang-Hong Dept. of Electrical Engineering National Taipei University of Technology Taipei Taiwan

ISBN: (纸本)9781538631515

Using the multilevel concatenation, long block codes can be constructed from shorter component codes, resulting in much less decoding complexity. the component codes can also be constructed from multilevel concatenation so that a hierarchical multilevel concatenated structure is built. the decoding complexity of the hierarchical scheme can be further decreased. © 2017 IEEE.

关键词： Concatenated codes

来源：评论

学校读者我要写书评

暂无评论

A distributed parallel system for face recognition

A distributed parallel system for face recognition

引用

4th international conference on parallel and distributed computing, applications and technologies (PDCAT 2003)

作者： Jiang, CH Su, GD Liu, XD Tsinghua Univ Dept Elect Engn State Key Lab Intelligent Technol & Syst Beijing 100084 Peoples R China

ISBN: (纸本)0780378407

this paper presents a distributed parallel system for face recognition. the face database in this system is so huge (more than 1,000 thousand faces) that matching and recognition processes can not be carried out on only one computer. So cluster system must be used to improve the matching speed. But many current clusters existing have some problems and can not fit our system. A special distributed parallel system was developed to complete face query and recognition. the concept of parallel virtual machine and a kind of linked table structure adopted in this system not only decreased lots of moving overhead of adding or deleting nodes in the array structure but also truly realized the infinite extensibility. Furthermore, key techniques such as distributed database, buffer and synchronization techniques in communication and multithreading in control flow were adopted to guarantee the normal running. Practical results proved that this parallel system can improve the matching speed for more than 4 times. Moreover, the greatest advantage of this system is not only increasing matching speed but breaking the upper limit of face data capacity. Consequently, the face data capability of this system can be extended to arbitrary figure as bigger as possible.

关键词： distributed parallel system distributed database face recognition parallel virtual machine

来源：评论

学校读者我要写书评

暂无评论

A robust PDE solver for the 3D Stokes/Navier-Stokes systems on the grid environment 07

A robust PDE solver for the 3D Stokes/Navier-Stokes systems ...

引用

8th IEEE/ACM international conference on Grid computing

作者： Yang, Huidong Zulehner, Walter Langer, Ulrich Baumgartner, Markus Johannes Kepler Univ Linz Inst Computat Math Altenbergstr 69 A-4040 Linz Austria Johannes Kepler Univ Linz Inst Graph & Parallel Proc A-4040 Linz Austria

ISBN: (纸本)9781424415595

Since grid computing provides users with more distributed computing and storage resources, it gives us an opportunity to design new efficient and robust solvers for the numerical solutions of partial differential equations (PDEs). For instance, large scale problems in computational fluid dynamics (CFD) can be efficiently simulated under this environment. However, unfortunately, most of the currently developed PDE solvers using the finite element method (FEM), usually tight combinations of a mesh generator and a linear system solver, are not qualified for the grid computing environment. In this paper, based on principles of grid computing, we present a grid-enabled Client/Server model for solving the Stokes/(incompressible) Navier-Stokes system in 3D.

关键词： Robustness Grid computing Computational fluid dynamics distributed computing Partial differential equations Large-scale systems Computational modeling Finite element methods Mesh generation Linear systems

来源：评论

学校读者我要写书评

暂无评论

Communication links for distributed quantum computation

引用

IEEE TRANSACTIONS ON COMPUTERS 2007年第12期56卷 1643-1653页

作者： Van Meter, Rodney Nemoto, Kae Munro, William J. Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan Hewlett Packard Labs Bristol BS34 8QZ Avon England

distributed quantum computation requires quantum operations that act over a distance on error correction-encoded states of logical qubits, such as the transfer of qubits via teleportation. We evaluate the performance of several quantum error correction (QEC) codes and find that teleportation failure rates of one percent or more are tolerable when two levels of the [[ 23, 1, 7]] code are used. We present an analysis of performing QEC on QEC-encoded states that span two quantum computers, including the creation of distributed logical zeros. the transfer of the individual qubits of a logical state may be multiplexed in time or space, moving serially across a single link or in parallel across multiple links. We show that the performance and reliability penalty for using serial links is small for a broad range of physical parameters, making serial links preferable for a large, distributed quantum multicomputer when engineering difficulties are considered. Such a multicomputer will be able to factor a 1,024-bit number using Shor's algorithm with a high probability of success.

关键词： emerging technologies communication/networking and information technology computer systems organization interconnection architectures multiple data stream architectures (multiprocessors) processor architectures interconnections (subsystems) data communications hardware error-checking reliability testing fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Accurate evaluation of bivariate polynomials 17

Accurate evaluation of bivariate polynomials

引用

17th international conference on parallel and distributed computing, applications and technologies (PDCAT)

作者： Du, Peibing Jiang, Hao Li, Housen Cheng, Lizhi Yang, Canqun Natl Univ Def Technol Sch Sci Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Coll Comp Changsha 410073 Hunan Peoples R China Max Planck Inst Biophys Chem Am Fassberg 11 D-37077 Gottingen Germany Natl Univ Def Technol State Key Lab High Performance Computat Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Sci & Technol Parallel & Distributed Proc Lab Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781509050819

Polynomials are widely used in scientific computing and engineering. In this paper, we present an accurate and fast compensated algorithm to evaluate bivariate polynomials with floating-point coefficients. this algorithm is applying error free transformations to the bivariate Horner scheme and sum the final decomposition accurately. We also prove the proposed algorithm's accuracy with forward error analysis that the accuracy of the computed result is similar to the result computed by the bivariate Horner scheme in twice the working precision. Numerical experiments illustrate the behavior and it has higher efficiency than the bivariate Horner scheme implemented in double-double library.

关键词： Bivariate polynomial Floating point arithmetic Numerical accuracy Horner scheme Compensation

来源：评论

学校读者我要写书评

暂无评论

Automatic evaluation of the computation structure of parallel applications

Automatic evaluation of the computation structure of paralle...

引用

10th international conference on parallel and distributed computing, applications and technologies

作者： Gonzalez, Juan Gimenez, Judit Labarta, Jesus Univ Politecn Cataluna Barcelona Supercomp Ctr Barcelona Spain

ISBN: (纸本)9781424452910

Many data mining techniques have been proposed for parallel applications performance analysis, the most interesting being clustering analysis. Most cases have been used to detect processors with similar behavior. In previous work, we presented a different approach: clustering was used to detect the computation structure of the applications and how these different computation phases behave. In this paper, we present a method to evaluate the accuracy of this structure detection. this new method is based on the Single Program Multiple Data (SPMD) paradigm exhibited by real parallel programs. Assuming an SPMD structure, we expect that all tasks of a parallel application execute the same operation sequence. Using a Multiple Sequence Alignment (MSA) algorithm, we check the sequence ordering of the detected clusters to evaluate the quality of the clustering results.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

distributed XML processing over various topologies: Pipeline and parallel processing characterization

Distributed XML processing over various topologies: Pipeline...

引用

8th international conference on Web Information Systems and technologies, WEBIST 2012

作者： Uratani, Yoshiyuki Koide, Hiroshi Cavendish, Dirceu Oie, Yuji Global Scientific Information and Computing Center Tokyo Institute of Technology O-okayama 2-12-1 Meguroku Tokyo 152-8550 Japan Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Kawazu 680-4 Iizuka Fukuoka 820-8502 Japan Network Design Research Center Kyushu Institute of Technology Kawazu 680-4 Iizuka Fukuoka 820-8502 Japan

ISBN: (纸本)9789898565082

this paper characterizes distributed XML processing on networking nodes. XML documents are sent from a client node to a server node through relay nodes, which process the documents before arriving at the server. According as the node topology, the XML documents are processed in a pipelining manner or a parallel fashion. We evaluate distributed XML processing with synthetic and realistic XML documents on real and virtual environments. Characterization of well-formedness and grammar validation processing via pipelining and parallel models reveals inherent advantages of the parallel processing model.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

An Efficient parallel Algorithm for H.264/AVC Encoder

An Efficient Parallel Algorithm for H.264/AVC Encoder

引用

9th international conference on parallel and distributed computing, applications and technologies

作者： Sun, Shuwei Chen, Shuming Natl Univ Def Technol Comp Sch Changsha Hunan Peoples R China

ISBN: (纸本)9780769534435

In this paper, a bit-rate estimation method is proposed, which could improve the performance of the H.264 encoder and avoid the strict data-dependences of mode decision. After that, an efficient parallel algorithm for H.264 encoder with CABAC entropy coding is presented based on the Macro-Block Region Partition (MBRP) parallel method and the bit-rate estimation technique. Simulation results show that, the proposed parallel algorithm could improve the performance of H.264 encoder efficiently while maintaining the similar RD performance as JM 10.2.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 8th WSEAS international conference on Data Networks, Communications, Computers, DNCOCO '09

Proceedings of the 8th WSEAS International Conference on Dat...

引用

8th WSEAS international conference on Data Networks, Communications, Computers, DNCOCO '09

ISBN: (纸本)9789604741342

the proceedings contain 37 papers. the topics discussed include: stable protocols for the medium access control in wireless networks;new approaches of parallel calculus in groups of firms;mathematical theory of information technology;AI, granular computing, and automata with structured memory;using cloud computing for E-Learning systems;quality model for M-Learning applications;robustness of information systems and technologies;using some web content mining techniques for Arabic text classification;a modified C-Means clustering algorithm;new implementation of unsupervised ID3 algorithm (NIU-ID3) using Visual ***;distributed algorithms for power saving optimization in sensor network;secure automatic ticketing system;and secure distribution of confidential information via self-destructing data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Garbage Collection for Service Oriented distributed Reliable Environment D-ReServE

Garbage Collection for Service Oriented Distributed Reliable...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Brzezinski, Jerzy Danilecki, Arkadiusz Holenko, Mateusz Kobusinska, Anna Zierhoffer, Piotr Poznan Univ Tech Inst Comp Sci Poznan Poland

ISBN: (纸本)9780769548791

D-ReServE increases reliability of SOA-based systems in case of failure occurrence. the fault-tolerant information in D-ReServE is stored in the Stable Storage, which available space depletes with time. thus, in this paper we propose a garbage collection protocol for D-ReServE that allows the periodic purging of the Stable Storage, and discuss the challenges of garbage collection due to the nature of SOA systems.

关键词： SOA fault tolerance reliability rollback-recovery garbage-collection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：