This study proposes a new linear approximation for solving the dynamic response equations of a rocking rigid block. Linearization assumptions which have already been used by Hounser and other researchers cannot be valid for all rocking blocks with various slenderness ratios and dimensions; hence, developing new methods which can result in better approximation of governing equations while keepin...

A method is examined to approximate the interface conditions for Chebyshev polynomial approximations to the solutions of parabolic problems, and a smoothing technique is used to calculate the interface conditions for a domain decomposition method. The method uses a polynomial of one less degree than the full approximation to calculate the rst derivative so that interface values can be calculate...

T HIS PAPER considers two-person, zero-sum stochastic games with finite state space = {1, -, N} and in each state i E 2, two finite sets K(i) and L(i) of actions available to player 1 and 2, respectively. The state of the system is observed at equidistant epochs. When the system is observed to be in state i, the two players choose an action, or a randomization of actions out of K(i) and L(i), r...

Cover design: Maryam (Narjes) Shojai Kaveh Cover illustrations: The robot is called Zebro and is designed at DCSC robotic laboratory. The other photos are downloaded from Wikipedia. " Fences are made for those who cannot fly. "

In this paper, we consider computational methods for optimizing a multivariate inhomogeneous polynomial function over a compact set. The focus is on the design and analysis of polynomial-time approximation algorithms. The references on approximation algorithms for inhomogeneous polynomial optimization problems are extremely scarce in the literature. To the best of our knowledge, the only result...

In this seminar paper we give an introduction to the field of deterministic approximate inference. We cast the problem of approximating a posterior distribution over hidden variables as a variational minimization problem. In this framework we describe three algorithms: Variational Factorization, Variational Bounds and Expectation Propagation. We analyze the approximations obtained by the three ...

Experimental studies have shown that the protein abundance in living cells varies from few tens to several thousands molecules per species. Molecular fluctuations roughly scale as the inverse square root of the number of molecules due to the random timing of reactions. It is hence expected that intrinsic noise plays an important role in the dynamics of biochemical networks. The Chemical Master ...

A new method for approximating two-dimensional integrals B f (x) µ(dx) over surfaces B ⊂ R 3 is introduced where µ is the standard measure of surface area. Such integrals typically occur in boundary element methods. The algorithm is based on triangulations T := T i approximating B. Under the assumption that the surface B is given implicitly by an equation H(x) = 0, a retraction P : U ⊃ B → B is...

Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This paper explores the use of lasso for statistical language modeling for text input. Owing to the very large number of parameters, directly optimizing the penalized lasso loss function is impossible. Therefore, we investig...