On the Reverse Problem of Fechnerian Scaling

Size: px
Start display at page:

Download "On the Reverse Problem of Fechnerian Scaling"

Transcription

1 On the Reverse Prolem of Fehnerian Saling Ehtiar N. Dzhafarov Astrat Fehnerian Saling imposes metris on two sets of stimuli relate to eah other y a isrimination funtion sujet to Regular Minimality. The two sets of stimuli usually represent the same set of stimulus values presente to an oserver in two istint oservation areas. A isrimination funtion assoiates with every pair of stimuli a nonnegative numer interpretale as the egree or proaility with whih, from the oserver s point of view, the two stimuli iffer from eah other, overall or in a speifie respet. Regular Minimality is a priniple aoring to whih the relation to e the est math for aross the two stimulus areas has ertain uniqueness symmetry properties. Fehnerian istanes are ompute y means of a issimilarity umulation proeure: isrimination values are first onverte into an appropriately efine issimilarity funtion, the sums of the latter s values are ompute for all finite hains of stimuli onneting a given pair of stimuli, the infimum of suh sums (umulative issimilarities) is taken to e the istane from one element of this pair to the other. The Fehnerian istane etween two stimuli in one oservation area is the same as the Fehnerian istane etween the orresponing (est mathing) stimuli in the other oservation area. This hapter eals with the reverse prolem of Fehnerian Saling: uner whih onitions one an ompute the isrimination funtion values given the Fehnerian istanes the isrimination values etween the est mathing stimuli. 1 Bakgroun Some familiarity with the moern theory of (generalize) Fehnerian Saling is esirale ut not neessary for reaing this hapter: the akgroun information neee will e reapitulate. The reaer intereste in the latest pulishe version of the theory is referre to Dzhafarov Colonius (2007) Dzhafarov (2008a, 2008, 2010). For historial etails the origins of the ajetive Fehnerian the reaer an onsult Dzhafarov (2001) Dzhafarov Colonius (2011). A prototypial example of an experiment to whih Fehnerian Saling pertains is this: an oserver is presente various pairs of stimuli (souns, olor pathes, rawings, photographs of faes) aske to iniate for every pair whether the two stimuli are the same or ifferent (possily, in a speifie respet, as in o these photographs epit the same person? ). The assumption is that eah pair (a, ) is assoiate with the proaility ψ (a, ) = Pr [a are juge to e ifferent]. Every stimulus is haraterize y its value (e.g., the shape of a line rawing) its oservation area (or stimulus area), usually a spatiotemporal loation, serving to istinguish the two stimuli to e ompare (e.g., two line rawings an e presente in istint loations, one to the left of the 1

2 other, or suessively, one efore the other). The pairs (a, ) therefore are efine as { } value of a in oservation area 1, (a, ) =, value of in oservation area 2 so that (a, ) (, a). Assuming, as we o throughout this hapter, that the two oservation areas are fixe, a in (a, ) elong to ifferent sets even if their values are iential. We enote these sets A B, so that the isrimination proaility funtion ψ is ψ : A B [0, 1]. This efinition an e immeiately generalize. First, we an replae [0, 1] with the set of all nonnegative reals, ψ : A B R +. This allows us to inlue isrimination funtions whih are not proailities, suh as expete values of numerial estimates of issimilarity given in response to pairs of stimuli. Although the present treatment is onfine to proailisti ψ, its extension to aritrary (oune or unoune) funtions is straightforwar. Seon, we an interpret A B as eing aritrary sets, not neessarily A = V {1}, B = V {2}, with V eing a ommon set of stimulus values. Thus, one an onsier A = V 1 {1}, B = V 2 {2}, where V 1 V 2 are ifferent susets of a set V of possile stimulus values. This may e onvenient if the mathing pairs, as efine elow, involve onstant error, that is, if V 2 is the set of mathes for the elements of V 1 V 2 V 1. We an even onsier the possiility that A B are sets of ifferent nature, with the relation are the same eing efine in speial ways. For instane, A may e a set of examinees B the set of tests, with the relation a are the same meaning that the prolem is neither too iffiult nor too easy for the examinee a (in the opinion of a juge, or as ompute from performane ata). For other non-traitional examples of pairwise omparisons, see Dzhafarov Colonius (2006). Without loss of generality, let us assume that no two istint stimuli in A or in B are equivalent, in the following sense: if a 1 a 2 in A, then for some B; if 1 2 in B, then ψ (a 1, ) ψ (a 2, ) ψ (a, 1 ) ψ (a, 2 ) for some a A. (If this is not the ase, then A B an always e reue to the requisite form.) We say that a A is mathe y B write am if ψ (a, ) = min ψ (a, y). y B 2

3 Analogously, if ψ (a, ) = min ψ (x, ), x A we say that B is mathe y a A write Ma. The spae (A, B, ψ), or the isrimination funtion ψ itself, is sai to satisfy Regular Minimality (Dzhafarov, 2002; Dzhafarov & Colonius, 2006; Kujala & Dzhafarov, 2008) if (RM1) for every a A there is one only one B suh that am; (RM2) for every B there is one only one a A suh that Ma; (RM3) am if only if Ma, for all (a, ) A B. If this is the ase, we an relael the stimuli in A B so that any two mathing stimuli reeive the same lael. Formally, if Regular Minimality hols, then one an fin (non-uniquely) ijetive funtions h : A S suh that g : B S am h (a) = g (). Any suh mapping (h, g) is alle a anonial transformation of the spae (A, B, ψ), it reates a anonial isrimination spae (S, ψ ), with the funtion efine y ψ : S S R + ψ (a, ) = ψ ( h 1 (a), g 1 () ). Clearly, the funtion ψ satisfies Regular Minimality in the simplest (anonial) form: for any istint a, S, ψ (a, a) < min {ψ (a, ), ψ (, a)}. Although the anonial isrimination spae (S, ψ ) is not uniquely etermine y (A, B, ψ), it an e viewe as eing essentially unique, in the following sense. Any two anonial spaes, (S 1, ψ 1) (S 2, ψ 2), are relate to eah other y a ijetive transformation t : S 1 S 2 suh that ψ 1 (a, ) = ψ 2 (t (a), t ()). In other wors, the anonial transformation is unique up to trivial renaming of the stimuli. Heneforth we will eal with anonial isrimination spaes (S, ψ ) only. We rop the asterisk for the anonial isrimination funtion write ψ in plae of ψ. We also use the notational onventions aopte in most of the author s previous puliations on generalize Fehnerian Saling: 1. for any inary funtion f : S S R, we write fa instea of f (a, ) (in partiular, the isrimination funtion is written as ψa); 3

4 2. if a inary funtion f is followe y a string (or hain) X = x 1..., x n of more than one point, then n 1 fx = fx 1... x n = fx i x i+1 ; 3. for a hain X = x 1..., x n with n = 1 or n = 0 the expression fx is set equal to zero; 4. any two hains of points X Y an e onatenate into a hain XY (e.g., if X = x 1..., x n, then ax is the hain ax 1..., x n ). A issimilarity funtion D : S S R is efine y the following properties: for any a, S, any sequenes a n, a n, n, n in S, any sequene of hains X n with elements in S (n = 1, 2,...), (D1) Da 0; (D2) Da = 0 if only if a = ; (D3) if max {Da n a n, D n n} 0 then Da n n Da n n 0; (D4) if Da n X n n 0 then Da n n 0. Given any hain X = x 1..., x n, the quantity i=1 n 1 DX = Dx i x i+1 i=1 is alle the umulative issimilarity for this hain. In Fehnerian Saling the role of issimilarity funtions is playe y the psyhometri inrements of the first seon kin, efine as, respetively, Ψ (1) a = ψa ψaa, Ψ (2) a = ψa ψaa. (It is learly unneessary to onsier separately the versions ψa ψ = Ψ (1) a ψa ψ = Ψ (2) a.) In other wors, a anonial isrimination spae (S, ψ) inues a oule-issimilarity spae ( S, Ψ (1), Ψ (2)). We use the notation a n n (as n ) to esignate any of the pairwise equivalent onvergenes Ψ (1) a n n 0, Ψ (1) n a n 0, Ψ (2) a n n 0, Ψ (2) n a n 0. The isrimination funtion ψ is uniformly ontinuous with respet to the uniformity inue y this onvergene: } a n a n = ψa n n n ψa n n 0. n 4

5 In partiular, a n n implies ψ n n ψa n a n 0. A metri (or istane funtion) G : S S R an e efine as a issimilarity funtion satisfying the triangle inequality: for all a,, S, Ga + G Ga. This efinition iffers from the lassial Frehét s efinition in that it oes not require gloal symmetry, Ga = Ga. However, it is more speifi than the notion of a quasimetri (efine y ropping from the lassial efinition of a metri the gloal symmetry requirement). Namely, sine G is a issimilarity it has the following symmetry-in-the-small property: for all sequenes a n, n in S, Ga n n 0 G n a n 0. In Fehnerian Saling, the Fehnerian metri G 1 inue y the issimilarity funtion Ψ (1) is efine as G 1 a = inf X Ψ(1) ax. Analogously, G 2 a = inf X Ψ(2) ax is the Fehnerian metri inue y the issimilarity funtion Ψ (2). Both G 1 G 2 are well-efine metris, G 1 a + G 1 a = Ga. G 2 a + G 2 a This sum, Ga, is a onventional (symmetri) metri. It is referre to as the overall Fehnerian metri. The asymmetri ( oriente ) metris G 1 G 2 are also relate to eah other y the ientities G 1 a G 2 a G 2 a G 1 a = ψ ψaa. This follows from the proeure of omputing G 1 G 2 from Ψ (1) Ψ (2) from the immeiately verifiale ientities Ψ (1) a Ψ (2) a = ψ ψaa. Ψ (2) a Ψ (1) a For any sequenes a n n in S, we have, as n, a n n G 1 a n n 0 G 2 a n n 0. It follows that G 1 G 2 are uniformly ontinuous with respet to the uniformity inue y. 5

6 .1 a Figure 1: Stimulus spae of Example 1. For eah stimulus pair (x, y), the numer attahe to the arrow from x to y is the value of ψxy. a a Figure 2: Psyhometri inrements of the first seon kin ompute for the stimulus spae shown in Figure 1. For eah stimulus pair (x, y), the numer attahe to the arrow from x to y is the value of Ψ (1) xy (on the left) or Ψ (2) xy (on the right). 6

7 Example 1. Let S e the set of four stimuli, {a,,, }, 1 with the values of ψ shown in Figure 1. Fehnerian omputations are illustrate in Figures 2-5. Thus, the numer 0 attahe to the arrow from to in Figure 2, left, is Ψ (1) = ψ ψ = The numer 0.7 attahe to the orresponing arrow on the right is Ψ (2) = ψ ψ = 1 0. For any finite stimulus set, the psyhometri inrements Ψ (1) Ψ (2) are issimilarity funtions (i.e., satisfy the properties D1-D4 aove) if only if ψ satisfies Regular Minimality. The Fehnerian istanes are shown in Figure 3. For instane, the numer 0 attahe to the arrow from a to on the left is ompute y forming all possile hains leaing from a to, alulating their umulative issimilarities hoosing the smallest. Omitting hains ontaining loops, as we oviously o not nee them in searhing for the minimum, we get the list hain umulative Ψ (1) a 0 a 0+0 a 0+0 a a in whih the iret link a is learly a geoesi (a shortest path). We onlue therefore that G 1 a = 0. Note that geoesis generally are not unique if they exist (they have to exist in finite stimulus sets ut not generally). The analogous alulations for, say, the stimuli on the right yiel hain umulative Ψ (2) 0.7 a a a Here, the geoesi is a we onlue that G 2 = 0.6. This geoesi is shown in Figure 4, right, together with the two other iniret geoesi paths, those onsisting of more than two stimuli. Figure 5 presents the values of the overall Fehnerian istane, otaine as G 1 xy + G 1 yx = G 2 xy + G 2 yx 1 As a rule we use symols a (interhangealy with x y, respetively) to generially refer to stimuli in, respetively, the first seon oservation areas. Thus, in an expression like Ψ (1) a > 0, a are variales, aritrary memers of S. However, in some of our examples a are use to esignate speifi stimuli, together with other speifi stimuli (here, ). The two uses of a shoul e easily istinguishale y the ontext. 7

8 a a Figure 3: Fehnerian istanes of the first seon kin ompute from the psyhometri inrements in Figure 2. The numer attahe to the arrow from x to y is the value of G 1 xy (on the left) or G 2 xy (on the right). The frame numers iniate Fehnerian istanes that are smaller than the orresponing psyhometri inrements: the geoesis for them are shown in Figure 4. for every stimulus pair (x, y). Thus, for (x, y) = (, ), we have G 1 + G 1 = G = G = G 2 + G 2 = Note that G an e viewe as the umulative issimilarity Ψ (1) a = Ψ (2) a for the geoesi loop a otaine y onatenating the geoesi paths from to ak; the loop shoul e rea in the opposite iretions for Ψ (1) Ψ (2). 2 Prolem We have seen that a anonial isrimination spae (S, ψ) inues a oule-metri spae (S, G 1, G 2 ) from whih one an form the spae (S, G) with a onventional, symmetri metri G. It is easy to see that these omputations annot generally e reverse. The following example shows that (S, G) oes not allow one to reonstrut (S, ψ) uniquely. Example 2. Let (S, ψ) inue (S, G 1, G 2 ) (S, G), let ψaa e some nononstant funtion of a. Denote y ω a an aritrary funtion suh that ω a ψaa 8

9 a a Figure 4: Geoesi paths of the first seon kin orresponing to the frame values of the Fehnerian istanes in Figure 3. Eah geoesi onsists of three stimuli onnete y two onseutive arrows. a Figure 5: The overall (symmetri) Fehnerian istanes ompute from the Fehnerian istanes shown in Figure 3. 9

10 (that is, ω a ψaa are not iential), 0 ω a min { 1 sup Ψ (1) a }, ω ω a Ψ (1) a. All three inequalities an always e ahieve, for instane, y putting ω a 0 (a nononstant ψaa has to e positive at some a, then 1 sup Ψ (1) a > 0 ). The funtion ψa = Ψ (1) a + ω a is learly oune y 1 from aove. It satisfies Regular Minimality eause ψaa = ω a ψa ω a ψa = Ψ (1) a + ω. The funtion ψ inues preisely the same metri spae (S, G) as the original funtion ψ. Inee, from the efinition of ψ it follows that Ψ (1) a = Ψ (1) a, where Ψ (1) is the psyhometri inrement of the first kin ompute from ψ. This means that G 1 ompute from Ψ (1) oinies with G 1. But then also G 1 a + G 1 a = G 1 a + G 1 a. Figures 6 7 illustrate the proeure just esrie on the stimulus spae of Example 1. The left panel of Figure 7 oinies with that of Figure 3 eause the psyhometri inrements of the first kin remain the same. By aing the numers attahe to opposite arrows one an verify that although the Fehnerian istanes of the seon kin o hange, they yiel the same overall Fehnerian istanes. Is it possile then that ψ (or at least the psyhometri inrements Ψ (1) Ψ (2) ) an e reonstrute if one knows oth G 1 G 2? The next example shows that this is not the ase. Example 3. Let S e a ountale set of stimuli enumerate s 1, s 2,..., let 0 if i = j 1/3 if i j = 1 ψs i s j = 2/3 + γ i if i j = 2 2/3 + γ i if j i = 2 1 if i j 3, where 0 γ i, γ i < 1 /3. This is an example of a uniformly isrete stimulus spae, onsiere in Setion 4. The psyhometri inrements Ψ (1) Ψ (2) ψ 10

11 .1 a Figure 6: Stimulus spae of Example 1 moifie in aorane with Example 2. a a.1.6 Figure 7: Fehnerian istanes of the first seon kin ompute from the psyhometri inrements in Figure 6. 11

12 in this ase are issimilarity funtions eause ψ satisfies Regular Minimality. ontaining s i s i+2 as suessive elements, For every hain the umulative issimilarity Xs i s i+2 Y or Xs i+2 s i Y, Ψ (ι) Xs i s i+2 Y or Ψ (ι) Xs i+2 s i Y where ι sts for 1 or 2, annot inrease if one replaes this hain with respetively: Xs i s i+1 s i+2 Y or Xs i+2 s i+1 s i Y, Ψ (ι) Xs i s i+2 Y Ψ (ι) Xs i s i+1 s i+2 Y = γ i Ψ (ι) Xs i+2 s i Y Ψ (ι) Xs i+2 s i+1 s i Y = γ i. Hene in omputing G ι as the infimum (here, minimum) of umulative issimilarities aross a set of hains, one an onfine one s onsieration to hains in whih for any two suessive elements s i s j, either i j = 1 or i j 3. This means that G ι annot epen on the funtions γ i γ i. In fat, as one an easily verify, G 1 s i s j = G 2 s i s j = { j i /3 if i j < 3 1 if i j 3, irrespetive of the funtions γ i γ i. The values of ψs is i+2 ψs i+2 s i an e aritrarily hosen etween 2 /3 1. The next example emonstrates the same point, that (S, G 1, G 2 ) etermines neither ψ nor the psyhometri inrements uniquely, for a ontinuous stimulus spae. Example 4. Let S e the interval [0, 1], let ψa = 2 a 4 + a p 2 if a, 3a a p 4 if a >, where a are the numerial values of stimuli a, respetively, p > 1. We have here a Ψ (1) 2 + a p 2 if a, a = a 2 + a p 4 if a >, Ψ (2) a = 3( a) 4 + a p 4 if a <, a 4 + a p 2 if a. We omit a emonstration that these psyhometri inrements are issimilarity funtions: it an e one using the methos presente in Dzhafarov (2010). For any a < m < in [0, 1], Ψ (1) a > Ψ (1) am 12

13 Ψ (2) a > Ψ (2) am. This is an example of a spae with intermeiate points, onsiere in Dzhafarov (2008a). The inverse triangle inequalities imply that, for any a, the umulative issimilarities Ψ (1) ax Ψ (2) ax erease as one progressively refines the hain X = x 1... x k whose elements values partition the interval etween a (i.e., for ( a <, a < x 1 < )... < x k <, analogously for a > ). As n the maximal gap in a, x (n) 1,..., x(n) k n, for hains X n = x n 1... x n k n tens to zero, Ψ (1) a ax n G 1 a = 2 3( a) Ψ (2) 4 if a <, ax n G 2 a = a 4 if a. As these values o not epen on p, the funtion ψ annot e reonstrute even if one knows all values of G 1 a G 2 a. The question arises: an one impose on the funtion ψ ertain onstraints uner whih ψ an e uniquely restore from (S, G 1, G 2 ) the set of self-isrimination proailities 2 {ω a = ψaa : a S}? On this level of generality the prolem is too iffiult, however. Its formulation oes not exlue the possiility that ψa for a given pair of stimuli (a, ) is etermine y the values of G 1, G 2 ω on some suset of pairs in S S, if not the entire Cartesian prout. The prolem we pose in this paper is more restrite: uner what onitions an one ompute ψa from the quantities G 1 a, G 2 a, G 1 a, G 2 a, ω a, ω? We refer to this as the reverse prolem of Fehnerian Saling (in the restrite sense). The soalle Fehner s prolem (as formulate in Lue & Galanter, 1963) is losely relate to the reverse prolem in the restrite sense ut is left outsie the sope of this hapter. The reaer intereste in the issue is referre to Falmagne (1985) Dzhafarov (2002a). 3 General Consierations The formulation of the reverse prolem immeiately suggests the following representation for ψa. The reverse prolem has a solution if only if ψ an e presente in either of the two equivalent forms, ψa = ω a + G 1 a + R (G 1 a, G 2 a, G 1 a, G 2 a, ω a, ω ) or ψa = ω + G 2 a + R (G 1 a, G 2 a, G 1 a, G 2 a, ω a, ω ), where R is uniformly ontinuous, nonnegative, vanishing at a =. 2 One shoul keep in min that ue to a anonial transformation of the spae, the first the seon a in ψaa may e stimuli physially ifferent in value, even if not, they always have ifferent oservation areas. Therefore the self in self-isrimination is a onvenient ut potentially misleaing prefix. 13

14 Proof. It is ovious that any funtion of G 1 a, G 2 a, G 1 a, G 2 a, ω a, ω an e presente in either of the two forms. That they are equivalent follows from whih is a onsequene of Sine ω a + G 1 a = ω + G 2 a, G 1 a G 2 a G 2 a G 1 a = ω ω a. (ψa ω a ) G 1 a = Ψ (1) a G 1 a is the ifferene of uniformly ontinuous funtions, R is uniformly ontinuous. R is nonnegative eause ψa ω a = Ψ (1) a G 1 a R vanishe at a = eause ψa ω = Ψ (2) a G 2 a. ψa = ω a = ω G 1 a = G 2 a = 0. This proves the only if part of the theorem. The if part is ovious. The examples in the previous setion show that the representation given in this theorem oes not have to exist. Moreover, espite its formulation in the form of a neessary suffiient onition, it is not ovious whether a funtion ψ satisfying this onition an in fat e onstrute: the onition in question relates ψ to G 1 G 2, whih are themselves ompute from ψ. The situation is remeie y the following examples. Example 5. Let S e the interval [0, 1], ψa = a 6 + a (a )2 (a + ). The funtion is easily heke to e etween 0 1 satisfy Regular Minimality. The psyhometri inrements of the first kin are Ψ (1) a = 1 3 a ( a 2 2) (a ), they an e shown to form a issimilarity funtion (we skip this emonstration). Sine, for any a, [0, 1] m etween a, Ψ (1) am < Ψ (1) a, 14

15 we use the same argument as in Example 4 to arrive at One an hek now that G 1 a = a. 3 a 6 + a (a )2 (a + ) = a 6 + a 3 + ( 2 3 a + ( a 6 (( 6)) 6 ) a a ) ( a 6 + ) 6 = ω a + G 1 a + (2G 1 a + (ω a ω )) ((ω ω a ) + 2G 1 a) (ω a + ω ). That is, ψ an e presente in a form require in Theorem 3, with R = ω a + G 1 a + (2G 1 a + (ω a ω )) ((ω ω a ) + 2G 1 a) (ω a + ω ). This an e rewritten to involve G 1 G 2 symmetrially: using the ientities we get 2G 1 a + (ω a ω ) = G 1 a + G 2 a (ω ω a ) + 2G 1 a = G 1 a + G 2 a, ω a + G 1 a + (G 1 a + G 2 a) (G 2 a + G 1 a) (ω a + ω ) ψa = ω + G 2 a + (G 2 a + G 1 a) (G 1 a + G 2 a) (ω + ω a ). This representation is of interest in view of the symmetry onsierations to e invoke elow. The next example provies another emonstration of the same nature, argualy the simplest possile eause it orrespons to R 0. Example 6. Consier the spae shown in Figure 8. One an hek that, for any pair of stimuli x, y {a,,, } any hain X with elements in {a,,, }, Ψ (1) xy Ψ (1) xxy Ψ (2) xy Ψ (2) xxy. This means that the psyhometri inrements shown in Figure 9 oinie with the orresponing Fehnerian istanes, we have ω a + G 1 a ψa = ω + G 2 a, whih are speial ases of the representations in Theorem 3. 15

16 .1 a Figure 8: Stimulus spae of Example 6. a a Figure 9: Psyhometri inrements (in this ase oiniing with Fehnerian istanes) of the first seon kin ompute for the stimulus spae shown in Figure 8. 16

17 Theorem 3 enompasses a wealth of possile speial ases. One an restrit this lass y onsiering stimulus spaes with speial properties (as we o in the next setion) or y imposing ertain symmetry onstraints on the funtion R iretly. The latter an e one as follows. First, we an eliminate from the expression R (G 1 a, G 2 a, G 1 a, G 2 a, ω a, ω ) quantities eterminale from other quantities. Knowing G 1 a, G 1 a, ω ω a one an ompute G 2 a, G 2 a as G 2 a = G 1 a (ω ω a ) G 2 a = G 1 a + (ω ω a ) (these ientities were use in Example 5). This leas to R 1 (G 1 a, G 1 a, ω a, ω ) R (G 1 a, G 2 a, G 1 a, G 2 a, ω a, ω ) = R 2 (G 2 a, G 2 a, ω, ω a ). Now, it may sometimes e natural to posit (e.g., in psyhophysial appliations, when two oservation areas ontain the same set of stimulus values) that the two oservation areas are interhangeale, so are the stimuli a. More preisely, one an assume that R 1 R 2 remain invariant (1) if one exhanges a in all their arguments; (2) if one replaes G 1 with G 2 or vie versa. Sine the arguments of R 2 an e otaine from those of R 1 y suessively applying these two rules, we have R 1 R 2 R. The assumption in question an now e formulate y saying that any asymmetry etween the two oservation areas is only in the first two summs of the four equivalent representations for ψ: ω a + G 1 a + R (G 1 a, G 1 a, ω a, ω ) ω ψa = a + G 1 a + R (G 1 a, G 1 a, ω, ω a ) ω + G 2 a + R (G 2 a, G 2 a, ω, ω a ) ω + G 2 a + R (G 2 a, G 2 a, ω a, ω ). Let us all suh a funtion R symmetri. If a reverse prolem has a solution with a symmetri funtion R, then G 1 a G 2 a = ψa ψa, G 1 a G 1 a = Ψ (1) a Ψ (1) a, G 2 a G 2 a = Ψ (2) a Ψ (2) a. 17

18 Proof. The first of these ientities is otaine y sutrating ψa = ω a + G 2 a + R (G 2 a, G 2 a, ω a, ω ) from ψa = ω a + G 1 a + R (G 1 a, G 1 a, ω a, ω ). The representations for the ifferenes of the psyhometri inrements follow then from the ientities G 2 a = G 1 a (ω ω a ) G 2 a = G 1 a + (ω ω a ). Example 7. The following funtions satisfy the symmetry requirement for R : ω a + G 1 a + (G 1 a + G 2 a) (G 2 a + G 1 a) (ω a + ω ) ψa = ω + G 2 a + (G 2 a + G 1 a) (G 1 a + G 2 a) (ω + ω a ) ω a + G 1 a + f (Ga,S (ω a, ω )) ψa = ω + G 2 a + f (Ga,S (ω a, ω )), where S is some ommutative funtion (whih may, as a speial ase, e ientially onstant, say, zero). 4 Speial Stimulus Spaes 4.1 Diretly linke spaes Let us say that a point a in a stimulus spae (S, ψ) is iretly 1-linke to point (or iretly linke to it in the first oservation area) if Ψ (1) a = G 1 a. Analogously, a point a is iretly 2-linke to point (or iretly linke to it in the seon oservation area) if Ψ (2) a = G 2 a. A point a is iretly 1-linke to a point if only if is iretly 2-linke to a. Proof. The equality means that, for every hain X = x 1... x k, Ψ (1) a = G 1 a k 1 Ψ (1) ax =Ψ (1) ax 1 + Ψ (1) x i x i+1 + Ψ (1) x k Ψ (1) a. i=1 18

19 This an e written as k 1 (ψax 1 ω a ) + (ψx i x i+1 ω xi ) + (ψx k ω xk ) (ψa ω a ). i=1 Replaing ω a with ω on oth sies rearranging the ω-terms as we get ω ω x1 ω xi ω xk 1 ω xk ω x1 ω x2 ω xi+1 ω xk ω, k 1 ( ) (ψax 1 ω x1 ) + ψxi x i+1 ω xi+1 + (ψxk ω ) (ψa ω ). i=1 In other wors, for every hain Y = x k... x 1, But this means proving the theorem. k 1 Ψ (2) Ya =Ψ (2) x k + Ψ (2) x i+1 x i + Ψ (2) x 1 a Ψ (1) a. i=1 Ψ (2) a = G 2 a, Points a are iretly 1-linke to eah other if only if they are iretly 2-linke to eah other. In a spae with any two points iretly 1-linke any two points are iretly 2-linke ( vie versa). The spae referre to in this orollary is alle a iretly linke spae. The reverse prolem for suh a spae has its simplest possile solution: G 1 a + ω a ψa = G 2 a + ω. Example 8. Consier a spae (S, ψ) suh that ψa = Ma + r 1 (a) + r 2 (), where M is a symmetri metri r 1, r 2 some nonnegative funtions. Then To ensure Regular Minimality, we posit Ψ (1) a = Ma + r 2 () r 2 (a) Ψ (2) a = Ma + r 1 (a) r 1 (). r 1 (a) r 1 () < Ma r 2 (a) r 2 () < Ma. 19

20 We verify that for any a,, m in S, Ψ (1) am = Mam + r 2 (m) r 2 (a) + Ψ (1) m = Mm + r 2 () r 2 (m) Ma + r 2 () r 2 (a) = Ψ (1) a, proving therey Analogously we prove Sine we onlue that G 1 a + G 1 a G 2 a + G 2 a Ψ (1) a = G 1 a. Ψ (2) a = G 2 a. = Ψ(1) a + Ψ(1) a Ψ (1) a + Ψ (1) a Ma = 1 2 Ga, = 2Ma, so that the efinition of ψ an e given as ψa = 1 2 Ga + r 1 (a) + r 2 (). This is one possile form of presenting the quarilateral issimilarity moel (Dzhafarov & Colonius, 2006). The statement of the following theorem is ovious given without proof. We enote (referring to Theorem 3) R (G 1 a,g 2 a,g 1 a,g 2 a,ω a, ω ) = R a. If the reverse prolem has a solution, then point a is iretly 1-linke to point ( is iretly 2-linke to point a) if only if R a = 0. This oservation agrees with Theorem 4.1: oth iret linkages are equivalent to R a = 0. Example 6 shows that a iretly linke spae an e easily onstrute. 4 Spaes with metri-in-the-small issimilarities A issimilarity funtion D is sai to e metri-in-the-small if, whenever a n n with a n n, The onvergene is from the right eause a n n & a n n Da n n Ga n n 1. Da n n Ga n n. Applying this efinition to psyhometri inrements, = Ψ(1) a n n G 1 a n n 1 20

21 Clearly, these onvergenes imply a n n & a n n = Ψ(2) a n n G 2 a n n 1. Ψ (ι) a n n + Ψ (ι) n a n Ga n n 1. Reall that a n n means any of the equivalent onvergenes Ψ (ι) a n n 0, Ψ (ι) n a n 0, where ι sts for 1 or 2. If the reverse prolem has a solution, then the issimilarities Ψ (1) Ψ (2) are metri-in-the-small if only if R (x, y, u, v, a, ) is of a higher egree of infinitesimality than either of the arguments x v. Proof. Rewrite the expressions as We know that, as a n n, oth ψa n n = ω an + G 1 a n n + R an n = ω n + G 2 n a n + R an n Ψ (1) a n n G 1 a n n = 1 + R (G 1a n n,g 2 a n n,g 1 n a n,g 2 n a n,ω an,ω n ) G 1 a n n Ψ (2) n a n G 2 n a n = 1 + R (G 1a n n,g 2 a n n,g 1 n a n,g 2 n a n,ω an,ω n ) G 2 n a n. G 1 a n n 0 G 2 n a n 0. The left-h sies ten to 1 if only if the ratios on the right ten to zero, proving the theorem. If we make use of the symmetry onstraint of Setion 3 present the funtion R in the aove theorem as R (G 1 a,g 1 a,ω a, ω ) = R (G 2 a,g 2 a, ω, ω a ), then the onition of the higher-orer infinitesimality aquires a simpler form. If the reverse prolem has a solution with a symmetri R, then Ψ (1) is metri-in-the-small if only if so is Ψ (2) if only if R (x, y, a, ) is of a higher egree of infinitesimality than oth x y. 21

22 Example 9. In partiular, if R an e presente as in the seon funtion of Example 7, R = f (Ga,S (ω a, ω )), the onition of the higher-orer infinitesimality reues to R (x, a) x 0 as x 0 (x 0). Suh funtions as ω a + G 1 a + ωa ω ω a+ω (Ga) 2 ψa = ω + G 2 a + ωa ω ω a+ω (Ga) 2 provie examples. ω a + G 1 a + k 2 (Ga) 2 + k 3 (Ga) k r (Ga) r ψa = ω + G 2 a + k 2 (Ga) 2 + k 3 (Ga) k r (Ga) r 4 Uniformly isrete spaes A spae (S, ψ) is uniformly isrete if This onition is equivalent to eause, as we know, inf x y Ψ(1) xy > 0. inf x y Ψ(2) xy > 0 Ψ (1) x n y n 0 Ψ (2) x n y n 0. Any finite spae is uniformly isrete. In the following we will taitly assume, with no loss of generality, that all hains X = x 1...x k onsiere are non-wasteful, in the following sense: for no i = 1,..., k 1, x i = x i+1. A hain X = x 1...x k is alle 1-asi if, for any 1 i < k, x i is iretly 1-linke to x i+1. A 2-asi hain is efine analogously. The lass of all 1-asi (2-asi) hains onneting a to ontaining k elements, not ounting a, is enote y Ck 1a (respetively, C2 ka). Clearly, k = 0, 1,.... For any a, in a uniformly isrete spae one an fin k 1 k 2 suh that G 1 a = inf Ψ (1) ax ax Ck 1 a 1 G 2 a = inf Ψ (2) ax. ax Ck 2 a 2 22

23 Proof. Let ι st for 1 or 2. Consier all hains X (k) ontaining k = 0, 1,..., elements, efine Denoting we have hene also Therefore, for some K > 0, we have to have G (k) ι a = inf Ψ (ι) ax (k). X (k) s ι = inf x y Ψ(ι) xy > 0, Ψ (ι) ax (k) (k + 1) s ι, G (k) ι a (k + 1) s ι. G ι a < G (K) ι a. Consier a numer k with the following property: in some sequene of hains ax n suh that Ψ (ι) ax n G ι a the hains with k elements our infinitely often. Denote y k 0 the largest numer with this property (whih exists eause k < K). By onstrution, there is a sequene of hains ax (k0) n suh that ut there is no sequene of hains ax (>k0) n that Ψ (ι) ax (k0) n G ι a, in whih eah X (>k0) n Ψ (ι) ax n (>k0) G ι a. has more than k 0 elements suh We will show that all ut a finite numer of these hains ax n (k0) are ι-asi. Suppose this is not the ase. Then one an hoose a sequene of hains ax (k0) n all of whih are not ι-asi, with Ψ (ι) ax (k0) n G ι a. Let x in,nx in+1,n e a link in eah of these hains with x in,n not iretly ι-linke to x in+1,n (where i n may e 0 or k 0, with x 0,n = a x k0+1,n = ). Then one an fin nonempty hains Y n suh that Ψ (ι) ax 1,n...x in,ny n x in+1,n...x k0,n < Ψ (ι) ax n (k0), sine the onvergene of Ψ (ι) ax (k0) n to G ι a is from the right, Clearly, Y n must ontain an element whene the hains Ψ (ι) ax 1,n...x in,ny n x in+1,n...x k0,n G ι a. m n / {x in,n, x in+1,n}, x 1,n...x in Y n x in+1...x k0,n ontain more than k 0 elements. But this ontraits the efinition of k 0. 23

24 With ι sting for 1 or 2, in a uniformly isrete spae any point an e iretly ι-linke to some other point, any two points an e onnete y an ι-asi hain. To formulate another immeiate onsequene of Theorem 4, we nee a new onept. A ase for G 1 is a suset suh that if for all (a, ) D, then D S S G 1 a = G 1a G 1 a = G 1a for all (a, ) S S. The efinition of a ase for G 2 is analogous. With ι sting for 1 or 2, in a uniformly isrete spae the set of all iretly ι-linke orere pairs of points forms a ase for G ι. We onlue this hapter y onsiering the reverse prolem for a speial ase of uniformly isrete spaes, those with geoesis. All finite spaes fall within this ategory. A uniformly isrete spae is sai to e with geoesis if, for any points a in it, G 1 a = min X Ψ(1) ax G 2 a = min X Ψ(2) ax. In other wors, the requirement is that for any a one e ale to fin hains X 1 X 2 suh that G 1 a = Ψ (1) ax 1 G 2 a = Ψ (2) ax 2. The hains ax 1 ax 2 in this efinition are referre to as geoesis of the first seon kin, respetively. That geoesis nee not exist in all uniformly isrete spaes is shown y the following example. Example 10. Let S onsist of a,, 1, 2,.... Let Ψ (1) e a symmetri funtion with the following values: for i, j {1, 2,...}, The spae is uniformly isrete eause For the sequene of hains a n, as n, Ψ (1) a = 2, Ψ (1) a i = /i, Ψ (1) i = 1 /2, Ψ (1) i j = i j. inf x y Ψ(1) xy = 1 2. Ψ (1) a n = n 3 2, 24

25 it is easy to see that G 1 a = 3 2. There is, however, no hain X suh that Ψ (1) ax = 3 2. Therefore, this uniformly isrete spae is not with geoesis. In a uniformly isrete spae with geoesis, we say that a is strongly 1-linke (strongly 2-linke) to if a is the only geoesi of the first (respetively, seon) kin onneting a to. Clearly, strong ι-linkage implies iret ι-linkage (ι = 1, 2). A hain X = x 1...x k is alle strongly ι-asi if, for any 1 i < k, x i is strongly ι-linke to x i+1 (ι = 1, 2). With ι sting for 1 or 2, in a uniformly isrete spae with geoesis, (i) any two points an e onnete y a strongly ι-asi geoesi hain; (ii) any point an e strongly ι-linke to some other point; (iii) the set of all strongly ι-linke orere pairs of points forms a ase for G ι. Proof. Assume (i) is not true. Then, for some a, all geoesis ax are not strongly ι-asi. Choose a geoesi ax 1... x k with the largest numer of elements k. It shoul exist y the same argument as in Theorem 4: Ψ (ι) ax 1... x k (k + 1) inf x y Ψ(ι) xy > 0. Let x i x i+1 e a link in ax with x i not strongly ι-linke to x i+1. Then there exists a geoesi hain x i Yx i+1 with a nonempty Y, whene ax 1... x i Yx i+1... x k is a geoesi hain from a to with more than k elements. This ontraition proves (i). The statements (ii) (iii) are immeiate orollaries. With ι sting for 1 or 2, in a uniformly isrete spae with geoesis, a point a is strongly ι-linke to a point if only if, for any point m istint from a, G ι am > G i a. Proof. We prove the equivalene of the negations of the two statements: (1) a is not strongly ι-linke to means a is onnete to y a geoesi other than a; (2) the negation of the inequality in the formulation is (sine G ι is a metri) the equality G ι am = G i a. If a an e onnete to y a geoesi ax with a nonempty X, then hoosing an element m of this hain, we get the equality aove. Conversely, if this equality is satisfie for some point m, then the onatenation of the geoesis from a to m from m to is a geoesi other than a. 25

26 We emonstrate the use of these results y the following example. Example 11. Consier Figure 3 again. Inspeting, say, the link from a to in the left panel we see that { G1 a = G 1 a = 0 < G 1 a = Sine this exhausts all trias of the form am in this spae, we onlue that a is strongly 1-linke to, Ψ (1) a = G 1 a = 0. We ome to the same onlusion restore the values of Ψ (1) Ψ (2) for all links in Figure 3 with unframe values of istane. For the links with frame values, say, from to in the right panel, we have G 2 = 0.6 = G 1 a = , whene we onlue that a is not strongly 2-linke to. The value of Ψ (2) therefore annot e reonstrute uniquely: it an e any value 0.6. Aknowlegments This researh has een supporte y AFOSR grant FA to Purue University. Referenes Dzhafarov, E. N. (2001). Fehnerian psyhophysis. In N. J. Smelser P. B. Baltes (Es.), International Enylopeia of the Soial Behavioral Sienes (vol. 8, pp ). NY: Pergamon Press. Dzhafarov, E. N. (2002a). Multiimensional Fehnerian saling: Proaility-istane hypothesis. Journal of Mathematial Psyhology, 46, Dzhafarov, E. N. (2002). Multiimensional Fehnerian saling: Pairwise omparisons, regular minimality, nononstant self-similarity. Journal of Mathematial Psyhology, 46, Dzhafarov, E. N. (2008a). Dissimilarity umulation theory in ar-onnete spaes. Journal of Mathematial Psyhology, 52, [see Dzhafarov, E. N. (2009). Corrigenum to Dissimilarity umulation theory in ar-onnete spaes. Journal of Mathematial Psyhology, 53, 300.] Dzhafarov, E. N. (2008). Dissimilarity umulation theory in smoothly onnete spaes. Journal of Mathematial Psyhology, 52, Dzhafarov, E. N. (2010). Dissimilarity, quasiistane, istane. Journal of Mathematial Psyhology, 54, Dzhafarov, E. N., & Colonius, H. (2006). Regular Minimality: A funamental law of isrimination. In H. Colonius E. N. Dzhafarov (Es.), Measurement Representation of Sensations (pp. 1 46). Mahwah, NJ: Erlaum. Dzhafarov, E. N., & Colonius, H. (2007). Dissimilarity Cumulation theory sujetive metris. Journal of Mathematial Psyhology, 51,

27 Dzhafarov, E. N., & Colonius, H. (2011). The Fehnerian iea. Amerian Journal of Psyhology, 124, Falmagne, J. C. (1985). Elements of Psyhophysial Theory. Oxfor: Oxfor University Press. Kujala, J. V., & Dzhafarov, E. N. (2008). On minima of isrimination funtions. Journal of Mathematial Psyhology, 52, Lue, R. D., & Galanter, E. (1963). Disrimination. In R. D. Lue, R. R. Bush, E. Galanter (Es.), Hook of Mathematial Psyhology, vol. 1 (pp ). NY: John Wiley & Sons. 27

2. Properties of Functions

2. Properties of Functions 2. PROPERTIES OF FUNCTIONS 111 2. Properties of Funtions 2.1. Injetions, Surjetions, an Bijetions. Definition 2.1.1. Given f : A B 1. f is one-to-one (short han is 1 1) or injetive if preimages are unique.

More information

Chapter 2: One-dimensional Steady State Conduction

Chapter 2: One-dimensional Steady State Conduction 1 Chapter : One-imensional Steay State Conution.1 Eamples of One-imensional Conution Eample.1: Plate with Energy Generation an Variable Conutivity Sine k is variable it must remain insie the ifferentiation

More information

Math 225B: Differential Geometry, Homework 6

Math 225B: Differential Geometry, Homework 6 ath 225B: Differential Geometry, Homework 6 Ian Coley February 13, 214 Problem 8.7. Let ω be a 1-form on a manifol. Suppose that ω = for every lose urve in. Show that ω is exat. We laim that this onition

More information

Supplementary Materials for A universal data based method for reconstructing complex networks with binary-state dynamics

Supplementary Materials for A universal data based method for reconstructing complex networks with binary-state dynamics Supplementary Materials for A universal ata ase metho for reonstruting omplex networks with inary-state ynamis Jingwen Li, Zhesi Shen, Wen-Xu Wang, Celso Greogi, an Ying-Cheng Lai 1 Computation etails

More information

Journal of Mathematical Analysis and Applications

Journal of Mathematical Analysis and Applications J. Math. Anal. Appl. 371 (010) 759 763 Contents lists available at SieneDiret Journal of Mathematial Analysis an Appliations www.elsevier.om/loate/jmaa Singular Sturm omparison theorems Dov Aharonov, Uri

More information

Chapter 9. There are 7 out of 50 measurements that are greater than or equal to 5.1; therefore, the fraction of the

Chapter 9. There are 7 out of 50 measurements that are greater than or equal to 5.1; therefore, the fraction of the Pratie questions 6 1 a y i = 6 µ = = 1 i = 1 y i µ i = 1 ( ) = 95 = s n 95 555. x i f i 1 1+ + 5+ n + 5 5 + n µ = = = f 11+ n 11+ n i 7 + n = 5 + n = 6n n = a Time (minutes) 1.6.1.6.1.6.1.6 5.1 5.6 6.1

More information

The numbers inside a matrix are called the elements or entries of the matrix.

The numbers inside a matrix are called the elements or entries of the matrix. Chapter Review of Matries. Definitions A matrix is a retangular array of numers of the form a a a 3 a n a a a 3 a n a 3 a 3 a 33 a 3n..... a m a m a m3 a mn We usually use apital letters (for example,

More information

Implementing the Law of Sines to solve SAS triangles

Implementing the Law of Sines to solve SAS triangles Implementing the Law of Sines to solve SAS triangles June 8, 009 Konstantine Zelator Dept. of Math an Computer Siene Rhoe Islan College 600 Mount Pleasant Avenue Proviene, RI 0908 U.S.A. e-mail : kzelator@ri.eu

More information

Euler and Hamilton Paths

Euler and Hamilton Paths Euler an Hamilton Paths The town of Königserg, Prussia (now know as Kaliningra an part of the Russian repuli), was ivie into four setion y ranhes of the Pregel River. These four setions C A D B Figure:

More information

Constraint-free Analog Placement with Topological Symmetry Structure

Constraint-free Analog Placement with Topological Symmetry Structure Constraint-free Analog Plaement with Topologial Symmetry Struture Qing DONG Department of Information an Meia Sienes University of Kitakyushu Wakamatsu, Kitakyushu, Fukuoka, 808-0135, Japan e-mail: ongqing@env.kitakyu-u.a.jp

More information

Computing 2-Walks in Cubic Time

Computing 2-Walks in Cubic Time Computing 2-Walks in Cubi Time Anreas Shmi Max Plank Institute for Informatis Jens M. Shmit Tehnishe Universität Ilmenau Abstrat A 2-walk of a graph is a walk visiting every vertex at least one an at most

More information

Expressiveness of the Interval Logics of Allen s Relations on the Class of all Linear Orders: Complete Classification

Expressiveness of the Interval Logics of Allen s Relations on the Class of all Linear Orders: Complete Classification Proeeings of the Twenty-Seon International Joint Conferene on Artifiial Intelligene Expressiveness of the Interval Logis of Allen s Relations on the Class of all Linear Orers: Complete Classifiation Dario

More information

McCreight s Suffix Tree Construction Algorithm. Milko Izamski B.Sc. Informatics Instructor: Barbara König

McCreight s Suffix Tree Construction Algorithm. Milko Izamski B.Sc. Informatics Instructor: Barbara König 1. Introution MCreight s Suffix Tree Constrution Algorithm Milko Izamski B.S. Informatis Instrutor: Barbara König The main goal of MCreight s algorithm is to buil a suffix tree in linear time. This is

More information

Optimal Distributed Estimation Fusion with Transformed Data

Optimal Distributed Estimation Fusion with Transformed Data Optimal Distribute Estimation Fusion with Transforme Data Zhansheng Duan X. Rong Li Department of Eletrial Engineering University of New Orleans New Orleans LA 70148 U.S.A. Email: {zuanxli@uno.eu Abstrat

More information

arxiv: v1 [quant-ph] 30 Jan 2019

arxiv: v1 [quant-ph] 30 Jan 2019 Universal logial gates with onstant overhea: instantaneous Dehn twists for hyperoli quantum oes Ali Lavasani, Guanyu Zhu, an Maissam Barkeshli Department of Physis, Conense Matter Theory Center, University

More information

Determination the Invert Level of a Stilling Basin to Control Hydraulic Jump

Determination the Invert Level of a Stilling Basin to Control Hydraulic Jump Global Avane Researh Journal of Agriultural Siene Vol. (4) pp. 074-079, June, 0 Available online http://garj.org/garjas/inex.htm Copyright 0 Global Avane Researh Journals Full Length Researh Paper Determination

More information

Combinatorial remarks on two-dimensional Languages

Combinatorial remarks on two-dimensional Languages Combinatorial remarks on two-imensional Languages Franesa De Carli To ite this version: Franesa De Carli. Combinatorial remarks on two-imensional Languages. Mathematis [math]. Université e Savoie 2009.

More information

Some Useful Results for Spherical and General Displacements

Some Useful Results for Spherical and General Displacements E 5 Fall 997 V. Kumar Some Useful Results for Spherial an General Displaements. Spherial Displaements.. Eulers heorem We have seen that a spherial isplaement or a pure rotation is esribe by a 3 3 rotation

More information

A Characterization of Wavelet Convergence in Sobolev Spaces

A Characterization of Wavelet Convergence in Sobolev Spaces A Charaterization of Wavelet Convergene in Sobolev Spaes Mark A. Kon 1 oston University Louise Arakelian Raphael Howard University Dediated to Prof. Robert Carroll on the oasion of his 70th birthday. Abstrat

More information

Zero-Free Region for ζ(s) and PNT

Zero-Free Region for ζ(s) and PNT Contents Zero-Free Region for ζs an PN att Rosenzweig Chebyshev heory ellin ransforms an Perron s Formula Zero-Free Region of Zeta Funtion 6. Jensen s Inequality..........................................

More information

Extended Spectral Nonlinear Conjugate Gradient methods for solving unconstrained problems

Extended Spectral Nonlinear Conjugate Gradient methods for solving unconstrained problems International Journal of All Researh Euation an Sientifi Methos IJARESM ISSN: 55-6 Volume Issue 5 May-0 Extene Spetral Nonlinear Conjuate Graient methos for solvin unonstraine problems Dr Basim A Hassan

More information

CSE 5311 Notes 18: NP-Completeness

CSE 5311 Notes 18: NP-Completeness SE 53 Notes 8: NP-ompleteness (Last upate 7//3 8:3 PM) ELEMENTRY ONEPTS Satisfiability: ( p q) ( p q ) ( p q) ( p q ) Is there an assignment? (Deision Problem) Similar to ebugging a logi iruit - Is there

More information

arxiv: v1 [math-ph] 19 Apr 2009

arxiv: v1 [math-ph] 19 Apr 2009 arxiv:0904.933v1 [math-ph] 19 Apr 009 The relativisti mehanis in a nonholonomi setting: A unifie approah to partiles with non-zero mass an massless partiles. Olga Krupková an Jana Musilová Deember 008

More information

Bidirectionalizing Graph Transformations

Bidirectionalizing Graph Transformations Biiretionalizing Graph Transformations Soihiro Hiaka Kazuhiro Inaa Zhenjiang Hu Hiroyuki Kato National Institute of Informatis, Japan {hiaka,hu,kinaa,kato}@nii.a.jp Kazutaka Matsua Tohoku University, Japan

More information

An Algorithm to Remove Asynchronous ROMs in Circuits with Cycles

An Algorithm to Remove Asynchronous ROMs in Circuits with Cycles 211 eon nternational Conferene on Networking an Computing An Algorithm to emove Asynhronous Ms in Ciruits with Cyles M. Nazrul slam Monal, Koji Nakano, an Yasuaki to Department of nformation Engineering,

More information

1. A dependent variable is also known as a(n). a. explanatory variable b. control variable c. predictor variable d. response variable ANSWER:

1. A dependent variable is also known as a(n). a. explanatory variable b. control variable c. predictor variable d. response variable ANSWER: 1. A epenent variale is also known as a(n). a. explanatory variale. ontrol variale. preitor variale. response variale FEEDBACK: A epenent variale is known as a response variale. Definition of the Simple

More information

Searching All Approximate Covers and Their Distance using Finite Automata

Searching All Approximate Covers and Their Distance using Finite Automata Searhing All Approximate Covers and Their Distane using Finite Automata Ondřej Guth, Bořivoj Melihar, and Miroslav Balík České vysoké učení tehniké v Praze, Praha, CZ, {gutho1,melihar,alikm}@fel.vut.z

More information

Linear Capacity Scaling in Wireless Networks: Beyond Physical Limits?

Linear Capacity Scaling in Wireless Networks: Beyond Physical Limits? Linear Capaity Saling in Wireless Networks: Beyon Physial Limits? Ayfer Özgür, Olivier Lévêque EPFL, Switzerlan {ayfer.ozgur, olivier.leveque}@epfl.h Davi Tse University of California at Berkeley tse@ees.berkeley.eu

More information

Complexity of Regularization RBF Networks

Complexity of Regularization RBF Networks Complexity of Regularization RBF Networks Mark A Kon Department of Mathematis and Statistis Boston University Boston, MA 02215 mkon@buedu Leszek Plaskota Institute of Applied Mathematis University of Warsaw

More information

Structural and Strongly Structural Input and State Observability of Linear Network Systems

Structural and Strongly Structural Input and State Observability of Linear Network Systems Strutural an Strongly Strutural Input an State Oservaility of Linear Network Systems Sein Gray Feeria Garin Alain Kiangou To ite this version: Sein Gray Feeria Garin Alain Kiangou Strutural an Strongly

More information

On the sustainability of collusion in Bertrand supergames with discrete pricing and nonlinear demand

On the sustainability of collusion in Bertrand supergames with discrete pricing and nonlinear demand PRA unih Personal RePE Arhive On the sustainability of ollusion in Bertran supergames with isrete priing an nonlinear eman Paul R. Zimmerman US Feeral Trae Commission 25. January 2010 Online at http://mpra.ub.uni-muenhen.e/20249/

More information

Sampler-B. Secondary Mathematics Assessment. Sampler 521-B

Sampler-B. Secondary Mathematics Assessment. Sampler 521-B Sampler-B Seonary Mathematis Assessment Sampler 51-B Instrutions for Stuents Desription This sample test inlues 15 Selete Response an 5 Construte Response questions. Eah Selete Response has a value of

More information

Ordering Generalized Trapezoidal Fuzzy Numbers. Using Orthocentre of Centroids

Ordering Generalized Trapezoidal Fuzzy Numbers. Using Orthocentre of Centroids International Journal of lgera Vol. 6 no. 69-85 Ordering Generalized Trapezoidal Fuzzy Numers Using Orthoentre of Centroids Y. L. P. Thorani P. Phani Bushan ao and N. avi Shanar Dept. of pplied Mathematis

More information

A population of 50 flies is expected to double every week, leading to a function of the x

A population of 50 flies is expected to double every week, leading to a function of the x 4 Setion 4.3 Logarithmi Funtions population of 50 flies is epeted to doule every week, leading to a funtion of the form f ( ) 50(), where represents the numer of weeks that have passed. When will this

More information

THE SHIFTED PLACTIC MONOID arxiv: v1 [math.co] 13 Nov 2008

THE SHIFTED PLACTIC MONOID arxiv: v1 [math.co] 13 Nov 2008 THE SHIFTED PLACTIC MONOID arxiv:0811.057v1 [math.co] 13 Nov 008 LUIS SERRANO Astrat. We introdue a shifted analog of the plati monoid of Lasoux and Shützenerger, the shifted plati monoid. It an e defined

More information

Discrete Bessel functions and partial difference equations

Discrete Bessel functions and partial difference equations Disrete Bessel funtions and partial differene equations Antonín Slavík Charles University, Faulty of Mathematis and Physis, Sokolovská 83, 186 75 Praha 8, Czeh Republi E-mail: slavik@karlin.mff.uni.z Abstrat

More information

REFINED UPPER BOUNDS FOR THE LINEAR DIOPHANTINE PROBLEM OF FROBENIUS. 1. Introduction

REFINED UPPER BOUNDS FOR THE LINEAR DIOPHANTINE PROBLEM OF FROBENIUS. 1. Introduction Version of 5/2/2003 To appear in Advanes in Applied Mathematis REFINED UPPER BOUNDS FOR THE LINEAR DIOPHANTINE PROBLEM OF FROBENIUS MATTHIAS BECK AND SHELEMYAHU ZACKS Abstrat We study the Frobenius problem:

More information

On Equivalence Between Network Topologies

On Equivalence Between Network Topologies On Equivalene Between Network Topologies Trae Ho Department of Eletrial Engineering California Institute of Tehnolog tho@alteh.eu; Mihelle Effros Departments of Eletrial Engineering California Institute

More information

An Integer Solution of Fractional Programming Problem

An Integer Solution of Fractional Programming Problem Gen. Math. Notes, Vol. 4, No., June 0, pp. -9 ISSN 9-784; Copyright ICSRS Publiation, 0 www.i-srs.org Available free online at http://www.geman.in An Integer Solution of Frational Programming Problem S.C.

More information

Reliability Optimization With Mixed Continuous-Discrete Random Variables and Parameters

Reliability Optimization With Mixed Continuous-Discrete Random Variables and Parameters Subroto Gunawan Researh Fellow Panos Y. Papalambros Professor e-mail: pyp@umih.eu Department of Mehanial Engineering, University of Mihigan, Ann Arbor, MI 4809 Reliability Optimization With Mixe Continuous-Disrete

More information

The Hanging Chain. John McCuan. January 19, 2006

The Hanging Chain. John McCuan. January 19, 2006 The Hanging Chain John MCuan January 19, 2006 1 Introdution We onsider a hain of length L attahed to two points (a, u a and (b, u b in the plane. It is assumed that the hain hangs in the plane under a

More information

I F I G R e s e a r c h R e p o r t. Minimal and Hyper-Minimal Biautomata. IFIG Research Report 1401 March Institut für Informatik

I F I G R e s e a r c h R e p o r t. Minimal and Hyper-Minimal Biautomata. IFIG Research Report 1401 March Institut für Informatik I F I G R e s e a r h R e p o r t Institut für Informatik Minimal and Hyper-Minimal Biautomata Markus Holzer Seastian Jakoi IFIG Researh Report 1401 Marh 2014 Institut für Informatik JLU Gießen Arndtstraße

More information

Sequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson & J. Fischer) January 21,

Sequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson & J. Fischer) January 21, Sequene Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson & J. Fisher) January 21, 201511 9 Suffix Trees and Suffix Arrays This leture is based on the following soures, whih are all reommended

More information

(q) -convergence. Comenius University, Bratislava, Slovakia

(q) -convergence.   Comenius University, Bratislava, Slovakia Annales Mathematiae et Informatiae 38 (2011) pp. 27 36 http://ami.ektf.hu On I (q) -onvergene J. Gogola a, M. Mačaj b, T. Visnyai b a University of Eonomis, Bratislava, Slovakia e-mail: gogola@euba.sk

More information

Hankel Optimal Model Order Reduction 1

Hankel Optimal Model Order Reduction 1 Massahusetts Institute of Tehnology Department of Eletrial Engineering and Computer Siene 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Hankel Optimal Model Order Redution 1 This leture overs both

More information

Chapter 8 Hypothesis Testing

Chapter 8 Hypothesis Testing Leture 5 for BST 63: Statistial Theory II Kui Zhang, Spring Chapter 8 Hypothesis Testing Setion 8 Introdution Definition 8 A hypothesis is a statement about a population parameter Definition 8 The two

More information

CS 491G Combinatorial Optimization Lecture Notes

CS 491G Combinatorial Optimization Lecture Notes CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

More information

Appendix A Market-Power Model of Business Groups. Robert C. Feenstra Deng-Shing Huang Gary G. Hamilton Revised, November 2001

Appendix A Market-Power Model of Business Groups. Robert C. Feenstra Deng-Shing Huang Gary G. Hamilton Revised, November 2001 Appendix A Market-Power Model of Business Groups Roert C. Feenstra Deng-Shing Huang Gary G. Hamilton Revised, Novemer 200 Journal of Eonomi Behavior and Organization, 5, 2003, 459-485. To solve for the

More information

Sufficient Conditions for a Flexible Manufacturing System to be Deadlocked

Sufficient Conditions for a Flexible Manufacturing System to be Deadlocked Paper 0, INT 0 Suffiient Conditions for a Flexile Manufaturing System to e Deadloked Paul E Deering, PhD Department of Engineering Tehnology and Management Ohio University deering@ohioedu Astrat In reent

More information

Announcements. Office Hours Swap: OH schedule has been updated to reflect this.

Announcements. Office Hours Swap: OH schedule has been updated to reflect this. SA Solving Announements Offie Hours Swap: Zavain has offie hours from 4-6PM toay in builing 460, room 040A. Rose has offie hours tonight from 7-9PM in Gates B26B. Keith has offie hours hursay from 2-4PM

More information

5. Feynman Diagrams. Particle and Nuclear Physics. Dr. Tina Potter. Dr. Tina Potter 5. Feynman Diagrams 1

5. Feynman Diagrams. Particle and Nuclear Physics. Dr. Tina Potter. Dr. Tina Potter 5. Feynman Diagrams 1 5. Feynman Diarams Partile an Nulear Physis Dr. Tina Potter 2017 Dr. Tina Potter 5. Feynman Diarams 1 In this setion... Introution to Feynman iarams. Anatomy of Feynman iarams. Allowe verties. General

More information

Optimal Design of Fault-Tolerant Petri Net Controllers

Optimal Design of Fault-Tolerant Petri Net Controllers Optial Design of Fault-Tolerant Petri Net ontrollers Yizhi Qu, Lingxi Li, Yaobin hen, an Yaping Dai Abstrat This paper proposes an approah for the optial esign of fault-tolerant Petri net ontrollers Given

More information

Force Reconstruction for Nonlinear Structures in Time Domain

Force Reconstruction for Nonlinear Structures in Time Domain Fore Reonstrution for Nonlinear Strutures in ime Domain Jie Liu 1, Bing Li 2, Meng Li 3, an Huihui Miao 4 1,2,3,4 State Key Laboratory for Manufaturing Systems Engineering, Xi an Jiaotong niversity, Xi

More information

Millennium Relativity Acceleration Composition. The Relativistic Relationship between Acceleration and Uniform Motion

Millennium Relativity Acceleration Composition. The Relativistic Relationship between Acceleration and Uniform Motion Millennium Relativity Aeleration Composition he Relativisti Relationship between Aeleration and niform Motion Copyright 003 Joseph A. Rybzyk Abstrat he relativisti priniples developed throughout the six

More information

Problem set 6 for the course Theoretical Optics Sample Solutions

Problem set 6 for the course Theoretical Optics Sample Solutions Karlsruher Institut für Tehnologie KIT) Institut für theoretishe Festkörperphysik SS01 Prof. Dr. G. Shön, Dr. R. Frank 15.06.01 http://www.tfp.kit.eu/stuium-lehre.php Tutorial: Group 1, Name: Group, Group

More information

On Predictive Density Estimation for Location Families under Integrated Absolute Error Loss

On Predictive Density Estimation for Location Families under Integrated Absolute Error Loss On Preitive Density Estimation for Loation Families uner Integrate Absolute Error Loss Tatsuya Kubokawa a, Éri Marhanb, William E. Strawerman a Department of Eonomis, University of Tokyo, 7-3- Hongo, Bunkyo-ku,

More information

the following action R of T on T n+1 : for each θ T, R θ : T n+1 T n+1 is defined by stated, we assume that all the curves in this paper are defined

the following action R of T on T n+1 : for each θ T, R θ : T n+1 T n+1 is defined by stated, we assume that all the curves in this paper are defined How should a snake turn on ie: A ase study of the asymptoti isoholonomi problem Jianghai Hu, Slobodan N. Simić, and Shankar Sastry Department of Eletrial Engineering and Computer Sienes University of California

More information

A Functional Representation of Fuzzy Preferences

A Functional Representation of Fuzzy Preferences Theoretial Eonomis Letters, 017, 7, 13- http://wwwsirporg/journal/tel ISSN Online: 16-086 ISSN Print: 16-078 A Funtional Representation of Fuzzy Preferenes Susheng Wang Department of Eonomis, Hong Kong

More information

Brazilian Journal of Physics, vol. 29, no. 1, March,

Brazilian Journal of Physics, vol. 29, no. 1, March, Brazilian Journal of hysis, vol. 29, no., Marh, 999 79 Computational Methos Inspire by Tsallis Statistis: Monte Carlo an Moleular Dynamis Algorithms for the Simulation of Classial an Quantum Systems John

More information

LECTURE NOTES FOR , FALL 2004

LECTURE NOTES FOR , FALL 2004 LECTURE NOTES FOR 18.155, FALL 2004 83 12. Cone support and wavefront set In disussing the singular support of a tempered distibution above, notie that singsupp(u) = only implies that u C (R n ), not as

More information

CMSC 451: Lecture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017

CMSC 451: Lecture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017 CMSC 451: Leture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017 Reading: Chapt 11 of KT and Set 54 of DPV Set Cover: An important lass of optimization problems involves overing a ertain domain,

More information

On Component Order Edge Reliability and the Existence of Uniformly Most Reliable Unicycles

On Component Order Edge Reliability and the Existence of Uniformly Most Reliable Unicycles Daniel Gross, Lakshmi Iswara, L. William Kazmierzak, Kristi Luttrell, John T. Saoman, Charles Suffel On Component Order Edge Reliability and the Existene of Uniformly Most Reliable Uniyles DANIEL GROSS

More information

Methods of evaluating tests

Methods of evaluating tests Methods of evaluating tests Let X,, 1 Xn be i.i.d. Bernoulli( p ). Then 5 j= 1 j ( 5, ) T = X Binomial p. We test 1 H : p vs. 1 1 H : p>. We saw that a LRT is 1 if t k* φ ( x ) =. otherwise (t is the observed

More information

CSIR-UGC NET/JRF JUNE - 6 PHYSICAL SCIENCES OOKLET - [A] PART. The raius of onvergene of the Taylor series epansion of the funtion (). The value of the ontour integral the anti-lokwise iretion, is 4z e

More information

Maximum Entropy and Exponential Families

Maximum Entropy and Exponential Families Maximum Entropy and Exponential Families April 9, 209 Abstrat The goal of this note is to derive the exponential form of probability distribution from more basi onsiderations, in partiular Entropy. It

More information

Common Mistakes & How to avoid them Class X - Math. Unit: Algebra. Types of Question Common Mistakes Points to be emphasised. points.

Common Mistakes & How to avoid them Class X - Math. Unit: Algebra. Types of Question Common Mistakes Points to be emphasised. points. Common Mistakes & How to avoid them Class X - Math Unit: Algera Chapter: Pair of Linear Equations in Two Variales Types of Question Common Mistakes Points to e emphasised Solving the system of (i) Error

More information

Design of elementary switches for high power with minimal moving mass

Design of elementary switches for high power with minimal moving mass Design of elementary swithes for high power with minimal moving mass alter Holaus ETH Zürih, High Voltage Laoratory Physistrasse 3, CH-89 Zurih Switzerlan ABSTRACT For the use in hyri systems an for synhronous

More information

Simultaneous and Sequential Auctions of Oligopoly Licenses

Simultaneous and Sequential Auctions of Oligopoly Licenses Simultaneous an Sequential Autions of Oligopoly Lienses Georgios Katsenos Institut für Mikroökonomik, Leibniz Universität Hannover September 1, 2007 Abstrat This paper ompares two proeures for alloating

More information

18 Numerical Integration of Functions

18 Numerical Integration of Functions Slightly moifie //9, /8/6 Firstly written at Marh 5 8 Numerial Integration of Funtions Introution Romberg Integration Gauss Quarature Aaptive Quarature Case Stuy: Root-Mean-Square Current DM869/Computational

More information

MULTIPLE-INPUT MULTIPLE-OUTPUT (MIMO) is. Spatial Degrees of Freedom of Large Distributed MIMO Systems and Wireless Ad Hoc Networks

MULTIPLE-INPUT MULTIPLE-OUTPUT (MIMO) is. Spatial Degrees of Freedom of Large Distributed MIMO Systems and Wireless Ad Hoc Networks 22 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 3, NO. 2, FEBRUARY 23 Spatial Degrees of Freeom of Large Distribute MIMO Systems an Wireless A Ho Networks Ayfer Özgür, Member, IEEE, OlivierLévêque,

More information

Microeconomic Theory I Assignment #7 - Answer key

Microeconomic Theory I Assignment #7 - Answer key Miroeonomi Theory I Assignment #7 - Answer key. [Menu priing in monopoly] Consider the example on seond-degree prie disrimination (see slides 9-93). To failitate your alulations, assume H = 5, L =, and

More information

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

Sensitivity Analysis of Resonant Circuits

Sensitivity Analysis of Resonant Circuits 1 Sensitivity Analysis of Resonant Ciruits Olivier Buu Abstrat We use first-orer perturbation theory to provie a loal linear relation between the iruit parameters an the poles of an RLC network. The sensitivity

More information

The Complete Energy Translations in the Detailed. Decay Process of Baryonic Sub-Atomic Particles. P.G.Bass.

The Complete Energy Translations in the Detailed. Decay Process of Baryonic Sub-Atomic Particles. P.G.Bass. The Complete Energy Translations in the Detailed Deay Proess of Baryoni Su-Atomi Partiles. [4] P.G.Bass. PGBass P12 Version 1..3 www.relativitydomains.om August 218 Astrat. This is the final paper on the

More information

Review Topic 4: Cubic polynomials

Review Topic 4: Cubic polynomials Review Topi : ui polynomials Short answer Fatorise Px ( ) = x + 5x + x- 9 into linear fators. The polynomial Px ( ) = x - ax + x- leaves a remainer of when it is ivie y ( x - ) an a remainer of - when

More information

Logic, Set Theory and Computability [M. Coppenbarger]

Logic, Set Theory and Computability [M. Coppenbarger] 14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer

More information

Aharonov-Bohm effect. Dan Solomon.

Aharonov-Bohm effect. Dan Solomon. Aharonov-Bohm effet. Dan Solomon. In the figure the magneti field is onfined to a solenoid of radius r 0 and is direted in the z- diretion, out of the paper. The solenoid is surrounded by a barrier that

More information

Implicit Differentiation

Implicit Differentiation Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,

More information

Math 342 Partial Differential Equations «Viktor Grigoryan

Math 342 Partial Differential Equations «Viktor Grigoryan Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite

More information

The Computational Complexity of the Unrooted Subtree Prune and Regraft Distance. Technical Report CS

The Computational Complexity of the Unrooted Subtree Prune and Regraft Distance. Technical Report CS The Computational Complexit of the Unroote ubtree rune an egraft Distane Glenn Hike Frank Dehne Anrew au-chaplin Christian Blouin Tehnial eport C-006-06 Jul, 006 Fault of Computer iene 6050 Universit Ave.,

More information

CIT 596 Theory of Computation 1. Graphs and Digraphs

CIT 596 Theory of Computation 1. Graphs and Digraphs CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege

More information

Examining Applied Rational Functions

Examining Applied Rational Functions HiMAP Pull-Out Setion: Summer 1990 Eamining Applied Rational Funtions Flod Vest Referenes Environmental Protetion Agen. Gas Mileage Guide. (Copies an usuall e otained from a loal new ar dealer.) Information

More information

SRC Research. Report. An Efficient Matching Algorithm for a High-Throughput, Low-Latency Data Switch. Thomas L. Rodeheffer and James B.

SRC Research. Report. An Efficient Matching Algorithm for a High-Throughput, Low-Latency Data Switch. Thomas L. Rodeheffer and James B. Novemer 5, 998 SRC Researh Report 6 An Effiient Mathing Algorithm for a High-Throughput, Low-Lateny Data Swith Thomas L Rodeheffer and James B Saxe Systems Researh Center 30 Lytton Avenue Palo Alto, CA

More information

GEOMETRIC AND STOCHASTIC ERROR MINIMISATION IN MOTION TRACKING. Karteek Alahari, Sujit Kuthirummal, C. V. Jawahar, P. J. Narayanan

GEOMETRIC AND STOCHASTIC ERROR MINIMISATION IN MOTION TRACKING. Karteek Alahari, Sujit Kuthirummal, C. V. Jawahar, P. J. Narayanan GEOMETRIC AND STOCHASTIC ERROR MINIMISATION IN MOTION TRACKING Karteek Alahari, Sujit Kuthirummal, C. V. Jawahar, P. J. Narayanan Centre for Visual Information Tehnology International Institute of Information

More information

Malaysian Journal of Civil Engineering 22(2) : (2010) Skudai, Johor, Malaysia. *Corresponding Author:

Malaysian Journal of Civil Engineering 22(2) : (2010) Skudai, Johor, Malaysia. *Corresponding Author: A STUDY ON FLXURAL MODULUS AND DUCTILITY OF LAMINATD CMNTITIOUS COMPOSITS M. Zakaria Hossain 1, A.S.M. Aul Awal 2* 1 Grauate Shool of Bioresoures, Mie University, Japan 2 Faulty of Civil ngineering, Universiti

More information

A NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM

A NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM NETWORK SIMPLEX LGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM Cen Çalışan, Utah Valley University, 800 W. University Parway, Orem, UT 84058, 801-863-6487, en.alisan@uvu.edu BSTRCT The minimum

More information

Asymptotic behavior of solutions to wave equations with a memory condition at the boundary

Asymptotic behavior of solutions to wave equations with a memory condition at the boundary Eletroni Journal of Differential Equations, Vol. 2(2), No. 73, pp.. ISSN: 72-669. URL: http://eje.math.swt.eu or http://eje.math.unt.eu ftp eje.math.swt.eu (login: ftp) Asymptoti behavior of solutions

More information

On the density of languages representing finite set partitions

On the density of languages representing finite set partitions On the density of languages representing finite set partitions Nelma Moreira Rogério Reis Tehnial Report Series: DCC-04-07 Departamento de Ciênia de Computadores Fauldade de Ciênias & Laboratório de Inteligênia

More information

F = F x x + F y. y + F z

F = F x x + F y. y + F z ECTION 6: etor Calulus MATH20411 You met vetors in the first year. etor alulus is essentially alulus on vetors. We will need to differentiate vetors and perform integrals involving vetors. In partiular,

More information

Optimal torque control of permanent magnet synchronous machines using magnetic equivalent circuits

Optimal torque control of permanent magnet synchronous machines using magnetic equivalent circuits This oument ontains a post-print version of the paper Optimal torque ontrol of permanent magnet synhronous mahines using magneti equivalent iruits authore by W. Kemmetmüller, D. Faustner, an A. Kugi an

More information

Remark 4.1 Unlike Lyapunov theorems, LaSalle s theorem does not require the function V ( x ) to be positive definite.

Remark 4.1 Unlike Lyapunov theorems, LaSalle s theorem does not require the function V ( x ) to be positive definite. Leture Remark 4.1 Unlike Lyapunov theorems, LaSalle s theorem does not require the funtion V ( x ) to be positive definite. ost often, our interest will be to show that x( t) as t. For that we will need

More information

Where as discussed previously we interpret solutions to this partial differential equation in the weak sense: b

Where as discussed previously we interpret solutions to this partial differential equation in the weak sense: b Consider the pure initial value problem for a homogeneous system of onservation laws with no soure terms in one spae dimension: Where as disussed previously we interpret solutions to this partial differential

More information

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if

More information

Supplementary Materials

Supplementary Materials Supplementary Materials Neural population partitioning and a onurrent brain-mahine interfae for sequential motor funtion Maryam M. Shanehi, Rollin C. Hu, Marissa Powers, Gregory W. Wornell, Emery N. Brown

More information

Math 151 Introduction to Eigenvectors

Math 151 Introduction to Eigenvectors Math 151 Introdution to Eigenvetors The motivating example we used to desrie matrixes was landsape hange and vegetation suession. We hose the simple example of Bare Soil (B), eing replaed y Grasses (G)

More information

374 K.ORIUCI Figure 1. one dimensional irreversile positive or negative diretions. Figure 2. one dimensional reversile Y > ^ Figure 3. two dimensional

374 K.ORIUCI Figure 1. one dimensional irreversile positive or negative diretions. Figure 2. one dimensional reversile Y > ^ Figure 3. two dimensional Sientiae Mathematiae Vol. 2, No. 3(1999), 373{384 373 TRICE AND TWO DELEGATES OPERATION KIYOMITSU ORIUCI Reeived Otoer 1, 1999 Astrat. The onept of \trie " was introdued in [5] and [] for the purpose of

More information

On maximal inequalities via comparison principle

On maximal inequalities via comparison principle Makasu Journal of Inequalities and Appliations (2015 2015:348 DOI 10.1186/s13660-015-0873-3 R E S E A R C H Open Aess On maximal inequalities via omparison priniple Cloud Makasu * * Correspondene: makasu@uw.a.za

More information

arxiv:cond-mat/ v1 [cond-mat.stat-mech] 16 Aug 2004

arxiv:cond-mat/ v1 [cond-mat.stat-mech] 16 Aug 2004 Computational omplexity and fundamental limitations to fermioni quantum Monte Carlo simulations arxiv:ond-mat/0408370v1 [ond-mat.stat-meh] 16 Aug 2004 Matthias Troyer, 1 Uwe-Jens Wiese 2 1 Theoretishe

More information

Indian Institute of Technology Bombay. Department of Electrical Engineering. EE 325 Probability and Random Processes Lecture Notes 3 July 28, 2014

Indian Institute of Technology Bombay. Department of Electrical Engineering. EE 325 Probability and Random Processes Lecture Notes 3 July 28, 2014 Indian Institute of Tehnology Bombay Department of Eletrial Engineering Handout 5 EE 325 Probability and Random Proesses Leture Notes 3 July 28, 2014 1 Axiomati Probability We have learned some paradoxes

More information

arxiv: v1 [hep-th] 30 Aug 2015

arxiv: v1 [hep-th] 30 Aug 2015 **University of Marylan * Center for String an Partile Theory* Physis Department***University of Marylan *Center for String an Partile Theory** **University of Marylan * Center for String an Partile Theory*

More information