A COUNTEREXAMPLE ON MONOTONE MuNTZ APPROXIMATION Ⅱ

We adopt the following symbols and notations. Let C;be the class of all real continuous functions in [0,1] which have N continuousderivatives, L;0,1];be the space of real pth power integrable functions on [0,1], and Δ;, asusual, be the class of kth monotone functions.

A COUNTEREXAMPLE TO THE ARTICLE "GLOBALLY ASYMPTOTIC STABILITY OF A RECURRENCE SEQUENCE

In this paper, we give a counterexample to the article 'Globally asymptotic stability of a recurrence sequence', Ann. of Diff. Eqs., 17:1(2001), 82-85.

A Characterization of Counterexamples to the Kodaira-Ramanujam Vanishing Theorem on Surfaces in Positive Characteristic

The author gives a characterization of counterexamples to the Kodaira-Ramanujam vanishing theorem on smooth projective surfaces in positive characteristic.More precisely,it is reproved that if there is a counterexample to the Kodaira-Ramanujam vanishing theorem on a smooth projective surface X in positive characteristic,then X is either a quasi-elliptic surface of Kodaira dimension 1 or a surface of general type.Furthermore,it is proved that up to blow-ups,X admits a fibration to a smooth projective curve,such that each fiber is a singular curve.

A Class Of Counterexamples Concerning an Open Problem

If K ∩ AlgL is weak. dense in AlgL, where K is the set of all compactoperators in B(H), is completely distributive? In this note, we prove that there is a reflexivesubspace lattice L on some Hilbert space, which satisfies the following conditions: (a) F(AlgL) isdense in AlgL in the ultrastrong operator topology, where F(AlgL) is the set of all finite rankoperators in AlgL; (b) L isnt a completely distributive lattice. The subspace lattices that satisfythe above conditions form a large class of lattices. As a special case of the result, it easy to seethat the answer to Problem 7 is negative.

On Performance Characteristics of a Nonparametric Subset Selection Procedure with a Small Randomized Block Experimental Design

This article addresses the issue of computing the constant required to implement a specific nonparametric subset selection procedure based on ranks of data arising in a statistical randomized block experimental design. A model of three populations and two blocks is used to compute the probability distribution of the relevant statistic, the maximum of the population rank sums minus the rank sum of the “best” population. Calculations are done for populations following a normal distribution, and for populations following a bi-uniform distribution. The least favorable configuration in these cases is shown to arise when all three populations follow identical distributions. The bi-uniform distribution leads to an asymptotic counterexample to the conjecture that the least favorable configuration, i.e., that configuration minimizing the probability of a correct selection, occurs when all populations are identically distributed. These results are consistent with other large-scale simulation studies. All relevant computational R-codes are provided in appendices.

Development of Entropy Change in Philosophy of Science

Entropy is important in philosophy of science,but some fallacies originate from the misunderstanding entropy increases.The basis of thermodynamics is the statistics and its basic principle of statistical independence.We proposed possible entropy decrease due to fluctuation magnified and internal interactions in isolated systems,and discuss this possibility of various aspects on science and nature.Further,we derive quantitatively a total formula of entropy change for universal evolution of any natural and social systems,and discuss entropy decrease in economics and social sciences.Entropy change is a testable science.As long as we break through the bondage of the second law of thermodynamics,the rich and complex world is full of examples of entropy decrease.We believe world is not pessimistic always.

Deadlock detection using abstraction refinement

This paper adopts counterexample guided abstraction refinement scheme to alleviate the state explosion problem of deadlock detection. We extend the classical labeled transition system models by qualifying transitions as certain and uncertain to make deadlock-freedom conservative, i.e. if the abstraction of a system is deadlock-free, then the system is deadlock-free. An abstraction refinement approach to deadlock detection is proposed, and the correctness of the approach is proved.

Lazy Slicing for State-Space Exploration

CEGAR （Counterexample-guided abstraction refinement）-based slicing is one of the most important techniques in reducing the state space in model checking. However, CEGAR-based slicing repeatedly explores the state space handled previously in case a spurious counterexample is found. Inspired by lazy abstraction, we introduce the concept of lazy slicing which eliminates this repeated computation. Lazy slicing is done on-the-fly, and only up to the precision necessary to rule out spurious counterexamples. It identifies a spurious counterexample by concretizing a path fragment other than the full path, which reduces the cost of spurious counterexample decision significantly. Besides, we present an improved over-approximate slicing method to build a more precise slice model. We also provide the proof of the correctness and the termination of lazy slicing, and implement a prototype model checker to verify safety property. Experimental results show that lazy slicing scales to larger systems than CEGAR-based slicing methods.

Comments on ＂Some new distance measures for type-2 fuzzy sets and distance measure based ranking for group decision making problems＂

In this article, we have pointed out that some propositions corresponding to the distance measure between the type-2 fuzzy sets （T2FSs） as provided by Singh （Frontiers of Computer Science, 2014, 8（5）, 741-752）, are incorrect by a counterexample. Further, these propositions have been corrected in the present manuscript by giving a correct relation between the T2FSs and validating it with a numerical example.

On Convexification for a Class of Global Optimization Problems

In this paper,firstly,we give a counterexample to point out there exist deficiencies in our previous works(Wu et al.in J Glob Optim 31:45-60,2005).In addition,we improve the corresponding results.Finally,an example is presented to illustrate how a monotone non-convex optimization problem can be transformed into an equivalent convex minimization problem.

A NOTE OF THE SPECTRUM OF HOMOGENEOUS COMPACT OPERATORS

In this paper, we present some counterexamples which show that there is no theory on the spectrum of homogeneous compact operators which parallels the Riesz-Schauder theory on the spectrum of linear compact operators. These counterexamples also illustrate that it is impossible to study in a unified setting the Fucik spectrum of the Laplacian: -△w = au+ - bu- inΩand u = 0 on (?)Ω, as well as the spectrum of the p-Laplacian: -div(|(?)u| p-2(?)u) = λ|u|p-2u and u = 0 on (?)Ω.