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

PPLSA: Parallel probabilistic latent semantic analysis based on MapReduce 1

7th IFIP International Conference on Intelligent Information processing, IIP 2012

作者： Li, Ning Zhuang, Fuzhen He, Qing Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China Graduate University Chinese Academy of Sciences Beijing China Key Lab. of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding China

ISBN: (数字)9783642328916

ISBN: (纸本)9783642328909

PLSA(Probabilistic Latent Semantic Analysis) is a popular topic modeling technique for exploring document collections. Due to the increasing prevalence of large datasets, there is a need to improve the scalab.lity of computation in PLSA. In this paper, we propose a parallel PLSA algorithm called PPLSA to accommodate large corpus collections in the MapReduce framework. Our solution efficiently distributes computation and is relatively simple to implement. © 2012 IFIP International Federation for Information processing.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

An efficient implementation of double precision 1-D FFT for GPUs Using CUDA

引用

Journal of Information and Computational Science 2012年第2期9卷 387-394页

作者： Liu, Yanjun Guo, Licai Luo, Bin Zhang, Xingyi School of Computer Science and Technology Anhui University Hefei 230039 China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei 230039 China School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China

Fast Fourier Transform (FFT) is a well known and widely used tool in many scientific and engineering fields. CUFFT, which is the NVIDIA's FFT library included in the CUDA toolkit, supports double precision FFTs. However, the implementation of CUFFT is not very efficient. In this paper, we implement an efficient double-precision Cooley-tukey algorithm for GPUs using CUDA. Some programming techniques are employed to exploit the hardware characteristics. These techniques include on-chip shared memory utilization, removing redundant computation, and coalescing the global memory access. Experiments show that the performance of our 1-D FFT is as fast as CUFFT. Furthermore, the performance of our FFT implementation is more than twice faster than CUFFT for small input sizes. Copyright © 2012 Binary Information Press.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

On connection between the convolutive and ordinary nonnegative matrix factorizations

On connection between the convolutive and ordinary nonnegati...

引用

10th International Conference on Latent Variable Analysis and signal Separation, LVA/ICA 2012

作者： Phan, Anh Huy Cichocki, Andrzej Tichavský, Petr Koldovský, Zbyněk Lab. for Advanced Brain Signal Processing Brain Science Institute - RIKEN Japan Institute of Information Theory and Automation Prague Czech Republic Faculty of Mechatronics Informatics and Interdisciplinary Studies Technical University of Liberec Studentská 2 461 17 Liberec Czech Republic EE Dept. Warsaw University of Technology Systems Research Institute Poland

ISBN: (纸本)9783642285509

A connection between the convolutive nonnegative matrix factorization (NMF) and the conventional NMF has been established. As a result, we can convey arbitrary alternating update rules for NMF to update rules for CNMF. In order to illustrate the novel derivation method, a multiplicative algorithm and a new ALS algorithm for CNMF are derived. The experiments confirm validity and high performance of our method and of the proposed algorithm. © 2012 Springer-Verlag.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Generalized geometry-based optimal power control in wireless networks

Generalized geometry-based optimal power control in wireless...

引用

2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2012

作者： Wang, Wei Shin, Kang G. Zhang, Zhaoyang Wang, Wenbo Peng, Tao Department of Information Science and Electronic Engineering Zhejiang Provincial Key Laboratory of Information Network Technology Zhejiang University Hangzhou 310027 China Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2121 United States Wireless Signal Processing and Networking Lab Beijing University of Posts and Telecommunications Beijing 100876 China

ISBN: (纸本)9781467319058

Geometry-based optimal power control was proposed in [14] to transform the power-control problem to a new geometrical problem on the position relationship between a line and some points. This scheme provides a novel visual perspective and lowers the complexity of optimization. We generalize this scheme to a larger class of power-control optimization problems so as to maximize the network utility with multiple average and peak power constraints in wireless networks. To facilitate the handling of the geometrical model, we define a subset of geometrical models with specified characteristics, called a regular geometrical model, and derive the type of power-control problems eligible for the regular geometrical model. For such a type of problems, two strategies are proposed for the construction of the regular geometrical model. Utilizing geometrical properties, we propose a novel geometry-based optimization scheme for the general power-control problem. Its computational complexity is significantly lower than the conventional algorithms. We also provide a further discussion on irregular geometrical model cases. Finally, we provide two examples of deploying the proposed geometry-based power-control scheme. © 2012 IEEE.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Parallel implementation of apriori algorithm based on MapReduce

Parallel implementation of apriori algorithm based on MapRed...

引用

13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, SNPD 2012

作者： Li, Ning Zeng, Li He, Qing Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University Chinese Academy of Sciences Beijing 100139 China Key Lab. of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding 071002 Hebei China

ISBN: (纸本)9780769547619

Searching frequent patterns in transactional databases is considered as one of the most important data mining problems and Apriori is one of the typical algorithms for this task. Developing fast and efficient algorithms that can handle large volumes of data becomes a challenging task due to the large databases. In this paper, we implement a parallel Apriori algorithm based on MapReduce, which is a framework for processing huge datasets on certain kinds of distributable problems using a large number of computers (nodes). The experimental results demonstrate that the proposed algorithm can scale well and efficiently process large datasets on commodity hardware. © 2012 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

New Approach on TDL-based Wideband Antenna Beamforming for Radio Sources Close to the Endfire

New Approach on TDL-based Wideband Antenna Beamforming for R...

引用

Iranian Conference on Electrical Engineering

作者： Shahriar Shirvani Moghaddam Nasrollah Solgi Digital Communications Signal Processing Research Lab. Faculty of Electrical and Computer Engineering Shahid Rajaee Teacher Training University (SRTTU) M.Sc. Student of Faculty of Electrical and Computer Engineering Shahid Rajaee TeacherTraining University (SRTTU)

ISBN: (纸本)9781467311496

Uniform linear array (ULA)-based TDL structure offers good performance metrics when the signal sources are located at the middle angles and it shows poor performance when the signal sources are close to the array endflre. In this paper, a new approach is proposed which offers higher performance and desired beamforming on TDL structure when the wideband uncorrelated radio sources are close to the array endfire. This new TDL structure is based on Shirvani-Akbari array (SAA). Numerical results of this investigation show that both ULA-based and SAA-based TDL structures offer the same performance where the signals of interest located at middle angles. But, where the signals are close to the array endfire the SAA-based TDL structure has much higher performance. The array factor (AF) in center frequency for different angles and three well-known performance metrics, normalized mean square error (NMSE), signal to interference plus noise ratio (SINK) and bit error rate (BER) are evaluated for both ULA-based and SAA-based TDL structures.

关键词： Beamforming Array endfire ULA SAA TDL

来源：评论

学校读者我要写书评

暂无评论

Fast Template Matching with Partial Skipping Using Sub-template

Fast Template Matching with Partial Skipping Using Sub-templ...

引用

International Conference on Audio, Language and Image processing

作者： Qiao Zhang Huijie Gao Zhen Kang State Key Lab. of Multi-spectral Information Processing Technology Institute for Pattern Recognition and Artificial Intelligence School of Mathematic & Computer Science Wuhan Polytechnic University

ISBN: (纸本)9781467301732

This paper presents a new fast template matching method with partial skipping using sub-template. In this method, we use sub-template to search point by point in the current searched window, and compare every SAD with threshold, if some SAD exceeds the threshold, set the new threshold equal to this SAD value and this point is one potential optimization location, when all points in the current window are compared, we will get a minimum value and a optimization location, then skip the other points whose SAD is not the minimum value. In other words, the searching step is that template size subtracts the sub-template size, and we set the next threshold equal to the current optimization SAD value, we update the threshold and the optimal point until the end of the searched image like this, then will find the global minimum points and its SAD value. Experimental results show that the proposed method is near one hundred times faster than the conventional template match method.

关键词： Computational efficiency Prediction algorithms Search problems Accuracy Correlation signal processing algorithms Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Two-dimensional cancelab.e biometric scheme

Two-dimensional cancelable biometric scheme

引用

2012 International Conference on Wavelet Analysis and Pattern Recognition, ICWAPR 2012

作者： Leng, Lu Zhang, Shuai Bi, Xue Khan, Muhammad Khurram Sichuan Province Key Lab. of Signal and Information Processing Southwest Jiaotong University Chengdu 610031 China Information Center Integrated Management Department CSR Sifang Co. Ltd. Qingdao 266000 China School of Information Science and Technology Southwest Jiaotong University Chengdu 610031 China Center of Excellence in Information Assurance King Saud University Riyadh Saudi Arabia

ISBN: (纸本)9781467315326

Most existing cancelab.e biometrie frameworks are based on one-dimensional (ID) vectors rather than two-dimensional (2D) images or feature matrices. 2D cancelab.e biometrics, generated directly from images of feature matrices, were proposed based on two-directional two-dimensional fusion sparse random projection ((2D)2FSRP) and two-directional two-dimensional plus sparse random projection ((2D)2PSRP), so the storage and computational costs are both reduced. (2D)2FSRP methods play complementary advantages of 2D sparse random projection (2DSRP) and two-dimensional principal component analysis (2DPCA) or two-dimensional linear discriminant analysis (2DLDA), but they do not have ideal performance when all users have different tokens, so (2D)2PSRP methods were proposed to generate 2D cancelab.e face and palmprint. 2D cancelab.e face and palmprint schemes, which satisfactorily meet the requirements of cancelab.e biometrie, were determined by the experimental results and analysis. © 2012 IEEE.

关键词： One dimensional

来源：评论

学校读者我要写书评

暂无评论

Accurate wireless indoor position estimation by using hybrid TDOA/RSS algorithm

Accurate wireless indoor position estimation by using hybrid...

引用

IEEE International Conference on Vehicular Electronics and Safety (ICVES)

作者： Fadhel M. Ghannouchi Donglin Wang Smita Tiwari IRadio lab Department of Electrical and Computer Engineering University of Calgary Calgary Canada Green Radio and Signal Processing (GRASP) Group Department of Electrical and Computer Engineering New York Institute of Technology China University of Edinburgh UK

Location Determination in an indoor environment is a challenge being faced by wireless industries. The concept of the indoor geolocation was established in order to provide the user's location inside buildings during an emergency where global navigation satellite system (GNSS) services are not availab.e. Keeping public safety in mind, it is important not only to estimate the position, but also to provide a high level of reliability. The paper presents practical results and issues related to the accuracy of an indoor geolocation system, which uses a wideband code division multiple access (WCDMA) signal at a 2.45 GHz carrier frequency. This experiment employs a hybrid Time Difference Of Arrival (TDOA) / Received signal Strength (RSS) algorithm and a TDOA only algorithm. Practical results indicate that the positioning performance is improved by using the hybrid TDOA/RSS algorithm as compared to the TDOA only algorithm.

关键词： Estimation Accuracy Wireless communication computers Propagation losses Multiaccess communication Transmitters

来源：评论

学校读者我要写书评

暂无评论

Iterative scatter correction for digital tomosynthesis using composition ratio update and GPU based Monte Carlo simulation

Iterative scatter correction for digital tomosynthesis using...

引用

IEEE International Symposium on Biomedical Imaging

作者： Kyung Sang Kim Young Hoon Seong Jongha Lee Kwang Eun Jang Jong Chul Ye Bio Imaging & Signal Processing Lab. Dept. of Bio& Brain Engineering KAIST Daejon Republic of Korea Samsung Advanced Institute of Technology Samsung Electronics Yongin Kyunggi Republic of Korea

ISBN: (纸本)9781457718571

In digital tomosynthesis (DTS), accurate scatter correction is often necessary for quantitative analysis. This is especially important because low energy x-ray of 10-40 keV, which is widely used for the breast imaging to enhance the contrast between adipose and glandular, results in high scatter fraction. In this paper, we propose an iterative scatter correction for digital tomopsynthesis using composition ratio update and GPU based Monte Carlo simulation (MCS). One of the technical difficulty in scatter estimation using MCS for tomosynthesis is that accurate segmentation of 3D volume is very difficult due to the low resolution of the reconstruction object. Thus, an intermediate surrogate object is introduced to represent composition ratio between adipose and glandular. We show that the composition ratio can be calculated using average attenuation coefficients. Another technical challenge is extremely high computational cost of MCS. We overcome this using GPU based ultra-fast MCS. Our results demonstrate that our iterative scatter correction using composition ratio update is indeed effective in improving the quality of the reconstruction object in a reasonable time frame.

关键词： Graphics processing unit Attenuation Photonics Image reconstruction Monte Carlo methods Materials Phantoms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：