Search results for "General Computer Science"
showing 10 items of 895 documents
Applying Cathegorical Metrics on Fuzzy Systems
2007
This work analyzes the categorical metrics usage on a very specific subset of Intelligent Systems: Fuzzy Systems. Several characteristics for such systems must be carefully evaluated when metrics and indicators are defined, in order to consider the fuzzy essence as part of the evaluation result. A set of metrics and indicators are defined and applied to the classical inverted pendulum problem. The paper does not intend to provide an exhaustive analysis of the quality evaluation on soft computing problem. It just presents a way to start the study of quality measure in that area.
Special factors and the combinatorics of suffix and factor automata
2011
AbstractThe suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministic automaton recognizing the set of suffixes (resp. factors) of w. We study the relationships between the structure of the suffix and factor automata and classical combinatorial parameters related to the special factors of w. We derive formulae for the number of states of these automata. We also characterize the languages LSA and LFA of words having respectively suffix automaton and factor automaton with the minimal possible number of states.
Applications of the vehicle routing problem with trailers and transshipments
2013
Abstract The vehicle routing problem with trailers and transshipments (VRPTT) is a recent and challenging extension of the well-known vehicle routing problem. The VRPTT constitutes an archetypal representative of the class of vehicle routing problems with multiple synchronization constraints (VRPMSs). In addition to the usual task covering constraints, VRPMSs require further synchronization between vehicles, concerning spatial, temporal, and load aspects. VRPMSs possess considerable practical relevance, but limited coverage in the scientific literature. The purpose of the present paper is to describe how several important types of VRPMSs, such as multi-echelon location-routing problems and …
Hybrid Modelling and Control of a Class of Power Converters With Triangular-Carrier PWM Inputs
2021
In this paper, a new control design procedure for a class of power converters based on hybrid dynamical systems theory is presented. The continuous-time dynamics, as voltage and current signals, and discretetime dynamics, as the on-off state of the switches, are captured with a hybrid model. This model avoids the use of averaged and approximated models and includes the PWM as well as the sample-and-hold mechanism, commonly used in the industry. Then, another simplified hybrid system, whose trajectories match with the original one, is selected to design the controller and to analyse stability properties. Finally, an estimation of the chattering in steady state of the voltage and current sign…
A stochastic method for robustness analysis in sorting problems
2009
ELECTRE TRI is a multiple criteria decision aiding sorting method with a history of successful real-life applications. In ELECTRE TRI, values for certain parameters have to be provided. We propose a new method, SMAA-TRI, that is based on stochastic multicriteria acceptability analysis (SMAA), for analyzing the stability of such parameters. The stability analysis can be used for deriving robust conclusions. SMAA-TRI allows ELECTRE TRI to be used with uncertain, arbitrarily distributed values for weights, the lambda cutting level, and profiles. The method consists of analyzing finite spaces of arbitrarily distributed parameter values. Monte Carlo simulation is applied in this in order to desc…
Finitary formal topologies and Stone’s representation theorem
2008
AbstractWe study the concept of finitary formal topology, a point-free version of a topological space with a basis of compact open subsets. The notion of finitary formal topology is defined from the perspective of the Basic Picture (introduced by the second author) and thus it is endowed with a binary positivity relation. As an application, we prove a constructive version of Stone’s representation theorem for distributive lattices. We work within the framework of a minimalist foundation (as proposed by Maria Emilia Maietti and the second author). Both inductive and co-inductive methods are used in most proofs.
Long term capacity decisions in uncertain markets for advanced manufacturing systems incorporating scope economies
2002
Abstract By examining the literature in the field of manufacturing flexibility many researchers have located several form of flexibility by distinguishing them into strategic and operational flexibility forms. Furthermore, many measures and design methods have been proposed for flexible manufacturing systems. Surely scope economies are one of the most important strategic form of flexibility in manufacturing systems and their strategic impact has been acknowledged by the very beginning of the flexible manufacturing era. However, despite several researches are available to address scope economies measurement and design methodologies, very few researches investigate their economic convenience …
Magnetoelectric Cavity Magnonics in Skyrmion Crystals
2022
We present a theory of magnetoelectric magnon-photon coupling in cavities hosting noncentrosymmetric magnets. Analogously to nonreciprocal phenomena in multiferroics, the magnetoelectric coupling is time-reversal and inversion asymmetric. This asymmetry establishes a means for exceptional tunability of magnon-photon coupling, which can be switched on and off by reversing the magnetization direction. Taking the multiferroic skyrmion-host Cu$_2$OSeO$_3$ with ultralow magnetic damping as an example, we reveal the electrical activity of skyrmion eigenmodes and propose it for magnon-photon splitting of ``magnetically dark'' elliptic modes. Furthermore, we predict a cavity-induced magnon-magnon c…
Measuring diversity. A review and an empirical analysis
2021
Abstract Maximum diversity problems arise in many practical settings from facility location to social networks, and constitute an important class of NP-hard problems in combinatorial optimization. There has been a growing interest in these problems in recent years, and different mathematical programming models have been proposed to capture the notion of diversity. They basically consist of selecting a subset of elements of a given set in such a way that a measure based on their pairwise distances is maximized to achieve dispersion or representativeness. In this paper, we perform an exhaustive comparison of four mathematical models to achieve diversity over the public domain library MDPLIB, …
Memetic algorithms and memetic computing optimization: A literature review
2012
Abstract Memetic computing is a subject in computer science which considers complex structures such as the combination of simple agents and memes, whose evolutionary interactions lead to intelligent complexes capable of problem-solving. The founding cornerstone of this subject has been the concept of memetic algorithms, that is a class of optimization algorithms whose structure is characterized by an evolutionary framework and a list of local search components. This article presents a broad literature review on this subject focused on optimization problems. Several classes of optimization problems, such as discrete, continuous, constrained, multi-objective and characterized by uncertainties…