We consider the problem of finding minimal edge-ordered spanning trees where the edge costs are not fixed, but are time dependent[7]. We propose using multiple genomic redundant representations in a selfadapting genetic algorithm (GA) employing various codes with different locality properties. These encoding schemes (e.g., permutation codes and prufer-like codes) either insure feasibility or re...

The capacitated multipoint network design problem (CMNDP) is NP-complete. In this paper, a hybrid genetic algorithm for CMNDP is proposed. The multiobjective hybrid genetic algorithm (MOHGA) differs from other genetic algorithms (GAs) mainly in its selection procedure. The concept of subpopulation is used in MOHGA. Four subpopulations are generated according to the elitism reservation strategy,...

Partial metrics, or the equivalent weightable quasi-metrics, have been introduced in [Mat94] as part of the study of the denotational semantics of data flow networks (cf. also [Mat95]). The interest in valuations in connection to Domain Theory derives from e.g. [JP89], [Jon89], [Eda94] and [Hec95]. Connections between partial metrics and valuations have been discussed in the literature, e.g. [O...

In this paper, forced responses are investigated in a two degree-of-freedom linear system with a linear coupling to a Nonlinear Energy Sink (NES) subjected to quasi-periodic excitation. The quasi-periodic regimes associated to quasi-periodic forcing in the regime of 1:1-1:1 are studied analytically using the complexification method combined to the averaging method in terms of multi-time paramet...

We introduce the strong quasi-liberal rule, which is an extension of the strong liberal rule in Kasher and Rubinstein (1997) through the requirement of at least one agreement. We provide an axiomatic characterization of strong quasi-liberal rule. Similarly, we generalize the order of the rule (associated with the degree of minimum agreement requirement) to match the Consent Rules in Samet and S...

Abstract. In this paper we establish some properties of fuzzy quasi-pseudo-metric spaces. An important result is that any partial ordering can be defined by a fuzzy quasi-metric, which can be applied both in theoretical computer science and in information theory, where it is usual to work with sequences of objects of increasing information. We also obtain decomposition theorems of a fuzzy quasi...

We generalize the construction of the formal ball model for metric spaces due to A. Edalat and R. Heckmann to obtain computational models for separated Q-categories. We fully describe (a) Yoneda complete and (b) continuous Yoneda complete Q-categories via their formal ball models. Our results yield solutions to two open problems in the theory of quasi-metric spaces: we show that (a) a quasi-met...

We deene an analogue of the Gibbs{Curie energy for quasi{crystals. We show that there exists a Wull{type shape optimizing this energy, which is always a convex polytope. This way we can model the triacontahedron and the dodecahedron as shapes of quasi{crystals, according to reality. We also provide a shorter proof for the well{known formula for the number of points of a non{periodic set in a la...

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions for independent sets, perfect matchings, Hamiltonian cycles and dense subgraphs in graphs as well as for graph colorings. This allows us to tell apart in quasi...

In this paper, an advanced ultra-fast, broadband time domain EMI measurement system is described. Measurements were performed in the 30–1000 MHz range. The digital signal processing of EMI measurements allows to emulate in real-time the modes of conventional analogous equipment, e.g. Peak-, Average-, RMSand Quasi-PeakDetector. With the presented time domain measurement system the measurement ti...