Reflections on the evolution of implicit Navier–Stokes algorithms

This article gives a historical perspective on the evolution of implicit algorithms for the Navier–Stokes equations that utilize time or Newton linearizations and various forms of approximate factorization including alternating-direction, lower/upper, and symmetric relaxation schemes. A theme of the paper is how progress in implicit Navier–Stokes algorithms has been influenced and enabled by the introduction of characteristic-based upwind approximations, unstructured-grid discretizations, parallelization, and by advances in computer performance and architecture. Historical examples of runtime, problem size, and estimated cost are given for actual and hypothetical Navier–Stokes flow cases from the past 40 years.     

Good programming in transactional memory : Game theory meets multicore architecture

In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a thread provokes the better for the system. However, as a programmer is primarily interested in optimizing her individual code’s performance rather than the system’s overall performance, she does not have a natural incentive to provoke as little interference as possible. Hence, a TM system must be designed compatible with good programming incentives (GPI), i.e., writing efficient code for the overall system should coincide with writing code that optimizes an individual thread’s performance. We show that with most contention managers (CM) proposed in the literature so far, TM systems are not GPI compatible. We provide a generic framework for CMs that base their decisions on priorities and explain how to modify Timestamp-like CMs so as to feature GPI compatibility. In general, however, priority-based conflict resolution policies are prone to be exploited by selfish programmers. In contrast, a simple non-priority-based manager that resolves conflicts at random is GPI compatible.     

Dynamic Network User Equilibrium with State-Dependent Time Lags

This paper recasts the Friesz et al. (1993) measure theoretic model of dynamic network user equibrium as a controlled variational inequality problem involving Riemann integrals. This restatement is done to make the model and its foundations accessible to a wider audience by removing the need to have a background in functional analysis. Our exposition is dependent on previously unavailable necessary conditions for optimal control problems with state-dependent time lags. These necessary conditions, derived in an Appendix, are employed to show that a particular variational inequality control problem has solutions that are dynamic network user equilibria. Our analysis also shows that use of proper flow propagation constraints obviates the need to explicitly employ the arc exit time functions that have complicated numerical implementations of the Friesz et al. (1993) model heretofore. We close by describing the computational implications of numerically determining dynamic user equilibria from formulations based on state-dependent time lags.     

Digital Butterworth filter for subtracting noise from low magnitude surface electromyogram

This work presents a digital filter designed to delimitate the frequency band of surface electromyograms (EMG) and remove the mains noise and its harmonics, focusing the signal analysis during reduced muscle activity. A Butterworth filter was designed as the frequency-domain product of a second order, high-pass filter with cutoff frequency 10 Hz, an eighth order low-pass filter, with cutoff at 400 Hz and six stop-band filters, second order, centered at the 60 Hz mains noise and its harmonics until 360 Hz. The resulting filter was applied in both direct and reverse directions of the signals to avoid phase distortions. The performance was evaluated with a simulated EMG signal with additive noise in multiples of 60 Hz. A qualitative assessment was made with real EMG data, acquired from 16 subjects, with age from 20 to 32 years. Subjects were positioned in orthostatic position during 21s, being only the last second analyzed to assure stationarity. EMG were collected by Ag/AgCl electrodes on right lateral gastrocnemius, amplified with gain 5000, filtered in the band from 10 Hz to 1 kHz, and thus digitized with 2ksamples/s. The filter effectively removed the mains noise components, with attenuations greater than 96.6%. The attenuation of the simulated signal at frequencies below 15 Hz and at 60 Hz caused only a small reduction of total power, preserving the original spectrum. Thus, the filter resulted suitable to the proposed application.     

Agent-based multimedia presentation and adaptation service

In this paper, we aim to provide adaptive multimedia services especially video ones to end-users in an efficient and secure manner. Users moving outside the office should be able to maintain an office-like environment at their current locations. First, the agents within our proposed architecture negotiate the different communication and interaction factors autonomously and dynamically. Moreover, we needed to develop a user agent in addition to service and system agents that could negotiate the requirements and capabilities at run time to furnish best possible service results. Thus we designed and integrated a video indexing and key framing service within our overall agent-based architecture. We integrated this video indexing and content-based analysis service to adapt the video content according to run time conditions. We designed a video XML schema to validate the media content out of this multimedia service according to specific requirements and features, as we will describe later.

Distance preserving flattening of surface sections

Curved cross-sections extracted from medical volume images are useful for analyzing nonplanar anatomic structures such as the aorta arch or the pelvis. For visualization and for performing distance measurements, extracted surface sections need to be adequately flattened. We present two different distance preserving surface flattening methods which preserve distances according to a user-specified center of interest and according to user-specified orientations. The first method flattens surface sections by preserving distances along surface curves located within planes having a user specified constant orientation. The second method flattens surfaces along curves located within radial planes crossing the center of interest. We study and compare the properties of the two flattening methods by analyzing their distortion maps. Thanks to a multiresolution approach, we provide surface flattening at interactive rates, allowing users to displace their focus point while visualizing the resulting flattened surface. These distance preserving flattening methods provide new means of inspecting curved cross-sections extracted from medical images.     

Flexible Image-Based Photometric Reconstruction using Virtual Light Sources

Photometric reconstruction is the process of estimating the illumination and surface reflectance properties of an environment, given a geometric model of the scene and a set of photographs of its surfaces. For mixed-reality applications, such data is required if synthetic objects are to be correctly illuminated or if synthetic light sources are to be used to re-light the scene. Current methods of estimating such data are limited in the practical situations in which they can be applied, due to the fact that the geometric and radiometric models of the scene which are provided by the user must be complete, and that the position (and in some cases, intensity) of the light sources must also be specified a-priori. In this paper, a novel algorithm is presented which overcomes these constraints, and allows photometric data to be reconstructed in less restricted situations. This is achieved through the use of virtual light sources which mimic the effect of direct illumination from unknown luminaires, and indirect illumination reflected off unknown geometry. The intensity of these virtual light sources and the surface material properties are estimated using an iterative algorithm which attempts to match calculated radiance values to those observed in photographs. Results are presented for both synthetic and real scenes that show the quality of the reconstructed data and its use in off-line mixed-reality applications.     

Psychology for the public: A content analysis of Psychology Today..

Surveyed the extent to which Psychology Today (PT) has maintained an empirical basis for its articles and the degree to which psychologists and individuals with doctorates have been responsible for PT articles. Two samples of PT were selected for review by 2 raters (the present authors). Findings indicate that not only have PT articles significantly shifted away from a presentation of empirically based data, but the proportion of articles authored by psychologists, as well as the educational level of authors, has declined, particularly in the last 3 yrs. (4 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Bicriterion cluster analysis

Cluster analysis is concerned with the problem of partitioning a given set of entities into homogeneous and well-separated subsets called clusters. The concepts of homogeneity and of separation can be made precise when a measure of dissimilarity between the entities is given. Let us define the diameter of a partition of the given set of entities into clusters as the maximum dissimilarity between any pair of entities in the same cluster and the split of a partition as the minimum dissimilarity between entities in different clusters. The problems of determining a partition into a given number of clusters with minimum diameter (i.e., a partition of maximum homogeneity) or with maximum split (i.e., a partition of maximum separation) are first considered. It is shown that the latter problem can be solved by the classical single-link clustering algorithm, while the former can be solved by a graph-theoretic algorithm involving the optimal coloration of a sequence of partial graphs, described in more detail in a previous paper. A partition into a given number of clusters will be called efficient if and only if there exists no partition into at most the same number of clusters with smaller diameter and not smaller split or with larger split and not larger diameter. Two efficient partitions are called equivalent if and only if they have the same values for the split and for the diameter.     

Development and Analytical Verification of an Integrated 2-D Surface Water—Groundwater Model

DIVAST is a two-dimensional hydrodynamic and water quality numerical model developed for estuarine and coastal modelling. The original model enables the simulation of problems such as pollution and flooding in surface waters. In this paper the existing model is extended to allow the modelling of 2-D groundwater as well as surface water in the same model, using an integrated approach rather than two disparate models. The changes to the original model are summarised and the method of implementation is outlined. The new extended model (DIVAST-SG) is then tested against an analytical solution to verify that the model solves the equations correctly. The model is shown to predict the analytical solution for two different scenarios to within approximately 1 % of the height of flood wave.