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

IEEE International Nanoelectronics conference (INEC)

作者： Hailiang Zhou Minxuan Zhang Yue Hao National Laboratory of Parallel and Distributed processing School of Computer National University of Defense Technology Changsha Hunan China School of Microelectronics Xidian University Xi'an Shanxi China

ISBN: (纸本)9781424435432;9781424435449

The effect of quantum capacitance (QC) on the switching speed in T-CNFETs (Tunneling Carbon Nanotube Field Effect Transistors) is investigated with simulation using NEGF (Non-Equilibrium Green's Function) formalism. Firstly, based on the analytical expression of SS, a quantitative study of the source/drain leads doping level is made to obtain an averaged inverse subthreshold slope(SS) as small as possible. And then the impact of QC on the gate control, thus on SS, is studied. Lastly, for the first time, approaches for restricting the impacts of QC are investigated, such as tuning the drain-source bias condition or CNT diameter which are governed by the analytical expression presented at the end of this paper. The modeling results reveal that the QC in T-CNFET has a negative impact on both the SS and on-current, and such impact could be restricted effectively with a proper choice of drain-source voltage and CNT chirality.

关键词： Quantum capacitance Doping Voltage Semiconductor process modeling Electrons Tunneling CNTFETs Green's function methods Iron PIN photodiodes

来源：评论

学校读者我要写书评

暂无评论

Gaussian sampling by local perturbations 10

Gaussian sampling by local perturbations

引用

Annual conference on Neural Information processing Systems

作者： George Papandreou Alan L. Yuille Department of Statistics University of California Los Angeles Depts. of Statistics Computer Science & Psychology University of California Los Angeles

ISBN: (纸本)9781617823800

We present a technique for exact simulation of Gaussian Markov random fields (GMRFs), which can be interpreted as locally injecting noise to each Gaussian factor independently, followed by computing the mean/mode of the perturbed GMRF. Coupled with standard iterative techniques for the solution of symmetric positive definite systems, this yields a very efficient sampling algorithm with essentially linear complexity in terms of speed and memory requirements, well suited to extremely large scale probabilistic models. Apart from synthesizing data under a Gaussian model, the proposed technique directly leads to an efficient unbiased estimator of marginal variances. Beyond Gaussian models, the proposed algorithm is also very useful for handling highly non-Gaussian continuously-valued MRFs such as those arising in statistical image modeling or in the first layer of deep belief networks describing real-valued data, where the non-quadratic potentials coupling different sites can be represented as finite or infinite mixtures of Gaus-sians with the help of local or distributed latent mixture assignment variables. The Bayesian treatment of such models most naturally involves a block Gibbs sampler which alternately draws samples of the conditionally independent latent mixture assignments and the conditionally multivariate Gaussian continuous vector and we show that it can directly benefit from the proposed methods.

关键词： Gauss Bayesian networks statistical image model linear complexity memory requirements Sampling

来源：评论

学校读者我要写书评

暂无评论

Efficient Collision Detection and Physics-Based Deformation for Haptic Simulation with Local Spherical Hash

Efficient Collision Detection and Physics-Based Deformation ...

引用

Brazilian Symposium on Computer Graphics and image processing (SIBGRAPI)

作者： Marilena Maule Anderson Maciel Luciana Nedel Instituto de Informática-INF Universidade Federal do Rio Grande do Sul Porto Alegre Brazil

While real time computer graphics rely on a frame rate of 30 iterations per second to fool the eye and render smooth motion transitions, computer haptics deals with the sense of touch, which requires a higher rate of around 1kHz to avoid discontinuities. The use of haptics on interactive applications as surgical simulations or games, for instance, can highly improve the user experience, and the sense of presence. However, its use in complex simulations involving realistic rendering, deformable objects and collision detection requires the development of very performing algorithms. This paper presents an implementation of mass-spring system adapted to CUDA implementation, and a novel method for collision detection in haptic update rate. Important aspects of the port to parallel programming and the GPU architecture are addressed, as for example, strategy and frequency of memory access. A quantitative experiment is also presented to evaluate our methods capability and scalability.

关键词： Haptic interfaces Graphics processing unit Indexes Computational modeling Deformable models Adaptation model Springs

来源：评论

学校读者我要写书评

暂无评论

Performance of reconstruction and processing techniques for dense full-spectrum x-ray computed tomography

Performance of reconstruction and processing techniques for ...

引用

IEEE Symposium on Nuclear Science (NSS/MIC)

作者： Brian J. Gonzales David Lalush Joint Department of Biomedical Engineering University of North Carolina USA

We have recently developed a novel x-ray computed tomography (CT) system capable of dense spectral measurements along the energy axis using a photon-counting single-pixel detector. The reconstructions have high energy axis resolution but suffer from noise due to dividing the total x-ray counts into multiple energy bins. We have recently developed two methods to suppress the noise along the energy axis: a Penalized Weighted Least Squares Algorithm (PWLS) for iterative reconstruction along the energy axis and an Eigenvector Filtering Algorithm for noise suppression in the energy domain using a set of basis functions. The two methods are briefly presented. We present a detailed comparison of the two algorithms focusing on the noise-energy resolution relationship in both methods, comparing the signal-to-noise ratio (SNR) ratio for both methods. Results show that the SNR is distributed differently across the energy spectrum for the two methods. We investigate combining the two methods forming a hybrid PWLS-Eigenvector method. The hybrid method is shown to take advantage of both methods' SNR improvements. We conclude that both algorithms offer significant noise suppression while preserving key energy axis data.

关键词： Attenuation Noise Materials image reconstruction Absorption Pixel X-ray imaging

来源：评论

学校读者我要写书评

暂无评论

A REVERSIBLE-JUMP MCMC ALGORITHM FOR ESTIMATING THE NUMBER OF ENDMEMBERS IN THE NORMAL COMPOSITIONAL MODEL. APPLICATION TO THE UNMIXING OF HYPERSPECTRAL imageS.

A REVERSIBLE-JUMP MCMC ALGORITHM FOR ESTIMATING THE NUMBER O...

引用

IEEE International conference on Acoustics, Speech, and Signal processing

作者： Olivier Eches Nicolas Dobigeon Jean-Yves Tourneret University of Toulouse IRIT/INP-ENSEEIHT/TeSA 2 rue Camichel 31071 Toulouse cedex 7 France

ISBN: (纸本)9781424442959

In this paper, we address the problem of unmixing hyperspectral images in a semi-supervised framework using the normal compositional model recently introduced by Eismann and Stein. Each pixel of the image is modeled as a linear combination of random endmembers. More precisely, endmembers are modeled as Gaussian vectors whose means belong to a known spectral library. This paper proposes to estimate the number of endmembers involved in the mixture, as well as the mixture coefficients (referred to as abundances) using a trans-dimensional algorithm. Appropriate prior distributions are assigned to the abundance vector (to satisfy constraints inherent to hyperspectral imagery), the noise variance and the number of components involved in the mixture model. The computational complexity of the resulting posterior distribution is alleviated by constructing an hybrid Gibbs algorithm which generates samples distributed according to this posterior distribution. As the number of endmembers is unknown, the sampler has to jump between spaces of different dimensions. This is achieved by a reversible jump Markov chain Monte Carlo method that allows one to handle the model order selection problem. The performance of the proposed methodology is evaluated thanks to simulations conducted on synthetic data.

关键词： Bayesian inference Monte Carlo methods reversible jump spectral unmixing hyperspectral images normal compositional model hyperspectral imagery Monte Carlo technique Markov chain monte carlo methods Bayesian inference Posterior distribution images Tea jump

来源：评论

学校读者我要写书评

暂无评论

Kernel Fusion: An Effective Method for Better Power Efficiency on Multithreaded GPU

Kernel Fusion: An Effective Method for Better Power Efficien...

引用

IEEE/ACM Int'l conference on & Int'l conference on Cyber, Physical and Social Computing (CPSCom) Green Computing and Communications (GreenCom)

作者： Guibin Wang YiSong Lin Wei Yi National Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781424497799

As one of the most popular accelerators, Graphics processing Unit (GPU) has demonstrated high computing power in several application fields. On the other hand, GPU also produces high power consumption and has been one of the most largest power consumers in desktop and supercomputer systems. However, software power optimization method targeted for GPU has not been well studied. In this work, we propose kernel fusion method to reduce energy consumption and improve power efficiency on GPU architecture. Through fusing two or more independent kernels, kernel fusion method achieves higher utilization and much more balanced demand for hardware resources, which provides much more potential for power optimization, such as dynamic voltage and frequency scaling (DVFS). Basing on the CUDA programming model, this paper also gives several different fusion methods targeted for different situations. In order to make judicious fusion strategy, we deduce the process of fusing multiple independent kernels as a dynamic programming problem, which could be well solved with many existing tools and be simply embedded into compiler or runtime system. To reduce the overhead introduced by kernel fusion, we also propose effective method to reduce the usage of shared memory and coordinate the thread space of the kernels to be fused. Detailed experimental evaluation validates that the proposed kernel fusion method could reduce energy consumption without performance loss for several typical kernels.

关键词： Kernel Instruction sets Graphics processing unit Energy consumption Hardware Mathematical model Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Feature Preserving Consolidation for Unorganized Point Clouds

Feature Preserving Consolidation for Unorganized Point Cloud...

引用

The 2010 IEEE International conference on Progress in Informatics and Computing

作者： Bao Li,Wei Jiang,Zhiquan Cheng,Gang Dang,Shiyao Jin National Laboratory for parallel and distributed processing,School of Computer National University of Defense Technology Changsha,China

We introduce a novel method for the consolidation of unorganized point clouds with noise,outliers,non-uniformities as well as sharp *** method is feature preserving,in the sense that given an initial estimation of normal,it is able to recover the sharp features contained in the original geometric data which are usually contaminated during the acquisition. The key ingredient of our approach is a weighting term from normal space as an effective complement to the recently proposed consolidation ***,a normal mollification step is employed during the consolidation to get normal information respecting sharp features besides the position of each point. Experiments on both synthetic and real-world scanned models validate the ability of our approach in producing denoised, evenly distributed and feature preserving point clouds,which are preferred by most surface reconstruction methods.

关键词： feature preserving consolidation point clouds sharp features

来源：评论

学校读者我要写书评

暂无评论

Quantifying the distribution of probes between subcellular locations using unsupervised pattern unmixing

引用

BIOINFORMATICS 2010年第12期26卷 i7-i12页

作者： Coelho, Luis Pedro Peng, Tao Murphy, Robert F. Carnegie Mellon Univ Lane Ctr Computat Biol Pittsburgh PA 15213 USA Carnegie Mellon Univ Ctr Bioimage informat Pittsburgh PA 15213 USA Carnegie Mellon Univ Joint Carnegie Mellon Univ Univ Pittsburgh Ph D Program Computat Biol Pittsburgh PA 15213 USA Carnegie Mellon Univ Dept Biomed Engn Pittsburgh PA 15213 USA Carnegie Mellon Univ Dept Biol Sci Pittsburgh PA 15213 USA Carnegie Mellon Univ Dept Machine Learning Pittsburgh PA 15213 USA Univ Freiburg Freiburg Inst Adv Studies D-79104 Freiburg Germany

Motivation: Proteins exhibit complex subcellular distributions, which may include localizing in more than one organelle and varying in location depending on the cell physiology. Estimating the amount of protein distributed in each subcellular location is essential for quantitative understanding and modeling of protein dynamics and how they affect cell behaviors. We have previously described automated methods using fluorescent microscope images to determine the fractions of protein fluorescence in various subcellular locations when the basic locations in which a protein can be present are known. As this set of basic locations may be unknown (especially for studies on a proteome-wide scale), we here describe unsupervised methods to identify the fundamental patterns from images of mixed patterns and estimate the fractional composition of them. methods: We developed two approaches to the problem, both based on identifying types of objects present in images and representing patterns by frequencies of those object types. One is a basis pursuit method (which is based on a linear mixture model), and the other is based on latent Dirichlet allocation (LDA). For testing both approaches, we used images previously acquired for testing supervised unmixing methods. These images were of cells labeled with various combinations of two organelle-specific probes that had the same fluorescent properties to simulate mixed patterns of subcellular location. Results: We achieved 0.80 and 0.91 correlation between estimated and underlying fractions of the two probes (fundamental patterns) with basis pursuit and LDA approaches, respectively, indicating that our methods can unmix the complex subcellular distribution with reasonably high accuracy.

关键词： Algorithms Fluorescent Dyes/analysis image processing, Computer-Assisted/methods Proteins/analysis Proteins/chemistry Subcellular Fractions/metabolism Subcellular Fractions/ultrastructure

来源：评论

学校读者我要写书评

暂无评论

Matrix representation of spiking neural P systems

Matrix representation of spiking neural P systems

引用

11th International conference on Membrane Computing, CMC 2010

作者： Zeng, Xiangxiang Adorna, Henry Martínez-Del-Amor, Miguel Ángel Pan, Linqiang Pérez-Jiménez, Mario J. Image Processing and Intelligent Control Key Laboratory of Education Ministry Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 Hubei China University of the Philippines Diliman 1101 Quezon City Philippines Research Group on Natural Computing Department of Computer Science and Artificial Intelligence University of Sevilla Avda. Reina Mercedes s/n 41012 Sevilla Spain

ISBN: (纸本)3642181228

Spiking neural P systems (SN P systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes. In this work, a discrete structure representation of SN P systems with extended rules and without delay is proposed. Specifically, matrices are used to represent SN P systems. In order to represent the computations of SN P systems by matrices, configuration vectors are defined to monitor the number of spikes in each neuron at any given configuration;transition net gain vectors are also introduced to quantify the total amount of spikes consumed and produced after the chosen rules are applied. Nondeterminism of the systems is assured by a set of spiking transition vectors that could be used at any given time during the computation. With such matrix representation, it is quite convenient to determine the next configuration from a given configuration, since it involves only multiplication and addition of matrices after deciding the spiking transition vector. © 2010 Springer-Verlag.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

H.264 Color Components Video Decoding parallelization on Multi-core Processors

H.264 Color Components Video Decoding Parallelization on Mul...

引用

Euromicro Symposium on Digital System Design

作者： Elias Baaklini Hassan Sbeity Smail Niar Nouhad Amaneddine Department of Information Technology and Computing Arab Open University Beirut Lebanon LAMIH University of Valenciennes France

Multiprocessor-system-on-a-chip will be the dominating architecture in embedded systems as it provides an increase in concurrency improving the performance of the system rather than increasing the clock speed which affects the power consumption of the system. However, concurrency needs to be exploited in order to improve the system performance in the different applications'environments. The new emerging H.264/AVC coding standard is designed to cover a wide range of applications (real-time conversational services such as videoconferencing, video phone, etc.). It has many new features that require complex computations compared to previous video coding standards. This coding standard will be a challenging workload for future MPSoC embedded systems. Exploiting the different levels of parallelism for video codec applications can be done at the data level, the functional level, or both simultaneously. Our intention in this paper is to explore the natural existent parallelism in the H.264 decoder software itself without any modification to the encoder phase, rather than forcing parallelization techniques. Our novel idea is based on the fact that the H.264 decoder decodes the luminance and chrominance signals separately, but the decoder is implemented in a way to decode them in series. Our approach is to execute the different decoding phases of the luminance signals in parallel to the chrominance signals. Using two cores to decode the luma and the chroma signals in parallel gives a gain of 15-20% of the decoding processing time and combining them the functional pipelined implementation over four cores or more, the gain can reach 60% compared to the current sequential execution.

关键词： Decoding image color analysis Program processors Benchmark testing Motion compensation Entropy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：