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

An enhanced group search optimizer using generalized opposition-based learning

Journal of Computational Information Systems 2012年第13期8卷 5483-5490页

作者： Wang, Shenwen Ding, Lixin Yang, Hua Guo, Zhaolu Xie, Datong Xie, Chenwang State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China School of Information Engineering Shijiazhuang University of Economics Shijiazhuang 050031 China School of Mathematics and Computer Science Guizhou Normal University Guiyang 550001 China School of Software East China JiaoTong University Nanchang 330013 China

Group Search Optimizer (GSO) has been shown to yield good performance for solving various optimization problems. However, it tends to suffer from premature convergence when solving complex problems. At the same time, GSO assumes that group members include producers, scroungers and rangers and the algorithm often chooses the best member as the producer. However, it applies random strategy for the role assignment of scrounger and ranger, which is a blind search and leads to bad results. This paper presents an enhanced GSO algorithm called GOGSO, which employs generalized opposition-based learning (GOBL) and rangers detection to overcome the two problems respectively. GOBL can provide a faster convergence, and the rangers detection can help to recognize the members of rangers. Experiments are conducted on sex benchmark functions, and the results show that the new algorithm achieve faster convergence and improve the diversity of individuals. © 2011 by Binary Information Press.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Geese PSO optimization in geometric constraint solving

引用

Information Technology Journal 2012年第4期11卷 504-507页

作者： Cao, Chun-Hong Wang, Li-Min Han, Chun-Yan Zhao, Da-Zhe Zhang, Bin College of Information Science and Engineering Northeastern University Shenyang 110819 China College of Computer Science and Technology Jilin University Changchun Jilin 130012 China State Key Lab. for Novel Software Technology Nanjing University China Key Laboratory of Medical Image Computing Ministry of Education Northeastern University Shenyang Liaoning 110819 China

Geometric constraint problem is equivalent to the problem of solving a set of nonlinear equations substantially. The constraint problem can be transformed to an optimization n problem. We can solve the problem with GeesePSO optimization. In this paper, an improved algorithm is proposed using the characteristics of the flight of geese for reference. The improved algorithm has superiority over PSO;for one thing, it keeps the population various by ordering all the particles and making each particle fly following its anterior particle;for another thing, it strengthens cooperation and competition between particles by making each particle share more useful information of the other particles. The experiment shows that it can improve the geometric constraint solving efficiency and possess better convergence property than the compared algorithms. © 2012 Asian Network for Scientific Information.

关键词： Nonlinear equations

来源：评论

学校读者我要写书评

暂无评论

A model of malware passive propagation on the WWW

引用

Journal of Computational Information Systems 2011年第7期7卷 2593-2600页

作者： Liu, Chunbo Wang, Zhi Jia, Chunfu College of Information Technical Science Nankai University Tianjin 300071 China College of Computer Science and Technology Civil Aviation University of China Tianjin 300300 China State Key Lab. for Novel Software Technology Nanjing University China

Web-based malwares host in websites fixedly and are downloaded onto user's computers automatically while users browse. This passive propagation pattern is different from that of traditional viruses and worms. A propagation model based on reverse web graph is proposed. In this model, propagation of malwares is analyzed by means of random jump matrix which combines orderness and randomness of user browsing behaviors. Explanatory experiments, which has single or multiple propagation sources respectively, prove the validity of the model. Using this model, people can evaluate the hazardness of specified websites and take corresponding countermeasures. Copyright © 2011 Binary Information Press.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Optimizing SpMV for diagonal sparse matrices on GPU

Optimizing SpMV for diagonal sparse matrices on GPU

引用

40th International Conference on Parallel Processing, ICPP 2011

作者： Sun, Xiangzheng Zhang, Yunquan Wang, Ting Zhang, Xianyi Yuan, Liang Rao, Li Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Graduate University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769545103

Sparse Matrix-Vector multiplication (SpMV) is an important computational kernel in scientific applications. Its performance highly depends on the nonzero distribution of sparse matrices. In this paper, we propose a new storage format for diagonal sparse matrices, defined as Compressed Row Segment with Diagonal-pattern (CRSD). In CRSD, we design diagonal patterns to represent the diagonal distribution. As the Graphics Processing Units (GPUs) have tremendous computation power and OpenCL makes them more suitable for the scientific computing, we implement the SpMV for CRSD format on the GPUs using OpenCL. Since the OpenCL kernels are complied at runtime, we design the code generator to produce the codelets for all diagonal patterns after storing matrices into CRSD format. Specifically, the generated codelets already contain the index information of nonzeros, which reduces the memory pressure during the SpMV operation. Furthermore, the code generator also utilizes property of memory architecture and thread schedule on the GPUs to improve the performance. In the evaluation, we select four storage formats from prior state-of-the-art implementations (Bell and Garland, 2009) on GPU. Experimental results demonstrate that the speedups reach up to 1.52 and 1.94 in comparison with the optimal implementation of the four formats for the double and single precision respectively. We also evaluate on a two-socket quad-core Intel Xeon system. The speedups reach up to 11.93 and 12.79 in comparison with CSR format under 8 threads for the double and single precision respectively. © 2011 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A method for detecting mismatch of time-aware Web services based on SMT

A method for detecting mismatch of time-aware Web services b...

引用

6th International Conference on computer science and Education, ICCSE 2011

作者： Xiyan, Wang Chen, Shenbiao Zhang, Guangquan Zhu, Jihan Wu, Jianfeng School of Computer Science and Technology Soochow University Suzhou 215006 China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9781424497188

Considering the timed properties between the interactions of Web services, we model the Web services with timed properties formally and propose a method for detecting mismatch of time-aware Web services based on Satisfiability Modulo Theories (SMT) in this paper. The issue of detecting mismatch of Web services can be transformed into the problem of existence model checking whether a deadlock is reachable or not between the interaction of the services, and the issue of existence model checking can be transformed into the problem whether the logic formula is satisfiable or not. © 2011 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Empirical studies of pen tilting performance in pen-based user interfaces 11

Empirical studies of pen tilting performance in pen-based us...

引用

Proceedings of the 2011 Visual Information Communication - International Symposium

作者： Tian, Feng Cao, Xiang Lu, Fei Dai, Guozhong Zhang, Xiaolong Wang, Hongan Intelligence Engineering Lab. Institute of Software Chinese Academy of Sciences China Microsoft Research Asia China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences China Pennsylvania State University United States

ISBN: (纸本)9781450308755

Recently, pen tilting has been explored in pen-based user interfaces and has shown potential to improve user interaction in various tasks (e.g., menu selection, modeless object manipulation). However, some basic questions concerning pen tilting behaviors, such as the ideal range, azimuth size, and direction of pen tilting, have not been thoroughly investigated. In this paper, we report our empirical studies on user performances in basic pen tilting tasks. First, we conducted a baseline study, which helps us to determine tilting directions, tilting ranges, and the thresholds that separate incidental pen tilting actions from intentional actions used for interaction. Based on the results from the baseline study, we designed an experiment to investigate user performances in goal tilting in different tilting ranges, azimuth sizes, and directions. Drawing on the results of our data analyses on task completion time, error rate, and pen tip movements, we discussed values of tilting parameters like titling range, minimal azimuth size, and tilting direction. © 2011 ACM.

关键词： User interfaces

来源：评论

学校读者我要写书评

暂无评论

Energy conservation using network coding in grid wireless sensor networks

Energy conservation using network coding in grid wireless se...

引用

International Workshop on Intelligent Systems and Applications

作者： Kasireddy, Bharat Wang, Yun Liu, Jin Department of Computer Science Southern Illinois University Edwardsville IL United States State Key Lab. of Software Engineering Wuhan University China

ISBN: (纸本)9781424498574

This work investigates the energy consumption rate of an energy-constrained wireless sensor network and demonstrates that sensor energy dissipation can be reduced by employing network coding in terms of routing the same amount of sensing data to base stations through theoretical and simulation perspectives. In addition,this work examines the interplays between network parameters such as node density, traffic rate,and coding strategy and the performance gain of employing network coding for energy conservation in a grid wireless sensor *** provides insights into the design of wireless sensor networks and the deployment of network coding for energy conservation in practice. © 2011 IEEE.

关键词： Energy conservation

来源：评论

学校读者我要写书评

暂无评论

ListOPT: Learning to optimize for XML ranking

ListOPT: Learning to optimize for XML ranking

引用

作者： Gao, Ning Deng, Zhi-Hong Yu, Hang Jiang, Jia-Jian School of Electronic Engineering and Computer Science Peking University China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9783642208461

Many machine learning classification technologies such as boosting, support vector machine or neural networks have been applied to the ranking problem in information retrieval. However, since the purpose of these learning-to-rank methods is to directly acquire the sorted results based on the features of documents, they are unable to combine and utilize the existing ranking methods proven to be effective such as BM25 and PageRank. To solve this defect, we conducted a study on learning-to-optimize, which is to construct a learning model or method for optimizing the free parameters in ranking functions. This paper proposes a listwise learning-to-optimize process ListOPT and introduces three alternative differentiable query-level loss functions. The experimental results on the XML dataset of Wikipedia English show that these approaches can be successfully applied to tuning the parameters used in an existing highly cited ranking function BM25. Furthermore, we found that the formulas with optimized parameters indeed improve the effectiveness compared with the original ones. © 2011 Springer-Verlag.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

High speed architecture of arithmetic coder

High speed architecture of arithmetic coder

引用

IEEE International Conference on computer science and Automation Engineering (CSAE)

作者： Liu, Kai Xu, Chao School of Computer Science and Technology Xidian University Xi'an 710071 China State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China

ISBN: (纸本)9781424487257

A high speed arithmetic coder architecture is proposed in this paper. An out-of-order execution mechanism for different types of context is used that can allocate the context symbol to the idle arithmetic coding core with a different order compared with the input order. For the balance of the input rate of contexts, in one arithmetic coder, there exist N cores for processing different contexts, where N is the number of context type. Furthermore, the same bit detection (SBD) circuit is used for unrolling the renormalization stage of arithmetic coding. Moreover, because of time consuming for underflowing, a dedicated circuit is designed to unrolling the internal loop which can process underflowing situation in a few clock cycles. Experimental results demonstrate that the proposed architecture attains a throughput of 375.50 MCPS (Mega Contexts per Second) at its maximum based on field programmable gate arrays (FPGAs). © 2011 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Leveraging fragmental semantic data to enhance services discovery

Leveraging fragmental semantic data to enhance services disc...

引用

13th IEEE International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th IEEE International Conference on HPCC 2011

作者： Wang, Jian Zhang, Jia Hung, Patrick C.K. Li, Zheng Liu, Jianxiao He, Keqing State Key Lab. of Software Engineering Computer School Wuhan University China Department of Computer Science Northern Illinois University United States University of Ontario Institute of Technology Canada

ISBN: (纸本)9780769545387

As one foundational technology of cloud computing, services computing is playing a critical role to enable provisioning of software as a service (SaaS). However, how to effectively and efficiently discover proper availab.e services from the cloud of resources remains a big challenge. This paper reports our continuous efforts on semantic services discovery. We extend the Support Vector Machine (SVM)-based text clustering technique in the context of serviceoriented categorization in a service repository, and propose an iterative process to incrementally enrich domain ontology. A popular Web 2.0 mashup platform is used as a testbed;and preliminary evaluation results are reported. © 2011 IEEE.

关键词： software as a service (SaaS)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：