Melodic contour estimation with B-spline models using a MDL criterion

Size: px
Start display at page:

Download "Melodic contour estimation with B-spline models using a MDL criterion"

Transcription

1 Meodic contour estimation with B-spine modes using a MDL criterion Damien Loive, Ney Barbot, Oivier Boeffard IRISA / University of Rennes 1 - ENSSAT 6 rue de Kerampont, B.P , F-305 Lannion Cedex France {damien.oive,ney.barbot,oivier.boeffard}@irisa.fr Abstract This artice describes a new approach to estimate F 0 curves using a B-Spine mode characterized by a knot sequence and associated contro points. The free parameters of the mode are the number of knots and their ocation. The free-knot pacement, which is a NP-hard probem, is done using a goba MLE within a simuated-anneaing strategy. The optima knot number estimation is provided by MDL methodoogy. Three criteria are proposed: contro points are first considered as integer vaues, next as rea coefficients with fixed precision and then with variabe precision. Experiments are conducted in a speech processing context on a 7000 syabes french corpus. We show that a variabe precision criterion gives better resuts in terms of RMS error (0.4Hz) as we as in terms of reduction of the number of B-spine degrees of freedom (63% of the fu mode). 1. Introduction Intonationa speech modes are widey used in the speech technoogy fied. In particuar, Text-to-Speech synthesis (TTS) cannot circumvent the use of such modes to predict meodic contours from text and speaking styes. More recenty, these modes were used to find an optima sequence of acoustic units taking account of prosodic characteristics [1]. Athough intonation resuts from a combination of numerous inguistic factors, this artice focuses on the acoustic parameters known to be the main factor of prosodic perception, which is the fundamenta frequency F 0. F 0 contours, extracted from speech signa, ensue from the evoution of the vibration of the voca fods over time. A wide range of pubications deas with modeing of such contours. Especiay, we can cite modes ike MoMe [], Tit [3], as we as Sakai and Gass s mode [4] based on reguar spine functions. In this artice, we propose a B-spine styisation which integrates variabe oca reguarity notion without affecting the goba approximation of the F 0 curve, estimated according to the east square error criterion. In [5], a comparison between spines and B-spines abiity to mode F 0 is presented using a east squares criterion. The parameters of the B-spine mode are the knot number and their pacement. A free-knot pacement aows to catch contour irreguarities. A Monte-Caro type agorithm (Simuated-Anneaing) is impemented to circumvent the combinatoria compexity of the free-knot pacement. Our main goa is then to estimate the optima number of knots and to determine a parsimonious cass of B-spine curves. The framework we choose is the minimum description ength (MDL) criterion which offers an efficient compromise between mode precision and its number of parameters. In section, we introduce the B-spine mode and its parameters, estimated in section 3 according to a east squares criterion. In section 4, we present the MDL criteria to optimize the number of parameters of the mode. In section 5, the experimenta protoco is described and resuts are given in section 6.. B-spine mode In this section, we present the spine functions and their generaization to B-spine curves which have the abiity to mode open curves with variabe oca reguarity. Let us consider an interva [a, b] and its subdivision into + 1 sub-intervas: a = t m <... < t m++1 = b. A spine of degree m associated to (t i ) is a poynomia function of degree m inside each sub-interva and beongs to the cass of functions C m 1, which are m 1 times continuousy differentiabe, on [a, b). The transition points are caed the interna knots. The set of spines of degree m is a inear space of dimension m In [], the MoMe agorithm aims to provide meodic contour representation using a quadratic spine. For that, n target points are estimated to constitute the stationary points of a spine of degree. Transition points (t i ) correspond to the abscissas of the n target points and their n 1 median points. Thus, the quadratic spine is associated to = n 3 interna knots and is characterized by the n constraints due to the n points to interpoate with an horizonta tangent. The inear space of spines associated to (t i) admits a basis of B-spine functions. In order to define them, we add to this knot sequence the (m+1) times dupicated vaues t 0 = t m = a and t m++1 = t m++1 = b, caed externa knots. We denote t the vector containing the interna and externa knots. Then, B-spines are recursivey defined: for i from 0 to m +, the B-spines of degree 0 are given by B i 0(t) = 1 [ti,t i+1 )(t) and for i from 0 to m +, the B-spines of degree m are given by B i m(t) = t ti Bm 1(t) i + ti+m+1 t B t i+m t i t i+m+1 t m 1(t) i+1 i+1 where quotients equa zero if t i = t i+m or t i+1 = t i+m+1. Moreover, B-spines are non-negative and satisfy t [a, b), m+ X i=0 B i m(t) = 1. (1)

2 Consequenty, a spine function of degree m can be written as a inear combination of B-spine functions of same degree. Spine generaization to B-spine curve aows dupicated knots, the knot mutipicity corresponding to the number of times it appears in t. This way, a B-spine curve of degree m associated to a knot vector t can be written as a inear combination of B-spine functions of degree m where the coefficients c 0,..., c m+ are caed contro points. Let a sequence x 0,..., x N 1 inside [a, b], the matrix representation of the B-spine curve at point x j is given by g θ (x j) = m+ X i=0 c ib i m (x j) = (Bc) j () where B i m(x j) is the (j, i)-th entry of the matrix B, c is the coumn vector containing the contro points and θ = (t m+1,..., t m+, c 0,..., c +m ). Now we assess the impact of each parameter of a B-spine curve g θ. The knot effect on the curve g θ is mainy controed by its mutipicity. If we consider an interna knot t i, greater its mutipicity m i is, ower is the smoothness of the curve at t i. More precisey, if g θ beongs to C m 1 between two consecutive knots, it beongs to C m m i at knot t i. For instance, if m i = m 1 the curvature of the B-spine curve changes at t i, if m i = m the curve can not be differentiated at t i and if m i > m, it is not continuous at t i. As regards contro points, they have a oca infuence. Indeed, suppose we change the position of c i, it ony aters the term c i Bm i in (), and since Bm i is zero outside [t i, t i+m+1 ), it does not propagate outside the corresponding curve segment. 3. Parameter estimation Let a set of measurements {(x j, y j), 0 j N 1} of a meodic contour, where (x j ) is a non-decreasing sequence. Take the probem of the B-spine curve g θ of degree m such as the points (x j, g θ (x j )) best fit these data using the east squares error criterion. In this section, we suppose the number of interna knots known, and et t 0 = t m = x 0 and t m++1 = t m++1 = x N 1. First, we derive the optima contro points and then we estimate the interna knot ocation Contro points In this section, the knot vector t is supposed known and we determine the B-spine curve g θ of degree m, that is to say its contro points, which minimizes the mean square error with the data. Let us denote y the coumn vector containing the y j, the contro points are estimated such as bc = arg min c y Bc according to (). After derivation, we obtain bc = B T B 1 B T y (3) if the matrix B T B is invertibe, i.e. when the coumns of B are ineary independent. That is to say t must not have knots with mutipicity order greater than m+1 to avoid nu coumns of B. Besides, the number N of ines of B has to be reay greater than the number of coumns in order to differentiate the coumns, i.e. N m (4) Finay, for a given knot sequence t, the optima B-spine curve of degree m according to a east squares criterion is described by the N foowing points x j (Bbc) j = 3.. Knot pacement 1 B B B T B T y. (5) j Let us now consider the optimization of the interna knot ocation. We introduce the maximum ikeihood criterion and we choose a Monte-Caro strategy (Simuated-Anneaing, SA) to compute the soution b t of this NP-hard probem. We restrict the knot ocation to the set of observations, and knots can then be represented by integers between 0 and N 1. Our experiments show that such a restriction does not seem to decrease the quaity of the fina curve estimate. Let us denote e j the error between the observation y j at time x j and its estimation g θ (x j ). To simpify cacuus, the errors e 0,..., e N 1 are supposed independent and identicay distributed according to a zero mean Gaussian aw with variance σ. Then, given the mode, the og-ikeihood of y is og p y; θ = 1 σ y Bc N og πσ. (6) Let us notice that bc, defined by (3), is the maximum ikeihood estimate of c. The maximum ikeihood estimate b t of t is defined by b t = arg min t y B B T B 1 B T y where the matrix B depends on t. To determine b t, we used a goba optimization agorithm based on the Simuated-Anneaing (SA) strategy, presented in [5]. The proposed reation between the parameters of the mode and the random distributions of the SA agorithm is as foows: 1. SA sampes a vector v inside {x 1,..., x N }.. An interna knot vector t is defined by sorting the coordinates of v. 3. A knot vector t is defined by adding (m + 1) times x 0 and x N 1 to the extremities of t. 4. If two consecutive knots ie in an interva smaer than 5% of the fu range [x 0, x N 1 ], the two knots are merged and the mutipicity order of the first knot is increased by one. This process is then appied recursivey to a the knots defining t. Let us reca that knot mutipicity must not be greater than m + 1. Before tacking the optimization of the number of interna knots, it is usefu to sum up the main choices and strategies as regards the considered B-spine mode b θ. First, for a given, we start to estimate an optima knot-sequence b t using the SA agorithm. Then with the associated matrix B and (3), we compute the optima bc. In the foowing section, we ook for the best mode, that is to say the optima vaue of, according to a MDL criterion. 4. B-spine and MDL The minimum description ength (MDL) criterion enabes a compromise between the quaity of a mode b θ and its compexity. More precisey, MDL consists in determining b which

3 minimizes the description ength L(y) of the data y. According to [6], we have b = arg min where L bθ L(y) = arg min L bθ og p y; θ b and og p y; b θ stand respectivey for the description ength of the estimated mode and the observations conditioned by the mode. The expression (6), using the unknown error variance σ, we use its maximum ikeihood estimate c σ : cσ = arg max σ og p y; θ b = 1 N y Bbc. Hence, σ is estimated by the root mean square error (RMS) between the observations and the B-spine curve. Thus, using expression (6), we have L(y) = L bθ 4.1. Principe of soution + N + N og (π) + N og (RMS). We consider now the description ength of the vector θ b. This one is composed of interna knots and ( + m + 1) contro points. We suppose that the knots have a the same description ength, as we as the contro points. Regarding the interna knots, they are inside the interva (x 0, x N 1 ) at observation paces. Hence, each knot can be represented by an integer between 0 and N 1 and so og (N) bits are sufficient to encode it. As for the contro points, they are rea parameters estimated from N data points. When N is arge, the ength of a rea parameter is generay approached by og ( N) which is asymptoticay optima [6]. However, each contro point has a oca infuence on the B-spine mode g θ b and if the number of observations is sma the asymptotic approximation is not we adapted [7]. We then consider a description ength of a contro point based on a uniform prior on the interva [ α, α] [8]. For a given contro point description ength precision ε, its ength is given by og (α) + 1 og (ε). The choices of α and ε are discussed in the foowing paragraph. In short, the description ength of θ b can be written as L bθ = og (N) + (m + + 1) (og (α) + 1 og (ε)). 4.. Theoretica bounds on contro points For a given b t, the contro points bc are assumed generated by an uniform prior on [ α, α]. The maximum ikeihood estimate of α is bc = max i bc i. Thus, moduo a constant independent of, we obtain the first MDL criterion L(y) = (m + + 1) og bc + 1 og (ε) +N og (RMS) + og (N) (7) denoted criterion (a). Considering the expression (3) of bc, we estabish a bound on contro point definition interva and we can then consider the associated uniform prior. Proposition 4.1 Let us denote µ the smaest singuar vaue of the matrix B, we have µ > 0 and bc y /µ. Proof. The matrix B being of maxima rank, i.e. m + + 1, its smaest singuar vaue µ is positive. According to [9], and using (3), we have (B T B) 1 B T = 1/µ bc bc = (B T B) 1 B T y (B T B) 1 B T y y /µ. From proposition 4.1, if the contro points are assumed uniformy distributed on [ y /µ, y /µ], we obtain the foowing MDL criterion L(y) = (m + + 1) (og ( y /µ) + 1 og (ε)) denoted criterion (b) Contro point precision +N og (RMS) + og (N) (8) For a given b t, we now study the infuence of the contro point precision ε on the rebuit mode. Let us noteec an approximation of bc such that ec bc ε. According to the chosen error evauation between the estimated curve Bbc and the rebuit one Bec, we derive a sufficient precision ε. Proposition 4. We have Bec Bbc ε. Proof. According to (1), B = 1 and we get Bec Bbc B ec bc ε. As a resut, if we want a variation between the estimated and rebuit points smaer than the error between the data and the estimated points, choosing a contro point precision of ε = y Bbc is sufficient. Coroary 4.1 The RMS error between the rebuit curve B c and the optima one Bbc is ess than ε. Proof. We reca that for any vector x of R N, x x N x (9) and using proposition 4., the RMS error between Bec and Bbc then verifies Bec Bbc / N Bec Bbc ε. Thus, if we wish a RMS error between the estimated B- spine curve Bbc and Bec ess than the RMS error between y and Bbc, taking ε = RMS = y Bbc / N is sufficient MDL criteria for B-spines In paragraph 4., we have introduced two MDL criteria depending on the choice of the contro point description ength, caed (a) and (b), defined by (7) and (8). For each of them, we distinguish three sub-criteria in function of the precision ε. The first one considers ε as fixed and the others as a variabe precision depending on the mode. We consider that the error between the estimated and rebuit curves has not to be ower than the one between the data and the estimated curve. According to paragraph 4.3, we choose ε = RMS and then ε = y Bbc. From criteria (a) and (b), we obtain three sub-criteria: (a).1 and (b).1: ε fixed for a curves, (a). and (b).: ε = RMS, (a).3 and (b).3: ε = y Bbc.

4 5. Experimenta protoco The main objective consists in estimating the B-spine mode b θ using the above MDL criteria in order to obtain a compromise between the mode quaity (assessed by the RMS error) and the number of degrees of freedom (D.F.). We introduce the methodoogica hypotheses common to a experiments which answer to the three foowing questions: what is the reation between the RMS error and the number of D.F. of the mode? What is the MDL criteria sensibiity in function of the precision ε? Finay, how do the proposed criteria behave? The speech corpus used in these experiments is a French one made of approximatey 7000 syabes randomy extracted from a 7000 sentences corpus. The acoustic signa was recorded in a professiona recording studio; the speaker was asked to read the text. Then, the acoustic signa was annotated and segmented into phonetic units. The fundamenta frequency, F 0, was anayzed in an automatic way according to an estimation process based primariy on the autocorreation function of the speech signa. Next, an automatic agorithm was appied to the phonetic chain pronounced by the speaker so as to find the underying syabes. We choose the syabe as the minima support of a meodic contour. Our objective is to measure the performance of the unsupervised styisation of meodic contours using different decision criteria. For interna knots, the mode b θ depends on ( + m + 1) parameters, and if this number is greater than the number N of F 0 vaues, it is more economica to memorize the curve. When we estimate a B-spine mode, we then choose to satisfy the foowing condition on the interna knot number : N ( + m + 1). The curves having different engths, we normaize the number of interna knots in order to cacuate the means of comparabe number of D.F. for a the curves. More precisey, we divide the knot number of a B-spine mode by the number of points of the curve. A normaized number of D.F. equa to 1 wi then correspond to the whoe curve, i.e. to a fu mode. A proposed experiments use mean vaues cacuation: the mean vaue of the RMS errors and the mean vaue of the B- spine modes D.F. These ones are formuated as confidence intervas with a confidence threshod equa to 99%. Considering the nature of our experiments, a singe experimenta sampe containing 7000 curves is used, the confidence intervas are obtained by resamping the empirica distributions (Bootstrap methodoogy). 6. Resuts and discussion The MDL criterion seects the mode structure between a the possibe modes for a given syabe. So the first stage is the estimation of the modes θ for each syabe varying interna knot number. The second stage is to appy the MDL criteria on each syabe to decide which mode b θ is the best one. In this section, we present the different experiments we carried out RMS error versus D.F. These experiments are conducted in order to observe the evoution of the RMS error in function of the degrees of freedom number. The obtained curve (figure 1) permits to measure the parameter number impact on the estimated modes quaity. The normaized D.F. number varies from 0 to 1. A syabes of the corpus are taken into account in this figure. When D.F. number increases, RMS error decreases. Athough this resut was foreseeabe, it justifies the search of a RMS (Hz), 99% confidence interva ower bound upper bound mean Normaized degrees of freedom Figure 1: RMS error 99% confidence interva evoution in function of the normaized degrees of freedom. compromise between the mode precision and its compexity. In particuar, we notice a point of infection in the curve with an average normaized D.F. number cose to This vaue corresponds to a mean vaue of RMS error cose to 1Hz. The increase at the end of the curve probaby shows a weakness of the SA strategy when the knot number becomes high. Indeed, the condition (4) is no more satisfied. Athough the optimization process is goba, SA does not necessariy provide an optima knot vector. Finay, the MDL goa being to obtain a compromise between precision and compexity, a satisfying criterion shoud estimate a mean RMS error and a mean normaized D.F. number near the infection point of the curve. 6.. MDL and ε reation It is important to compare variabe precision MDL criteria to fixed precision ones. For that, we study the evoution of the RMS error according to a the possibe vaues of ε (criteria (a).1 et (b).1). Thus, we assess the infuence of the parameter precision ε on the RMS error and the D.F. number. Figure represents the RMS error confidence intervas in function of ε vaues. Figure 3 shows the evoution of the normaized D.F. number in function of ε. RMS error vaues and ε vaues are represented with a ogarithmic scae. Notice that the fact of considering the contro points as integers corresponds to the choice of ε = Criterion (a) Less precisey the mode is coded (ε arger), higher knot number is aowed. Indeed, when ε increases, the term og ε decreases, the criterion seects a higher vaue of and the RMS error then decreases. In figure, we can notice a quite significant variation of the RMS error. Indeed, there is a scae factor cose to 10 between its maximum and minimum vaues. Moreover, we observe an important increase of the D.F. number. To sum up, the curve variations underine the impact of ε on the RMS error and the chosen D.F. number Criterion (b) The same observations as for criterion (a) are vaid for criterion (b). Indeed, the infuence of ε is important, it governs the criterion performance. However, this criterion gives higher RMS error vaues than the previous one. According to proposition 4.1, the contro point description ength is greater and penaizes more the MDL criterion (b). Therefore, the average D.F. number stemming from (b) is ower than the one from (a), inducing a RMS error increase. This observation is coherent with the evoution of the RMS error in function of the D.F. number in figure 1.

5 RMS (Hz), 99% confidence interva ower bound upper bound mean og ε Figure : RMS error 99% confidence interva in function of og ε for criterion (a). Normaized degrees of freedom, 99% confidence interva og ε Figure 3: Normaized degrees of freedom 99% confidence interva evoution in function of og ε for criterion (a) Proposed MDL criteria anaysis To evauate the proposed criteria, we cacuate confidence intervas on the RMS error and the normaized D.F. number for the MDL seected modes. The resuts are summarized in tabe 1. By comparing these confidence intervas to previous resuts, we wi be abe to observe the reiabiity of the proposed criteria. Contrary to the preceding experiments, ε is variabe (criteria (a)., (a).3, (b).3 et (b).3). These resuts permit the distinction of two compromises. First, the criterion (a). gives a mean RMS error of 0.68Hz with a normaized D.F. number of 0.599, whie criterion (b). gives respectivey 1.57Hz and Criterion (b) uses a contro point description ength higher than the one used in (a). Therefore, it penaizes more and the seected vaues are smaer. The mean RMS error then increases. Secondy, two variabe modes were tested for each criterion. The use of y Bbc sighty improves the RMS error resuts for each criterion and impies an increase of the D.F. number. Indeed, according to (9), RMS y Bbc so the criteria (a).3 et (b).3 are ess penaizing. If the RMS error is privieged, the third versions of the criteria are better than the others. To compare fixed and variabe precision criterion, it is necessary to compare the normaized D.F. numbers, taking equa mean RMS errors. Simiary, a reciproca comparison is essentia. For criterion (a).3, if we choose a mean RMS error equa to 0.4Hz, figure gives the og ε vaue 3. By reporting this Tabe 1: 99% confidence intervas for the RMS error and the Normaized Degrees of Freedom (Norm. D.F.). Criteria RMS (Hz) norm. D.F. (a) ± ± (a) ± ± (b) ± ± (b) ± ± vaue on figure 3, the obtained D.F. number is approximatey If we appy this reasoning in the same way with equa D.F., we can concude that criterion (a).3 is better than a fixed precision one. The same reasoning is vaid for (b).3. We have to compare the variabe precision criteria to the genera evoution of the RMS error in function of the normaized degrees of freedom (fig.1). Criterion (a).3 is ocated near the infection point of the curve at coordinates (0.67, 0.4). Criterion (b).3 is before the infection point at (0.567, 1.11). We concude that criterion (b) is ess efficient than (a). In [5], we compared a B-spine mode to a spine mode using an experimenta framework cose to the one used here. We showed, tabe 1 page 4 of the artice, that B-spine modes with a normaized degree order of 60% eads to a mean RMS error about 3Hz (this resut can be found figure 1 abscissa 0.6). As for the spine mode, it ed to a mean RMS error around 1Hz. In [10], it has been shown that MoMe eads to 6Hz of mean RMS error in the best case. These resuts suggest, on the one hand, that a B-spine mode outperforms a spine mode and, on the other hand, a MDL criterion with variabe precision improves B-spine mode performance. 7. Concusion In this artice, we present a new approach to estimate meodic contours using a B-Spine mode. The precision of such a modeing is important to characterize meody in speech processing. B-spine mode generaizes spine mode and aows to describe precisey the oca irreguarities of the curve. The main contribution of this artice concerns the estimation of an optima knot number for the B-spine mode thanks to the MDL methodoogy. Appied to F 0 contours modeing at the syabic eve, this approach eads to a mean RMS error of 0.4Hz with a normaized number of degrees of freedom equa to 0.63 (a normaized number of degrees of freedom equa to 1 corresponds to the use of as much parameters as points of the curve). These RMS vaues are, on the one hand, ess than the F 0 JND threshod (around a few Hertz) and on the other hand, they are obtained with a compression factor reativey high (37% on average). 8. References [1] A. Raux and A. Back, A unit seection approach to f0 modeing and its appication to emphasis, in Proc. ASRU Conf., 003, pp [] D. Hirst, A. D. Cristo, and R. Espesser, Leves of representation and eves of anaysis for the description of intonation systems, In M. Horne (Ed.),Prosody : Theory and Experiment, Kuwer Academic Pusbisher, vo. 14, pp , 000. [3] P. Tayor, Anaysis and synthesis of intonation using the

6 tit mode, J. Acoust. Soc. America, vo. 107, pp , 000. [4] S. Sakai and J. Gass, Fundamenta frequency modeing for corpus-based speech synthesis based on statistica earning techniques, in Proc. ASRU Conf., 003, pp [5] N. Barbot, O. Boeffard, and D. Loive, F0 styisation with a free-knot b-spine mode and simuated-anneaing optimization, in Proc. Eurospeech Conf., 005, pp [6] M. H. Hansen and B. Yu, Mode seection and the principe of minimum description ength, J. Amer. Stat. Assoc., vo. 96, no. 454, pp , 001. [7] M. Figueiredo, J. Leitao, and A. Jain, Unsupervised contour representation and estimation using b-spines and a minimum description ength criterion, IEEE Trans. Image Proc., vo. 9, no. 6, pp , 000. [8] T. C. Lee, An introduction to coding theory and the twopart minimum description ength principe, Int. Stat. Review, vo. 69, no., pp , 001. [9] G. Goub and C. V. Loan, Matrix Computations. Johns Hopkins Univ. Press, Batimore, MA., [10] S. Mouine, O. Boeffard, and P. Bagshaw, Automatic adaptation of the mome f 0 styisation agorithm to new corpora, in Proc. of ICSLP, 004.

A proposed nonparametric mixture density estimation using B-spline functions

A proposed nonparametric mixture density estimation using B-spline functions A proposed nonparametric mixture density estimation using B-spine functions Atizez Hadrich a,b, Mourad Zribi a, Afif Masmoudi b a Laboratoire d Informatique Signa et Image de a Côte d Opae (LISIC-EA 4491),

More information

Research of Data Fusion Method of Multi-Sensor Based on Correlation Coefficient of Confidence Distance

Research of Data Fusion Method of Multi-Sensor Based on Correlation Coefficient of Confidence Distance Send Orders for Reprints to reprints@benthamscience.ae 340 The Open Cybernetics & Systemics Journa, 015, 9, 340-344 Open Access Research of Data Fusion Method of Muti-Sensor Based on Correation Coefficient

More information

Explicit overall risk minimization transductive bound

Explicit overall risk minimization transductive bound 1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,

More information

DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM

DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM MIKAEL NILSSON, MATTIAS DAHL AND INGVAR CLAESSON Bekinge Institute of Technoogy Department of Teecommunications and Signa Processing

More information

A Statistical Framework for Real-time Event Detection in Power Systems

A Statistical Framework for Real-time Event Detection in Power Systems 1 A Statistica Framework for Rea-time Event Detection in Power Systems Noan Uhrich, Tim Christman, Phiip Swisher, and Xichen Jiang Abstract A quickest change detection (QCD) agorithm is appied to the probem

More information

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with?

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with? Bayesian Learning A powerfu and growing approach in machine earning We use it in our own decision making a the time You hear a which which coud equay be Thanks or Tanks, which woud you go with? Combine

More information

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network An Agorithm for Pruning Redundant Modues in Min-Max Moduar Network Hui-Cheng Lian and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University 1954 Hua Shan Rd., Shanghai

More information

Improved Min-Sum Decoding of LDPC Codes Using 2-Dimensional Normalization

Improved Min-Sum Decoding of LDPC Codes Using 2-Dimensional Normalization Improved Min-Sum Decoding of LDPC Codes sing -Dimensiona Normaization Juntan Zhang and Marc Fossorier Department of Eectrica Engineering niversity of Hawaii at Manoa Honouu, HI 968 Emai: juntan, marc@spectra.eng.hawaii.edu

More information

Target Location Estimation in Wireless Sensor Networks Using Binary Data

Target Location Estimation in Wireless Sensor Networks Using Binary Data Target Location stimation in Wireess Sensor Networks Using Binary Data Ruixin Niu and Pramod K. Varshney Department of ectrica ngineering and Computer Science Link Ha Syracuse University Syracuse, NY 344

More information

Determining The Degree of Generalization Using An Incremental Learning Algorithm

Determining The Degree of Generalization Using An Incremental Learning Algorithm Determining The Degree of Generaization Using An Incrementa Learning Agorithm Pabo Zegers Facutad de Ingeniería, Universidad de os Andes San Caros de Apoquindo 22, Las Condes, Santiago, Chie pzegers@uandes.c

More information

Statistical Learning Theory: A Primer

Statistical Learning Theory: A Primer Internationa Journa of Computer Vision 38(), 9 3, 2000 c 2000 uwer Academic Pubishers. Manufactured in The Netherands. Statistica Learning Theory: A Primer THEODOROS EVGENIOU, MASSIMILIANO PONTIL AND TOMASO

More information

The EM Algorithm applied to determining new limit points of Mahler measures

The EM Algorithm applied to determining new limit points of Mahler measures Contro and Cybernetics vo. 39 (2010) No. 4 The EM Agorithm appied to determining new imit points of Maher measures by Souad E Otmani, Georges Rhin and Jean-Marc Sac-Épée Université Pau Veraine-Metz, LMAM,

More information

II. PROBLEM. A. Description. For the space of audio signals

II. PROBLEM. A. Description. For the space of audio signals CS229 - Fina Report Speech Recording based Language Recognition (Natura Language) Leopod Cambier - cambier; Matan Leibovich - matane; Cindy Orozco Bohorquez - orozcocc ABSTRACT We construct a rea time

More information

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After

More information

STA 216 Project: Spline Approach to Discrete Survival Analysis

STA 216 Project: Spline Approach to Discrete Survival Analysis : Spine Approach to Discrete Surviva Anaysis November 4, 005 1 Introduction Athough continuous surviva anaysis differs much from the discrete surviva anaysis, there is certain ink between the two modeing

More information

A Robust Voice Activity Detection based on Noise Eigenspace Projection

A Robust Voice Activity Detection based on Noise Eigenspace Projection A Robust Voice Activity Detection based on Noise Eigenspace Projection Dongwen Ying 1, Yu Shi 2, Frank Soong 2, Jianwu Dang 1, and Xugang Lu 1 1 Japan Advanced Institute of Science and Technoogy, Nomi

More information

(This is a sample cover image for this issue. The actual cover is not yet available at this time.)

(This is a sample cover image for this issue. The actual cover is not yet available at this time.) (This is a sampe cover image for this issue The actua cover is not yet avaiabe at this time) This artice appeared in a journa pubished by Esevier The attached copy is furnished to the author for interna

More information

General Certificate of Education Advanced Level Examination June 2010

General Certificate of Education Advanced Level Examination June 2010 Genera Certificate of Education Advanced Leve Examination June 2010 Human Bioogy HBI6T/Q10/task Unit 6T A2 Investigative Skis Assignment Task Sheet The effect of using one or two eyes on the perception

More information

Fast Blind Recognition of Channel Codes

Fast Blind Recognition of Channel Codes Fast Bind Recognition of Channe Codes Reza Moosavi and Erik G. Larsson Linköping University Post Print N.B.: When citing this work, cite the origina artice. 213 IEEE. Persona use of this materia is permitted.

More information

Do Schools Matter for High Math Achievement? Evidence from the American Mathematics Competitions Glenn Ellison and Ashley Swanson Online Appendix

Do Schools Matter for High Math Achievement? Evidence from the American Mathematics Competitions Glenn Ellison and Ashley Swanson Online Appendix VOL. NO. DO SCHOOLS MATTER FOR HIGH MATH ACHIEVEMENT? 43 Do Schoos Matter for High Math Achievement? Evidence from the American Mathematics Competitions Genn Eison and Ashey Swanson Onine Appendix Appendix

More information

Bayesian Unscented Kalman Filter for State Estimation of Nonlinear and Non-Gaussian Systems

Bayesian Unscented Kalman Filter for State Estimation of Nonlinear and Non-Gaussian Systems Bayesian Unscented Kaman Fiter for State Estimation of Noninear and Non-aussian Systems Zhong Liu, Shing-Chow Chan, Ho-Chun Wu and iafei Wu Department of Eectrica and Eectronic Engineering, he University

More information

NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION

NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION Hsiao-Chang Chen Dept. of Systems Engineering University of Pennsyvania Phiadephia, PA 904-635, U.S.A. Chun-Hung Chen

More information

A Brief Introduction to Markov Chains and Hidden Markov Models

A Brief Introduction to Markov Chains and Hidden Markov Models A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,

More information

A. Distribution of the test statistic

A. Distribution of the test statistic A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch

More information

12.2. Maxima and Minima. Introduction. Prerequisites. Learning Outcomes

12.2. Maxima and Minima. Introduction. Prerequisites. Learning Outcomes Maima and Minima 1. Introduction In this Section we anayse curves in the oca neighbourhood of a stationary point and, from this anaysis, deduce necessary conditions satisfied by oca maima and oca minima.

More information

Some Measures for Asymmetry of Distributions

Some Measures for Asymmetry of Distributions Some Measures for Asymmetry of Distributions Georgi N. Boshnakov First version: 31 January 2006 Research Report No. 5, 2006, Probabiity and Statistics Group Schoo of Mathematics, The University of Manchester

More information

Statistics for Applications. Chapter 7: Regression 1/43

Statistics for Applications. Chapter 7: Regression 1/43 Statistics for Appications Chapter 7: Regression 1/43 Heuristics of the inear regression (1) Consider a coud of i.i.d. random points (X i,y i ),i =1,...,n : 2/43 Heuristics of the inear regression (2)

More information

A Comparison Study of the Test for Right Censored and Grouped Data

A Comparison Study of the Test for Right Censored and Grouped Data Communications for Statistica Appications and Methods 2015, Vo. 22, No. 4, 313 320 DOI: http://dx.doi.org/10.5351/csam.2015.22.4.313 Print ISSN 2287-7843 / Onine ISSN 2383-4757 A Comparison Study of the

More information

Radar/ESM Tracking of Constant Velocity Target : Comparison of Batch (MLE) and EKF Performance

Radar/ESM Tracking of Constant Velocity Target : Comparison of Batch (MLE) and EKF Performance adar/ racing of Constant Veocity arget : Comparison of Batch (LE) and EKF Performance I. Leibowicz homson-csf Deteis/IISA La cef de Saint-Pierre 1 Bd Jean ouin 7885 Eancourt Cede France Isabee.Leibowicz

More information

THINKING IN PYRAMIDS

THINKING IN PYRAMIDS ECS 178 Course Notes THINKING IN PYRAMIDS Kenneth I. Joy Institute for Data Anaysis and Visuaization Department of Computer Science University of Caifornia, Davis Overview It is frequenty usefu to think

More information

c 2016 Georgios Rovatsos

c 2016 Georgios Rovatsos c 2016 Georgios Rovatsos QUICKEST CHANGE DETECTION WITH APPLICATIONS TO LINE OUTAGE DETECTION BY GEORGIOS ROVATSOS THESIS Submitted in partia fufiment of the requirements for the degree of Master of Science

More information

Unconditional security of differential phase shift quantum key distribution

Unconditional security of differential phase shift quantum key distribution Unconditiona security of differentia phase shift quantum key distribution Kai Wen, Yoshihisa Yamamoto Ginzton Lab and Dept of Eectrica Engineering Stanford University Basic idea of DPS-QKD Protoco. Aice

More information

Stochastic Variational Inference with Gradient Linearization

Stochastic Variational Inference with Gradient Linearization Stochastic Variationa Inference with Gradient Linearization Suppementa Materia Tobias Pötz * Anne S Wannenwetsch Stefan Roth Department of Computer Science, TU Darmstadt Preface In this suppementa materia,

More information

Proceedings of Meetings on Acoustics

Proceedings of Meetings on Acoustics Proceedings of Meetings on Acoustics Voume 9, 23 http://acousticasociety.org/ ICA 23 Montrea Montrea, Canada 2-7 June 23 Architectura Acoustics Session 4pAAa: Room Acoustics Computer Simuation II 4pAAa9.

More information

CS229 Lecture notes. Andrew Ng

CS229 Lecture notes. Andrew Ng CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view

More information

A Fundamental Storage-Communication Tradeoff in Distributed Computing with Straggling Nodes

A Fundamental Storage-Communication Tradeoff in Distributed Computing with Straggling Nodes A Fundamenta Storage-Communication Tradeoff in Distributed Computing with Stragging odes ifa Yan, Michèe Wigger LTCI, Téécom ParisTech 75013 Paris, France Emai: {qifa.yan, michee.wigger} @teecom-paristech.fr

More information

Path planning with PH G2 splines in R2

Path planning with PH G2 splines in R2 Path panning with PH G2 spines in R2 Laurent Gajny, Richard Béarée, Eric Nyiri, Oivier Gibaru To cite this version: Laurent Gajny, Richard Béarée, Eric Nyiri, Oivier Gibaru. Path panning with PH G2 spines

More information

A Solution to the 4-bit Parity Problem with a Single Quaternary Neuron

A Solution to the 4-bit Parity Problem with a Single Quaternary Neuron Neura Information Processing - Letters and Reviews Vo. 5, No. 2, November 2004 LETTER A Soution to the 4-bit Parity Probem with a Singe Quaternary Neuron Tohru Nitta Nationa Institute of Advanced Industria

More information

Evolutionary Product-Unit Neural Networks for Classification 1

Evolutionary Product-Unit Neural Networks for Classification 1 Evoutionary Product-Unit Neura Networs for Cassification F.. Martínez-Estudio, C. Hervás-Martínez, P. A. Gutiérrez Peña A. C. Martínez-Estudio and S. Ventura-Soto Department of Management and Quantitative

More information

Optimality of Inference in Hierarchical Coding for Distributed Object-Based Representations

Optimality of Inference in Hierarchical Coding for Distributed Object-Based Representations Optimaity of Inference in Hierarchica Coding for Distributed Object-Based Representations Simon Brodeur, Jean Rouat NECOTIS, Département génie éectrique et génie informatique, Université de Sherbrooke,

More information

Cryptanalysis of PKP: A New Approach

Cryptanalysis of PKP: A New Approach Cryptanaysis of PKP: A New Approach Éiane Jaumes and Antoine Joux DCSSI 18, rue du Dr. Zamenhoff F-92131 Issy-es-Mx Cedex France eiane.jaumes@wanadoo.fr Antoine.Joux@ens.fr Abstract. Quite recenty, in

More information

arxiv: v1 [cs.lg] 31 Oct 2017

arxiv: v1 [cs.lg] 31 Oct 2017 ACCELERATED SPARSE SUBSPACE CLUSTERING Abofaz Hashemi and Haris Vikao Department of Eectrica and Computer Engineering, University of Texas at Austin, Austin, TX, USA arxiv:7.26v [cs.lg] 3 Oct 27 ABSTRACT

More information

Appendix A: MATLAB commands for neural networks

Appendix A: MATLAB commands for neural networks Appendix A: MATLAB commands for neura networks 132 Appendix A: MATLAB commands for neura networks p=importdata('pn.xs'); t=importdata('tn.xs'); [pn,meanp,stdp,tn,meant,stdt]=prestd(p,t); for m=1:10 net=newff(minmax(pn),[m,1],{'tansig','purein'},'trainm');

More information

ASummaryofGaussianProcesses Coryn A.L. Bailer-Jones

ASummaryofGaussianProcesses Coryn A.L. Bailer-Jones ASummaryofGaussianProcesses Coryn A.L. Baier-Jones Cavendish Laboratory University of Cambridge caj@mrao.cam.ac.uk Introduction A genera prediction probem can be posed as foows. We consider that the variabe

More information

Asymptotic Properties of a Generalized Cross Entropy Optimization Algorithm

Asymptotic Properties of a Generalized Cross Entropy Optimization Algorithm 1 Asymptotic Properties of a Generaized Cross Entropy Optimization Agorithm Zijun Wu, Michae Koonko, Institute for Appied Stochastics and Operations Research, Caustha Technica University Abstract The discrete

More information

Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels

Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channes arxiv:cs/060700v1 [cs.it] 6 Ju 006 Chun-Hao Hsu and Achieas Anastasopouos Eectrica Engineering and Computer Science Department University

More information

Algorithms to solve massively under-defined systems of multivariate quadratic equations

Algorithms to solve massively under-defined systems of multivariate quadratic equations Agorithms to sove massivey under-defined systems of mutivariate quadratic equations Yasufumi Hashimoto Abstract It is we known that the probem to sove a set of randomy chosen mutivariate quadratic equations

More information

Identification of macro and micro parameters in solidification model

Identification of macro and micro parameters in solidification model BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vo. 55, No. 1, 27 Identification of macro and micro parameters in soidification mode B. MOCHNACKI 1 and E. MAJCHRZAK 2,1 1 Czestochowa University

More information

Steepest Descent Adaptation of Min-Max Fuzzy If-Then Rules 1

Steepest Descent Adaptation of Min-Max Fuzzy If-Then Rules 1 Steepest Descent Adaptation of Min-Max Fuzzy If-Then Rues 1 R.J. Marks II, S. Oh, P. Arabshahi Λ, T.P. Caude, J.J. Choi, B.G. Song Λ Λ Dept. of Eectrica Engineering Boeing Computer Services University

More information

$, (2.1) n="# #. (2.2)

$, (2.1) n=# #. (2.2) Chapter. Eectrostatic II Notes: Most of the materia presented in this chapter is taken from Jackson, Chap.,, and 4, and Di Bartoo, Chap... Mathematica Considerations.. The Fourier series and the Fourier

More information

Separation of Variables and a Spherical Shell with Surface Charge

Separation of Variables and a Spherical Shell with Surface Charge Separation of Variabes and a Spherica She with Surface Charge In cass we worked out the eectrostatic potentia due to a spherica she of radius R with a surface charge density σθ = σ cos θ. This cacuation

More information

Statistical Learning Theory: a Primer

Statistical Learning Theory: a Primer ??,??, 1 6 (??) c?? Kuwer Academic Pubishers, Boston. Manufactured in The Netherands. Statistica Learning Theory: a Primer THEODOROS EVGENIOU AND MASSIMILIANO PONTIL Center for Bioogica and Computationa

More information

An explicit Jordan Decomposition of Companion matrices

An explicit Jordan Decomposition of Companion matrices An expicit Jordan Decomposition of Companion matrices Fermín S V Bazán Departamento de Matemática CFM UFSC 88040-900 Forianópois SC E-mai: fermin@mtmufscbr S Gratton CERFACS 42 Av Gaspard Coriois 31057

More information

DISTRIBUTION OF TEMPERATURE IN A SPATIALLY ONE- DIMENSIONAL OBJECT AS A RESULT OF THE ACTIVE POINT SOURCE

DISTRIBUTION OF TEMPERATURE IN A SPATIALLY ONE- DIMENSIONAL OBJECT AS A RESULT OF THE ACTIVE POINT SOURCE DISTRIBUTION OF TEMPERATURE IN A SPATIALLY ONE- DIMENSIONAL OBJECT AS A RESULT OF THE ACTIVE POINT SOURCE Yury Iyushin and Anton Mokeev Saint-Petersburg Mining University, Vasiievsky Isand, 1 st ine, Saint-Petersburg,

More information

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES Separation of variabes is a method to sove certain PDEs which have a warped product structure. First, on R n, a inear PDE of order m is

More information

Expectation-Maximization for Estimating Parameters for a Mixture of Poissons

Expectation-Maximization for Estimating Parameters for a Mixture of Poissons Expectation-Maximization for Estimating Parameters for a Mixture of Poissons Brandon Maone Department of Computer Science University of Hesini February 18, 2014 Abstract This document derives, in excrutiating

More information

Moreau-Yosida Regularization for Grouped Tree Structure Learning

Moreau-Yosida Regularization for Grouped Tree Structure Learning Moreau-Yosida Reguarization for Grouped Tree Structure Learning Jun Liu Computer Science and Engineering Arizona State University J.Liu@asu.edu Jieping Ye Computer Science and Engineering Arizona State

More information

Two-sample inference for normal mean vectors based on monotone missing data

Two-sample inference for normal mean vectors based on monotone missing data Journa of Mutivariate Anaysis 97 (006 6 76 wwweseviercom/ocate/jmva Two-sampe inference for norma mean vectors based on monotone missing data Jianqi Yu a, K Krishnamoorthy a,, Maruthy K Pannaa b a Department

More information

BALANCING REGULAR MATRIX PENCILS

BALANCING REGULAR MATRIX PENCILS BALANCING REGULAR MATRIX PENCILS DAMIEN LEMONNIER AND PAUL VAN DOOREN Abstract. In this paper we present a new diagona baancing technique for reguar matrix pencis λb A, which aims at reducing the sensitivity

More information

Adjustment of automatic control systems of production facilities at coal processing plants using multivariant physico- mathematical models

Adjustment of automatic control systems of production facilities at coal processing plants using multivariant physico- mathematical models IO Conference Series: Earth and Environmenta Science AER OEN ACCESS Adjustment of automatic contro systems of production faciities at coa processing pants using mutivariant physico- mathematica modes To

More information

AST 418/518 Instrumentation and Statistics

AST 418/518 Instrumentation and Statistics AST 418/518 Instrumentation and Statistics Cass Website: http://ircamera.as.arizona.edu/astr_518 Cass Texts: Practica Statistics for Astronomers, J.V. Wa, and C.R. Jenkins, Second Edition. Measuring the

More information

Related Topics Maxwell s equations, electrical eddy field, magnetic field of coils, coil, magnetic flux, induced voltage

Related Topics Maxwell s equations, electrical eddy field, magnetic field of coils, coil, magnetic flux, induced voltage Magnetic induction TEP Reated Topics Maxwe s equations, eectrica eddy fied, magnetic fied of cois, coi, magnetic fux, induced votage Principe A magnetic fied of variabe frequency and varying strength is

More information

SVM: Terminology 1(6) SVM: Terminology 2(6)

SVM: Terminology 1(6) SVM: Terminology 2(6) Andrew Kusiak Inteigent Systems Laboratory 39 Seamans Center he University of Iowa Iowa City, IA 54-57 SVM he maxima margin cassifier is simiar to the perceptron: It aso assumes that the data points are

More information

Automobile Prices in Market Equilibrium. Berry, Pakes and Levinsohn

Automobile Prices in Market Equilibrium. Berry, Pakes and Levinsohn Automobie Prices in Market Equiibrium Berry, Pakes and Levinsohn Empirica Anaysis of demand and suppy in a differentiated products market: equiibrium in the U.S. automobie market. Oigopoistic Differentiated

More information

T.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA

T.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA ON THE SYMMETRY OF THE POWER INE CHANNE T.C. Banwe, S. Gai {bct, sgai}@research.tecordia.com Tecordia Technoogies, Inc., 445 South Street, Morristown, NJ 07960, USA Abstract The indoor power ine network

More information

BP neural network-based sports performance prediction model applied research

BP neural network-based sports performance prediction model applied research Avaiabe onine www.jocpr.com Journa of Chemica and Pharmaceutica Research, 204, 6(7:93-936 Research Artice ISSN : 0975-7384 CODEN(USA : JCPRC5 BP neura networ-based sports performance prediction mode appied

More information

MONTE CARLO SIMULATIONS

MONTE CARLO SIMULATIONS MONTE CARLO SIMULATIONS Current physics research 1) Theoretica 2) Experimenta 3) Computationa Monte Caro (MC) Method (1953) used to study 1) Discrete spin systems 2) Fuids 3) Poymers, membranes, soft matter

More information

A Novel Learning Method for Elman Neural Network Using Local Search

A Novel Learning Method for Elman Neural Network Using Local Search Neura Information Processing Letters and Reviews Vo. 11, No. 8, August 2007 LETTER A Nove Learning Method for Eman Neura Networ Using Loca Search Facuty of Engineering, Toyama University, Gofuu 3190 Toyama

More information

Tracking Control of Multiple Mobile Robots

Tracking Control of Multiple Mobile Robots Proceedings of the 2001 IEEE Internationa Conference on Robotics & Automation Seou, Korea May 21-26, 2001 Tracking Contro of Mutipe Mobie Robots A Case Study of Inter-Robot Coision-Free Probem Jurachart

More information

Analysis of Emerson s Multiple Model Interpolation Estimation Algorithms: The MIMO Case

Analysis of Emerson s Multiple Model Interpolation Estimation Algorithms: The MIMO Case Technica Report PC-04-00 Anaysis of Emerson s Mutipe Mode Interpoation Estimation Agorithms: The MIMO Case João P. Hespanha Dae E. Seborg University of Caifornia, Santa Barbara February 0, 004 Anaysis

More information

General Certificate of Education Advanced Level Examination June 2010

General Certificate of Education Advanced Level Examination June 2010 Genera Certificate of Education Advanced Leve Examination June 2010 Human Bioogy HBI6T/P10/task Unit 6T A2 Investigative Skis Assignment Task Sheet The effect of temperature on the rate of photosynthesis

More information

International Journal of Mass Spectrometry

International Journal of Mass Spectrometry Internationa Journa of Mass Spectrometry 280 (2009) 179 183 Contents ists avaiabe at ScienceDirect Internationa Journa of Mass Spectrometry journa homepage: www.esevier.com/ocate/ijms Stark mixing by ion-rydberg

More information

From Margins to Probabilities in Multiclass Learning Problems

From Margins to Probabilities in Multiclass Learning Problems From Margins to Probabiities in Muticass Learning Probems Andrea Passerini and Massimiiano Ponti 2 and Paoo Frasconi 3 Abstract. We study the probem of muticass cassification within the framework of error

More information

Asynchronous Control for Coupled Markov Decision Systems

Asynchronous Control for Coupled Markov Decision Systems INFORMATION THEORY WORKSHOP (ITW) 22 Asynchronous Contro for Couped Marov Decision Systems Michae J. Neey University of Southern Caifornia Abstract This paper considers optima contro for a coection of

More information

Akaike Information Criterion for ANOVA Model with a Simple Order Restriction

Akaike Information Criterion for ANOVA Model with a Simple Order Restriction Akaike Information Criterion for ANOVA Mode with a Simpe Order Restriction Yu Inatsu * Department of Mathematics, Graduate Schoo of Science, Hiroshima University ABSTRACT In this paper, we consider Akaike

More information

Sequential Decoding of Polar Codes with Arbitrary Binary Kernel

Sequential Decoding of Polar Codes with Arbitrary Binary Kernel Sequentia Decoding of Poar Codes with Arbitrary Binary Kerne Vera Miosavskaya, Peter Trifonov Saint-Petersburg State Poytechnic University Emai: veram,petert}@dcn.icc.spbstu.ru Abstract The probem of efficient

More information

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries c 26 Noninear Phenomena in Compex Systems First-Order Corrections to Gutzwier s Trace Formua for Systems with Discrete Symmetries Hoger Cartarius, Jörg Main, and Günter Wunner Institut für Theoretische

More information

6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17. Solution 7

6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17. Solution 7 6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17 Soution 7 Probem 1: Generating Random Variabes Each part of this probem requires impementation in MATLAB. For the

More information

HYDROGEN ATOM SELECTION RULES TRANSITION RATES

HYDROGEN ATOM SELECTION RULES TRANSITION RATES DOING PHYSICS WITH MATLAB QUANTUM PHYSICS Ian Cooper Schoo of Physics, University of Sydney ian.cooper@sydney.edu.au HYDROGEN ATOM SELECTION RULES TRANSITION RATES DOWNLOAD DIRECTORY FOR MATLAB SCRIPTS

More information

Soft Clustering on Graphs

Soft Clustering on Graphs Soft Custering on Graphs Kai Yu 1, Shipeng Yu 2, Voker Tresp 1 1 Siemens AG, Corporate Technoogy 2 Institute for Computer Science, University of Munich kai.yu@siemens.com, voker.tresp@siemens.com spyu@dbs.informatik.uni-muenchen.de

More information

Convergence Property of the Iri-Imai Algorithm for Some Smooth Convex Programming Problems

Convergence Property of the Iri-Imai Algorithm for Some Smooth Convex Programming Problems Convergence Property of the Iri-Imai Agorithm for Some Smooth Convex Programming Probems S. Zhang Communicated by Z.Q. Luo Assistant Professor, Department of Econometrics, University of Groningen, Groningen,

More information

Nearly Optimal Constructions of PIR and Batch Codes

Nearly Optimal Constructions of PIR and Batch Codes arxiv:700706v [csit] 5 Jun 07 Neary Optima Constructions of PIR and Batch Codes Hia Asi Technion - Israe Institute of Technoogy Haifa 3000, Israe shea@cstechnionaci Abstract In this work we study two famiies

More information

NOISE-INDUCED STABILIZATION OF STOCHASTIC DIFFERENTIAL EQUATIONS

NOISE-INDUCED STABILIZATION OF STOCHASTIC DIFFERENTIAL EQUATIONS NOISE-INDUCED STABILIZATION OF STOCHASTIC DIFFERENTIAL EQUATIONS TONY ALLEN, EMILY GEBHARDT, AND ADAM KLUBALL 3 ADVISOR: DR. TIFFANY KOLBA 4 Abstract. The phenomenon of noise-induced stabiization occurs

More information

Theory of Generalized k-difference Operator and Its Application in Number Theory

Theory of Generalized k-difference Operator and Its Application in Number Theory Internationa Journa of Mathematica Anaysis Vo. 9, 2015, no. 19, 955-964 HIKARI Ltd, www.m-hiari.com http://dx.doi.org/10.12988/ijma.2015.5389 Theory of Generaized -Difference Operator and Its Appication

More information

Control Chart For Monitoring Nonparametric Profiles With Arbitrary Design

Control Chart For Monitoring Nonparametric Profiles With Arbitrary Design Contro Chart For Monitoring Nonparametric Profies With Arbitrary Design Peihua Qiu 1 and Changiang Zou 2 1 Schoo of Statistics, University of Minnesota, USA 2 LPMC and Department of Statistics, Nankai

More information

Consistent linguistic fuzzy preference relation with multi-granular uncertain linguistic information for solving decision making problems

Consistent linguistic fuzzy preference relation with multi-granular uncertain linguistic information for solving decision making problems Consistent inguistic fuzzy preference reation with muti-granuar uncertain inguistic information for soving decision making probems Siti mnah Binti Mohd Ridzuan, and Daud Mohamad Citation: IP Conference

More information

Numerical solution of one dimensional contaminant transport equation with variable coefficient (temporal) by using Haar wavelet

Numerical solution of one dimensional contaminant transport equation with variable coefficient (temporal) by using Haar wavelet Goba Journa of Pure and Appied Mathematics. ISSN 973-1768 Voume 1, Number (16), pp. 183-19 Research India Pubications http://www.ripubication.com Numerica soution of one dimensiona contaminant transport

More information

DYNAMIC RESPONSE OF CIRCULAR FOOTINGS ON SATURATED POROELASTIC HALFSPACE

DYNAMIC RESPONSE OF CIRCULAR FOOTINGS ON SATURATED POROELASTIC HALFSPACE 3 th Word Conference on Earthquake Engineering Vancouver, B.C., Canada August -6, 4 Paper No. 38 DYNAMIC RESPONSE OF CIRCULAR FOOTINGS ON SATURATED POROELASTIC HALFSPACE Bo JIN SUMMARY The dynamic responses

More information

Stochastic Automata Networks (SAN) - Modelling. and Evaluation. Paulo Fernandes 1. Brigitte Plateau 2. May 29, 1997

Stochastic Automata Networks (SAN) - Modelling. and Evaluation. Paulo Fernandes 1. Brigitte Plateau 2. May 29, 1997 Stochastic utomata etworks (S) - Modeing and Evauation Pauo Fernandes rigitte Pateau 2 May 29, 997 Institut ationa Poytechnique de Grenobe { IPG Ecoe ationae Superieure d'informatique et de Mathematiques

More information

CONJUGATE GRADIENT WITH SUBSPACE OPTIMIZATION

CONJUGATE GRADIENT WITH SUBSPACE OPTIMIZATION CONJUGATE GRADIENT WITH SUBSPACE OPTIMIZATION SAHAR KARIMI AND STEPHEN VAVASIS Abstract. In this paper we present a variant of the conjugate gradient (CG) agorithm in which we invoke a subspace minimization

More information

A unified framework for Regularization Networks and Support Vector Machines. Theodoros Evgeniou, Massimiliano Pontil, Tomaso Poggio

A unified framework for Regularization Networks and Support Vector Machines. Theodoros Evgeniou, Massimiliano Pontil, Tomaso Poggio MASSACHUSETTS INSTITUTE OF TECHNOLOGY ARTIFICIAL INTELLIGENCE LABORATORY and CENTER FOR BIOLOGICAL AND COMPUTATIONAL LEARNING DEPARTMENT OF BRAIN AND COGNITIVE SCIENCES A.I. Memo No. 1654 March23, 1999

More information

Centralized Coded Caching of Correlated Contents

Centralized Coded Caching of Correlated Contents Centraized Coded Caching of Correated Contents Qianqian Yang and Deniz Gündüz Information Processing and Communications Lab Department of Eectrica and Eectronic Engineering Imperia Coege London arxiv:1711.03798v1

More information

PARSIMONIOUS VARIATIONAL-BAYES MIXTURE AGGREGATION WITH A POISSON PRIOR. Pierrick Bruneau, Marc Gelgon and Fabien Picarougne

PARSIMONIOUS VARIATIONAL-BAYES MIXTURE AGGREGATION WITH A POISSON PRIOR. Pierrick Bruneau, Marc Gelgon and Fabien Picarougne 17th European Signa Processing Conference (EUSIPCO 2009) Gasgow, Scotand, August 24-28, 2009 PARSIMONIOUS VARIATIONAL-BAYES MIXTURE AGGREGATION WITH A POISSON PRIOR Pierric Bruneau, Marc Gegon and Fabien

More information

Simplified analysis of EXAFS data and determination of bond lengths

Simplified analysis of EXAFS data and determination of bond lengths Indian Journa of Pure & Appied Physics Vo. 49, January 0, pp. 5-9 Simpified anaysis of EXAFS data and determination of bond engths A Mishra, N Parsai & B D Shrivastava * Schoo of Physics, Devi Ahiya University,

More information

On the Goal Value of a Boolean Function

On the Goal Value of a Boolean Function On the Goa Vaue of a Booean Function Eric Bach Dept. of CS University of Wisconsin 1210 W. Dayton St. Madison, WI 53706 Lisa Heerstein Dept of CSE NYU Schoo of Engineering 2 Metrotech Center, 10th Foor

More information

Approximated MLC shape matrix decomposition with interleaf collision constraint

Approximated MLC shape matrix decomposition with interleaf collision constraint Agorithmic Operations Research Vo.4 (29) 49 57 Approximated MLC shape matrix decomposition with intereaf coision constraint Antje Kiese and Thomas Kainowski Institut für Mathematik, Universität Rostock,

More information

A Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c)

A Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c) A Simpe Efficient Agorithm of 3-D Singe-Source Locaization with Uniform Cross Array Bing Xue a * Guangyou Fang b Yicai Ji c Key Laboratory of Eectromagnetic Radiation Sensing Technoogy, Institute of Eectronics,

More information

XSAT of linear CNF formulas

XSAT of linear CNF formulas XSAT of inear CN formuas Bernd R. Schuh Dr. Bernd Schuh, D-50968 Kön, Germany; bernd.schuh@netcoogne.de eywords: compexity, XSAT, exact inear formua, -reguarity, -uniformity, NPcompeteness Abstract. Open

More information

Turbo Codes. Coding and Communication Laboratory. Dept. of Electrical Engineering, National Chung Hsing University

Turbo Codes. Coding and Communication Laboratory. Dept. of Electrical Engineering, National Chung Hsing University Turbo Codes Coding and Communication Laboratory Dept. of Eectrica Engineering, Nationa Chung Hsing University Turbo codes 1 Chapter 12: Turbo Codes 1. Introduction 2. Turbo code encoder 3. Design of intereaver

More information

On Optimal Smoothing in Minimum Statistics Based Noise Tracking

On Optimal Smoothing in Minimum Statistics Based Noise Tracking INTERSPEECH 25 On Optima Smoothing in Minimum Statistics Based Noise Tracking Aeksej Chinaev, Reinhod Haeb-Umbach Department of Communications Engineering, University of Paderborn, 3398 Paderborn, Germany

More information