222,853 research outputs found

    A Method to Identify and Analyze Biological Programs through Automated Reasoning.

    Get PDF
    Predictive biology is elusive because rigorous, data-constrained, mechanistic models of complex biological systems are difficult to derive and validate. Current approaches tend to construct and examine static interaction network models, which are descriptively rich but often lack explanatory and predictive power, or dynamic models that can be simulated to reproduce known behavior. However, in such approaches implicit assumptions are introduced as typically only one mechanism is considered, and exhaustively investigating all scenarios is impractical using simulation. To address these limitations, we present a methodology based on automated formal reasoning, which permits the synthesis and analysis of the complete set of logical models consistent with experimental observations. We test hypotheses against all candidate models, and remove the need for simulation by characterizing and simultaneously analyzing all mechanistic explanations of observed behavior. Our methodology transforms knowledge of complex biological processes from sets of possible interactions and experimental observations to precise, predictive biological programs governing cell function

    Benchmarking of sustainability to assess practices and performances of the management of the end of life cycle of electronic products: A study of Brazilian manufacturing companies

    Get PDF
    The relentless pursuit of lower production costs causes companies to invest in more efficient production systems so that they can remain economically competitive, while the actions focusing on more sustainable operations from an environmental point of view are usually performed to meet the political government regulating environmental control. However, it is common for companies to focus their efforts to minimize the environmental impacts at an early stage of the product life cycle, neglecting sustainability management in the post-use phase. Given the context, this study seeks to develop sustainability indicators that can be used by the electronics industry to assess the level of practice and performance during production that are related to product recovery after the use phase, in order to better understand how companies are acting to reduce the environmental impacts of their products at the end of their life cycle. Initially, critical success factors related to environmental management of the product’s end-of-life are obtained. Then, some of those critical success factors are prioritized, giving rise to the indicators of sustainability used in the benchmarking method. Benchmarking was performed in electronics Brazilian companies, and the data was obtained by means of a questionnaire and interviews. It is concluded from the results that the proposed indicators are suitable for measuring the levels of practices and performance of the participant companies in environmental management at the end of the product life cycle as the indicators were able to portray faithfully the reality of each company

    Complete moduli of cubic threefolds and their intermediate Jacobians

    Get PDF
    The intermediate Jacobian map, which associates to a smooth cubic threefold its intermediate Jacobian, does not extend to the GIT compactification of the space of cubic threefolds, not even as a map to the Satake compactification of the moduli space of principally polarized abelian fivefolds. A much better "wonderful" compactification of the space of cubic threefolds was constructed by the first and fourth authors --- it has a modular interpretation, and divisorial normal crossing boundary. We prove that the intermediate Jacobian map extends to a morphism from the wonderful compactification to the second Voronoi toroidal compactification of the moduli of principally polarized abelian fivefolds --- the first and fourth author previously showed that it extends to the Satake compactification. Since the second Voronoi compactification has a modular interpretation, our extended intermediate Jacobian map encodes all of the geometric information about the degenerations of intermediate Jacobians, and allows for the study of the geometry of cubic threefolds via degeneration techniques. As one application we give a complete classification of all degenerations of intermediate Jacobians of cubic threefolds of torus rank 1 and 2.Comment: 56 pages; v2: multiple updates and clarification in response to detailed referee's comment

    Super edge-magic deficiency of join-product graphs

    Full text link
    A graph GG is called \textit{super edge-magic} if there exists a bijective function ff from V(G)âˆȘE(G)V(G) \cup E(G) to {1,2,
,∣V(G)âˆȘE(G)∣}\{1, 2, \ldots, |V(G) \cup E(G)|\} such that f(V(G))={1,2,
,∣V(G)∣}f(V(G)) = \{1, 2, \ldots, |V(G)|\} and f(x)+f(xy)+f(y)f(x) + f(xy) + f(y) is a constant kk for every edge xyxy of GG. Furthermore, the \textit{super edge-magic deficiency} of a graph GG is either the minimum nonnegative integer nn such that GâˆȘnK1G \cup nK_1 is super edge-magic or +∞+\infty if there exists no such integer. \emph{Join product} of two graphs is their graph union with additional edges that connect all vertices of the first graph to each vertex of the second graph. In this paper, we study the super edge-magic deficiencies of a wheel minus an edge and join products of a path, a star, and a cycle, respectively, with isolated vertices.Comment: 11 page

    Low-density MDS codes and factors of complete graphs

    Get PDF
    We present a class of array code of size n×l, where l=2n or 2n+1, called B-Code. The distances of the B-Code and its dual are 3 and l-1, respectively. The B-Code and its dual are optimal in the sense that i) they are maximum-distance separable (MDS), ii) they have an optimal encoding property, i.e., the number of the parity bits that are affected by change of a single information bit is minimal, and iii) they have optimal length. Using a new graph description of the codes, we prove an equivalence relation between the construction of the B-Code (or its dual) and a combinatorial problem known as perfect one-factorization of complete graphs, thus obtaining constructions of two families of the B-Code and its dual, one of which is new. Efficient decoding algorithms are also given, both for erasure correcting and for error correcting. The existence of perfect one-factorizations for every complete graph with an even number of nodes is a 35 years long conjecture in graph theory. The construction of B-Codes of arbitrary odd length will provide an affirmative answer to the conjecture
    • 

    corecore