Search results for " Complexity"
showing 10 items of 623 documents
Prediction of lncRNA-Disease Associations from Tripartite Graphs
2021
The discovery of novel lncRNA-disease associations may provide valuable input to the understanding of disease mechanisms at lncRNA level, as well as to the detection of biomarkers for disease diagnosis, treatment, prognosis and prevention. Unfortunately, due to costs and time complexity, the number of possible disease-related lncRNAs verified by traditional biological experiments is very limited. Computational approaches for the prediction of potential disease-lncRNA associations can effectively decrease time and cost of biological experiments. We propose an approach for the prediction of lncRNA-disease associations based on neighborhood analysis performed on a tripartite graph, built upon …
Exploring chemical complexity in group IV reticular solids
2022
Esta tesis aborda el reto de ampliar las herramientas sintéticas disponibles para aumentar la complejidad química de los materiales reticulares basados en metales del grupo IV, dirigiéndose tanto a la parte orgánica como a la inorgánica de estos materiales porosos e híbridos. El capítulo 1 ofrece una visión del aumento de la complejidad química en los sólidos reticulares, que proporciona un contexto general a los resultados desarrollados durante esta tesis. A continuación, la introducción de la variación química en los conectores orgánicos se describe en los capítulos 2, 3 y 4, mientras que la transformación química de los nodos inorgánicos se introduce en el capítulo 5. Todo el trabajo des…
The Average State Complexity of the Star of a Finite Set of Words Is Linear
2008
We prove that, for the uniform distribution over all sets Xof m(that is a fixed integer) non-empty words whose sum of lengths is n, $\mathcal{D}_X$, one of the usual deterministic automata recognizing X*, has on average $\mathcal{O}(n)$ states and that the average state complexity of X*is i¾?(n). We also show that the average time complexity of the computation of the automaton $\mathcal{D}_X$ is $\mathcal{O}(n\log n)$, when the alphabet is of size at least three.
Two-variable First-Order Logic with Counting in Forests
2018
We consider an extension of two-variable, first-order logic with counting quantifiers and arbitrarily many unary and binary predicates, in which one distinguished predicate is interpreted as the mother-daughter relation in an unranked forest. We show that both the finite satisfiability and the general satisfiability problems for the extended logic are decidable in NExpTime. We also show that the decision procedure for finite satisfiability can be extended to the logic where two distinguished predicates are interpreted as the mother-daughter relations in two independent forests.
Market Polarization due to Difference in Interface Implementation Efforts
2009
Another factor potentially affecting the evolution of the OSS/BSS software market is the high complexity of software interfaces. The software provided to a customer – a CSP – needs to be integrated with a number of heterogeneous subsystems deployed by the customer. If the number of integration interfaces is high, a vast amount of special knowledge is needed in the vendor organization. High integration efforts also take up the time of the compentent employees of the vendor organization, thereby reducing the number of customers which it is capable of serving. As a result, only few large vendors can compete in such market, and, due to a lack of competition, the evolution towards a horizontaliz…
Chromatic sums for colorings avoiding monochromatic subgraphs
2015
Abstract Given graphs G and H, a vertex coloring c : V ( G ) → N is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ ( H , G ) , is the minimum number of colors in an H-free coloring of G. The H-free chromatic sum of G , Σ ( H , G ) , is the minimum value achieved by summing the vertex colors of each H-free coloring of G. We provide a general bound for Σ ( H , G ) , discuss the computational complexity of finding this parameter for different choices of H, and prove an exact formulas for some graphs G. For every integer k and for every graph H, we construct families of graphs, G k with the property that k more colors than χ ( …
Programmable VLSI cubic-like function implementation
2006
An analogue VLSI implementation of a cubic-like function is presented, whose design is focused to reduce the circuit complexity. Simulations show that the V–I characteristic of the circuit resembles a cubic function, which can be easily adjusted by changing the bias parameters.
Temporal incoherent solitons supported by a defocusing nonlinearity with anomalous dispersion
2012
http://pra.aps.org/; International audience; We study temporal incoherent solitons in noninstantaneous response nonlinear media. Contrarily to the usual temporal soliton, which is known to require a focusing nonlinearity with anomalous dispersion, we show that a highly noninstantaneous nonlinear response leads to incoherent soliton structures which require the inverted situation: In the focusing regime (and anomalous dispersion) the incoherent wave packet experiences an unlimited spreading, whereas in the defocusing regime (still with anomalous dispersion) the incoherent wave packet exhibits a self-trapping. These counterintuitive results are explained in detail by a long-range Vlasov formu…
Variances as order parameter and complexity measure for random Boolean networks
2005
Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems.
Perceptual odor blending is influenced by chemical complexity of odorant mixtures
2008
International audience; Perfumers and flavorists are familiar with odor blending phenomenon and often report that a minimum number of odorants has to be mixed for a good odor blend to arise. Previous studies in humans and animals suggested that a configural process could be involved in the perceptual analysis of mixtures of odorants. It has been proposed that the perceptual blending phenomenon corresponds to a configural perception of odorant mixtures. In the present study, we investigated the influence of chemical complexity on the configural perception of odorant mixtures. Six mixtures including 2 to 6 odorants as well as each unmixed odorant were assessed for their odor quality by a pane…