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

A fast algorithm for finding community structure based on community closeness

A fast algorithm for finding community structure based on co...

3rd International Joint Conference on Computational Sciences and Optimization, CSO 2010: Theoretical Development and Engineering Practice

作者： Jiang, Xiufang Liu, Guiquan Lin, Zhiting Key Laboratory of Software in Computing and Communication Anhui Province School of Computer Science and Technology University of Science and Technology of China Hefei Anhui 230027 China

ISBN: (纸本)9780769540306

Recently, the characterization of community structures in complex networks has received a considerable amount of attentions. Effective identification of these communities or clusters is a general problem in the field of data mining. In this paper we present a fast hierarchical agglomerative algorithm based on community closeness (FHACC) algorithm, for detecting community structure which is very efficient and faster than many other competing algorithms. FHACC tends to agglomerate such communities that share the most common vertices into larger ones. Its running time on a sparse network with n vertices and m edges is O(mk¯+mt), where k¯ denotes the mean vertex degree, and t is the iteration times of community agglomeration in FHACC algorithm. The algorithm was tested on several real-world networks and proved to be high efficient and effective in community finding. © 2010 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Test case generation based on program invariant and adaptive random algorithm

Test case generation based on program invariant and adaptive...

引用

2011 International Conference on computer Science and Education, CSE 2011

作者： Yuan, Yuan Fanping, Zeng Guanmiao, Zhu Chaoqiang, Deng Neng, Xiong Department of Computer University of Science and Technology of China China Anhui Province Key Lab. of Software in Computing and Communication Hefei Anhui China

ISBN: (纸本)9783642224171

Testing is a critical activity to find software errors. And choosing an effective test suite is the key problem in software testing area. Program invariant, as an attribute of program, can record the implementation state of test case very well and reveal the coverage of program data. In this paper, we integrate adaptive random testing and invariant technology, and present a new method which makes full use of the feedback information of program invariant and invalid case suite to generate the next case. Experiment results show that, compared with other similar methods, running for the same time, our method can achieve higher coverage and faster convergence speed. © 2011 Springer-Verlag.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

A self-organized algorithm based on digital hormone

A self-organized algorithm based on digital hormone

引用

International Conference on Advanced computer Theory and Engineering

作者： Xia, Li Xufa, Wang Yang, Lei Haifeng, You Key Laboratory of Software in Computing and Communication Anhui Province School of Computer Science and Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9781424465408

In this paper, a self-organized algorithm for task allocation, based on the hormone reaction-diffusion mechanism, is proposed for a multi-robot system. Hormone messages are used to coordinate the movement of robots. By the regulation of hormones, agents could adjust their behaviors in time and improve the ability of self-organization. A simulation of task allocation in the multi-robot system is performed, experimental results demonstrate that our method can accomplish the task effectively and reduce the total cost. © 2010 IEEE.

关键词： Multipurpose robots

来源：评论

学校读者我要写书评

暂无评论

A hormone-based clustering algorithm in wireless sensor networks

A hormone-based clustering algorithm in wireless sensor netw...

引用

2010 2nd International Conference on computer Engineering and Technology, ICCET 2010

作者： Dong, Dayuan You, Haifeng Zhang, Yipeng Wang, Xufa Key Laboratory of Software in Computing and Communication Anhui Province School of Computer Science and Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9781424463503

Clustering problem is one of the hottest issues in wireless sensor networks (WSNs). The strategy for selection of cluster head has not been sufficiently investigated. In this paper, we propose a hormone-based clustering algorithm (HCA) inspired by the communication mechanism of bio-endocrine system to prolong the lifetime of the sensor nodes. Two kinds of hormones, cluster hormone and member hormone, are used in the algorithm. Hormone message can promote a node to become a cluster head or a member node. Comparative experiment shows that the proposed algorithm has effectively prolong the lifetime of WSN compared with LEACH[1] and HEED[2]. © 2010 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Empirical topological investigation of practical supply chains based on complex networks

引用

Chinese Physics B 2017年第11期26卷 144-150页

作者：廖好沈婧吴兴桐陈博奎周明洋 National Engineering Laboratory for Big Data Computing Systems Guangdong Province Key Laboratory of Popular High Performance ComputersCollege of Computer Science and Software Engineering Shenzhen University Department of Computer Science School of Computing National University of Singapore

The industrial supply chain networks basically capture the circulation of social resource, dominating the stability and efficiency of the industrial system. In this paper, we provide an empirical study of the topology of smartphone supply chain network. The supply chain network is constructed using open online data. Our experimental results show that the smartphone supply chain network has small-world feature with scale-free degree distribution, in which a few high degree nodes play a key role in the function and can effectively reduce the communication cost. We also detect the community structure to find the basic functional unit. It shows that information communication between nodes is crucial to improve the resource utilization. We should pay attention to the global resource configuration for such electronic production management.

关键词： China supply chain networks complex networks data science network science

来源：评论

学校读者我要写书评

暂无评论

A hybrid particle swarm optimization for high-dimensional dynamic optimization 11th

A hybrid particle swarm optimization for high-dimensional dy...

引用

11th International Conference on Simulated Evolution and Learning, SEAL 2017

作者： Luo, Wenjian Yang, Bin Bu, Chenyang Lin, Xin Anhui Province Key Laboratory of Software Engineering in Computing and Communication School of Computer Science and Technology University of Science and Technology of China HefeiAnhui230027 China

ISBN: (纸本)9783319687582

High-Dimensional Dynamic Optimization Problems (HDDOPs) commonly exist in real-world applications. In evolutionary computation field, most of existing benchmark problems, which could simulate HDDOPs, are non-separable. Thus, we give a novel benchmark problem, called high-dimensional moving peaks benchmark to simulate separable, partially separable, and non-separable problems. Moreover, a hybrid Particle Swarm Optimization algorithm based on Grouping, Clustering and Memory strategies, i.e. GCM-PSO, is proposed to solve HDDOPs. In GCM-PSO, a differential grouping method is used to decompose a HDDOP into a number of sub-problems based on variable interactions firstly. Then each sub-problem is solved by a species-based particle swarm optimization, where the nearest better clustering is adopted as the clustering method. In addition, a memory strategy is also adopted in GCM-PSO. Experimental results show that GCM-PSO performs better than the compared algorithms in most cases. © Springer International Publishing AG 2017.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Multi-question negative surveys 3rd

Multi-question negative surveys

引用

3rd International Conference on Data Mining and Big Data, DMBD 2018 held in conjunction with the 9th International Conference on Swarm Intelligence, ICSI 2018

作者： Jiang, Hao Luo, Wenjiang Anhui Province Key Laboratory of Software Engineering in Computing and Communication School of Computer Science and Technology University of Science and Technology of China HefeiAnhui230027 China

ISBN: (纸本)9783319938028

The negative survey is an emerging method of collecting sensitive information. It could obtain the distribution of sensitive information while preserving the personal privacy. When collecting sensitive information, several questions are often provided together to the respondents. However, when reconstructing positive survey results of multiple questions, previous reconstruction methods have some shortcomings. In this paper, we propose a new reconstruction method for multi-question negative surveys. Experimental results show that our method could obtain more reasonable results. © Springer International Publishing AG, part of Springer Nature 2018.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Chaos-based estimation method for software reliability

Chaos-based estimation method for software reliability

引用

2nd International Conference on Networks Security, Wireless communications and Trusted Computing, NSWCTC 2010

作者： Shao, Chenxi Huang, Chao MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology of China Hefei Anhui China Computer Science Department University of Science and Technology of China Hefei Anhui China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui China

ISBN: (纸本)9780769540115

Reliability is one of the essential attributes of the dependable software, and an important factor for quantitatively characterizing software quality. Conventional methodology is software Reliability Growth Model (SRGM), which specifies the form of a random process that describes the behavior of software failures with respect to time. In this paper, we propose that the behavior of software failures possesses determinacy as well as randomness. So we apply chaos theory to software reliability assessment. Based on chaos theory, we can estimate software reliability according to the objective law hidden in the data, unlike the SRGM which usually makes a number of assumptions. This approach avoids the subjectivity in the SRGM. Also, we analyze the actual software failures data sets with the add-weighted one-rank localregion method (AOLM) based on chaos theory and compare the results with the conventional stochastic SRGM JM (Jelinsky-Moranda) model and NHPP (nonhomogeneous poisson process) mode. Comparison results show that the proposed method fits better than the stochastic ones. © 2010 IEEE.

关键词： software reliability

来源：评论

学校读者我要写书评

暂无评论

A Real-time Relaxed Garbage Collection in DSM

引用

电子学报(英文版) 2007年第1期16卷 7-12页

作者： WU Junmin SONG Zhenhua Anhui Province Co-Key Laboratory of High Performance Computing and Application Department of Computer Science ＆ Technology University of Science ＆ Technology of China Hefei 230027 China

Garbage collection is a memory management mechanism for automatically reclaiming garbage objects in memory. It can effectively relieve the programmers' burden and optimize the design of programs. Currently many garbage collection methods for distributed systems have been put forth as the distributed systems are more and more popular. Relaxed consistency model is a very important kind of memory consistency model in distributed system, but it is inefficiently to perform garbage collection in the Distributed shared memory system (DSM) on relaxed memory model with traditional methods. This article proposes a trace-based garbage collection algorithm for DSM system based on relaxed memory model. Our algorithm notes the references among active objects of every node in DSM system, which makes the application process and the collection process able to execute concurrently. And it makes use of the relaxed consistency model's features to reduce communication cost and response delay. Furthermore, the use of two tables insures the algorithm correct and effective. This algorithm displays its advantages of real-time and incremental, and it is proved to be correct and effective.

关键词：垃圾回收算法分布式共享存储系统实时弱一致性模型 DSM

来源：评论

学校读者我要写书评

暂无评论

Models of parallel computation :a survey and classification

引用

中国高等学校学术文摘·计算机科学 2007年第2期1卷 156-165页

作者： ZHANG Yunquan CHEN Guoliang SUN Guangzhong MIAO Qiankun Laboratory of Parallel Computing Institute of SoftwareChinese Academy of SciencesBeijing 100080China State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100080China Anhui Province-MOST Key Co-Lab of High Performance Computing and Its Applications Department of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefei 230027China

In this paper,the state-of-the-art parallel computational model research is *** will introduce various models that were developed during the past *** to their targeting architecture features,especially memory organization,we classify these parallel computational models into three *** models and their characteristics are discussed based on three generations *** believe that with the ever increasing speed gap between the CPU and memory systems,incorporating non-uniform memory hierarchy into computational models will become *** the emergence of multi-core CPUs,the parallelism hierarchy of current computing platforms becomes more and more *** this complicated parallelism hierarchy in future computational models becomes more and more important.A semi-automatic toolkit that can extract model parameters and their values on real computers can reduce the model analysis complexity,thus allowing more complicated models with more parameters to be *** memory and hierarchical parallelism will be two very important features that should be considered in future model design and research.

关键词： parallel computational models hierarchicalmemory hierarchical parallelism three generations memorymodel

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：