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

1st International Conference on Information Science and Engineering, ICISE2009

作者： Xuan, Shan-Li Liang, Dong Zhu, Ming Fan, Yi Zheng Wang, Nian Key Lab. Intelligent Computing and Signal Ministry of Education Anhui University Hefei 230039 China School of Mathematical Sciences Anhui University Hefei 230039 China School of Computer and Information HeFei University of Technology Hefei 230009 China

ISBN: (纸本)9780769538877

Based on the minimize spanning tree and Fiedler vector, a new feature matching algorithm is proposed in this paper. Firstly, a weighted complete graph is constructed with the feature points of each image respectively, then search the minimal spanning tree in each complete graph. Secondly, perform spectral decomposition on the Gaussian-weighted Laplace matrix of the minimize spanning tree respectively, and divide the feature points into several different sets based on the vector(Fiedler vector) corresponding to the second smallest eigenvalue of Laplace matrix , then the corresponding relation between sets is obtained. And construct Gaussian-weighted Laplace matrices between the corresponding sets, then submit the matrices to spectral decomposition. Finally, complete the feature matching by constructing matching matrix with eigenvalues and eigenvectors. Experiment results indicate that the algorithm has a high accuracy. ©2009 IEEE.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

Method with the center of graph for point pattern matching

Method with the center of graph for point pattern matching

引用

9th International Conference on Electronic Measurement and Instruments, ICEMI 2009

作者： Xuan, Shanli Liang, Dong Zhu, Ming Fan, Yizheng Wang, Nian Key Lab. Intelligent Computing and Signal Ministry of Education Anhui University Hefei 230039 China School of Computer and Information HeFei University of Technology Hefei 230009 China School of Mathematical Sciences Anhui University Hefei 230039 China

ISBN: (纸本)9781424438624

Based on the center of graph, a point pattern feature matching method is proposed here. Firstly, a weighted complete graph is constructed with the feature points of each image, and then the center of each graph is found respectively. With the vertex sets of the centers, the feature points are divided into several layers according to the distance from the center, and then the corresponding relation between layers is obtained. Secondly, the Gaussian-weighted Laplace matrices are constructed between the corresponding layers. And then the matrices are submitted to singular-value decomposition(SVD). Finally, represent the feature points with eigenvectors obtained from SVD, and then construct matching matrix to obtain the final matching results. Synthetic data and real world data both indicate that our method has a higher accuracy than theirs, and it can deal with the matching problem with more feature points effectively. ©2009 IEEE.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Generating high-coverage semantic orientation lexicons from overtly marked words and a thesaurus

Generating high-coverage semantic orientation lexicons from ...

引用

2009 Conference on Empirical Methods in Natural Language processing, EMNLP 2009, Held in Conjunction with ACL-IJCNLP 2009

作者： Mohammad, Saif Dunne, Cody Dorr, Bonnie Laboratory for Computational Linguistics and Information Processing University of Maryland United States Human-Computer Interaction Lab. University of Maryland United States Institute for Advanced Computer Studies University of Maryland United States Department of Computer Science University of Maryland United States Human Language Technology Center of Excellence United States

Sentiment analysis often relies on a semantic orientation lexicon of positive and negative words. A number of approaches have been proposed for creating such lexicons, but they tend to be computationally expensive, and usually rely on significant manual annotation and large corpora. Most of these methods use WordNet. In contrast, we propose a simple approach to generate a high-coverage semantic orientation lexicon, which includes both individual words and multi-word expressions, using only a Roget-like thesaurus and a handful of affixes. Further, the lexicon has properties that support the Polyanna Hypothesis. Using the General Inquirer as gold standard, we show that our lexicon has 14 percentage points more correct entries than the leading WordNet-based high-coverage lexicon (SentiWordNet). In an extrinsic evaluation, we obtain significantly higher performance in determining phrase polarity using our thesaurus-based lexicon than with any other. Additionally, we explore the use of visualization techniques to gain insight into the our algorithm beyond the evaluations mentioned above. © 2009 ACL and AFNLP.

关键词： Thesauri

来源：评论

学校读者我要写书评

暂无评论

Towards keyword search over relational databases in DHT networks

Towards keyword search over relational databases in DHT netw...

引用

15th International Conference on Parallel and Distributed Systems, ICPADS '09

作者： Yu, Jian Guan, Jihong Xu, Jianliang Zhou, Shuigeng Department of Computer Science and Technology Tongji University Shanghai 201804 China Department of Computer Science Hong Kong Baptist University Hong Kong Hong Kong Shanghai Key Lab. of Intelligent Information Processing Fudan University Shanghai 200433 China School of Computer Science Fudan University Shanghai 200433 China

ISBN: (纸本)9780769539003

Recent research has shown that keyword search is a friendly and potentially effective way to retrieve information of interest over relational databases. Existing work has generally focused on implementing keyword search in centralized databases. This paper addresses keyword search over distributed databases. We adopts distributed hash tables (DHTs) - a peer-to-peer inspired overlay network technology - as the infrastructure to implement keyword search over relational databases. For this end, we combine IR-based ranking techniques with a P2P-based indexing strategy, and propose an effective approach. Extensive experiments over real-world datasets show that our approach is effective and efficient. © 2009 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Assessment of depth of anesthesia using principal component analysis

引用

Journal of Biomedical Science and Engineering 2009年第1期2卷 9-15页

作者： Mina Taheri Behzad Ahmadi Rassoul Amirfattahi Mojtaba Mansouri Digital Signal Processing Research Lab Department of Electrical and Computer Engineering Isfahan University of Technology Isfahan 84156-83111 Iran Medical Image and Signal Processing Research Center Isfahan University of Medical Sciences Isfahan Iran. Correspondence should be addressed to Mina Taheri

A new approach to estimating level of uncon-sciousness based on Principal Component Analysis (PCA) is proposed. The Electroen-cephalogram (EEG) data was captured in both Intensive Care Unit (ICU) and operating room, using different anesthetic drugs. Assuming the central nervous system as a 20-tuple source, window length of 20 seconds is applied to EEG. The mentioned window is considered as 20 nonoverlapping mixed-signals (epoch). PCA algorithm is applied to these epochs, and larg-est remaining eigenvalue (LRE) and smallest remaining eigenvalue (SRE) were extracted. Correlation between extracted parameters (LRE and SRE) and depth of anesthesia (DOA) was measured using Prediction probability (PK). The results show the superiority of SRE than LRE in predicting DOA in the case of ICU and isoflurane, and the slight superiority of LRE than SRE in propofol induction. Finally, a mixture model containing both LRE and SRE could predict DOA as well as Relative Beta Ratio (RBR), which expresses the high capability of the proposed PCA based method in estimating DOA.

关键词： Bispectral Index Depth of Anesthesia Eignevalue Decomposition Principal Component Analysis

来源：评论

学校读者我要写书评

暂无评论

A low-resource public-key identification scheme for RFID tags and sensor nodes 09

A low-resource public-key identification scheme for RFID tag...

引用

2nd ACM Conference on Wireless Network Security, WiSec'09

作者： Oren, Yossef Feldhofer, Martin Computer and Network Security Lab. School of Electrical Engineering Tel-Aviv University P.O. Box 39040 Tel-Aviv 69978 Israel Institute for Applied Information Processing and Communications Graz University of Technology Inffeldgasse 16a 8010 Graz Austria

ISBN: (纸本)9781605584607

We revisit a public key scheme presented by Shamir in [19] (and simultaneously by Naccache in [15]) and examine its applicability for general-purpose RFID tags in the supply chain. Using a combination of new and established space-saving methods, we present a full-fledged public key identification scheme, which is secure yet highly efficient. The 1024-bit scheme fits completely (including RAM) into 4682 gate equivalents and has a mean current consumption of 14.2 μA. The main novelty in our implementation is the replacement of the long pseudo-random sequence, originally stored on 260 bytes of EEPROM in [19], by a reversible stream cipher using less than 300 bits of RAM. We show how our scheme offers tag-to-reader and reader-to-tag authentication and how it can be fit into the existing RFID supply chain infrastructure. Copyright 2009 ACM.

关键词： Supply chains

来源：评论

学校读者我要写书评

暂无评论

Texture image segmentation using Brushlet-domain hidden Markov models

Texture image segmentation using Brushlet-domain hidden Mark...

引用

MIPPR 2009 - Remote Sensing and GIS Data processing and Other Applications: 6th International Symposium on Multispectral Image processing and Pattern Recognition

作者： Liu, Fang Yang, Kai Hao, Hongxia Hou, Biao Zhong, Hua School of Computer Science and Technology Xidian University Xi'an Shanxi 710071 China Intelligent Perception and Image Understanding Key Lab. of Ministry of Education of China Xi'an Shanxi 710071 China Intelligent Information Processing Laboratory Xidian University Xi'an Shanxi 710071 China

ISBN: (纸本)9780819478092

By researching the Brushlet domain coefficients of texture images, we found that the distribution of the magnitudes of Brushlet domain coefficients roughly meet rayleigh distribution. And there are correlations between Brushlet coefficients in adjacent scales. Therefore, Rayleigh Mixture Model (RMM) is used to characterize the statistics of the magnitudes of Brushlet coefficients. To capture the inter-scale persistence of Brushlet coefficients, a "four to four" models with markov property is adopted in this paper. On the basis, by combining with the multi-scale Bayesian segmentation method, we propose a multiscale Bayesian texture segmentation algorithm that is based on a Brushlet domain hidden Markov tree (BruHMT) model. The experiment results indicate that our method is feasible and effective. Especially for coarse texture, our method is superior than texture segmentation method using Wavelet domain hidden Markov tree (WHMT) model. © 2009 Copyright SPIE - The International Society for Optical Engineering.

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

Improving Statistical Machine Translation Using Domain Bilingual Multiword Expressions

Improving Statistical Machine Translation Using Domain Bilin...

引用

2009 Workshop on Multiword Expressions: Identification, Interpretation, Disambiguation, Applications, MWE 2009

作者： Ren, Zhixiang Lü, Yajuan Cao, Jie Liu, Qun Huang, Yun Key Lab. of Intelligent Info. Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing100190 China Department of Computer Science School of Computing National University of Singapore Computing 1 Law Link Singapore117590 Singapore

ISBN: (纸本)1932432604

Multiword expressions (MWEs) have been proved useful for many natural language processing tasks. However, how to use them to improve performance of statistical machine translation (SMT) is not well studied. This paper presents a simple yet effective strategy to extract domain bilingual multiword expressions. In addition, we implement three methods to integrate bilingual MWEs to Moses, the state-of-the-art phrase-based machine translation system. Experiments show that bilingual MWEs could improve translation performance significantly. © 2009 ACL and AFNLP

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

OWA fuzzy linking histogram approach for image retrieval

OWA fuzzy linking histogram approach for image retrieval

引用

IEEE 7th International Conference on Computational Cybernetics, ICCC 2009

作者： Mahmoudi, Maryam Tayefeh Beheshti, Maedeh Lucas, Caro Taghiyareh, Fattaneh School of Electrical and Computer Eng. University of Tehran Tehran Iran Knowledge Engineering and Intelligent Systems Group Iran Telecom Research Center Tehran Iran School of Computer Engineering Iran University of Science and Technology Tehran Iran Control and Intelligent Processing Lab. University of Tehran Tehran Iran School of Electrical and Computer Eng. College of Engineering University of Tehran Tehran Iran

ISBN: (纸本)9781424453115

Color image histograms are very useful tools for content based image retrieval (CBIR) that can be applied on features such as colour, texture and shape. As these kinds of histograms results with large variations between neighbouring bins, they seem so sensitive to any kind of changes such as noise, illumination. To overcome this problem, in this paper, fuzzy linking histogram approach based on OWA aggregation operator is proposed , which is capable of projecting 3-dimensional (L*a*b*) colour histograms into single-dimension. The proposed method have been evaluated and compared with five other related methods in retrieving similar images from the common dataset which is availab.e on http://***/∼konkonst. The experimental results on 100 images within two categories of Cat and Sky reveals better performance of the proposed method in comparison with the other mentioned methods. ©2009IEEE.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Automated multidimensional characterization of power amplifier for design and production

Automated multidimensional characterization of power amplifi...

引用

2009 IEEE Intrumentation and Measurement technology Conference, I2MTC 2009

作者： Nader, Charles Altahir, Hibah Andersen, Olav Björsell, Niclas Condo, Edith Keskitalo, Niclas De La Rosa, Hector Center for RF Measurement Technology University of Gävle Gävle SE-801 76 Sweden Signal Processing Lab. Royal Institute of Technology Stockholm SE-100 44 Sweden Ericsson AB Gävle SE-800 06 Sweden Ericsson AB Stockholm SE-164 80 Sweden Freescale Semiconductor Nordic AB Kista SE-164 26 Sweden

ISBN: (纸本)9781424433537

Designing, optimizing and producing modern power amplifiers (PA) requires new and fast RF (radio frequency) measurement techniques capable of characterizing its real behavior. PAs are a truly multidimensional device where many desired performance parameters are contradictory to each other. This is especially true for the generation of modern communication PAs that require high efficiency, high linearity as well as high bandwidth. This paper presents a software-defined measurement setup for fast and cost efficient multidimensional measurements based on highly accurate standard instruments and a PC. The test bed as well as the graphical user interface is presented along with a demonstration of its functionality. During tuning of tank networks, drain quiescent current, and bias conditions, 3-dimensional graphs can be selected for the most appropriate axes of trade-off parameters to display a true behavior of the PA under test subjected to real-world or close to real-world signals. The measurement system offers the possibility to monitor envelope-tracking dynamic power consumption up to 100 MHz plus the possibility to use high crest factors. © 2009 IEEE.

关键词： Power amplifiers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：