关于Scott拓扑存在开滤子拓扑基的分配备格

本文利用引入的ＫＳ性质,刻划了那些其Ｓｃｏｔｔ拓扑可由开滤子生成的分配备格,该结果也是对［１］中一公开问题的一种解答．本文的刻划定理对于判定分配备格的Ｓｃｏｔｔ拓扑是否与Ｓｃｏｔｔ开滤子拓扑一致具有较强的可操作性,应用该刻划定理给出大量非连续格,其Ｓｃｏｔｔ拓扑具有开滤子基．     

L—fuzzyLocale理论与分配格的L—fuzzy拓扑表示

首先文中引入了Ｌ—ｆｕｚｚｙｌｏｃａｌｅ范畴，并证明了该范畴与满层Ｌ—ｆｕｚｚｙ拓扑空间范畴的关系类似于ｌｏｃａｌｅ与拓扑空间的联系．其次，文中建立了分配格的ｌｏｃａｌｅ式ｆｕｚｚｙＳｔｏｎｅ表示，并且与经典结果一致，任一分配格的Ｌ—ｆｕｚｚｙｌｏｃａｌｅ表示的点空间就是它的Ｌ—ｆｕｚｚｙ谱空间．     

L-fuzzy Locale理论与分配格的L-fuzzy拓扑表示

首先文中引入了Ｌ-ｆｕｚｚｙｌｏｃａｌｅ范畴，并证明了该范畴与满层Ｌ-ｆｕｚｚｙ拓扑空间范畴的关系类似于ｌｏｃａｌｅ与拓扑空间的联系．其次，文中建立了分配格的ｌｏｃａｌｅ式ｆｕｚｚｙＳｔｏｎｅ表示，并且与经典结果一致，任一分配格的Ｌ-ｆｕｚｚｙｌｏｃａｌｅ表示的点空间就是它的Ｌ-ｆｕｚｚｙ谱空间．     

关于非奇异性判别的Gudkov定理

本文主要研究矩阵的非奇异性判别，推广了Ｓｚｕｌｃ和李最近在该领域所取得的主要结果。     

一道USAMO赛题的别证及引伸

１９９７年第２６届美国数学奥林匹克试题５：证明对所有正实数ａ、ｂ、ｃ满足（ａ３＋ｂ３＋ａｂｃ）－１＋（ｂ３＋ｃ３＋ａｂｃ）－１＋（ｃ３＋ａ３＋ａｂｃ）－１≤（ａｂｃ）－１．（１）文［１］给出了该命题的简证．其实,该命题还可简证如下：证明由ａ＋ｂ＞０及...     

对一个不等式问题的完善

设ａ ,ｂ ,ｃ为正数 ,且满足ａｂｃ=1 ,试证 :1ａ3(ｂ ｃ) 1ｂ3(ａ ｃ) 1ｃ3(ａ ｂ) ≥ 32 .该题是第 3 6届ＩＭＯ试题 .自《数学通报》1 996年第 5期作为征解问题的第 1 0 1 3题以来 ,仅《数学通报》就有近 2 0篇文章 (见参考文献 ) ,作为例题或习题加以引用 ,用不同的方法进行了证明 ,也有一些文章对该题结论进行了推广 ,如文 [2 ]推广为设ａ ,ｂ ,ｃ为正数 ,且满足ａｂｃ=1 ,试证 :1ａｍ(ｂ ｃ) 1ｂｍ(ａ ｃ) 1ｃｍ(ａ ｂ) ≥32 (ｍ ∈Ｎ) .但其证明有错误 .文 [7]推广为ｍ ≥ 2的实数 .本人首先指出对该题或该题的推广的证明中…     

Laplace-Stieltjes变换所定义的解析函数的准确下级与下型

本文对于Ｌａｐｌａｃｅ－Ｓｔｉｅｌｔｊｅｓ变换在收敛半平面σ＞０内定义的解析函数定义了准确下级与下型；通过适当引入序列０λｎ↑＋∞，建立了该变换的下级（或准确下级）及下型与其系数及指数之间的关系，即该变换下型的充分必要条件，推广了Ｄｉｒｉｃｈｌｅｔ级数的有关结果     

满足(accr)环的I-adic完备化及其平坦性

满足（ａｃｃｒ）环是比Ｎｏｅｔｈｅｒ环更广泛的一类环，本文讨论了满足（ａｃｃｒ）环的Ｉ－ａｄｉｃ完备化及其平坦性问题，把Ｎｏｅｔｈｅｒ环的有关结果推广到满足（ａｃｃｒ）环上，同时也改进了［１］中的结果．     

Fourier-Jacobi展开的Riesz平均

对ｆ∈Ｌｐ（Ｒ＋，Δ（ｔ）ｄｔ），Δ（ｔ）＝（２ｓｉｎｈｔ）２α＋１（２ｃｏｓｈｔ）２β＋１，１ｐ２，本文证明了当Ｒｅｚ＞（２／ｐ－１）（α＋１／２）时，ｆ的Ｆｏｕｒｉｅｒ－Ｊａｃｏｂｉ展开的ｚ－阶Ｒｉｅｓｚ平均几乎处处收敛于ｆ．该结果推广了Ｇｉｕｌｉｎｉ和Ｍａｕｃｅｒｉ在实秩为１的对称空间上的相应结果     

Schwarz交替方向法的代数处理

本文利用代数方法获得二子区域情形带松驰因子的加法型Ｓｃｈｗａｒｚ交替方向法的最优松驰因子，结果表明代数平均是最优的．接着通过反例说明该结果不可推广至多子区域情形．最后，本文将该代数技巧用于证明一些现有的重要结果,和原有证明相比，现证简单、直观     

Gamma分布环境因子的统计分析

证明了Gamma分布环境因子的最大似然估计是有偏估计,且其偏差为正,进而导出了Gamma分布环境因子的近似无偏估计.利用Cornish-Fisher展开导出了Gamma分布环境因子的广义置信区间,另外也给了Gamma分布环境因子的Bootstrap-t置信区间.利用模拟方法研究了所给近似无偏估计和区间估计的精度,模拟结果显示所给近似无偏估计和区间估计的精度是相当好的.     

Cryptographic pseudo-random sequence from the spatial chaotic map

A scheme for pseudo-random binary sequence generation based on the spatial chaotic map is proposed. In order to face the challenge of using the proposed PRBS in cryptography, the proposed PRBS is subjected to statistical tests which are the well-known FIPS-140-1 in the area of cryptography, and correlation properties of the proposed sequences are investigated. The proposed PRBS successfully passes all these tests. Results of statistical testing of the sequences are found encouraging. The results of statistical tests suggest strong candidature for cryptographic applications.     

Informatics the imaginary atom method for reconstructing the spatial structure of nanoparticles

An original method is proposed for numerical determination of the spatial structure of nanoparticles from a diffraction experiment. Numerical calculations confirm the efficiency of the proposed method.     

A breadth-first search applied to the minimization of the open stacks

This paper presents a heuristic for the minimization of the open stacks problem (MOSP). The proposed heuristic is based on a simple breadth-first search in MOSP graphs and two new greedy rules to overcome errors. The performance of the proposed heuristic is compared with the best exact and heuristic methods available in the literature. The results show that in addition to the suggested heuristic having much shorter running times than the exact algorithm, the error gap between them is small for a substantial proportion of almost 4500 benchmark instances taken from the literature. The proposed heuristic also has a more robust behaviour than the best heuristic for the MOSP, although less accurate. The proposed heuristic therefore constitutes a viable and cost-effective alternative for solving or obtaining good upper bounds for the MOSP.     

On the singular cases of the complex Routh algorithm for stability tests

The Original Routh table dealing with real polynomials is furtherinvestigated for complex polynominals. Based on the tabularform proposed by Parks for the complex polynomial with respectto the imaginary axis, modified procedures for directly treatingsingularities in the array are proposed. Also, new proceduresare developed for determining the respective orders of simpleand/or repeated roots lying on the imaginary axis. As a result,the situation of conditional stability or instability can bedistinguished by the criteria proposed in this paper.     

A projection method based on the splitting Bregman iteration for the image denoising

By analyzing the connection between the projection operator and the shrink operator, we propose a projection method based on the splitting Bregman iteration for image denoising problem in this paper. Compared with the splitting Bregman method, the proposed method has a more compact form so that it is more fast and efficient. Following from the operator theory, the convergence of the proposed method is proved. Some numerical comparisons between the proposed method and the splitting Bregman method are arranged for solving two basic image denoising models.     

The estimation of the strength of the heat source in the heat conduction problems

A general method is proposed to determine the strength of the heat source in the Fourier and non-Fourier heat conduction problems. A finite difference method, the concept of the future time and a modified Newton–Raphson method are adopted in the problem. The undetermined heat source at each time step is formulated as an unknown variable in a set of equations from the measured temperature and the calculated temperature. Then, an iterative process is used to solve the set of equations. No selected function is needed to represent the undetermined function in advance. Three examples are used to demonstrate the characteristics of the proposed method. The validity of the proposed method is confirmed by the numerical results. The results show that the proposed method is an accurate and stable method to determine the strength of the heat source in the inverse hyperbolic heat conduction problems. Furthermore, the result shows that more future times are needed in the hyperbolic equation than that of parabolic equation. Moreover, the robustness and the accuracy of the estimated results in the non-Fourier problem are not as well as those of the Fourier problem.     

一种求解救灾物资运输问题的改进解法

本文通过对B运输问题建立数学模型,提出了一种求解B运输问题的改进解法。改进解法首先通过最小元素法求出初始解,然后进行变量闭回路法调整,直到求出最优解,并给出了一个计算实例证明了解法的有效性。文章还对改进解法和另外两种现有的算法进行了综合的分析,由于改进解法计算过程中采用的变量闭回路法省略了求检验数的环节,使得新算法比两种现有的算法更简便。     

On the numerical solution of the linear complementarity problem

The well-known linear complementarity problem with definite matrices is considered. It is proposed to solve it using a global optimization algorithm in which one of the basic stages is a special local search. The proposed global search algorithm is tested using a variety of randomly generated problems; a detailed analysis of the computational experiment is given.     

Tracking the state of the delay hyperchaotic Lü system using the coullet chaotic system via a single controller

In this article, a partial synchronization scheme is proposed based on Lyapunov stability theory to track the signal of the delay hyperchaotic Lü system using the Coullet system based on only one single controller. The proposed tracking control design has two advantages: only one controller is adopted in our approach and it can allow us to drive the hyperchaotic system to a simple chaotic system even with uncertain parameters. Numerical simulation results are given to demonstrate the effectiveness and robustness of the proposed partial synchronization scheme. © 2014 Wiley Periodicals, Inc. Complexity 21: 125–130, 2016