Analysis of Extended Partial Least Squares for Monitoring Large-Scale Processes

This paper theoretically analysis the recently proposed "Extended Partial Least Squares" (EPLS) algorithm. After pointing out some conceptual deficiencies, a revised algorithm is introduced that covers the middle ground between Partial Least Squares and Principal Component Analysis. It maximises a covariance criterion between a cause and an effect variable set (partial least squares) and allows a complete reconstruction of the recorded data (principal component analysis). The new and conceptually simpler EPLS algorithm has successfully been applied in detecting and diagnosing various fault conditions, where the original EPLS algorithm did only offer fault detection.

A mixed cost-function adaptive algorithm for ADSL time-domain equalization

We propose a mixed cost-function adaptive initialization algorithm for the time domain equalizer in a discrete multitone (DMT)-based asymmetric digital subscriber line. Using our approach, a higher convergence rate than that of the commonly used least-mean square algorithm is obtained, whilst attaining bit rates close to the optimum maximum shortening SNR and the upper bound SNR. Furthermore, our proposed method outperforms the minimum mean-squared error design for a range of time domain equalizer (TEQ) filter lengths. The improved performance outweighs the small increase in computational complexity required. A block variant of our proposed algorithm is also presented to overcome the increased latency imposed on the feedback path of the adaptive system.

A hybrid mixed cost-function TEQ initialization algorithm for ADSL modems

In this paper, we present a hybrid mixed cost-function adaptive initialization algorithm for the time domain equalizer in a discrete multitone (DMT)-based asymmetric digital subscriber loop. Using our approach, a higher convergence rate than that of the commonly used least-mean square algorithm is obtained, whilst attaining bit rates close to the optimum maximum shortening SNR and the upper bound SNR. Moreover, our proposed method outperforms the minimum mean-squared error design for a range of TEQ filter lengths.

SuperWASP-North extrasolar planet candidates: candidates from fields 17h

We have performed photometric observations of nearly seven million stars with 8 <V <15 with the SuperWASP-North instrument from La Palma between 2004 May to September. Fields in the right ascension range 17-18h, yielding over 185000 stars with sufficient quality data, have been searched for transits using a modified box least-squares (BLS) algorithm. We find a total of 58 initial transiting candidates which have high signal-to-noise ratio in the BLS, show multiple transit-like dips and have passed visual inspection. Analysis of the blending and the inferred planetary radii for these candidates leave, a total of seven transiting planet candidates which pass all the tests plus four which pass the majority. We discuss the derived parameters for these candidates and their properties and comment on the implications for future transit searches.

Predatory fish loss affects the structure and functioning of a model marine food web

The rate of species loss is increasing on a global scale and predators are most at risk from human-induced extinction. The effects of losing predators are difficult to predict, even with experimental single species removals, because different combinations of species interact in unpredictable ways. We tested the effects of the loss of groups of common predators on herbivore and algal assemblages in a model benthic marine system. The predator groups were fish, shrimp and crabs. Each group was represented by at least two characteristic species based on data collected at local field sites. We examined the effects of the loss of predators while controlling for the loss of predator biomass. The identity, not the number of predator groups, affected herbivore abundance and assemblage structure. Removing fish led to a large increase in the abundance of dominant herbivores, such as Ampithoids and Caprellids. Predator identity also affected algal assemblage structure. It did not, however, affect total algal mass. Removing fish led to an increase in the final biomass of the least common taxa (red algae) and reduced the mass of the dominant taxa (brown algae). This compensatory shift in the algal assemblage appeared to facilitate the maintenance of a constant total algal biomass. In the absence of fish, shrimp at higher than ambient densities had a similar effect on herbivore abundance, showing that other groups could partially compensate for the loss of dominant predators. Crabs had no effect on herbivore or algal populations, possibly because they were not at carrying capacity in our experimental system. These findings show that contrary to the assumptions of many food web models, predators cannot be classified into a single functional group and their role in food webs depends on their identity and density in 'real' systems and carrying capacities.

The Oscillations of Tau Pegasi

We present extensive spectroscopic time series observations of the multiperiodic, rapidly rotating, delta Scuti star tau Pegasi. Information about the oscillations is contained within the patterns of line-profile variation of the star's blended absorption-line spectrum. We introduce the new technique of Doppler deconvolution with which to extract these patterns by modeling the intrinsic stellar spectrum and the broadening functions for each spectrum in the time series. Frequencies and modes of oscillation are identified from the variations using the technique of Fourier-Doppler imaging and a two-dimensional least-squares cleaning algorithm. We find a rich mode spectrum with degrees up to l = 20 and with frequencies below about 35 cycles day-1. Those modes with the largest amplitudes have frequencies that lie within a narrow band. We conclude that the observed spectrum can be explained if the modes of tau Peg propagate in the prograde direction with l ~= |m| and with frequencies that are about equal in the corotating frame of the star. We discuss the implications of these results for the prospect of delta Scuti seismology.

A fast hybrid algorithm for exoplanetary transit searches

We present a fast and efficient hybrid algorithm for selecting exoplanetary candidates from wide-field transit surveys. Our method is based on the widely used SysRem and Box Least-Squares (BLS) algorithms. Patterns of systematic error that are common to all stars on the frame are mapped and eliminated using the SysRem algorithm. The remaining systematic errors caused by spatially localized flat-fielding and other errors are quantified using a boxcar-smoothing method. We show that the dimensions of the search-parameter space can be reduced greatly by carrying out an initial BLS search on a coarse grid of reduced dimensions, followed by Newton-Raphson refinement of the transit parameters in the vicinity of the most significant solutions. We illustrate the method's operation by applying it to data from one field of the SuperWASP survey, comprising 2300 observations of 7840 stars brighter than V = 13.0. We identify 11 likely transit candidates. We reject stars that exhibit significant ellipsoidal variations caused indicative of a stellar-mass companion. We use colours and proper motions from the Two Micron All Sky Survey and USNO-B1.0 surveys to estimate the stellar parameters and the companion radius. We find that two stars showing unambiguous transit signals pass all these tests, and so qualify for detailed high-resolution spectroscopic follow-up.

Scheduling and Platforming Trains at Busy Complex Stations

We consider the problem of train planning or scheduling for large, busy, complex train stations, which are common in Europe and elsewhere, though not in North America. We develop the constraints and objectives for this problem, but these are too computationally complex to solve by standard combinatorial search or integer programming methods. Also, the problem is somewhat political in nature, that is, it does not have a clear objective function because it involves multiple train operators with conflicting interests. We therefore develop scheduling heuristics analogous to those successfully adopted by train planners using ''manual'' methods. We tested the model and algorithms by applying to a typical large station that exhibits most of the complexities found in practice. The results compare well with those found by traditional methods, and take account of cost and preference trade-offs not handled by those methods. With successive refinements, the algorithm eventually took only a few seconds to run, the time depending on the version of the algorithm and the scheduling problem. The scheduling models and algorithms developed and tested here can be used on their own, or as key components for a more general system for train scheduling for a rail line or network.Train scheduling for a busy station includes ensuring that there are no conflicts between several hundred trains per day going in and out of the station on intersecting paths from multiple in-lines and out-lines to multiple platforms, while ensuring that each train is allowed at least its minimum required headways, dwell time, turnaround time and trip time. This has to be done while minimizing (costs of) deviations from desired times, platforms or lines, allowing for conflicts due to through-platforms, dead-end platforms, multiple sub-platforms, and possible constraints due to infrastructure, safety or business policy.

Dynamic Job Scheduling on the Grid Environment using the Great Deluge Algorithm

The utilization of the computational Grid processor network has become a common method for researchers and scientists without access to local processor clusters to avail of the benefits of parallel processing for compute-intensive applications. As a result, this demand requires effective and efficient dynamic allocation of available resources. Although static scheduling and allocation techniques have proved effective, the dynamic nature of the Grid requires innovative techniques for reacting to change and maintaining stability for users. The dynamic scheduling process requires quite powerful optimization techniques, which can themselves lack the performance required in reaction time for achieving an effective schedule solution. Often there is a trade-off between solution quality and speed in achieving a solution. This paper presents an extension of a technique used in optimization and scheduling which can provide the means of achieving this balance and improves on similar approaches currently published.

Efficient computation algorithm for calculating load contributions to line flows and losses

In a deregulated power system, it is usually required to determine the shares of each load and generation in line flows, to permit fair allocation of transmission costs between the interested parties. The paper presents a new method of determining the contributions of each load to line flows and losses. The method is based on power-flow topology and has the advantage of being the least computationally demanding of similar methods.

Convergence and tracking analysis of a variable normalised LMF (XE-NLMF) algorithm

The least-mean-fourth (LMF) algorithm is known for its fast convergence and lower steady state error, especially in sub-Gaussian noise environments. Recent work on normalised versions of the LMF algorithm has further enhanced its stability and performance in both Gaussian and sub-Gaussian noise environments. For example, the recently developed normalised LMF (XE-NLMF) algorithm is normalised by the mixed signal and error powers, and weighted by a fixed mixed-power parameter. Unfortunately, this algorithm depends on the selection of this mixing parameter. In this work, a time-varying mixed-power parameter technique is introduced to overcome this dependency. A convergence analysis, transient analysis, and steady-state behaviour of the proposed algorithm are derived and verified through simulations. An enhancement in performance is obtained through the use of this technique in two different scenarios. Moreover, the tracking analysis of the proposed algorithm is carried out in the presence of two sources of nonstationarities: (1) carrier frequency offset between transmitter and receiver and (2) random variations in the environment. Close agreement between analysis and simulation results is obtained. The results show that, unlike in the stationary case, the steady-state excess mean-square error is not a monotonically increasing function of the step size. (c) 2007 Elsevier B.V. All rights reserved.

Talking about colds and flu: The lay diagnosis of two common illnesses among older British people

This paper reports on a study of the ways in which 54 older people in South Wales (UK) talk about the symptoms and causes of cold and influenza (flu). The study was designed to understand why older people might reject or accept the offer of seasonal flu vaccine, and in the course of the interviews respondents were also asked to express their views about the nature and causes of the two key illnesses. The latter are among the most common infections in human beings. In terms of the biomedical paradigm the common cold is caused by numerous respiratory viruses, whilst flu is caused by the influenza virus. Medical diagnosis is usually made on clinical grounds without laboratory confirmation. Symptoms of flu include sudden onset of fever and cough, and colds are characterized by sneezing, sore throat, and runny nose, but in practice the symptoms often overlap. In this study we examine the degree by which the views of lay people with respect to both diagnosis and epidemiology diverge with that which is evident in biomedical discourse. Our results indicate that whilst most of the identified symptoms are common to lay and professional people, the former integrate symptoms into a markedly different observational frame from the latter. And as far as causation is concerned it is clear that lay people emphasize the role of 'resistance' and 'immunity' at least as much as 'infection' in accounting for the onset of colds and flu. The data are analyzed using novel methods that focus on the co-occurrence of concepts and are displayed as semantic networks. As well as reporting on its findings the authors draw out some implications of the study for social scientific and policy discussions concerning lay diagnosis, lay expertise and the concept of an expert patient.

The effect of pesticides on Byssus formation in the common mussel, Mytilus edulis

Seed mussels (Mytilus edulis) were exposed to a range of pesticides and PCBs, several of which caused a reduction in byssal attachment at higher concentrations. In queen scallops (Chlamys opercularis) byssus formation was similarly affected although this species was more sensitive than M. edulis. The sensitivity of mussels was greater at higher temperatures and decreased with increase in size. Of the compounds tested Endosulfan (organochlorine) was the most toxic, causing a 50% reduction in byssal attachment after 24 h at 0•45 mg/l. Trichlorphon (organophosphate) was the least toxic and did not affect byssal attachment at concentrations up to 30 mg/l. The probable cause of decreased byssal attachment is a reduction in pedal activity, although it is possible that direct interference with the synthesis or combination of byssus components may be involved. It is suggested that byssogenesis tests offer a rapid and convenient technique for the routine screening of potential marine pollutants.