Stable Ranges For Morita Contexts

In this paper, we show that if rings A and B are (s, 2)-rings, then so is the ring of a Morita context (A, B, M, N, , ). Also we get analogous results for unit 1-stable ranges and GM-rings. These give new classes of rings satisfying such stable range conditions.2000 Mathematics Subject Classification: 16U99 16E50     

Testing for Unit Roots in a Nearly Nonstationary Spatial Autoregressive Process

The limiting distribution of the normalized periodogram ordinate is used to test for unit roots in the first-order autoregressive model _st= _s-1,t+_s,t-1- _s-1,t-1+_st. Moreover, for the sequence _n = e ^c/n , _n = e ^d/n of local Pitman-type alternatives, the limiting distribution of the normalized periodogram ordinate is shown to be a linear combination of two independent chi-square random variables whose coefficients depend on c and d. This result is used to tabulate the asymptotic power of a test for various values of c and d. A comparison is made between the periodogram test and a spatial domain test.     

Stochastic Lagrangian Relaxation Applied to Power Scheduling in a Hydro-Thermal System under Uncertainty

A dynamic (multi-stage) stochastic programming model for the weekly cost-optimal generation of electric power in a hydro-thermal generation system under uncertain demand (or load) is developed. The model involves a large number of mixed-integer (stochastic) decision variables and constraints linking time periods and operating power units. A stochastic Lagrangian relaxation scheme is designed by assigning (stochastic) multipliers to all constraints coupling power units. It is assumed that the stochastic load process is given (or approximated) by a finite number of realizations (scenarios) in scenario tree form. Solving the dual by a bundle subgradient method leads to a successive decomposition into stochastic single (thermal or hydro) unit subproblems. The stochastic thermal and hydro subproblems are solved by a stochastic dynamic programming technique and by a specific descent algorithm, respectively. A Lagrangian heuristics that provides approximate solutions for the first stage (primal) decisions starting from the optimal (stochastic) multipliers is developed. Numerical results are presented for realistic data from a German power utility and for numbers of scenarios ranging from 5 to 100 and a time horizon of 168 hours. The sizes of the corresponding optimization problems go up to 200000 binary and 350000 continuous variables, and more than 500000 constraints.     

Four matroidal structures of covering and their relationships with rough sets

Covering is a common form of data representation, and covering-based rough sets serve as an efficient technique to process this type of data. However, many important problems such as covering reduction in covering-based rough sets are NP-hard so that most algorithms to solve them are greedy. Matroids provide well-established platforms for greedy algorithm foundation and implementation. Therefore, it is necessary to integrate covering-based rough set with matroid. In this paper, we propose four matroidal structures of coverings and establish their relationships with rough sets. First, four different viewpoints are presented to construct these four matroidal structures of coverings, including 1-rank matroids, bigraphs, upper approximation numbers and transversals. The respective advantages of these four matroidal structures to rough sets are explored. Second, the connections among these four matroidal structures are studied. It is interesting to find that they coincide with each other. Third, a converse view is provided to induce a covering by a matroid. We study the relationship between this induction and the one from a covering to a matroid. Finally, some important concepts of covering-based rough sets, such as approximation operators, are equivalently formulated by these matroidal structures. These interesting results demonstrate the potential to combine covering-based rough sets with matroids.     

Bounds relating the weakly connected domination number to the total domination number and the matching number

Let G=(V,E) be a connected graph. A dominating set S of G is a weakly connected dominating set of G if the subgraph (V,E∩(S×V)) of G with vertex set V that consists of all edges of G incident with at least one vertex of S is connected. The minimum cardinality of a weakly connected dominating set of G is the weakly connected domination number, denoted . A set S of vertices in G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number γ_t(G) of G. In this paper, we show that . Properties of connected graphs that achieve equality in these bounds are presented. We characterize bipartite graphs as well as the family of graphs of large girth that achieve equality in the lower bound, and we characterize the trees achieving equality in the upper bound. The number of edges in a maximum matching of G is called the matching number of G, denoted α^′(G). We also establish that , and show that for every tree T.     

用于新一代高密度可录光盘的有机材料研究进展

本文在总结近几年来国内外文献和专利报道的最新研究成果基础上,简要阐述了新一代高密度可录光盘的数据存储机理以及激光器工作波长与有机材料薄膜最大吸收波长相匹配的要求,介绍了在蓝(紫)光波段内(350～400nm)具有显著吸收的有机材料研究概况,并讨论了这些有机材料作为新一代高密度可录光盘数据存储介质的可能性。最后,对有机材料用于新一代高密度可录光盘数据存储介质的研究重点以及今后的发展前景进行简要讨论和展望。     

物理量单位的智能导出算法及其应用

推导物理量的单位是物理作业中不可缺少的重要环节。提出一种物理量单位的智能导出算法,即计算机根据物理量的运算式自动推导出待求物理量的单位。实验结果表明,物理量单位导出及换算算法的结果正确,对算术运算式中的物理量单位导出及换算的正确率为100%,且物理量数值的运算正确。     

周期性分层介质高反射区范围的分析与估计

对于具有周期单元的分层介质材料高反射区的波长范围，提供一种简明的估计分析方法.基于Floquet定理，分析了有限周期单元分层介质的光子带隙特性，给出分层介质的高反射区波长范围.讨论了分层介质高反射区和周期单元禁带之间的关系.计算表明，高反射区和周期单元禁带的中心波长彼此一致.并且，随着分层介质周期单元数的增多，高反射区的深度和带宽就越接近于周期单元禁带的深度和宽度.最后，讨论周期分层介质的光子带隙特性与入射角及其与极化的变化关系. 关键词： 分层介质 带隙特性 周期单元 高反射区     

汇率变动对进出口影响的实证分析

本文研究了汇率变动对中国进出口的影响,在间接标价法下对论文中所用到的汇率贬值改善国际收支的三个必要条件给出了结论和证明(弹性法);在经济理论及经验研究的基础上,建立了论文中所需要的所有模型并且根据模型对相关经济问题利用现代计量经济学方法进行了实证研究.通过实证研究我们得到的结论是:我国满足汇率贬值改善国际收支的必要条件;出口增加有助于GDP的增长,进口增加对GDP的影响是反向的且随着进口增加这种影响逐渐减弱最终趋于零.