180 research outputs found

    Low-Surface-Brightness Galaxies in the Sloan Digital Sky Survey. I. Search Method and Test Sample

    Full text link
    In this paper we present results of a pilot study to use imaging data from the Sloan Digital Sky Survey (SDSS) to search for low-surface-brightness (LSB) galaxies. For our pilot study we use a test sample of 92 galaxies from the catalog of Impey et al. (1996) distributed over 93 SDSS fields of the Early Data Release (EDR). Many galaxies from the test sample are either LSB or dwarf galaxies. To deal with the SDSS data most effectively a new photometry software was created, which is described in this paper. We present the results of the selection algorithms applied to these 93 EDR fields. Two galaxies from the Impey et al. test sample are very likely artifacts, as confirmed by follow-up imaging. With our algorithms, we were able to recover 87 of the 90 remaining test sample galaxies, implying a detection rate of ∌\sim96.5%. The three missed galaxies fall too close to very bright stars or galaxies. In addition, 42 new galaxies with parameters similar to the test sample objects were found in these EDR fields (i.e., ∌\sim47% additional galaxies). We present the main photometric parameters of all identified galaxies and carry out first statistical comparisons. We tested the quality of our photometry by comparing the magnitudes for our test sample galaxies and other bright galaxies with values from the literature. All these tests yielded consistent results. We briefly discuss a few unusual galaxies found in our pilot study, including an LSB galaxy with a two-component disk and ten new giant LSB galaxies.Comment: 36 pages, 16 figures, accepted for publication by AJ, some figures were bitmapped to reduce the siz

    Dietary α-linolenic acid diminishes experimental atherogenesis and restricts T cell-driven inflammation

    Get PDF
    Aims Epidemiological studies report an inverse association between plant-derived dietary α-linolenic acid (ALA) and cardiovascular events. However, little is known about the mechanism of this protection. We assessed the cellular and molecular mechanisms of dietary ALA (flaxseed) on atherosclerosis in a mouse model. Methods and results Eight-week-old male apolipoprotein E knockout (ApoE−/−) mice were fed a 0.21 % (w/w) cholesterol diet for 16 weeks containing either a high ALA [7.3 % (w/w); n = 10] or low ALA content [0.03 % (w/w); n = 10]. Bioavailability, chain elongation, and fatty acid metabolism were measured by gas chromatography of tissue lysates and urine. Plaques were assessed using immunohistochemistry. T cell proliferation was investigated in primary murine CD3-positive lymphocytes. T cell differentiation and activation was assessed by expression analyses of interferon-Îł, interleukin-4, and tumour necrosis factor α (TNFα) using quantitative PCR and ELISA. Dietary ALA increased aortic tissue levels of ALA as well as of the n−3 long chain fatty acids (LC n−3 FA) eicosapentaenoic acid, docosapentaenoic acid, and docosahexaenoic acid. The high ALA diet reduced plaque area by 50% and decreased plaque T cell content as well as expression of vascular cell adhesion molecule-1 and TNFα. Both dietary ALA and direct ALA exposure restricted T cell proliferation, differentiation, and inflammatory activity. Dietary ALA shifted prostaglandin and isoprostane formation towards 3-series compounds, potentially contributing to the atheroprotective effects of ALA. Conclusion Dietary ALA diminishes experimental atherogenesis and restricts T cell-driven inflammation, thus providing the proof-of-principle that plant-derived ALA may provide a valuable alternative to marine LC n−3 F

    Smc5/6 coordinates formation and resolution of joint molecules with chromosome morphology to ensure meiotic divisions

    Get PDF
    During meiosis, Structural Maintenance of Chromosome (SMC) complexes underpin two fundamental features of meiosis: homologous recombination and chromosome segregation. While meiotic functions of the cohesin and condensin complexes have been delineated, the role of the third SMC complex, Smc5/6, remains enigmatic. Here we identify specific, essential meiotic functions for the Smc5/6 complex in homologous recombination and the regulation of cohesin. We show that Smc5/6 is enriched at centromeres and cohesin-association sites where it regulates sister-chromatid cohesion and the timely removal of cohesin from chromosomal arms, respectively. Smc5/6 also localizes to recombination hotspots, where it promotes normal formation and resolution of a subset of joint-molecule intermediates. In this regard, Smc5/6 functions independently of the major crossover pathway defined by the MutLÎł complex. Furthermore, we show that Smc5/6 is required for stable chromosomal localization of the XPF-family endonuclease, Mus81-Mms4Eme1. Our data suggest that the Smc5/6 complex is required for specific recombination and chromosomal processes throughout meiosis and that in its absence, attempts at cell division with unresolved joint molecules and residual cohesin lead to severe recombination-induced meiotic catastroph

    Genotoxic mechanisms for the carcinogenicity of the environmental pollutants and carcinogens o-anisidine and 2-nitroanisole follow from adducts generated by their metabolite N-(2-methoxyphenyl)-hydroxylamine with deoxyguanosine in DNA

    Get PDF
    An aromatic amine, o-anisidine (2-methoxyaniline) and its oxidative counterpart, 2-nitroanisole (2-methoxynitrobenzene), are the industrial and environmental pollutants causing tumors of the urinary bladder in rats and mice. Both carcinogens are activated to the same proximate carcinogenic metabolite, N-(2-methoxyphenyl)hydroxylamine, which spontaneously decomposes to nitrenium and/or carbenium ions responsible for formation of deoxyguanosine adducts in DNA in vitro and in vivo. In other words, generation of N-(2-methoxyphenyl)hydroxylamine is responsible for the genotoxic mechanisms of the o-anisidine and 2-nitroanisole carcinogenicity. Analogous enzymes of human and rat livers are capable of activating these carcinogens. Namely, human and rat cytochorme P4502E1 is the major enzyme oxidizing o-anisidine to N-(2-methoxyphenyl)hydroxylamine, while xanthine oxidase of both species reduces 2-nitroanisole to this metabolite. Likewise, O-demethylation of 2-nitroanisole, which is the detoxication pathway of its metabolism, is also catalyzed by the same human and rat enzyme, cytochorme P450 2E1. The results demonstrate that the rat is a suitable animal model mimicking the fate of both carcinogens in humans and suggest that both compounds are potential carcinogens also for humans

    A flexible coupling approach to multi-agent planning under incomplete information

    Full text link
    The final publication is available at Springer via http://dx.doi.org/10.1007/s10115-012-0569-7Multi-agent planning (MAP) approaches are typically oriented at solving loosely coupled problems, being ineffective to deal with more complex, strongly related problems. In most cases, agents work under complete information, building complete knowledge bases. The present article introduces a general-purpose MAP framework designed to tackle problems of any coupling levels under incomplete information. Agents in our MAP model are partially unaware of the information managed by the rest of agents and share only the critical information that affects other agents, thus maintaining a distributed vision of the task. Agents solve MAP tasks through the adoption of an iterative refinement planning procedure that uses single-agent planning technology. In particular, agents will devise refinements through the partial-order planning paradigm, a flexible framework to build refinement plans leaving unsolved details that will be gradually completed by means of new refinements. Our proposal is supported with the implementation of a fully operative MAP system and we show various experiments when running our system over different types of MAP problems, from the most strongly related to the most loosely coupled.This work has been partly supported by the Spanish MICINN under projects Consolider Ingenio 2010 CSD2007-00022 and TIN2011-27652-C03-01, and the Valencian Prometeo project 2008/051.Torreño Lerma, A.; Onaindia De La Rivaherrera, E.; Sapena Vercher, O. (2014). A flexible coupling approach to multi-agent planning under incomplete information. Knowledge and Information Systems. 38:141-178. https://doi.org/10.1007/s10115-012-0569-7S14117838Argente E, Botti V, Carrascosa C, Giret A, Julian V, Rebollo M (2011) An abstract architecture for virtual organizations: the THOMAS approach. Knowl Inf Syst 29(2):379–403Barrett A, Weld DS (1994) Partial-order planning: evaluating possible efficiency gains. Artif Intell 67(1):71–112Belesiotis A, Rovatsos M, Rahwan I (2010) Agreeing on plans through iterated disputes. In: Proceedings of the 9th international conference on autonomous agents and multiagent systems. pp 765–772Bellifemine F, Poggi A, Rimassa G (2001) JADE: a FIPA2000 compliant agent development environment. In: Proceedings of the 5th international conference on autonomous agents (AAMAS). ACM, pp 216–217Blum A, Furst ML (1997) Fast planning through planning graph analysis. Artif Intell 90(1–2):281–300Boutilier C, Brafman R (2001) Partial-order planning with concurrent interacting actions. J Artif Intell Res 14(105):136Brafman R, Domshlak C (2008) From one to many: planning for loosely coupled multi-agent systems. In: Proceedings of the 18th international conference on automated planning and scheduling (ICAPS). pp 28–35Brenner M, Nebel B (2009) Continual planning and acting in dynamic multiagent environments. J Auton Agents Multiag Syst 19(3):297–331Coles A, Coles A, Fox M, Long D (2010) Forward-chaining partial-order planning. In: Proceedings of the 20th international conference on automated planning and scheduling (ICAPS). pp 42–49Coles A, Fox M, Long D, Smith A (2008) Teaching forward-chaining planning with JavaFF. In: Colloquium on AI education, 23rd AAAI conference on artificial intelligenceCox J, Durfee E, Bartold T (2005) A distributed framework for solving the multiagent plan coordination problem. In: Proceedings of the 4th international joint conference on autonomous agents and multiagent systems (AAMAS). ACM, pp 821–827de Weerdt M, Clement B (2009) Introduction to planning in multiagent systems. Multiag Grid Syst 5(4):345–355Decker K, Lesser VR (1992) Generalizing the partial global planning algorithm. Int J Coop Inf Syst 2(2):319–346desJardins M, Durfee E, Ortiz C, Wolverton M (1999) A survey of research in distributed continual planning. AI Mag 20(4):13–22Doshi P (2007) On the role of interactive epistemology in multiagent planning. In: Artificial intelligence and, pattern recognition. pp 208–213DrĂ©o J, SavĂ©ant P, Schoenauer M, Vidal V (2011) Divide-and-evolve: the marriage of descartes and darwin. In: Proceedings of the 7th international planning competition (IPC). Freiburg, GermanyDurfee EH (2001) Distributed problem solving and planning. In: Multi-agents systems and applications: selected tutorial papers from the 9th ECCAI advanced course (ACAI) and agentLink’s third European agent systems summer school (EASSS), vol LNAI 2086. Springer, pp 118–149Durfee EH, Lesser V (1991) Partial global planning: a coordination framework for distributed hypothesis formation. IEEE Trans Syst Man Cybern Special Issue Distrib Sens Netw 21(5):1167–1183Ephrati E, Rosenschein JS (1996) Deriving consensus in multiagent systems. Artif Intell 87(1–2):21–74Fikes R, Nilsson N (1971) STRIPS: a new approach to the application of theorem proving to problem solving. Artif Intell 2(3):189–208FoguĂ©s R, Alberola J, Such J, Espinosa A, Garcia-Fornes A (2010) Towards dynamic agent interaction support in open multiagent systems. In: Proceedings of the 2010 conference on artificial intelligence research and development: proceedings of the 13th international conference of the Catalan association for artificial intelligence’. IOS Press, pp 89–98Gerevini A, Long D (2006) Preferences and soft constraints in PDDL3. In: ICAPS workshop on planning with preferences and soft constraints, vol 6. Citeseer, pp 46–53Ghallab M, Howe A, Knoblock C, McDermott D, Ram A, Veloso M, Weld D, Wilkins D (1998) PDDL-the Planning Domain Definition Language. In: AIPS-98 planning committeeGmytrasiewicz P, Doshi P (2005) A framework for sequential planning in multi-agent settings. J Artif Intell Res 24:49–79Haslum P, Jonsson P (1999) Some results on the complexity of planning with incomplete information. In: Proceedings of the 5th European conference on, planning (ECP). pp 308–318Helmert M (2006) The fast downward planning system. J Artif Intell Res 26(1):191–246Hoffmann J, Nebel B (2001) The FF planning system: fast planning generation through heuristic search. J Artif Intell Res 14:253–302Jonsson A, Rovatsos M (2011) Scaling up multiagent planning: a best-response approach. In: Proceedings of the 21st international conference on automated planning and scheduling (ICAPS). AAAI, pp 114–121Kambhampati S (1997) Refinement planning as a unifying framework for plan synthesis. AI Mag 18(2):67–97Kaminka GA, Pynadath DV, Tambe M (2002) Monitoring teams by overhearing: a multi-agent plan-recognition approach. J Artif Intell Res 17:83–135Kone M, Shimazu A, Nakajima T (2000) The state of the art in agent communication languages. Knowl Inf Syst 2(3):259–284Kovacs DL (2011) Complete BNF description of PDDL3.1. Technical reportKraus S (1997) Beliefs, time and incomplete information in multiple encounter negotiations among autonomous agents. Ann Math Artif Intell 20(1–4):111–159Kumar A, Zilberstein S, Toussaint M (2011) Scalable multiagent planning using probabilistic inference. In: Proceedings of the 22nd international joint conference on artificial intelligence (IJCAI)’. Barcelona, Spain, pp 2140–2146Kvarnström J. (2011) Planning for loosely coupled agents using partial order forward-chaining. In: Proceedings of the 21st international conference on automated planning and scheduling (ICAPS). AAAI, pp 138–145Lesser V, Decker K, Wagner T, Carver N, Garvey A, Horling B, Neiman D, Podorozhny R, Prasad M, Raja A et al (2004) Evolution of the GPGP/TAEMS domain-independent coordination framework. Auton Agents Multi Agent Syst 9(1):87–143Lipovetzky N, Geffner H (2011) Searching for plans with carefully designed probes. In: Proceedings of the 21th international conference on automated planning and scheduling (ICAPS)Micacchi C, Cohen R (2008) A framework for simulating real-time multi-agent systems. Knowl Inf Syst 17(2):135–166Nguyen N, Katarzyniak R (2009) Actions and social interactions in multi-agent systems. Knowl Inf Syst 18(2):133–136Nguyen X, Kambhampati S (2001) Reviving partial order planning. In: Proceedings of the 17th international joint conference on artificial intelligence (IJCAI). Morgan Kaufmann, pp 459–464Nissim R, Brafman R, Domshlak C (2010) A general, fully distributed multi-agent planning algorithm. In: Proceedings of the 9th international conference on autonomous agents and multiagent systems (AAMAS). pp 1323–1330Pajares S, Onaindia E (2012) Defeasible argumentation for multi-agent planning in ambient intelligence applications. In: Proceedings of the 11th international conference on autonomous agents and multiagent systems (AAMAS) pp 509–516Paolucci M, Shehory O, Sycara K, Kalp D, Pannu A (2000) A planning component for RETSINA agents. Intelligent Agents VI. Agent Theories Architectures, and Languages pp 147–161Parsons S, Sierra C, Jennings N (1998) Agents that reason and negotiate by arguing. J Logic Comput 8(3):261Penberthy J, Weld D (1992) UCPOP: a sound, complete, partial order planner for ADL. In: Proceedings of the 3rd international conference on principles of knowledge representation and reasoning (KR). Morgan Kaufmann, pp 103–114Richter S, Westphal M (2010) The LAMA planner: guiding cost-based anytime planning with landmarks. J Artif Intell Res 39(1):127–177Sycara K, Pannu A (1998) The RETSINA multiagent system (video session): towards integrating planning, execution and information gathering. In: Proceedings of the 2nd international conference on autonomous agents (Agents). ACM, pp 350–351Tambe M (1997) Towards flexible teamwork. J Artif Intell Res 7:83–124Tang Y, Norman T, Parsons S (2010) A model for integrating dialogue and the execution of joint plans. Argumentation in multi-agent systems, pp 60–78Tonino H, Bos A, de Weerdt M, Witteveen C (2002) Plan coordination by revision in collective agent based systems. Artif Intell 142(2):121–145Van Der Krogt R, De Weerdt M (2005), Plan repair as an extension of planning. In: Proceedings of the 15th international conference on automated planning and scheduling (ICAPS). pp 161–170Weld D (1994) An introduction to least commitment planning. AI Mag 15(4):27Weld D (1999) Recent advances in AI planning. AI Mag 20(2):93–123Wilkins D, Myers K (1998) A multiagent planning architecture. In: Proceedings of the 4th international conference on artificial intelligence planning systems (AIPS), pp 154–162Wu F, Zilberstein S, Chen X (2011) Online planning for multi-agent systems with bounded communication. Artif Intell 175(2):487–511Younes H, Simmons R (2003) VHPOP: versatile heuristic partial order planner. J Artif Intell Res 20: 405–430Zhang J, Nguyen X, Kowalczyk R (2007) Graph-based multi-agent replanning algorithm. In: Proceedings of the 6th conference on autonomous agents and multiagent systems (AAMAS

    Hybrid optimization method with general switching strategy for parameter estimation

    Get PDF
    This article is available from: http://www.biomedcentral.com/1752-0509/2/26[Background] Modeling and simulation of cellular signaling and metabolic pathways as networks of biochemical reactions yields sets of non-linear ordinary differential equations. These models usually depend on several parameters and initial conditions. If these parameters are unknown, results from simulation studies can be misleading. Such a scenario can be avoided by fitting the model to experimental data before analyzing the system. This involves parameter estimation which is usually performed by minimizing a cost function which quantifies the difference between model predictions and measurements. Mathematically, this is formulated as a non-linear optimization problem which often results to be multi-modal (non-convex), rendering local optimization methods detrimental.[Results] In this work we propose a new hybrid global method, based on the combination of an evolutionary search strategy with a local multiple-shooting approach, which offers a reliable and efficient alternative for the solution of large scale parameter estimation problems.[Conclusion] The presented new hybrid strategy offers two main advantages over previous approaches: First, it is equipped with a switching strategy which allows the systematic determination of the transition from the local to global search. This avoids computationally expensive tests in advance. Second, using multiple-shooting as the local search procedure reduces the multi-modality of the non-linear optimization problem significantly. Because multiple-shooting avoids possible spurious solutions in the vicinity of the global optimum it often outperforms the frequently used initial value approach (single-shooting). Thereby, the use of multiple-shooting yields an enhanced robustness of the hybrid approach.This work was supported by the European Community as part of the FP6 COSBICS Project (STREP FP6-512060), the German Federal Ministry of Education and Research, BMBF-project FRISYS (grant 0313921) and Xunta de Galicia (PGIDIT05PXIC40201PM).Peer reviewe

    Cytochrome P450-mediated metabolism of N-(2-methoxyphenyl)-hydroxylamine, a human metabolite of the environmental pollutants and carcinogens o-anisidine and o-nitroanisole

    Get PDF
    N-(2-methoxyphenyl)hydroxylamine is a human metabolite of the industrial and environmental pollutants and bladder carcinogens 2-methoxyaniline (o-anisidine) and 2-methoxynitrobenzene (o-nitroanisole). Here, we investigated the ability of hepatic microsomes from rat and rabbit to metabolize this reactive compound. We found that N-(2-methoxyphenyl)hydroxylamine is metabolized by microsomes of both species mainly to o-aminophenol and a parent carcinogen, o-anisidine, whereas 2-methoxynitrosobenzene (o-nitrosoanisole) is formed as a minor metabolite. Another N-(2-methoxyphenyl)hydroxylamine metabolite, the exact structure of which has not been identified as yet, was generated by hepatic microsomes of rabbits, but its formation by those of rats was negligible. To evaluate the role of rat hepatic microsomal cytochromes P450 (CYP) in N-(2-methoxyphenyl)hydroxylamine metabolism, we investigated the modulation of its metabolism by specific inducers of these enzymes. The results of this study show that rat hepatic CYPs of a 1A subfamily and, to a lesser extent those of a 2B subfamily, catalyze N-(2-methoxyphenyl)hydroxylamine conversion to form both its reductive metabolite, o-anisidine, and o-aminophenol. CYP2E1 is the most efficient enzyme catalyzing conversion of N-(2-methoxyphenyl)hydroxylamine to o-aminophenol

    “Candidatus Competibacter”-lineage genomes retrieved from metagenomes reveal functional metabolic diversity

    Get PDF
    The glycogen-accumulating organism (GAO) ‘Candidatus Competibacter’ (Competibacter) uses aerobically stored glycogen to enable anaerobic carbon uptake, which is subsequently stored as polyhydroxyalkanoates (PHAs). This biphasic metabolism is key for the Competibacter to survive under the cyclic anaerobic-‘feast’: aerobic-‘famine’ regime of enhanced biological phosphorus removal (EBPR) wastewater treatment systems. As they do not contribute to phosphorus (P) removal, but compete for resources with the polyphosphate-accumulating organisms (PAO), thought responsible for P removal, their proliferation theoretically reduces the EBPR capacity. In this study, two complete genomes from Competibacter were obtained from laboratory-scale enrichment reactors through metagenomics. Phylogenetic analysis identified the two genomes, ‘Candidatus Competibacter denitrificans’ and ‘Candidatus Contendobacter odensis’, as being affiliated with Competibacter-lineage subgroups 1 and 5, respectively. Both have genes for glycogen and PHA cycling and for the metabolism of volatile fatty acids. Marked differences were found in their potential for the Embden–Meyerhof–Parnas and Entner–Doudoroff glycolytic pathways, as well as for denitrification, nitrogen fixation, fermentation, trehalose synthesis and utilisation of glucose and lactate. Genetic comparison of P metabolism pathways with sequenced PAOs revealed the absence of the Pit phosphate transporter in the Competibacter-lineage genomes—identifying a key metabolic difference with the PAO physiology. These genomes are the first from any GAO organism and provide new insights into the complex interaction and niche competition between PAOs and GAOs in EBPR systems

    Physiological Correlates of Volunteering

    Get PDF
    We review research on physiological correlates of volunteering, a neglected but promising research field. Some of these correlates seem to be causal factors influencing volunteering. Volunteers tend to have better physical health, both self-reported and expert-assessed, better mental health, and perform better on cognitive tasks. Research thus far has rarely examined neurological, neurochemical, hormonal, and genetic correlates of volunteering to any significant extent, especially controlling for other factors as potential confounds. Evolutionary theory and behavioral genetic research suggest the importance of such physiological factors in humans. Basically, many aspects of social relationships and social activities have effects on health (e.g., Newman and Roberts 2013; Uchino 2004), as the widely used biopsychosocial (BPS) model suggests (Institute of Medicine 2001). Studies of formal volunteering (FV), charitable giving, and altruistic behavior suggest that physiological characteristics are related to volunteering, including specific genes (such as oxytocin receptor [OXTR] genes, Arginine vasopressin receptor [AVPR] genes, dopamine D4 receptor [DRD4] genes, and 5-HTTLPR). We recommend that future research on physiological factors be extended to non-Western populations, focusing specifically on volunteering, and differentiating between different forms and types of volunteering and civic participation
    • 

    corecore