2,132 research outputs found

    In vivo assessment of a novel biodegradable ureteral stent

    Get PDF
    Purpose: To perform an in vivo assessment of a newly developed biodegradable ureteral stent (BUS) produced with natural-based polymers. Methods: The BUS is based on a patented technology combining the injection process with the use of supercritical fluid technology. The study was conducted at ICVS-University of Minho (Braga, Portugal) and a total of ten domestic pigs were used. In seven animals, the experimental BUS stent was inserted, whereas in the remaining a commercially available stent was used (6-Fr Biosoft(®) duo stents, Porges Coloplast, Denmark). Post-stenting intravenous pyelogram was used to evaluate the degree of hydronephrosis. The in vivo stent degradation was measured as a function of the weight loss. Moreover, the tensile properties of the BUS were tested during in vivo degradation. After maximum 10 days, animals were killed and necropsy was performed. Tissues were compared between the stented groups as well as between the non-stented contralateral ureters and stented ureters in each group. Biocompatibility was assessed by histopathological grading. Results: In all cases, the BUS was only visible during the first 24 h on X-ray, and in all cases, the BUS was completely degraded in urine after 10 days, as confirmed on necropsy. During the degradation process, the mechanical properties of the BUS decreased, while the commercial ureteral stents remained constant. At all time-points after stent insertion, the level of hydronephrosis was minimal. Overall, animals stented with BUS had an average grade of hydronephrosis which was lower compared to the controls. The BUS showed better pathological conditions, and hence better biocompatibility when compared with commercial stents. Conclusions: Notwithstanding the limitations of the present study, the in vivo testing of our novel natural origin polymer-based BUS suggests this device to feature homogeneous degradation, good urine drainage, and high biocompatibility. Next steps will be to increase its stability and to improve the radiopacity without compromising its degradation. Ultimately, clinical studies will be required to determine the safety and feasibility of its use in humans.FCT -Fuel Cell Technologies Program(POCI-01-0145-FEDER-007038)info:eu-repo/semantics/publishedVersio

    A Better-response Strategy for Self-interested Planning Agents

    Full text link
    [EN] When self-interested agents plan individually, interactions that prevent them from executing their actions as planned may arise. In these coordination problems, game-theoretic planning can be used to enhance the agents¿ strategic behavior considering the interactions as part of the agents¿ utility. In this work, we define a general-sum game in which interactions such as conflicts and congestions are reflected in the agents¿ utility. We propose a better-response planning strategy that guarantees convergence to an equilibrium joint plan by imposing a tax to agents involved in conflicts. We apply our approach to a real-world problem in which agents are Electric Autonomous Vehicles (EAVs). The EAVs intend to find a joint plan that ensures their individual goals are achievable in a transportation scenario where congestion and conflicting situations may arise. Although the task is computationally hard, as we theoretically prove, the experimental results show that our approach outperforms similar approaches in both performance and solution quality.This work is supported by the GLASS project TIN2014-55637-C2-2-R of the Spanish MINECO and the Prometeo project II/2013/019 funded by the Valencian Government.Jordán, J.; Torreño Lerma, A.; De Weerdt, M.; Onaindia De La Rivaherrera, E. (2018). A Better-response Strategy for Self-interested Planning Agents. Applied Intelligence. 48(4):1020-1040. https://doi.org/10.1007/s10489-017-1046-5S10201040484Aghighi M, Bäckström C (2016) A multi-parameter complexity analysis of cost-optimal and net-benefit planning. In: Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. AAAI Press, London, pp 2–10Bercher P, Mattmüller R (2008) A planning graph heuristic for forward-chaining adversarial planning. In: ECAI, vol 8, pp 921–922Brafman RI, Domshlak C, Engel Y, Tennenholtz M (2009) Planning games. In: IJCAI 2009, Proceedings of the 21st international joint conference on artificial intelligence, pp 73–78Bylander T (1994) The computational complexity of propositional strips planning. Artif Intell 69(1):165–204Chen X, Deng X (2006) Settling the complexity of two-player nash equilibrium. In: 47th annual IEEE symposium on foundations of computer science, 2006. FOCS’06. IEEE, pp 261–272Chien S, Sinclair A (2011) Convergence to approximate nash equilibria in congestion games. Games and Economic Behavior 71(2):315–327de Cote EM, Chapman A, Sykulski AM, Jennings N (2010) Automated planning in repeated adversarial games. In: 26th conference on uncertainty in artificial intelligence (UAI 2010), pp 376–383Dunne PE, Kraus S, Manisterski E, Wooldridge M (2010) Solving coalitional resource games. Artif Intell 174(1):20–50Fabrikant A, Papadimitriou C, Talwar K (2004) The complexity of pure nash equilibria. In: Proceedings of the thirty-sixth annual ACM symposium on theory of computing, STOC ’04, pp 604–612Friedman JW, Mezzetti C (2001) Learning in games by random sampling. J Econ Theory 98(1):55–84Ghallab M, Nau D, Traverso P (2004) Automated planning: theory & practice. ElsevierGoemans M, Mirrokni V, Vetta A (2005) Sink equilibria and convergence. In: Proceedings of the 46th annual IEEE symposium on foundations of computer science, FOCS ’05, pp 142–154Hadad M, Kraus S, Hartman IBA, Rosenfeld A (2013) Group planning with time constraints. Ann Math Artif Intell 69(3):243–291Hart S, Mansour Y (2010) How long to equilibrium? the communication complexity of uncoupled equilibrium procedures. Games and Economic Behavior 69(1):107–126Helmert M (2003) Complexity results for standard benchmark domains in planning. Artif Intell 143(2):219–262Helmert M (2006) The fast downward planning system. J Artif Intell Res 26(1):191–246Jennings N, Faratin P, Lomuscio A, Parsons S, Wooldrige M, Sierra C (2001) Automated negotiation: prospects, methods and challenges. Group Decis Negot 10(2):199–215Johnson DS, Papadimtriou CH, Yannakakis M (1988) How easy is local search? J Comput Syst Sci 37 (1):79–100Jonsson A, Rovatsos M (2011) Scaling up multiagent planning: a best-response approach. In: Proceedings of the 21st international conference on automated planning and scheduling, ICAPSJordán J, Onaindía E (2015) Game-theoretic approach for non-cooperative planning. In: 29th AAAI conference on artificial intelligence (AAAI-15), pp 1357–1363McDermott D, Ghallab M, Howe A, Knoblock C, Ram A, Veloso M, Weld D, Wilkins D (1998) PDDL: the planning domain definition language. Yale Center for Computational Vision and Control, New HavenMilchtaich I (1996) Congestion games with player-specific payoff functions. Games and Economic Behavior 13(1):111–124Monderer D, Shapley LS (1996) Potential games. Games and Economic Behavior 14(1):124–143Nigro N, Welch D, Peace J (2015) Strategic planning to implement publicly available ev charching stations: a guide for business and policy makers. Tech rep, Center for Climate and Energy SolutionsNisan N, Ronen A (2007) Computationally feasible vcg mechanisms. J Artif Intell Res 29(1):19–47Nisan N, Roughgarden T, Tardos E, Vazirani VV (2007) Algorithmic game theory. Cambridge University Press, New YorkPapadimitriou CH (1994) On the complexity of the parity argument and other inefficient proofs of existence. J Comput Syst Sci 48(3):498–532Richter S, Westphal M (2010) The LAMA planner: guiding cost-based anytime planning with landmarks. J Artif Intell Res 39(1):127–177Rosenthal RW (1973) A class of games possessing pure-strategy nash equilibria. Int J Game Theory 2(1):65–67Shoham Y, Leyton-Brown K (2009) Multiagent systems: algorithmic, game-theoretic, and logical foundations. Cambridge University PressTorreño A, Onaindia E, Sapena Ó (2014) A flexible coupling approach to multi-agent planning under incomplete information. Knowl Inf Syst 38(1):141–178Torreño A, Onaindia E, Sapena Ó (2014) FMAP: distributed cooperative multi-agent planning. Appl Intell 41(2):606– 626Torreño A, Sapena Ó, Onaindia E (2015) Global heuristics for distributed cooperative multi-agent planning. In: ICAPS 2015. 25th international conference on automated planning and scheduling. AAAI Press, pp 225–233Von Neumann J, Morgenstern O (2007) Theory of games and economic behavior. Princeton University Pressde Weerdt M, Bos A, Tonino H, Witteveen C (2003) A resource logic for multi-agent plan merging. Ann Math Artif Intell 37(1):93–130Wooldridge M, Endriss U, Kraus S, Lang J (2013) Incentive engineering for boolean games. Artif Intell 195:418–43

    Synaptic and Intrinsic Activation of GABAergic Neurons in the Cardiorespiratory Brainstem Network

    Get PDF
    GABAergic pathways in the brainstem play an essential role in respiratory rhythmogenesis and interactions between the respiratory and cardiovascular neuronal control networks. However, little is known about the identity and function of these GABAergic inhibitory neurons and what determines their activity. In this study we have identified a population of GABAergic neurons in the ventrolateral medulla that receive increased excitatory post-synaptic potentials during inspiration, but also have spontaneous firing in the absence of synaptic input. Using transgenic mice that express GFP under the control of the Gad1 (GAD67) gene promoter, we determined that this population of GABAergic neurons is in close apposition to cardioinhibitory parasympathetic cardiac neurons in the nucleus ambiguus (NA). These neurons fire in synchronization with inspiratory activity. Although they receive excitatory glutamatergic synaptic inputs during inspiration, this excitatory neurotransmission was not altered by blocking nicotinic receptors, and many of these GABAergic neurons continue to fire after synaptic blockade. The spontaneous firing in these GABAergic neurons was not altered by the voltage-gated calcium channel blocker cadmium chloride that blocks both neurotransmission to these neurons and voltage-gated Ca2+ currents, but spontaneous firing was diminished by riluzole, demonstrating a role of persistent sodium channels in the spontaneous firing in these cardiorespiratory GABAergic neurons that possess a pacemaker phenotype. The spontaneously firing GABAergic neurons identified in this study that increase their activity during inspiration would support respiratory rhythm generation if they acted primarily to inhibit post-inspiratory neurons and thereby release inspiration neurons to increase their activity. This population of inspiratory-modulated GABAergic neurons could also play a role in inhibiting neurons that are most active during expiration and provide a framework for respiratory sinus arrhythmia as there is an increase in heart rate during inspiration that occurs via inhibition of premotor parasympathetic cardioinhibitory neurons in the NA during inspiration

    Credible Autocoding of Convex Optimization Algorithms

    Get PDF
    International audienceThe efficiency of modern optimization methods, coupled with increasing computational resources, has led to the possibility of real-time optimization algorithms acting in safety critical roles. There is a considerable body of mathematical proofs on on-line optimization programs which can be leveraged to assist in the development and verification of their implementation. In this paper, we demonstrate how theoretical proofs of real-time optimization algorithms can be used to describe functional properties at the level of the code, thereby making it accessible for the formal methods community. The running example used in this paper is a generic semi-definite programming (SDP) solver. Semi-definite programs can encode a wide variety of optimization problems and can be solved in polynomial time at a given accuracy. We describe a top-to-down approach that transforms a high-level analysis of the algorithm into useful code annotations. We formulate some general remarks about how such a task can be incorporated into a convex programming autocoder. We then take a first step towards the automatic verification of the optimization program by identifying key issues to be adressed in future work

    Lattice Boltzmann simulations of soft matter systems

    Full text link
    This article concerns numerical simulations of the dynamics of particles immersed in a continuum solvent. As prototypical systems, we consider colloidal dispersions of spherical particles and solutions of uncharged polymers. After a brief explanation of the concept of hydrodynamic interactions, we give a general overview over the various simulation methods that have been developed to cope with the resulting computational problems. We then focus on the approach we have developed, which couples a system of particles to a lattice Boltzmann model representing the solvent degrees of freedom. The standard D3Q19 lattice Boltzmann model is derived and explained in depth, followed by a detailed discussion of complementary methods for the coupling of solvent and solute. Colloidal dispersions are best described in terms of extended particles with appropriate boundary conditions at the surfaces, while particles with internal degrees of freedom are easier to simulate as an arrangement of mass points with frictional coupling to the solvent. In both cases, particular care has been taken to simulate thermal fluctuations in a consistent way. The usefulness of this methodology is illustrated by studies from our own research, where the dynamics of colloidal and polymeric systems has been investigated in both equilibrium and nonequilibrium situations.Comment: Review article, submitted to Advances in Polymer Science. 16 figures, 76 page

    The Periotest Method: Implant-Supported Framework Precision of Fit Evaluation

    Full text link
    : In this study, the Periotest instrument was used to measure the precision of fit between cast high noble-metal frameworks and the supporting implants in a patient-simulation model. Three framework conditions and three implant-location variables were used to evaluate the rigidity of the assembly as measured by the Periotest method. The framework variables were (1) one-piece castings (OPC); (2) sectioned-soldered inaccurate castings (SSIC); and (3) sectioned-soldered accurate castings (SSAC). The implant-location variables were right anterior (RA), center (C), and left anterior (LA). Materials and Methods : The patient simulation model used consisted of three self-tapping BrÃ…nemark implants in a reasonable arch curvature in bovine bone. Three working casts were fabricated from the patient-simulation model using polyvinyl siloxane and tapered impression copings. From the working casts, three sets of three frameworks were fabricated as OPCs, SSICs, and SSACs using type 3 high noble alloy. The SSICs were fabricated with a quantitative misfit of 101.6 Îœm at the facial surface, between the abutment-to-gold cylinder interface at the C implant location. Periotest value (PTV) measurements were made at the midfacial surface of the frameworks directly above each abutment-to-gold cylinder interface. Three measurements were made for each test condition. The data were analyzed to compare framework condition(s) and implant location(s) using ANOVA and Fisher's Protected Least Significant Difference Comparison Test. Results : The ANOVA showed that significant differences exist between the mean PTV data for framework condition and for implant location (p < .01). Significant differences were shown between the mean PTV data for the SSAC assemblies and the OPC and SSIC assemblies. The SSICs displayed a more positive (+) mean PTV than the OPCs. The OPC assemblies had a more positive mean PTV than the SSAC assemblies. The mean PTV data for the SSAC assemblies had a significantly different PTV (p < .01) than the other two framework condition assemblies. The OPC and the SSIC assemblies had PTVs that were not significantly different. The C implant location was significantly different from the RA and the LA implant locations (p < .01). The RA and the LA implant locations were not significantly different from each other. The C implant location always demonstrated the most positive mean PTV regardless of the framework condition being tested. Conclusions : The Periotest instrument quantified differences in the precision of fit between three framework conditions. The SSAC assemblies were significantly more rigid than the OPC and SSIC assemblies. The OPC and SSIC assemblies' mean PTVs were not significantly different. The mean PTVs for the C implant location and the RA and LA implant locations were significantly different (p < .01). The mean PTVs of the RA and LA implant locations were not significantly different. The implant-location PTVs followed the same rank order for all three framework conditions. The procedures used to fabricate a more precise fit between the framework and the supporting implants is influenced by the skill of the clinician and technician.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/75096/1/j.1532-849X.1996.tb00298.x.pd

    Paraoxonase 1 (PON1) Polymorphisms, Haplotypes and Activity in Predicting CAD Risk in North-West Indian Punjabis

    Get PDF
    Human serum paraoxonase-1 (PON1) prevents oxidation of low density lipoprotein cholesterol (LDL-C) and hydrolyzes the oxidized form, therefore preventing the development of atherosclerosis. The polymorphisms of PON1 gene are known to affect the PON1 activity and thereby coronary artery disease (CAD) risk. As studies are lacking in North-West Indian Punjabi's, a distinct ethnic group with high incidence of CAD, we determined PON1 activity, genotypes and haplotypes in this population and correlated them with the risk of CAD.350 angiographically proven (≥ 70% stenosis) CAD patients and 300 healthy controls were investigated. PON1 activity was determined towards paraoxon (Paraoxonase; PONase) and phenylacetate (Arylesterase; AREase) substrates. In addition, genotyping was carried out by using multiplex PCR, allele specific oligonucleotide -PCR and PCR-RFLP methods and haplotyping was determined by PHASE software. The serum PONase and AREase activities were significantly lower in CAD patients as compared to the controls. All studied polymorphisms except L55M had significant effect on PONase activity. However AREase activity was not affected by them. In a logistic regression model, after adjustment for the conventional risk factors for CAD, QR (OR: 2.73 (1.57-4.72)) and RR (OR, 16.24 (6.41-41.14)) genotypes of Q192R polymorphism and GG (OR: 2.07 (1.02-4.21)) genotype of -162A/G polymorphism had significantly higher CAD risk. Haplotypes L-T-G-Q-C (OR: 3.25 (1.72-6.16)) and L-T-G-R-G (OR: 2.82 (1.01-7.80)) were also significantly associated with CAD.In conclusion this study shows that CAD patients had lower PONase and AREase activities as compared to the controls. The coding Q192R polymorphism, promoter -162A/G polymorphism and L-T-G-Q-C and L-T-G-R-G haplotypes are all independently associated with CAD
    • …
    corecore