A GENERALIZED BLOCK BOOTSTRAP FOR SEASONAL TIME SERIES

When time‐series data contain a periodic/seasonal component, the usual block bootstrap procedures are not directly applicable. We propose a modification of the block bootstrap – the generalized seasonal block bootstrap (GSBB) – and show its asymptotic consistency without undue restrictions on the relative size of the period and block size. Notably, it is exactly such restrictions that limit the applicability of other proposals of block bootstrap methods for time series with periodicities. The finite‐sample performance of the GSBB is also illustrated by means of a small simulation experiment.     

Grammatical Evolution for Features of Epileptic Oscillations in Clinical Intracranial Electroencephalograms

This paper presents grammatical evolution (GE) as an approach to select and combine features for detecting epileptic oscillations within clinical intracranial electroencephalogram (iEEG) recordings of patients with epilepsy. Clinical iEEG is used in preoperative evaluations of a patient who may have surgery to treat epileptic seizures. Literature suggests that pathological oscillations may indicate the region(s) of brain that cause epileptic seizures, which could be surgically removed for therapy. If this presumption is true, then the effectiveness of surgical treatment could depend on the effectiveness in pinpointing critically diseased brain, which in turn depends on the most accurate detection of pathological oscillations. Moreover, the accuracy of detecting pathological oscillations depends greatly on the selected feature(s) that must objectively distinguish epileptic events from average activity, a task that visual review is inevitably too subjective and insufficient to resolve. Consequently, this work suggests an automated algorithm that incorporates grammatical evolution (GE) to construct the most sufficient feature(s) to detect epileptic oscillations within the iEEG of a patient. We estimate the performance of GE relative to three alternative methods of selecting or combining features that distinguish an epileptic gamma (~65-95 Hz) oscillation from normal activity: forward sequential feature-selection, backward sequential feature-selection, and genetic programming. We demonstrate that a detector with a grammatically evolved feature exhibits a sensitivity and selectivity that is comparable to a previous detector with a genetically programmed feature, making GE a useful alternative to designing detectors.     

Pressure- and Temperature-Driven Flow Through Triangular and Trapezoidal Microchannels

A detailed study of pressure- and temperature-driven flows through long channels of triangular and trapezoidal cross sections is carried out. Due to the imposed pressure and temperature gradients there is a combined gas flow consisting of a thermal creep flow from the cold toward the hot reservoir and a Poiseuille flow from the high- toward the low-pressure reservoir. The formulation is based on the linearized Shakhov model subject to Maxwell boundary conditions, and it is solved numerically using a finite-difference scheme in the physical space and the discrete velocity method in the molecular velocity space. The results are valid in the whole range of the Knudsen number. In addition to the dimensionless flow rates, a methodology is presented to estimate for a certain set of input data the mass flow rates and the pressure distribution along the channel. Finally, special attention is given to the case of zero net mass flow and to the computation of the coefficient of the thermomolecular pressure difference.     

Industrial growth, economic integration and structural change: evidence from the EU new member-states regions

The article evaluates the pre-accession experience of new European Union member-states, coming from the former Eastern bloc, estimating an empirical model used to account for regional–industrial employment growth in the early transition period, 1991–2000. The results obtained indicate the adverse impact of the economic integration dynamics and detect the interplay among structural characteristics and geographical coordinates that determines the relative winners. The findings of the article have important implications for both theory and policy.     

Human Motion Planning Based on Recursive Dynamics and Optimal Control Techniques

This paper presents an efficient optimal control and recursive dynamics-based computer animation system for simulating and controlling themotion of articulated figures. A quasi-Newton nonlinear programmingtechnique (super-linear convergence) is implemented to solve minimumtorque-based human motion-planning problems. The explicit analyticalgradients needed in the dynamics are derived using a matrix exponentialformulation and Lie algebra. Cubic spline functions are used to make thesearch space for an optimal solution finite. Based on our formulations,our method is well conditioned and robust, in addition to beingcomputationally efficient. To better illustrate the efficiency of ourmethod, we present results of natural looking and physically correcthuman motions for a variety of human motion tasks involving open andclosed loop kinematic chains.     

A collision resolution algorithm for clump-free fast moving cloth

Cloth animation is an important area of computer graphics due to its numerous applications. However, so far a fast moving cloth with multiple wrinkles has been difficult to animate because of the cloth clump problem. Cloth clumps are the frozen areas where cloth pieces are clustered unnaturally — an obstacle in making a realistic cloth animation. Hence we present a novel cloth collision resolution algorithm that prevents clump formation during fast cloth motions. The goal of our resolution algorithm is to make cloth move swiftly without having any unnatural frozen cloth clumps, while preventing any cloth-cloth and rigid-cloth penetrations at any moment of a simulation. The non-penetration status of cloth is maintained without the formation of cloth clumps regardless of the speed of cloth motion. Our algorithm is based on a particular order that we found in the resolution of cloth collisions, and can be used with any structural modeling approaches such as spring-masses or finite elements. This paper includes several realistic simulation examples involving fast motions that are clump-free.     

Reverse nearest neighbors in large graphs

A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in Euclidean spaces, there is no previous work in the context of large graphs. In this paper, we provide a fundamental lemma, which can be used to prune the search space while traversing the graph in search for RNN. Based on it, we develop two RNN methods; an eager algorithm that attempts to prune network nodes as soon as they are visited and a lazy technique that prunes the search space when a data point is discovered. We study retrieval of an arbitrary number k of reverse nearest neighbors, investigate the benefits of materialization, cover several query types, and deal with cases where the queries and the data objects reside on nodes or edges of the graph. The proposed techniques are evaluated in various practical scenarios involving spatial maps, computer networks, and the DBLP coauthorship graph.     

Aerosol lidar intercomparison in the framework of the EARLINET project. 1. Instruments

In the framework of the European Aerosol Research Lidar Network to Establish an Aerosol Climatology (EARLINET), 19 aerosol lidar systems from 11 European countries were compared. Aerosol extinction or backscatter coefficient profiles were measured by at least two systems for each comparison. Aerosol extinction coefficients were derived from Raman lidar measurements in the UV (351 or 355 nm), and aerosol backscatter profiles were calculated from pure elastic backscatter measurements at 351 or 355, 532, or 1064 nm. The results were compared for height ranges with high and low aerosol content. Some systems were additionally compared with sunphotometers and starphotometers. Predefined maximum deviations were used for quality control of the results. Lidar systems with results outside those limits could not meet the quality assurance criterion. The algorithms for deriving aerosol backscatter profiles from elastic lidar measurements were tested separately, and the results are described in Part 2 of this series of papers [Appl. Opt. 43, 977-989 (2004)]. In the end, all systems were quality assured, although some had to be modified to improve their performance. Typical deviations between aerosol backscatter profiles were 10% in the planetary boundary layer and 0.1 x 10(-6) m(-1) sr(-1) in the free troposphere.     

Combining low-, high-level and empirical domain knowledge for automated segmentation of ultrasonic breast lesions

Breast cancer is the most frequently diagnosed malignancy and the second leading cause of mortality in women. In the last decade, ultrasound along with digital mammography has come to be regarded as the gold standard for breast cancer diagnosis. Automatically detecting tumors and extracting lesion boundaries in ultrasound images is difficult due to their specular nature and the variance in shape and appearance of sonographic lesions. Past work on automated ultrasonic breast lesion segmentation has not addressed important issues such as shadowing artifacts or dealing with similar tumor like structures in the sonogram. Algorithms that claim to automatically classify ultrasonic breast lesions, rely on manual delineation of the tumor boundaries. In this paper, we present a novel technique to automatically find lesion margins in ultrasound images, by combining intensity and texture with empirical domain specific knowledge along with directional gradient and a deformable shape-based model. The images are first filtered to remove speckle noise and then contrast enhanced to emphasize the tumor regions. For the first time, a mathematical formulation of the empirical rules used by radiologists in detecting ultrasonic breast lesions, popularly known as the "Stavros Criteria" is presented in this paper. We have applied this formulation to automatically determine a seed point within the image. Probabilistic classification of image pixels based on intensity and texture is followed by region growing using the automatically determined seed point to obtain an initial segmentation of the lesion. Boundary points are found on the directional gradient of the image. Outliers are removed by a process of recursive refinement. These boundary points are then supplied as an initial estimate to a deformable model. Incorporating empirical domain specific knowledge along with low and high-level knowledge makes it possible to avoid shadowing artifacts and lowers the chance of confusing similar tumor like structures for the lesion. The system was validated on a database of breast sonograms for 42 patients. The average mean boundary error between manual and automated segmentation was 6.6 pixels and the normalized true positive area overlap was 75.1%. The algorithm was found to be robust to 1) variations in system parameters, 2) number of training samples used, and 3) the position of the seed point within the tumor. Running time for segmenting a single sonogram was 18 s on a 1.8-GHz Pentium machine.