基于Python的Abaqus二次开发在层压板修理模拟中的应用

为加快复合材料层压板单面贴补参数设计的效率,利用基于Python的Abaqus二次开发技术,开发针对复合材料层压板单面贴补修理的快速建模及后处理程序.结果表明,程序能够通过输入单面贴补设计参数便捷地创建模型,并且计算结束后能通过快速后处理程序自动提取所需的数据和信息.该程序能够针对单面贴补修理母板的长度、宽度、单层厚度、层数和铺层顺序,补片的层数、直径和铺层顺序,以及复合材料单向预浸料和胶膜的性能等参数进行设计分析.用该程序计算得到的易破坏位置和破坏模式与试验结果的误差小于10%,证明该程序可行.     

并行Hough变换快速航迹起始

Hough变换在航迹起始领域得到广泛应用,但在扫描次数较少时起始效果不佳。通过转变Hough变换处理结构和改变计数器累加方式,提出了一种并行Hough变换快速航迹起始算法。利用Hough变换将不同时刻的量测集合分别映射到参数空间,继而将空间中具有相同索引的各次累加结果构成累加向量,统计其非零元素的个数,如大于预先设定的门限,则用向量各元素求和作为累加结果,否则置零。将利用该方法获得最终的累加结果进行门限检测来确定是否起始航迹。仿真实验表明,该算法可在密集环境下快速准确地起始航迹。     

基于伪码自相关特性与三次样条插值的GPS信号快速捕获算法

提出了一种新的基于伪码自相关特性和三次样条捅值拟合方法的GPS信号快速捕获算法.首先通过低频采样序列依据循环相关法求得C/A码相位粗略值;然后根据C/A码相位粗略值得到用于二次捕获的高频采样部分序列,利用伪码自相关特性求得精确C/A码相位值;最后利用三次样条插值法处理相关谱谱峰及邻近数据以进一步提高C/A码相位的测量精度.仿真结果表明该算法具有精度高、运算量小的优点.     

Approaches for scaling DBSCAN algorithm to large spatial databases

The huge amount of information stored in datablases owned by coporations(e.g.retail,financial,telecom) has spurred a tremendous interest in the area of knowledge discovery and data mining.Clustering.in data mining,is a useful technique for discovering intersting data distributions and patterns in the underlying data,and has many application fields,such as statistical data analysis,pattern recognition,image processsing,and other business application,s Although researchers have been working on clustering algorithms for decades,and a lot of algorithms for clustering have been developed,there is still no efficient algorithm for clustering very large databases and high dimensional data,As an outstanding representative of clustering algorithms,DBSCAN algorithm shows good performance in spatial data clustering.However,for large spatial databases,DBSCAN requires large volume of memory supprot and could incur substatial I/O costs because it operates directly on the entrie database,In this paper,several approaches are proposed to scale DBSCAN algorithm to large spatial databases.To begin with,a fast DBSCAN algorithm is developed.which considerably speeeds up the original DBSCAN algorithm,Then a sampling based DBSCAN algorithm,a partitioning-based DBSCAN algorithm,and a parallel DBSCAN algorithm are introduced consecutively.Following that ,based on the above-proposed algorithms,a synthetic algorithm is also given,Finally,some experimental results are given to demonstrate the effectiveness and efficiency of these algorithms.     

一种基于密度的快速聚类算法

聚类是数据挖掘领域中的一个重要研究方向,聚类技术在统计数据分析、模式识别、图像处理等领域有广泛应用,迄今为止人们提出了许多用于大规模数据库的聚类算法。基于密度的聚类算法DBSCAN就是一个典型代表。以DBSCAN为基础,提出了一种基于密度的快速聚类算法。新算法以核心对象领域中所有对象的代表对象为种子对象来扩展类,从而减少区域查询次数,降低I/O开销,实现快速聚类,对二维空间数据测试表明：快速算法能够有效地对大规模数据库进行聚类,速度上数倍于已有DBSCAN算法。     

Mathematical Morphology Based on Linear Combined Metric Spaces on Z2 (Part I): Fast Distance Transforms

Mathematical Morphology (MM) is a general method for image processing based on set theory. The two basic morphological operators are dilation and erosion. From these, several non linear filters have been developed usually with polynomial complexity, and this because the two basic operators depend strongly on the definition of the structural element. Most efforts to improve the algorithm's speed for each operator are based on structural element decomposition and/or efficient codification.A new framework and a theoretical basis toward the construction of fast morphological operators (of zero complexity) for an infinite (countable) family of regular metric spaces are presented in work. The framework is completely defined by the three axioms of metric. The theoretical basis here developed points out properties of some metric spaces and relationships between metric spaces in the same family, just in terms of the properties of the four basic metrics stated in this work. Concepts such as bounds, neighborhoods and contours are also related by the same framework.The presented results, are general in the sense that they cover the most commonly used metrics such as the chamfer, the city block and the chess board metrics. Generalizations and new results related with distances and distance transforms, which in turn are used to develop the morphologic operations in constant time, in contrast with the polynomial time algorithms are also given.     

小波分析快速算法的加速方法

本文首先给出了小波滤波器分解方法,导出了类似于快速傅立叶变换的小波快速变换算法。它比著名的Mallat算法更简单、方便、计算速度更快,同时它还可以根据分析的信号自适应地选择小波滤波器参数。     

A fast algorithm for determining the linear complexity of a binary sequence with period 2 n p m

An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2 ⁿ p ^m is proposed and proved, where 2 is a primitive root modulop ². The new algorithm generalizes the algorithm for computing the linear complexity of a binary sequence with period 2 ⁿ and the algorithm for computing the linear complexity of a binary sequence with periodp ⁿ , where 2 is a primitive root modulop ².     

The generalized unified computation of multidimensional discrete orthogonal transforms

By introducing a form of reorder for multidimensional data, we propose a unified fast algo-rithm that jointly employs one-dimensional W transform and multidimensional discrete polynomial trans-form to compute eleven types of multidimensional discrete orthogonal transforms, which contain three types of m-dimensional discrete cosine transforms ( m-D DCTs) ,four types of m-dimensional discrete W transforms ( m-D DWTs) ( m-dimensional Hartley transform as a special case), and four types of generalized discrete Fourier transforms ( m-D GDFTs). For real input, the number of multiplications for all eleven types of the m-D discrete orthogonal transforms needed by the proposed algorithm are only 1/m times that of the commonly used corresponding row-column methods, and for complex input, it is further reduced to 1/(2m) times. The number of additions required is also reduced considerably. Furthermore, the proposed algorithm has a simple computational structure and is also easy to be im-plemented on computer, and th     

On basic properties of fault-tolerant multi-topology routing

Multi-topology routing has recently gained popularity as a simple yet efficient traffic engineering concept. Its basic purpose is to separate different classes of network traffic, which are then transported over disjoint logical topologies. Multi-topology routing is used as a basis for implementation of an IP fast reroute scheme called Multiple Routing Configurations (MRC).MRC has a range of attractive properties, but they do come at a cost. In order to guarantee recovery from any single link or node failure in the network, MRC has to maintain several logical topologies and thus an increased amount of routing information. The number of the logical topologies in MRC need not be large; even simple heuristic algorithms often yield good results in practice. However, why this is the case is not fully understood yet.In this paper, we introduce a theoretical framework for fault-tolerant multi-topology routing (FT-MTR). MRC is a practical implementation of FT-MTR in connectionless IP networks. We use FT-MTR to study how the internal topological structure of the communication network relates to two important problems. The first problem is minimizing the number of logical topologies and thus the routing state in FT-MTR. We show how to use the sets of nodes that separate the topology graph to devise an advanced heuristic for “intelligent” construction of the logical topologies. Finding the separating sets in a topology graph is computationally demanding; we present an algorithm that performs well in tested real network topologies. We evaluate the separation-set based heuristic for the logical topology construction and show that it outperforms the known MRC heuristics.The second problem is the FT-MTR load distribution after a failure. We use the separating sets to devise a novel algorithm for failure load distribution. This algorithm does not require knowledge of the traffic demand matrix, still, our tests indicate that it performs as good as, or better than, known MRC load-distribution algorithms that do require the demand matrix as input.