Seizure warning algorithm based on optimization and nonlinear dynamics

There is growing evidence that temporal lobe seizures are preceded by a preictal transition, characterized by a gradual dynamical change from asymptomatic interictal state to seizure. We herein report the first prospective analysis of the online automated algorithm for detecting the preictal transition in ongoing EEG signals. Such, the algorithm constitutes a seizure warning system. The algorithm estimates STL_max, a measure of the order or disorder of the signal, of EEG signals recorded from individual electrode sites. The optimization techniques were employed to select critical brain electrode sites that exhibit the preictal transition for the warning of epileptic seizures. Specifically, a quadratically constrained quadratic 0-1 programming problem is formulated to identify critical electrode sites. The automated seizure warning algorithm was tested in continuous, long-term EEG recordings obtained from 5 patients with temporal lobe epilepsy. For individual patient, we use the first half of seizures to train the parameter settings, which is evaluated by ROC (Receiver Operating Characteristic) curve analysis. With the best parameter setting, the algorithm applied to all cases predicted an average of 91.7% of seizures with an average false prediction rate of 0.196 per hour. These results indicate that it may be possible to develop automated seizure warning devices for diagnostic and therapeutic purposes.Mathematics Subject Classification (1991):20E28, 20G40, 20C20     

Allocating electricity transmission costs through tracing: a game-theoretic rationale

Tracing is a method of assigning flows in an electricity network to particular generators and loads, assuming perfect mixing at each node. It can be used to assign costs to transmission users. We show that the resulting allocation is equal to the Shapley value of an equivalent co-operative game.     

Diffusion in poro‐plastic media

A model is developed for the flow of a slightly compressible fluid through a saturated inelastic porous medium. The initial‐boundary‐value problem is a system that consists of the diffusion equation for the fluid coupled to the momentum equation for the porous solid together with a constitutive law which includes a possibly hysteretic relation of elasto‐visco‐plastic type. The variational form of this problem in Hilbert space is a non‐linear evolution equation for which the existence and uniqueness of a global strong solution is proved by means of monotonicity methods. Various degenerate situations are permitted, such as incompressible fluid, negligible porosity, or a quasi‐static momentum equation. The essential sufficient conditions for the well‐posedness of the system consist of an ellipticity condition on the term for diffusion of fluid and either a viscous or a hardening assumption in the constitutive relation for the porous solid. Copyright © 2004 John Wiley & Sons, Ltd.     

Uniformity in Computable Structure Theory

We investigate the effects of adding uniformity requirements to concepts in computable structure theory such as computable categoricity (of a structure) and intrinsic computability (of a relation on a computable structure). We consider and compare two different notions of uniformity, previously studied by Kudinov and by Ventsov. We discuss some of their results and establish new ones, while also exploring the connections with the relative computable structure theory of Ash, Knight, Manasse, and Slaman and Chisholm and with previous work of Ash, Knight, and Slaman on uniformity in a general computable structure-theoretical setting.     

A note on compact elements in the lattice of radicals

An example of radical compact ring A whose Dorroh extension A¹ is not radical compact is constructed.     

Fold‐2‐covering triangular embeddings

For a graph G and a positive integer m, G_(m) is the graph obtained from G by replacing every vertex by an independent set of size m and every edge by m² edges joining all possible new pairs of ends. If G triangulates a surface, then it is easy to see from Euler's formula that G_(m) can, in principle, triangulate a surface. For m prime and at least 7, it has previously been shown that in fact G_(m) does triangulate a surface, and in fact does so as a “covering with folds” of the original triangulation. For m = 5, this would be a consequence of Tutte's 5‐Flow Conjecture. In this work, we investigate the case m = 2 and describe simple classes of triangulations G for which G₍₂₎ does have a triangulation that covers G “with folds,” as well as providing a simple infinite class of triangulations G of the sphere for which G₍₂₎ does not triangulate any surface. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 79–92, 2003     

Three-dimensional structure of Saccharomyces cerevisiae inorganic pyrophosphatase complexed with cobalt and phosphate ions

Crystals of Saccharomyces cerevisiae inorganic pyrophosphatase suitable for X-ray diffraction study were grown by cocrystallization of the enzyme with cobalt chloride and imidodiphosphate. Saccharomyces cerevisiae is a metal-dependent enzyme which catalyzes hydrolysis of inorganic pyrophosphate to orthophosphate. The three-dimensional structure of this enzyme was solved by the molecular-replacement method and refined at 1.8 Å resolution to an R factor of 19.5%. Cobalt and phosphate ions were revealed in the active centers of both identical subunits (A and B) of the pyrophosphatase molecule. In subunit B, a water molecule was found between two cobalt ions. It is believed that this water molecule acts as an attacking nucleophile in the enzymatic cleavage of the pyrophosphate bond. It was demonstrated that cobalt ions and a phosphate group occupy only part of the potential binding sites (two chemically identical and crystallographically independent subunits have different binding sites). The arrangement of ligands and the structure of the nucleophile-binding site are discussed in relation to the mechanism of action of the enzyme and the nature of the metal activator.     

A power mode approach to estimating vibrational power transmitted by multiple sources

A power mode method for the estimation of the power transmitted to a flexible receiver by an array of point force excitations is described. The vibrational power transmitted by N discrete point forces is regarded as the power transmitted by N independent power modes following eigendecomposition of the mobility matrix of the receiving structure. Approximate expressions for the upper and lower bounds and the mean value of the transmitted power are then developed in terms of these power modes. The approach is extended to more general cases, including that where both force and moment excitations are applied to the structure and where there are velocity source excitations. Numerical examples are presented.     

Self-Interactions of Strands and Sheets

Physical strands or sheets that can be modelled as curves or surfaces embedded in three dimensions are ubiquitous in nature, and are of fundamental importance in mathematics, physics, biology, and engineering. Often the physical interpretation dictates that self-avoidance should be enforced in the continuum model, i.e., finite energy configurations should not self-intersect. Current continuum models with self-avoidance frequently employ pairwise repulsive potentials, which are of necessity singular. Moreover the potentials do not have an intrinsic length scale appropriate for modelling the finite thickness of the physical systems. Here we develop a framework for modelling self-avoiding strands and sheets which avoids singularities, and which provides a way to introduce a thickness length scale. In our approach pairwise interaction potentials are replaced by many-body potentials involving three or more points, and the radii of certain associated circles or spheres. Self-interaction energies based on these many-body potentials can be used to describe the statistical mechanics of self-interacting strands and sheets of finite thickness.     

Gaussian Chaos Laws on Banach Function Spaces

We give a characterization of Gaussian chaos laws on Banach function spaces which do not contain ℓ _∞ ⁿ 's uniformly. The result is applied to describe the convergence in law of U-processes with sample paths in certain Banach function spaces. __________ Published in Lietuvos Matematikos Rinkinys, Vol. 45, No. 4, pp. 553–566, October–December, 2005.