共查询到20条相似文献,搜索用时 93 毫秒
1.
从一个常见的不等式谈起,分析了多种证明方法,运用该不等式推导出了多个重要结论,对不等式进行了扩充和加强,解释了蕴含的意义,显示了该不等式的重要性和深刻性. 相似文献
2.
基于粗糙集的患者满意度评价模型及其实证分析 总被引:1,自引:0,他引:1
在文献阅读及实地调研的基础上,本文提出了患者满意度的定义,建立了影响患者满意度的指标体系,介绍了粗糙集的相关概念及利用粗糙集进行评价的步骤,提出了新的约简方法,构建了基于粗糙集的患者满意度评价模型并进行了实证分析,得出了影响患者满意度的关键指标,并计算了关键指标权重,对江西省十个医院进行了综合评价值的计算. 相似文献
3.
提出了交通运输系统协调度的评价分析模型.从系统论的观点出发,提出了交通运输系统协调理论的概念,探讨了交通运输系统随时间而不断演化变迁的规律,给出了交通运输系统协调发展基本步骤;并根据协调学原理,讨论了交通运输系统的协调性问题,提出了系统协调发展模型,对交通运输子系统内部及子系统之间及系统整体的协调发展问题进行了研究,探讨了交通运输可持续发展的系统协调管理过程,为进一步研究交通运输系统的可持续发展奠定了基础. 相似文献
4.
5.
6.
系统动力学在城市污水再生回用系统中的应用 总被引:5,自引:0,他引:5
用系统动力学方法研究了城市污水回用系统.首先分析了影响城市污水回用系统的诸多因素以及它们之间的相互关系,探讨了污水再生回用系统行为和结构的特点,确定了系统中因素之间的定量关系,建立了城市污水回用系统动力学(SD)模型,并介绍了模型的检验方法.同时给出了SD模型的具体应用实例,对西北地区的某一城市的污水回用进行了预测和分析,提出了符合该城市发展的污水回用方案. 相似文献
7.
研究了大型汽轮发电机定子端部固定绕组的压板松动时,位于两侧压板间某段绕组的振动问题.首先,采用分离变量法,给出了发电机运行时定子端部绕组区域的磁感应强度表达式,并给出了绕组所受电磁力及与松动压板间摩擦力的计算式.其次,建立了研究绕组非线性振动问题的力学分析模型,采用多尺度法对主共振情形进行了解析求解,推得了稳态运动下的幅频响应方程,并对定常解的稳定性及分岔奇异性进行了研究,得到了稳定性的判定条件及分岔方程的转迁集.最后,针对工程实际问题进行了计算,给出了相应的幅频响应曲线图,并进行了分析讨论. 相似文献
8.
研究了红树林自然保护区自然环境和人类社会活动对于生态系统的影响,考虑了生物之间的相互关系,将生物量、生物生长的面积等作为主要指标,建立了常微分方程组模型,对生态系统的变化情况进行了描述,借助稳定性分析对方程进行了研究,并进行了数值模拟。根据理论分析和数值模拟的结果,对保护区的林木恢复工作提出了合理的建议。 相似文献
9.
10.
概述了干扰管理理论的内涵、意义以及目标,依据未来不确定因素引起飞机备件需求量变化以及备件供应时限性增强的实际情况,创建了时限一致度算子,优化了备件需求泊松分布模型,提高了备件供应的精确度,并选取了优化后的模型中的多个参量,进行了多因素的扰动性分析,最后构造了算例,验证了本方法的科学性和有效性. 相似文献
11.
12.
13.
In this paper, we establish the precise asymptotic behaviors of the tail probability and the transition density of a large class of isotropic Lévy processes when the scaling order is between 0 and 2 including 2. We also obtain the precise asymptotic behaviors of the tail probability of subordinators when the scaling order is between 0 and 1 including 1.The asymptotic expressions are given in terms of the radial part of characteristic exponent and its derivative. In particular, when varies regularly, as the tail probability is asymptotically equal to a constant times 相似文献
14.
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. 相似文献
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.
17.
In this article, we study positive solutions to the system{A_αu(x) = C_(n,α)PV∫_(Rn)(a1(x-y)(u(x)-u(y)))/(|x-y|~(n+α))dy = f(u(x), B_βv(x) = C_(n,β)PV ∫_(Rn)(a2(x-y)(v(x)-v(y))/(|x-y|~(n+β))dy = g(u(x),v(x)).To reach our aim, by using the method of moving planes, we prove a narrow region principle and a decay at infinity by the iteration method. On the basis of these results, we conclude radial symmetry and monotonicity of positive solutions for the problems involving the weighted fractional system on an unit ball and the whole space. Furthermore, non-existence of nonnegative solutions on a half space is given. 相似文献
18.
19.
20.
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 . 相似文献