Search results for "comparison"
showing 10 items of 701 documents
Dichotomies properties on computational complexity of S-packing coloring problems
2015
This work establishes the complexity class of several instances of the S -packing coloring problem: for a graph G , a positive integer k and a nondecreasing list of integers S = ( s 1 , ? , s k ) , G is S -colorable if its vertices can be partitioned into sets S i , i = 1 , ? , k , where each S i is an s i -packing (a set of vertices at pairwise distance greater than s i ). In particular we prove a dichotomy between NP-complete problems and polynomial-time solvable problems for lists of at most four integers.
An extension of the Burrows-Wheeler Transform and applications to sequence comparison and data compression
2005
We introduce a generalization of the Burrows-Wheeler Transform (BWT) that can be applied to a multiset of words. The extended transformation, denoted by E, is reversible, but, differently from BWT, it is also surjective. The E transformation allows to give a definition of distance between two sequences, that we apply here to the problem of the whole mitochondrial genome phylogeny. Moreover we give some consideration about compressing a set of words by using the E transformation as preprocessing.
An extension of the Burrows-Wheeler Transform
2007
AbstractWe describe and highlight a generalization of the Burrows–Wheeler Transform (bwt) to a multiset of words. The extended transformation, denoted by ebwt, is reversible. Moreover, it allows to define a bijection between the words over a finite alphabet A and the finite multisets of conjugacy classes of primitive words in A∗. Besides its mathematical interest, the extended transform can be useful for applications in the context of string processing. In the last part of this paper we illustrate one such application, providing a similarity measure between sequences based on ebwt.
Fixed point theorems for non-self mappings in symmetric spaces under φ-weak contractive conditions and an application to functional equations in dyna…
2014
In this paper, we prove some common fixed point theorems for two pairs of non-self weakly compatible mappings enjoying common limit range property, besides satisfying a generalized phi-weak contractive condition in symmetric spaces. We furnish some illustrative examples to highlight the realized improvements in our results over the corresponding relevant results of the existing literature. We extend our main result to four finite families of mappings in symmetric spaces using the notion of pairwise commuting mappings. Finally, we utilize our results to discuss the existence and uniqueness of solutions of certain system of functional equations arising in dynamic programming.
A weak comparison principle for solutions of very degenerate elliptic equations
2012
We prove a comparison principle for weak solutions of elliptic quasilinear equations in divergence form whose ellipticity constants degenerate at every point where \(\nabla u\in K\), where \(K\subset \mathbb{R }^N\) is a Borel set containing the origin.
Compound conditionals, Fr\'echet-Hoeffding bounds, and Frank t-norms
2021
Abstract In this paper we consider compound conditionals, Frechet-Hoeffding bounds and the probabilistic interpretation of Frank t-norms. By studying the solvability of suitable linear systems, we show under logical independence the sharpness of the Frechet-Hoeffding bounds for the prevision of conjunctions and disjunctions of n conditional events. In addition, we illustrate some details in the case of three conditional events. We study the set of all coherent prevision assessments on a family containing n conditional events and their conjunction, by verifying that it is convex. We discuss the case where the prevision of conjunctions is assessed by Lukasiewicz t-norms and we give explicit s…
Automated source code transformations on fourth generation languages
2004
To control the operation of large application suites or to tailor a special purpose application to particular need, developers frequently use application specific languages, such as batch, scripting, and query languages. These languages which are also referred to as fourth generation languages (4GLs) therefore play an important role in today's economy. Incompatibilities between different versions of 4GLs and changing requirements may make massive changes on a company's library of 4GL programs necessary. Here, we explore possibilities for performing mass changes on 4GLs and show how the transformation of programs written in 4GLs compares to the transformation of mainstream programming langua…
Tree Based Domain-Specific Mapping Languages
2012
Model transformation languages have been mainly used by researchers --- the software engineering industry has not yet widely accepted the model driven software development (MDSD). One of the main reasons is the complexity of metamodelling principles the developers are required to know to actually use model transformations in the way the OMG has stated. We offer the basic principles how to create domain-specific model transformation languages which can be used by developers relying only on familiar modelling concepts. We propose to use simple graphical mappings to specify the correspondence between source and target models which are represented using trees based on the concrete syntax of und…
Parental working time patterns and children's socioemotional wellbeing: Comparing working parents in Finland, the United Kingdom, and the Netherlands
2017
Abstract This cross-national study examined the connections between parental working time patterns (i.e., regular day work vs. nonstandard working hours) and children's socio-emotional wellbeing defined in terms of internalizing and externalizing problems and prosocial behavior. We also examined how the total number of hours worked, changes in work schedules, working overtime at short notice, and having an influence over one's work schedules were linked with children's wellbeing. Data were collected by a web survey from Finnish ( n = 358), Dutch ( n = 200) and British ( n = 267) parents with children aged 3 to 12 years. The results showed, that in all three countries parents working nons…