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

A parallel NURBS-based isogeometric analysis framework on multi-core CPUs

Journal of computational Information Systems 2012年第16期8卷 6589-6600页

作者： Guo, Licai Huang, Zhangjin Gu, Naijie School of Computer Science and Technology University of Science and Technology of China China Key Laboratory of Software in Computing and Communication Anhui China USTC-SICT Joint Laboratory on Network and Communication China

A parallel framework for NURBS-based isogeometric analysis on multi-core cpus is presented in this paper. The framework is composed of two parts: (1) construction of the stiffness matrix and right hand side vector;(2) a parallel sparse solver. We analyze the properties of NURBS basis, use the ELLPACK format to store the stiffness matrix. The parallel strategy is dividing the matrix and vectors into disjoint parts. Each core computes one part in parallel. We test the effectiveness and efficiency of the framework on an 8-core machine and a 48-core machine. The framework solves the 2-d poisson equation and can solve 1.05 million degrees of freedom in about 22 seconds using 32 cores. The speed-up of the construction reaches 28.3 using 32 cores. © 2012 Binary Information Press.

关键词： Stiffness matrix

来源：评论

学校读者我要写书评

暂无评论

AN APPROACH BASED ON TSA-TREE FOR ACCURATE TIME SERIES CLASSIFICATION

AN APPROACH BASED ON TSA-TREE FOR ACCURATE TIME SERIES CLASS...

引用

2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems

作者： Xiaoxu He Chenxi Shao School of Computer Science and Technology University of Science and Technology of China Anhui Province Key Laboratory of Software in Computing and Communication

In order to improve the performance of time series classification, we introduce a new approach of time series classification. The first step of the approach is to design a feature exaction model based on Trend and Surprise Abstraction tree （TSA-tree）. The second step of the approach is to combine the exacted global feature and 1 nearest neighbor to classify time series. The proposed approach is compared with a number of known classifiers by experiments in artificial and real-world data sets. The experimental results show it can reduce the error rates of time series classification, so it is highly competitive with previous approaches.

关键词： Feature exaction dimension reduction classification TSA-tree

来源：评论

学校读者我要写书评

暂无评论

Evolutionary repair for evolutionary design of combinational logic circuits

Evolutionary repair for evolutionary design of combinational...

引用

Congress on Evolutionary computation

作者： Xin Zhang Wenjian Luo School of Computer Science and Technology Anhui Province key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

Evolutionary algorithms have been adopted to design logic circuits for many years. However, it takes too much time for evolutionary algorithms to generate circuits directly. Recently, the repair technique has been introduced into evolutionary design of the circuit to significantly decrease the time cost. And yet, the repair technique costs a lot of gate resource. In this paper, the evolutionary repair for evolutionary design of the combinational circuit is proposed, which generates the repair circuits with an evolutionary algorithm. The evolutionary repair could reduce the gate resource cost and does not spend much more time. The evolutionary repair is merged into the traditional evolutionary algorithm to form a novel evolutionary design algorithm, i.e. the erEDA. The experimental results demonstrate that the erEDA could balance the time cost and the gate resource consumption.

关键词： Maintenance engineering Logic gates Evolutionary computation Vectors Pins Adders Layout

来源：评论

学校读者我要写书评

暂无评论

A Parallel NURBS-based Isogeometric Analysis Framework on Multi-core CPUs

A Parallel NURBS-based Isogeometric Analysis Framework on Mu...

引用

2012年全国理论计算机科学学术年会(NCTCS2012)

作者： Licai Guo Zhangjin Huang School of Computer Science and Technology University of Science and Technology of China PR China USTC-SICT Joint Laboratory on Network and Key Laboratory of Software in Computing and Communication Anhui Province PR China USTC-SICT Joint Laboratory on Network and Communication PR China School of Computer Science and Technology University of Science and Technology of China PR China

parallel framework for NURBS-based isogeometric analysis on multi-core cpus is presented in this *** framework is composed of two parts:(1) construction of the stiffness matrix and right hand side vector; (2) a parall...

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fault diagnosis design based on qualitative simulation

Fault diagnosis design based on qualitative simulation

引用

International Conference on Intelligent Control and Information Processing (ICICIP)

作者： Chenxi Shao Zhenzhong Shao Juntao Zhang Fanzhou Bai College of Computer Science & Technology University of Science and Technology of China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui China Jianghuai Automobile Co. Ltd. Hefei China College of Computer Science & Technology University of Science and Technology of China Hefei

Based on the QSIM reasoning of Kuipers, comparative constraint is presented to reduce the diagnosis space. The transfer regulation of qualitative constrain is used in the simulation and reasoning of system diagnosis. This arithmetic takes observed faulty state as the beginning, to diagnosis the discrepancy of variable and location of the causation according to the transfer regulation of qualitative constraint, reasons from faulty diagnosed to examine the result and delete the redundancy of diagnosis result. In the example of Condensation refrigeration system, the constraint relation is built according to qualitative difference equation. Aim at the bad efficiency of refrigeration, the mixture of air or Freon superfluously is diagnosed as the result faulty source, is consistent with the factual system.

关键词： Circuit faults Mathematical model Differential equations Algebra Valves Cognition Educational institutions

来源：评论

学校读者我要写书评

暂无评论

An adaptive strategy for updating the memory in evolutionary algorithms for dynamic optimization

An adaptive strategy for updating the memory in evolutionary...

引用

IEEE Symposium on computational Intelligence in Dynamic and Uncertain Environments

作者： Zhu, Tao Luo, Wenjian Li, Zhifang Nature Inspired Computation and Applications Laboratory School of Computer Science and Technology University of Science and Technology of China Hefei 230027 Anhui China Anhui Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei 230027 China

ISBN: (纸本)9781424499311

The memory scheme is one of the most widely employed techniques in Evolutionary Algorithms for solving dynamic optimization problems. The updating strategy is a key concern for the memory scheme. Unfortunately, the existent memory updating strategies neglect the characteristics of the memory updating behaviors, and sometimes this could lead results against the original intention. In this paper, a novel updating strategy is proposed, which can adaptively update the memory according to the characteristics of the memory updating behaviors. Experiments are carried out in different kinds of dynamic environments, and the experimental results show that the proposed strategy is better than the traditional strategies. © 2011 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

A Hybrid of the prefix algorithm and the q-hidden algorithm for generating single negative databases

A Hybrid of the prefix algorithm and the q-hidden algorithm ...

引用

IEEE Symposium on computational Intelligence in Cyber Security

作者： Liu, Ran Luo, Wenjian Wang, Xufa School of Computer Science and Technology University of Science and Technology of China Hefei 230027 Anhui China Anhui Key Laboratory of Software Engineering in Computing and Communication Hefei 230027 Anhui China

ISBN: (纸本)9781424499069

The negative database (NDB) is a complement of the corresponding database. The NDB could protect the privacy of the data, but it should be complete and hard-to-reverse. However, existent techniques cannot generate the complete and hard-to-reverse negative database. In this paper, a hybrid method is proposed to generate single negative databases. The proposed hybrid method includes two phases. Firstly, a complete negative database with a small size is generated by the transformation of the prefix algorithm. Secondly, a hard-to-reverse negative database, which is generated with the q-hidden method, is added into the small complete negative database. Therefore, the hybrid negative database is both complete and hard-to-reverse. Experiment results show that the NDB generated by the hybrid method is better than the NDB generated by the typical q-hidden method. Especially, the NDB generated by the q-hidden method can be reversed on average when the string length is 300. However, the NDB generated by the hybrid method cannot be reversed on average when the string length is 150. © 2011 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

On the self representation based on the adaptive self radius

On the self representation based on the adaptive self radius

引用

4th International Workshop on Advanced computational Intelligence, IWACI 2011

作者： Zhang, Jie Luo, Wenjian School of Computer Science and Technology University of Science and Technology of China Hefei 230027 Anhui China Anhui Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei 230027 Anhui China

ISBN: (纸本)9781612843735

Self representation problem is very important for the negative selection algorithms. In this paper, two methods, named as K-NN-ASR and B-NN-ASR, are proposed to calculate the self radius of a self sample in the continuous space. As for the K-NN-ASR, the self radius of a self sample is calculated according to the distances from itself to the surrounding self samples. In the B-NN-ASR, both the position of the self sample and the distances to the surrounding self samples are considered. Experiments are done to test the performance of the proposed methods. Experimental results demonstrate that the proposed methods are competitive, and the B-NN-ASR is better. © 2011 IEEE.

关键词： selection algorithm Self tuning CONTINUOUS SPACE

来源：评论

学校读者我要写书评

暂无评论

Directed differential evolution based on directional derivative for numerical optimization problems

Directed differential evolution based on directional derivat...

引用

2011 11th International Conference on Hybrid Intelligent Systems, HIS 2011

作者： Zhang, Jun Luo, Wenjian School of Computer Science and Technology University of Science and Technology of China Hefei 230027 Anhui China Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei 230027 Anhui China

ISBN: (纸本)9781457721502

Differential Evolution is one kind of Evolutionary Algorithms, which has been successfully applied to solve many optimization problems. In this paper, a directed differential mutation (DDM), which utilizes the directional derivative to decide a suitable search direction and a proper mutation step size, is proposed. It is merged into the classical DE to form a new algorithm, named directed differential evolution (DDE). The performance of the DDE is tested on 23 classical problems for numerical optimization. The experimental results demonstrate that the performance of the DDE outperforms the classical DE on most functions. © 2011 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Implicit interpolation of time vector series

Implicit interpolation of time vector series

引用

2011 7th International Conference on Natural computation, ICNC 2011

作者： Li, Dao-Lun Zha, Wen-Shu Lu, De-Tang Department of Modern Mechanics University of Science and Technology of China China Key Laboratory of Software in Computing and Communication of Anhui Province University of Science and Technology of China Hefei 230027 China

ISBN: (纸本)9781424499533

Time vector series abound in many fields, which are different from time series. Based on mapping and implicit function interpolation, the method of implicit interpolation over time vector series is developed and studied. Time vector series are mapped into a sequence of closed curves or surfaces, which are seen as the interpolation data set. Based on the interpolation data set, the implicit interpolation function is constructed and from which an isoline is drawn. The inverse mapping of the isoline is the prediction of vector series at the new time. Based on the well logging data an application is given to predict the unknown isotope logging data of year 2004 with the known data of year 2003 and 2005 which shows the performance of the method. © 2011 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：