The social foraging behavior of Escherichia coli bacteria has recently been studied by several researchers to develop a new algorithm for distributed optimization control. The Bacterial Foraging Optimization Algorithm (BFOA), as it is called now, has many features analogous to classical Evolutionary Algorithms (EA). Passino [1] pointed out that the foraging algorithms can be integrated in the framework of evolutionary algorithms. In this way BFOA can be used to model some key survival activities of the population, which is evolving. This article proposes a hybridization of BFOA with another very popular optimization technique of current interest called Differential Evolution (DE). The computational chemotaxis of BFOA, which may also be viewed as a stochastic gradient search, has been coupled with DE type mutation and crossing over of the optimization agents. This leads to the new hybrid algorithm, which has been shown to overcome the problems of slow and premature convergence of both the classical DE and BFOA over several benchmark functions as well as real world optimization problems.
Members of the Philometridae represent the most important group of dracunculoid nematodes parasitizing fishes. In his monograph treating the Dracunculoidea, Moravec (2006) reported a total of 11 genera and 105 species of philometrids parasitizing freshwater, brackish-water and marine fishes. However, during the last six years (2007-2012), an additional 42 new species of Philometridae have been described, representing a 40% increase of the number of nominal species. Most of these species (30) belong to Philometra Costa, 1845, mainly represented by parasites of marine fishes, a few others (8) to Philometroides Yamaguti, 1935, and a single one to each of the following genera: Caranginema Moravec, Montoya-Mendoza et Salgado-Maldonado, 2008, Dentiphilometra Moravec et Wang, 2002, Dentirumai Quiazon et Moravec, 2013* and Spirophilometra Parukhin, 1971. Moreover, three new genera, Afrophilometra Moravec, Charo-Karisa et Jirků, 2009, Caranginema and Dentirumai, were erected. Representatives of seven genera, Afrophilometra, Buckleyella Rasheed, 1963, Caranginema, Dentiphilometra, Dentirumai, Paraphilometroides Moravec et Shaharom-Harrison, 1989 and Rumai Travassos, 1960, were studied using scanning electron microscopy (SEM) for the first time. Thirteen known but poorly described philometrid species were redescribed and, in some species of Caranginema and Philometra, previously unknown conspecific males were discovered and described. The male surface ultrastructure studied by SEM provided new taxonomically important features for species distinction. Gene sequencing was used in several recent studies and advanced our understanding of phylogenetic interrelationships among representatives of seven genera (Afrophilometra, Alinema Rasheed, 1963, Caranginema, Nilonema Khalil, 1960, Philometra, Philometroides and Rumai) and of the extent of the biodiversity of philometrids. New data were obtained on the biology and pathogenicity of several species of Nilonema, Philometra, Philometroides and Rumai. The need to carry out surveys in order to find males and to use SEM and gene sequencing to identify philometrids is emphasized. Appropriate quantitative methods to determine the impact of philometrids in ovarian tissue on host fecundity are recommended. Further detailed studies on philometrids would be significant not only from the theoretical viewpoint, but also because of their practical implications. A list of philometrid nematode species by continents is provided.
A partial order on a bounded lattice L is called t-order if it is defined by means of the t-norm on L. It is obtained that for a t-norm on a bounded lattice L the relation a⪯Tb iff a=T(x,b) for some x∈L is a partial order. The goal of the paper is to determine some conditions such that the new partial order induces a bounded lattice on the subset of all idempotent elements of L and a complete lattice on the subset A of all elements of L which are the supremum of a subset of atoms.
In this paper a fuzzy relation-based framework is shown to be suitable to describe not only knowledge-based medical systems, explicitly using fuzzy approaches, but other ways of knowledge representation and processing. A particular example, the practically tested medical expert system Disco, is investigated from this point of view. The system is described in the fuzzy relation-based framework and compared with CADIAG-II-like systems that are a "pattern" for computer-assisted diagnosis systems based on a fuzzy technology. Similarities and discrepancies in - representation of knowledge, patient's information, inference mechanism and interpretation of results (diagnoses) - of the systems are established. This work can be considered as another step towards a general framework for computer-assisted medical diagnosis.
Utilizing the theory of fixed point index for compact maps, we establish new results on the existence of positive solutions for a certain third order boundary value problem. The boundary conditions that we study are of nonlocal type, involve Stieltjes integrals and are allowed to be nonlinear.
In this paper we present a topological duality for a certain subclass of the Fω-structures defined by M. M. Fidel, which conform to a non-standard semantics for the paraconsistent N. C. A. da Costa logic Cω. Actually, the duality introduced here is focused on Fω-structures whose supports are chains. For our purposes, we characterize every Fω-chain by means of a new structure that we will call down-covered chain (DCC) here. This characterization will allow us to prove the dual equivalence between the category of Fω-chains and a new category, whose objects are certain special topological spaces (together with a distinguished family of open sets) and whose morphisms are particular continuous functions.
We get the following result. A topological space is strongly paracompact if and only if for any monotone increasing open cover of it there exists a star-finite open refinement. We positively answer a question of the strongly paracompact property.
Fiedler and Markham (1994) proved {\left( {\frac{{\det \hat H}}{k}} \right)^k} \geqslant \det H, where H = (H_{ij})_{i,j}^{n}_{=1} is a positive semidefinite matrix partitioned into n × n blocks with each block k × k and \hat H = \left( {tr{H_{ij}}} \right)_{i,j = 1}^n. We revisit this inequality mainly using some terminology from quantum information theory. Analogous results are included. For example, under the same condition, we prove \det \left( {{I_n} + \hat H} \right) \geqslant \det {\left( {{I_{nk}} + kH} \right)^{{1 \mathord{\left/ {\vphantom {1 k}} \right. \kern-\nulldelimiterspace} k}}}., Minghua Lin., and Obsahuje seznam literatury