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

2008 Asia Pacific Microwave Conference, APMC 2008

作者： Huang, Zhi-Xiang Bo, Wu Wei, Sha Chen, Ming-Sheng Wu, Xian-Liang Hong, Dai Key Lab of Intelligent Computing and Signal Processing Anhui University China School of physical science and technology Yunnan University China Department of Electrical and Electronic Engineering University of Hong Kong Hong Kong Department of Physics and Electronic Engineering Hefei Teachers College China

来源：评论

学校读者我要写书评

暂无评论

An Artificial Immune Model with Vaccine Operator for Network Intrusion Detection

An Artificial Immune Model with Vaccine Operator for Network...

引用

Pacific-Asia Workshop on Computational Intelligence and Industrial Application, PACIIA

作者： Xianjin Fang Longshu Li Key Lab of Intelligent Computing & Signal Processing of Ministry of Education Anhui University Hefei China Computer School Anhui University Hefei China

This paperpsilas purpose is to design a novel artificial immune model for network intrusion detection. This novel model can satisfy three main requirements of an efficient network intrusion detection system, namely, distributed, lightweight and self-organizing, can also quicken the process of affinity maturation of detector population and improve the efficiency of anomaly detection. The algorithms of adaptive extracting vaccines and vaccine operator are given in detail. And then, on the basis of Kimpsilas conceptual model for network intrusion detection, a novel artificial immune model and relevant algorithm for real-time network intrusion detection is proposed, which integrates vaccine operator with negative selection algorithm and clonal selection algorithm.

关键词： Vaccines Intrusion detection Detectors Computer networks Distributed computing Conferences Computational intelligence Computer industry Application software Computational and artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

PKU at ImageCLEF 2008: Experiments with query extension techniques for text-based and content-based image retrieval

PKU at ImageCLEF 2008: Experiments with query extension tech...

引用

2008 Working Notes for CLEF Workshop, CLEF 2008 - Co-located with the 12th European Conference on Digital Libraries, ECDL 2008

作者： Zhou, Zhi Tian, Yonghong Li, Yuanning Liu, Ting Huang, Tiejun Gao, Wen Institute of Digital Media School of EE and CS Peking University Beijing100871 China Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Science Beijing100190 China Graduate University Chinese Academy of Sciences Beijing100080 China

In this paper, we present our solutions for the WikipediaMM task at ImageCLEF 2008. The aim of this task is to investigate effective retrieval approaches in the context of a large-scale and heterogeneous collection of Wikipedia images that are searched by textual queries (and/or sample images and/or concepts) describing a user's information need. We first experimented with a text-based image retrieval approach with query extension, where the expansion terms are automatically selected from a knowledge base that is (semi-)automatically constructed from Wikipedia. We show how this open, constantly evolving encyclopedia can yield inexpensive knowledge structures that are specifically tailored to effectively enhance the semantics of queries. Encouragingly, the experimental results rank in the first place among all submitted runs. The second approach we experimented with is content-based image retrieval (CBIR), in which we first train 1-vs-all classifiers for all query concepts by using the training images obtained by Yahoo! search, and then treat the retrieval task as visual concept detection in the given Wikipedia image set. By comparison, this approach performs better than other submitted CBIR runs. Finally, we experimented with a cross-media image retrieval approach by combining and re-ranking text-based and content-based retrieval results. Despite the final experimental results were not formally submitted before the deadline, this approach performs remarkably better than the text-based retrieval or CBIR approaches.

关键词： Content based retrieval

来源：评论

学校读者我要写书评

暂无评论

A cascaded linear model for joint Chinese word segmentation and part-of-speech tagging

A cascaded linear model for joint Chinese word segmentation ...

引用

46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-08: HLT

作者： Jiang, Wenbin Huang, Liang Liu, Qun Lü, Yajuan Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Department of Computer and Information Science Levine Hall University of Pennsylvania 3330 Walnut Street Philadelphia PA 19104 United States

ISBN: (纸本)9781932432046

We propose a cascaded linear model for joint Chinese word segmentation and partof- speech tagging. With a character-based perceptron as the core, combined with realvalued features such as language models, the cascaded model is able to efficiently utilize knowledge sources that are inconvenient to incorporate into the perceptron directly. Experiments show that the cascaded model achieves improved accuracies on both segmentation only and joint segmentation and part-of-speech tagging. On the Penn Chinese Treebank 5.0, we obtain an error reduction of 18.5% on segmentation and 12% on joint segmentation and part-of-speech tagging over the perceptron-only baseline. © 2008 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Forest-based translation

Forest-based translation

引用

46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-08: HLT

作者： Mi, Haitao Huang, Liang Liu, Qun Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Department of Computer and Information Science Levine Hall University of Pennsylvania 3330 Walnut Street Philadelphia PA 19104 United States

ISBN: (纸本)9781932432046

Among syntax-based translation models, the tree-based approach, which takes as input a parse tree of the source sentence, is a promising direction being faster and simpler than its string-based counterpart. However, current tree-based systems suffer from a major drawback: they only use the 1-best parse to direct the translation, which potentially introduces translation mistakes due to parsing errors. We propose a forest-based approach that translates a packed forest of exponentially many parses, which encodes many more alternatives than standard n-best lists. Large-scale experiments show an absolute improvement of 1.7 BLEU points over the 1-best baseline. This result is also 0.8 points higher than decoding with 30-best parses, and takes even less time. © 2008 Association for Computational Linguistics.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Optimized Symplectic Scheme for Electromagnetic Simulations

Optimized Symplectic Scheme for Electromagnetic Simulations

引用

20th Asia Pacific Microwave Conference (APMC 2008)

作者： Wu, Bo Huang, Zhi-Xiang Sha, Wei Chen, Ming-Sheng Dai, Hong Yunnan Univ Sch Phys Sci & Technol Kunming Peoples R China Anhui Univ Key Lab Intelligent Computing & Signal Process Hefei Anhui Peoples R China Univ Hong Kong Dept Elect & Elect Engn Hong Kong Peoples R China Hefei Teachers Coll Dept Phys & Elect Engn Hefei Peoples R China

来源：评论

学校读者我要写书评

暂无评论

Forest-based translation rule extraction

Forest-based translation rule extraction

引用

2008 Conference on Empirical Methods in Natural Language Processing, EMNLP 2008, Co-located with AMTA 2008 and the International Workshop on Spoken Language Translation

作者： Mi, Haitao Huang, Liang Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Dept. of Computer and Information Science University of Pennsylvania Levine Hall 3330 Walnut St. Philadelphia PA 19104 United States

Translation rule extraction is a fundamental problem in machine translation, especially for linguistically syntax-based systems that need parse trees from either or both sides of the bitext. The current dominant practice only uses 1-best trees, which adversely affects the rule set quality due to parsing errors. So we propose a novel approach which extracts rules from a packed forest that compactly encodes exponentially many parses. Experiments show that this method improves translation quality by over 1 BLEU point on a state-of-the-art tree-to-string system, and is 0.5 points better than (and twice as fast as) extracting on 30- best parses. When combined with our previous work on forest-based decoding, it achieves a 2.5 BLEU points improvement over the baseline, and even outperforms the hierarchical system of Hiero by 0.7 points. © 2008 Association for Computational Linguistics.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

A service-oriented priority-based resource scheduling scheme for virtualized utility computing 08

引用

Proceedings of the 15th international conference on High performance computing

作者： Ying Song Yaqiong Li Hui Wang Yufang Zhang Binquan Feng Hongyong Zang Yuzhong Sun Key Lab. of Computer System and Architecture Inst. of Computing Techn. Chinese Academy of Sciences China and National Research Center for Intelligent Computing Systems ICT China and Graduate Univ. of Chinese Academy of Sciences China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences China and National Research Center for Intelligent Computing Systems ICT China

ISBN: (纸本)9783540898931

In order to provide high resource utilization and QoS assurance inutility computing hosting concurrently various services, this paper proposes aservice computing framework-RAINBOW for VM(Virtual Machine)-basedutility computing. In RAINBOW, we present a priority-based resourcescheduling scheme including resource flowing algorithms (RFaVM) to optimizeresource allocations amongst services. The principle of RFaVM is preferentiallyensuring performance of some critical services by degrading of others to someextent when resource competition arises. Based on our prototype, we evaluateRAINBOW and RFaVM. The experimental results show that RAINBOWwithout RFaVM provides 28%-324% improvements in service performance,and 26% higher the average CPU utilization than traditional service computingframework (TSF) in typical enterprise environment. RAINBOW with RFaVMfurther improves performance by 25%-42% for those critical services whileonly introducing up to 7% performance degradation to others, with 2%-8%more improvements in resource utilization than RAINBOW without RFaVM.

关键词： resource scheduling utility computing virtualization

来源：评论

学校读者我要写书评

暂无评论

High-order parabolic equation method for electromagnetic computation

High-order parabolic equation method for electromagnetic com...

引用

Asia-Pacific Conference on Microwave

作者： Zhi-Xiang Huang Bo Wu Wei Sha Ming-Sheng Xian-liang Wu Hong Dai Key Lab of Intelligent Computing & Signal Processing Anhui University China School of physical science and technology Yunnan University China Department of Physics and Electronic Engineering Hefei Teachers College China Department of Electrical and Electronic Engineering University of Hong Kong China Hefei Normal University Hefei Anhui CN

A high-order PE method has been derived and analyzed for solving multi-object RCS for the first time. Compared with the existing method SPE, the present method has following features: Firstly, boundary conditions including PML and scatterers boundary conditions can be handled as easy as SPE method. Secondly, to obtain the full bistatic RCS, we need only two rotated PE runs for high-order PE while in SPE method the number is twelve. Last but most important of all is that due to the narrow-angle approximation, the SPE cannot handle multi-object scattering problems exactly while the high-order PE method can compute multi-object RCS efficiently. The method is very powerful in deal with objects quite large compared to the wavelength.

关键词： Partial differential equations Electromagnetic scattering Optical scattering Radar scattering Electromagnetic fields Physics computing Finite difference methods Time domain analysis Taylor series signal processing

来源：评论

学校读者我要写书评

暂无评论

Bayesian-Based Speckle Suppression for SAR Image Using Contourlet Transform

引用

Journal of Electronic Science and Technology 2008年第1期000卷

作者： De-Xiang Zhang School of Electronic Science and Technology of Anhui University Hefei 230039 China Key Lab. of Intelligent Computing and Signal Processing of MOE Anhui University Hefei 230039 China

A novel and efficient speckle noise reduction algorithm based on Bayesian contourlet shrinkage using contourlet transform is ***,we show the sub-band decompositions of SAR images using contourle transforms,which provides sparse representation at both spatial and directional ***,a Bayesian contourlet shrinkage factor is applied to the decomposed data to estimate the best value for noise-free contourle *** results show that compared with conventional wavelet despeckling algorithm,the proposed algorithm can achieve an excellent balance between suppresses speckle effectively and preserve image details,and the significant information of origina image like textures and contour details is well ma intained.

关键词：转换模式光斑电子技术技术性能

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：