Speeding up the FMMR perfect sampling algorithm: A case study revisited

In a previous paper by the second author, two Markov chain Monte Carlo perfect sampling algorithms—one called coupling from the past (CFTP) and the other (FMMR) based on rejection sampling—are compared using as a case study the move‐to‐front (MTF) self‐organizing list chain. Here we revisit that case study and, in particular, exploit the dependence of FMMR on the user‐chosen initial state. We give a stochastic monotonicity result for the running time of FMMR applied to MTF and thus identify the initial state that gives the stochastically smallest running time; by contrast, the initial state used in the previous study gives the stochastically largest running time. By changing from worst choice to best choice of initial state we achieve remarkable speedup of FMMR for MTF; for example, we reduce the running time (as measured in Markov chain steps) from exponential in the length n of the list nearly down to n when the items in the list are requested according to a geometric distribution. For this same example, the running time for CFTP grows exponentially in n. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003     

A note on a characterization of P-matrices

In this note we show that the characterization results for P-matrices due to K.G. Murty and A. Tamir which state that a given square matrixM of ordern is a P-matrix if and only if the linear complementarity problem (q, M) has a unique solution for allq in a specified finite subset of ⁿ depending onM are incorrect whenn > 3.Research supported by Dr. K.S. Krishnan (DAE) fellowship for research in Mathematics and Computer Science, Bombay, India.     

Researches of DC—Problem Under the Model S in which the Numbers of Defective Coins are not Fixed

In this paper,we research general Defective Cion Problem under the model S,i.e,the number d of Defective cions is not fixed. For d=O,1,or 2. we get some good results.     

A unified theory for coherent systems in reliability part III: Two special cases for multinary systems—binary-type coherence and homogeneous coherence

As shown in a companion-paper,¹ binary and multinary coherent systems can be studied with unified arguments, through monotone binary coherent systems. These are binary coherent systems submitted to some monotone constraint and generalize the classic theory of free binary coherent systems. By considering the unified point of view thus obtained, this paper gives what is perhaps the most suggestive representation for multinary coherent systems, since this extends the definition of binary coherent systems in terms of series-parallel (parallel-series) structures. Then, this paper examines the special case of multinary systems that can be studied directly with the classic theory of free binary coherent systems. It thus enlarges and complements, in a shorter unified manner, the particular cases considered in earlier studies.     

Condensations of projective sets onto compacta

For a coanalytic-complete or -complete subspace of a Polish space we prove that there exists a continuous bijection of onto the Hilbert cube . This extends results of Pytkeev. As an application of our main theorem we give an answer to some questions of Arkhangelskii and Christensen.

Under the assumption of Projective Determinacy we also give some generalizations of these results to higher projective classes.

     

基于粗糙集理论的知识约简及应用实例

在保持分类能力不变的前提下 ,通过利用粗糙集理论中的知识约简方法 ,在保护知识库分类不变的条件下 ,删除其中不相关或不重要的知识 ,从而导出问题的决策 .利用基于决策表的粗糙集模型算法 ,实例分析如何数字化表示决策表 ,并对其进行属性约简和属性值的约简 ,从而提取决策规则 .     

HL-2M 装置供电系统研制

为满足 HL-2M 装置的供电需求,须配套建设相应的供电系统。通过仿真计算 HL-2M 装置的总体供 电需求,考虑到 HL-2A 装置现有的供电系统设备,提出了兼顾 HL-2A 和 HL-2M 装置供电需求的总体配置方案。介绍了国内首台 300MVA 立式交流脉冲发电机组、磁体电源、高压电源和电源控制系统的研制情况。     

Status Set Sequential Pattern Mining Considering Time Windows and Periodic Analysis of Patterns

The traditional sequential pattern mining method is carried out considering the whole time period and often ignores the sequential patterns that only occur in local time windows, as well as possible periodicity. Therefore, in order to overcome the limitations of traditional methods, this paper proposes status set sequential pattern mining with time windows (SSPMTW). In contrast to traditional methods, the item status is considered, and time windows, minimum confidence, minimum coverage, minimum factor set ratios and other constraints are added to mine more valuable rules in local time windows. The periodicity of these rules is also analyzed. According to the proposed method, this paper improves the Apriori algorithm, proposes the TW-Apriori algorithm, and explains the basic idea of the algorithm. Then, the feasibility, validity and efficiency of the proposed method and algorithm are verified by small-scale and large-scale examples. In a large-scale numerical example solution, the influence of various constraints on the mining results is analyzed. Finally, the solution results of SSPM and SSPMTW are compared and analyzed, and it is suggested that SSPMTW can excavate the laws existing in local time windows and analyze the periodicity of the laws, which solves the problem of SSPM ignoring the laws existing in local time windows and overcomes the limitations of traditional sequential pattern mining algorithms. In addition, the rules mined by SSPMTW reduce the entropy of the system.     

Assessment and Prediction of Water Resources Vulnerability Based on a NRS-RF Model: A Case Study of the Song-Liao River Basin,China

The vulnerability of water resources is an important criterion for evaluating the carrying capacity of water resources systems under the influence of climate change and human activities. Moreover, assessment and prediction of river basins’ water resources vulnerability are important means to assess the water resources security state of river basins and identify possible problems in future water resources systems. Based on the constructed indicator system of water resources vulnerability assessment in Song-Liao River Basin, this paper uses the neighborhood rough set (abbreviated as NRS) method to reduce the dimensionality of the original indicator system to remove redundant attributes. Then, assessment indicators’ standard values after dimensionality reduction are taken as the evaluation sample, and the random forest regression (abbreviated as RF) model is used to assess the water resources vulnerability of the river basin. Finally, based on data under three different future climate and socio-economic scenarios, scenario predictions are made on the vulnerability of future water resources. The results show that the overall water resources vulnerability of the Song-Liao River Basin has not improved significantly in the past 18 years, and the overall vulnerability of the Song-Liao River Basin is in the level V of moderate to high vulnerability. In the future scenario 1, the overall water resources vulnerability of the river basin will improve, and it is expected to achieve an improvement to the level III of moderate to low vulnerability. At the same time, the natural vulnerability and vulnerability of carrying capacity will increase significantly in the future, and the man-made vulnerability will increase slowly, which will deteriorate to the level V of moderate to high vulnerability under Scenario 3. Therefore, taking active measures can significantly reduce the vulnerability of nature and carrying capacity, but man-made vulnerability will become a bottleneck restricting the fragility of the overall water resources of the river basin in the future.     

On α-Limit Sets in Lorenz Maps

The aim of this paper is to show that α-limit sets in Lorenz maps do not have to be completely invariant. This highlights unexpected dynamical behavior in these maps, showing gaps existing in the literature. Similar result is obtained for unimodal maps on [0,1]. On the basis of provided examples, we also present how the performed study on the structure of α-limit sets is closely connected with the calculation of the topological entropy.