Search results for " protocol"
showing 10 items of 1320 documents
DSL Based Platform for Business Process Management
2014
Currently nearly all commercial and open source BPMS are based on BPMN as a process notation. In contrast, the paper proposes to build a BPMS based on a domain specific language (DSL) as a process notation – DSBPMS. In such a DSBPMS a specific business process support could be created by business analysts. A platform for creating such DSBPMS with feasible efforts is described. This platform contains a Configurator for easy creation of graphical editors for the chosen DSL and a simple mapping language for transforming processes in this DSL to a language directly executable by the execution engine of this platform. The engine includes also all typical execution support functions so no other t…
Metamodel specialization based DSL for DL lifecycle data management
2020
A new Domain Specific Language (DSL) based approach to Deep Learning (DL) lifecycle data management (LDM) is presented: a very simple but universal DL LDM tool, still usable in practice (called Core tool); and an advanced extension mechanism, that converts the Core tool into a DSL tool building framework for DL LDM tasks. The method used is based on the metamodel specialisation approach for DSL modeling tools introduced by authors.
Inhibitory avoidance learning in CD1 mice: Effects of chronic social defeat stress
2015
Chronic social defeat stress (CSDS) is an animal model widely used to determine the neurobiological mechanisms of stress and its associated pathologies. In this study, the effects of CSDS on inhibitory avoidance (IA) were evaluated in post-pubertal and adult male CD1 mice, instead of the C57BL/6J strain used in the CSDS standard protocol. CSDS consisted of daily 5-min (experiments 1 and 2) or 10-min (experiment 3) agonistic encounters on 21 consecutive days. Twenty four hours after the last session of CSDS, all the mice were tested for IA. They were also evaluated in an elevated plus-maze, obtaining complementary measures of locomotor activity and emotionality. In experiments 1 and 2, IA le…
The role of drug sequence in therapeutic selectivity of the combination of 5-fluorouracil and cis-platin.
1989
The therapeutic efficacy of 5-fluorouracil (FUra) and cis-dichlorodiamine-platinum (cis-DDP) in mice bearing transplantable leukemia and solid tumors was evaluated using different sequences of combination of these agents. The optimal sequence was cis-DDP administered 24 h after FUra. The administration of FUra at its maximally tolerated dose (MTD) followed 24 h later by low doses of cis-DDP yielded less toxicity and higher response rate against L1210 and colon 26 than the administration of these two agents in the opposite sequence or concurrently at the MTD. The sequence of administration of these two agents was not therapeutically important when the antitumor activity was evaluated against…
Cardiotoxicity mechanisms of the combination of BRAF-inhibitors and MEK-inhibitors.
2018
Many new drugs have appeared in last years in the oncological treatment scenario. Each drug carries an important set of adverse events, not less, cardiovascular adverse events. This aspect is even more important considering the increasing use of combination therapies with two drugs, or three drugs as in some ongoing clinical trials. Besides it represents a growing problem for Cardiologists, that face it in every day clinical practice and that will face it probably more and more in the coming years. This work reviews the mechanism of action of BRAF-inhibitors and MEK-inhibitors used together, the pathophysiological mechanisms that lead to cardiovascular toxicity. Particularly, it focuses on …
Quantized Dissensus in Networks of Agents subject to Death and Duplication
2012
Dissensus is a modeling framework for networks of dynamic agents in competition for scarce resources. Originally inspired by biological cells behaviors, it fits also marketing, finance and many other application areas. Competition is often unstable in the sense that strong agents, those having access to large resources, gain more and more resources at the expense of weak agents. Thus, strong agents duplicate when reaching a critical amount of resources, whereas weak agents die when loosing all their resources. To capture all these phenomena we introduce systems with a discrete time gossip and unstable state dynamics interrupted by discrete events affecting the network topology. Invariancy o…
A Novel Energy Model for MANETs based on Graphs with Activation Windows
2005
Energy usage optimization is still an important issue and a critical design factor for mobile ad hoc networks (MANETs). Only recently a few proposals appeared that consider energy-aware optimizations for routing protocols. In this paper we describe an analytical model for MANETs which is based on graphs with activation windows. The activation windows allow to model the on-off status of the network devices. Moreover, we propose an algorithm with pseudo-polynomial complexity, called STP algorithm (STPA), that based on the current position and state of the nodes determines the shortest time path between the source node and the destination node.
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 …
Stability Analysis of Routing Strategies for the Maximum Lifetime Problem in One-Dimensional Ad-Hoc Wireless Networks
2017
In the paper we discuss solutions of the maximum network lifetime problem in one-dimensional, regular ad-hoc wireless networks. For the problem, nodes of the network generate given amount of data and send it possibly via other nodes to the data collector. To extend the network lifetime the data should be transmitted in such a way, that the energy utilized by the most overloaded node is minimized. We assume, that the nodes use the point-to-point data transmission scheme and the cost of transmission of one unit of data is arbitrary superadditive function of a distance between transmitter and receiver. We show that for the one-dimensional network in which the nodes are evenly distributed on th…
A Branch-and-Cut method for the Capacitated Location-Routing Problem
2011
International audience; Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots. The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 …