JigCell Model Connector: building large molecular network models from components

Size: px
Start display at page:

Download "JigCell Model Connector: building large molecular network models from components"

Transcription

1 Simulation Applications JigCell Moel Connector: builing large molecular network moels from components Simulation: Transactions of the Society for Moeling an Simulation International 2018, Vol. 94(11) Ó The Author(s) 2018 DOI: / journals.sagepub.com/home/sim Thomas C Jones Jr 1, Stefan Hoops 3, Layne T Watson 1, Alia Palmisano 1,2, John J Tyson 2 an Cliffor A Shaffer 1 Abstract The growing size an complexity of molecular network moels makes them increasingly ifficult to construct an unerstan. Moifying a moel that consists of tens of reactions is no easy task. Attempting the same on a moel containing hunres of reactions can seem nearly impossible. We present the JigCell Moel Connector, a software tool that supports large-scale molecular network moeling. Our approach to eveloping large moels is to combine smaller moels, making the result easier to comprehen. At the base, the smaller moels (calle moules) are efine by small collections of reactions. Moules connect together to form larger moules through clearly efine interfaces, calle ports. In this work, we enhance the port concept by efining three types of ports. An output port is linke to an internal component that will sen a value. An input port is linke to an internal component that will receive a value. An equivalence port is linke to an internal component that will both receive an sen values. Not all moules connect together in the same way; therefore, multiple connection options nee to exist. Keywors computational systems biology, hierarchical moel composition, JigCell, moeling tool, SBML, software 1. Introuction The functions of a living cell are controlle by macromolecular interactions. These complex interactions between genes an proteins can be mappe as regulatory networks. In an effort to unerstan the ynamic properties of these networks, mathematical moels of the biochemical reactions are often constructe. 1 3 During this process, moelers have the ifficult task of specifying reaction etails between species connecte in these complex regulatory networks. Moeling a system accurately is an iterative process involving frequent changes to the unerlying network. 4 Once a moel is rafte, the equations can be analyze an simulate to escribe the ynamical behavior of the regulatory network. 2 These computational results can then be compare to existing experimental ata, an if inconsistencies arise, the moel can be moifie. Once a moel has been teste against existing experimental ata, it can be use to make preictions that might guie the irection of future experiments. 5 If further experiments uncover inconsistencies, then the moel can be moifie again. As molecular biologists iscover more information about how gene an protein interactions affect cell physiology, the size an complexity of the mathematical moels ten to grow. Constructing these moels is becoming more ifficult. Historically, moelers have been limite in the scope of the behavior being moele by the complexity of larger moels. For these reasons, moelers have a nee to eal with increasingly complex moels, which require new moeling approaches. Hierarchical moel composition is a moeling technique where, instea of builing one large, complex moel, smaller moels are combine together to form a larger moel. By breaking a complex system into smaller parts, with clearly efine interactions between the parts, it can be more easily unerstoo. In this paper we present the JigCell Moel Connector (JCMC), a software tool to support hierarchical moel 1 Department of Computer Science, Virginia Tech, Blacksburg, VA, USA 2 Department of Biological Sciences, Virginia Tech, Blacksburg, VA, USA 3 Biocomplexity Institute, Virginia Tech, Blacksburg, VA, USA Corresponing author: Cliffor A Shaffer, Department of Computer Science, Virginia Tech, Blacksburg, VA 24061, USA. shaffer@cs.vt.eu.

2 994 Simulation: Transactions of the Society for Moeling an Simulation International 94(11) composition. In our tool, the smallest moels (calle moules) are efine by small collections of reactions. Moules connect together to form larger moules through clearly efine interfaces, calle ports. Moelers are able to regulate external access to internal components of a moule by utilizing ports. We implement three port types that allow moules to connect in ifferent ways. An output port is linke to an internal component that will sen a value to an external reference. An input port is linke to an internal component that will receive a value from an external reference. An equivalence port is linke to an internal component that will both receive an sen values from an external reference. Once a moel is create in the JCMC, it can be exporte to one of the existing stanar moel formats, at which point the moel can be simulate an analyze using other tools. Our goal is to evelop large moels in a moular way, making the result easier to comprehen. A major contribution of this paper over prior efforts to efine systems for builing moels in a moular fashion are new port an noe constructs that allow moules to connect in ifferent ways using the JCMC. The remainer of this paper is organize as follows. First, previous work on hierarchical moel composition stanars an tools is reviewe. Next, we present the JCMC environment an its components. Then the ifferent types of ports an their impact on a moel are iscusse. Last, best practices for constructing hierarchical moels, conclusions, an future work are presente in the form of a case stuy. 2. Backgroun In this section, we iscuss the basic concepts of hierarchical moeling, an a stanar format that enables the sharing of moels. We also review previous attempts to create hierarchical moeling tools Hierarchical moel composition Ranhawa an colleagues 6 8 escribe moel composition as another approach to create large moels from smaller moels. The smaller moels become submoels of a larger compose moel. Composition involves escribing how components from ifferent submoels interact with one another, without changing the inner workings of each submoel. The interaction escriptions are store in the overarching compose moel. Here, large moels are simply collections of submoels, an can be organize in a hierarchical fashion. Unlike fusion, moel composition is a reversible process. If the interaction escriptions are remove, then the original submoels can be recovere. Ranhawa an colleagues 8,9 characterize moel aggregation as a restricte form of moel composition. Here, they efine a moule as a collection of moel components. Figure 1. Moel aggregation. A moule also inclues a specification for preetermine ports. A port is a link to an internal moel component, such as a species or parameter. Therefore, a moule is a submoel with ports. The ports of a moule form an interface, which only allows access to specific components within the moule. The process of grouping moel components an assigning ports is referre to as moularization, as shown in Figure 1. The ifference between moel composition an moel aggregation lies in the restrictions place on access to the internals of the moules. In moel composition, any component of a submoel coul be reference in a larger compose moel. The lack of informationhiing interfaces is consiere a white-box coupling approach. 10 In moel aggregation, only a component linke to a port can be reference in a larger compose moel. Incorporating information-hiing interfaces is consiere a black-box coupling approach. 10 Moules are then connecte together by their interface ports. With moel aggregation, moelers can buil larger moels in a controlle manner. Ranhawa an colleagues 6,8,9 also presente the concept of moel flattening. Moel flattening converts compose or aggregate moels to their flattene versions. The interaction etails of the compose or aggregate moels are use as instructions uring the flattening process. The result is a single large (flat) moel, which is equivalent to fusing the submoels. The flat moel is in a stanar format that can be rea by existing software tools for the purpose of running simulations an further analysis. The flattening process loses the hierarchical an other relationships between the various moules, yieling a set of reaction equations.

3 Jones et al The SBML stanar Systems Biology Markup Language (SBML) is a format that represents systems biology moels electronically. Such a stanar allows for the sharing an collaboration of moels. SBML Level 1 11 was introuce in A moel efine in SBML can consist of many components, such as compartments, species, reactions, an parameters. The interactions between components in the moel are also efine in SBML. SBML is not esigne with the goal of being an easily human-reaable format. Moelers are not expecte to write their moels by han in SBML. Instea, software tools are expecte to rea an write the format. Since SBML supports the concept of efining moels as consisting of many components, it alreay inclues many of the features necessary for hierarchical moeling. For those hierarchical moeling features that o not exist within the SBML stanar, extra information about a component can be store in annotations. Annotations can be thought of as comments in an SBML file. These comments can be associate with any SBML component, such as a reaction, species, or parameter. Software that processes stanar SBML moels can also be augmente to process this aitional information carrie in the annotations. Therefore, annotations can be use by software evelopers to inclue application-specific ata. The latest version of SBML, Level 3 Version 1 Core, 12 was release in This version of SBML incorporates new features that support hierarchical moel efinitions. Such feature extensions are referre to as packages. Two SBML packages relevant to component-base moeling, comp an layout, are escribe next The SBML comp package. The latest version of the SBML comp package 13 was release in This package allows instances of moels to be incorporate as submoels within a moel. The moel structure is extene to inclue a list of submoels an a list of ports. A submoel is an instance of a moel efinition, which in turn is a complete, self-containe moel. Moel efinitions (instantiate as submoels) are locate either in the list of internal moel efinitions or the list of external moel efinitions. An internal moel efinition is store within the SBML file. An external moel efinition is a placeholer that specifies the location of an external file containing the moel efinition. This external file can be on the local machine or available on the internet. Ports allow moels to interact with other moels through a esignate interface. A port references some component within the moel that is being explicitly expose, such as a species or parameter. These extene features of comp enable hierarchical moel composition in SBML The SBML layout package. The latest version of the SBML layout package 14 was release in The layout package allows components of a moel to be represente graphically, along with their positions. To o so, the moel structure is extene to inclue a list of layouts. A layout can store information specifying the graphics representing some or all components of the SBML moel. These graphics are referre to as glyphs in the layout package. A compartment, species, or reaction can be represente by a CompartmentGlyph, SpeciesGlyph, or ReactionGlyph, respectively. A GeneralGlyph can be use to represent parts of a moel that are not specifie in the Level 3 Version 1 Core, such as a submoel from comp. A glyph stores information pertaining to the location an imension of a graphical object. A glyph oes not inclue information escribing the shape, color, or style of a graphical object; it is left up to the software tool reaing the layout to isplay such etails. These extene features of layout enable moel visualization in SBML, an these features are use heavily by JCMC Relate tools There are numerous software tools available for the moeling an simulation of molecular networks. For example, Antimony is a moel efinition language that can be use to create, import, an combine moels in a moular way. 15 However, Antimony is text-base an only provies limite support for importing/exporting moels using SBML comp. Similar to Antimony, Genetic Engineering of living Cells (GEC) is a text-base formal language. 16 GEC allows interactions between proteins an genes to be expresse in a logical manner. GEC programs can be use to create moels in a moular way. However, GEC oes not support exporting moels using SBML comp. COPASI is a tool use to moel, simulate, an analyze biochemical networks. 17 Its graphical user interface offers many features such as stochastic an eterministic simulation methos, parameter estimation, an ata visualization. COPASI is an excellent tool for creating a single moel, an it provies support for importing/exporting stanar SBML (Level 3). However, COPASI lacks features to support hierarchical moeling an SBML comp. TinkerCell is a tool that supports hierarchical moeling. 18 The graphical user interface lets users create moules that can be connecte together to form larger moels. TinkerCell oes not have a notion of port types an oes not support SBML output. The JigCell suite of tools can be use to moel, simulate, an analyze biochemical networks. 7,9,19 23 Previous iterations of JigCell have inclue a Moel Builer, Aggregation Connector, Run Manager, Comparator, an Parameter Estimation Toolkit. The Moel Builer is use to create an eit reactions, species, an other moel properties in a tabular format. The Aggregation Connector is use to combine moels in a moular way. The Run

4 996 Simulation: Transactions of the Society for Moeling an Simulation International 94(11) Manager an Parameter Estimation Toolkit are use to efine simulation properties an etermine unknown parameter values within the moel. The Comparator is use to compare the moel simulations with experimental results. The JigCell suite provies support for importing/exporting stanar SBML (Level 2). JigCell Multistate Moel Builer (JC-MSMB) is a tool that supports the moeling of biochemical networks. 24 The graphical user interface buils on the tabular spreasheet format use by Vass an colleagues. 22,23 JC-MSMB reuces the complexity of moel creation by introucing a new syntax to escribe multistate species. This syntax requires fewer reactions to represent complex molecular systems. The tool has many eiting support features such as flexible autocompletion an consistency checks to assist users uring the moel-creation process. It provies support for importing/exporting SBML (Level 3). However, JC-MSMB lacks features to support hierarchical moeling an SBML comp. The current work on JCMC can be viewe as a new generation beyon the JigCell Aggregation Connector, working in connection with the JigCell Multistate Moel Builer. ibiosim is a tool for the moeling, analysis, an esign of genetic circuits. 25 In synthetic biology, genetic circuits can be use to esign an construct networks to implement a particular cellular function. 26 Although primarily esigne for genetic circuits, it can be use to stuy biological networks as well. Its graphical user interface can be use to create, import, an combine moels in a moular way. ibiosim offers multiple simulation methos, moel analysis, an ata visualization, along with support for importing/exporting hierarchical moels using SBML comp. Both JigCell s Aggregation Connector an ibiosim offer support for SBML an hierarchical moeling. However, JigCell lacks the features of ifferent port types. ibiosim oes offer input an output port types, but oes not support equivalence ports Moel simulation Once a moel has been create, it is typically use for simulation an further analysis. There are multiple approaches to simulate a hierarchical moel. One option is to first flatten the moel. Once flattene, copies of all submoels have been instantiate an replacements an eletions have been applie, the moel is no longer in its hierarchical form. After flattening, the moel is simulate. COPASI is an example of a tool that uses this approach. 17 Another option is to simulate the moel in its hierarchical form. One such algorithm is hssa. 27 Instea of instantiating copies of each submoel, hssa instantiates a single copy of each unique submoel an re-uses them as neee. Replacements an eletions are mae as they are Figure 2. Three panels an the menu bar. encountere. ibiosim is an example of a tool that uses this approach JigCell Moel Connector We next escribe the JCMC in etail. In orer to better unerstan the purpose an key features of the JCMC, it helps to first have an overview of the system s user interface. At this point, the reaer nee not worry too much about the unerlying meaning of the various components that are presente here. This will be iscusse later Interface The JCMC interface consists of three panels, shown in Figure TreeView. The left panel contains the TreeView. This isplays the hierarchical relationships between components of the moel, somewhat like a traitional file foler isplay. An example is shown in Figure 3. A moule can be selecte from the TreeView using the left mouse button, an it will be highlighte. Double-clicks (using the left mouse button) will expan/collapse the selecte moule. After selecting a moule, the user can a or remove submoules (using the Moule menu) DrawingBoar. The right panel contains the DrawingBoar. This isplays the graphical view of a moule, its submoules, an any connections among them, as shown in Figure 4. The currently loae moule is calle the container moule. In Figure 4, the container moule is name RegulationExample. Submoules can be move

5 Jones et al. 997 Figure 4. DrawingBoar. Figure 5. MoelBuiler. Figure 3. TreeView. insie of the container moule. In Figure 4, Ch1 an CycB are submoules. If ports exist, they are isplaye on the container moule an submoules. Connections between ports, visible variable noes, an equivalence noes are also shown. Examples of these components are presente in later sections MoelBuiler. The bottom panel is the MoelBuiler, shown in Figure 5. The MoelBuiler in JCMC is actually a version of the JC-MSMB, 24 which was previously implemente by our group. The version of JC-MSMB use by JCMC is a subset of the complete moel eitor because JCMC oes not support multistate species. JC-MSMB has a tabular spreasheet interface that isplays the etails of a moule. Attributes such as reactions, species, parameters, an events can be moifie. 4. Components 4.1. Container moule The container moule is the moule currently loae into the DrawingBoar. The TreeView panel shows the container moule s name in bol font. The MoelBuiler panel isplays the moule efinition for the container moule. A moule efinition contains a moule s etaile information, such as reactions, species, parameters, an events. The DrawingBoar isplays the container moule an any submoules, ports, or connections in the moule Submoule A submoule is simply a moule containe within another moule. The TreeView panel lists a submoule uner the container moule to which it belongs. In the DrawingBoar, a submoule can be move an resize within the bouns of its container moule. A submoule s information is liste as: \ Definition Name. \ Submoule Name. Definition Name correspons to the name of the moule efinition. A moule efinition contains etaile information, such as reactions, species, parameters, an events. Submoule Name correspons to the name of a specific instantiation of the moule efinition. In Figure 4, submoule Ch1 is an instantiation of moule efinition PhosDephos. Similarly, submoule CycB is an instantiation of moule efinition SynDeg. A single moule efinition can be instantiate multiple times. We show examples of this in later sections. A submoule s etaile information (reactions, species, parameters, events, etc.) is not liste in the MoelBuiler panel because the container moule s information is isplaye instea. However, a submoule s information can be previewe in the MoelBuiler panel. Each submoule has a button in the top left-han corner. When this button is clicke, the information for that submoule will be

6 998 Simulation: Transactions of the Society for Moeling an Simulation International 94(11) Figure 6. Submoule information preview. isplaye in the MoelBuiler. An example is shown in Figure 6. After the button for Ch1 is clicke, the template information for Ch1 is isplaye in the MoelBuiler pane. Notice that the tables are graye-out in Figure 6. This is because the information is a preview only, an cannot be moifie. To moify the information, the user woul loa the submoule as the container moule. Submoules can be ae an remove using the Moule menu. Removing a submoule will remove the selecte moule, all of its submoules, an any connections associate with other moules. 5. Technical contributions As iscusse in Section 2, Ranhawa an colleagues 8,9 efine moel aggregation as a restricte form of moel composition. With aggregation, moelers can regulate external access to internal components of a moule by efining ports. A port allows an internal component to be reference in a larger compose moel. Moules can then be connecte together by their interface ports to buil larger moels in a controlle manner. However, not all moules are the same. Internal components linke to ports o not necessarily serve the same purpose for every moule. Not all moules connect together in the same way; therefore, multiple connection options nee to exist. Our primary contribution to hierarchical moeling is a richer variety of port types for connecting moules. In this section, we present these ifferent port an noe constructs. We also iscuss how these connections can impact a moel Ports Ports expose internal components of a moule so that they can be reference from outsie of that moule. A port can be linke to either a species or a moule quantity. Once create, the ports collectively form an interface to the moule, with external access to a moule s internal components being regulate by the interface. Moules can be connecte together by their interfaces to buil larger moels. Previous software tools support ports, 7,9,21 an ports are a part of the SBML comp package. 13 However, this prior work treats all ports the same. Internal components linke to ports o not necessarily serve the same purpose for every moule. When the port mechanism gives no information as to how an internal component is use, moelers have no way to iscern a component s purpose within a moule. So there exists a nee for ifferent port types. The port types supporte by JCMC are as follows. An output port is linke to an internal component that will sen a value to an external reference. The component linke to the port may be moifie insie the moule, but the component is not meant to be moifie outsie the moule. Consier the scenario in which a species is synthesize in a moule an then use as a transcription factor outsie of the moule. An output port is appropriate because the species is not moifie outsie of the moule. A etaile example is presente in Section 6.1. Output ports are represente as triangles on the ege of moules. They are oriente so the arrowhea points out of the moule. An input port is linke to an internal component that will receive a value from an external reference. The component linke to the port is not meant to be moifie within the moule. Consier the scenario in which a rate constant for a reaction within a moule has a value etermine outsie of the moule. An input port is appropriate because the rate constant is only use in calculations for the reaction, an not moifie insie the moule. A etaile example is presente in Section 6.1. Input ports are represente as triangles on the ege of moules. They are oriente so the arrowhea points into the moule. An equivalence port is linke to an internal component that will both receive an sen values from an external reference. The component linke to the port may be moifie insie an outsie the moule. Consier the scenario in which a species is synthesize in one moule an phosphorylate in another moule. An equivalence port is appropriate because the species is moifie in both moules. A etaile example is presente in Section 6.2. An equivalence port is represente as a iamon on the ege of a moule. In the DrawingBoar panel, ports are isplaye on moule bounaries. In the MoelBuiler panel, ports are liste uner the Ports tab (shown in Figure 7). The list is populate with ports from the container moule an ports from any submoules in the container moule. When a port is selecte in the DrawingBoar panel, the Ports tab is

7 Jones et al. 999 Figure 7. Ports tab. Figure 8. Visible variable create with a connection. isplaye an the corresponing port is highlighte in the MoelBuiler panel. Each port has three properties: Ref Name: the species or moule quantity reference by the port; Port Type: the type of port; Port Name: the name of the port. Port aitions or removals can only happen to the container moule. To moify the ports of a submoule, the user must first loa the submoule as the container moule Noes A noe allows connections to occur between moule ports. The type of noe use epens on the type of ports connecte Visible variable noe. A visible variable noe is automatically create when a connection is mae between input or output ports of two moules. Figure 8 shows two submoules after a connection has been mae, a visible variable was create, an the new variable was ae in the MoelBuiler panel. Another way to create a visible variable noe is to right-click the active moule an select Show Variable. Once selecte, a pop-up winow will appear with a rop-own box that contains a list of all the species an moule quantities in the moule. The user will select a variable an click A, then a visible variable noe will be create in the DrawingBoar panel. A visible variable noe can have at most one incoming connection. A single incoming connection lets the noe receive values. A visible variable noe can have multiple outgoing connections. The outgoing connections are use to sen values. Table 1. Rules for submoule (source) to submoule (target) connections Target submoule port Input Output Equivalence Source Input Invali Invali Invali Output Vali Invali Invali Equivalence Vali Invali Vali Equivalence noe. An equivalence noe is create automatically when a connection is mae between an equivalence port an any other port in the DrawingBoar panel. When create, the new variable is ae in the MoelBuiler panel. An equivalence noe can have multiple connections. Since values are both sent an receive, there is no istinction between incoming an outgoing connections Connections A set of connections link moules together. Connections can occur between the ports of ifferent moules, visible variable noes, an equivalence noes. The rules for connections are liste in Tables 1, 2, an 3. A connection can be create by ragging a line from a vali source to a vali target. Attempting to create an invali connection will result in a warning message, an no connection will be create. 6. Port, noe, an connection effects In this section we explore the effect that ifferent ports, noes, an connections have on a moel. In the equation notation use below, variables are represente by strings,

8 1000 Simulation: Transactions of the Society for Moeling an Simulation International 94(11) Table 2. Rules for container moule (source) to submoule connections (target) Target submoule port Input Output Equivalence Source Input Vali Invali Invali Output Invali Invali Invali Equivalence Vali Invali Vali Table 3. Rules for submoule (source) to container moule (target) connections Target container moule port Input Output Equivalence Figure 9. Synthesis an egraation moule SynDeg. Source Input Invali Invali Invali Output Invali Vali Invali Equivalence Invali Invali Vali multiplication is enote by 3, an ifferentiation by t ½nameŠ. (Throughout this paper, the notation ½nameŠ refers to the concentration of species name.) 6.1. Input an output ports We begin with a simple synthesis an egraation moule. Figure 9 shows how a synthesis an egraation moule woul look in JCMC. The reactions are isplaye in the MoelBuiler panel at the bottom. The rate of synthesis is etermine by rate constant k0 an transcription factor F. The rate of egraation is etermine by mass action kinetics with rate constant k1. The ynamics of species R in moule SynDeg are as follows: ½RŠ =(k03½fš) (k1 3 ½RŠ): t ð1þ Figure 9 also shows that moule quantities k0 an k1 are connecte to input ports. Because k0 an k1 are connecte to input ports, they can receive values from external connections. Note that k0 an k1 are not moifie within the moule SynDeg, they are only use for the computations of other variables. Figure 10 shows a phosphorylation an ephosphorylation moule in JCMC. The rate of phosphorylation is etermine by mass action kinetics with rate constant kp, while the rate of ephosphorylation is etermine by mass action kinetics with rate constant kh. The species ynamics of moule PhosDephos are efine as follows: ½SŠ = (kp 3 ½SŠ)+(kh 3 ½SPŠ), t ð2þ Figure 10. Phosphorylation an ephosphorylation moule PhosDephos. ½SPŠ =(kp 3 ½SŠ) (kh 3 ½SPŠ): t ð3þ Figure 11 isplays Moel01, where S an R are submoules. Submoule R is an instantiation of SynDeg, shown in Figure 9. Submoule S is an instantiation of PhosDephos, shown in Figure 10. Species TF, moule quantity ks, an moule quantity g are isplaye as visible variable noes. Submoule S has an output port linke to species SP an submoule R has input ports linke to species F, moule quantity k0, an moule quantity k1. Noe ks is connecte to the k0 port on submoule R. This means that k0 will receive the value of ks. To accomplish this, k0 will be replace by ks in submoule R. The same will happen with k1 ang. The replacement is not immeiate, but will occur when the entire moel is flattene. There is one connection from submoule S s SP port to noe TF, an another from noe TF to submoule R s F

9 Jones et al Figure 11. Output port example. port. Submoule S s SP port will sen its internal value to noe TF. Noe TF will then sen the value to submoule R s F port. Finally, the internal species F in submoule R will receive the value. When the moel is flattene, TF will replace SP in submoule S an F in submoule R. The species ynamics after flattening are as follows: ½SŠ = (kp 3 ½SŠ)+(kh 3 ½TFŠ), t ð4þ ½TFŠ =(kp 3 ½SŠ) (kh 3 ½TFŠ), t ð5þ ½RŠ =(ks 3 ½TFŠ) (g 3 ½RŠ): t ð6þ Equation (3) has been replace by Equation (5) an TF has replace SP in Equation (2) to form the upate Equation (4). Similarly, TF has replace F in Equation (1) to form the upate Equation (6) Equivalence port Figure 12 shows the MoelBuiler panel for three ifferent moules. Figure 12(a) shows the reaction etails for the synthesis an egraation of species X in moule SynDeg. The rate of synthesis is etermine by ks an the rate of egraation is etermine by mass action kinetics with rate constant g. The ynamics of species X in moule SynDeg are efine as follows: ½X Š = ks (g 3 ½X Š): t ð7þ Figure 12(b) shows the reaction etails for the phosphorylation an ephosphorylation of species Y in moule PhosDephos. The rate of phosphorylation is etermine by mass action kinetics with rate constant kp. The rate of ephosphorylation is etermine by mass action kinetics Figure 12. Moule reaction information. with rate constant kh. The species ynamics of moule PhosDephos are efine as follows: ½Y Š = (kp 3 ½YŠ)+(kh 3 ½YPŠ), t ð8þ ½YPŠ =(kp 3 ½Y Š) (kh 3 ½YPŠ): t ð9þ Figure 12(c) shows the reaction etails for the association an issociation of species Comp in moule AssocDissoc. The rate of association is etermine by mass action kinetics with rate constant ka. The rate of issociation is etermine by mass action kinetics with rate constant k. The species ynamics of moule AssocDissoc are efine as follows: ½ZŠ = (ka 3 ½ZŠ 3 ½WŠ)+(k 3 ½CompŠ), t ð10þ ½WŠ = (ka 3 ½ZŠ 3 ½WŠ)+(k 3 ½CompŠ), t ð11þ ½CompŠ =(ka 3 ½ZŠ 3 ½WŠ) (k 3 ½CompŠ): t ð12þ Figure 13 shows Moel02, where X, Y, an Comp are submoules. Submoule X is an instantiation of SynDeg, submoule Y is an instantiation of PhosDephos, an submoule Comp is an instantiation of AssocDissoc. Species A is isplaye as an equivalence noe. Submoule X has an equivalence port linke to species X, submoule Y has an equivalence port linke to species Y, an submoule Comp has an equivalence port linke to species Z. Each of these equivalence ports are connecte to noe A in Moel02. When the moel is flattene for simulation, A will replace X in submoule X, Y in submoule Y, an Z in submoule Comp. The species ynamics after flattening are as follows:

10 1002 Simulation: Transactions of the Society for Moeling an Simulation International 94(11) Figure 13. Equivalence port example. ½YPŠ =(kp 3 ½AŠ) (kh 3 ½YPŠ), t ð13þ ½WŠ = (ka 3 ½AŠ 3 ½WŠ)+(k 3 ½CompŠ), t ð14þ ½CompŠ =(ka 3 ½AŠ 3 ½WŠ) (k 3 ½CompŠ), t ð15þ t from X in submoule X zfflfflfflfflfflfflfflfflfflffl} fflfflfflfflfflfflfflfflfflffl{ ½AŠ = ks (g 3 ½AŠ) from Y in submoule Y zfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflffl} fflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflffl{ (kp 3 ½AŠ)+(kh 3 ½YPŠ) from Z in submoule Comp zfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflffl} fflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflffl{ (ka 3 ½AŠ 3 ½WŠ)+(k 3 ½CompŠ) : ð16þ Equation (13) is an upate version of Equation (9), where A has replace Y. Similarly, A has replace Z in Equations (11) an (12) to form the upate Equations (14) an (15). Notice that Equation (16) is an aggregate of Equations (7), (8), an (10). Since noe A is connecte to equivalence ports, values are both sent an receive, an therefore information from each connection is kept. SBML, we ecie to use SBML annotations an Systems Biology Ontology (SBO) terms. 28 The annotation stores the variable type an variable name by using the tags vtype an refname. The SBO term stores the port type. SBO terms can be use an rea by other software tools, such as ibiosim. 25 SBML Syntax in the Supplemental Material shows an example of two ports using the comp package. The layout package oes not have a specific glyph to represent ports. It oes support a GraphicalObject, which can be use to store general information about an object. We ecie to use GraphicalObjects combine with annotations to escribe the port layout. The GraphicalObject stores the position of each port. The aitional annotation stores the port type, variable type, variable name, variable i, an the name of the moule in which the port is locate. SBML Syntax in the Supplemental Material shows the graphical information for two ports using the layout package Noes. Visible variable noes an equivalence noes are not efine in the comp package. However, a noe always represents either a species or a moule quantity. Since both species an moule quantities are present in SBML, we inclue noe information with an annotation. SBML Syntax in the Supplemental Material shows an example of a visible variable noe ClbS an an equivalence noe ClbM. The annotation stores the variable name an noe type. The layout package oes have a SpeciesGlyph to represent species, but it oes not have a specific glyph to represent moule quantities. Since a noe can be a species or a moule quantity, we ecie to use GraphicalObjects combine with annotations to escribe their layout. SBML Syntax in the Supplemental Material shows an example of the graphical information for visible variable noe ClbS an equivalence noe ClbM using the layout package. Similar to ports, the GraphicalObject stores the position of each noe. The annotation stores the variable name an variable type SBML syntax We iscusse the SBML stanar in Section 2.2. JCMC is able to store the information that escribes a hierarchical moel by using the SBML comp package. The submoules in JCMC can be store as moel efinitions within the SBML file. In this section we explain how the port an noe constructs are store in SBML Ports. Ports are inclue in the comp package. However, the ifferent port types introuce in Section 5.1 are not. In orer to store this extra information in Connections. In SBML, there is no efinition for a connection. Instea, the comp package introuce the notion of replacements. A replacement allows one component to replace another. Replacements are the interaction etails use as instructions if the moel is flattene. Most connections in JCMC are represente as replacements in SBML. All of our replacements are top-own, which makes them easy to follow an they o not require any rules for resolution. It is important to note that the topown approach applies to initial values as well. After flattening, initial values may nee to be reassigne before simulation.

11 Jones et al Figure 14. Moel of cell-cycle control in buing yeast Case stuy In this section, we will emonstrate the features of JCMC by builing a complex biological moel. Barik an colleagues 29 publishe a moel of yeast cell-cycle regulation, consisting of 58 species an 220 reactions. We will reconstruct this moel with a more efficient approach by utilizing moules. We will show how submoules connect together an the role that ports play in the process Biological moel Figure 14 shows a wiring iagram of the biological moel from the work of Barik an colleagues. 29 Species are represente by the labele shapes. Chemical reactions are represente by soli arrows an enzymatic activities are represente by ashe arrows. Reversible bining reactions are represente by T-shape arrows with balls on the cross-bars. For clarification purposes, Figure 14 only isplays some of the major regulatory interactions containe in the moel. For example, the synthesis an egraation reactions for Whi5, SBF, Ch1, Net1, Hbf, Hi5, an Ht1 are not shown. The moel by Barik an colleagues 29 captures the molecular controls of cell-cycle events, incluing the initiation of DNA synthesis (by ClbS) an of mitosis (by ClbM), an exit from mitosis, incluing cell ivision (by Cc14). When a mother cell ivies, the volume of the cell an the number of molecules of each chemical species within the cell are evenly split between the two resulting aughter cells. (For simplicity, we are ignoring the fact that buing yeast cells ivie asymmetrically.) In the moel, the event of cell ivision is triggere by ClbM. When the concentration of ClbM rops below 12 nm, the cell will ivie evenly. Figure 15. Moular moel of cell-cycle control in buing yeast The hierarchical moel First, we will introuce a transcription an translation moule that will appear multiple times in our moel. Next, we will moularize the moel (Figure 15) an buil up each moule iniviually. Then, we will connect the moules together to form the final hierarchical moel. Finally, we will valiate the hierarchical moel by comparing simulation results with the original moel. In the following escriptions, variables refer to the number of molecules Transcription an translation coupling. From Figure 14 we can see that some of the regulatory functions in the moel are similar. The mechanisms regulating ClbM, ClbS, an Cln3 appear to follow the same pattern. The synthesis of the protein is epenent upon the synthesis of its mrna. This is calle transcription an translation coupling. Since it occurs multiple times in the moel, we can buil it as a reusable, generic moule. Figure 16 shows moule TTCoupling, short for transcription an translation coupling. The MoelBuiler panel at the bottom isplays the four reactions in the moule that escribe the synthesis an egraation of mrna an protein X. Moule quantities ksm, gm, ksx, an gx are the constants that etermine the rates of the four reactions. Protein X is linke to an output port an the rate constants are linke to input ports. The ports allow external proteins an rate constants to connect to the moule an utilize the interior transcription an translation reaction structure. We will see how this is one in later sections. There are also two more input ports for species V an ClbM. These species are use to calculate when the concentration of ClbM falls below 12.5 nm, which is when cell ivision occurs. Since V is the volume of the cell an

12 1004 Simulation: Transactions of the Society for Moeling an Simulation International 94(11) Figure 16. Transcription an translation coupling moule TTCoupling. phosphorylate states, for a total of 11 phosphorylation states. In this moel, only the unphosphorylate state of Ch1 is active. ClbM affects many parts of this moel. Figure 17 isplays moule Step01. Step01 contains submoules Ch1Reg an ClbMTT. Visible variable noes Ch1 an.ch1pt. receive connections from Ch1Reg s output ports Ch1a an Ch1i. Ch1 an Ch1Pt are use to calculate moule quantity gbmt. The relationship between Ch1, Ch1Pt, an gbmt is not explicitly shown on the DrawingBoar. The calculation efining gbmt is viewable in the Moule Quantities tab of the MoelBuiler panel (not shown in the figure). Visible variable noes ksmbm, gmbm, ksbmt, an gbmt connect the moule quantities to ClbMTT s input ports ksm, gm, ksx, an gx. Visible variable noe ClbM connects the species to ports on both submoules as well as moule Step01. Noe ClbM receives its value from submoule ClbMTT, where ClbM is regulate. Noe ClbM then sens its value to submoule Ch1Reg, where ClbM influences the phosphorylation of Ch1. Noe ClbM is also connecte to Step01 s output port ClbM, so it can be reference by other parts of the moel. Step 01 has three input ports connecte to visible variable noes. These noes are then connecte to submoules, where their values can be use for calculations. Details for the submoules in Step01 can be foun in the Supplemental Material. Figure 17. Step01 moule in JCMC. ClbM is the number of ClbM molecules, they both must be inclue to calculate the concentration of ClbM. When the cell ivies, most species are ivie in half. To accomplish this, an event is use. The event calculates the concentration of ClbM to etermine when the cell ivies. When the cell ivies, the species numbers within the moule are reassigne appropriately. An event like this occurs in most moules, which is why most moules require V an ClbM. In the TTCoupling moule, species X an mrna are reassigne to half their current values, assuming that the protein an mrna molecules are ivie equally between the two aughter cells ClbM regulation. Step 1 of the moel will consist of the interactions containe in area A of Figure 15. The regulation of Ch1 an ClbM play big roles in step 1. Ch1 has 1 unphosphorylate state as well as Cc14 regulation. Step 2 of the moel will consist of the interactions containe in area B of Figure 15. In step 2, the active phosphorylation states of Net1 combine with Cc14 to form the RENT complex. Ht1 causes ephosphorylation of both Net1 an RENT phosphorylate states. Figure 18 isplays moule Step02. Step02 contains submoules Ht1Reg, Cc14Reg, Net1Reg, an RENTReg. Visible variable noe Ht1 connects the species to three ifferent submoules. Noe Ht1 receives a value from submoule Ht1Reg, where it is regulate. Noe Ht1 sens its value to submoules Net1Reg an RENTReg, where it promotes ephosphorylation. Equivalence noes for each of the Net1 phosphorylation states connect to Net1Reg an RENTReg because the species are moifie in both submoules. Equivalence noe Cc14 connects to submoules Cc14Reg an RENTReg. Noe Cc14 also connects to an output port on moule Step02, so it can be reference by other parts of the moel. Details for the submoules in Step02 can be foun in the Supplemental Material SBF regulation. Step 3 of the moel will consist of the interactions containe in area C of Figure 15. In step 3, the active phosphorylation states of SBF an Whi5 combine to form the Cmp complex. Hi5 is involve with the

13 Jones et al Figure 18. Step02 moule in JCMC. Figure 20. Final CellCycle moel in JCMC. Figure 19. Step03 moule in JCMC. ephosphorylation of Whi5 an Cmp, while Hbf is involve with the ephosphorylation of SBF. Figure 19 isplays moule Step03. Step03 contains submoules Hi5Reg, SBFReg, Whi5Reg, an CmpReg. Visible variable noe Hi5 connects the species to three ifferent submoules. Noe Hi5 receives a value from submoule Hi5Reg, where it is regulate. Noe Hi5 sens its value to submoules Whi5Reg an CmpReg, where it promotes ephosphorylation. Equivalence noes for each of the Whi5 phosphorylation states connect to Whi5Reg an CmpReg because the species are moifie in both submoules. Equivalence noe SBF connects to submoules SBFReg an CmpReg. Noe SBF also connects to an output port on moule Step03, so it can be reference by other parts of the moel. Step 03 has five input ports connecte to visible variable noes. These noes are then connecte to ifferent submoules, where their values can be use for calculations. Details for the submoules in Step03 can be foun in the Supplemental Material Final moel. We have create all of the moules necessary for our moel, so now it is time to put them together. A JCMC user woul start by importing all of the moules we have iscusse. After the moules are importe, the CellCycle moel contains submoules Step01, Step02, Step03, ClbSReg, an Cln3Reg. Figure 20 isplays the complete CellCycle moel. Visible variable noe ClbS connects the species to three submoules. Noe ClbS receives a value from submoule ClbSReg, where it is regulate. Noe ClbS sens its value to submoules Step01 an Step03, where it promotes phosphorylation. Visible variable noe Cc14 connects the species to three submoules as well. Noe Cc14 receives a value from submoule Step02, where it is regulate an part of the RENT complex. Noe Cc14 sens its value to submoules Step01 an Step03, where it promotes ephosphorylation. Visible variable noe Cln3 connects the species to two submoules. Noe Cln3 receives a value from submoule Cln3Reg, where it is regulate. Noe Cln3 sens its value to submoule Step03, where it promotes phosphorylation. Visible variable noe SBF connects the species to two submoules. Noe SBF receives a value from submoule Step03, where it is regulate an part of the Cmp complex. Noe SBF sens its value to submoule ClbSReg, where it promotes ClbS transcription. Visible variables noes ClbM an V are connecte to each of the submoules through either input or output ports. ClbM an V are present in every submoule because their values are use to calculate when cell ivision occurs Simulation results. To valiate the hierarchical moel, we compare its simulation results with results from the original moel. Figure 21 isplays the two moel simulations. We exporte the hierarchical moel into SBML format with the comp package using JCMC. Since the original

14 1006 Simulation: Transactions of the Society for Moeling an Simulation International 94(11) moel is a non-hierarchical moel, we ecie to use the software tool COPASI to flatten an simulate the hierarchical moel. 17 COPASI was able to flatten the moel by following the moule interaction etails store with SBML comp. Parameter values an initial concentrations were set as escribe by Barik an colleagues. 29 We compare the flattene hierarchical moel to the eterministic version of the original moel, in which the cell ivies symmetrically. The simulation results from the flattene hierarchical moel in Figure 21(b) match the results from the original moel in Figure 21(a). This was verifie by confirming that the time series simulation ata from both moels were ientical. 8. Conclusions an future work When builing a mathematical moel, templates can provie a compact an expressive way to re-use moel components. A template is characterize as a generic moule efinition. Templates o not hol information relate to one specific species. Instea, they contain general molecular mechanisms that are common in the regulatory network. A goo example is the transcription an translation coupling moule from the case stuy, shown in Figure 16. Here, species X is linke to an output port an the rate constants for the reactions are all linke to input ports. The ports let external entities utilize the interior transcription an translation reaction structure of the moule. A template can be instantiate multiple times to escribe the molecular behavior of ifferent species without neeing to be moifie. The esire species an rate constants can be connecte to the appropriate ports. This is one with ClbM, ClbS, an Cln3 in the case stuy. Alternatively, we coul have create iniviual moule efinitions for ClbM, ClbS, an Cln3. In this case, each moule efinition woul have containe the same reaction structure an we woul have neee to write 12 repetitive reactions. Using a template allowe us to avoi such inefficiencies. The ability to test a moel is important, an frequent testing shoul occur uring the moel-builing process. In software engineering, evelopment testing ensures components are correct as they are evelope. 30 Each component is teste iniviually before it is ae to the system. This allows errors to be iscovere, an hopefully fixe, early in evelopment. A similar approach shoul be taken when builing a mathematical moel. As moules are create, their inner reaction structures can be verifie using simulation tools such as COPASI. 17 As moules are connecte together, their connections can be verifie by checking the resulting equations. These tests shoul be one throughout the moel-builing process. Waiting until the en to test can make it extremely ifficult to fin the cause of an error. As molecular network moels continue to grow in size an complexity, traitional moeling practices are Figure 21. Time course simulation results. becoming obsolete. Builing complex moels in a controlle, organize manner is important. Without proper organization, complex moels become ifficult to unerstan. In orer to construct an comprehen such moels, we must evolve our moeling approach. In this paper, we have reviewe improve moeling approaches relate to hierarchical moel composition, along with software stanars that support this moeling approach. We propose enhancements to the way moules interact in moel aggregation. We introuce new port an noe constructs that enable multiple connection options for moules. We also escribe how ifferent connections can impact a moel. Our tool that supports hierarchical moeling is name the JigCell Moel Connector (JCMC). We escribe the JCMC interface an explaine how the components of a hierarchical moel are represente. We etaile how input, output, an equivalence ports form the moule interface. We also explaine how visible variable an equivalence noes are utilize in JCMC. Finally, we emonstrate the benefits of hierarchical moeling with JCMC by reconstructing a complex biological moel in a moular fashion. A possible enhancement to the JCMC woul be to incorporate multistate moeling. Currently, the JCMC only buils moels with single-state species. Multistate moeling can rastically reuce the size of moels containing species that have multiple states. Aing this enhancement to JCMC woul give moelers the opportunity to create complex multistate moels by connecting smaller submoules together. Another possible enhancement to the JCMC woul be to let any moel component link to a port. Currently, JCMC only links species an moule quantities to ports. SBML comp allows any moel component to link to a port. Aing this feature to JCMC woul allow for the import an export of reactions, events, an other moel components between moules. Disclaimer Alia Palmisano contribute to this manuscript as a follow up to work one while employe at Virginia Tech. The opinions

Coupling the User Interfaces of a Multiuser Program

Coupling the User Interfaces of a Multiuser Program Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces

More information

CS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics

CS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,

More information

Preamble. Singly linked lists. Collaboration policy and academic integrity. Getting help

Preamble. Singly linked lists. Collaboration policy and academic integrity. Getting help CS2110 Spring 2016 Assignment A. Linke Lists Due on the CMS by: See the CMS 1 Preamble Linke Lists This assignment begins our iscussions of structures. In this assignment, you will implement a structure

More information

Intensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2

Intensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2 This paper appears in J. of Parallel an Distribute Computing 10 (1990), pp. 167 181. Intensive Hypercube Communication: Prearrange Communication in Link-Boun Machines 1 2 Quentin F. Stout an Bruce Wagar

More information

Skyline Community Search in Multi-valued Networks

Skyline Community Search in Multi-valued Networks Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h

More information

Solution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation

Solution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation Solution Representation for Job Shop Scheuling Problems in Ant Colony Optimisation James Montgomery, Carole Faya 2, an Sana Petrovic 2 Faculty of Information & Communication Technologies, Swinburne University

More information

Almost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control

Almost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus

More information

Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien

Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,

More information

Non-homogeneous Generalization in Privacy Preserving Data Publishing

Non-homogeneous Generalization in Privacy Preserving Data Publishing Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h

More information

Computer Organization

Computer Organization Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science

More information

Lecture 1 September 4, 2013

Lecture 1 September 4, 2013 CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the

More information

From an Abstract Object-Oriented Model to a Ready-to-Use Embedded System Controller

From an Abstract Object-Oriented Model to a Ready-to-Use Embedded System Controller From an Abstract Object-Oriente Moel to a Reay-to-Use Embee System Controller Stanislav Chachkov, Diier Buchs Software Engineering Laboratory, Swiss Feeral Institute for Technology 1015 Lausanne, Switzerlan

More information

Animated Surface Pasting

Animated Surface Pasting Animate Surface Pasting Clara Tsang an Stephen Mann Computing Science Department University of Waterloo 200 University Ave W. Waterloo, Ontario Canaa N2L 3G1 e-mail: clftsang@cgl.uwaterloo.ca, smann@cgl.uwaterloo.ca

More information

NAND flash memory is widely used as a storage

NAND flash memory is widely used as a storage 1 : Buffer-Aware Garbage Collection for Flash-Base Storage Systems Sungjin Lee, Dongkun Shin Member, IEEE, an Jihong Kim Member, IEEE Abstract NAND flash-base storage evice is becoming a viable storage

More information

Bends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways

Bends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis

More information

Loop Scheduling and Partitions for Hiding Memory Latencies

Loop Scheduling and Partitions for Hiding Memory Latencies Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html

More information

Divide-and-Conquer Algorithms

Divide-and-Conquer Algorithms Supplment to A Practical Guie to Data Structures an Algorithms Using Java Divie-an-Conquer Algorithms Sally A Golman an Kenneth J Golman Hanout Divie-an-conquer algorithms use the following three phases:

More information

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract

More information

The Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract

The Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract The Reconstruction of Graphs Dhananay P. Mehenale Sir Parashurambhau College, Tila Roa, Pune-4030, Inia. Abstract In this paper we iscuss reconstruction problems for graphs. We evelop some new ieas lie

More information

Transient analysis of wave propagation in 3D soil by using the scaled boundary finite element method

Transient analysis of wave propagation in 3D soil by using the scaled boundary finite element method Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite

More information

Online Appendix to: Generalizing Database Forensics

Online Appendix to: Generalizing Database Forensics Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that

More information

Design of Policy-Aware Differentially Private Algorithms

Design of Policy-Aware Differentially Private Algorithms Design of Policy-Aware Differentially Private Algorithms Samuel Haney Due University Durham, NC, USA shaney@cs.ue.eu Ashwin Machanavajjhala Due University Durham, NC, USA ashwin@cs.ue.eu Bolin Ding Microsoft

More information

Comparison of Methods for Increasing the Performance of a DUA Computation

Comparison of Methods for Increasing the Performance of a DUA Computation Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,

More information

Chapter 9 Memory Management

Chapter 9 Memory Management Contents 1. Introuction 2. Computer-System Structures 3. Operating-System Structures 4. Processes 5. Threas 6. CPU Scheuling 7. Process Synchronization 8. Dealocks 9. Memory Management 10.Virtual Memory

More information

Characterizing Decoding Robustness under Parametric Channel Uncertainty

Characterizing Decoding Robustness under Parametric Channel Uncertainty Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric

More information

Shift-map Image Registration

Shift-map Image Registration Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.

More information

BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES

BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations

More information

Learning Subproblem Complexities in Distributed Branch and Bound

Learning Subproblem Complexities in Distributed Branch and Bound Learning Subproblem Complexities in Distribute Branch an Boun Lars Otten Department of Computer Science University of California, Irvine lotten@ics.uci.eu Rina Dechter Department of Computer Science University

More information

Throughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem

Throughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem Throughput Characterization of Noe-base Scheuling in Multihop Wireless Networks: A Novel Application of the Gallai-Emons Structure Theorem Bo Ji an Yu Sang Dept. of Computer an Information Sciences Temple

More information

Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means

Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu

More information

ACE: And/Or-parallel Copying-based Execution of Logic Programs

ACE: And/Or-parallel Copying-based Execution of Logic Programs ACE: An/Or-parallel Copying-base Execution of Logic Programs Gopal GuptaJ Manuel Hermenegilo* Enrico PontelliJ an Vítor Santos Costa' Abstract In this paper we present a novel execution moel for parallel

More information

Using Vector and Raster-Based Techniques in Categorical Map Generalization

Using Vector and Raster-Based Techniques in Categorical Map Generalization Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department

More information

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication

More information

Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs

Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs IEEE TRANSACTIONS ON KNOWLEDE AND DATA ENINEERIN, MANUSCRIPT ID Distribute Line raphs: A Universal Technique for Designing DHTs Base on Arbitrary Regular raphs Yiming Zhang an Ling Liu, Senior Member,

More information

Study of Network Optimization Method Based on ACL

Study of Network Optimization Method Based on ACL Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department

More information

Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem

Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base

More information

Message Transport With The User Datagram Protocol

Message Transport With The User Datagram Protocol Message Transport With The User Datagram Protocol User Datagram Protocol (UDP) Use During startup For VoIP an some vieo applications Accounts for less than 10% of Internet traffic Blocke by some ISPs Computer

More information

Politehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques

Politehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques Politehnica University of Timisoara Mobile Computing, Sensors Network an Embee Systems Laboratory ing Techniques What is testing? ing is the process of emonstrating that errors are not present. The purpose

More information

MORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks

MORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks : a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications

More information

CS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing

CS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing CS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing Tim Roughgaren October 19, 2016 1 Routing in the Internet Last lecture we talke about elay-base (or selfish ) routing, which

More information

Shift-map Image Registration

Shift-map Image Registration Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy

More information

Proving Vizing s Theorem with Rodin

Proving Vizing s Theorem with Rodin Proving Vizing s Theorem with Roin Joachim Breitner March 25, 2011 Proofs for Vizing s Theorem t to be unwiely unless presente in form a constructive algorithm with a proof of its correctness an termination.

More information

Dense Disparity Estimation in Ego-motion Reduced Search Space

Dense Disparity Estimation in Ego-motion Reduced Search Space Dense Disparity Estimation in Ego-motion Reuce Search Space Luka Fućek, Ivan Marković, Igor Cvišić, Ivan Petrović University of Zagreb, Faculty of Electrical Engineering an Computing, Croatia (e-mail:

More information

Verifying performance-based design objectives using assemblybased vulnerability

Verifying performance-based design objectives using assemblybased vulnerability Verying performance-base esign objectives using assemblybase vulnerability K.A. Porter Calornia Institute of Technology, Pasaena, Calornia, USA A.S. Kiremijian Stanfor University, Stanfor, Calornia, USA

More information

Chapter 5 Proposed models for reconstituting/ adapting three stereoscopes

Chapter 5 Proposed models for reconstituting/ adapting three stereoscopes Chapter 5 Propose moels for reconstituting/ aapting three stereoscopes - 89 - 5. Propose moels for reconstituting/aapting three stereoscopes This chapter offers three contributions in the Stereoscopy area,

More information

1 Surprises in high dimensions

1 Surprises in high dimensions 1 Surprises in high imensions Our intuition about space is base on two an three imensions an can often be misleaing in high imensions. It is instructive to analyze the shape an properties of some basic

More information

APPLYING GENETIC ALGORITHM IN QUERY IMPROVEMENT PROBLEM. Abdelmgeid A. Aly

APPLYING GENETIC ALGORITHM IN QUERY IMPROVEMENT PROBLEM. Abdelmgeid A. Aly International Journal "Information Technologies an Knowlege" Vol. / 2007 309 [Project MINERVAEUROPE] Project MINERVAEUROPE: Ministerial Network for Valorising Activities in igitalisation -

More information

A Plane Tracker for AEC-automation Applications

A Plane Tracker for AEC-automation Applications A Plane Tracker for AEC-automation Applications Chen Feng *, an Vineet R. Kamat Department of Civil an Environmental Engineering, University of Michigan, Ann Arbor, USA * Corresponing author (cforrest@umich.eu)

More information

State Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway

State Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle

More information

THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE

THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:

More information

6.823 Computer System Architecture. Problem Set #3 Spring 2002

6.823 Computer System Architecture. Problem Set #3 Spring 2002 6.823 Computer System Architecture Problem Set #3 Spring 2002 Stuents are strongly encourage to collaborate in groups of up to three people. A group shoul han in only one copy of the solution to the problem

More information

A shortest path algorithm in multimodal networks: a case study with time varying costs

A shortest path algorithm in multimodal networks: a case study with time varying costs A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via

More information

Using Ray Tracing for Site-Specific Indoor Radio Signal Strength Analysis 1

Using Ray Tracing for Site-Specific Indoor Radio Signal Strength Analysis 1 Using Ray Tracing for Site-Specific Inoor Raio Signal Strength Analysis 1 Michael Ni, Stephen Mann, an Jay Black Computer Science Department, University of Waterloo, Waterloo, Ontario, NL G1, Canaa Abstract

More information

Bayesian localization microscopy reveals nanoscale podosome dynamics

Bayesian localization microscopy reveals nanoscale podosome dynamics Nature Methos Bayesian localization microscopy reveals nanoscale poosome ynamics Susan Cox, Ewar Rosten, James Monypenny, Tijana Jovanovic-Talisman, Dylan T Burnette, Jennifer Lippincott-Schwartz, Gareth

More information

Lab work #8. Congestion control

Lab work #8. Congestion control TEORÍA DE REDES DE TELECOMUNICACIONES Grao en Ingeniería Telemática Grao en Ingeniería en Sistemas e Telecomunicación Curso 2015-2016 Lab work #8. Congestion control (1 session) Author: Pablo Pavón Mariño

More information

Experion PKS R500 Migration Planning Guide

Experion PKS R500 Migration Planning Guide Experion PKS R500 Migration Planning Guie EPDOC-XX70-en-500E May 2018 Release 500 Document Release Issue Date EPDOC-XX70- en-500e 500 0 May 2018 Disclaimer This ocument contains Honeywell proprietary information.

More information

Variable Independence and Resolution Paths for Quantified Boolean Formulas

Variable Independence and Resolution Paths for Quantified Boolean Formulas Variable Inepenence an Resolution Paths for Quantifie Boolean Formulas Allen Van Geler http://www.cse.ucsc.eu/ avg University of California, Santa Cruz Abstract. Variable inepenence in quantifie boolean

More information

Software Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency

Software Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency Software Reliability Moeling an Cost Estimation Incorporating esting-effort an Efficiency Chin-Yu Huang, Jung-Hua Lo, Sy-Yen Kuo, an Michael R. Lyu -+ Department of Electrical Engineering Computer Science

More information

Offloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization

Offloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization 1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24

More information

Problem Paper Atoms Tree. atoms.pas. atoms.cpp. atoms.c. atoms.java. Time limit per test 1 second 1 second 2 seconds. Number of tests

Problem Paper Atoms Tree. atoms.pas. atoms.cpp. atoms.c. atoms.java. Time limit per test 1 second 1 second 2 seconds. Number of tests ! " # %$ & Overview Problem Paper Atoms Tree Shen Tian Harry Wiggins Carl Hultquist Program name paper.exe atoms.exe tree.exe Source name paper.pas atoms.pas tree.pas paper.cpp atoms.cpp tree.cpp paper.c

More information

PART 2. Organization Of An Operating System

PART 2. Organization Of An Operating System PART 2 Organization Of An Operating System CS 503 - PART 2 1 2010 Services An OS Supplies Support for concurrent execution Facilities for process synchronization Inter-process communication mechanisms

More information

Random Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation

Random Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,

More information

Additional Divide and Conquer Algorithms. Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication

Additional Divide and Conquer Algorithms. Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication Aitional Divie an Conquer Algorithms Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication Divie an Conquer Closest Pair Let s revisit the closest pair problem. Last

More information

On the Placement of Internet Taps in Wireless Neighborhood Networks

On the Placement of Internet Taps in Wireless Neighborhood Networks 1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that

More information

Indicator i 20. User manual

Indicator i 20. User manual Inicator i 20 WWW.PRECIAMOLEN.COM User manual 04-50-00-1 MU / 10/2012 Contents 1. Forewor... 5 Documentary conventions... 5 Pictograms... 5 Terminology an abbreviations... 5 Aitional ocumentation... 5

More information

Real-time concepts for Software/Hardware Engineering

Real-time concepts for Software/Hardware Engineering Real-time concepts for Software/Harware Engineering Master s thesis of M.C.W. Geilen Date: August 996 Coaches: ing.p.h.a. van er Putten ir.j.p.m. Voeten Supervisor: prof.ir.m.p.j. Stevens Section of Information

More information

William S. Law. Erik K. Antonsson. Engineering Design Research Laboratory. California Institute of Technology. Abstract

William S. Law. Erik K. Antonsson. Engineering Design Research Laboratory. California Institute of Technology. Abstract Optimization Methos for Calculating Design Imprecision y William S. Law Eri K. Antonsson Engineering Design Research Laboratory Division of Engineering an Applie Science California Institute of Technology

More information

Adjacency Matrix Based Full-Text Indexing Models

Adjacency Matrix Based Full-Text Indexing Models 1000-9825/2002/13(10)1933-10 2002 Journal of Software Vol.13, No.10 Ajacency Matrix Base Full-Text Inexing Moels ZHOU Shui-geng 1, HU Yun-fa 2, GUAN Ji-hong 3 1 (Department of Computer Science an Engineering,

More information

Optimal Routing and Scheduling for Deterministic Delay Tolerant Networks

Optimal Routing and Scheduling for Deterministic Delay Tolerant Networks Optimal Routing an Scheuling for Deterministic Delay Tolerant Networks Davi Hay Dipartimento i Elettronica olitecnico i Torino, Italy Email: hay@tlc.polito.it aolo Giaccone Dipartimento i Elettronica olitecnico

More information

Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks

Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks 1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stolyar Abstract Backpressure-base aaptive routing

More information

d 3 d 4 d d d d d d d d d d d 1 d d d d d d

d 3 d 4 d d d d d d d d d d d 1 d d d d d d Proceeings of the IASTED International Conference Software Engineering an Applications (SEA') October 6-, 1, Scottsale, Arizona, USA AN OBJECT-ORIENTED APPROACH FOR MANAGING A NETWORK OF DATABASES Shu-Ching

More information

Image Segmentation using K-means clustering and Thresholding

Image Segmentation using K-means clustering and Thresholding Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,

More information

Polygon Simplification by Minimizing Convex Corners

Polygon Simplification by Minimizing Convex Corners Polygon Simplification by Minimizing Convex Corners Yeganeh Bahoo 1, Stephane Durocher 1, J. Mark Keil 2, Saee Mehrabi 3, Sahar Mehrpour 1, an Debajyoti Monal 1 1 Department of Computer Science, University

More information

Recitation Caches and Blocking. 4 March 2019

Recitation Caches and Blocking. 4 March 2019 15-213 Recitation Caches an Blocking 4 March 2019 Agena Reminers Revisiting Cache Lab Caching Review Blocking to reuce cache misses Cache alignment Reminers Due Dates Cache Lab (Thursay 3/7) Miterm Exam

More information

You Can Do That. Unit 16. Motivation. Computer Organization. Computer Organization Design of a Simple Processor. Now that you have some understanding

You Can Do That. Unit 16. Motivation. Computer Organization. Computer Organization Design of a Simple Processor. Now that you have some understanding .. ou Can Do That Unit Computer Organization Design of a imple Clou & Distribute Computing (CyberPhysical, bases, Mining,etc.) Applications (AI, Robotics, Graphics, Mobile) ystems & Networking (Embee ystems,

More information

DEVELOPMENT OF DamageCALC APPLICATION FOR AUTOMATIC CALCULATION OF THE DAMAGE INDICATOR

DEVELOPMENT OF DamageCALC APPLICATION FOR AUTOMATIC CALCULATION OF THE DAMAGE INDICATOR Mechanical Testing an Diagnosis ISSN 2247 9635, 2012 (II), Volume 4, 28-36 DEVELOPMENT OF DamageCALC APPLICATION FOR AUTOMATIC CALCULATION OF THE DAMAGE INDICATOR Valentina GOLUBOVIĆ-BUGARSKI, Branislav

More information

An Introduction of BOM Modeling Framework

An Introduction of BOM Modeling Framework An Introuction of BOM Moeling Framework Qiang He, Ming-xin Zhang, an Jian-xing Gong Astract Component ase moeling has een a research hotpot in the area of Moeling an Simulation for a long time. In orer

More information

On the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems

On the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems On the Role of Multiply Sectione Bayesian Networks to Cooperative Multiagent Systems Y. Xiang University of Guelph, Canaa, yxiang@cis.uoguelph.ca V. Lesser University of Massachusetts at Amherst, USA,

More information

Finite Automata Implementations Considering CPU Cache J. Holub

Finite Automata Implementations Considering CPU Cache J. Holub Finite Automata Implementations Consiering CPU Cache J. Holub The finite automata are mathematical moels for finite state systems. More general finite automaton is the noneterministic finite automaton

More information

+ E. Bit-Alignment for Retargetable Code Generators * 1 Introduction A D T A T A A T D A A. Keen Schoofs Gert Goossens Hugo De Mant

+ E. Bit-Alignment for Retargetable Code Generators * 1 Introduction A D T A T A A T D A A. Keen Schoofs Gert Goossens Hugo De Mant Bit-lignment for Retargetable Coe Generators * Keen Schoofs Gert Goossens Hugo e Mant IMEC, Kapelreef 75, B-3001 Leuven, Belgium bstract When builing a bit-true retargetable compiler, every signal type

More information

Interior Permanent Magnet Synchronous Motor (IPMSM) Adaptive Genetic Parameter Estimation

Interior Permanent Magnet Synchronous Motor (IPMSM) Adaptive Genetic Parameter Estimation Interior Permanent Magnet Synchronous Motor (IPMSM) Aaptive Genetic Parameter Estimation Java Rezaie, Mehi Gholami, Reza Firouzi, Tohi Alizaeh, Karim Salashoor Abstract - Interior permanent magnet synchronous

More information

A Stochastic Process on the Hypercube with Applications to Peer to Peer Networks

A Stochastic Process on the Hypercube with Applications to Peer to Peer Networks A Stochastic Process on the Hypercube with Applications to Peer to Peer Networs [Extene Abstract] Micah Aler Department of Computer Science, University of Massachusetts, Amherst, MA 0003 460, USA micah@cs.umass.eu

More information

Power-Performance Trade-offs for Energy-Efficient Architectures: A Quantitative Study

Power-Performance Trade-offs for Energy-Efficient Architectures: A Quantitative Study In the Proc. of the Intl. Conf. on Computer Design (ICCD-02), Frieburg, March 2002 Power-Performance Trae-offs for Energy-Efficient Architectures: A Quantitative Stuy Hongbo Yang R. Govinarajan Guang R.

More information

SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH

SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway

More information

Evolutionary Optimisation Methods for Template Based Image Registration

Evolutionary Optimisation Methods for Template Based Image Registration Evolutionary Optimisation Methos for Template Base Image Registration Lukasz A Machowski, Tshilizi Marwala School of Electrical an Information Engineering University of Witwatersran, Johannesburg, South

More information

A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace

A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace A Classification of R Orthogonal Manipulators by the Topology of their Workspace Maher aili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S.

More information

A Study of the Relationship between Usability and Test Cases Precedence Based on a Formal Model for Activity Diagrams

A Study of the Relationship between Usability and Test Cases Precedence Based on a Formal Model for Activity Diagrams A Stuy of the Relationship between Usability an Test Cases Preceence Base on a Formal Moel for Activity Diagrams Pero José Lara Bercial Computer Systems Department Universia Europea e Mari Villaviciosa

More information

WATER MIST SPRAY MODELLING WITH FDS

WATER MIST SPRAY MODELLING WITH FDS PROCEEDINGS, Fire an Evacuation Moeling Technical Conference 0 Baltimore, Marylan, August 5-6, 0 WATER MIST SPRAY MODELLING WITH FDS Simo Hostikka, Jukka Vaari, Topi Sikanen, Antti Paajanen VTT Technical

More information

Multimodal Stereo Image Registration for Pedestrian Detection

Multimodal Stereo Image Registration for Pedestrian Detection Multimoal Stereo Image Registration for Peestrian Detection Stephen Krotosky an Mohan Trivei Abstract This paper presents an approach for the registration of multimoal imagery for peestrian etection when

More information

Kinematic Analysis of a Family of 3R Manipulators

Kinematic Analysis of a Family of 3R Manipulators Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,

More information

A Cost Model For Nearest Neighbor Search. High-Dimensional Data Space

A Cost Model For Nearest Neighbor Search. High-Dimensional Data Space A Cost Moel For Nearest Neighbor Search in High-Dimensional Data Space Stefan Berchtol University of Munich Germany berchtol@informatikuni-muenchene Daniel A Keim University of Munich Germany keim@informatikuni-muenchene

More information

Nearest Neighbor Search using Additive Binary Tree

Nearest Neighbor Search using Additive Binary Tree Nearest Neighbor Search using Aitive Binary Tree Sung-Hyuk Cha an Sargur N. Srihari Center of Excellence for Document Analysis an Recognition State University of New York at Buffalo, U. S. A. E-mail: fscha,sriharig@cear.buffalo.eu

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpenCourseWare http://ocw.mit.eu 6.854J / 18.415J Avance Algorithms Fall 2008 For inormation about citing these materials or our Terms o Use, visit: http://ocw.mit.eu/terms. 18.415/6.854 Avance Algorithms

More information

Change Patterns and Change Support Features in Process-Aware Information Systems

Change Patterns and Change Support Features in Process-Aware Information Systems hange Patterns an hange Support eatures in -Aware Information Systems arbara Weber 1,, Stefanie Rinerle 2, an Manfre Reichert 3 1 Quality ngineering Research Group, University of Innsbruck, Austria arbara.weber@uibk.ac.at

More information

Considering bounds for approximation of 2 M to 3 N

Considering bounds for approximation of 2 M to 3 N Consiering bouns for approximation of to (version. Abstract: Estimating bouns of best approximations of to is iscusse. In the first part I evelop a powerseries, which shoul give practicable limits for

More information

Feature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory

Feature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory Feature Extraction an Rule Classification Algorithm of Digital Mammography base on Rough Set Theory Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative

More information

An Adaptive Routing Algorithm for Communication Networks using Back Pressure Technique

An Adaptive Routing Algorithm for Communication Networks using Back Pressure Technique International OPEN ACCESS Journal Of Moern Engineering Research (IJMER) An Aaptive Routing Algorithm for Communication Networks using Back Pressure Technique Khasimpeera Mohamme 1, K. Kalpana 2 1 M. Tech

More information