Search results for "Crete"
showing 10 items of 2495 documents
Reactive Powder Concrete Containing Basalt Fibers: Strength, Abrasion and Porosity
2020
The paper presents the test results of basalt fiber impact on a compressive and flexural strength, resistance to abrasion and porosity of Reactive Powder Concrete (RPC). The reasons for testing were interesting mechanical properties of basalt fibers, the significant tensile strength and flexural strength, and in particular the resistance to high temperatures, as well as a relatively small number of RPC tests performed with those fibers and different opinions regarding the impact of those fibers on concrete strength. The composition of the concrete mix was optimized to obtain the highest packing density of particles in the composite, based on the optimum particle size distribution curve acc.…
A group-theory method to find stationary states in nonlinear discrete symmetry systems
2010
In the field of nonlinear optics, the self-consistency method has been applied to searching optical solitons in different media. In this paper, we generalize this method to other systems, adapting it to discrete symmetry systems by using group theory arguments. The result is a new technique that incorporates symmetry concepts into the iterative procedure of the self-consistency method, that helps the search of symmetric stationary solutions. An efficient implementation of this technique is also presented, which restricts the computational work to a reduced section of the entire domain and is able to find different types of solutions by specifying their symmetry properties. As a practical ap…
The guarded fragment with transitive guards
2004
The guarded fragment with transitive guards, (GF+TG), is an extension of the guarded frag- ment of 9rst-order logic, GF, in which certain predicates are required to be transitive, transitive predicate letters appear only in guards of the quanti9ers and the equality symbol may appear everywhere. We prove that the decision problem for (GF+TG) is decidable. Moreover, we show that the problem is in 2EXPTIME. This result is optimal since the satis9ability problem for GF is 2EXPTIME-complete (J. Symbolic Logic 64 (1999) 1719-1742). We also show that the satis- 9ability problem for two-variable (GF+TG) is NEXPTIME-hard in contrast to GF with bounded number of variables for which the satis9ability …
A fast heuristic for solving the D1EC coloring problem
2010
In this paper we propose an efficient heuristic for solving the Distance-1 Edge Coloring problem (D1EC) for the on-the-fly assignment of orthogonal wireless channels in wireless as soon as a topology change occurs. The coloring algorithm exploits the simulated annealing paradigm, i.e., a generalization of Monte Carlo methods for solving combinatorial problems. We show that the simulated annealing-based coloring converges fast to a sub optimal coloring scheme even for the case of dynamic channel allocation. However, a stateful implementation of the D1EC scheme is needed in order to speed-up the network coloring upon topology changes. In fact, a stateful D1EC reduces the algorithm’s convergen…
A Hybrid Strategic Oscillation with Path Relinking Algorithm for the Multiobjective k-Balanced Center Location Problem
2021
This paper presents a hybridization of Strategic Oscillation with Path Relinking to provide a set of high-quality nondominated solutions for the Multiobjective k-Balanced Center Location problem. The considered location problem seeks to locate k out of m facilities in order to serve n demand points, minimizing the maximum distance between any demand point and its closest facility while balancing the workload among the facilities. An extensive computational experimentation is carried out to compare the performance of our proposal, including the best method found in the state-of-the-art as well as traditional multiobjective evolutionary algorithms.
Algorithms for Rational Discrete Least Squares Approximation Part I: Unconstrained Optimization
1976
In this paper a modification of L. Wittmeyer’s method ([1], [14]) for rational discrete least squares approximation is given which corrects for its failure to converge to a non-optimal point in general. The modification makes necessary very little additional computing effort only. It is analysed thoroughly with respect to its conditions for convergence and its numerical properties. A suitable implementation is shown to be benign in the sense of F. L. Bauer [2]. The algorithm has proven successful even in adverse situations.
A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
1996
Acyclic directed graphs are commonly used to model complex systems. The most important criterion to obtain a readable map of an acyclic graph is that of minimizing the number of arc crossings. In this paper, we present a heuristic for solving the problem of minimizing the number of arc crossings in a bipartite graph. It consists of a novel and easier implementation of fundamental tabu search ideas without explicit use of memory structures (a tabu thresholding approach). Computational results are reported on a set of 250 randomly generated test problems. Our algorithm has been compared with the two best heuristics published in the literature and with the optimal solutions for the test proble…
An Island Strategy for Memetic Discrete Tomography Reconstruction
2014
In this paper we present a parallel island model memetic algorithm for binary discrete tomography reconstruction that uses only four projections without any further a priori information. The underlying combination strategy consists in separated populations of agents that evolve by means of different processes. Agents progress towards a possible solution by using genetic operators, switch and a particular compactness operator. A guided migration scheme is applied to select suitable migrants by considering both their own and their sub-population fitness. That is, from time to time, we allow some individuals to transfer to different subpopulations. The benefits of this paradigm were tested in …
A note on the separation of subtour elimination constraints in elementary shortest path problems
2013
Abstract This note proposes an alternative procedure for identifying violated subtour elimination constraints (SECs) in branch-and-cut algorithms for elementary shortest path problems. The procedure is also applicable to other routing problems, such as variants of travelling salesman or shortest Hamiltonian path problems, on directed graphs. The proposed procedure is based on computing the strong components of the support graph. The procedure possesses a better worst-case time complexity than the standard way of separating SECs, which uses maximum flow algorithms, and is easier to implement.
Discrete-timeH − ∕ H ∞ sensor fault detection observer design for nonlinear systems with parameter uncertainty
2013
SUMMARY This work concerns robust sensor fault detection observer (SFDO) design for uncertain and disturbed discrete-time Takagi–Sugeno (T–S) systems using H − ∕ H ∞ criterion. The principle of the proposed approach is based on simultaneously minimizing the perturbation effect and maximizing the fault effect on the residual vector. Furthermore, by introducing slack decision matrices and taking advantage of the descriptor formulation, less conservative sufficient conditions are proposed leading to easier linear matrix inequalities (LMIs). Moreover, the proposed (SFDO) design conditions allow dealing with unmeasurable premise variables. Finally, a numerical example and a truck–trailer system…