Variability, regularity and coupling measures distinguish PD tremor from voluntary 5Hz tremor

A characteristic of Parkinson's disease (PD) is the development of tremor within the 4–6 Hz range. One method used to better understand pathological tremor is to compare the responses to tremor-type actions generated intentionally in healthy adults. This study was designed to investigate the similarities and differences between voluntarily generated 4–6 Hz tremor and PD tremor in regards to their amplitude, frequency and coupling characteristics. Tremor responses for 8 PD individuals (on- and off-medication) and 12 healthy adults were assessed under postural and resting conditions. Results showed that the voluntary and PD tremor were essentially identical with regards to the amplitude and peak frequency. However, differences between the groups were found for the variability (SD of peak frequency, proportional power) and regularity (Approximate Entropy, ApEn) of the tremor signal. Additionally, coherence analysis revealed strong inter-limb coupling during voluntary conditions while no bilateral coupling was seen for the PD persons. Overall, healthy participants were able to produce a 5 Hz tremulous motion indistinguishable to that of PD patients in terms of peak frequency and amplitude. However, differences in the structure of variability and level of inter-limb coupling were found for the tremor responses of the PD and healthy adults. These differences were preserved irrespective of the medication state of the PD persons. The results illustrate the importance of assessing the pattern of signal structure/variability to discriminate between different tremor forms, especially where no differences emerge in standard measures of mean amplitude as traditionally defined.

Transit passenger segmentation using travel regularity mined from Smart Card transactions data

Transit passenger market segmentation enables transit operators to target different classes of transit users to provide customized information and services. The Smart Card (SC) data, from Automated Fare Collection system, facilitates the understanding of multiday travel regularity of transit passengers, and can be used to segment them into identifiable classes of similar behaviors and needs. However, the use of SC data for market segmentation has attracted very limited attention in the literature. This paper proposes a novel methodology for mining spatial and temporal travel regularity from each individual passenger’s historical SC transactions and segments them into four segments of transit users. After reconstructing the travel itineraries from historical SC transactions, the paper adopts the Density-Based Spatial Clustering of Application with Noise (DBSCAN) algorithm to mine travel regularity of each SC user. The travel regularity is then used to segment SC users by an a priori market segmentation approach. The methodology proposed in this paper assists transit operators to understand their passengers and provide them oriented information and services.

Maximal regularity for second order non-autonomous Cauchy problems

We consider some non-autonomous second order Cauchy problems of the form u + B(t)(u) over dot + A(t)u = f (t is an element of [0, T]), u(0) = (u) over dot(0) = 0. We assume that the first order problem (u) over dot + B(t)u = f (t is an element of [0, T]), u(0) = 0, has L-p-maximal regularity. Then we establish L-p-maximal regularity of the second order problem in situations when the domains of B(t(1)) and A(t(2)) always coincide, or when A(t) = kappa B(t).

Boundary regularity of correspondences in C-n

Let M, M' be smooth, real analytic hypersurfaces of finite type in C-n and f a holomorphic correspondence (not necessarily proper) that is defined on one side of M, extends continuously up to M and maps M to M-t. It is shown that f must extend across M as a locally proper holonnorphic correspondence. This is a version for correspondences of the Diederich-Pinchuk extension result for CR maps.

Extended histories: improving regularity and performance in correlation prefetchers

Data Prefetchers identify and make use of any regularity present in the history/training stream to predict future references and prefetch them into the cache. The training information used is typically the primary misses seen at a particular cache level, which is a filtered version of the accesses seen by the cache. In this work we demonstrate that extending the training information to include secondary misses and hits along with primary misses helps improve the performance of prefetchers. In addition to empirical evaluation, we use the information theoretic metric entropy, to quantify the regularity present in extended histories. Entropy measurements indicate that extended histories are more regular than the default primary miss only training stream. Entropy measurements also help corroborate our empirical findings. With extended histories, further benefits can be achieved by triggering prefetches during secondary misses also. In this paper we explore the design space of extended prefetch histories and alternative prefetch trigger points for delta correlation prefetchers. We observe that different prefetch schemes benefit to a different extent with extended histories and alternative trigger points. Also the best performing design point varies on a per-benchmark basis. To meet these requirements, we propose a simple adaptive scheme that identifies the best performing design point for a benchmark-prefetcher combination at runtime. In SPEC2000 benchmarks, using all the L2 accesses as history for prefetcher improves the performance in terms of both IPC and misses reduced over techniques that use only primary misses as history. The adaptive scheme improves the performance of CZone prefetcher over Baseline by 4.6% on an average. These performance gains are accompanied by a moderate reduction in the memory traffic requirements.

Some regularity theorems for CR mappings

The purpose of this article is to study Lipschitz CR mappings from an h-extendible (or semi-regular) hypersurface in . Under various assumptions on the target hypersurface, it is shown that such mappings must be smooth. A rigidity result for proper holomorphic mappings from strongly pseudoconvex domains is also proved.

Error analysis of discontinuous Galerkin methods for the Stokes problem under minimal regularity

In this article, we analyse several discontinuous Galerkin (DG) methods for the Stokes problem under minimal regularity on the solution. We assume that the velocity u belongs to H-0(1)(Omega)](d) and the pressure p is an element of L-0(2)(Omega). First, we analyse standard DG methods assuming that the right-hand side f belongs to H-1(Omega) boolean AND L-1(Omega)](d). A DG method that is well defined for f belonging to H-1(Omega)](d) is then investigated. The methods under study include stabilized DG methods using equal-order spaces and inf-sup stable ones where the pressure space is one polynomial degree less than the velocity space.

Regimes of nonlinear depletion and regularity in the 3D Navier-Stokes equations

The periodic 3D Navier-Stokes equations are analyzed in terms of dimensionless, scaled, L-2m-norms of vorticity D-m (1 <= m <= infinity). The first in this hierarchy, D-1, is the global enstrophy. Three regimes naturally occur in the D-1-D-m plane. Solutions in the first regime, which lie between two concave curves, are shown to be regular, owing to strong nonlinear depletion. Moreover, numerical experiments have suggested, so far, that all dynamics lie in this heavily depleted regime 1]; new numerical evidence for this is presented. Estimates for the dimension of a global attractor and a corresponding inertial range are given for this regime. However, two more regimes can theoretically exist. In the second, which lies between the upper concave curve and a line, the depletion is insufficient to regularize solutions, so no more than Leray's weak solutions exist. In the third, which lies above this line, solutions are regular, but correspond to extreme initial conditions. The paper ends with a discussion on the possibility of transition between these regimes.

COMPLEX GEODESICS, THEIR BOUNDARY REGULARITY, AND A HARDY-LITTLEWOOD-TYPE LEMMA

We begin by giving an example of a smoothly bounded convex domain that has complex geodesics that do not extend continuously up to partial derivative D. This example suggests that continuity at the boundary of the complex geodesics of a convex domain Omega (sic) C-n, n >= 2, is affected by the extent to which partial derivative Omega curves or bends at each boundary point. We provide a sufficient condition to this effect (on C-1-smoothly bounded convex domains), which admits domains having boundary points at which the boundary is infinitely flat. Along the way, we establish a Hardy-Littlewood-type lemma that might be of independent interest.

Strain Regularity and Stiffness Tensor of Reinforcers in Dense Particle Reinforced Composites

针对高体积份数、随机分布、等轴状颗粒增强复合材料 ,研究了材料的应变分布规律 ,给出了基体和增强体应变平均值与材料微观结构参数之间的定量关系。结果表明 ,除应变平均值外 ,应变涨落是影响刚度张量的另一个重要因素 ,研究了应变涨落与材料微观结构参数之间的关系 ,并推导出了复合材料的刚度张量。与实验结果和以往的理论比较 ,预测结果与实验结果吻合良好

Regularity of strain distribution in short-fiber/whisker reinforced composites

Based on studies on the strain distribution in short-fiber/whisker reinforced metal matrix composites, a deformation characteristic parameter, lambda is defined as a ratio of root-mean-square strain of the reinforcers identically oriented to the macro-linear strain along the same direction. Quantitative relation between lambda and microstructure parameters of composites is obtained. By using lambda, the stiffness moduli of composites with arbitrary reinforcer orientation density function and under arbitrary loading condition are derived. The upper-bound and lower-bound of the present prediction are the same as those from the equal-strain theory and equal-stress theory, respectively. The present theory provides a physical explanation and theoretical base for the present commonly-used empirical formulae. Compared with the microscopic mechanical theories, the present theory is competent for stiffness modulus prediction of practical engineering composites in accuracy and simplicity.

Approximate Best Proximity Points of Cyclic Self-maps in Metric Spaces and Cyclic Asymptotic Regularity

3rd International Conference on Mathematical Modeling in Physical Sciences (IC-MSQUARE) Madrid, AUG 28-31, 2014 / editado por Vagenas, EC; Vlachos, DS; Bastos, C; Hofer, T; Kominis, Y; Kosmas, O; LeLay, G; DePadova, P; Rode, B; Suraud, E; Varga, K

Synthesizing Regularity Exposing Attributes in Large Protein Databases

This thesis describes a system that synthesizes regularity exposing attributes from large protein databases. After processing primary and secondary structure data, this system discovers an amino acid representation that captures what are thought to be the three most important amino acid characteristics (size, charge, and hydrophobicity) for tertiary structure prediction. A neural network trained using this 16 bit representation achieves a performance accuracy on the secondary structure prediction problem that is comparable to the one achieved by a neural network trained using the standard 24 bit amino acid representation. In addition, the thesis describes bounds on secondary structure prediction accuracy, derived using an optimal learning algorithm and the probably approximately correct (PAC) model.