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

9th Annual Conference on Theory and Applications of Models of Computation, TAMC 2012

作者： Wang, Lin Fernández Anta, Antonio Zhang, Fa Hou, Chenying Liu, Zhiyong Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China Institute IMDEA Networks Spain China State Key Lab. for Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China Graduate University of Chinese Academy of Sciences China

ISBN: (纸本)9783642299513

Energy consumption is an important issue in the design and use of networks. In this paper, we explore energy savings in networks via a rate adaptation model. This model can be represented by a cost-minimization network routing problem with discrete cost functions. We formulate this problem as an integer program, which is proved to be NP-hard. Then a constant approximation algorithm is developed. In our proposed method, we first transform the program into a continuous-cost network routing problem, and then we approximate the optimal solution by a two-step rounding process. We show by analysis that, for uniform demands, our method provides a constant approximation for the uniform network routing problem with discrete costs. A bicriteria network routing problem is also developed so that a trade-off can be made between energy consumption and network delay. Analytical results for this latter model are also presented. © 2012 Springer-Verlag.

关键词： Network routing

来源：评论

学校读者我要写书评

暂无评论

Head-driven hierarchical phrase-based translation

Head-driven hierarchical phrase-based translation

引用

50th Annual Meeting of the Association for Computational Linguistics, ACL 2012

作者： Li, Junhui Tu, Zhaopeng Zhou, Guodong Van Genabith, Josef Centre for Next Generation Localisation School of Computing Dublin City University Ireland Key Lab. of Intelligent Info. Processing Chinese Academy of Sciences Institute of Computing Technology China School of Computer Science and Technology Soochow University China

ISBN: (纸本)9781937284251

This paper presents an extension of Chiang's hierarchical phrase-based (HPB) model, called Head-Driven HPB (HD-HPB), which incorporates head information in translation rules to better capture syntax-driven information, as well as improved reordering between any two neighboring non-terminals at any stage of a derivation to explore a larger reordering search space. Experiments on Chinese-English translation on four NIST MT test sets show that the HD-HPB model significantly outperforms Chiang's model with average gains of 1.91 points absolute in BLEU. © 2012 Association for Computational Linguistics.

关键词： Translation (languages)

来源：评论

学校读者我要写书评

暂无评论

Using Syntactic Head Information in Hierarchical Phrase-Based Translation 7

Using Syntactic Head Information in Hierarchical Phrase-Base...

引用

7th Workshop on Statistical Machine Translation, WMT 2012, immediately following the Conference of the North-American Chapter of the Association for Computational Linguistics - Human Language Technologies, NAACL HLT 2012

作者： Li, Junhui Tu, Zhaopeng Zhou, Guodong Genabith, Josef Van Centre For Next Generation Localisation School Of Computing Dublin City University Ireland Key Lab. Of Intelligent Info. Processing Institute Of Computing Technology Chinese Academy Of Sciences China School Of Computer Science And Technology Soochow University China

ISBN: (纸本)9781937284206

Chiang's hierarchical phrase-based (HPB) translation model advances the state-of-the-art in statistical machine translation by expanding conventional phrases to hierarchical phrases - phrases that contain sub-phrases. However, the original HPB model is prone to overgeneration due to lack of linguistic knowledge: the grammar may suggest more derivations than appropriate, many of which may lead to ungrammatical translations. On the other hand, limitations of glue grammar rules in the original HPB model may actually prevent systems from considering some reasonable derivations. This paper presents a simple but effective translation model, called the Head-Driven HPB (HD-HPB) model, which incorporates head information in translation rules to better capture syntax-driven information in a derivation. In addition, unlike the original glue rules, the HD-HPB model allows improved reordering between any two neighboring non-terminals to explore a larger reordering search space. An extensive set of experiments on Chinese-English translation on four NIST MT test sets, using both a small and a large training set, show that our HDHPB model consistently and statistically significantly outperforms Chiang's model as well as a source side SAMT-style model. ©2012 Association for Computational Linguistics.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Granularity analysis of fuzzy soft set

Granularity analysis of fuzzy soft set

引用

7th International Conference on Rough Sets and Knowledge Technology, RSKT 2012

作者： Yao, Dengbao Wang, Cuicui Mao, Junjun Zhang, Yanping School of Mathematical Sciences Anhui University Hefei 230039 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230039 China Department of Computer Science University of Houston Houston TX 77204-3010 United States

ISBN: (纸本)9783642318993

Fuzzy soft set (FSs) is a novel mathematical tool, in order to describe and measure uncertain information of FSs perfectly, granularity analysis based on covering about FSs is originally discussed in this paper. Firstly, the α-dominance relation between any two objects is built by constructing the possibility degree or the weighted possibility degree after standardization, thus α-dominance class and α-covering approximation space could be generated on this relation. Secondly, granular capacity is proposed to measure the granular information of variable precision through introducing concepts of the description set and the indistinguishability set, Finally, an illustrative example is analysed to reflect dynamic changes of uncertain information under different granular structure. © 2012 Springer-Verlag.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

Secure Cooperative Spectrum Sensing based on the Distance between Bodies of Evidence

引用

International Journal of Communications, Network and System Sciences 2012年第1期5卷 66-71页

作者： Yi Wang Yanjun Hu Xiwen Tang Yingguan Wang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Key Laboratory of Wireless Sensor Network & Communication Shanghai Institute of Microsystem and Information Technolgy Chinese Academy of Sciences

In cognitive radio (CR) networks, unlicensed secondary users need to conduct spectrum sensing to gain access to a licensed spectrum band. And cooperation among CR users will solve the problems caused by multipath fading and shadowing. In this paper, we propose a multi-threshold method at local nodes to cope with noises of great uncertainty. Functions of distance between bodies of evidence are used at fusion centre to make synthetic judgment. To guarantee security which is an essential component for basic network functions, we will take selfish nodes into account which try to occupy channels exclusively. The proposed technique has shown better performance than conventional algorithms without increase the system overhead.

关键词： Cognitive Radio Spectrum Sensing Multiple Thresholds Energy Detection Evidence Theory

来源：评论

学校读者我要写书评

暂无评论

Contracting community for computing maximum flow

Contracting community for computing maximum flow

引用

IEEE International Conference on Granular computing (GRC)

作者： Yanping Zhang Xiansheng Xu Bo Hua Shu Zhao School of Computer Science and Technology Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China

In this paper, we propose a novel method named Contracting Community Approach (CCA) to get the maximum flow of flow network. Firstly, we contract communities in the original network. Then, we apply classic algorithms on the contracted network to approximately solve the maximum flow problem. Experimental results show that the efficiency of the proposed algorithm. For sparse networks, the size of network is reduced to 58.38% averagely and the correctness of maximum flow is over 95%. For middle dense networks, the size of network is reduced to 65.77% averagely. For dense networks, the size of network is reduced to 64.84% averagely. And the correctness of maximum flow even reach 100% both in many middle dense and dense cases in our experiments.

关键词： Educational institutions Artificial neural networks Video recording

来源：评论

学校读者我要写书评

暂无评论

Numerical dispersion analysis of symplectic and ADI schemes

Numerical dispersion analysis of symplectic and ADI schemes

引用

International Conference on Microwave and Millimeter Wave Technology Proceedings

作者： Xin-gang Ren Zhi-xiang Huang Xian-liang Wu Si-long Lu Yi-cai Mei Hong-mei Du Hui Wang Jing Shen Key Lab of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei China Department of Physics and Electronic Engineering Hefei Normal University Hefei China

In this paper, Maxwell's equations are taken as a Hamiltonian system and then written as Hamiltonian canonical equations by using the functional variation method. The symplectic and ADI schemes, which can be extracted by applying two types of approximation to the time evolution operator, are explicit and implicit scheme in computational electromagnetic simulation, respectively. Since Finite-difference time-domain (FDTD) encounter low accuracy and high dispersion, the more accurate simulation methods can be derived by evaluating the curl operator in the spatial direction with kinds of high order approaches including high order staggered difference, compact finite difference and scaling function approximations. The numerical dispersion of the symplectic and ADI schemes combining with the three high order spatial difference approximations have been analyzed. It has been shown that symplectic scheme combining with compact finite difference and ADI scheme combining with scaling function performance better than other methods. Both schemes can be usefully employed for simulating and solving the large scale electromagnetic problems.

关键词： Dispersion Finite difference methods Function approximation Time domain analysis Maxwell equations Mathematical model

来源：评论

学校读者我要写书评

暂无评论

A dual population parallel ant colony optimization algorithm for solving the traveling salesman problem

引用

Journal of Convergence Information Technology 2012年第5期7卷 66-74页

作者： Liu, Fang Software Institute Dalian Jiaotong University Dalian 116028 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230039 China

In allusion to the phenomenon of stagnation and precocity during evolution in ant colony optimization (ACO) algorithm, this paper proposed a dual population parallel ant colony optimization (DPPACO) algorithm, which was applied to the traveling salesman problem. The DPPACO algorithm separated the ants into soldier ant population and worker ant population which evolve separately by parallel method and exchanges information timely. The dynamic equilibrium between solution diversity and convergence speed is achieved by using the effect of the soldier ant's distribution to worker ants' movement choice. The DPPACO algorithm can enlarge searching range and avoid local minimum, prevent local convergence caused by misbalance of the pheromone and can improve the searching performance of the algorithm effectively. The proposed algorithm is applied in the traveling salesman problem by using the 17 data sets obtained from the TSPLIB. We compare the experimental results of the proposed DPPACO method with the traditional methods. The experimental results demonstrate that the proposed algorithm has a better global searching ability, higher convergence speed and solution diversity.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Evaluating Structure of Complex Networks by Navigation Entropy

Evaluating Structure of Complex Networks by Navigation Entro...

引用

第8届语义知识与网络国际会议(2012 Eighth International Conference on Semanties,Knowledge and Grids )(SKG2012)

作者： Xiaoping Sun Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

Complex networks are extensively studied in various areas such as social networks,biological networks,Internet and networks have many characters such as small-diameter,higher cluster and power-law degree ***-world is evolved for efficient information transformation and ***,navigation is an important functional character of *** researches mostly focus on understanding the navigability of small-world networks by analyzing the diameter and the routing *** this paper,we use the navigability to model the basic structural complexity of a *** is,given a network topology,we need a model to evaluate how complex the topology *** network complexity models have been proposed but none of them consider the navigability factor of the network *** believe that using the navigability factor to evaluate the network structural complexity is a feasible and reasonable *** use the adjacent matrix to build a navigation transition matrix and evaluate the randomness of random walks on the transition matrix by defining navigation entropy on *** use the iteration of the random walk matrix to evaluate the navigability of a network and the complexity of *** is,the higher the navigation entropy,the higher the randomness of a *** lower the navigation entropy,the higher the structure of a *** apply the navigation entropy model on a set of structural and random network topologies to show how the model can show the different complexity of networks.

关键词： navigation entropy structure complexity complex network

来源：评论

学校读者我要写书评

暂无评论

A novel approach based on domain ontology for web information extraction

引用

International Journal of Advancements in computing Technology 2012年第7期4卷 185-194页

The effect of Web information extraction depends on the quality of extraction rules. But for most approaches for Web information extraction, independence of extraction rules is their common shortages. In this paper, we propose a novel approach based on ontology for Web information extraction. We sum up four features for information items and induce these features to a group of extraction rules. Then according to a group of mapping rules between elements of ontology and extraction rules, extraction rules are well organized in ontology. According to properties of concept in ontology, the initial result of information extraction is got and then the final result is obtained by simplifying the initial results. Experiments show that our approach has higher precision.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：