Change Detection Using Directional Statistics
|
|
- Kathryn Hamilton
- 5 years ago
- Views:
Transcription
1 Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16) Change Detection Using Directional Statistics Tsyoshi Idé, Dzng T. Phan, Jayant Kalagnanam IBM Research, T. J. Watson Research Center 1101 Kitchawan Rd., Yorktown Heights, NY 10598, USA Abstract N D This paper addresses the task of change detection from noisy mltivariate time-series data. One major featre of or approach is to leverage directional statistics as the noise-robst signatre of time-series data. To captre major patterns, we introdce a reglarized maximm likelihood eqation for the von Mises-Fisher distribtion, which simltaneosly learns directional statistics and sample weights to filter ot nwanted samples contaminated by the noise. We show that the optimization problem is redced to the trst region sbproblem in a certain limit, where global optimality is garanteed. To evalate the amont of changes, we introdce a novel distance measre on the Stiefel manifold. The method is validated with real-world data from an ore mining system. 1 Introdction The problem we wish to solve is change detection of mltivariate time-series data. Figre 1 shows a typical setting, where or task is to compte the degree of change, or the change score, of the data within the test window taken at time t in comparison to the training window. The task of change detection has a long history in statistics. The standard strategy is to se a parametric model for probability density and compte the likelihood ratio to qantify the degree of change between fitted distribtions [Chen and Gpta, 2012]. For a concise review from a statistical machine learning perspective, see [Yamada et al., 2013]. When applying a change detection method to real-world problems, the major reqirements are interpretability and robstness to nisance noise variables. To validate detected changes with domain knowledge, it is almost always reqired to explicitly present statistics (or featre) for the parametric model, sch as the mean for Gassian. Althogh it is possible to design an algorithm that skips the explicit step of featre extraction and jmps directly into score calclation [Li et al., 2013], sch an approach is not highly appreciated in practice de to the lack of interpretability. In the mltivariate setting, the robstness to noise variables is the other critical reqirements since changes may not always occr in all of the training window (fixed or sliding) test window t (time) Figre 1: Change detection problem. variables simltaneosly. In fact, nder the existence of nisance noise variables, the performance of direct density-ratio estimation approaches is known to significantly degrade [Yamada et al., 2013]. Considering these two reqirements, we focs on change detection approaches having explicit two steps of featre extraction and score calclation. There are two important decision points here: (1) Parametric model for probability density fnction, and (2) scoring model for the change score. In this paper, we propose a novel framework for change detection for mltivariate sensor data. Or contribtion is threefold: We develop a novel featre extraction method based on reglarized maximm likelihood of the von Mises- Fisher (vmf) distribtion. We show that the featre extraction method is redced to an optimization problem called the trst-region sbproblem [Tao and An, 1998; Hager, 2001]. We propose a novel scoring method based on a parametrized Kllback-Leibler (KL) divergence. Implications of these contribtions are as follows. First, or featre extraction method is the first proposal to efficiently remove the mltiplicative noise that is biqitos in many physical systems. Thanks to an `1 reglarization scheme, it is also capable of atomatically removing samples contaminated by the nwanted noise. Second, the trst-region sbproblem garantees the global optimality in a certain limit, which is especially important for noisy data. Third, the 1613
2 parametrized Kllback-Leibler divergence for scoring provides s with a trstworthy way to qantify the discrepancy between different sbspaces with different dimensionalities. 2 Extracting featre matrix from noisy data The proposed method consists of two steps. The first step comptes an orthonormal matrix as the signatre of the flctation patterns of mltivariate data. The second step comptes the difference between two data sets in the past and present throgh the compted orthonormal matrices. This section explains the first step. 2.1 The von Mises-Fisher distribtion Assme we are monitoring a system with M sensors, and we are given N measrements {x (1),...,x (N) 2 R M }, which may correspond to either the training or the test window in Fig. 1. Or principal probabilistic model is the von Mises- Fisher (vmf) distribtion [Mardia et al., 1980]: M(z,apple) c M (apple)exp apple > z (1) c M (apple) apple M/2 1 (2 ) M/2 I M/2 1 (apple), (2) where I M/2 1 ( ) denotes the modified Bessel fnction of the first kind with the order M 2 1. The random variable z is assmed to be normalized in the sense z > z =1, where > represents transpose. The vmf distribtion has two parameters: the mean direction and the concentration parameter apple. As these names sggest, the vmf distribtion describes random variability of the direction arond the mean vector. The intition behind the se of vmf distribtion is as follows. When describing the measrements sing the vmf distribtion, we look only at the direction, disregarding flctations along the direction. This atomatically gives the robstness to mltiplicative noise, which is qite common in practice in systems with redndancy. As an example, we will look at an ore transfer system, where two belt conveyors are operated by the same electronic system. In this system, major flctations in one system de to e.g. dynamic load changes are shared by the other system. In systems having strongly correlated variables, the vmf distribtion can be a more natral tool for system monitoring than the Gassian. 2.2 Weighted joint maximm likelihood To simplify the notation, we introdce the data matrix X [x (1),...,x (N) ]=[b (1) z (1),...,b (N) z (N) ], (3) where kz (n) k 2 =1and b (n) kx (n) k 2 for n =1,...,N and k k p being the p-norm. The parameters of the vmf distribtion may be inferred by maximizing a likelihood fnction: L(, w X) NX w (n) b (n) ln M(z (n),apple), (4) n=1 where we introdce sample weights w (w (1),...,w (N) ) >. We wish to captre major patterns represented as the directional data by optimally choosing the weights so that less trstworthy samples are down-weighted. ln(c_m) / kappa kappa Figre 2: /apple as a fnction of apple (M = 10). The weighted likelihood L(, w X) has only a single pattern, and naively maximizing L(, w X) prodces only the single direction. To captre mltiple patterns of the change, we jointly fit m different distribtions while keeping the overlap minimal by imposing the orthogonality between different patterns: ( X m ) max U,W L( i,apple,w i X) R(W) s.t. U > U = I m, (5) where I m is the m-dimensional identity matrix, U [ 1,..., m ], and W [w 1,...,w m ]. The term R(W) is a reglarizer to remove the trivial soltion on the sample weights. Here we consider the elastic net reglarization [Zo and Hastie, 2005]: mx 1 R(W) = 2 kw ik kw i k 1, (6) where and are given constants, typically determined by cross-validation. The first term of the objective fnction is given by mx L( i,apple,w i X) =appletr XWU > + 1 > W > b, (7) where we defined ln c M (apple), b [b (1),...,b (N) ] >, and 1 is a colmn vector of all ones. Throghot the paper we will treat apple as a given constant. Fortnately, /apple is qite insensitive to apple, as shown in Fig. 2. One sefl heristic is simply to set apple = M. Otherwise, we can se known approximation algorithms given in [Sra, 2012]. 2.3 Iterative seqential algorithm The optimization problem (5) can be seqentially solved for each of ( i, w i ). Imagine that the sample weight w is initialized to a vector. Given w, Eq. (5) is redced to max apple > Xw s.t. > =1 (8) for the first. The soltion is readily obtained as = Xw kxwk 2. (9) Given this soltion, the problem (5) for w is now written as arg max w > q w 2 w> w kwk 1 1 = arg min w 2 kw q k kwk 1, (10) 1614
3 where q is defined by q b + applex >. (11) This problem is a special case of LASSO regression, and has a closed-form soltion [Wen et al., 2010] as w = sign(q) max q 1, 0, (12) where denotes the componentwise prodct, 0 is the zero vector, and q is an N-dimensional vector whose n-th entry is q n. With this new w, we can solve Eq. (8) again. We repeat solving Eqs. (8) and (10) alternatingly ntil convergence. Once we get the first soltion ( 1, w 1 ), we move on to the next soltion. We again start with initialized w and solve the following problem instead of Eq. (8): max apple > Xw s.t. > =1, > 1 =0. (13) By introdcing Lagrange mltipliers, 1 for the two constraints, respectively, we have the condition of optimality as 0 happle > Xw 2 > 1 > 1 = applexw 1 1. (14) Using the constraints, the candidates for the soltion are apple(xw 1 > 1 Xw) (15) ± kk 2 (16) There are two stationary points, and by plgging them into the objective fnction in Eq. (13), we can get the optimal soltion. This soltion is inserted into Eq. (10) to get a new w. These steps are repeated ntil convergence. It is straightforward to generalize the above procedre for j =2,...,m. We smmarize the procedre in Algorithm 1, which we call the REglarized Directional featre extraction (RED) algorithm: Algorithm 1 RED algorithm. Inpt: Initialized w. Reglarization parameters,. Concentration parameter apple. The nmber of major directional patterns m. Otpt: U =[ 1,..., m ] and W =[w 1,...,w m ]. for j =1, 2,...,mdo while no convergence do end while end for Retrn U and W. j apple[i M U j 1 U > j 1]Xw j (17) j j sign( > j Xw j ) (18) k j k 2 q j b + applex > j (19) qj w j sign(q j ) max 1, 0 (20) In Eq. (17), we define U j 1 [ 1,..., j 1 ]. I M is the M-dimensional identity matrix. The complexity of RED algorithm for each while loop iteration is O(NM). 3 Theoretical analysis 3.1 Convergence of RED algorithm We have the following convergence theorem: Theorem 1. Define g(w, ) apple > Xw + w > b R(w). The seqence {g(w j, j )} j=0,1,... generated by the whileloop of Algorithm 1 has a finite limit. Proof. First, we prove that the seqence {g(w j, j )} is bonded above. We have g(w, ) apple apple > Xw + w > b = w applex> + b 2 2 apple 1 applekx > k k bk kwk2 2 (21) + kapplex> + bk apple 1 apple max (XX > )+k bk 2 2, (22) where max is the nonnegative maximm eigenvale of XX >. The ineqality (21) is de to and being positive, the last ineqality (22) is derived from kk 2 =1. We have g(w j, j ) apple g(w j, j+1 ) apple g(w j+1, j+1 ), where the first ineqality comes from Step 1, the last one is de to Step 3. The bondedness and monotonically increasing of the seqence {g(w j, j )} complete the proof. 3.2 Global optimality in! 0 Here we look at the following theorem: Theorem 2. When tends to 0, the nonconvex problem (5) is redced to an optimization problem in the form of min > Q + c > s.t. > =1, (23) which has a global soltion obtained in polynomial time. Proof. The non-convex optimization problem (23) is known as the trst region sbproblem. For polynomial algorithms to the global soltion, see [Sorensen, 1997; Tao and An, 1998; Hager, 2001; Toint et al., 2009]. Here we show how the algorithm is redced to the trst region sbproblem. When =0, the objective fnction (5) leads to the optimality condition w.r.t. w as w > q 2 w> w, which immediately gives an analytic soltion as w = q/. By inserting this soltion into the objective fnction in Eq. (5), we have an optimization problem only for : max apple > XX > +2 > Xb s.t. > =1, which is obviosly eqivalent to Eq. (23) with Q applexx > 2 R M M and c 2 Xb 2 R M. Let 1 be the soltion of this problem. Once 1 is obtained, we again solve another trst-region sbproblem of the 1615
4 form (23) bt in the R M 1 space by adding an orthogonality condition > 1 =0. In particlar, withot loss of generality, we assme the last component of 1 is nonzero, i.e., 1,M 6= 0. Define y =( 1,..., M 1 ) and a =( 1,1,..., 1,M 1 ). The problem (23) with the additional linear eqality constraint is eqivalent to min 1,..., M 1, 1,M Q P M 1 a i i + P P M 1 M 1 wii wm a i i 1,M s.t. > (I + aa > ) = M 1 P M 1 a i i 1,M Consider the Cholesky decomposition for rank-one pdate I + aa > = LL > and the change of variable y = L > ( 1,..., M 1 ) >. The decomposition can be done efficiently, for example [Gill et al., 1974]. The problem (24) is rewritten as min y > Qy + c > y s.t. y > y =1, y2r M 1 which has exactly the same format with (23). When more than two orthonormal vectors i are needed, a set of linear eqations is additionally considered > i =0,,...,j 1. A variable elimination method can be sed in order to work on a redced space. Note that an eigenvale decomposition for a matrix of dimension M j is needed to transform it into a (M j)-dimensional trst region sbproblem. In this way, we have a set of orthonormal vectors { 1,..., m }, where m is an inpt parameter representing the nmber of major directional patterns. Althogh the global optimality is no longer garanteed when > 0, we can take advantage of the global soltion at =0to initialize w in Algorithm 1. In practice, if there is a concern abot the qality of the soltion, we can gradally increase the vale of, and se the obtained {w j } s for the next trial for a larger. Althogh mathematically the RED algorithm is an iterative algorithm that may be trapped by sb-optimality, we can loosely say that it is an almost garanteed algorithm in practice. 4 Parameterized KL divergence for scoring Solving the optimization problem for the training and the test windows, we obtain two sets of orthonormal vectors { 1,..., m } and {v 1,...,v r } where m and r are the nmber of vectors given as inpt parameters. Compting the change score amonts to evalating the dissimilarity between the two vector spaces specified by orthonormal matrices 1 C A U [ 1,..., m ], U (t) [v 1,...,v r ]. (25) Now or problem is to compte the dissimilarity on a Stiefel manifold, which is the space spanned by orthogonal matrices. As illstrated in Fig. 1, in practice, the window size D shold be chosen as small as possible to minimize the time lag in change detection, while the nmber of samples N in the training data shold be large enogh to make sre to captre major patterns. Depending on the natre of data, it makes sense to assme m 6= r. To handle this general sitation, we consider linear combinations of i s and v i s and define the change score as a parameterized version of KL divergence: a (t) =min f,g Z dx M(x Uf,apple)ln M(x Uf,apple) M(x U (t) g,apple) (26) nder the constraint of f > f =1, g > g =1. This can be also viewed as an averaged version of the log likelihood ratio, which is the standard measre of change detection [Chen and Gpta, 2012]. By inserting the definition of the vmf distribtion in Eq. (1), we have a (t) = apple min f,g n hxi > Uf o U (t) g, (27) where h i is the expectation w.r.t. M(x Uf,apple). Since hxi / Uf follows from the basic property of the vmf distribtion [Mardia et al., 1980], we have a (t) =1 max f,g n f > U > U (t) g s.t. f > f =1, g > g =1, (28) where we dropped an nimportant prefactor. Solving the optimization problem (28) is easy. Introdcing Lagrange mltipliers 1, 2 for the two constraints, it is straightforward to obtain optimality conditions as U > U (t) g = 1 f, U (t)> Uf = 2 g. This means that f and g are fond via singlar-vale decomposition of U > U (t), which is a small matrix of size m r. The maximm of the objective fnction is simply given by the maximm singlar vale, formla for the change score: a (t) =1 (t) 1 o ; thereby we reach the final (t) 1. (29) The maximm singlar vector is efficiently compted by the power method [Golb and Loan, 1996]. In most practical sitations, it reqires only iterations as many as min{m, r}. The complexity to compte the KL-based change score is (min{m, r}) 3. Since m and r can be jst several in most applications, it is negligible in practice. 5 Related work As described so far, the proposed method extensively ses the vmf distribtion. For change or anomaly detection, little work has focsed on the vmf distribtion. [Idé and Kashima, 2004] seems to be one of the earliest pieces of work that explicitly leverages the vmf distribtion for anomaly detection, bt it does not discss the particlar task of change detection and sample reglarization. 1616
5 In statistics, a lot of efforts have focsed on asymptotic analysis of the likelihood ratio [Chen and Gpta, 2012]. Recently, [Kncheva, 2013] compares varios change detection approaches and concldes that a model combining Gassian mixtre and Hotelling s T 2 statistic works best. However, it is widely known that stably learning Gassian mixtre is hard for physical sensor data we are interested in, which is qite noisy and incldes many otliers. Also, in general, accrately estimating densities itself is challenging when dimensionality is high (M & 10). To address the challenge of density estimation, [Kawahara and Sgiyama, 2009; Li et al., 2013] proposed an interesting techniqe of direct density-ratio estimation, which integrates the two steps of parametric model estimation and scoring into a single step of density-ratio estimation. Thanks to the integration of the two steps, their approach is generally better than those estimates two densities individally. However, de to the very same reason, they lack practical interpretability, which is of critical importance in practice. Also, it has been pointed ot that the performance significantly degrades when some of the variables are jst non-informative nisance featres [Yamada et al., 2013]. Recently, to extract the most informative featres from mltivariate time-series data, [Blythe et al., 2012] proposed an interesting approach called stationary sbspace analysis (SSA). Althogh SSA proposed for the task of time-series segmentation, which is different from the on-line changedetection we are dealing with, we experimentally compare it with the proposed method in the next section. 6 Experimental reslts 6.1 Methods compared We compare the proposed method denoted by RED+KL, which ses Algorithm 1 for compting U and U (t) in Eqs. (25) and (29) for the change score, with the following alternative methods: RED+tr: Use Algorithm 1 for U bt replace Eq. (29) with the trace norm where r = m: a (t) 1 =1 m Tr(U> U (t) ). (30) SSA: Use SSA for U. First identify the most stationary sbspace by solving min V > V=I M EX { ln V > i V + kv > µ i k 2 }, (31) m where E is the nmber of epochs defined by a nonoverlapping time window of size D, and {µ i, i } are the sample mean and covariance matrix compted in the i-th epoch. represents the determinant in this case. Once V is fond, U is obtained as the complement space of V. The change score is compted by a (t) = ln U > (t) U + ku > µ (t) k 2 +Tr(U > (t) U), where µ (t) and (t) are the mean and the covariance matrix over D (t), which is defined as the set of the samples in the sliding window at time t. Before compting these, the data time point index Figre 3: Synthetic three-dimensional time-series data. RED SSA PCA Figre 4: Comparison of 1 (Synthetic data). is whitened with the same pooled mean and covariance of the training data. PCA: Use the principal component analysis for U. Employ the mean reconstrction error for scoring [Papadimitrio and Y, 2006] : a (t) = 1 X k(i m UU > )x (n) k 2. (32) D n2d (t) T2: Use the mean Hotelling s T 2 statistic a (t) = 1 X µ) > 1 (x (n) µ). (33) D n2d (t) (x (n) for scoring. Here µ and are the mean and the covariance matrix of the training data. T2 is compared only in change detection since it has no explicit featre extraction step. 6.2 Synthetic data: comparison of featre extraction methods Figre 3 shows three-dimensional synthetic time-series data we generated. In this data, x 1 and x 2 are qite noisy bt significantly correlated, while x 3 is ncorrelated to the others. Ths we expect the principal direction wold point to the 45 line between x 1 and x 2. We compared the proposed algorithm (denoted simply by RED) with two alternatives SSA and PCA. All methods take the data matrix X as the inpt, and retrn an orthonormal matrix U as the otpt. Figre 4 shows the coefficients of the first component 1. For RED, we sed (, ) =(1, 4), while for SSA we sed D = 25. We see that RED sccessflly captres the expected 45 direction as the principal direction. PCA has a similar trend, 1617
6 x st component x5 x7 x6 x nd component time point index x9 0 Figre 5: Ore transfer data nder the normal operation. bt de to the major otlier in x 2 at 94 (see Fig. 3), it has more weight in x 2. Close inspection shows that RED atomatically removes this otlier by ptting zero weight, demonstrating the atomated noise-filtering capability. The basic assmption of SSA is that the stationary components are most likely noise, and the non-stationary components are more informative for change detection. In this particlar example, the major pattern is the correlation strctre between x 1 and x 2, and the other variable x 3 is the noise. However, de to the heavy noise especially in the first half of x 3, SSA fails to disregard the noise variable. 6.3 Real-world data: comparison of on-line change detection performance We applied the proposed method to a real-world on-line change detection task. Figre 5 shows time-series data from an ore transfer system being monitored by ten sensors measring physical qantities sch as speed, crrent, load, temperatre, and displacement. The data itself was generated by a testbed system to simlate the normal operating condition and ths sed as the training data. As introdced in Sec. 2.1, the system consists of two almost eqivalent sbsystems, and some of the variables are significantly correlated, and incr the mltiplicative noise. As seen, the data is extremely noisy and sometimes exhibits implse-like noise de to the physical operating condition of the otdoor ore transfer system. For this training data, we applied the RED algorithm to find U and W. Figre 6 shows W =[w 1, w 2 ], where we sed (, ) =(2, 9) that maximized the F score for the test data (see the next paragraph). We see that many samples are driven to zero. In fact, 43 and 39 percents of the samples have exact zero in w 1 and w 2, respectively, ot of which abot 16 percent are zero in both. Close inspections show that almost all of ot-of-context otliers are ct off, while informative otliers that are consistent to the major correlation strctre srvive. This is exactly what we expected. We evalated the performance of on-line change detection sing another data set, where changes de to system malfnctions are recorded. Most of the failre symptoms are associated with nreasonable changes in the correlation strctre between the variables. We simply se the negative-sample and positive-sample accracies as the performance metric. Here, the negative samples are defined by those not belonging to change-points, while the positive samples are those be- Figre 6: The magnitde of the sample weights {w (n) i } for the first and second components (shold be aligned with Fig. 5). negative sample accracy (positive sample accracy) RED+KL RED+tr SSA PCA T2 Figre 7: Comparison of the ROC crve. longing to change-points. We sed the harmonic average (F score) of them to determine the (, ) vales. We se the window of D = 60 over abot 1200 samples. Figre 7 compares the ROC crve. Clearly, RED-KL with (m, r) =(2, 3) otperforms the alternatives. It is interesting to see RED-tr gives the worst, which demonstrates the importance the proposed sbspace comparison techniqe of Eq. (29). For this data set, SSA fails to captre change points. The main reason is that SSA is not necessarily robst to spiky otliers as seen in Fig. 5. Since the correlational strctre is critical to detect change points in this data, it makes sense that the PCA and T2 do a good job. 7 Conclsion We have proposed a new on-line change detection algorithm for mltivariate time-series data. Or algorithm extracts major directional patterns while atomatically disregarding less informative samples. We proved the convergence of the algorithm, and showed that the qality of the soltion is spported by the global optimality of the trst-region sbproblem. We also proposed a new method of scoring the change based on a parameterized KL divergence. We validated the algorithm sing real-world data. 1618
7 References [Blythe et al., 2012] D.A.J. Blythe, P. von Bna, F.C. Meinecke, and K.-R.Mller. Featre extraction for changepoint detection sing stationary sbspace analysis. IEEE Transactions on Neral Networks and Learning Systems, 23(4): , [Chen and Gpta, 2012] Jie Chen and Arjn K. Gpta. Parametric Statistical Change Point Analysis. Springer Verlag, [Gill et al., 1974] P. E. Gill, G. H. Golb, W. Mrray, and M. A. Sanders. Methods for modifying matrix factorizations. Mathematics of Comptation, 28(126): , [Golb and Loan, 1996] Gene H. Golb and Charles F. Van Loan. Matrix comptations (3rd ed.). Johns Hopkins University Press, Baltimore, MD, [Hager, 2001] W. W. Hager. Minimizing a qadratic over a sphere. SIAM Jornal on Compting, 12: , [Idé and Kashima, 2004] T. Idé and H. Kashima. Eigenspace-based anomaly detection in compter systems. In Proc. ACM SIGKDD Intl. Conf. Knowledge Discovery and Data Mining, pages , [Kawahara and Sgiyama, 2009] Yoshinob Kawahara and Masashi Sgiyama. Change-point detection in time-series data by direct density-ratio estimation. In Proc. of 2009 SIAM Intl. Conf. on Data Mining (SDM 09), [Kncheva, 2013] Ldmila I. Kncheva. Change detection in streaming mltivariate data sing likelihood detectors. IEEE Transactions on Knowledge and Data Engineering, 25(5): , [Li et al., 2013] S. Li, M. Yamada, N. Collier, and M. Sgiyama. Change-point detection in time-series data by relative density-ratio estimation. Neral Networks, 43:72 83, [Mardia et al., 1980] K. V. Mardia, J. T. Kent, and J. M. Bibby. Mltivariate Analysis. Academic Press, [Papadimitrio and Y, 2006] Spiros Papadimitrio and Philip Y. Optimal mlti-scale patterns in time series streams. In Proc ACM SIGMOD Intl. Conf. Management of Data, pages , [Sorensen, 1997] D. C. Sorensen. Minimization of a largescale qadratic fnction sbject to a spherical constraint. SIAM Jornal on Optimization, 7(1): , [Sra, 2012] Svrit Sra. A short note on parameter approximation for von Mises-Fisher distribtions: and a fast implementation of I s (x). Comptational Statistics, 27(1): , March [Tao and An, 1998] Pham Dinh Tao and Le Thi Hoai An. A D.C. optimization algorithm for solving the trst-region sbproblem. SIAM J. Optimization, 8: , [Toint et al., 2009] P. L. Toint, D. Tomanos, and M. Weber- Mendonca. A mltilevel algorithm for solving the trstregion sbproblem. Optimization Methods and Software, 24(2): , [Wen et al., 2010] Zaiwen Wen, Wotao Yin, Donald Goldfarb, and Yin Zhang. A fast algorithm for sparse reconstrction based on shrinkage, sbspace optimization, and contination. SIAM Jornal on Scientific Compting, 32(4): , [Yamada et al., 2013] M. Yamada, A. Kimra, F. Naya, and H. Sawada. Change-point detection with featre selection in high-dimensional time-series data. In Proc. Twenty- Third International Joint Conference on Artificial Intelligence, IJCAI 13, pages , [Zo and Hastie, 2005] Hi Zo and Trevor Hastie. Reglarization and variable selection via the elastic net. Jornal of the Royal Statistical Society, 67: ,
Change Detection Using Directional Statistics
Change Detection Using Directional Statistics Tsyoshi Idé Dzng T. Phan Jayant Kalagnanam IBM Research, T. J. Watson Research Center 1101 Kitchawan Rd., Yorktown Heights, NY 10598, USA tide,phand,jayant@s.ibm.com
More informationSources of Non Stationarity in the Semivariogram
Sorces of Non Stationarity in the Semivariogram Migel A. Cba and Oy Leangthong Traditional ncertainty characterization techniqes sch as Simple Kriging or Seqential Gassian Simlation rely on stationary
More informationA Characterization of the Domain of Beta-Divergence and Its Connection to Bregman Variational Model
entropy Article A Characterization of the Domain of Beta-Divergence and Its Connection to Bregman Variational Model Hyenkyn Woo School of Liberal Arts, Korea University of Technology and Edcation, Cheonan
More informationThe Dual of the Maximum Likelihood Method
Department of Agricltral and Resorce Economics University of California, Davis The Dal of the Maximm Likelihood Method by Qirino Paris Working Paper No. 12-002 2012 Copyright @ 2012 by Qirino Paris All
More informationA Model-Free Adaptive Control of Pulsed GTAW
A Model-Free Adaptive Control of Plsed GTAW F.L. Lv 1, S.B. Chen 1, and S.W. Dai 1 Institte of Welding Technology, Shanghai Jiao Tong University, Shanghai 00030, P.R. China Department of Atomatic Control,
More informationLine Orthogonality in Adjacency Eigenspace with Application to Community Partition
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Line Orthogonality in Adjacency Eigenspace with Application to Commnity Partition Leting W 1,XiaoweiYing 1,XintaoW
More informationVIBRATION MEASUREMENT UNCERTAINTY AND RELIABILITY DIAGNOSTICS RESULTS IN ROTATING SYSTEMS
VIBRATIO MEASUREMET UCERTAITY AD RELIABILITY DIAGOSTICS RESULTS I ROTATIG SYSTEMS. Introdction M. Eidkevicite, V. Volkovas anas University of Technology, Lithania The rotating machinery technical state
More informationSystem identification of buildings equipped with closed-loop control devices
System identification of bildings eqipped with closed-loop control devices Akira Mita a, Masako Kamibayashi b a Keio University, 3-14-1 Hiyoshi, Kohok-k, Yokohama 223-8522, Japan b East Japan Railway Company
More informationNonlinear parametric optimization using cylindrical algebraic decomposition
Proceedings of the 44th IEEE Conference on Decision and Control, and the Eropean Control Conference 2005 Seville, Spain, December 12-15, 2005 TC08.5 Nonlinear parametric optimization sing cylindrical algebraic
More informationSensitivity Analysis in Bayesian Networks: From Single to Multiple Parameters
Sensitivity Analysis in Bayesian Networks: From Single to Mltiple Parameters Hei Chan and Adnan Darwiche Compter Science Department University of California, Los Angeles Los Angeles, CA 90095 {hei,darwiche}@cs.cla.ed
More informationStability of Model Predictive Control using Markov Chain Monte Carlo Optimisation
Stability of Model Predictive Control sing Markov Chain Monte Carlo Optimisation Elilini Siva, Pal Golart, Jan Maciejowski and Nikolas Kantas Abstract We apply stochastic Lyapnov theory to perform stability
More informationAffine Invariant Total Variation Models
Affine Invariant Total Variation Models Helen Balinsky, Alexander Balinsky Media Technologies aboratory HP aboratories Bristol HP-7-94 Jne 6, 7* Total Variation, affine restoration, Sobolev ineqality,
More informationBayes and Naïve Bayes Classifiers CS434
Bayes and Naïve Bayes Classifiers CS434 In this lectre 1. Review some basic probability concepts 2. Introdce a sefl probabilistic rle - Bayes rle 3. Introdce the learning algorithm based on Bayes rle (ths
More informationCHANNEL SELECTION WITH RAYLEIGH FADING: A MULTI-ARMED BANDIT FRAMEWORK. Wassim Jouini and Christophe Moy
CHANNEL SELECTION WITH RAYLEIGH FADING: A MULTI-ARMED BANDIT FRAMEWORK Wassim Joini and Christophe Moy SUPELEC, IETR, SCEE, Avene de la Bolaie, CS 47601, 5576 Cesson Sévigné, France. INSERM U96 - IFR140-
More informationSimplified Identification Scheme for Structures on a Flexible Base
Simplified Identification Scheme for Strctres on a Flexible Base L.M. Star California State University, Long Beach G. Mylonais University of Patras, Greece J.P. Stewart University of California, Los Angeles
More informationTechnical Note. ODiSI-B Sensor Strain Gage Factor Uncertainty
Technical Note EN-FY160 Revision November 30, 016 ODiSI-B Sensor Strain Gage Factor Uncertainty Abstract Lna has pdated or strain sensor calibration tool to spport NIST-traceable measrements, to compte
More informationA New Approach to Direct Sequential Simulation that Accounts for the Proportional Effect: Direct Lognormal Simulation
A ew Approach to Direct eqential imlation that Acconts for the Proportional ffect: Direct ognormal imlation John Manchk, Oy eangthong and Clayton Detsch Department of Civil & nvironmental ngineering University
More informationLecture Notes On THEORY OF COMPUTATION MODULE - 2 UNIT - 2
BIJU PATNAIK UNIVERSITY OF TECHNOLOGY, ODISHA Lectre Notes On THEORY OF COMPUTATION MODULE - 2 UNIT - 2 Prepared by, Dr. Sbhend Kmar Rath, BPUT, Odisha. Tring Machine- Miscellany UNIT 2 TURING MACHINE
More informationReducing Conservatism in Flutterometer Predictions Using Volterra Modeling with Modal Parameter Estimation
JOURNAL OF AIRCRAFT Vol. 42, No. 4, Jly Agst 2005 Redcing Conservatism in Fltterometer Predictions Using Volterra Modeling with Modal Parameter Estimation Rick Lind and Joao Pedro Mortaga University of
More informationLecture Notes: Finite Element Analysis, J.E. Akin, Rice University
9. TRUSS ANALYSIS... 1 9.1 PLANAR TRUSS... 1 9. SPACE TRUSS... 11 9.3 SUMMARY... 1 9.4 EXERCISES... 15 9. Trss analysis 9.1 Planar trss: The differential eqation for the eqilibrim of an elastic bar (above)
More informationStudy on the impulsive pressure of tank oscillating by force towards multiple degrees of freedom
EPJ Web of Conferences 80, 0034 (08) EFM 07 Stdy on the implsive pressre of tank oscillating by force towards mltiple degrees of freedom Shigeyki Hibi,* The ational Defense Academy, Department of Mechanical
More informationA Survey of the Implementation of Numerical Schemes for Linear Advection Equation
Advances in Pre Mathematics, 4, 4, 467-479 Pblished Online Agst 4 in SciRes. http://www.scirp.org/jornal/apm http://dx.doi.org/.436/apm.4.485 A Srvey of the Implementation of Nmerical Schemes for Linear
More informationFRTN10 Exercise 12. Synthesis by Convex Optimization
FRTN Exercise 2. 2. We want to design a controller C for the stable SISO process P as shown in Figre 2. sing the Yola parametrization and convex optimization. To do this, the control loop mst first be
More informationTrustSVD: Collaborative Filtering with Both the Explicit and Implicit Influence of User Trust and of Item Ratings
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence TrstSVD: Collaborative Filtering with Both the Explicit and Implicit Inflence of User Trst and of Item Ratings Gibing Go Jie Zhang
More informationA Single Species in One Spatial Dimension
Lectre 6 A Single Species in One Spatial Dimension Reading: Material similar to that in this section of the corse appears in Sections 1. and 13.5 of James D. Mrray (), Mathematical Biology I: An introction,
More informationEfficient quadratic penalization through the partial minimization technique
This article has been accepted for pblication in a ftre isse of this jornal, bt has not been flly edited Content may change prior to final pblication Citation information: DOI 9/TAC272754474, IEEE Transactions
More informationFOUNTAIN codes [3], [4] provide an efficient solution
Inactivation Decoding of LT and Raptor Codes: Analysis and Code Design Francisco Lázaro, Stdent Member, IEEE, Gianligi Liva, Senior Member, IEEE, Gerhard Bach, Fellow, IEEE arxiv:176.5814v1 [cs.it 19 Jn
More informationOutline. Model Predictive Control: Current Status and Future Challenges. Separation of the control problem. Separation of the control problem
Otline Model Predictive Control: Crrent Stats and Ftre Challenges James B. Rawlings Department of Chemical and Biological Engineering University of Wisconsin Madison UCLA Control Symposim May, 6 Overview
More informationDevelopment of Second Order Plus Time Delay (SOPTD) Model from Orthonormal Basis Filter (OBF) Model
Development of Second Order Pls Time Delay (SOPTD) Model from Orthonormal Basis Filter (OBF) Model Lemma D. Tfa*, M. Ramasamy*, Sachin C. Patwardhan **, M. Shhaimi* *Chemical Engineering Department, Universiti
More informationNonparametric Identification and Robust H Controller Synthesis for a Rotational/Translational Actuator
Proceedings of the 6 IEEE International Conference on Control Applications Mnich, Germany, October 4-6, 6 WeB16 Nonparametric Identification and Robst H Controller Synthesis for a Rotational/Translational
More informationDiscussion of The Forward Search: Theory and Data Analysis by Anthony C. Atkinson, Marco Riani, and Andrea Ceroli
1 Introdction Discssion of The Forward Search: Theory and Data Analysis by Anthony C. Atkinson, Marco Riani, and Andrea Ceroli Søren Johansen Department of Economics, University of Copenhagen and CREATES,
More informationUNCERTAINTY FOCUSED STRENGTH ANALYSIS MODEL
8th International DAAAM Baltic Conference "INDUSTRIAL ENGINEERING - 19-1 April 01, Tallinn, Estonia UNCERTAINTY FOCUSED STRENGTH ANALYSIS MODEL Põdra, P. & Laaneots, R. Abstract: Strength analysis is a
More informationAn Investigation into Estimating Type B Degrees of Freedom
An Investigation into Estimating Type B Degrees of H. Castrp President, Integrated Sciences Grop Jne, 00 Backgrond The degrees of freedom associated with an ncertainty estimate qantifies the amont of information
More informationSimulation investigation of the Z-source NPC inverter
octoral school of energy- and geo-technology Janary 5 20, 2007. Kressaare, Estonia Simlation investigation of the Z-sorce NPC inverter Ryszard Strzelecki, Natalia Strzelecka Gdynia Maritime University,
More informationChapter 5 Computational Methods for Mixed Models
Chapter 5 Comptational Methods for Mixed Models In this chapter we describe some of the details of the comptational methods for fitting linear mixed models, as implemented in the lme4 package, and the
More informationThe Real Stabilizability Radius of the Multi-Link Inverted Pendulum
Proceedings of the 26 American Control Conference Minneapolis, Minnesota, USA, Jne 14-16, 26 WeC123 The Real Stabilizability Radis of the Mlti-Link Inerted Pendlm Simon Lam and Edward J Daison Abstract
More informationStep-Size Bounds Analysis of the Generalized Multidelay Adaptive Filter
WCE 007 Jly - 4 007 London UK Step-Size onds Analysis of the Generalized Mltidelay Adaptive Filter Jnghsi Lee and Hs Chang Hang Abstract In this paper we analyze the bonds of the fixed common step-size
More informationFEA Solution Procedure
EA Soltion Procedre (demonstrated with a -D bar element problem) EA Procedre for Static Analysis. Prepare the E model a. discretize (mesh) the strctre b. prescribe loads c. prescribe spports. Perform calclations
More informationOn relative errors of floating-point operations: optimal bounds and applications
On relative errors of floating-point operations: optimal bonds and applications Clade-Pierre Jeannerod, Siegfried M. Rmp To cite this version: Clade-Pierre Jeannerod, Siegfried M. Rmp. On relative errors
More informationDiscontinuous Fluctuation Distribution for Time-Dependent Problems
Discontinos Flctation Distribtion for Time-Dependent Problems Matthew Hbbard School of Compting, University of Leeds, Leeds, LS2 9JT, UK meh@comp.leeds.ac.k Introdction For some years now, the flctation
More informationChapter 4 Supervised learning:
Chapter 4 Spervised learning: Mltilayer Networks II Madaline Other Feedforward Networks Mltiple adalines of a sort as hidden nodes Weight change follows minimm distrbance principle Adaptive mlti-layer
More informationSafe Manual Control of the Furuta Pendulum
Safe Manal Control of the Frta Pendlm Johan Åkesson, Karl Johan Åström Department of Atomatic Control, Lnd Institte of Technology (LTH) Box 8, Lnd, Sweden PSfrag {jakesson,kja}@control.lth.se replacements
More informationWe automate the bivariate change-of-variables technique for bivariate continuous random variables with
INFORMS Jornal on Compting Vol. 4, No., Winter 0, pp. 9 ISSN 09-9856 (print) ISSN 56-558 (online) http://dx.doi.org/0.87/ijoc.046 0 INFORMS Atomating Biariate Transformations Jeff X. Yang, John H. Drew,
More informationFEA Solution Procedure
EA Soltion Procedre (demonstrated with a -D bar element problem) MAE 5 - inite Element Analysis Several slides from this set are adapted from B.S. Altan, Michigan Technological University EA Procedre for
More informationA State Space Based Implicit Integration Algorithm. for Differential Algebraic Equations of Multibody. Dynamics
A State Space Based Implicit Integration Algorithm for Differential Algebraic Eqations of Mltibody Dynamics E. J. Hag, D. Negrt, M. Ianc Janary 28, 1997 To Appear Mechanics of Strctres and Machines Abstract.
More informationAssignment Fall 2014
Assignment 5.086 Fall 04 De: Wednesday, 0 December at 5 PM. Upload yor soltion to corse website as a zip file YOURNAME_ASSIGNMENT_5 which incldes the script for each qestion as well as all Matlab fnctions
More information1 Undiscounted Problem (Deterministic)
Lectre 9: Linear Qadratic Control Problems 1 Undisconted Problem (Deterministic) Choose ( t ) 0 to Minimize (x trx t + tq t ) t=0 sbject to x t+1 = Ax t + B t, x 0 given. x t is an n-vector state, t a
More informationSection 7.4: Integration of Rational Functions by Partial Fractions
Section 7.4: Integration of Rational Fnctions by Partial Fractions This is abot as complicated as it gets. The Method of Partial Fractions Ecept for a few very special cases, crrently we have no way to
More informationEffects of Soil Spatial Variability on Bearing Capacity of Shallow Foundations
Geotechnical Safety and Risk V T. Schweckendiek et al. (Eds.) 2015 The athors and IOS Press. This article is pblished online with Open Access by IOS Press and distribted nder the terms of the Creative
More information3.1 The Basic Two-Level Model - The Formulas
CHAPTER 3 3 THE BASIC MULTILEVEL MODEL AND EXTENSIONS In the previos Chapter we introdced a nmber of models and we cleared ot the advantages of Mltilevel Models in the analysis of hierarchically nested
More informationFREQUENCY DOMAIN FLUTTER SOLUTION TECHNIQUE USING COMPLEX MU-ANALYSIS
7 TH INTERNATIONAL CONGRESS O THE AERONAUTICAL SCIENCES REQUENCY DOMAIN LUTTER SOLUTION TECHNIQUE USING COMPLEX MU-ANALYSIS Yingsong G, Zhichn Yang Northwestern Polytechnical University, Xi an, P. R. China,
More informationElements of Coordinate System Transformations
B Elements of Coordinate System Transformations Coordinate system transformation is a powerfl tool for solving many geometrical and kinematic problems that pertain to the design of gear ctting tools and
More informationBREGMAN ITERATIVE ALGORITHMS FOR l 1 -MINIMIZATION WITH APPLICATIONS TO COMPRESSED SENSING
BREGMAN ITERATIVE ALGORITHMS FOR l 1 -MINIMIZATION WITH APPLICATIONS TO COMPRESSED SENSING WOTAO YIN, STANLEY OSHER, DONALD GOLDFARB, AND JEROME DARBON Abstract. We propose simple and extremely efficient
More informationPIPELINE MECHANICAL DAMAGE CHARACTERIZATION BY MULTIPLE MAGNETIZATION LEVEL DECOUPLING
PIPELINE MECHANICAL DAMAGE CHARACTERIZATION BY MULTIPLE MAGNETIZATION LEVEL DECOUPLING INTRODUCTION Richard 1. Davis & 1. Brce Nestleroth Battelle 505 King Ave Colmbs, OH 40201 Mechanical damage, cased
More informationBridging the Gap Between Multigrid, Hierarchical, and Receding-Horizon Control
Bridging the Gap Between Mltigrid, Hierarchical, and Receding-Horizon Control Victor M. Zavala Mathematics and Compter Science Division Argonne National Laboratory Argonne, IL 60439 USA (e-mail: vzavala@mcs.anl.gov).
More informationDiscussion Papers Department of Economics University of Copenhagen
Discssion Papers Department of Economics University of Copenhagen No. 10-06 Discssion of The Forward Search: Theory and Data Analysis, by Anthony C. Atkinson, Marco Riani, and Andrea Ceroli Søren Johansen,
More informationUniversal Scheme for Optimal Search and Stop
Universal Scheme for Optimal Search and Stop Sirin Nitinawarat Qalcomm Technologies, Inc. 5775 Morehose Drive San Diego, CA 92121, USA Email: sirin.nitinawarat@gmail.com Vengopal V. Veeravalli Coordinated
More informationControl Performance Monitoring of State-Dependent Nonlinear Processes
Control Performance Monitoring of State-Dependent Nonlinear Processes Lis F. Recalde*, Hong Ye Wind Energy and Control Centre, Department of Electronic and Electrical Engineering, University of Strathclyde,
More informationPrediction of Transmission Distortion for Wireless Video Communication: Analysis
Prediction of Transmission Distortion for Wireless Video Commnication: Analysis Zhifeng Chen and Dapeng W Department of Electrical and Compter Engineering, University of Florida, Gainesville, Florida 326
More informationIncorporating Diversity in a Learning to Rank Recommender System
Proceedings of the Twenty-Ninth International Florida Artificial Intelligence Research Society Conference Incorporating Diversity in a Learning to Rank Recommender System Jacek Wasilewski and Neil Hrley
More informationModelling by Differential Equations from Properties of Phenomenon to its Investigation
Modelling by Differential Eqations from Properties of Phenomenon to its Investigation V. Kleiza and O. Prvinis Kanas University of Technology, Lithania Abstract The Panevezys camps of Kanas University
More informationB-469 Simplified Copositive and Lagrangian Relaxations for Linearly Constrained Quadratic Optimization Problems in Continuous and Binary Variables
B-469 Simplified Copositive and Lagrangian Relaxations for Linearly Constrained Qadratic Optimization Problems in Continos and Binary Variables Naohiko Arima, Snyong Kim and Masakaz Kojima October 2012,
More informationClassify by number of ports and examine the possible structures that result. Using only one-port elements, no more than two elements can be assembled.
Jnction elements in network models. Classify by nmber of ports and examine the possible strctres that reslt. Using only one-port elements, no more than two elements can be assembled. Combining two two-ports
More informationCreating a Sliding Mode in a Motion Control System by Adopting a Dynamic Defuzzification Strategy in an Adaptive Neuro Fuzzy Inference System
Creating a Sliding Mode in a Motion Control System by Adopting a Dynamic Defzzification Strategy in an Adaptive Nero Fzzy Inference System M. Onder Efe Bogazici University, Electrical and Electronic Engineering
More informationCollective Inference on Markov Models for Modeling Bird Migration
Collective Inference on Markov Models for Modeling Bird Migration Daniel Sheldon Cornell University dsheldon@cs.cornell.ed M. A. Saleh Elmohamed Cornell University saleh@cam.cornell.ed Dexter Kozen Cornell
More informationTIME ACCURATE FAST THREE-STEP WAVELET-GALERKIN METHOD FOR PARTIAL DIFFERENTIAL EQUATIONS
International Jornal of Wavelets, Mltiresoltion and Information Processing Vol. 4, No. (26) 65 79 c World Scientific Pblishing Company TIME ACCURATE FAST THREE-STEP WAVELET-GALERKIN METHOD FOR PARTIAL
More informationMathematical Models of Physiological Responses to Exercise
Mathematical Models of Physiological Responses to Exercise Somayeh Sojodi, Benjamin Recht, and John C. Doyle Abstract This paper is concerned with the identification of mathematical models for physiological
More informationApplying Fuzzy Set Approach into Achieving Quality Improvement for Qualitative Quality Response
Proceedings of the 007 WSES International Conference on Compter Engineering and pplications, Gold Coast, stralia, Janary 17-19, 007 5 pplying Fzzy Set pproach into chieving Qality Improvement for Qalitative
More informationPC1 PC4 PC2 PC3 PC5 PC6 PC7 PC8 PC
Accracy verss interpretability in exible modeling: implementing a tradeo sing Gassian process models Tony A. Plate (tap@mcs.vw.ac.nz) School of Mathematical and Compting Sciences Victoria University of
More informationRESGen: Renewable Energy Scenario Generation Platform
1 RESGen: Renewable Energy Scenario Generation Platform Emil B. Iversen, Pierre Pinson, Senior Member, IEEE, and Igor Ardin Abstract Space-time scenarios of renewable power generation are increasingly
More informationOn the circuit complexity of the standard and the Karatsuba methods of multiplying integers
On the circit complexity of the standard and the Karatsba methods of mltiplying integers arxiv:1602.02362v1 [cs.ds] 7 Feb 2016 Igor S. Sergeev The goal of the present paper is to obtain accrate estimates
More informationMultivariable Ripple-Free Deadbeat Control
Scholarly Jornal of Mathematics and Compter Science Vol. (), pp. 9-9, October Available online at http:// www.scholarly-jornals.com/sjmcs ISS 76-8947 Scholarly-Jornals Fll Length Research aper Mltivariable
More informationOptimal Control of a Heterogeneous Two Server System with Consideration for Power and Performance
Optimal Control of a Heterogeneos Two Server System with Consideration for Power and Performance by Jiazheng Li A thesis presented to the University of Waterloo in flfilment of the thesis reqirement for
More informationMath 116 First Midterm October 14, 2009
Math 116 First Midterm October 14, 9 Name: EXAM SOLUTIONS Instrctor: Section: 1. Do not open this exam ntil yo are told to do so.. This exam has 1 pages inclding this cover. There are 9 problems. Note
More informationFormal Methods for Deriving Element Equations
Formal Methods for Deriving Element Eqations And the importance of Shape Fnctions Formal Methods In previos lectres we obtained a bar element s stiffness eqations sing the Direct Method to obtain eact
More informationEstimating models of inverse systems
Estimating models of inverse systems Ylva Jng and Martin Enqvist Linköping University Post Print N.B.: When citing this work, cite the original article. Original Pblication: Ylva Jng and Martin Enqvist,
More informationFEA Solution Procedure
EA Soltion rocedre (demonstrated with a -D bar element problem) MAE - inite Element Analysis Many slides from this set are originally from B.S. Altan, Michigan Technological U. EA rocedre for Static Analysis.
More informationApplication of Compressed Sensing to DRM Channel Estimation
Application of Compressed Sensing to DRM Channel Estimation Chenhao Qi and Lenan W School of Information Science and Engineering Sotheast University, Nanjing 10096, China Email: {qch,wln}@se.ed.cn Abstract
More informationIntrodction Finite elds play an increasingly important role in modern digital commnication systems. Typical areas of applications are cryptographic sc
A New Architectre for a Parallel Finite Field Mltiplier with Low Complexity Based on Composite Fields Christof Paar y IEEE Transactions on Compters, Jly 996, vol 45, no 7, pp 856-86 Abstract In this paper
More informationON THE SHAPES OF BILATERAL GAMMA DENSITIES
ON THE SHAPES OF BILATERAL GAMMA DENSITIES UWE KÜCHLER, STEFAN TAPPE Abstract. We investigate the for parameter family of bilateral Gamma distribtions. The goal of this paper is to provide a thorogh treatment
More informationConstructive Root Bound for k-ary Rational Input Numbers
Constrctive Root Bond for k-ary Rational Inpt Nmbers Sylvain Pion, Chee Yap To cite this version: Sylvain Pion, Chee Yap. Constrctive Root Bond for k-ary Rational Inpt Nmbers. 19th Annal ACM Symposim on
More informationLOS Component-Based Equal Gain Combining for Ricean Links in Uplink Massive MIMO
016 Sixth International Conference on Instrmentation & Measrement Compter Commnication and Control LOS Component-Based Eqal Gain Combining for Ricean Lins in plin Massive MIMO Dian-W Ye College of Information
More informationPHASE STEERING AND FOCUSING BEHAVIOR OF ULTRASOUND IN CEMENTITIOUS MATERIALS
PHAS STRING AND FOCUSING BHAVIOR OF ULTRASOUND IN CMNTITIOUS MATRIALS Shi-Chang Wooh and Lawrence Azar Department of Civil and nvironmental ngineering Massachsetts Institte of Technology Cambridge, MA
More informationTed Pedersen. Southern Methodist University. large sample assumptions implicit in traditional goodness
Appears in the Proceedings of the Soth-Central SAS Users Grop Conference (SCSUG-96), Astin, TX, Oct 27-29, 1996 Fishing for Exactness Ted Pedersen Department of Compter Science & Engineering Sothern Methodist
More informationDynamic Optimization of First-Order Systems via Static Parametric Programming: Application to Electrical Discharge Machining
Dynamic Optimization of First-Order Systems via Static Parametric Programming: Application to Electrical Discharge Machining P. Hgenin*, B. Srinivasan*, F. Altpeter**, R. Longchamp* * Laboratoire d Atomatiqe,
More informationOptimal search: a practical interpretation of information-driven sensor management
Optimal search: a practical interpretation of information-driven sensor management Fotios Katsilieris, Yvo Boers and Hans Driessen Thales Nederland B.V. Hengelo, the Netherlands Email: {Fotios.Katsilieris,
More informationAdaptive Fault-tolerant Control with Control Allocation for Flight Systems with Severe Actuator Failures and Input Saturation
213 American Control Conference (ACC) Washington, DC, USA, Jne 17-19, 213 Adaptive Falt-tolerant Control with Control Allocation for Flight Systems with Severe Actator Failres and Inpt Satration Man Wang,
More informationModel Discrimination of Polynomial Systems via Stochastic Inputs
Model Discrimination of Polynomial Systems via Stochastic Inpts D. Georgiev and E. Klavins Abstract Systems biologists are often faced with competing models for a given experimental system. Unfortnately,
More informationA Macroscopic Traffic Data Assimilation Framework Based on Fourier-Galerkin Method and Minimax Estimation
A Macroscopic Traffic Data Assimilation Framework Based on Forier-Galerkin Method and Minima Estimation Tigran T. Tchrakian and Sergiy Zhk Abstract In this paper, we propose a new framework for macroscopic
More informationarxiv: v1 [cs.sy] 22 Nov 2018
AAS 18-253 ROBUST MYOPIC CONTROL FOR SYSTEMS WITH IMPERFECT OBSERVATIONS Dantong Ge, Melkior Ornik, and Ufk Topc arxiv:1811.09000v1 [cs.sy] 22 Nov 2018 INTRODUCTION Control of systems operating in nexplored
More informationData-Efficient Control Policy Search using Residual Dynamics Learning
Data-Efficient Control Policy Search sing Residal Dynamics Learning Matteo Saveriano 1, Ychao Yin 1, Pietro Falco 1 and Donghei Lee 1,2 Abstract In this work, we propose a model-based and data efficient
More information), σ is a parameter, is the Euclidean norm in R d.
WEIGHTED GRAPH LAPLACIAN AND IMAGE INPAINTING ZUOQIANG SHI, STANLEY OSHER, AND WEI ZHU Abstract. Inspired by the graph Laplacian and the point integral method, we introdce a novel weighted graph Laplacian
More informationSubcritical bifurcation to innitely many rotating waves. Arnd Scheel. Freie Universitat Berlin. Arnimallee Berlin, Germany
Sbcritical bifrcation to innitely many rotating waves Arnd Scheel Institt fr Mathematik I Freie Universitat Berlin Arnimallee 2-6 14195 Berlin, Germany 1 Abstract We consider the eqation 00 + 1 r 0 k2
More informationPath-SGD: Path-Normalized Optimization in Deep Neural Networks
Path-SGD: Path-Normalized Optimization in Deep Neral Networks Behnam Neyshabr, Rslan Salakhtdinov and Nathan Srebro Toyota Technological Institte at Chicago Department of Compter Science, University of
More informationDepartment of Industrial Engineering Statistical Quality Control presented by Dr. Eng. Abed Schokry
Department of Indstrial Engineering Statistical Qality Control presented by Dr. Eng. Abed Schokry Department of Indstrial Engineering Statistical Qality Control C and U Chart presented by Dr. Eng. Abed
More informationMEASUREMENT OF TURBULENCE STATISTICS USING HOT WIRE ANEMOMETRY
MEASUREMENT OF TURBULENCE STATISTICS USING HOT WIRE ANEMOMETRY Mrgan Thangadrai +, Atl Kmar Son *, Mritynjay Singh +, Sbhendra *, Vinoth Kmar ++, Ram Pyare Singh +, Pradip K Chatterjee + + Thermal Engineering,
More informationAnalytical Value-at-Risk and Expected Shortfall under Regime Switching *
Working Paper 9-4 Departamento de Economía Economic Series 14) Universidad Carlos III de Madrid March 9 Calle Madrid, 16 893 Getafe Spain) Fax 34) 91649875 Analytical Vale-at-Risk and Expected Shortfall
More informationImprecise Continuous-Time Markov Chains
Imprecise Continos-Time Markov Chains Thomas Krak *, Jasper De Bock, and Arno Siebes t.e.krak@.nl, a.p.j.m.siebes@.nl Utrecht University, Department of Information and Compting Sciences, Princetonplein
More informationConvergence analysis of ant colony learning
Delft University of Technology Delft Center for Systems and Control Technical report 11-012 Convergence analysis of ant colony learning J van Ast R Babška and B De Schtter If yo want to cite this report
More informationAN ISOGEOMETRIC SOLID-SHELL FORMULATION OF THE KOITER METHOD FOR BUCKLING AND INITIAL POST-BUCKLING ANALYSIS OF COMPOSITE SHELLS
th Eropean Conference on Comptational Mechanics (ECCM ) 7th Eropean Conference on Comptational Flid Dynamics (ECFD 7) 5 Jne 28, Glasgow, UK AN ISOGEOMETRIC SOLID-SHELL FORMULATION OF THE KOITER METHOD
More information