We show that the prediction of (15)N relaxation rates in proteins can be extended to systems with anisotropic global rotational diffusion by using a network of coupled rotators (NCR), starting from a three-dimensional structure. The relaxation rates predicted by this method are confronted in several examples with experiments performed by other groups. The NCR spectral density functions are comp...

In this paper, the dynamic response of a viscoelastic beam subjected to a moving distributed load has been studied. The viscoelastic properties of the beam have been considered as linear standard model in shear and incompressible in bulk. The stress components have been separated to the shear and dilatation components and as a result the governing equations in viscoelastic form has been obtaine...

Viscoelastic material behavior is often characterized using one of the three measurements: creep, stress-relaxation or dynamic sinusoidal tests. A two-stage numerical method was developed to allow representation of data from creep and stress-relaxation tests on the Fourier axis in the Laplace domain. The method assumes linear behavior and is theoretically applicable to any transient test which ...

Regular and stochastic behavior in the time series of Parkinsonian pathological tremor velocity is studied on the basis of the statistical theory of discrete non-Markov stochastic processes and flicker-noise spectroscopy. We have developed a new method of analyzing and diagnosing Parkinson’s disease (PD) by taking into consideration discreteness, fluctuations, longand short-range correlations, ...

A suboptimal approach to distributed robust MPC for uncertain systems consisting of polytopic subsystems with coupled dynamics subject to both state and input constraints is proposed. The approach applies the dynamic dual decomposition method and reformulates the original centralized robust MPC problem into a distributed robust MPC problem. It is based on distributed on-line optimization by app...

This article presents an exact cooperative method for the solution of the Multidimensional Knapsack Problem (MKP ) which combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on surrogate relaxation and a branch and bound procedure. Our algorithm was tested for several randomly generated test sets and problems in the literature. Sol...

Abstract: This article presents an exact cooperative method for the solution of the multidimensional knapsack problem ( ) MKP which combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on surrogate relaxation and a branch and bound procedure. Our algorithm was tested for several randomly generated test sets and problems in the lite...