Search results for "Networks"
showing 10 items of 3260 documents
Programming languages for data-Intensive HPC applications: A systematic mapping study
2020
This work is a result of activities from COST Action 10406 High -Performance Modelling and Simulation for Big Data Applications (cHiPSet), funded by the European Cooperation in Science and Technology. FCT, Portugal for grants: NOVA LINCS Research Laboratory Ref. UID/ CEC/ 04516/ 2019); INESC-ID Ref. UID/CEC/50021/2019; BioISI Ref. UID/MULTI/04046/2103; LASIGE Research Unit Ref. UID/CEC/00408/ 2019. A major challenge in modelling and simulation is the need to combine expertise in both software technologies and a given scientific domain. When High-Performance Computing (HPC) is required to solve a scientific problem, software development becomes a problematic issue. Considering the complexity…
The red tooth hypothesis: A computational model of predator-prey relations, protean escape behavior and sexual reproduction
2009
This paper presents an extension of the Red Queen Hypothesis (hereafter, RQH) that we call the Red Tooth Hypothesis (RTH). This hypothesis suggests that predator-prey relations may play a role in the maintenance of sexual reproduction in many higher animals. RTH is based on an interaction between learning on the part of predators and evolution on the part of prey. We present a simple predator-prey computer simulation that illustrates the effects of this interaction. This simulation suggests that the optimal escape strategy from the prey's standpoint would be to have a small number of highly reflexive, largely innate (and, therefore, very fast) escape patterns, but that would also be unlearn…
Computer simulations for bioequivalence trials: selection of analyte in BCS drugs with first-pass metabolism and two metabolic pathways.
2010
The objective of this work is to use a computer simulation approach to define the most sensitive analyte for in vivo bioequivalence studies of all types of Biopharmaceutics Classification System (BCS) drugs undergoing first-pass hepatic metabolism with two metabolic pathways. A semi-physiological model was developed in NONMEM VI to simulate bioequivalence trials. Four BCS classes (from Class I to IV) of drugs, with three possible saturation scenarios (non-saturation, saturation and saturation of only the major route of metabolism), two (high or low) dose schemes, and six types of pharmaceutical quality for the drug products were simulated. The number of investigated scenarios was 144 (4 × 3…
Hepatocytes--the choice to investigate drug metabolism and toxicity in man: in vitro variability as a reflection of in vivo.
2007
The pharmaceutical industry is committed to marketing safer drugs with fewer side effects, predictable pharmacokinetic properties and quantifiable drug-drug interactions. Drug metabolism is a major determinant of drug clearance and interindividual pharmacokinetic differences, and an indirect determinant of the clinical efficacy and toxicity of drugs. Progressive advances in the knowledge of metabolic routes and enzymes responsible for drug biotransformation have contributed to understanding the great metabolic variations existing in human beings. Phenotypic as well genotypic differences in the expression of the enzymes involved in drug metabolism are the main causes of this variability. How…
A novel methodology for accelerating bitstream relocation in partially reconfigurable systems
2012
International audience; Xilinx Virtex FPGAs offer the possibility of Partial Reconfiguration (PR). Arbitrary tasks can be allocated and de-allocated onto FPGA without system interruption. However, mapping a task to any available PR region requires a unique partial bitstream for each partition, hence reducing memory storage requirements. In recent years, an interest on overcoming this problem has lead to the concept of Partial Bitstream Relocation (PBR). The principle is to perform bitstream modification to map it to different regions. However, PBR consumes scarce resources in hardware implementations, and introduces a prohibitive time overhead when done in software. In order to find the bes…
Lifespan-Aware Routing for Wireless Sensor Networks
2010
Wireless Sensor Networks (WSNs) have the capability to become the eyes and ears for the future networked society allowing monitoring of any habitat or object's properties remotely and independently of an energy source. Services based on this technology may change the way we monitor and control remote areas and objects. In this paper we propose a different approach to routing data across Wireless Sensor Networks. We argue that a distance-vector protocol using a lifespan-aware metric is a plausible solution to the task of routing information in WSN in a manner that both saves energy of the individual node and manages summarized energy of the system equally and fairly. The concept is designed …
TBRA: A scalable routing algorithm in highly mobile large scale pure ad hoc wireless mesh networks
2009
In highly mobile pure ad-hoc wireless mesh networks, fast rerouting within low routing discovery delay is a mandatory requirement for routing algorithm to support interactive applications such as VoIP. Also, the communication overhead should be thwarted when networks grow to a large scale. We propose a Tree-Based Routing Algorithm - TBRA to facilitate such two goals. On one hand, TBRA has very low routing discovery delay due to its proactive property. On the other hand, TBRA performs more efficiently than other proactive protocols with respect to low communication overhead, which thanks to its short routing packet length, less numbers and smaller routing table size. Our modeling analysis an…
A flexible and tunable route discovery mechanism for on-demand protocols
2004
Mobile ad-hoc networks are characterized by multihop wireless links and absence of cellular infrastructure. For the last years, routing has been the area under most intensive research. In particular, on-demand routing protocols proposed are extremely attractive due to their low-overhead and efficiency. Currently, wireless ad-hoc networks lack multipath routing protocols. Multipath routing enables increased QoS support, load balancing and enhanced route stability. In this paper we present a new route discovery solution that increases the number of routes found, while reducing the routing overhead when compared to previous proposals. Simulation results show that the additional routing overhea…
GAIML: A New Language for Verbal and Graphical Interaction in Chatbots
2008
Natural and intuitive interaction between users and complex systems is a crucial research topic in human-computer interaction. A major direction is the definition and implementation of systems with natural language understanding capabilities. The interaction in natural language is often performed by means of systems called chatbots. A chatbot is a conversational agent with a proper knowledge base able to interact with users. Chatbots appearance can be very sophisticated with 3D avatars and speech processing modules. However the interaction between the system and the user is only performed through textual areas for inputs and replies. An interaction able to add to natural language also graph…
Inferring slowly-changing dynamic gene-regulatory networks
2015
Dynamic gene-regulatory networks are complex since the interaction patterns between their components mean that it is impossible to study parts of the network in separation. This holistic character of gene-regulatory networks poses a real challenge to any type of modelling. Graphical models are a class of models that connect the network with a conditional independence relationships between random variables. By interpreting these random variables as gene activities and the conditional independence relationships as functional non-relatedness, graphical models have been used to describe gene-regulatory networks. Whereas the literature has been focused on static networks, most time-course experi…