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

Delay constraint adaptive routing based on seed spray in opportunistic networks

Journal of Computational information Systems 2012年第12期8卷 5137-5148页

作者： Xu, Jia Wang, Ruchuan Sun, Lijuan College of Computer Nanjing University of Posts and Telecommunications Nanjing 210003 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing 210003 China Key Lab. of Broadband Wireless Communication and Sensor Network Technol. Min. of Edu. Jiangsu Prov. Nanjing University of Posts and Telecommunications Nanjing 210003 China Key Laboratory for Computer Network and Information Integration Ministry of Education Southeast University Nanjing 211189 China State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China

Opportunistic networks are sparse wireless networks which have no complete path from the source to the destination most of the time. Many applications require the support of delay constrained routing mechanism which can provide acceptable and resilient services in the challenged environments. We proposed Adaptive Seed Spray (ASS) to achieve the delay constraint with low cost in dynamic opportunistic networks. ASS will estimate the routing cost in source node, and use a small number of seed nodes to spray message copies in order to reduce redundant copies. Furthermore, ASS will make spray decisions in relay nodes which have the latest information of the networking conditions. Simulation results have shown that ASS has prominent superiority in routing cost and adaptability, and it is an efficient delay-bounded multi-copy routing protocol for opportunistic networks especially for dynamic conditions. © 2012 Binary information Press.

关键词： Cost benefit analysis

来源：评论

学校读者我要写书评

暂无评论

Efficient iterated greedy algorithm to minimize makespan for the no-wait flowshop with sequence dependent setup times

Efficient iterated greedy algorithm to minimize makespan for...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Tao Xu Xia Zhu Xiaoping Li Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

In this paper, an efficient iterated greedy algorithm is proposed for the SDST (Sequence Dependent Setup Time) no-wait flowshop with makespan minimization, which is known to be NP-hard. By introducing effective operators, the Iterated Greedy algorithm is adapted to the considered problem. To improve the quality of solutions, Local Search is incorporated into the modified Iterated Greedy algorithm. The proposed algorithm is compared with BIH, GAPH1-GAPH4, and IG_Ruiz on Taillard's instances of ssd10, ssd50, ssd100, and ssdl25. Experimental results demonstrate that the proposal outperforms BIH and GAPH1-GAPH4. As well, the proposal is more effective than IG_Ruiz under the same computation-time criterion.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A RIHS-tree-based algorithm of mining frequent closed itemsets in high dimensional datasets

引用

Journal of Convergence information Technology 2012年第21期7卷 467-476页

作者： Huang, Guoyan Chen, Shuai Ren, Shenyuan Dong, Jun College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China College of Computer Science Sichuan University Chengdu Sichuan 610000 China

In order to fully utilize the minimum support threshold to prune the rowset search space and avoid scanning the whole dataset in close-checking, we proposed two new data structure, Rowset-Itemset-Hybrid-Search-Tree (RIHS-Tree) and Frequent-Closed-Itemset-Rowset-Tree (FCIR-Tree). The former stores the rowsets which share common rowid prefixes, according to some predefined order of rowids. Each path from the root node to the leaf node represents a rowset in which the rowids increase. The later also stores the large rowsets which also share common rowid prefixes. The corresponding closed itemsets are stored in the nodes carrying the last rowids in rowsets. Moreover, a new algorithm, RIHS-Tree-based algorithm for mining frequent closed patterns (FCIM-RIHS), is proposed. We translate the whole dataset into a transposed table, construct RIHS-Tree according to the rowsets in the transposed table and use a bottom-up search strategy to traverse RIHS-Tree. In the process of mining, we use the rowsets-inclusion strategy to implement pattern growth and then obtain large rowsets with their corresponding frequent closed itemsets. In FCIR-Tree, if the nodes in the subtree rooted by the nodes carrying the last rowid in the rowsets do not contain the found itemsets, the found itemsets are frequent closed itemsets. The experiment results with dataset demonstrate that FCIM-RIHS has highly efficiency.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Large scale temporal RDFS reasoning using MapReduce 26

Large scale temporal RDFS reasoning using MapReduce

引用

26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12

作者： Liu, Chang Qi, Guilin Yu, Yong Shanghai Jiao Tong University China Key Laboratory of Computer Network and Information Integration of State Education Ministry School of Computer Science and Engineering Southeast University China 311 Yifu Building 800 Dongchuan Road Shanghai 200240 China

ISBN: (纸本)9781577355687

In this work, we build a large scale reasoning engine under temporal RDFS semantics using MapReduce. We identify the major challenges of applying MapReduce framework to reason over temporal information, and present our solutions to tackle them. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Research on the model of the survivable storage system (SSS) and its architecture

Research on the model of the survivable storage system (SSS)...

引用

3rd International Conference on computer Science and Its Applications, CSA 2011 and 2011 FTRA World Convergence Conference, WCC 2011

作者： Yang, Xiao-Yuan Wang, Jing-Jing Chen, Xiao-Feng Key Laboratory of Network and Information Security of CAPF Engineering College of CAPF Xi'an 710086 China Key Laboratory of Computer Networks and Information Security Xidian University Ministry of Education Xi'an 710071 China

ISBN: (纸本)9789400727915

In view of the present inconsistent understanding of the model definition of survivable storage network, a seven-tuple model definition and a kind of architecture of SSS were given, taking the characteristics, such as wide-open style and high intricacy, of the actual network environment into account. In addition, some detailed analysis to the key elements of the model and the modules of the architecture was made separately. Our research can provide guidelines for design and construction of SSS, besides, it can also provide basic methods for evaluating the survivability of a storage system. © 2012 Springer Science+Business Media B.V.

关键词： network architecture

来源：评论

学校读者我要写书评

暂无评论

A novel grouping aggregation algorithm for online analytical processing

引用

2012 National Conference on information Technology and computer Science, CITCS 2012

作者： Chen, Wei Liu, Yongshan Wang, Ning College of Information Science and Engineering Yanshan University Qinhuangdao China Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province Qinhuangdao China

ISBN: (纸本)9789491216381

As regard to improve the efficiency of grouping aggregation calculation, the data is compressed by using binary encoding, and the dimension hierarchical grouping attribute set encodings of each dimension table are calculated by using the dimension hierarchy tree. Then different encodings are put into temporary table to be sorted and grouped, and the grouping sequence numbers of fact table records which satisfy the query conditions are computed. Finally, the buffer is located by the grouping sequence number and the grouping aggregation calculation is completed. Theoretical analysis and experimental results show that the proposed algorithm can significantly improve the efficiency of grouping aggregation calculation. © 2012. The authors - Published by Atlantis Press.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

An improved harmony search algorithm for blocking job shop to minimize makespan

An improved harmony search algorithm for blocking job shop t...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Peiying Hou Dandan Wang Xiaoping Li School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration South East University Nanjing China

In this paper, Harmony Search is applied to the blocking job shop problem with makespan minimization. According to the characteristics of the considered problem, a decoding method is introduced to generate feasible solutions. A rule is proposed to improvise new harmonies. Some approaches are developed to determine the harmony search considering rate, the pitch adjusting rate, the dynamic harmony memory. A local search is investigated to further improve quality of the solutions. Results of numerical experiments on classical benchmark instances show that the proposed algorithm can improve makespan 16.50% on average.

关键词： Educational institutions

来源：评论

学校读者我要写书评

暂无评论

A hybrid genetic algorithm for resource-constrained multi-project scheduling problem with resource transfer time

A hybrid genetic algorithm for resource-constrained multi-pr...

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： Zhicheng Cai Xiaoping Li School of Computer Science & Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing PR China

The RCMPSPTT (resource-constrained multi-project scheduling problem with resource transfer time) problem usually exists in distributed collaborative manufacturing systems, in which scarce resources are shared by different projects dispersed in distributed physical places. Resources are needed to be transferred among different projects with non-neglectable time. In this paper, a hybrid genetic algorithm is proposed for the considered problem. Besides standard operators, EPS (Elite population based dual Population Structure) and VNS (Variable Neighborhood Search) operators are introduced for both diversification and intensification consideration to improve effectiveness. The EPS keeps the elite solutions found during the search and they are updated using a similarity strategy. The VNS generates new solutions by a proposed local search strategy. Experiments show that 26.1% has been improved on solutions by DGAVNS compared with an existing priority rule based heuristic algorithm.

关键词： Genetic algorithms Biological cells Sociology Statistics Schedules Search problems Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

BIDE-based parallel mining of frequent closed sequences with MapReduce

BIDE-based parallel mining of frequent closed sequences with...

引用

12th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2012

作者： Yu, Dongjin Wu, Wei Zheng, Suhang Zhu, Zhixiang School of Computer Hangzhou Dianzi University Hangzhou China Zhejiang Provincial Key Laboratory of Network Technology and Information Security Hangzhou China

ISBN: (纸本)9783642330643

Parallel processing is essential to mining frequent closed sequences from massive volume of data in a timely manner. On the other hand, MapReduce is an ideal software framework to support distributed computing on large data sets on clusters of computers. In this paper, we develop a parallel implementation of BIDE algorithm on MapReduce, called BIDE-MR. It iteratively assigns the tasks of closure checking and pruning to different nodes in cluster. After one round of map-combine-partition-reduce, the closed frequent sequences with round-specific length and the candidates for the next round of computation are generated. Since the candidates and their pseudo project databases are independent with each other, BIDE-MR achieves high speed-ups. We implement BIDE-MR on an Apache Hadoop cluster and use BIDE-MR to mine the vehicles which frequently appear together from massive records collected at different monitoring sites. The results show that BIDE-MR attains good parallelization. © 2012 Springer-Verlag.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Hierarchical text classification for news articles based-on named entities

Hierarchical text classification for news articles based-on ...

引用

8th International Conference on Advanced Data Mining and Applications, ADMA 2012

作者： Gui, Yaocheng Gao, Zhiqiang Li, Renyong Yang, Xin Institute of Web Science School of Computer Science and Engineering Southeast University Nanjing 211189 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing 211189 China Focus Technology Co. Ltd. Nanjing 210061 China

ISBN: (纸本)9783642355264

There exist a range of hierarchical text classification approaches that classify text documents into a pre-constructed hierarchy of categories. In these approaches, feature selections are often based on terms (words or phrases), which are unsuitable for hierarchically classifying news articles. Named entities are informative features in news articles which have not been studied seriously in previous hierarchical text classification approaches. This paper utilizes named entities as features for classifying news articles into a pre-constructed hierarchy about international relations. The feature selection is implemented based on named entities associated with local categories. Documents are then represented by the selected features using two types of models, which are Boolean model and Vector model. We train SVMs corresponding to both types of models based-on local information. The experimental results show that the use of named entities improves the performance of hierarchical text classification for news articles. © Springer-Verlag 2012.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：