72 research outputs found

    Galactic vs. Extragalactic Origin of the Peculiar Transient SCP 06F6

    Full text link
    We study four scenarios for the SCP 06F6 transient event that was announced recently. Some of these were previously briefly discussed as plausible models for SCP 06F6, in particular with the claimed detection of a z=0.143 cosmological redshift of a Swan spectrum of a carbon rich envelope. We adopt this value of z for extragalactic scenarios. We cannot rule out any of these models, but can rank them from most to least preferred. Our favorite model is a tidal disruption of a CO white dwarf (WD) by an intermediate-mass black hole (IMBH). To account for the properties of the SCP 06F6 event, we have to assume the presence of a strong disk wind that was not included in previous numerical simulations. If the IMBH is the central BH of a galaxy, this explains the non detection of a bright galaxy in the direction of SCP 06F6. Our second favorite scenario is a type Ia-like SN that exploded inside the dense wind of a carbon star. The carbon star is the donor star of the exploded WD. Our third favorite model is a Galactic source of an asteroid that collided with a WD. Such a scenario was discussed in the past as the source of dusty disks around WDs, but no predictions exist regarding the appearance of such an event. Our least favorite model is of a core collapse SN. The only way we can account for the properties of SCP 06F6 with a core collapse SN is if we assume the occurrence of a rare type of binary interaction.Comment: Accepted by New Astronom

    A Computational Complexity Theory in Membrane Computing

    Get PDF
    In this paper, a computational complexity theory within the framework of Membrane Computing is introduced. Polynomial complexity classes associated with di erent models of cell-like and tissue-like membrane systems are de ned and the most relevant results obtained so far are presented. Many attractive characterizations of P 6= NP conjecture within the framework of a bio-inspired and non-conventional computing model are deduced.Ministerio de Educación y Ciencia TIN2006-13425Junta de Andalucía P08–TIC-0420

    Vector Bin Packing with Multiple-Choice

    Full text link
    We consider a variant of bin packing called multiple-choice vector bin packing. In this problem we are given a set of items, where each item can be selected in one of several DD-dimensional incarnations. We are also given TT bin types, each with its own cost and DD-dimensional size. Our goal is to pack the items in a set of bins of minimum overall cost. The problem is motivated by scheduling in networks with guaranteed quality of service (QoS), but due to its general formulation it has many other applications as well. We present an approximation algorithm that is guaranteed to produce a solution whose cost is about ln⁥D\ln D times the optimum. For the running time to be polynomial we require D=O(1)D=O(1) and T=O(log⁥n)T=O(\log n). This extends previous results for vector bin packing, in which each item has a single incarnation and there is only one bin type. To obtain our result we also present a PTAS for the multiple-choice version of multidimensional knapsack, where we are given only one bin and the goal is to pack a maximum weight set of (incarnations of) items in that bin

    a.SCatch: semantic structure for architectural floor plan retrieval

    Get PDF
    Architects’ daily routine involves working with drawings. They use either a pen or a computer to sketch out their ideas or to do a drawing to scale. We therefore propose the use of a sketch-based approach when using the floor plan repository for queries. This enables the user of the system to sketch a schematic abstraction of a floor plan and search for floor plans that are structurally similar. We also propose the use of a visual query language, and a semantic structure as put forward by Langenhan. An algorithm extracts the semantic structure sketched by the architect on DFKI’s Touch& Write table and compares the structure of the sketch with that of those from the floor plan repository. The a.SCatch system enables the user to access knowledge from past projects easily. Based on CBR strategies and shape detection technologies, a sketch-based retrieval gives access to a semantic floor plan repository. Furthermore, details of a prototypical application which allows semantic structure to be extracted from image data and put into the repository semi-automatically are provided

    Analyses and Validation of Conditional Dependencies with Built-in Predicates

    Get PDF
    This paper proposes a natural extension of conditional functional dependencies (CFDS [14]) and conditional inclusion dependencies (CINDS [8]), denoted by CFD(p)s and CIND(p)s, respectively, by specifying patterns of data, values with not equal, <, <=, > and >= predicates. As data quality rules, CFD(p)s and CIND(p)s are able to capture errors that commonly arise in practice but cannot, be detected by CFDS and CINDS. We establish two sets of results for central technical problems associated with CFD(p)s and CIND(p)s. (a) One concerns the satisfiability and implication problems for CFD(p)s and CIND(p)s, taken separately or together. These are important for, e.g., deciding whether data, quality rules are dirty themselves, and for removing redundant rules. We show that despite the increased expressive power, the static analyses of CFD(p)s and CIND(p)s retain the same complexity as their CFDs and CINDs counterparts. (b) The other concerns validation of CFD(p)s and CIND(p)s. We show that given a set Sigma of CFD(p)s and CIND(p)s on a database D, a, set of SQL queries can be automatically generated that, when evaluated against D, return all tuples in D that violate some dependencies in Sigma. This provides commercial DBMS with an immediate capability to detect errors based on CFD(p)s and CIND(p)s.Computer Science, Information SystemsComputer Science, Theory & MethodsEICPCI-S(ISTP)

    Visualization of fidaxomicin association with the exosporium layer of Clostridioides difficile spores

    Get PDF
    Indexación ScopusBackground: Fidaxomicin has novel pharmacologic effects on C. difficile spore formation including outgrowth inhibition and persistent spore attachment. However, the mechanism of fidaxomicin attachment on spores has not undergone rigorous microscopic studies. Materials & methods: Fidaxomicin attachment to C. difficile spores of three distinct ribotypes and C. difficile mutant spores with inactivation of exosporium or spore-coat protein-coding genes were visualized using confocal microscopy with a fidaxomicin-bodipy compound (green fluorescence). The pharmacologic effect of the fidaxomicin-bodipy compound was determined. Confocal microscopy experiments included direct effect on C. difficile wild-type and mutant spores, effect of exosporium removal, and direct attachment to a comparator spore forming organism, Bacillus subtilis. Results: The fidaxomicin-bodipy compound MIC was 1 mg/L compared to 0.06 mg/L for unlabeled fidaxomicin, a 16-fold increase. Using confocal microscopy, the intracellular localization of fidaxomicin into vegetative C. difficile cells was observed consistent with its RNA polymerase mechanism of action and inhibited spore outgrowth. The fidaxomicin-bodipy compound was visualized outside of the core of C. difficile spores with no co-localization with the membrane staining dye FM4-64. Exosporium removal reduced fidaxomicin-bodipy association with C. difficile spores. Reduced fidaxomicin-bodipy was observed in C. difficile mutant spores for the spore surface proteins CdeC and CotE. Conclusion: This study visualized a direct attachment of fidaxomicin to C. difficile spores that was diminished with mutants of specific exosporium and spore coat proteins. These data provide advanced insight regarding the anti-spore properties of fidaxomicin. © 2021 The Authorshttps://www-sciencedirect-com.recursosbiblioteca.unab.cl/science/article/pii/S1075996421000354?via%3Dihu

    Developing manufacturing control software: A survey and critique

    Full text link
    The complexity and diversity of manufacturing software and the need to adapt this software to the frequent changes in the production requirements necessitate the use of a systematic approach to developing this software. The software life-cycle model (Royce, 1970) that consists of specifying the requirements of a software system, designing, implementing, testing, and evolving this software can be followed when developing large portions of manufacturing software. However, the presence of hardware devices in these systems and the high costs of acquiring and operating hardware devices further complicate the manufacturing software development process and require that the functionality of this software be extended to incorporate simulation and prototyping.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/45542/1/10696_2005_Article_BF01328739.pd

    A Revenue-Aware Bandwidth Allocation Model and Algorithm in IP Networks

    No full text
    • 

    corecore