Search

Recently, various types of single valued neutrosophic (SVN) rough set models were presented based on the same inclusion relation. However, there is another SVN inclusion relation in SVN sets. In this paper, we propose a new type of SVN covering rough set model based on the new inclusion relation. Furthermore, the graph and matrix representations of the new SVN covering approximation operators are presented. Firstly, the notion of SVN β 2 -covering approximation space is proposed, which is decided by the new inclusion relation. Then, a type of SVN covering rough set model under the SVN β 2 -covering approximation space is presented. Moreover, there is a corresponding SVN relation rough set model based on a SVN relation induced by the SVN β 2 -covering, and two conditions under which the SVN β 2 -covering can induce a symmetric SVN relation are presented. Thirdly, the graph and matrix representations of the new SVN covering rough set model are investigated. Finally, we propose a novel method for decision making (DM) problems in paper defect diagnosis under the new SVN covering rough set model.

A discussion of the applicability of the concepts of T. S. Kuhn's theory of scientific revolutions, stimulated by the statement by M. J. Crowe of ten “laws” concerning change in the history of mathematics. The concepts “revolution” and “crisis” are rejected, while the concepts centering around the sociology of the scientific community are accepted for systematic use in historiography of mathematics. This is supplemented by the consideration of extra-mathematical influences. Finally the “laws” of Crowe are shown to be explainable with those concepts.

The Centre for Kentish Studies in Maidstone, Kent holds the mathematical manuscripts of Philip Stanhope (1714–1786), second Earl of Stanhope. He was an active and capable amateur mathematician. Although the manuscripts cover a wide range of mathematical topics, the current article focuses only on Stanhope's work in probability, where his interests appear to be on the theoretical rather than the applied side of the subject. His work, mainly derived from De Moivre's The Doctrine of Chances and Montmort's Essay d'analyse sur les jeux de hazard, touches on the major probability problems of the day. Among the notes on these two authors there is work that includes an alternate solution to the theory of runs and a simplified solution to a special case of the problem of the duration of play, related to the gambler's ruin problem. In addition, the manuscript collection contains Stanhope's transcription of an incorrect solution to the theory of runs by Thomas Bayes. There is also some correspondence with Sir Alexander Cuming that touches on George Berkeley's criticism of Isaac Newton's development of the calculus.

In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a bipartite correlation. This hierarchy converges to a new parameter: the minimal average entanglement dimension, which measures the amount of entanglement needed to reproduce a quantum correlation when access to shared randomness is free. For synchronous correlations, we show a correspondence between the minimal entanglement dimension and the completely positive semidefinite rank of an associated matrix. We then study optimization over the set of synchronous correlations by investigating quantum graph parameters. We unify existing bounds on the quantum chromatic number and the quantum stability number by placing them in the framework of tracial optimization. In particular, we show that the projective packing number, the projective rank, and the tracial rank arise naturally when considering tracial analogues of the Lasserre hierarchy for the stability and chromatic number of a graph. We also introduce semidefinite programming hierarchies converging to the commuting quantum chromatic number and commuting quantum stability number., Comment: 26 pages

Pulp washing process has the features of multivariate, time delay, nonlinearity. Considering the difficulties of modeling and optimal control in pulp washing process, a data-driven operational-pattern optimization method is proposed to model and optimize the pulp washing process in this paper. The most important quality indexes of pulp washing performance are residual soda in the washed pulp and Baume degree of extracted black liquor. Considering the difficulties of modeling, online measurement of these indexes, two-step neural networks, and multivariate logistic regression are used to establish the prediction models of residual soda and Baume degree. The mathematical model of the washing process can be identified, and the indexes can meet the production requirements. In the target of better product quality, low cost, and low energy consumption, a multiobjective problems is solved by ant colony optimization algorithm based on the optimized operational-pattern database. It shows that the theoretical analyses are correct and the practical applications are feasible, optimization control system has been designed for the pulp washing process, and the practical results show that pulp production increased by 20% and water consumption decreased by nearly 30%. This method is effective in the pulp washing process.

In the paper of the title [1], a number of problems are posed. Ne­ gative solutions of two of them (Problems 2 and 3) are derived in a straightforward way from a paper of L. Gillman and the present author [2]. Motivation will not be supplied since it is given amply in [1], but enough definitions are given to keep the presentation reasonably self­ contained. 1. A Hausdorff space X is said to satisfy (Qm), where m is an in finite cardinal, if, whenever U and V are disjoint open subsets of X such that each is a union of the closures of less than m open subsets of X, then U and V have disjoint closures. In particular, a normal (Hausdorff) space X satisfies (Q*,) if and only if disjoint open F.-SUbsets of X have disjoint closures. (For, an open set that is the union of less than ~, closed sets is a fortiori an F.. Conversely if U is the union of countably many closed subsets Fo> then since X is normal, for each n there is an open set Un containing Fn whose closure is contained in U. Thus U is the union of the closures of the open sets Un.) In Prob­ lem 3 of [1], it is asked if every compact (HaUSdorff) space satisfying (Qm) for some m>~o is necessarily totally disconnected, and it is re­ marked that this is the case if the first axiom of countability is also as­ sumed. If X is a completely regular space, let C(X) denote the ring of all continuous real-valued functions on X, and let Z(f)= {x EX: f(x)=O}, let P(f)={xEX:f(x»O}, and let N(f)=P(-f). As usual, let (IX denote the Stone-Cech compactification of X. If every finitely generated ideal of C(X) is a principal ideal, then X is called an F-space. The fol­ lowing are equivalent. ( i) X is an F-space. ( ii) If f E C(X), then P(f) and NU) are completely separated [2, Theorem 2.3]. (iii) If f E C(X), then every bounded g E C(X-ZU» has an ex­ tension g E C(X) [2, Theorem 2.6]. A good supply of compact F-spaces is provided by the fact that if X is locally compact and ,,-compact, then {lX-X is an F-space [2, Theo­ rem 2.7].

In this short paper we combine the representability theorem introduced in [17, 18] with the theory of derived formal models introduced in [2] to prove the existence representability of the derived Hilbert space RHilb(X) for a separated k-analytic space X. Such representability results relies on a localization theorem stating that if X is a quasi-compact and quasi-separated formal scheme, then the \infty-category Coh^+(X^rig) of almost perfect complexes over the generic fiber can be realized as a Verdier quotient of the \infty-category Coh^+(X). Along the way, we prove several results concerning the the \infty-categories of formal models for almost perfect modules on derived k-analytic spaces., 28 pages

The possibilities of exploiting the special structure of d.c. programs, which consist of optimizing the difference of convex functions, are currently more or less limited to variants of the DCA proposed by Pham Dinh Tao and Le Thi Hoai An in 1997. These assume that either the convex or the concave part, or both, are evaluated by one of their subgradients. In this paper we propose an algorithm which allows the evaluation of both the concave and the convex part by their proximal points. Additionally, we allow a smooth part, which is evaluated via its gradient. In the spirit of primal-dual splitting algorithms, the concave part might be the composition of a concave function with a linear operator, which are, however, evaluated separately. For this algorithm we show that every cluster point is a solution of the optimization problem. Furthermore, we show the connection to the Toland dual problem and prove a descent property for the objective function values of a primal-dual formulation of the problem. Convergence of the iterates is shown if this objective function satisfies the Kurdyka--\L ojasiewicz property. In the last part, we apply the algorithm to an image processing model.

In this short paper we prove a parametric version of the Harnack inequality for \(\phi\)-Laplacian equations. In this sense, the estimates are optimal and represent an improvement of previous bounds for this kind of operators.

The "exact subgraph" approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization problems. Solving these relaxations is a computational challenge because of the potentially large number of violated subgraph constraints. We introduce a computational framework for these relaxations designed to cope with these difficulties. We suggest a partial Lagrangian dual, and exploit the fact that its evaluation decomposes into several independent subproblems. This opens the way to use the bundle method from non-smooth optimization to minimize the dual function. Finally computational experiments on the Max-Cut, stable set and coloring problem show the excellent quality of the bounds obtained with this approach., arXiv admin note: substantial text overlap with arXiv:1902.05345

In a recent paperf entitled A note on the linear fractional group, Todd obtained an abstract definition for the group LF(2, 2) in terms of n+2 generators. Apparently he gave no consideration to the question of the independence of the defining relations, for they can be considerably simplified. First, in view of the condition RSi = Si+iR (which is the same as i£S0^~* = Si), the three generators U, R and S0 are sufficient to generate the entire group. If we give a definition in teims of these three generators alone, the relations