Neighborhood rough sets based multi-label classification for automatic image annotation

Automatic image annotation is concerned with the task of assigning one or more semantic concepts to a given image. It is a typical multi-label classification problem. This paper presents a novel multi-label classification framework MLNRS based on neighborhood rough sets for automatic image annotation which considers the uncertainty of the mapping from visual feature space to semantic concepts space. Given a new instances, its neighbors in the training set are firstly identified. After that, based on the concept of upper and lower approximations of neighborhood rough sets, all possible labels of the given instance are found. Then, based on the statistical information gained from the label sets of the neighbors, maximum a posteriori (MAP) principle is utilized to determine the label set for the given instance. Experiments completed for three different image datasets show that MLNRS achieves more promising performance in comparison with to some well-known multi-label learning algorithms.     

Asymptotical optimality in cluster analysis

The problem of optimality and performance evaluation for cluster analysis procedures is investigated. For the situations where the classes are described by known or unknown prior probabilities and regular probability density functions with unknown parameters the asymptotic expansions of classification error probability are constructed. The results are illustrated for the case of well‐known Fisher classification model. Copyright © 1999 John Wiley & Sons, Ltd.     

Dynamical behaviors of a discrete HIV‐1 virus model with bilinear infective rate

We establish a discrete virus dynamic model by discretizing a continuous HIV‐1 virus model with bilinear infective rate using ‘hybrid’ Euler method. We discuss not only the existence and global stability of the uninfected equilibrium but also the existence and local stability of the infected equilibrium. We prove that there exists a crucial value similar to that of the continuous HIV‐1 virus dynamics, which is called the basic reproductive ratio of the virus. If the basic reproductive ratio of the virus is less than one, the uninfected equilibrium is globally asymptotically stable. If the basic reproductive ratio of the virus is larger than one, the infected equilibrium exists and is locally stable. Moreover, we consider the permanence for such a system by constructing a Lyapunov function v_n. Copyright © 2013 John Wiley & Sons, Ltd.     

Multicategory classification via discrete support vector machines

Discrete support vector machines (DSVM), originally proposed for binary classification problems, have been shown to outperform other competing approaches on well-known benchmark datasets. Here we address their extension to multicategory classification, by developing three different methods. Two of them are based respectively on one-against-all and round-robin classification schemes, in which a number of binary discrimination problems are solved by means of a variant of DSVM. The third method directly addresses the multicategory classification task, by building a decision tree in which an optimal split to separate classes is derived at each node by a new extended formulation of DSVM. Computational tests on publicly available datasets are then conducted to compare the three multicategory classifiers based on DSVM with other methods, indicating that the proposed techniques achieve significantly higher accuracies. This research was partially supported by PRIN grant 2004132117.     

Global properties of a discrete viral infection model with general incidence rate

In this paper, we propose a discrete viral infection model with a general incidence rate. The discrete model is derived from a continuous case by using a 'mixed' Euler method, which is a mixture of both forward and backward Euler methods. We prove that the mixed Euler method preserves the qualitative properties of the corresponding continuous system, such as positivity, boundedness, and global behaviors of solutions. Furthermore, the model and mathematical results presented in another previous study are extended and generalized. Copyright © 2015 John Wiley & Sons, Ltd.     

Recent advances in robust optimization: An overview

This paper provides an overview of developments in robust optimization since 2007. It seeks to give a representative picture of the research topics most explored in recent years, highlight common themes in the investigations of independent research teams and highlight the contributions of rising as well as established researchers both to the theory of robust optimization and its practice. With respect to the theory of robust optimization, this paper reviews recent results on the cases without and with recourse, i.e., the static and dynamic settings, as well as the connection with stochastic optimization and risk theory, the concept of distributionally robust optimization, and findings in robust nonlinear optimization. With respect to the practice of robust optimization, we consider a broad spectrum of applications, in particular inventory and logistics, finance, revenue management, but also queueing networks, machine learning, energy systems and the public good. Key developments in the period from 2007 to present include: (i) an extensive body of work on robust decision-making under uncertainty with uncertain distributions, i.e., “robustifying” stochastic optimization, (ii) a greater connection with decision sciences by linking uncertainty sets to risk theory, (iii) further results on nonlinear optimization and sequential decision-making and (iv) besides more work on established families of examples such as robust inventory and revenue management, the addition to the robust optimization literature of new application areas, especially energy systems and the public good.     

A classification of torsion classes in abelian categories

We give a classification of torsion classes (or nullity classes) in an abelian category by forming a spectrum of equivalence classes of premonoform objects. This is parallel to Kanda’s classification of Serre subcategories.     

Computing the viability kernel in large state dimension

T-viable states in a closed set K under a certain set-valued dynamic are states from which there exists at least one solution remaining in K until a given time horizon T. Minimizing the cost to constraints lets us determine whether a given state is T-viable or not, and this is implementable in large dimension for the state-space. Minimizing on the initial condition itself lets find viable states. Quincampoix's semi-permeability property helps find other states located close to the viability boundary, which is then gradually delineated. The algorithm is particularly suited to the identification of specific trajectories, such as the heavy viable solution, or to the computation of viability kernels associated with delayed dynamics. The volume of the viability kernel and its confidence interval can be estimated by randomly drawing states and checking their viability status. Examples are given.     

A multi‐stage ‘infection’ model of stock investors' reaction to new product announcement signal

Drawing on viral dynamics theory, this paper presents a differential equations model with time delay to investigate the stock investor behavior driven by new product announcement (NPA) signal. Visually, we look upon investors in stock market as cells in vivo and the NPA signals as free virus. The potential investors will be ‘infected’ by the dissociative NPA signal and then make investment decisions. In order to better understand the ‘infection’ process, we extract and establish a multi‐stage process during which NPA signal is delivered and ‘infects’ the potential investors. A time‐delay effect is employed to reflect the evaluation stage at which potential investors comprehensively evaluate and decide whether to invest or not. In addition, we introduce a set of external and internal factors into the model, including information sensitivity and investor sentiment, and so on, which are pivotal for examining investor behavior. Equilibrium analysis and numerical simulations are employed to check out the properties of the model and highlight the practical application values of the model. Copyright © 2016 John Wiley & Sons, Ltd.     

Generalized Weyl–Wigner–Moyal–Ville Formalism and Topological Groups

Discussed are some geometric aspects of the phase space formalism in quantum mechanics in the sense of Weyl, Wigner, Moyal, and Ville. We analyze the relationship between this formalism and geometry of the Galilei group, classical momentum mapping, theory of unitary projective representations of groups, and theory of groups algebras. Later on, we present some generalization to quantum mechanics on locally compact Abelian groups. It is based on Pontryagin duality. Indicated are certain physical aspects in quantum dynamics of crystal lattices, including the phenomenon of ‘Umklapp–Prozessen’. Copyright © 2011 John Wiley & Sons, Ltd.     

Interval estimates for posterior probabilities in a multivariate normal classification model

This paper is devoted to the asymptotic distribution of estimators for the posterior probability that a p-dimensional observation vector originates from one of k normal distributions with identical covariance matrices. The estimators are based on training samples for the k distributions involved. Observation vector and prior probabilities are regarded as given constants. The validity of various estimators and approximate confidence intervals is investigated by simulation experiments.     

On the performance of universities in North Rhine-Westphalia,Germany: Government’s redistribution of funds judged using DEA efficiency measures

In Fandel and Gal (2001) [Fandel, G., Gal, T., 2001. Redistribution of funds for teaching and research among universities: The case of North Rhine-Westphalia, European Journal of Operational Research 130, 111–120] a solution for a real process of redistributing funds for teaching and research among the universities in North Rhine-Westphalia in Germany according to specific criteria was presented. The solution was based on aggregated proportional data and was determined by a negotiation process. Now that the absolute data with respect to the different subject areas of the universities are available, it is studied, to which extent the results of the redistribution can be justified by the relative efficiency measures using data envelopment analysis. Moreover, the inefficiencies or slacks, respectively, in the usage of personnel give reasons to reallocate the staff among the universities or to reduce it correspondingly.     

Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order Logic

We investigate the definability in monadic ∑₁¹ and monadic Π₁¹ of the problems REG_k, of whether there is a regular subgraph of degree k in some given graph, and XREG_k, of whether, for a given rooted graph, there is a regular subgraph of degree k in which the root has degree k, and their restrictions to graphs in which every vertex has degree at most k, namely REG_k^k and XREG_k^k, respectively, for k ≥ 2 (all our graphs are undirected). Our motivation partly stems from the fact (which we prove here) that REG_k^k and XREG_k^k are logspace equivalent to CONN and REACH, respectively, for k ≥ 3, where CONN is the problem of whether a given graph is connected and REACH is the problem of whether a given graph has a path joining two given vertices. We use monadic first - order reductions, monadic ∑₁¹ games and a recent technique due to Fagin, Stockmeyer and Vardi to almost completely classify whether these problems are definable in monadic ∑₁¹ and monadic Π₁¹, and we compare the definability of these problems (in monadic ∑₁¹ and monadic Π₁¹ with their computational complexity (which varies from solvable using logspace to NP - complete).     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

On arithmetic in the Cantor- Łukasiewicz fuzzy set theory

Axiomatic set theory with full comprehension is known to be consistent in Łukasiewicz fuzzy predicate logic. But we cannot assume the existence of natural numbers satisfying a simple schema of induction; this extension is shown to be inconsistent.Long before them, Klaua and Gottwald studied various forms of iterated fuzzy power set constructions inside classical set theory, see the references.     

Equivalence of Many-Gluon Green’s Functions in the Duffin-Kemmer-Petieu and Klein-Gordon-Fock Statistical Quantum Field Theories

We prove the equivalence of many-gluon Green’s functions in the Duffin-Kemmer-Petieu and Klein-Gordon-Fock statistical quantum field theories. The proof is based on the functional integral formulation for the statistical generating functional in a finite-temperature quantum field theory. As an illustration, we calculate one-loop polarization operators in both theories and show that their expressions indeed coincide.__________Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 143, No. 3, pp. 368–374, June, 2005.     

Recent models in data envelopment analysis: Theory and applications

A critical review of the recent models of data envelopment analysis (DEA) is attempted here. Three new lines of approach involving dynamic changes in parameters, the error correction models and a stochastic sensitivity analysis are discussed in some detail. On the applications side, two new formulations are presented and discussed, e.g. a model of technical change and a cost frontier for testing economies of scale and adjustment due to risk factors. Thus the critical review of recent DEA models of productivity measurement provides new insight into the frontier of research in this field.     

A Nonstandard Delta Function in a Predicative Theory

In [1] Todorov has shown by means of axiomatic set theory that there exists a nonstandard function Δ: *?ⁿ → * ? such that for all continuous functions φ: ?ⁿ → ?, . Here *? and *? are the set of the nonstandard real numbers and the set of the nonstandard complex numbers, respectively, and *φ: *?ⁿ → *? is the nonstandard extension of φ In the present note we want to prove an analogous theorem by predicative means only.     

Stochastic perturbation of solitons for Alfven waves in plasmas

The stochastic perturbation of solitons due to Alfven waves in plasmas, is studied in this paper, in addition to the deterministic perturbation terms. The Langevin equations are derived and it is proved that the soliton travels through the plasma with a fixed mean velocity.     

Even and odd holes in cap‐free graphs

It is an old problem in graph theory to test whether a graph contains a chordless cycle of length greater than three (hole) with a specific parity (even, odd). Studying the structure of graphs without odd holes has obvious implications for Berge's strong perfect graph conjecture that states that a graph G is perfect if and only if neither G nor its complement contain an odd hole. Markossian, Gasparian, and Reed have proven that if neither G nor its complement contain an even hole, then G is β‐perfect. In this article, we extend the problem of testing whether G(V, E) contains a hole of a given parity to the case where each edge of G has a label odd or even. A subset of E is odd (resp. even) if it contains an odd (resp. even) number of odd edges. Graphs for which there exists a signing (i.e., a partition of E into odd and even edges) that makes every triangle odd and every hole even are called even‐signable. Graphs that can be signed so that every triangle is odd and every triangle is odd and every hole is odd are called odd‐signable. We derive from a theorem due to Truemper co‐NP characterizations of even‐signable and odd‐signable graphs. A graph is strongly even‐signable if it can be signed so that every cycle of length ≥ 4 with at most one chord is even and every triangle is odd. Clearly a strongly even‐signable graph is even‐signable as well. Graphs that can be signed so that cycles of length four with one chord are even and all other cycles with at most one chord are odd are called strongly odd‐signable. Every strongly odd‐signable graph is odd‐signable. We give co‐NP characterizations for both strongly even‐signable and strongly odd‐signable graphs. A cap is a hole together with a node, which is adjacent to exactly two adjacent nodes on the hole. We derive a decomposition theorem for graphs that contain no cap as induced subgraph (cap‐free graphs). Our theorem is analogous to the decomposition theorem of Burlet and Fonlupt for Meyniel graphs, a well‐studied subclass of cap‐free graphs. If a graph is strongly even‐signable or strongly odd‐signable, then it is cap‐free. In fact, strongly even‐signable graphs are those cap‐free graphs that are even‐signable. From our decomposition theorem, we derive decomposition results for strongly odd‐signable and strongly even‐signable graphs. These results lead to polynomial recognition algorithms for testing whether a graph belongs to one of these classes. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 289–308, 1999