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

International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)

作者： Zhichao Cao Shiming Xu Wei Xue Wenguang Chen Department Computer Science & Technology Tsinghua University Beijing China Delft Institute Applied Math Technical University Delft Delft Netherlands

In recent years, GPU (Graphic Processor Unit) has become an import accelerator for conventional applications. User has to program in GPU-based environments, such as CUDA, and it usually requires detailed tuning for good performances. Also since GPU has high Single Precision (SP) performance while its Double Precision (DP) performance falls short, it has limited application in scientific computing. In this paper, our algorithm aims at accelerating the solving of dense linear equation on hybrid CPU-GPU system. We adopt iterative refinement to utilize the high SP capability of GPUs while achieving DP precision requirements. Specifically, we implement algorithm with utilize both GPU and CPU for computation-intensive parts by overlapping computations. Its performance reaches up to 236 GFLOP/s, which is by far better than the result achieved by DP-only algorithms.

关键词： Equations Iterative algorithms Linear systems Graphics Scientific computing Performance analysis Algorithm design and analysis Parallel processing Acceleration Numerical stability

来源：评论

学校读者我要写书评

暂无评论

Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 12th InternationalWorkshop, APPROX 2009 and 13th International Workshop, RANDOM 2009 Berkeley, CA, USA, August 21-23, 2009 Proceedings. Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2009年 5687 LNCS卷 V-VII页

作者： Dinur, Irit Jansen, Klaus Naor, Joseph Rolim, José Weizmann Institute of Science Dept. of Applied Math and Computer Science Rehovot 76100 Israel University of Kiel Institute for Computer Science and Applied Mathematics Olshausenstr. 40 24098 Kiel Germany Technion Computer Science Department Haifa 32000 Israel University of Geneva Centre Universitaire d'Informatique Battelle Bat. A 7 rte de Drize 1227 Carouge Switzerland

来源：评论

学校读者我要写书评

暂无评论

Belief rule-based inference methodology to improve nuclear safeguards information evaluation

Belief rule-based inference methodology to improve nuclear s...

引用

Conference of the North American Fuzzy Information Processing Society - NAFIPS

作者： Da Ruan Roland Carchon Klaas van der Meer Jun Liu Hui Wang Luis Martinez Department of Applied Math. and Computer Science Ghent University Ghent Belgium Belgian Nuclear Research Center SCK CEN Ghent Belgium Belgian Nuclear Research Center SCK CEN School of Computing and Math. University of Ulster UK Department of Computer Science and Engineering Faculty of Electrical Engineering University of Jaen Jaen Spain

A framework for modeling, analyzing and synthesizing nuclear safeguards information with various uncertainties is proposed by using a newly developed belief rule-base inference methodology (RIMER). After a hierarchical analysis of States' nuclear activities on the basis of the International Atomic Energy Agency (IAEA) physical model, the multi-layer structure of the evaluation model for States' nuclear activities is outlined. The special emphasis is given to the synthesis and evaluation analysis of the physical model indicator information by RIMER, which handles hybrid uncertain information in nuclear safeguards evaluation process. The proposed framework illustrates and clarifies the inference and synthesis formalism from a case study of nuclear safeguards information evaluation.

关键词： Information analysis Erbium computer science Uncertainty Fuzzy logic Nuclear fuels Protocols Information processing Decision making Production systems

来源：评论

学校读者我要写书评

暂无评论

A Two-Frame Theory of Motion, Lighting and Shape

A Two-Frame Theory of Motion, Lighting and Shape

引用

26th IEEE Conference on computer Vision and Pattern Recognition (CVPR 2008), vol.10

作者： Ronen Basri Darya Frolova Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

This paper explores how shape, motion, and lighting interact in the case of a two-frame motion sequence. We consider a rigid object with Lambertian reflectance properties undergoing small motion with respect to both a camera and a stationary point light source. Assuming orthographic projection, we derive a single, first order quasilinear partial differential equation that relates shape, motion, and lighting, while eliminating out the albedo. We show how this equation can be solved, when the motion and lighting parameters are known, to produce a 3D reconstruction of the object. A solution is obtained using the method of characteristics and can be refined by adding regularization. We further show that both smooth bounding contours as well as surface markings can be used to derive Dirichlet boundary conditions. Experimental results demonstrate the quality of this reconstruction.

关键词： Shape Image reconstruction Brightness Cameras Boundary conditions Reflectivity Light sources Partial differential equations Surface reconstruction Photometry

来源：评论

学校读者我要写书评

暂无评论

Unconditional Privacy over Channels which Cannot Convey Quantum Information

引用

Physical Review Letters 2008年第11期100卷 110502-110502页

作者： K. Horodecki M. Horodecki P. Horodecki D. Leung J. Oppenheim Department of Math Physics and Computer Science University of Gdańsk Gdańsk Poland National Quantum Information Centre of Gdańsk 81-824 Sopot Poland Institute of Theoretical Physics and Astrophysics University of Gdańsk Gdańsk Poland Faculty of Applied Physics and Math Technical University of Gdańsk Gdańsk Poland Institute for Quantum Computing University of Waterloo Waterloo Ontario N2L1N8 Canada Department of Applied Mathematics and Theoretical Physics University of Cambridge United Kingdom

Quantum cryptography enables one to verify that the state of the quantum system has not been tampered with and thus one can obtain privacy regardless of the power of the eavesdropper. All previous protocols relied on the ability to faithfully send quantum states or equivalently to share pure entanglement. Here we show this need not be the case—one can obtain verifiable privacy even through some channels which cannot be used to reliably send quantum states.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Similarity by composition 19

引用

20th Annual Conference on Neural Information Processing Systems, NIPS 2006

作者： Boiman, Oren Irani, Michal Department of Computer Science and Applied Math Weizmann Institute of Science 76100 Rehovot Israel

ISBN: (纸本)9780262195683

We propose a new approach for measuring similarity between two signals, which is applicable to many machine learning tasks, and to many signal types. We say that a signal S1 is "similar" to a signal S 2 if it is "easy" to compose S1 from few large contiguous chunks of S2. Obviously, if we use small enough pieces, then any signal can be composed of any other. Therefore, the larger those pieces are, the more similar S1 is to S2. This induces a local similarity score at every point in the signal, based on the size of its supported surrounding region. These local scores can in turn be accumulated in a principled information-theoretic way into a global similarity score of the entire S1 to S2. "Similarity by Composition" can be applied between pairs of signals, between groups of signals, and also between different portions of the same signal. It can therefore be employed in a wide variety of machine learning problems (clustering, classification, retrieval, segmentation, attention, saliency, labelling, etc.), and can be applied to a wide range of signal types (images, video, audio, biological data, etc.) We show a few such examples.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Fraternal Augmentations of graphs, Coloration and Minors

引用

Electronic Notes in Discrete mathematics 2007年 28卷 223-230页

作者： Nešetřil, Jaroslav Ossona de Mendez, Patrice Department of Applied Mathematics Institute of Theoretical Computer Science Charles University Praha Czech Republic Centre d'Analyse Mathématiques Sociales - CNRS UMR 8557 Paris France

We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r, ∇_r (G). We generalize to these classes some results proved for proper minor closed classes and bounded degree graphs, such as the existence of low tree-width colorings, a linear time algorithm to check subgraph isomorphism for a fixed pattern and homomorphism dualities. © 2007 Elsevier B.V. All rights reserved.

关键词： Bounded expansion Coloring Graph Algorithm Homomorphism Ramsey number Restricted duality Subgraph Isomorphism Transitive fraternal augmentation Tree-depth

来源：评论

学校读者我要写书评

暂无评论

Matching Local Self-Similarities across Images and Videos

Matching Local Self-Similarities across Images and Videos

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Eli Shechtman Michal Irani Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

We present an approach for measuring similarity between visual entities (images or videos) based on matching internal self-similarities. What is correlated across images (or across video sequences) is the internal layout of local self-similarities (up to some distortions), even though the patterns generating those local self-similarities are quite different in each of the images/videos. These internal self-similarities are efficiently captured by a compact local "self-similarity descriptor"', measured densely throughout the image/video, at multiple scales, while accounting for local and global geometric distortions. This gives rise to matching capabilities of complex visual data, including detection of objects in real cluttered images using only rough hand-sketches, handling textured objects with no clear boundaries, and detecting complex actions in cluttered video data with no prior learning. We compare our measure to commonly used image-based and video-based similarity measures, and demonstrate its applicability to object detection, retrieval, and action detection.

关键词： Object detection Pixel Image edge detection Distortion measurement Video sequences Image retrieval Filters Heart Image recognition computer science

来源：评论

学校读者我要写书评

暂无评论

A New Interactive Hashing Theorem

A New Interactive Hashing Theorem

引用

Annual IEEE Conference on Computational Complexity

作者： Iftach Haitner Omer Reingold Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO '92), plays an important role in many cryptographic protocols. In particular, it is a major component in all known constructions of statistically- hiding commitment schemes and of zero-knowledge arguments based on general one-way permutations and on one- way functions. Interactive hashing with respect to a one-way permutation f, is a two-party protocol that enables a sender that knows y = f(x) to transfer a random hash z = h(y) to a receiver. The receiver is guaranteed that the sender is committed to y (in the sense that it cannot come up with x and x' such that f(x) Dagger f(x') but h(f(x)) = h(f(x')) = z). The sender is guaranteed that the receiver does not learn any additional information on y. In particular, when h is a two-to-one hash function, the receiver does not learn which of the two pre images {y,y'} = h -1 (z) is the one the sender can invert with respect to f. This paper reexamines the notion of interactive hashing. We give an alternative proof for the Naor et. al. protocol, which seems to us significantly simpler and more intuitive than the original one. Moreover, the new proof achieves much better parameters (in terms of how security preserving the reduction is). Finally, our proof implies a more versatile interactive hashing theorem for a more general setting than that of the Naor et. al. protocol. One generalization relates to the selection of hash function h (allowing much more flexibility). More importantly, the theorem applies to the case where the underlying function f is hard- to-invert only on some given (possibly sparse) subset of the output strings. In other words, the theorem is tuned towards hashing of a value y that may be distributed over a sparse subset of the domain (rather than uniform on the entire domain as a random output of a one-way permutation is). Our interest in interactive hashing is in part as a very appealing object (i.e., independent of any pa

关键词： computer science Cryptographic protocols Cryptography Information security

来源：评论

学校读者我要写书评

暂无评论

Web Services Interfaces and Open Standards Integration into the European UNICORE 6 Grid Middleware

Web Services Interfaces and Open Standards Integration into ...

引用

International Workshop on Enterprise Distributed Object Computing, EDOCW

作者： M. Riedel B. Schuller D. Mallmann R. Menday A. Streit B. Tweddell M. Shahbaz Memon A. Shiraz Memon B. Demuth T. Lippert D. Snelling S. van den Berghe V. Li M. Drescher A. Geiger G. Ohme A. Vanni C. Cacciari S. Lanzarini P. Malfetti K. Benedyczak P. Bala R. Ratering A. Lukichev Central Institute for Applied Mathematics John von Neumann Institute of Computing Forschungszentrum Julich Julich Germany John von Neumann Inst. for Comput. Forschungszentrum Julich Central Inst. for Appl. Math. Julich Fujitsu Laboratories Limited Hayes UK Solutions for Research T-Systems Corporation Wessling Germany High Performance Computing Department CINECA Bologna Italy Faculty of Mathematics and Computer Science Torun Nicolaus Copernicus University Torun Poland Software and Solutions Group Intel Corporation Bruhl Germany

The UNICORE grid system provides a seamless, secure and intuitive access to distributed grid resources. In recent years, UNICORE 5 is used as a well-tested grid middleware system in production grids (e.g. DEISA, D-Grid) and at many supercomputer centers world-wide. Beyond this production usage, UNICORE serves as a solid basis in many European and International research projects and business scenarios from T-Systems, Philips Research, Intel, Fujitsu and others. To foster ongoing developments in multiple projects, UNICORE is open source under BSD license at SourceForge. More recently, the new Web services-based UNICORE 6 has become available that is based on open standards such as the Web services addressing (WS-A) and the Web services resource framework (WS-RF) and thus conforms to the open grid services architecture (OGSA) of the open grid forum (OGF). In this paper we present the evolution from production UNICORE 5 to the open standards-based UNICORE 6 and its various Web services-based interfaces. It describes the interface integration of emerging open standards such as OGSA-BES and OGSA-RUS and thus provides an overview of UNICORE 6.

关键词： Web services Middleware Service oriented architecture Space technology mathematics Grid computing High performance computing Supercomputers Production facilities Paramagnetic resonance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：