Implementing precision methods in personalizing psychological therapies: barriers and possible ways forward

This is the final version. Available on open access from Elsevier via the DOI in this recordData availability: No data was used for the research described in the article.Highlights: • Personalizing psychological treatments means to customize treatment for individuals to enhance outcomes. • The application of precision methods to clinical psychology has led to data-driven psychological therapies. • Applying data-informed psychological therapies involves clinical, technical, statistical, and contextual aspects

A frequency-domain identification approach to the study of neuromuscular systems - a combined experimental and modelling study

Experimental investigation of the neuromuscular system involves not only analysis of continuous signals but also necessitates the study of sequences of action potentials recorded from individual neurones together with the interactions between several sequences. Trains of action potentials may be regarded as realisations of stochastic point processes and techniques for the identification of point process systems can provide valuable experimental tools for the investigation of neuromuscular systems. Computational methods are presented for estimating the finite Fourier transform of a point process, and the associated spectral estimation procedures are described. An example is presented to illustrate the application of linear point process model identification techniques to the muscle spindle receptor. Using this example, simulation techniques are applied to demonstrate that spectral estimates can provide valuable physiological insight

The Maximum Resource Bin Packing Problem

Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. This paper presents results for the opposite problems, where we would like to maximize the number of bins used or minimize the number or total size of accepted items. We consider off-line and on-line variants of the problems. For the off-line variant, we require that there be an ordering of the bins, so that no item in a later bin fits in an earlier bin. We find the approximation ratios of two natural approximation algorithms, First-Fit-Increasing and First-Fit-Decreasing for the maximum resource variant of classical bin packing. For the on-line variant, we define maximum resource variants of classical and dual bin packing. For dual bin packing, no on-line algorithm is competitive. For classical bin packing, we find the competitive ratio of various natural algorithms. We study the general versions of the problems as well as the parameterized versions where on the item sizes, for some integer k. there is an upper bound of 1/

Kinetic boundary conditions in the lattice Boltzmann method

Derivation of the lattice Boltzmann method from the continuous kinetic theory [X. He and L. S. Luo, Phys. Rev. E 55, R6333 (1997); X. Shan and X. He, Phys. Rev. Lett. 80, 65 (1998)] is extended in order to obtain boundary conditions for the method. For the model of a diffusively reflecting moving solid wall, the boundary condition for the discrete set of velocities is derived, and the error of the discretization is estimated. Numerical results are presented which demonstrate convergence to the hydrodynamic limit. In particular, the Knudsen layer in the Kramers' problem is reproduced correctly for small Knudsen numbers

Fisher information in window censored renewal process data and its applications

Renewal process, Window censoring, Fisher information, Simulation, Exponential distribution, Gamma distribution, Experimental design,