234 research outputs found

    Multiagent cooperation for solving global optimization problems: an extendible framework with example cooperation strategies

    Get PDF
    This paper proposes the use of multiagent cooperation for solving global optimization problems through the introduction of a new multiagent environment, MANGO. The strength of the environment lays in itsflexible structure based on communicating software agents that attempt to solve a problem cooperatively. This structure allows the execution of a wide range of global optimization algorithms described as a set of interacting operations. At one extreme, MANGO welcomes an individual non-cooperating agent, which is basically the traditional way of solving a global optimization problem. At the other extreme, autonomous agents existing in the environment cooperate as they see fit during run time. We explain the development and communication tools provided in the environment as well as examples of agent realizations and cooperation scenarios. We also show how the multiagent structure is more effective than having a single nonlinear optimization algorithm with randomly selected initial points

    Temporal dynamics of Na/K pump mediated memory traces: insights from conductance-based models of Drosophila neurons

    Get PDF
    Sodium potassium ATPases (Na/K pumps) mediate long-lasting, dynamic cellular memories that can last tens of seconds. The mechanisms controlling the dynamics of this type of cellular memory are not well understood and can be counterintuitive. Here, we use computational modeling to examine how Na/K pumps and the ion concentration dynamics they influence shape cellular excitability. In a Drosophila larval motor neuron model, we incorporate a Na/K pump, a dynamic intracellular Na+ concentration, and a dynamic Na+ reversal potential. We probe neuronal excitability with a variety of stimuli, including step currents, ramp currents, and zap currents, then monitor the sub- and suprathreshold voltage responses on a range of time scales. We find that the interactions of a Na+-dependent pump current with a dynamic Na+ concentration and reversal potential endow the neuron with rich response properties that are absent when the role of the pump is reduced to the maintenance of constant ion concentration gradients. In particular, these dynamic pump-Na+ interactions contribute to spike rate adaptation and result in long-lasting excitability changes after spiking and even after sub-threshold voltage fluctuations on multiple time scales. We further show that modulation of pump properties can profoundly alter a neuron’s spontaneous activity and response to stimuli by providing a mechanism for bursting oscillations. Our work has implications for experimental studies and computational modeling of the role of Na/K pumps in neuronal activity, information processing in neural circuits, and the neural control of animal behavior

    Waterpipe (narghile) smoking among medical and non-medical university students in Turkey

    Get PDF
    Objectives. This investigation was performed in order to determine the prevalence rate of waterpipe smoking in students of Erciyes University and the effects of some socio-demographic factors

    FMAP: Distributed Cooperative Multi-Agent Planning

    Full text link
    This paper proposes FMAP (Forward Multi-Agent Planning), a fully-distributed multi-agent planning method that integrates planning and coordination. Although FMAP is specifically aimed at solving problems that require cooperation among agents, the flexibility of the domain-independent planning model allows FMAP to tackle multi-agent planning tasks of any type. In FMAP, agents jointly explore the plan space by building up refinement plans through a complete and flexible forward-chaining partial-order planner. The search is guided by h D T G , a novel heuristic function that is based on the concepts of Domain Transition Graph and frontier state and is optimized to evaluate plans in distributed environments. Agents in FMAP apply an advanced privacy model that allows them to adequately keep private information while communicating only the data of the refinement plans that is relevant to each of the participating agents. Experimental results show that FMAP is a general-purpose approach that efficiently solves tightly-coupled domains that have specialized agents and cooperative goals as well as loosely-coupled problems. Specifically, the empirical evaluation shows that FMAP outperforms current MAP systems at solving complex planning tasks that are adapted from the International Planning Competition benchmarks.This work has been partly supported by the Spanish MICINN under projects Consolider Ingenio 2010 CSD2007-00022 and TIN2011-27652-C03-01, the Valencian Prometeo project II/2013/019, and the FPI-UPV scholarship granted to the first author by the Universitat Politecnica de Valencia.Torreño Lerma, A.; Onaindia De La Rivaherrera, E.; Sapena Vercher, O. (2014). FMAP: Distributed Cooperative Multi-Agent Planning. Applied Intelligence. 41(2):606-626. https://doi.org/10.1007/s10489-014-0540-2S606626412Benton J, Coles A, Coles A (2012) Temporal planning with preferences and time-dependent continuous costs. In: Proceedings of the 22nd international conference on automated planning and scheduling (ICAPS). AAAI, pp 2–10Borrajo D. (2013) Multi-agent planning by plan reuse. In: Proceedings of the 12th international conference on autonomous agents and multi-agent systems (AAMAS). IFAAMAS, pp 1141–1142Boutilier 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). AAAI, pp 28–35Brenner M, Nebel B (2009) Continual planning and acting in dynamic multiagent environments. J Auton Agents Multiagent Syst 19(3):297–331Bresina J, Dearden R, Meuleau N, Ramakrishnan S, Smith D, Washington R (2002) Planning under continuous time and resource uncertainty: a challenge for AI. In: Proceedings of the 18th conference on uncertainty in artificial intelligence (UAI). Morgan Kaufmann, pp 77–84Cox J, Durfee E (2009) Efficient and distributable methods for solving the multiagent plan coordination problem. Multiagent Grid Syst 5(4):373–408Crosby M, Rovatsos M, Petrick R (2013) Automated agent decomposition for classical planning. In: Proceedings of the 23rd international conference on automated planning and scheduling (ICAPS). AAAI, pp 46–54Dimopoulos Y, Hashmi MA, Moraitis P (2012) μ-satplan: Multi-agent planning as satisfiability. Knowl-Based Syst 29:54–62Fikes R, Nilsson N (1971) STRIPS: a new approach to the application of theorem proving to problem solving. Artif Intell 2(3):189–208Gerevini A, Haslum P, Long D, Saetti A, Dimopoulos Y (2009) Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. Artif Intell 173(5-6):619–668Ghallab M, Nau D, Traverso P (2004) Automated planning. Theory and practice. Morgan KaufmannGünay A, Yolum P (2013) Constraint satisfaction as a tool for modeling and checking feasibility of multiagent commitments. Appl Intell 39(3):489–509Helmert M (2004) A planning heuristic based on causal graph analysis. In: Proceedings of the 14th international conference on automated planning and scheduling ICAPS. AAAI, pp 161–170Hoffmann J, Nebel B (2001) The FF planning system: fast planning generation through heuristic search. J Artif Intell Res 14:253–302Jannach D, Zanker M (2013) Modeling and solving distributed configuration problems: a CSP-based approach. IEEE Trans Knowl Data Eng 25(3):603–618Jonsson 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–121Kala R, Warwick K (2014) Dynamic distributed lanes: motion planning for multiple autonomous vehicles. Appl Intell:1–22Koehler J, Ottiger D (2002) An AI-based approach to destination control in elevators. AI Mag 23(3):59–78Kovacs DL (2011) Complete BNF description of PDDL3.1. Technical reportvan der Krogt R (2009) Quantifying privacy in multiagent planning. Multiagent Grid Syst 5(4):451–469Kvarnströ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–2):87–143Long D, Fox M (2003) The 3rd international planning competition: results and analysis. J Artif Intell Res 20:1–59Nissim 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). IFAAMAS, pp 1323–1330O’Brien P, Nicol R (1998) FIPA - towards a standard for software agents. BT Tech J 16(3):51–59Öztürk P, Rossland K, Gundersen O (2010) A multiagent framework for coordinated parallel problem solving. Appl Intell 33(2):132–143Pal A, Tiwari R, Shukla A (2013) Communication constraints multi-agent territory exploration task. Appl Intell 38(3):357–383Richter S, Westphal M (2010) The LAMA planner: guiding cost-based anytime planning with landmarks. J Artif Intell Res 39(1):127–177de la Rosa T, García-Olaya A, Borrajo D (2013) A case-based approach to heuristic planning. Appl Intell 39(1):184–201Sapena O, Onaindia E (2008) Planning in highly dynamic environments: an anytime approach for planning under time constraints. Appl Intell 29(1):90–109Sapena O, Onaindia E, Garrido A, Arangú M (2008) A distributed CSP approach for collaborative planning systems. Eng Appl Artif Intell 21(5):698–709Serrano E, Such J, Botía J, García-Fornes A (2013) Strategies for avoiding preference profiling in agent-based e-commerce environments. Appl Intell:1–16Smith D, Frank J, Jónsson A (2000) Bridging the gap between planning and scheduling. Knowl Eng Rev 15(1):47–83Such J, García-Fornes A, Espinosa A, Bellver J (2012) Magentix2: a privacy-enhancing agent platform. Eng Appl Artif Intell:96–109Tonino H, Bos A, de Weerdt M, Witteveen C (2002) Plan coordination by revision in collective agent based systems. Artif Intell 142(2):121–145Torreño A, Onaindia E, Sapena O (2012) An approach to multi-agent planning with incomplete information. In: Proceedings of the 20th European conference on artificial intelligence (ECAI), vol 242. IOS Press, pp 762–767Torreño A, Onaindia E, Sapena O (2014) A flexible coupling approach to multi-agent planning under incomplete information. Knowl Inf Syst 38(1):141–178Van 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). AAAI, pp 161–170de Weerdt M, Clement B (2009) Introduction to planning in multiagent systems. Multiagent Grid Syst 5(4):345– 355Yokoo M, Durfee E, Ishida T, Kuwabara K (1998) The distributed constraint satisfaction problem: formalization and algorithms. IEEE Trans Knowl Data Eng 10(5):673–685Zhang J, Nguyen X, Kowalczyk R (2007) Graph-based multi-agent replanning algorithm. In: Proceedings of the 6th international joint conference conference on autonomous agents and multiagent systems (AAMAS). IFAAMAS, pp 798–80

    Wind-driven ventilation improvement with plan typology alteration: a CFD case study of traditional Turkish architecture

    Get PDF
    Aligned with achieving the goal of net-zero buildings, the implementation of energy-saving techniques in minimizing energy demands is proving more vital than at any time. As practical and economic options, passive strategies in ventilation developed over thousands of years have shown great potential for the reduction of residential energy demands, which are often underestimated in modern building’s construction. In particular, as a cost-effective passive strategy, wind-driven ventilation via windows has huge potential in the enhancement of the indoor air quality (IAQ) of buildings while simultaneously reducing their cooling load. This study aims to investigate the functionality and applicability of a common historical Turkish architectural element called “Cumba” to improve the wind-driven ventilation in modern buildings. A case study building with an archetypal plan and parameters was defined as a result of a survey over 111 existing traditional samples across Turkey. Buildings with and without Cumba were compared in different scenarios by the development of a validated CFD microclimate model. The results of simulations clearly demonstrate that Cumba can enhance the room’s ventilation rate by more than two times while harvesting wind from different directions. It was also found that a flexible window opening strategy can help to increase the mean ventilation rate by 276%. Moreover, the room’s mean air velocity and ventilation rate could be adjusted to a broad range of values with the existence of Cumba. Thus, this study presents important findings about the importance of plan typology in the effectiveness of wind-driven ventilation strategies in modern dwellings

    Python as a Federation Tool for GENESIS 3.0

    Get PDF
    The GENESIS simulation platform was one of the first broad-scale modeling systems in computational biology to encourage modelers to develop and share model features and components. Supported by a large developer community, it participated in innovative simulator technologies such as benchmarking, parallelization, and declarative model specification and was the first neural simulator to define bindings for the Python scripting language. An important feature of the latest version of GENESIS is that it decomposes into self-contained software components complying with the Computational Biology Initiative federated software architecture. This architecture allows separate scripting bindings to be defined for different necessary components of the simulator, e.g., the mathematical solvers and graphical user interface. Python is a scripting language that provides rich sets of freely available open source libraries. With clean dynamic object-oriented designs, they produce highly readable code and are widely employed in specialized areas of software component integration. We employ a simplified wrapper and interface generator to examine an application programming interface and make it available to a given scripting language. This allows independent software components to be ‘glued’ together and connected to external libraries and applications from user-defined Python or Perl scripts. We illustrate our approach with three examples of Python scripting. (1) Generate and run a simple single-compartment model neuron connected to a stand-alone mathematical solver. (2) Interface a mathematical solver with GENESIS 3.0 to explore a neuron morphology from either an interactive command-line or graphical user interface. (3) Apply scripting bindings to connect the GENESIS 3.0 simulator to external graphical libraries and an open source three dimensional content creation suite that supports visualization of models based on electron microscopy and their conversion to computational models. Employed in this way, the stand-alone software components of the GENESIS 3.0 simulator provide a framework for progressive federated software development in computational neuroscience

    Co-circulation of West Nile virus and distinct insect-specific flaviviruses in Turkey

    Get PDF
    Background: Active vector surveillance provides an efficient tool for monitoring the presence or spread of emerging or re-emerging vector-borne viruses. This study was undertaken to investigate the circulation of flaviviruses. Mosquitoes were collected from 58 locations in 10 provinces across the Aegean, Thrace and Mediterranean Anatolian regions of Turkey in 2014 and 2015. Following morphological identification, mosquitoes were pooled and screened by nested and real-time PCR assays. Detected viruses were further characterised by sequencing. Positive pools were inoculated onto cell lines for virus isolation. Next generation sequencing was employed for genomic characterisation of the isolates. Results: A total of 12,711 mosquito specimens representing 15 species were screened in 594 pools. Eleven pools (2%) were reactive in the virus screening assays. Sequencing revealed West Nile virus (WNV) in one Culex pipiens (s.l.) pool from Thrace. WNV sequence corresponded to lineage one clade 1a but clustered distinctly from the Turkish prototype isolate. In 10 pools, insect-specific flaviviruses were characterised as Culex theileri flavivirus in 5 pools of Culex theileri and one pool of Cx. pipiens (s.l.), Ochlerotatus caspius flavivirus in two pools of Aedes (Ochlerotatus) caspius, Flavivirus AV-2011 in one pool of Culiseta annulata, and an undetermined flavivirus in one pool of Uranotaenia unguiculata from the Aegean and Thrace regions. DNA forms or integration of the detected insect-specific flaviviruses were not observed. A virus strain, tentatively named as “Ochlerotatus caspius flavivirus Turkey”, was isolated from an Ae. caspius pool in C6/36 cells. The viral genome comprised 10,370 nucleotides with a putative polyprotein of 3,385 amino acids that follows the canonical flavivirus polyprotein organisation. Sequence comparisons and phylogenetic analyses revealed the close relationship of this strain with Ochlerotatus caspius flavivirus from Portugal and Hanko virus from Finland. Several conserved structural and amino acid motifs were identified. Conclusions: We identified WNV and several distinct insect-specific flaviviruses during an extensive biosurveillance study of mosquitoes in various regions of Turkey in 2014 and 2015. Ongoing circulation of WNV is revealed, with an unprecedented genetic diversity. A probable replicating form of an insect flavivirus identified only in DNA form was detected

    Hydrophobically Modified Sulfobetaine Copolymers with Tunable Aqueous UCST through Postpolymerization Modification of Poly(pentafluorophenyl acrylate)

    Get PDF
    Polysulfobetaines, polymers carrying highly polar zwitterionic side chains, present a promising research field by virtue of their antifouling properties, hemocompatibility, and stimulus-responsive behavior. However, limited synthetic approaches exist to produce sulfobetaine copolymers comprising hydrophobic components. Postpolymerization modification of an activated ester precursor, poly(pentafluorophenyl acrylate), employing a zwitterionic amine, 3-((3-aminopropyl)dimethylammonio)propane-1-sulfonate, ADPS, is presented as a novel, one-step synthetic concept toward sulfobetaine (co)polymers. Modifications were performed in homogeneous solution using propylene carbonate as solvent with mixtures of ADPS and pentylamine, benzylamine, and dodecylamine producing a series of well-defined statistical acrylamido sulfobetaine copolymers containing hydrophobic pentyl, benzyl, or dodecylacrylamide comonomers with well-controllable molar composition as evidenced by NMR and FT-IR spectroscopy and size exclusion chromatography.This synthetic strategy was exploited to investigate, for the first time, the influence of hydrophobic modification on the upper critical solution temperature (UCST) of sulfobetaine copolymers in aqueous solution. Surprisingly, incorporation of pentyl groups was found to increase solubility over a wide composition range, whereas benzyl groups decreased solubility—an effect attributed to different entropic and enthalpic contributions of both functional groups. While UCST transitions of polysulfobetaines are typically limited to higher molar mass samples, incorporation of 0–65 mol % of benzyl groups into copolymers with molar masses of 25.5–34.5 kg/mol enabled sharp, reversible transitions from 6 to 82 °C in solutions containing up to 76 mM NaCl, as observed by optical transmittance and dynamic light scattering. Both synthesis and systematic UCST increase of sulfobetaine copolymers presented here are expected to expand the scope and applicability of these smart materials
    corecore