Search results for "complexi"
showing 10 items of 1116 documents
Relative principal congruences in congruence-modular quasivarieties
1998
The problem of definability of relative principal congruences in relatively congruence modular (RCM) quasivarieties is investigated. The RCM quasivarieties are characterized in terms of parameterized families of finite sets of pairs of terms which define relative principal congruences.
Injectors with a normal complement in a finite solvable group
2011
Abstract Suppose G is a finite solvable group, and H is a subgroup with a normal complement in G. We shall find necessary and sufficient conditions (some of which are related to the properties of coprime actions) for H to be an injector in G. We shall also use these criteria to find characterizations of injectors which need not have a normal complement.
Algebraic and logical characterizations of deterministic linear time classes
1997
In this paper an algebraic characterization of the class DLIN of functions that can be computed in linear time by a deterministic RAM using only numbers of linear size is given. This class was introduced by Grandjean, who showed that it is robust and contains most computational problems that are usually considered to be solvable in deterministic linear time.
Improving Interpolants for Linear Arithmetic
2015
Craig interpolation for satisfiability modulo theory formulas have come more into focus for applications of formal verification. In this paper we, introduce a method to reduce the size of linear constraints used in the description of already computed interpolant in the theory of linear arithmetic with respect to the number of linear constraints. We successfully improve interpolants by combining satisfiability modulo theory and linear programming in a local search heuristic. Our experimental results suggest a lower running time and a larger reduction compared to other methods from the literature.
Paths Coloring Algorithms in Mesh Networks
2003
In this paper, we will consider the problem of coloring directed paths on a mesh network. A natural application of this graph problem is WDM-routing in all-optical networks. Our main result is a simple 4-approximation algorithm for coloring line-column paths on a mesh. We also present sharper results when there is a restriction on the path lengths. Moreover, we show that these results can be extended to toroidal meshes and to line-column or column-line paths.
Dynamic 2- and 3-connectivity on planar graphs
1992
We study the problem of maintaining the 2-edge-, 2-vertex-, and 3-edge-connected components of a dynamic planar graph subject to edge deletions. The 2-edge-connected components can be maintained in a total of O(n log n) time under any sequence of at most O(n) deletions. This gives O(log n) amortized time per deletion. The 2-vertex- and 3-edge-connected components can be maintained in a total of O(n log2n) time. This gives O(log2n) amortized time per deletion. The space required by all our data structures is O(n).
How self-assembly of amphiphilic molecules can generate complexity in the nanoscale
2015
Abstract Given the importance of nanomaterials and nanostructures in modern technology, in the past decades much effort has been directed to set up efficient bottom up protocols for the piloted self-assembly of molecules. However, molecules are generally disinclined to adopt the desired structural organization because they behave according to their own specific intermolecular interactions. Thus, only some selected classes of chemical compounds are capable to lead to useful self-assembled structures. Amphiphiles, simultaneously possessing polar and apolar moieties within their molecular architecture, can give a wide scenario of possible intermolecular interactions: polar–polar, polar–apolar,…
Anion Recognition by a Bioactive Diureidodecalin Anionophore: Solid-State, Solution, and Computational Studies
2018
Recent work has identified a bis-(p-nitrophenyl)ureidodecalin anion carrier as a promising candidate for biomedical applications, showing good activity for chloride transport in cells yet almost no cytotoxicity. To underpin further development of this and related compounds, a detailed structural and binding investigation is reported. Crystal structures of the transporter as five solvates confirm the diaxial positioning of urea groups while revealing a degree of conformational flexibility. Structures of complexes with Cl−, Br−, NO3 −, SO4 2− and AcO−, supported by computational studies, show how the binding site can adapt to accommodate these anions. 1H NMR binding studies revealed exception…
Multi-disciplinary, Inter-disciplinary, Anti-disciplinary. Transition Knowledges in Design Education
2023
The environmental issues are recently proving to be the center and the connecting element of all the states of crisis, only apparently diversified (energy, political, migration); after the lucid forward-looking analysis of Maldonado in the 70s, the vision proposed in 2019 by the exhibition Broken Nature opens new spaces to the “design hope” activated by design, emphasizing the broad responsibility that the designer must take on contemporary challenges. The complex scenarios of the “transition” (environmental, cultural, productive) are also based on the ability of disciplinary encroachment and on the most radical forms of “anti-disciplinary” innovation, which in some cases opens to design fo…
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
2009
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be found in fields as diverse as Economics, Neuroscience and Biochemistry. The paper deals with the problem of deriving a descriptive model of a network, collecting the node outputs as time series with no use of a priori insight on the topology. We cast the problem as the optimization of a cost function operating a trade-off between accuracy and complexity in the final model. We address the problem of reducing the complexity by fixing a certain degree of sparsity, and trying to find the solution that “better” satisfi…