In 2011, Mallozzi et al. [Fuzzy Sets and Systems 165(2011) 98105] introduced a core-like concept (called F-core) and a balanced-like condition for games in which the worth of any coalition is given by means of a fuzzy interval. They proved that a balanced-like condition is necessary but not sufficient enough to guarantee the F-core to be non-empty. In this paper, we study deeply on this problem...

Consider a linear system A(p) · x = b(p), where the elements of the matrix and the right-hand side vector depend linearly on a m-tuple of parameters p = (p1, . . . , pm), the exact values of which are unknown but bounded within given intervals. Apart from quantifier elimination, the only known general way of describing the solution set {x ∈ Rn | ∃p ∈ [p],A(p)x = b(p)} is a lengthy and non-uniqu...

Machine learning often requires the optimization of multiple, partially conflicting objectives. True multi-objective optimization (MOO) methods avoid the need to choose a weighting of the objectives a priori and provide insights about the tradeoffs between the objectives. We extend a state-of-the-art derivative-free Monte Carlo method for MOO, the MO-CMA-ES, to operate on an unbounded set of (n...

In this study we evaluated and reported repellent effects of essential oils from Thai plants against 4 mosquito vectors: Aedes aegypti, Ae. albopictus, Anopheles. dirus and Culex quinquefasciatus under laboratory conditions using human volunteers. The essential oils were extracted from 18 plant species, belonging to 11 families, and the oils were then prepared as 10% solution in absolute ethano...

A distributed constraint optimization problem (DCOP) is a formalism that captures the rewards and costs of local interactions within a team of agents, each of whom is choosing an individual action. When rapidly selecting a single joint action for a team, we typically solve DCOPs (often using locally optimal algorithms) to generate a single solution. However, in scenarios where a set of joint ac...

We investigate solution sets of a special kind of linear inequality systems. In particular, we derive characterizations of these sets in terms of minimal solution sets. The studied inequalities emerge as information inequalities in the context of Bayesian networks. This allows to deduce important properties of Bayesian networks, which is important within causal inference.

This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components which characterize the equidimensional decomposition of the associated affine variety. This result is applied to design an equidimensional decomposition alg...

Given a linear equation L, a set A ⊆ [n] is L-free if A does not contain any ‘non-trivial’ solutions to L. In this paper we consider the following three general questions: (i) What is the size of the largest L-free subset of [n]? (ii) How many L-free subsets of [n] are there? (iii) How many maximal L-free subsets of [n] are there? We completely resolve (i) in the case when L is the equation px ...

‎In this paper‎, ‎we introduce $alpha$-$psi$-contractive mapping in partially ordered sets and construct fixed point theorems to solve a first-order ordinary differential equation by existence of its lower solution.

Some abnormal growth phenotypes including hybrid necrosis are often observed in F1 hybrids (genome constitution, ABD, 2n=21) and synthetic hexaploid wheat lines (AABBDD, 2n=42) which were artificially produced by crossing between tetraploid wheat (AABB, 2n=28) and Ae. tauschii (DD, 2n=14). The hybrid necrosis phenotypes are generally divided into type I and type II necrosis. In the hybrid plant...