共查询到20条相似文献,搜索用时 78 毫秒
1.
2.
复杂系统平均寿命综合评估方法研究 总被引:1,自引:0,他引:1
提出了一种利用复杂系统组成设备的试验信息,对复杂系统平均寿命进行综合评估的方法.同时还给出了设备级试验数据具有删失情况下的数据转化方法及设备级可靠度的评估方法.最后,通过计算机模拟对所提供方法进行了验证. 相似文献
3.
吴淦洲 《数学的实践与认识》2014,(5)
首先用离散傅立叶变换对音乐进行预处理,然后根据不同类型音乐的统计规律提取了特征向量.最后利用BP神经网络对特征向量进行训练,建立了一种基于神经网络的音乐分类方法.仿真实验结果表明,方法是一种有效的分类方法. 相似文献
4.
对2005年高教社杯全国大学生数学建模竞赛C题"雨量预报方法的评价"的解决方法进行了讨论.给出了确定观测站点预报雨量的距离权重法与插值法,并进行了比较.同时,对预报质量的进一步提高进行了探讨. 相似文献
5.
将0-1离散规划通过一个非线性等式约束表示为[0,1]区间上等价的连续变量非线性规划列式.对非线性等式约束的问题进行了两种方法的处理.第一种方法使用乘子法,第二种方法将非线性的等式约束近似为一个非线性的不等式约束,均利用遗传算法程序GENOCOP进行了求解.对多个算例进行了计算,结果表明了该方法的可行性和有效性. 相似文献
6.
残缺互补判断矩阵排序的一种新方法 总被引:1,自引:0,他引:1
对残缺互补判断矩阵的排序方法进行了研究.把一般互补判断矩阵的排序方法推广到了残缺判断矩阵的情形,分析了参数的取值范围,并对判断信息完全未知的情形进行了讨论.最后给出了算例,对几种排序方法作了比较,结论表明本文给出的方法权重差异较大,更易于方案的排序. 相似文献
7.
非负矩阵分解是一种流行的数据表示方法,已广泛应用于图像处理和模式识别等问题.但是非负矩阵分解忽略了数据的几何结构. 而现有的基于简单图的学习方法只考虑了图像的成对信息,并且对计算相似度时的参数选择非常敏感. 超图学习方法可以有效地解决这些问题. 超图利用超边将多个顶点相连接用以表示图像的高维结构信息. 然而, 现有的大部分超图学习方法都是无判别的学习方法.为了提高识别效果, 提出了基于具有判别信息的超图和非负矩阵分解方法的新模型, 利用交替方向法进行迭代求解新模型, 并结合最近邻方法进行人脸识别. 在几个常用标准人脸图像数据库上进行实验, 实验结果表明提出的方法是有效的. 相似文献
8.
基于vague集投影及距离的模糊多指标决策 总被引:6,自引:1,他引:6
提出了两个vague值投影和距离的概念,并在此基础上给出了考虑指标权重影响的基于vague集投影和距离的多指标模糊决策方法.在这个方法中,利用候选方案在理想方案上的投影和距离来求出最佳方案.此方法与文献现有的应用vague集相似度度量进行决策的方法相比较,新方法更加合理且弥补了现有方法的不足之处.最后对实例进行分析计算,算例验证了该方法的有效性. 相似文献
9.
10.
求解间断系数椭圆型问题的一种改进的DG方法 总被引:1,自引:0,他引:1
本文考虑对间断系数椭圆型问题的普通DG方法进行改进,提出了一种综合了DG方法及区域分解方法的优点的新方法.对此法进行了先验误差分析并给出其残量型后验误差估计,且通过数值实验验证了该方法及其自适应方法的有效性. 相似文献
11.
两类带有确定潜伏期的SEIS传染病模型的分析 总被引:2,自引:0,他引:2
通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异.对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在.对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的. 相似文献
12.
Let be a finite simple graph. For , the difference of , where is the neighborhood of and is called the critical difference of . is called a critical set if equals the critical difference and is the intersection of all critical sets. is the union of all critical independent sets. An independent set is an inclusion minimal set with if no proper subset of has positive difference.A graph is called a König–Egerváry graph if the sum of its independence number and matching number equals .In this paper, we prove a conjecture which states that for any graph the number of inclusion minimal independent set with is at least the critical difference of the graph.We also give a new short proof of the inequality .A characterization of unicyclic non-König–Egerváry graphs is also presented and a conjecture which states that for such a graph , the critical difference equals , is proved.We also make an observation about using Edmonds–Gallai Structure Theorem as a concluding remark. 相似文献
13.
科学合理的规模结构不仅是实现规模经济的基本条件,而且是提高经济效益、降低交易成本、获得较高的企业竞争力的重要保证.基于规模理论,从生产规模、资本规模、市场规模以及效益规模四大因素入手,提出了一套基于规模的企业竞争力评价指标体系,运用蜘蛛图法建立了基于规模的企业竞争力评价模型,并结合具体的数据分析说明了企业竞争力的大小强弱.此种方法具有直观形象、定量化、可操作性强的特点. 相似文献
14.
DP-coloring of a simple graph is a generalization of list coloring, and also a generalization of signed coloring of signed graphs. It is known that for each , every planar graph without is 4-choosable. Furthermore, Jin et al. (2016) showed that for each , every signed planar graph without is signed 4-choosable. In this paper, we show that for each , every planar graph without is 4-DP-colorable, which is an extension of the above results. 相似文献
15.
Houmem Belkhechine 《Discrete Mathematics》2017,340(12):2986-2994
Given a tournament , a module of is a subset of such that for and , if and only if . The trivial modules of are ,
and . The tournament is indecomposable if all its modules are trivial; otherwise it is decomposable. The decomposability index of , denoted by , is the smallest number of arcs of that must be reversed to make indecomposable. For , let be the maximum of over the tournaments with vertices. We prove that and that the lower bound is reached by the transitive tournaments. 相似文献
16.
Takahiko Hara 《Annals of the Institute of Statistical Mathematics》1988,40(2):395-406
This paper is concerned with two kinds of multiple outlier problems in multivariate regression. One is a multiple location-slippage problem and the other is a multiple scale-inflation problem. A multi-decision rule is proposed. Its optimality is shown for the first problem in a class of left orthogonally invariant distributions and is also shown for the second problem in a class of elliptically contoured distributions. Thus the decision rule is robust against departures from normality. Further the null robustness of the decision statistic which the rule is based on is pointed out in each problem. 相似文献
17.
18.
The edit distance problem for rooted unordered trees is known to be NP-hard. Based on this fact, this paper studies exponential-time algorithms for the problem. For a general case, an time algorithm is presented, where and are the numbers of nodes and and are the numbers of branching nodes in two input trees. This algorithm is obtained by a combination of dynamic programming, exhaustive search, and maximum weighted bipartite matching. For bounded degree trees over a fixed alphabet, it is shown that the problem can be solved in time for any fixed . This result is achieved by avoiding duplicate calculations for identical subsets of small subtrees. 相似文献
19.
Let be a set of at least two vertices in a graph . A subtree of is a -Steiner tree if . Two -Steiner trees and are edge-disjoint (resp. internally vertex-disjoint) if (resp. and ). Let (resp. ) be the maximum number of edge-disjoint (resp. internally vertex-disjoint) -Steiner trees in , and let (resp. ) be the minimum (resp. ) for ranges over all -subset of . Kriesell conjectured that if for any , then . He proved that the conjecture holds for . In this paper, we give a short proof of Kriesell’s Conjecture for , and also show that (resp. ) if (resp. ) in , where . Moreover, we also study the relation between and , where is the line graph of . 相似文献