It has been shown in previous papers that classes of (minimal asymmetric) informationally-complete positive operator valued measures (IC-POVMs) in dimension d can be built using the multiparticle Pauli group acting on appropriate fiducial states. The latter states may also be derived starting from the Poincaré upper half-plane model H. To do this, one translates the congruence (or non-congruenc...

Multi-Mode Resource-Constrained Project Scheduling is an NP-hard optimization problem intensively studied due to its large area of applications. This paper concentrates on the evolutionary approaches to Multi-Mode Resource-Constrained Project Scheduling based on permutation encoded individuals. A new recombination operator is presented and a comparative analysis of several recombination operato...

the group $2^6{{}^{cdot}} g_2(2)$ is a maximal subgroup of the rudvalis group $ru$ of index 188500 and has order 774144 = $2^{12}.3^3.7$. in this paper, we construct the character table of the group $2^6{{}^{cdot}} g_2(2)$ by using the technique of fischer-clifford matrices.

The fitness distance correlation (FDC) as a measure for problem difficulty was first introduced by Forrest and Jones. It was applied to many binary coded problems. This method is now applied to permutation based problems. As demanded by Schiavinotto and Stützle, the distance in a search space is calculated by regarding the steps of the (neighborhood) operator. In this paper the five most common...

In this paper novel hybrid genetic algorithms for Open--Shop Scheduling Problem (OSSP) are presented. Two greedy heuristics LPT-Task and LPT-Machine are proposed for decoding chromosomes represented by permutations with repetitions. For comparison the standard permutation representation of OSSP instances is used. The algorithms apply also efficient crossover operator LOX and mutation operators ...

In this paper, we model fresh names in the π-calculus using abstractions with respect to a new binding operator θ. Both the theory and the metatheory of the π-calculus benefit from this simple extension. The operational semantics of this new calculus is finitely branching. Bisimulation can be given without mentioning any constraint on names, thus allowing for a straightforward definition of a c...

The work in this paper extends a memristive chaotic system with transcendental nonlinearities to the fractional-order domain. extended system’s properties were validated through bifurcation analysis and spectral entropy. presented was employed substitution stage of an image encryption algorithm, including generalized Arnold map for permutation. scheme demonstrated its efficiency statistical tes...

0