Because of thinking only the number of data but not fitting function,we would be adequate to take a farther afield when calculating group data with empirical formula.We have proved the three theorems based on studying the normal distribution,and then reach the conclusion there is a better method to do the same work.The method is simpler and more practical than empirical method and also work well with any skewed distribution.
We deal with two problem of selecting the location of building a large-scale comprehensive hospital and many dressing stations in a city.Where should we found the station is an important issue being worth of studying,which is to minimize the sum of distance to each residential point in a certain range.We can find two theorems and two propositions to the vertex of the tree graph,algorithm of Dijkstra,though it is considerably time-consuming.Here,two new simple and practical algorithms of the tree graph are proposed,which are less time-consuming and calculation consumption.
In this paper,the edge and vertex weighted graph,the transportation capacity of vertex to the graph and centroid of the graph are introduced and studied.By comparing transportation capacity of two adjacent vertices,it obtains that a necessity and sufficiency condition is that a vertex of a graph is centroid and the number of the centroids of a graph is not greater than 2.In addition,the algorithm on finding the centroid and the minimal transportation capacity are derived,of whih its complexity is O(n2).It is conducive to solve the optimization problem,which can be made by dendrogram.
In this paper,by the use of combining theoretical analysis and programming judgement methods,we obtain the results that generators of all the maximal subgroups of Sn and the order of each such subgroup,and so on. We use the results to verify on Sn (n=2,3,4,5,6) and show the correctness of the program judgement. Summarizing the results of the calculation we obtain a recursive definition of Sn,and the result that Sn can be generated by the binary elements,which may facilitate us to have further researches on abstract groups.
二十多年来,我国的摩托车工业获得很大发展。今天,我国的产量及出口量都占世界一半以上。成绩背后存在问题,主要问题:同行之间大打价格战,利润微薄,近三分之一的企业亏损。为此,提出一个数学模型,并提出相应的算法。
本文研究关于余直径的度条件,主要结果是,若G是3-连通图,其顶点集为V(G)={υ1,υ2,…,υn},其度序列为:d(υ1)≤d(υ2)≤…≤d(υn)则对G的任意一条边e都存在特征点对υa,υb,使G中过e的最长圈至少为d(υa)+d(υb)-1.在相同的条件下我们有d*(G)≥m-2,
本文对近120个由部首相同的两个字构成的双声叠韵实词进行了分析,认为从这些词的部首就能大概看出它们是形容人什么样或比喻什么样的人.
本文根据校报实际情况,提出了编辑在办报过程中如何让校报抓住读者的心,和怎样发挥副刊的导向作用.