基于区分能力大小的决策表属性约简算法

The attribute reduction algorithms of decision table based on discernible matrix are required to construct discernible matrix, which reduces efficiency of algorithms. In this paper, the relationship between attribute discernible matrix and its discernibility is first established for general information systems. Based on the idea that the equivalent discernible matrix has a same attribute reduction, existing matrices are modified and a formula of attribute discernibility associated with algebraic reduction for decision table is proposed. A heuristic attribute reduction algorithm based on attribute discernibility is presented. Experimental results indicate that the algorithm can more easily explore an optimal or sub-optimal reduction, and is efficient.     

Internal force and deformation matrixes and their applications in load path

This paper deals with the internal force and the deformation matrixes, both of which can be used to analyze the topological relationship of a structure. Based on the reciprocal theorem, the relationship between the two matrixes is established, which greatly simplifies the computation of the internal force matrix. According to the characteristics of the internal force matrix, the transfer law of the matrix itself（due to the removal of components） is established based on the principle of linear superposition. With the relation of the two matrixes, the transfer law of the deformation matrix is also obtained. The transfer law illuminates the change regularity of internal force or deformation of the remnant structure when certain members are cut offone after another. The results of numerical examples show that the proposed methods are correct, reliable and effective.     

Graph representation of n-dimensional space

This paper investigates how graph representation can be created for the mesh which is a discrete approximation of n-dimensional continuous space. The paper discusses the relationship between mesh dimensionality and the type and quantity of edges connecting each vertex with its neighbors. Basing on the analysis, a simple algorithm is also proposed to create such graph representation. The purpose of the graph is to search optimal paths and trajectories in the represented space.     

Symmetry properties of tetraammine platinum（Ⅱ） with C2v and C4v point groups

Let G be a weighted graph with adjacency matrix A=[aij]. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix D=[d/ij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dij can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for different nuclei.Balasubramanian (1995) computed the Euclidean graphs and their automorphism groups for benzene, eclipsed and staggered forms of ethane and eclipsed and staggered forms of ferroeene. This paper describes a simple method, by means of which it is possible to calculate the automorphism group of weighted graphs. We apply this method to compute the symmetry of tetraammine platinum(Ⅱ) with C2v and C4v point groups.     

Emerging Educational Institutional Decision-Making Matrix

The ＂emerging educational institutional decision-making matrix＂ is developed to allow educational institutions to adopt a rigorous and consistent methodology of determining which of the myriad of emerging educational technologies will be the most compelling for the institution, particularly ensuring that it is the educational or pedagogical but not the technological imperative that drives the technology integration agenda. The matrix is designed to be used after some initial research into an emerging technology. Once a technology is put through the matrix, a member of options are available： （1） shelving the technology; （2） putting the technology on hold and maintaining a watching brief until the technology matures in the market; and （3） researching the product further by conducting a trial or placing in testing sandpit. After further research, the technology can be tested as a pilot to determine how well or otherwise, the technology works within the institution. If an emerging technology has more than one product associated with it, a second and third step in the matrix has been developed, and the second step assigns a rating to each of the categories within the matrix. With many products containing similar features, a third step has been developed to compare products on a feature level.     

阅读理解五篇

A A ride in a cable-car is one of the most exciting and enjoyable experiences a child can have. In Switzerland, which is the home of the cable-car, it is used mostly to take tourists up the slope of a mountain, to a restaurant from which one can have a bird's-eye view of the surrounding country, or to the top of ski-run, from which, in winter, skiers glide down the snow-cov- ered slope on skis, in Singapore, however, the cable-car takes one from the summit of a hill on the main island     

具有小直径平面图的电力控制数

The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well-known vertex covering and dominating set problems in graph theory. In this paper, it was shown that the power domination number of an outerplanar graph with the diameter two or a 2-connected outerplanar graph with the diameter three is precisely one. Upper bounds on the power domination number for a general planar graph with the diameter two or three were determined as an immediate consequences of results proven by Dorfling, et al. Also, an infinite family of outerplanar graphs with the diameter four having arbitrarily large power domination numbers were given.     

Advantage and Disadvantatge of Surfing on the Internet

Now in the world, it is a common practice for people to go on the Internet. With its convenience and fast speed, one can get a lot of information from the Internet. In a minute one comes to the section2 you want. What one needs to do is to press the button or type a few letters on the computers.     

Single-acting double-stator multi-pumps and multi-motors

We investigated a series of novel motors and pumps with a new structure called double-stator. Double-stator can be used as pump or motor just for the working condition on demand. A certain amount of pumps or motors are formed in one shell and these subpumps or submotors can work alone or in company without influence on other pumps or moters. This kind of double-stator pumps （motors） are called multi-pumps （multi-motors）. Through the analysis of multifarious connection modes of single-acting double-stator multi-pumps and multi-motors, the mathematical expressions of output flow rate, rotational speed and torque are acquired. The results indicate that different flow rates can be provided by one fixed displacement double-stator multi-pump system under the condition of an unalterable driven speed. Likewise, under the terms of a fixed input flow and without complex variable mechanisms, the functions of double speeds, multiple speeds and even differential connection can be realized by a double-stator multi-motor system with various output rotational speeds and torques.     

Relation among C-curve characterization diagrams

As three control points are fixed and the fourth control point varies, the planar cubic C-curve may take on a loop, a cusp, or zero to two inflection points, depending on the position of the moving point. The plane can, therefore, be partitioned into regions labelled according to the characterization of the curve when the fourth point is in each region. This partitioned plane is called a "characterization diagram". By moving one of the control points but fixing the rest, one can induce different characterization diagrams. In this paper, we investigate the relation among all different characterization diagrams of cubic C-curves based on the singularity conditions proposed by Yang and Wang (2004). We conclude that, no matter what the C-curve type is or which control point varies, the characterization diagrams can be obtained by cutting a common 3D characterization space with a corresponding plane.     

Drawing Weighted Directed Graph from It＇s Adjacency Matrix

This paper proposes an algorithm for building weighted directed graph, defmes the weighted directed relationship matrix of the graph, and describes algorithm implementation using this matrix. Based on this algorithm, an effective way for building and drawing weighted directed graphs is presented, forming a foundation for visual implementation of the algorithm in the graph theory.     

有向图中路径矩阵的实现及其算法研究

在已知有向图的邻接矩阵的基础上 ,分析邻接矩阵的特点 ,从而给出了一种直接由邻接矩阵求解路径矩阵的新算法 ,并对其算法进行了分析和研究 .     

基于有向图的频繁集挖掘算法

针对Apriori算法寻找频繁项集问题,提出了一种基于有向图的频繁集挖掘算法DGFM,该算法将事务数据库表示成二进制矩阵,利用有向图的思想,将频繁项的二进制位串作为有向图的权值,再将二进制矩阵用邻接表存储,通过搜索邻接表来生成频繁项集,最后试验证明该方法比Apriori算法具有更高的效率和性能.     

动态时间弯曲距离精确计算的Dijkstra方法

将动态时间弯曲距离（DTW）的差异矩阵一一对应于点阵,按DTW定义的行走规则对该点阵连线定向,使所对应点阵成为一个有向图,然后使用一个加权技巧对该有向图的边加权后得到一个加权有向图,于是把求DTW的精确计算问题等价地转化为求一个有向图起点到终点的最短路长,从而使图论中求两点间最短路径的方法如目前公认的经典Dijkstra算法均可用于求DTW,因此间接地找到了精确计算DTW的一个新方法.     

一种解释结构模型的优化算法研究

解释结构模型被广泛应用于医疗、教育等领域,但相关理论发展较为缓慢。为加快解释结构模型的计算速度,丰富解释结构模型相关理论,通过对系统各要素所对应有向图的本质关系进行分析,对该模型中的级间划分方法作更深一步解析并给出优化算法,发现有向图中若不存在回路,则有向图汇点对应的是最高级要素集合中的要素,因此汇点可以从缩减可达矩阵中直接找出,从而能对复杂系统要素更快地进行分层。对应的优化算法相比传统方法减少了一倍左右的计算量,并通过实证分析进行验证。该研究结果为解释结构模型方法优化提供了一种新诠释。     

有向图的扩展邻接矩阵存储模式研究

本文对于有向图的存储模式进行了研究。在邻接矩阵和邻接表的基础之上，提出了一种新的有向图存储结构一扩展邻接矩阵，并研究了建立该矩阵的算法。扩展邻接矩阵存储模式同时具有邻接矩阵、邻接表和十字链表三种传统存储结构分别可以快速从有向图获得不同信息的优点。扩展邻接矩阵为有向图的应用，提供了一种高效的存储方案。     

基于被删减二元关系的可达性矩阵求解

利用邻接矩阵求解有向图的可达性矩阵,计算量大,提出将有向图表达成二元关系,忽略环和回路的处理,通过计算被删减二元关系的传递闭包来求解可达性矩阵,利用新方法可以较快地实现可达性矩阵的求解。     

带权图Laplacian矩阵次小特征根下界

谱图理论是图论的重要研究分支,其思想广泛应用于计算机科学的各个领域.带权图Lap lac ian矩阵的次小特征根λn-1的估计被应用于在图像分割和图数据表示中.用代数方法对λn-1的下界进行估计,并讨论非带权图情况下λn-1的下界.     

关于Kruskal算法的一个简便实现

根据数据结构中求一个带权无向连通图的最小生成树算法的特点,文章给出了Kruskal算法的一个简便而完整的C语言实现。特别是对不连通子图的刻画,只引进了一个一维数组就解决了问题。     

有向图的同构判定算法：出入度序列法

同构图指的是在两个图中寻找顶点之间对应的映射,通过映射使得两图中的各条边也保持对应的关系。为了有效提高寻找有向同构图的时间效率、简化操作,首先研究了有向图同构的矩阵存储方式,并针对性的提出了用出入度序列来判断有向图的同构算法。与矩阵存储算法相比,该判定算法的时间更为简短。通过执行判定过程验证了算法的正确性。