Search results for " Computer Science"
showing 10 items of 3983 documents
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…
On modal mu-calculus over finite graphs with bounded strongly connected components.
2010
For every positive integer k we consider the class SCCk of all finite graphs whose strongly connected components have size at most k. We show that for every k, the Modal mu-Calculus fixpoint hierarchy on SCCk collapses to the level Delta2, but not to Comp(Sigma1,Pi1) (compositions of formulas of level Sigma1 and Pi1). This contrasts with the class of all graphs, where Delta2=Comp(Sigma1,Pi1).
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…
Complex Detection in Protein-Protein Interaction Networks: A Compact Overview for Researchers and Practitioners
2012
The availability of large volumes of protein-protein interaction data has allowed the study of biological networks to unveil the complex structure and organization in the cell. It has been recognized by biologists that proteins interacting with each other often participate in the same biological processes, and that protein modules may be often associated with specific biological functions. Thus the detection of protein complexes is an important research problem in systems biology. In this review, recent graph-based approaches to clustering protein interaction networks are described and classified with respect to common peculiarities. The goal is that of providing a useful guide and referenc…
Sudoku – A Language Description Case Study
2009
A complete language description includes the structure as well as constraints, textual representation, graphical representation, and behaviour (transformation and execution). As a case study in language description, we consider Sudoku as a language, where a Sudoku puzzle is an instance of the language. Thus we are able to apply meta-model-based technologies for the creation of a language description for Sudoku, including correctness checking of a puzzle, and solving strategies. We identify what has to be expressed and how this can be done with the technology available today.
Two-dimensional filters for structured text
1997
The paper introduces a method for defining filters for structured text. In the method, the text structure is originally defined by a grammar consisting of a set of productions. To describe the information interests, a two-dimensional template is first created interactively from the grammar to show the structure of a set of textual elements, at a chosen level of detail. The template depicts the hierarchical structure of the elements and indicates also optionality, alternatives, and iteration in the structure. Then, the template is filled by constraints and annotations. The constraints allow giving conditions to the content of parts, to the position of parts in an ordered set of parts, and to…