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

Erratum (“A State-Space Analysis for Reconstruction of Goal-Directed Movements Using Neural Signals” Neural Computation, Volume 18, Number 10, pp. 2465–2494)

引用

Neural Computation 2012年第4期24卷 1106-1107页

作者： Iahn Cajigas Lakshminarayan Srinivasan Neuroscience Statistics Research Laboratory Department of Anesthesia and Critical Care Massachusetts General Hospital Charlestown MA 02129 U.S.A. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge MA 02139 U.S.A. and Division of Health Sciences and Technology Massachusetts Institute of Technology Cambridge MA 02139 U.S.A. Neural Signal Processing Laboratory Department of Radiology David Geffen School of Medicine University of California Los Angeles CA 90095 U.S.A.

来源：评论

学校读者我要写书评

暂无评论

A unique vertex deleting algorithm for graph isomorphism

A unique vertex deleting algorithm for graph isomorphism

引用

2011 International Symposium on Image and Data Fusion, ISIDF 2011

作者： Zhang, Baida Tang, Yuhua Wu, Junjie Huang, Linqi National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan 410073 China School of Resources and Safety Engineering Central South University Changsha 410083 China

ISBN: (纸本)9781457709692

Graph isomorphism problem has applications in many fields, such as chemistry, computer science, electronics, and network theory. But the exponential complexity of the algorithm makes the testing is time consuming. In this paper, a new algorithm named Unique Vertex Delete (UVD for short) is presented to speed up the process of isomorphic testing. The main idea of UVD algorithm is deleting vertex continuously to reduce the scale of the problem, and new field is added for each vertex to indicate the information of deleted neighbor vertices. Theoretical analysis and experiments show that the UVD algorithm consistently and significantly outperforms existing state-of-the-art approaches. © 2011 IEEE.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

Efficient approach for repeated patterns mining based on indent shape of HTML documents

Efficient approach for repeated patterns mining based on ind...

引用

3rd International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2011

作者： Zhu, Yanxu Yin, Gang Wang, Huaimin Shi, Dianxi Rao, Xiang Yuan, Lin School of Computer National Laboratory for Parallel and Distributed Processing National University of Defense Technology 410073 Changsha Hunan China College of Electronic Technology Information Engineering University 450004 Zhengzhou Henan China

ISBN: (纸本)9780769545578

Mining of repeated patterns from HTML documents is the key step towards Web-based data mining and knowledge extraction. Many web crawling applications need efficient repeated patterns mining techniques to generate their wrapper automatically. Existing approaches such as tree matching and string matching can detect repeated patterns with high precision, but their performance is still a challenge for practical web crawling applications. In this paper, we propose an efficient approach for mining repeated patterns based on indent shape of HTML document. Indent shape is a novel and simple model of HTML document, in which tandem repeated waves have strong association with the repeated patterns to be detected. By scanning an indent shape with a horizontal indent-line from bottom to top, the tandem repeated waves are identified by filtering the wave segments with low self-similarities. After that the boundary of HTML code corresponding to repeated patterns can be identified, which could be transformed to regular expressions formal-defined easily. Extensive experiments on two practical data sets retrieved from Internet show that our approach achieves high efficiency significantly, and its precision performance is also generally better than the existing approaches. © 2011 IEEE.

关键词： HTML

来源：评论

学校读者我要写书评

暂无评论

Accelerating geospatial analysis on GPUs using CUDA

引用

Journal of Zhejiang University-Science C(computers and Electronics) 2011年第12期12卷 990-999页

作者： Ying-jie XIA Li KUANG Xiu-mei LI Hangzhou Institute of Service Engineering Hangzhou Normal University Hangzhou 310012 China Department of Automation School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai 200240 China Provincial Key Laboratory for Computer Information Processing Technology Sooehow University Soochow 215006 China

Inverse distance weighting (IDW) interpolation and viewshed are two popular algorithms for geospatial *** interpolation assigns geographical values to unknown spatial points using values from a usually scattered set of known points,and viewshed identifies the cells in a spatial raster that can be seen by *** the implementations of both algorithms are available for different scales of input data,the computation for a large-scale domain requires a mass amount of cycles,which limits their *** to the growing popularity of the graphics processing unit (GPU) for general purpose applications,we aim to accelerate geospatial analysis via a GPU based parallel computing *** this paper,we propose a generic methodological framework for geospatial analysis based on GPU and its programming model Compute Unified Device Architecture (CUDA),and explore how to map the inherent parallelism degrees of IDW interpolation and viewshed to the framework,which gives rise to a high computational *** CUDA-based implementations of IDW interpolation and viewshed indicate that the architecture of GPU is suitable for parallelizing the algorithms of geospatial *** results show that the CUDA-based implementations running on GPU can lead to dataset dependent speedups in the range of 13-33-fold for IDW interpolation and 28-925-fold for viewshed *** computation time can be reduced by an order of magnitude compared to classical sequential versions,without losing the accuracy of interpolation and visibility judgment.

关键词： General purpose GPU CUDA Geospatial analysis parallelization

来源：评论

学校读者我要写书评

暂无评论

Context-Aware Scheduling in Wireless Networks with Successive Interference Cancellation

Context-Aware Scheduling in Wireless Networks with Successiv...

引用

IEEE International Conference on Communications Workshops

作者： Shaohe Lv Weihua Zhuang Xiaodong Wang Xingming Zhou National Laboratory of Parallel and Distributed Processing National University of Defense Technology Department of Electrical and Computer Engineering University of Waterloo

ISBN: (纸本)9781612842325

We consider the greedy scheduling based on the physical model in wireless networks with successive interference cancellation (SIC). There are two major stages in a scheduling scheme, link selection (to decide which link is scheduled next) and time slot selection (to deciding which slot is allocated to a given link). Most available schemes take a first-fit policy in the latter and strive to achieve good performance by careful selection of link ordering with respect to interference. Due to the accumulation effect and sequential detection nature of SIC, however, it is difficult to evaluate the interference of a link. As a result, many existing scheduling schemes become less efficient. In this paper, we take a new look on the problem and focus to the time slot selection stage. We define tolerance margin to measure the saturation of a link set and present two heuristic policies: one is to schedule a link to a slot such that the resulting set of links has a maximum tolerance margin;the other is to choose a slot such that the increase of tolerance margin is minimum. Simulation results show that the performance of the proposed schemes is better than the first-fit policy and is close to the optimal solution.

关键词： Link scheduling Successive interference cancellation Physical interference model

来源：评论

学校读者我要写书评

暂无评论

Rate-distortion-complexity optimization for VLSI implementation of integer motion estimation in H.264/AVC encoder

Rate-distortion-complexity optimization for VLSI implementat...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Alireza Aminlou Zahra NajafiHaghi Majid Namaki-Shoushtari Mahmoud Reza Hashemi Multimedia Processing Laboratory School of Electrical and Computer Engineering University of Tehran Iran

In order to accommodate the wide range of applications and the corresponding platforms where the H.264/AVC standard is currently in place, one should be able to optimize the encoder's computational complexity with a careful selection of the coding configuration parameters. Motion estimation is the most time-consuming part of the encoder which constitutes up to 75% of the computational complexity. In this paper, the optimum selection of configuration parameters, including search range, reference frame, degree of down-sampling and number of truncation bits have been analyzed for the VLSI implementation of integer motion estimation in terms of distortion-complexity performance. Furthermore, the optimum parameter sets have been presented for different video sizes and different constraints on computational power.

关键词： Video sequences Motion estimation PSNR Strontium Encoding Complexity theory Bit rate

来源：评论

学校读者我要写书评

暂无评论

Power aware mapping of an RVC encoder on a many-core platform

Power aware mapping of an RVC encoder on a many-core platfor...

引用

IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)

作者： Maryam Moghadas Mahmoud Reza Hashemi School of Electrical and Computer Engineering University of Tehran Iran Multimedia Processing Laboratory (MPL) at the School of Electrical and Computer Engineering University of Tehran Iran

In this paper, a power aware mapping of a reconfigurable video coding (RVC) representation of an H.264/AVC encoder on a heterogeneous many-core platform has been presented. Through this example the benefits of using RVC for flexible and future proof implementations has been highlighted. Furthermore, the low cost modeling of the power efficient mapping algorithm enables dynamic mapping of applications on many-core platforms where power is a concern. Preliminary results indicate that the mapped encoder is much more efficient in terms of power consumption without any significant impact on its performance.

关键词： Hardware Software Video coding Clocks Algorithm design and analysis Frequency domain analysis Transforms

来源：评论

学校读者我要写书评

暂无评论

Universal steganalysis based on local prediction error in wavelet domain

Universal steganalysis based on local prediction error in wa...

引用

7th International Conference on Intelligent Information Hiding and Multimedia Signal processing, IIHMSP 2011

作者： Shojaei-Hashemi, Anahita Mehdipour-Ghazi, Mostafa Ghaemmaghami, Shahrokh Soltanian-Zadeh, Hamid School of Electrical and Computer Engineering College of Engineering University of Tehran Tehran Iran Electronics Research Institute Sharif University of Technology Tehran Iran Control and Intelligent Processing Center of Excellence School of Electrical and Computer Engineering University of Tehran Tehran Iran Image Analysis Laboratory Department of Radiology Henry Ford Health System Detroit MI United States

ISBN: (纸本)9780769545172

A passive universal image steganalysis method is proposed that is shown to be of higher detection accuracy than existing truly blind steganalysis methods including Farid's and the WAM. This is achieved by improving some weaknesses of Farid's steganalysis scheme in feature extraction, that is, instead of deriving an over-determined equation system for each sub band of the wavelet decomposition, the sub bands are divided into overlapping blocks and an over-determined equation system is constructed for each block. To guarantee the existence of finite answers, the over-determined equation systems are solved in a way different from Farid's by using Moore-Penrose pseudo-inverse concept. Further improvement to the performance is achieved by adding diagonal directions and increasing the number of moments. The comparative evaluations confirm the superiority of the proposed method over prevalent blind steganalysis schemes. © 2011 IEEE.

关键词： Wavelet decomposition

来源：评论

学校读者我要写书评

暂无评论

Universal image steganalysis against spatial-domain steganography based on energy distribution of singular values

Universal image steganalysis against spatial-domain steganog...

引用

7th International Conference on Information Technology and Application, ICITA 2011

作者： Shojaei-Hashemi, Anahita Soltanian-Zadeh, Hamid Ghaemmagham, Shahrokh Kamarei, Mahmoud School of Electrical and Computer Engineering College of Engineering University of Tehran Tehran Iran Control and Intelligent Processing Center of Excellence School of Electrical and Computer Engineering University of Tehran Tehran Iran Image Analysis Laboratory Department of Radiology Henry Ford Health System Detroit MI United States Electronics Research Institute Sharif University of Technology Tehran Iran

ISBN: (纸本)9780980326741

A passive image steganalysis method is proposed to universally detect spatial-domain steganography schemes. It is shown to have better performance than universal steganalyzers known to be powerful in spatial domain, including the WFLogSv and the WAM methods. This level of accuracy is the result of improving the WFLogSv steganalyzer by considering a more comprehensive relationship between the singular values of each image block and the linear correlation of the rows and the columns. That is, instead of the closeness of the lower singular values to zero, the energy distribution of the singular values is investigated. An innovative measure is proposed for this investigation, which is inspired from arithmetic mean-geometric mean inequality. Experimental results confirm the supremacy of the proposed steganalysis scheme over its counterparts.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Bounds on the Throughput Performance of PU~2RC

Bounds on the Throughput Performance of PU~2RC

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications

作者： Sayed Ata Sattarzadeh Ali Olfat Signal Processing and Communication Systems laboratory School of Electrical and Computer Engineering University of Tehran

ISBN: (纸本)9781457713460

We consider the multiple-input multiple-output broadcast channels and the per user unitary and rate control (PU~2RC) transmission and we characterize the performance of this transmission scheme for arbitrary number of active users in the network. In this paper we first introduce the method of computing the probability distribution of the feedback SINR in the PU~2RC and will show that unlike the common assumption, the maximum of SINR in the different orthogonal sets are not independent of each other. In the next step we introduce a method to evaluate an upper and lower bound over the achievable rates in the PU~2RC transmission scheme that can characterize its throughput performance and the results can be used in the optimal feedback designs and Multimode switching.

关键词： Broadcast channels Limited feedback MIMO ORBF PU~2RC

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：