不同半光强角对医用LED阵列灯珠间距影响的仿真研究

 讨论LED光源的半光强角对LED之间的最大间距的影响,采用Matlab软件对LED单元照度数据进行计算及仿真,给出相应的仿真图形。仿真结果表明:LED光源之间的最大间距与其功率无关,由于仿真的结果与理论计算值相吻合,说明在计算中所建立的LED的光学模型具有较高的可信度,所得结果为LED多阵列（如圆形,矩形,椭圆等）的仿真及应用设计奠定了理论基础。     

��Ⱦ��������ض�������ģ�͵IJ�������

本文研究了线性模型响应变量被污染且被区间截断下的参数估计问题, 借助于区间数据的无偏转换, 得到了回归系数和污染系数的估计, 并在一定的条件下得到了这些估计的强相合性. 通过若干模拟例子说明, 尽管数据经过污染和区间截断的双重信息损失, 但用本文提出的方法得到的估计, 仍能取得良好的估计效果     

新建住房套型比例的合理性研究

本文以建设部提出的新建住房套型比例合理性为研究对象。基于我国城镇居民的年人均可支配收入的分布情况,依据《中国统计年鉴》的数据,用F分布拟合变换后年人均可支配收入,得年人均可支配收入密度函数;运用广义最小二乘估计人均年可支配收入与人均年最大可用于购房支出的线性关系;综合考虑人均可支配收入、家庭人口数的分布,首付率、按揭贷款年限、年利率和新建住房交易价对购房面积的影响,得家庭意向购房面积分布函数和合理的套型建筑面积结构比例。     

均匀分布参数的无偏估计及其分布

讨论了均匀分布未知参数无偏估计量的分布密度,利用无偏估计量构造出一些新的样本函数,并且利用给出的样本函数推导出了未知参数的置信区间.所得到结果改善了现有的估计,易于计算.     

一种基于组合不确定型OWA算子的区间数群决策方法

在群决策中,由于决策环境的不确定性,决策者给出区间效信息.基于区间数可能度矩阵公式和互补判断矩阵的排序公式,提出了一种组合不确定型OWA算子,它是不确定型OWA算子的推广.该算子能集结群决策中区间数信息,文中给出了其在应用的具体步骤,最后实例分析说明了该方法的有效性和可行性.     

Aligning retention time shifts in HPLC three‐dimensional spectra by icoshift approach combined with data arrangement methods and the release of a graphical user interface

High‐performance liquid chromatography coupled with photodiode array detection has been extensively applied in many fields and the peaks among the analyzed samples can be shifted due to the variations of instrumental and experimental conditions. In multivariate analysis, retention time alignment is an important pretreatment step. Hence, the shifted peaks in high‐performance liquid chromatography coupled with photodiode array detection three‐dimensional spectra should be aligned for further analysis. Being motivated by this purpose, the interval correlated shifting method combined with the proposed data arrangement methods are recommended and employed on high‐performance liquid chromatography coupled with photodiode array detection data as a demonstration. We validate the alignment performance of the proposed method through comparison the consistency of the retention time before and after alignment. The obtained results demonstrated that the proposed method is capable of successful aligning the employed data. Additionally, the interval correlated shifting method combined with the data arrangement modes is implemented in an easy‐to‐use graphical user interface environment and so can be operated easily by users not familiar with programming languages.     

基于区间系统理论的分数阶混沌系统同步

通过设计一个非线性反馈控制器,实现了分数阶混沌系统的同步.与其他的分数阶混沌系统同步方法相比,提出的控制器设计方法保留了部分误差系统中的非线性项,而没有完全抵消同步误差系统的非线性项,有效改善了误差系统的控制性能.同时,应用区间分数阶线性时不变系统稳定性原理和线性矩阵不等式技术,得到了一个新的分数阶混沌系统同步的充分条件,进而获得的控制器保证了混沌系统同步.仿真结果验证了提出方法的有效性. 关键词： 区间分数阶时不变系统 分数阶混沌系统 混沌同步     

Nondestructive evaluation for remanent life of modified 9Cr-1Mo steel by reversible magnetic permeability

We present a magnetic and nondestructive method to evaluate the remanent life of modified 9Cr-1Mo steel by measuring the reversible magnetic permeability. Specimens with ten different kinds of aging periods were prepared using an isothermal heat treatment at 690 °C. The Larson-Miller parameter (LMP) was calculated and the peak interval of reversible magnetic permeability (PIRMP) was measured using the surface type probe. PIRMP was inversely proportional to LMP. We can evaluate the remanent life of modified 9Cr-1Mo steel using the relationship between PIRMP and LMP. Also, we present the possibility that the tensile strength and yield strength measured by destructive methods could be estimated by PIRMP measured nondestructively.     

On the computation of the hull number of a graph

Let G be a graph. If u,v∈V(G), a u-vshortest path of G is a path linking u and v with minimum number of edges. The closed interval I[u,v] consists of all vertices lying in some u-v shortest path of G. For S⊆V(G), the set I[S] is the union of all sets I[u,v] for u,v∈S. We say that S is a convex set if I[S]=S. The convex hull of S, denoted I_h[S], is the smallest convex set containing S. A set S is a hull set of G if I_h[S]=V(G). The cardinality of a minimum hull set of G is the hull number of G, denoted by hn(G). In this work we prove that deciding whether hn(G)≤k is NP-complete.We also present polynomial-time algorithms for computing hn(G) when G is a unit interval graph, a cograph or a split graph.     

Bounding the zeros of an interval equation

In this paper, we consider the problem of finding reliably and with certainty all zeros of an interval equation within a given search interval for continuously differentiable functions over real numbers. We propose a new formality of interval arithmetic which is treated in a theoretical manner to develop and prove a new method, lying on the context of interval Newton methods. Some important theoretical aspects of the new method are stated and proved. Finally, an algorithmic realization of our method is proposed to be applied on a set of test functions, where the promising theoretical results are verified.