Received: September 24, Research Article. pubs.acs.org/synthbio

Size: px
Start display at page:

Download "Received: September 24, Research Article. pubs.acs.org/synthbio"

Transcription

1 wdb ACSJCA JCA..65/W Unicode research.3f (R3.6.i:32 2. alpha 39) 25/7/5 :3: PROD-JCAVA rq_ /3/26 7:52:52 JCA-DEFAULT pubs.acs.org/synthbio Cheical Reaction Networks for Coputing Polynoials 2 Sayed Ahad Salehi,* Keshab K. Parhi, and Marc D. Riedel 3 Departent of Electrical and Coputer Engineering, University of Minnesota, Minneapolis, Minnesota 5555, United States ABSTRACT: Cheical reaction networks (CRNs) provide a 5 fundaental odel in the study of olecular systes. Widely used 6 as foralis for the analysis of cheical and biocheical systes, 7 CRNs have received renewed attention as a odel for olecular coputation. This paper deonstrates that, with a new encoding, 9 CRNs can copute any set of polynoial functions subject only to the liitation that these functions ust ap the unit interval to itself. These polynoials can be expressed as linear cobinations of 2 Bernstein basis polynoials with positive coefficients less than or 3 equal to. In the proposed encoding approach, each variable is represented using two olecular types: a type- and a type-. The value is the ratio of the concentration of type- olecules to 5 the su of the concentrations of type- and type- olecules. The proposed encoding naturally exploits the expansion of a 6 power-for polynoial into a Bernstein polynoial. Molecular encoders for converting any input in a standard representation to 7 the fractional representation as well as decoders for converting the coputed output fro the fractional to a standard representation are presented. The ethod is illustrated first for generic CRNs; then, an exaple is apped to DNA strand- 9 displaceent reactions. 2 KEYWORDS: olecular coputing, polynoials, DNA strand-displaceent reaction, ass-action kinetics 2 t has long been recognized that, viewed fro a atheatical 22 I standpoint, a set of cheical reactions can exhibit rich 23 dynaical behavior. On the coputational front, there has 2 been a wealth of research into efficient ethods for siulating 25 cheical reactions, ranging fro ordinary differential equations 26 (ODEs) 2 to stochastic siulation. 3 On the atheatical front, 27 entirely new branches of theory have been developed to 2 characterize cheical dynaics. The idea of coputation 29 directly with cheical reactions, as opposed to writing 3 coputer progras to analyze cheical systes, dates back 3 to the seinal work of Adlean. 5 In this context, a cheical 32 reaction network (CRN) transfors input concentrations of 33 olecular types into output concentrations and thus iple- 3 ents coputation. It should be noted that the equilibriu 35 concentrations of the output olecules are considered as the 36 coputed output of the syste. 37 The question of the coputational power of cheical 3 reactions has been considered by several authors. Magnasco 39 deonstrated that cheical reactions can copute anything that digital circuits can copute. 6 Soloveichik et al. deonstrated that cheical reactions are Turing Universal, 2 eaning that they can copute anything that a coputer 3 algorith can copute. 7 This work was applicable to a discrete, stochastic odel of cheical kinetics. The coputation is 5 probabilistic; the total probability of error of the coputation 6 can be ade arbitrarily sall (but not zero). 7 Either explicitly or iplicitly, prior work has considered two types of encodings for the input and output variables of 9 CRNs:,9. The value of each variable corresponds to the 5 concentration of a specific olecular type; we will call this 5 the direct representation The value of each variable is represented by the difference 53 between the concentrations of a pair of olecular types; we will 5 call this the dual-rail representation In this paper, we introduce a new representation that we call 56 the fractional representation. A pair of olecular types is 57 assigned to each variable, e.g., (X,X ) for a variable x. The 5 value of the variable is deterined by the ratio 59 x [ X [ X + [ X () 6 Evidently, the value is confined to the unit interval [,. The proposed encoding ethod is inspired by prior work in designing stochastic circuits. 2,5 Such circuits operate on randoized bit streas with the values of variables represented as the fraction of s versus s in the streas. In a sense, the ain contribution of this paper is the application of this theory fro stochastic circuit design to CRNs. On the basis of the fractional representation in eq, we propose a CRN fraework for coputing univariate polynoials that ap the unit interval [, to itself. We deonstrate that a CRN exists that coputes any such polynoial. The full syste consists of an encoder, the coputation CRNs, and a decoder, as shown in Figure. The encoder converts the input olecular type, X (for [X ), into two olecular types, X and X, such that Received: Septeber 2, f 7 75 XXXX Aerican Cheical Society A DOI:.2/acssynbio.5b63

2 ACS Synthetic Biology Figure. Whole syste perforing coputation in fractional representation. [ X [ X [ X + [ X 76 The decoder converts the ratio of two olecular types, Y and 77 Y, into a single olecular type, Y, as the final output such that [ Y [ Y [ Y + [ Y 7 We describe the design of the encoder and decoder in the 79 Encoding and Decoding section. We first illustrate the coputation CRN block with a siple exaple. Consider the following CRN X + X S + X + X X + X 2S + X + X X + X S2 + X + X 2 (a),,,,,,,, 2 2, 2, 2 2, 2, Y Y 3 (b) Set the initial concentrations as [ B,.25nM [ B,.75 [ B.75nM b, [ B, + [ B, [ B,.75nM [ B,.25 [ B.25nM b, [ B, + [ B, [ B 2,.5nM [ B2,.5 [ B.5nM b2 2, [ B2, + [ B2, Although not obvious, it ay be shown that this CRN 6 coputes the function x x x + 7 (2) where x. 9 Note that any unit could have been used in this paper for the 9 olecular concentrations; nm has been used due to the 9 practical utility. 92 The CRN is coposed of two sets of reactions: the three 93 reactions in group (a) are referred as control generating 9 reactions, and the six reactions in group (b) represent the 3 2 transferring reactions. The control generating reactions generate the olecules that control the transferring reactions (siilar to the way that the control bits select outputs fro inputs with ultiplexors in electronic circuits). However, the control olecules represent analog values and transfer inputs to outputs proportionally. We note that the transferring reactions are conceptually siilar to the olecular reactions proposed in ref 3 for ipleenting Markov Chains. We provide details regarding the synthesis ethod in the Synthesizing CRNs for Coputing Polynoials section. Here, we siply note that, given a polynoial y(x), the first step is to convert it to its Bernstein polynoial equivalent g(x). For the polynoial y(x) in eq 2 3 g() x x + x x + x [( ) [2 ( ) (A discussion of the ath behind this is given in the Proof Based on the Mass-Action Kinetics section.) Note that the coefficients of the Bernstein polynoial correspond to the values of b i for i,,2. These values are used to initialize the olecular types B i, and B i, for i,,2. In fact, coputing with cheical reaction networks consists of two parts. First, choose a CRN as a eans of building the dynaical syste. Second, siulate a purposefully chosen dynaical syste to equilibriu. By introducing the B i, and B i, species, the concentrations of which are tie-invariant and fixed to what would have been rate constants, we propose changes to the first part that result in the sae dynaical syste siulated in the second part. Suppose we want to evaluate y(x) at x.5. We would initialize X X.5 nm such that x [ X.5 [ X + [ X (3) () We would set the initial concentration of the other types to zero. The control generating reactions use X and X to produce the control olecules S, S, and S 2, and transferring reactions use control olecules to copute the output. The output value, y(x), is coputed as the ratio of the final concentrations of Y and Y, i.e., x [ Y [ Y + [ Y (5) The siulation results for evaluating this exaple at x.5 using a continuous ass-action kinetics odel are shown in Figure 2. As tie t, the ratio [ Y( t) [ Y( t) + [ Y( t) f2 35 approaches the correct value of y(.5) RESULTS AND DISCUSSION 37 Representation. In our ethod, the Bernstein representa- 3 tion of a polynoial is a key eleent. We briefly describe the 39 relevant atheatics. The faily of n + polynoials of the for n i ni B x in(), x( x), i,..., n i (7) are called Bernstein basis polynoials of degree n. A linear cobination of Bernstein basis polynoials of degree n, (6) 2 3 B DOI:.2/acssynbio.5b63

3 ACS Synthetic Biology Figure 2. Siulation results for the CRN ipleenting the polynoial x x x + at x.5. These were obtained fro an ODE siulation of the ass-action kinetics. n g() x b B () x in, in, 5 i () 6 is a Bernstein polynoial of degree n. The b i,n s are called 7 Bernstein coefficients. Polynoials are usually represented in power for, i.e., x a x n in, i 9 i (9) 5 We can convert such a power-for polynoial of degree n into 5 a Bernstein polynoial of degree n. The conversion fro the 52 power-for coefficients, a i,n, to the Bernstein coefficients, b i,n, is 53 a closed-for expression () i i j bin, ajn,, i n n j () j 5 () 55 For a proof of this, the reader is referred to ref. 56 Generally speaking, a power-for polynoial of degree n can 57 be converted into an equivalent Bernstein polynoial of degree 5 greater than or equal to n. The coefficients of a Bernstein 59 polynoial of degree + ( n) can be derived fro the 6 Bernstein coefficients of an equivalent Bernstein polynoial of 6 degree as b, i i i b + i, bi, + bi, i + + b, i + 62 () 63 Again, for a proof, the reader is referred to ref. 6 By encoding the values of variables as the ratio of the 65 concentrations of two olecular types, x [ X [ X + [ X 66 we can only represent nubers between and. Accordingly, 67 our ethod synthesizes functions that ap the unit interval 6 [, onto itself. The ethod can also synthesize functions that 69 ap the unit interval to the negative unit interval [,. This coputes the negative of a function that aps the unit interval to itself. As was shown in Exaple, the coefficients of the polynoials that we copute are also represented in this fractional for. Fortunately, Qian et al. proved that any polynoial that aps the unit interval onto the unit interval can be converted into a Bernstein polynoial with all coefficients in the unit interval. 5 Synthesizing CRNs for Coputing Polynoials. In this section, we present a systeatic ethodology for synthesizing CRNs that can copute polynoials. As discussed in the previous section, we assue that the target polynoial is given in Bernstein for with all coefficients in the unit interval. The ethod is coposed of two parts, designing the CRN and initializing certain types to specific values, as discussed in the following section. Designing the CRN. The CRN reactions consist of two sets of reactions that we call the control generating reactions and the transferring reactions. First, consider the control generating reactions. When our proposed CRN is coputing a polynoial of degree, each control generating reaction should have reactants. The reactions consist of all possible cobinations of olecules chosen fro X and X. These ( + ) reactions are listed in eq 2. In the first reaction of eq 2, all reactants are chosen fro olecules of X and produce olecules of S. In the second, ( ) olecules of X and one olecule of X are cobined to produce olecules of S. Siilarly, the (i + )st reaction contains i olecules of X and ( i) olecules of X. The total nuber of possible reactions, as shown in eq 2, is ( + ). X S + X X + ( ) X S + X + ( ) X 2 X + ( 2) X S + 2 X + ( 2) X 2 2 ix + ( i) X S + X + ix + ( i) X i i, X S + X (2) A degree Bernstein polynoial has ( + ) Bernstein coefficients. We consider ( + ) pairs of types (B j,, B j, ) for j,,..., to represent these coefficients. The transferring reactions produce the final output, Y or Y, fro the products of the control generating reactions, the S j s. They do so proportionally to the Bernstein coefficients. S j goes to Y if it cobines with B j, and goes to Y if it cobines with B j,. Accordingly, there are 2( + ) transferring reactions as listed in eq C DOI:.2/acssynbio.5b63

4 ,,,,,,,,,,,, Y Y 2 (3) 2 The nuber of required reactions for the ipleentation of 22 a Bernstein polynoial of degree is equal to We also t 23 need olecular types listed in Table. 2 Initialization. We initialize the pair (B j,,b j, ) according to 25 the Bernstein coefficients b j,, i.e., we have [ Bj, bj, [ Bj, + [ Bj, 26 () 27 For siplicity, we initialize B j, and B j, such that the su 2 [B j, +[B j, is the sae arbitrary value for all js. Call the su 29 [B j,+[b j, B for all js. In fact, we first calculate the values of 22 Bernstein coefficients using eq and then initialize B j, and B j, 22 as [B j, B b j, and [B j, B[B j,. (For the exaple in 222 the introduction, we considered B nm.) 223 We initialize the corresponding olecular type in the input 22 pair (X, X ) based on the value x in at which the polynoial is 225 to be evaluated, i.e., [ X xin 226 [ X + [ X (5) All of the other interediate types, i.e., the S 227 j s as well as the 22 output types Y and Y, are initialized to zero. Proof Based on the Mass-Action Kinetics. We use an 229 ordinary differential odel of the ass-action kinetics to prove the correctness of our proposed CRN design. The control generating reactions (eq 2) produce type S 232 j whereas the transferring reactions (eq 3) consue the. 233 ACS Synthetic Biology Table. Nuber of Required Molecular Types in the Proposed CRN for a Polynoial of Degree represented olecular type 23 Therefore, the ODEs for type S j are nuber of olecular types X, X 2 S j + B i,, B i, 2 +2 Y, Y 2 total 3 +7 d[ S d[ S d[ S d[ S,,,, [ X [ B [ S [ B [ S [ X [ S ([ B + [ B ),,,, X [ [ X [ B [ S [ B [ S X [ [ X [ S([ B + [ B ) [ X [ X [ Bk, [ Sk [ Bk,[ Sk k k k [ X [ X [ S ([ B + [ B ) k k k, k, k k k At equilibriu, copute the S j s as [ S j,,,, [ X [ B [ S [ B [ S [ X [ S ([ B + [ B ) d[ Sj j [ X [ j j X [ B + [ B for all js. Accordingly, we can j j, j, (6) 237 Now, we write the ODEs for the output types Y and Y. On the basis of the transferring reactions (eq 3), we have d[ Y [ B,[ S + [ B,[ S + + [ B,[ S [ Y d[ Y [ B,[ S + [ B,[ S + + [ B,[ S [ Y (7) d[ Y At equilibriu, and d[ Y [ Y [ B [ S + [ B [ S + + [ B [ S,,, [ Y [ B [ S + [ B [ S + + [ B [ S,,, () According to the fractional encoding, the output value y is calculated as y [ Y [ Y + [ Y {[ B [ S + [ B [ S [ B [ S },,, {([ B [ S + [ B [ S [ B [ S ),,, + ([ B [ S + [ B [ S + + [ B [ S )},,, (9) With the assuption that ([B j, +[B j, ) B for all js, we have D DOI:.2/acssynbio.5b63

5 ACS Synthetic Biology y {[ B,[ S + [ B,[ S + + [ B,[ S} {([ B, + [ B,)[ S + ([ B, + [ B,)[ S + + ([ B + [ B )[ S },, [ B [ S + [ B [ S + + [ B [ S,,, [ B [ S j j, j B( [ S) B([ S + [ S + + [ S ) j j 27 (2) 2 By substituting [S i fro eq 6, j j j [ X [ X [ B j j, B y j j [ X j [ X B j B 29 (2) We know that + 25 j [ X j [ X j ([ X [ X) j due 25 to binoial theore; therefore, the denoinator can be 252 replaced by ([X +[X ). y [ B j j, B ([ X + [ X) j j j j [ X [ X [ B j j j, B j [ X [ X ([ X + [ X) b j j j j, ( x) x j 253 (22) 25 Eq 22 is exactly the expression for a Bernstein polynoial 255 representation of degree for y(x). Thus, this CRN coputes 256 y(x). Note that y is finite because [X and [X 257. Therefore, for every initial state of interest, our proposed 25 CRN coputes a stable equilibriu state. 259 Note that, in general, all the rate constants in our CRNs are 26 assued to be equal to each other. More precisely, on the basis 26 of the proof, there are three categories of reactions with respect 262 to the rate constants: the control generating reactions, the 263 transferring reactions, and the last two annihilation reactions of 26 the transferring reactions. All reactions in each of these 265 categories are required to have the sae rate constant. 266 Encoding and Decoding. Our proposed CRNs perfor 267 coputations on the fractional representation in eq. In this 26 section, we present cheical reactions that convert between 269 this representation and a direct representation, where the 27 value of each variable is represented directly the concentration 27 of a olecular type. 272 Encoding. Let a olecular type X denote the direct 273 representation of the input value x and (X,X ) denote the 27 olecular pair for its fractional representation. Assue that the 275 total concentration of X and X is nm. Then, we have [ X [ X [ X [ X [ X + [ X [ X [ X [ X + [ X nm (23) Because the concentration values for X and X are the sae and subsequent stages do not consue the, type X can be directly used as type X in the fractional representation. For generating X, we ust ipleent subtraction, which is a little tricky. We designed the following reactions (eq 2) for this task. T is initialized to nm, and B is an interediate olecular type with an initial value of zero. T X + T B + X X X + B X (2) For these reactions, the ODEs are d[ X d[ B [ T [ B[ X [ X [ X [ B[ X and at equilibriu, we have d[ X [ X [ T [ B[ X d[ B [ X [ B[ X By substituting [B[X fro eq 27 to 26, we have [ X [ T [ X (25) (26) (27) (2) Eq 2 is valid when [T [X. Because [X cannot be negative, for [T [X, [X. Thus, the equilibriu ODE solution for these reactions is [ T [ X if [ T [ X [ X if [ T [ X (29) If T is initialized to nm, the reactions in 2 copute [X [X. Thus, the reactions in 2 encode the input concentration of X as a pair of concentrations (X,X ) in a fractional representation. Here, in fact, X can substitute for X, as discussed above. Note that the concentration of X is initialized to zero at the outset. Decoding. For the output of our olecular coputing syste, we convert the fractional representation back to a direct representation. If the fractional output is represented by the pair of olecules (Y,Y ) and the direct output by Y, we have [ Y [ Y [ Y + [ Y (3) In other words, we need to copute the suation of [Y and [Y and then the ratio of [Y over this suation. For this coputation, we use the reactions proposed in ref 6. We will show that the reactions in 3 copute [Y [Y +[Y E DOI:.2/acssynbio.5b63

6 32 ACS Synthetic Biology and the reactions in 32 copute the final output [ Y [ Y [ Y [ Y [ Y + [ Y Y Y + Y Y Y + Y. 33 Y (3) Y Y + Y 3 Y + Y Y (32) 35 According to the ODEs of the reactions in 3, we have d[ Y [ Y + [ Y [ Y 36 and at equilibriu d[ Y [ Y [ Y + [ Y 37 (33) 3 Siilarly, for the reactions in 32, we have d[ Y [ Y [ Y[ Y [ B,.6nM [ B,.2nM [ B,.3nM [ B,.5nM [ B 2,.5nM [ B 2,.3nM [ B 3,.2nM [ B 3,.6nM (37) We ap our design to DNA strand-displaceent reactions and evaluate it for different input values between and. The values of y coputed by these CRNs are plotted against x and shown with the target polynoial y(x) in Figure 3. Table 2 tabulates the coputed values of y(x) and the corresponding errors f3t and the equilibriu value of [Y is d[ Y [ Y [ Y [ Y 32 [ Y [ Y + [ Y (3) 32 Therefore, the set of reactions in 3 and 32 ipleent the 322 decoding of the output. 323 METHODS AND MATERIALS DNA Ipleentation. The proposed CRN for coputing 32 polynoials is general in the sense that it can be ipleented by any cheical or biocheical syste with ass-action kinetics. As a practical ediu, we choose DNA strand- displaceent reactions. Indeed, Soleveichik et al. deonstrated that DNA strand-displaceent reactions can eulate the 33 kinetics of any CRN.7 They presented a software tool that 33 aps cheical CRNs to DNA reactions. 332 We illustrate with the following target function x + x x + x 333 (35) 33 The CRN includes reactions for the encoder, coputation, 335 and decoder parts. The Bernstein polynoial for y(x) is 2 g() x x + x x + x x + x [( ) 3 5 [3 ( ) 2 3 [3 2 ( ) (36) 337 Fro the Bernstein coefficients, we initialize the types (B i,,b i, ) 33 for i,,2,3 as Figure 3. Values of y(x) coputed by a DNA ipleentation of proposed CRN. Blue line: target y(x). Red stars: coputed by DNA reactions. For the DNA ipleentation, we used the paraeters based 36 on the exaples in ref 7. The axiu strand displaceent 37 rate constant is q ax 6 M s, and the initial concentration 3 of auxiliary coplexes is set to C ax 5 M. If the 39 concentration of auxiliary species, C ax, is uch larger than the 35 axiu concentration of other species (i.e., in proposed 35 CRNs, C ax nm), then, as described in ref 7, we can 352 assue that over the siulation tie the auxiliary concen- 353 trations reain effectively constant. Therefore, DNA reactions 35 correctly eulate the CRN independent of the auxiliary 355 concentrations. Note that, for this assuption, the siulation 356 tie and reaction rates should not be very large values Although these requireents have been et in our siulations, 35 errors exist. 359 As we describe later, the error stes fro the fact that each 36 olecular reaction is ipleented by a sequence of DNA 36 F DOI:.2/acssynbio.5b63

7 f ACS Synthetic Biology Table 2. Accuracy of a DNA Strand Displaceent Ipleentation of a CRN Coputing x + x x + x 3 Using the Proposed Method 362 strand displaceent reactions; the concentrations of auxiliary 363 olecules, C ax, is bounded. In fact, if C ax, the DNA 36 siulation results converge to ODE siulation results. Further 365 details concerning the analysis of errors when ipleenting 366 CRNs with DNA strand displaceent reactions, as well as a 367 proof of convergence of a DNA ipleentation to the target 36 CRN, can be found in the Supporting Inforation of refs and. 37 Using the ethod presented in ref 7, each cheical reaction 37 with reactants and nonzero products can be eulated by DNA strand displaceent reactions. For exaple, biolec- 373 ular reactions are apped to three DNA strand displaceent 37 reactions. To illustrate this, we present a sequence of DNA 375 strand displaceent reactions that are used to siulate a 376 biolecular reaction with three products. 377 As described in refs 7 and, three DNA reactions, RR3 37 shown in Figure, ipleent the olecular reaction k i A + B A + B + C. Uniolecular reactions without prod- 379 uct, e.g., Y, can be ipleented by a single DNA strand f5 3 displaceent reaction. The DNA reaction shown in Figure 5 x in coputed y(x) error (%) eulates the reaction A k i. The toehold of strand A binds to Figure 5. DNA strand displaceent reaction that eulates reaction A ki. its copleentary part of gate olecule G and produces 32 double strand W and single strand W 2. Because W and W 2 33 cannot bind together, the reaction is unidirectional. 3 Table 3 suarizes the nuber of cheical and DNA strand displaceent reactions for each group in our proposed 36 ethod for coputing the polynoial of degree. 37 Table 3. Nuber of Cheical and DNA Strand- Displaceent Reactions for Each Group of the Proposed CRN for Coputation of a Bernstein Polynoial of Degree group of reactions type of cheical reaction nuber of cheical reactions nuber of DNA reactions control reactions with + ( + ) ( + ) generating reactants transferring biolecular (2 + 2) 3 uniolecular 2 2 without product total CONCLUSIONS We have introduced a new encoding for coputation with 39 CRNs: the value corresponding to each variable consists of the 39 ratio of the concentration of a olecular type to the su of two 39 types. On the basis of this fractional representation, we 392 proposed a ethod for coputing arbitrary polynoials that 393 ap the unit interval [, to itself or to [,. This is a rich 39 class of functions. 395 Coputation of polynoials with cheical kinetics has been 396 attepted before by Buisan et al. 6 Copared to our ethod, 397 their ethod requires fewer olecular types and fewer 39 reactions ( olecular types and 3 olecular reactions for t3 k i Figure. DNA strand displaceent reactions that eulate reaction A + B A + B + C. G DOI:.2/acssynbio.5b63

8 a coplete polynoial of degree ). However, unlike our approach, their CRNs are dependent on reaction rates. In fact, 2 for each coefficient of the desired polynoial, they need a 3 distinct reaction rate. This is unrealistic. Note that our approach only requires a single rate. 5 Soloveichik et al., 7 as well as earlier work, 6,9,2 attepted to 6 achieve Turing universality with cheical reactions. Although it 7 is possible to copute polynoials with their CRNs, they did not provide a systeatic fraework for doing so. 9 The fractional representation that we propose is a non- standard representation. However, we note that it is siilar to encodings found in nature. Many biological systes have 2 species with two distinct states. For exaple, it is coon for 3 an enzye to have active and inactive states. The ratio of the concentrations of the two states is a eaningful value. This is 5 quite analogous to our representation. 6 Clearly, the priary interest of this work is theoretical. CRNs 7 are a fundaental odel of coputation, abstract yet conforing to the physical behavior of cheical systes. 9 Delineating the range of behaviors of such systes has 2 intellectual erit. These results ay also have practical 2 applications. 22 Control theory has played a rearkable role in atheatical 23 biology, providing a fraework for odeling and designing the 2 dynaic behavior of systes such as biological oscillators Polynoials play a central role in control and oscillation. In 26 fact, the transfer function of a control syste, which is the ratio 27 of its output to its input in the Laplace doain, is the ratio of Az () a+ az++ anz two polynoials, i.e., H() z n. 2 Non- 2 Bz () b+ bz++ bz 29 linear feedback in oscillators can be ipleented by 3 polynoials. 25,26 3 Practitioners in synthetic biology are striving to create 32 ebedded controllers, viruses and bacteria that are 33 engineered to perfor useful olecular coputation in situ 3 where needed, for instance, for drug delivery and biocheical 35 sensing. Such ebedded controllers ay be called upon to 36 perfor coputation such as filtering or signal processing. 37 Coputing polynoial functions is at the core of any of 3 these coputational tasks. 39 In future work, we will attept to optiize the CRNs that we propose for coputing polynoials, reducing the nuber of olecular types as well as the nuber of reactions. We will 2 also attept to generalize the ethod to copute a wider class 3 of operations. ACS Synthetic Biology AUTHOR INFORMATION 5 Corresponding Author 6 *E-ail: saleh22@un.edu. 7 Notes The authors declare no copeting financial interest. 9 ACKNOWLEDGMENTS 5 The authors gratefully acknowledge nuerous constructive 5 coents of the reviewers. This research is supported by the 52 National Science Foundation Grant CCF REFERENCES 5 () Horn, F., and Jackson, R. (972) General Mass Action Kinetics. 55 Arch. Ration. Mech. Anal. 7, (2) E rdi, P., and To th, J. (99) Matheatical Models of Cheical 57 Reactions: Theory and Applications of Deterinistic and Stochastic 5 Models, Manchester University Press. (3) Gillespie, D. (977) Exact Stochastic Siulation of Coupled 59 6 () Strogatz, S. (99) Nonlinear Dynaics and Chaos with (5) Adlean, L. (99) Molecular Coputation of Solutions to 6 65 (6) Magnasco, M. O. (997) Cheical Kinetics is Turing Universal (7) Soloveichik, D., Cook, M., Winfree, E., and Bruck, J. (2) () Chen, H., Doty, D., and Soloveichik, D. (22) Deterinistic (9) Chen, H., Doty, D., and Soloveichik, D. (2) Rate Cheical Reactions. J. Phys. Che. (25), Applications to Physics, Biology, Cheistry, and Engineering, Perseus Books. Cobinatorial Probles. Science 266, 22. Phys. Rev. Lett. 7 (6), 993. Coputation with Finite Stochastic Cheical Reaction Networks. Nat. Coput. 7 (), Function Coputation with Cheical Reaction Networks. DNA Coputing and Molecular Prograing, LNCS, Springer, Vol. 733, pp 22. Independent Coputation in Continuous Cheical Reaction Networks. Conference on Innovations in Theoretical Coputer Science, () Gaines, B. R. (967) Stochastic Coputing. In Proceedings of 79 AFIP spring join coputer conference, ACM, pp 956. () Qian, W., and Riedel, M. D. (2) The Synthesis of Robust Polynoial Arithetic with Stochastic Logic. Design Autoation 2 Conference, (2) Qian, W., Li, X., Riedel, M. D., Bazargan, K., and Lilja, D. J. (2) An Architecture for Fault-Tolerant Coputation with 5 Stochastic Logic. IEEE Trans. Coput. 6 (No. ), (3) Salehi, S. A., Riedel, M. D., and Parhi, K. K. (25) Markov 7 Chain Coputations using Molecular Reactions. Proc. IEEE Interna- tional Conference on Digital Signal Processing (DSP), () Farouki, R., and Rajan, V. (97) On the Nuerical Condition 9 of Polynoials in Bernstein For. Coputer-Aided Geoetric Design 9 (3), (5) Qian, W., Riedel, M. D., and Rosenberg, I. (2) Unifor 93 Approxiation and Bernstein Polynoials with Coefficients in the 9 Unit Interval. European J. Cob. 32 (3), (6) Buisan, H. J., ten Eikelder, H. M. M., Hilbers, P. A. J., and 96 Liekens, A. M. L. (29) Coputing Algebraic Functions with 97 Biocheical Reaction Networks. Artif. Life. 5 (), (7) Soloveichik, D., Seelig, G., and Winfree, E. (2) DNA as a 99 Universal Substrate for Cheical Kinetics. Proc. Natl. Acad. Sci. U. S. A. 5 7, () Chen, Y., Dalchau, N., Srinivas, N., Phillips, A., Cardelli, L., 52 Soloveichik, D., and Seelig, G. (23) Prograable cheical 53 controllers ade fro DNA. Nat. Nanotechnol., (9) Liekens, A. M. L., and Fernando, C. T. (27) Turing coplete 55 catalytic particle coputers. In Proceedings of Unconventional 56 Coputing Conference 6, (2) Angluin, D., Aspnes, J., and Eisenstat, D. (26) Fast 5 coputation by population protocols with a leader. Technical Report 59 YALEU/DCS/TR-35, Yale University Departent of Coputer 5 Science. 5 (2) IMA Theatic Year on Control Theory and its Applications; 52 Workshop: Biological Systes and Networks, Noveber 62 (25) (22) Chandra, F. A., Buzi, G., and Doyle, J. C. (2) Glycolytic 55 Oscillations and Liits on Robust Efficiency. Science 333 (639), (23) Iglesias, P. A., and Ingalls, B. P. (2) Control Theory and 5 Systes Biology, MIT Press. 59 (2) Dorf, R. C., and Bishop, R. H. (2) Modern Control Systes, 52 9th ed., Prentice Hall. 52 (25) Stan, G., and Sepulchre, R. (27) Analysis of interconnected 522 oscillators by dissipativity theory. IEEE Trans. Auto. Control 52 (2), (26) Agrawal, D. K., Franco, E., and Schulan, R. (25) A self- 525 regulating bioolecular coparator for processing oscillatory signals. J. 526 R. Soc., Interface 2 (), H DOI:.2/acssynbio.5b63

Chemical Reaction Networks for Computing Polynomials

Chemical Reaction Networks for Computing Polynomials Chemical Reaction Networks for Computing Polynomials Ahmad Salehi, Keshab Parhi, and Marc D. Riedel University of Minnesota Abstract. Chemical reaction networks (CRNs) are a fundamental model in the study

More information

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,

More information

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential

More information

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving

More information

Interactive Markov Models of Evolutionary Algorithms

Interactive Markov Models of Evolutionary Algorithms Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary

More information

Explicit Approximate Solution for Finding the. Natural Frequency of the Motion of Pendulum. by Using the HAM

Explicit Approximate Solution for Finding the. Natural Frequency of the Motion of Pendulum. by Using the HAM Applied Matheatical Sciences Vol. 3 9 no. 1 13-13 Explicit Approxiate Solution for Finding the Natural Frequency of the Motion of Pendulu by Using the HAM Ahad Doosthoseini * Mechanical Engineering Departent

More information

Extension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels

Extension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels Extension of CSRSM for the Paraetric Study of the Face Stability of Pressurized Tunnels Guilhe Mollon 1, Daniel Dias 2, and Abdul-Haid Soubra 3, M.ASCE 1 LGCIE, INSA Lyon, Université de Lyon, Doaine scientifique

More information

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either

More information

Estimation of ADC Nonlinearities from the Measurement in Input Voltage Intervals

Estimation of ADC Nonlinearities from the Measurement in Input Voltage Intervals Estiation of ADC Nonlinearities fro the Measureent in Input Voltage Intervals M. Godla, L. Michaeli, 3 J. Šaliga, 4 R. Palenčár,,3 Deptartent of Electronics and Multiedia Counications, FEI TU of Košice,

More information

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter

More information

Kernel Methods and Support Vector Machines

Kernel Methods and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic

More information

Modeling Chemical Reactions with Single Reactant Specie

Modeling Chemical Reactions with Single Reactant Specie Modeling Cheical Reactions with Single Reactant Specie Abhyudai Singh and João edro Hespanha Abstract A procedure for constructing approxiate stochastic odels for cheical reactions involving a single reactant

More information

CHAPTER 19: Single-Loop IMC Control

CHAPTER 19: Single-Loop IMC Control When I coplete this chapter, I want to be able to do the following. Recognize that other feedback algoriths are possible Understand the IMC structure and how it provides the essential control features

More information

Symbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm

Symbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat

More information

The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate

The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate The Siplex Method is Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010 Abstract In this note we prove that the classic siplex ethod with the ost-negativereduced-cost

More information

Convexity-Based Optimization for Power-Delay Tradeoff using Transistor Sizing

Convexity-Based Optimization for Power-Delay Tradeoff using Transistor Sizing Convexity-Based Optiization for Power-Delay Tradeoff using Transistor Sizing Mahesh Ketkar, and Sachin S. Sapatnekar Departent of Electrical and Coputer Engineering University of Minnesota, Minneapolis,

More information

ma x = -bv x + F rod.

ma x = -bv x + F rod. Notes on Dynaical Systes Dynaics is the study of change. The priary ingredients of a dynaical syste are its state and its rule of change (also soeties called the dynaic). Dynaical systes can be continuous

More information

Ph 20.3 Numerical Solution of Ordinary Differential Equations

Ph 20.3 Numerical Solution of Ordinary Differential Equations Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing

More information

Low complexity bit parallel multiplier for GF(2 m ) generated by equally-spaced trinomials

Low complexity bit parallel multiplier for GF(2 m ) generated by equally-spaced trinomials Inforation Processing Letters 107 008 11 15 www.elsevier.co/locate/ipl Low coplexity bit parallel ultiplier for GF generated by equally-spaced trinoials Haibin Shen a,, Yier Jin a,b a Institute of VLSI

More information

BINARY COUNTING WITH CHEMICAL REACTIONS

BINARY COUNTING WITH CHEMICAL REACTIONS BINARY COUNTING WITH CHEMICAL REACTIONS ALEKSANDRA KHARAM, HUA JIANG, MARC RIEDEL, and KESHAB PARHI Electrical and Computer Engineering, University of Minnesota Minneapolis, MN 55455 http://cctbio.ece.umn.edu

More information

Envelope frequency Response Function Analysis of Mechanical Structures with Uncertain Modal Damping Characteristics

Envelope frequency Response Function Analysis of Mechanical Structures with Uncertain Modal Damping Characteristics Copyright c 2007 Tech Science Press CMES, vol.22, no.2, pp.129-149, 2007 Envelope frequency Response Function Analysis of Mechanical Structures with Uncertain Modal Daping Characteristics D. Moens 1, M.

More information

A note on the multiplication of sparse matrices

A note on the multiplication of sparse matrices Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani

More information

A method to determine relative stroke detection efficiencies from multiplicity distributions

A method to determine relative stroke detection efficiencies from multiplicity distributions A ethod to deterine relative stroke detection eiciencies ro ultiplicity distributions Schulz W. and Cuins K. 2. Austrian Lightning Detection and Inoration Syste (ALDIS), Kahlenberger Str.2A, 90 Vienna,

More information

EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS

EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS Jochen Till, Sebastian Engell, Sebastian Panek, and Olaf Stursberg Process Control Lab (CT-AST), University of Dortund,

More information

The Solution of One-Phase Inverse Stefan Problem. by Homotopy Analysis Method

The Solution of One-Phase Inverse Stefan Problem. by Homotopy Analysis Method Applied Matheatical Sciences, Vol. 8, 214, no. 53, 2635-2644 HIKARI Ltd, www.-hikari.co http://dx.doi.org/1.12988/as.214.43152 The Solution of One-Phase Inverse Stefan Proble by Hootopy Analysis Method

More information

Solving initial value problems by residual power series method

Solving initial value problems by residual power series method Theoretical Matheatics & Applications, vol.3, no.1, 13, 199-1 ISSN: 179-9687 (print), 179-979 (online) Scienpress Ltd, 13 Solving initial value probles by residual power series ethod Mohaed H. Al-Sadi

More information

About the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry

About the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry About the definition of paraeters and regies of active two-port networks with variable loads on the basis of projective geoetry PENN ALEXANDR nstitute of Electronic Engineering and Nanotechnologies "D

More information

The Weierstrass Approximation Theorem

The Weierstrass Approximation Theorem 36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined

More information

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents

More information

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words) 1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu

More information

Force and dynamics with a spring, analytic approach

Force and dynamics with a spring, analytic approach Force and dynaics with a spring, analytic approach It ay strie you as strange that the first force we will discuss will be that of a spring. It is not one of the four Universal forces and we don t use

More information

a a a a a a a m a b a b

a a a a a a a m a b a b Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice

More information

List Scheduling and LPT Oliver Braun (09/05/2017)

List Scheduling and LPT Oliver Braun (09/05/2017) List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)

More information

ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER

ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER IEPC 003-0034 ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER A. Bober, M. Guelan Asher Space Research Institute, Technion-Israel Institute of Technology, 3000 Haifa, Israel

More information

Solutions of some selected problems of Homework 4

Solutions of some selected problems of Homework 4 Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next

More information

Arithmetic Unit for Complex Number Processing

Arithmetic Unit for Complex Number Processing Abstract Arithetic Unit or Coplex Nuber Processing Dr. Soloon Khelnik, Dr. Sergey Selyutin, Alexandr Viduetsky, Inna Doubson, Seion Khelnik This paper presents developent o a coplex nuber arithetic unit

More information

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation

More information

Reducing Vibration and Providing Robustness with Multi-Input Shapers

Reducing Vibration and Providing Robustness with Multi-Input Shapers 29 Aerican Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June -2, 29 WeA6.4 Reducing Vibration and Providing Robustness with Multi-Input Shapers Joshua Vaughan and Willia Singhose Abstract

More information

CONTROL SYSTEMS, ROBOTICS, AND AUTOMATION Vol. IX Uncertainty Models For Robustness Analysis - A. Garulli, A. Tesi and A. Vicino

CONTROL SYSTEMS, ROBOTICS, AND AUTOMATION Vol. IX Uncertainty Models For Robustness Analysis - A. Garulli, A. Tesi and A. Vicino UNCERTAINTY MODELS FOR ROBUSTNESS ANALYSIS A. Garulli Dipartiento di Ingegneria dell Inforazione, Università di Siena, Italy A. Tesi Dipartiento di Sistei e Inforatica, Università di Firenze, Italy A.

More information

COS 424: Interacting with Data. Written Exercises

COS 424: Interacting with Data. Written Exercises COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well

More information

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes

More information

Complexity reduction in low-delay Farrowstructure-based. filters utilizing linear-phase subfilters

Complexity reduction in low-delay Farrowstructure-based. filters utilizing linear-phase subfilters Coplexity reduction in low-delay Farrowstructure-based variable fractional delay FIR filters utilizing linear-phase subfilters Air Eghbali and Håkan Johansson Linköping University Post Print N.B.: When

More information

Multiscale Entropy Analysis: A New Method to Detect Determinism in a Time. Series. A. Sarkar and P. Barat. Variable Energy Cyclotron Centre

Multiscale Entropy Analysis: A New Method to Detect Determinism in a Time. Series. A. Sarkar and P. Barat. Variable Energy Cyclotron Centre Multiscale Entropy Analysis: A New Method to Detect Deterinis in a Tie Series A. Sarkar and P. Barat Variable Energy Cyclotron Centre /AF Bidhan Nagar, Kolkata 700064, India PACS nubers: 05.45.Tp, 89.75.-k,

More information

A Markov Framework for the Simple Genetic Algorithm

A Markov Framework for the Simple Genetic Algorithm A arkov Fraework for the Siple Genetic Algorith Thoas E. Davis*, Jose C. Principe Electrical Engineering Departent University of Florida, Gainesville, FL 326 *WL/NGS Eglin AFB, FL32542 Abstract This paper

More information

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

e-companion ONLY AVAILABLE IN ELECTRONIC FORM OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer

More information

EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS

EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS Zhi-Wei Sun Departent of Matheatics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn Abstract In this paper we establish soe explicit

More information

arxiv: v1 [cs.ds] 3 Feb 2014

arxiv: v1 [cs.ds] 3 Feb 2014 arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/

More information

Research Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials

Research Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials Discrete Dynaics in Nature and Society Volue 202, Article ID 927953, pages doi:055/202/927953 Research Article Soe Forulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynoials Yuan He and

More information

Short Papers. Test Data Compression and Decompression Based on Internal Scan Chains and Golomb Coding

Short Papers. Test Data Compression and Decompression Based on Internal Scan Chains and Golomb Coding IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 1, NO. 6, JUNE 00 715 Short Papers Test Data Copression and Decopression Based on Internal Scan Chains and Golob Coding

More information

EE5900 Spring Lecture 4 IC interconnect modeling methods Zhuo Feng

EE5900 Spring Lecture 4 IC interconnect modeling methods Zhuo Feng EE59 Spring Parallel LSI AD Algoriths Lecture I interconnect odeling ethods Zhuo Feng. Z. Feng MTU EE59 So far we ve considered only tie doain analyses We ll soon see that it is soeties preferable to odel

More information

Chapter 1: Basics of Vibrations for Simple Mechanical Systems

Chapter 1: Basics of Vibrations for Simple Mechanical Systems Chapter 1: Basics of Vibrations for Siple Mechanical Systes Introduction: The fundaentals of Sound and Vibrations are part of the broader field of echanics, with strong connections to classical echanics,

More information

Explicit Analytic Solution for an. Axisymmetric Stagnation Flow and. Heat Transfer on a Moving Plate

Explicit Analytic Solution for an. Axisymmetric Stagnation Flow and. Heat Transfer on a Moving Plate Int. J. Contep. Math. Sciences, Vol. 5,, no. 5, 699-7 Explicit Analytic Solution for an Axisyetric Stagnation Flow and Heat Transfer on a Moving Plate Haed Shahohaadi Mechanical Engineering Departent,

More information

Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links

Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Tie-Varying Jaing Links Jun Kurihara KDDI R&D Laboratories, Inc 2 5 Ohara, Fujiino, Saitaa, 356 8502 Japan Eail: kurihara@kddilabsjp

More information

Ufuk Demirci* and Feza Kerestecioglu**

Ufuk Demirci* and Feza Kerestecioglu** 1 INDIRECT ADAPTIVE CONTROL OF MISSILES Ufuk Deirci* and Feza Kerestecioglu** *Turkish Navy Guided Missile Test Station, Beykoz, Istanbul, TURKEY **Departent of Electrical and Electronics Engineering,

More information

LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES

LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES Journal of Marine Science and Technology, Vol 19, No 5, pp 509-513 (2011) 509 LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES Ming-Tao Chou* Key words: fuzzy tie series, fuzzy forecasting,

More information

Research Article Rapidly-Converging Series Representations of a Mutual-Information Integral

Research Article Rapidly-Converging Series Representations of a Mutual-Information Integral International Scholarly Research Network ISRN Counications and Networking Volue 11, Article ID 5465, 6 pages doi:1.54/11/5465 Research Article Rapidly-Converging Series Representations of a Mutual-Inforation

More information

Direct numerical simulation of matrix diffusion across fracture/matrix interface

Direct numerical simulation of matrix diffusion across fracture/matrix interface Water Science and Engineering, 2013, 6(4): 365-379 doi:10.3882/j.issn.1674-2370.2013.04.001 http://www.waterjournal.cn e-ail: wse2008@vip.163.co Direct nuerical siulation of atrix diffusion across fracture/atrix

More information

Nonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy

Nonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy Storage Capacity and Dynaics of Nononotonic Networks Bruno Crespi a and Ignazio Lazzizzera b a. IRST, I-38050 Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I-38050 Povo (Trento) Italy INFN Gruppo

More information

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay

More information

are equal to zero, where, q = p 1. For each gene j, the pairwise null and alternative hypotheses are,

are equal to zero, where, q = p 1. For each gene j, the pairwise null and alternative hypotheses are, Page of 8 Suppleentary Materials: A ultiple testing procedure for ulti-diensional pairwise coparisons with application to gene expression studies Anjana Grandhi, Wenge Guo, Shyaal D. Peddada S Notations

More information

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x)

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x) 7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not

More information

HaarOrthogonalFunctionsBasedParameterIdentification ofwastewatertreatmentprocesswithdistributedparameters

HaarOrthogonalFunctionsBasedParameterIdentification ofwastewatertreatmentprocesswithdistributedparameters M. TODOROVA and T. PENCHEVA, Haar Orthogonal Functions Based, Che. Bioche. Eng. Q. 19 (3) 275 282 (2005) 275 HaarOrthogonalFunctionsBasedParaeterIdentification ofwastewatertreatentprocesswithdistributedparaeters

More information

Randomized Recovery for Boolean Compressed Sensing

Randomized Recovery for Boolean Compressed Sensing Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch

More information

Polygonal Designs: Existence and Construction

Polygonal Designs: Existence and Construction Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G

More information

On Rough Interval Three Level Large Scale Quadratic Integer Programming Problem

On Rough Interval Three Level Large Scale Quadratic Integer Programming Problem J. Stat. Appl. Pro. 6, No. 2, 305-318 2017) 305 Journal of Statistics Applications & Probability An International Journal http://dx.doi.org/10.18576/jsap/060206 On Rough Interval Three evel arge Scale

More information

Generalized Queries on Probabilistic Context-Free Grammars

Generalized Queries on Probabilistic Context-Free Grammars IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 1, JANUARY 1998 1 Generalized Queries on Probabilistic Context-Free Graars David V. Pynadath and Michael P. Wellan Abstract

More information

Analyzing Simulation Results

Analyzing Simulation Results Analyzing Siulation Results Dr. John Mellor-Cruey Departent of Coputer Science Rice University johnc@cs.rice.edu COMP 528 Lecture 20 31 March 2005 Topics for Today Model verification Model validation Transient

More information

Genetic Quantum Algorithm and its Application to Combinatorial Optimization Problem

Genetic Quantum Algorithm and its Application to Combinatorial Optimization Problem Genetic Quantu Algorith and its Application to Cobinatorial Optiization Proble Kuk-Hyun Han Dept. of Electrical Engineering, KAIST, 373-, Kusong-dong Yusong-gu Taejon, 305-70, Republic of Korea khhan@vivaldi.kaist.ac.kr

More information

Bipartite subgraphs and the smallest eigenvalue

Bipartite subgraphs and the smallest eigenvalue Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.

More information

REDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION

REDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION ISSN 139 14X INFORMATION TECHNOLOGY AND CONTROL, 008, Vol.37, No.3 REDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION Riantas Barauskas, Vidantas Riavičius Departent of Syste Analysis, Kaunas

More information

Supporting information for Self-assembly of multicomponent structures in and out of equilibrium

Supporting information for Self-assembly of multicomponent structures in and out of equilibrium Supporting inforation for Self-assebly of ulticoponent structures in and out of equilibriu Stephen Whitela 1, Rebecca Schulan 2, Lester Hedges 1 1 Molecular Foundry, Lawrence Berkeley National Laboratory,

More information

5.60 Thermodynamics & Kinetics Spring 2008

5.60 Thermodynamics & Kinetics Spring 2008 MIT OpenCourseWare http://ocw.it.edu 5.60 Therodynaics & Kinetics Spring 2008 For inforation about citing these aterials or our Ters of Use, visit: http://ocw.it.edu/ters. 1 Enzye Catalysis Readings: SAB,

More information

Upper bound on false alarm rate for landmine detection and classification using syntactic pattern recognition

Upper bound on false alarm rate for landmine detection and classification using syntactic pattern recognition Upper bound on false alar rate for landine detection and classification using syntactic pattern recognition Ahed O. Nasif, Brian L. Mark, Kenneth J. Hintz, and Nathalia Peixoto Dept. of Electrical and

More information

Multi-Scale/Multi-Resolution: Wavelet Transform

Multi-Scale/Multi-Resolution: Wavelet Transform Multi-Scale/Multi-Resolution: Wavelet Transfor Proble with Fourier Fourier analysis -- breaks down a signal into constituent sinusoids of different frequencies. A serious drawback in transforing to the

More information

Efficient Filter Banks And Interpolators

Efficient Filter Banks And Interpolators Efficient Filter Banks And Interpolators A. G. DEMPSTER AND N. P. MURPHY Departent of Electronic Systes University of Westinster 115 New Cavendish St, London W1M 8JS United Kingdo Abstract: - Graphical

More information

13 Harmonic oscillator revisited: Dirac s approach and introduction to Second Quantization

13 Harmonic oscillator revisited: Dirac s approach and introduction to Second Quantization 3 Haronic oscillator revisited: Dirac s approach and introduction to Second Quantization. Dirac cae up with a ore elegant way to solve the haronic oscillator proble. We will now study this approach. The

More information

Efficient Numerical Solution of Diffusion Convection Problem of Chemical Engineering

Efficient Numerical Solution of Diffusion Convection Problem of Chemical Engineering Cheical and Process Engineering Research ISSN 4-7467 (Paper) ISSN 5-9 (Online) Vol, 5 Efficient Nuerical Solution of Diffusion Convection Proble of Cheical Engineering Bharti Gupta VK Kukreja * Departent

More information

Illustration of transition path theory on a collection of simple examples

Illustration of transition path theory on a collection of simple examples THE JOURNAL OF CHEMICAL PHYSICS 125, 084110 2006 Illustration of transition path theory on a collection of siple exaples Philipp Metzner a and Christof Schütte b Departent of Matheatics and Coputer Science,

More information

Numerical Studies of a Nonlinear Heat Equation with Square Root Reaction Term

Numerical Studies of a Nonlinear Heat Equation with Square Root Reaction Term Nuerical Studies of a Nonlinear Heat Equation with Square Root Reaction Ter Ron Bucire, 1 Karl McMurtry, 1 Ronald E. Micens 2 1 Matheatics Departent, Occidental College, Los Angeles, California 90041 2

More information

Gary J. Balas Aerospace Engineering and Mechanics, University of Minnesota, Minneapolis, MN USA

Gary J. Balas Aerospace Engineering and Mechanics, University of Minnesota, Minneapolis, MN USA μ-synthesis Gary J. Balas Aerospace Engineering and Mechanics, University of Minnesota, Minneapolis, MN 55455 USA Keywords: Robust control, ultivariable control, linear fractional transforation (LFT),

More information

Now multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get:

Now multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get: Equal Area Criterion.0 Developent of equal area criterion As in previous notes, all powers are in per-unit. I want to show you the equal area criterion a little differently than the book does it. Let s

More information

Curious Bounds for Floor Function Sums

Curious Bounds for Floor Function Sums 1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International

More information

Pattern Recognition and Machine Learning. Artificial Neural networks

Pattern Recognition and Machine Learning. Artificial Neural networks Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016 Lessons 7 14 Dec 2016 Outline Artificial Neural networks Notation...2 1. Introduction...3... 3 The Artificial

More information

ASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical

ASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul

More information

LATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS.

LATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS. i LATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS. C. A. CHURCH, Jr. and H. W. GOULD, W. Virginia University, Morgantown, W. V a. In this paper we give

More information

Using a De-Convolution Window for Operating Modal Analysis

Using a De-Convolution Window for Operating Modal Analysis Using a De-Convolution Window for Operating Modal Analysis Brian Schwarz Vibrant Technology, Inc. Scotts Valley, CA Mark Richardson Vibrant Technology, Inc. Scotts Valley, CA Abstract Operating Modal Analysis

More information

Optimizing energy potentials for success in protein tertiary structure prediction Ting-Lan Chiu 1 and Richard A Goldstein 1,2

Optimizing energy potentials for success in protein tertiary structure prediction Ting-Lan Chiu 1 and Richard A Goldstein 1,2 Research Paper 223 Optiizing energy potentials for success in protein tertiary structure prediction Ting-Lan Chiu 1 and Richard A Goldstein 1,2 Background: Success in solving the protein structure prediction

More information

Homotopy Analysis Method for Nonlinear Jaulent-Miodek Equation

Homotopy Analysis Method for Nonlinear Jaulent-Miodek Equation ISSN 746-7659, England, UK Journal of Inforation and Coputing Science Vol. 5, No.,, pp. 8-88 Hootopy Analysis Method for Nonlinear Jaulent-Miodek Equation J. Biazar, M. Eslai Departent of Matheatics, Faculty

More information

An Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period

An Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period An Approxiate Model for the Theoretical Prediction of the Velocity... 77 Central European Journal of Energetic Materials, 205, 2(), 77-88 ISSN 2353-843 An Approxiate Model for the Theoretical Prediction

More information

Probability Distributions

Probability Distributions Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples

More information

Decentralized Adaptive Control of Nonlinear Systems Using Radial Basis Neural Networks

Decentralized Adaptive Control of Nonlinear Systems Using Radial Basis Neural Networks 050 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 44, NO., NOVEMBER 999 Decentralized Adaptive Control of Nonlinear Systes Using Radial Basis Neural Networks Jeffrey T. Spooner and Kevin M. Passino Abstract

More information

Nonuniqueness of canonical ensemble theory. arising from microcanonical basis

Nonuniqueness of canonical ensemble theory. arising from microcanonical basis onuniueness of canonical enseble theory arising fro icrocanonical basis arxiv:uant-ph/99097 v2 25 Oct 2000 Suiyoshi Abe and A. K. Rajagopal 2 College of Science and Technology, ihon University, Funabashi,

More information

Bernoulli Wavelet Based Numerical Method for Solving Fredholm Integral Equations of the Second Kind

Bernoulli Wavelet Based Numerical Method for Solving Fredholm Integral Equations of the Second Kind ISSN 746-7659, England, UK Journal of Inforation and Coputing Science Vol., No., 6, pp.-9 Bernoulli Wavelet Based Nuerical Method for Solving Fredhol Integral Equations of the Second Kind S. C. Shiralashetti*,

More information

RATE-INDEPENDENT CONSTRUCTS FOR CHEMICAL COMPUTATION

RATE-INDEPENDENT CONSTRUCTS FOR CHEMICAL COMPUTATION RATE-INDEPENDENT CONSTRUCTS FOR CHEMICAL COMPUTATION PHILLIP SENUM and MARC RIEDEL Electrical and Computer Engineering, University of Minnesota Minneapolis, MN 55455 http://cctbio.ece.umn.edu E-mail: {senu0004,

More information

IN modern society that various systems have become more

IN modern society that various systems have become more Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto

More information

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co

More information

The Wilson Model of Cortical Neurons Richard B. Wells

The Wilson Model of Cortical Neurons Richard B. Wells The Wilson Model of Cortical Neurons Richard B. Wells I. Refineents on the odgkin-uxley Model The years since odgkin s and uxley s pioneering work have produced a nuber of derivative odgkin-uxley-like

More information

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer

More information

Friction Induced Hunting Limit Cycles: An Event Mapping Approach

Friction Induced Hunting Limit Cycles: An Event Mapping Approach Friction Induced Hunting Liit Cycles: An Event Mapping Approach Ron H.A. Hensen, Marinus (René) J.G. van de Molengraft Control Systes Technology Group, Departent of Mechanical Engineering, Eindhoven University

More information

Determining the Robot-to-Robot Relative Pose Using Range-only Measurements

Determining the Robot-to-Robot Relative Pose Using Range-only Measurements Deterining the Robot-to-Robot Relative Pose Using Range-only Measureents Xun S Zhou and Stergios I Roueliotis Abstract In this paper we address the proble of deterining the relative pose of pairs robots

More information