Inhibitors of cholesteryl ester transfer protein - a step forward in the treatment of coronary artery disease?

Although the LDL cholesterol-lowering statins have reduced the mortality and morbidity associated with coronary artery disease (CAD), considerable mortality and morbidity remains. Increasing HDL cholesterol levels is associated with reduced CAD mortality and morbidity. In healthy subjects with mild dyslipidemia, treatment with JTT-705 decreased cholesteryl ester transfer protein (CETP) activity, increased HDL cholesterol and decreased LDL cholesterol. Similarly, another CETP inhibitor, torcetrapib, has recently been shown to increase HDL cholesterol by 46%, decrease LDL cholesterol by 8% and have no effect on triglycerides in subjects with HDL cholesterol levels below 1.0 mmol/l. Increasing HDL cholesterol with inhibitors of CETP represents a new approach to dyslipidemia that requires further investigation, especially in patients with CAD.

Referral patterns in a global store-and-forward telemedicine system

We examined the nature of the referral patterns in the email telemedicine network operated by the Swinfen Charitable Trust with a view to informing long-term resource planning. Over the first six years of operation, 62 hospitals from 19 countries registered with the Trust in order to be able to refer cases for specialist advice; 55 of these hospitals (89%) actually referred cases during this period. During the first six years of operation, nearly 1000 referrals were submitted and answered, from a wide range of specialty areas. Between July 2002 and March 2005 the referral rate rose from 127 to 318 cases per year. The median length of time required to provide a specialist's response was 2.3 days during the first 12 months and 1.8 days during the last 12 months. Five hospitals submitted cases for more than four years (together sending a total of 493 cases). Their activity data showed a trend to declining referral rates over the four-year period, which may represent successful knowledge transfer. There is some evidence that over the last three years the growth in demand has been exponential, while the growth in resources available (i.e. specialists) has been linear, a situation which cannot continue for very long before demand outstrips supply.

Shift, scaling and derivative properties for the discrete cosine transform

A set of DCT domain properties for shifting and scaling by real amounts, and taking linear operations such as differentiation is described. The DCT coefficients of a sampled signal are subjected to a linear transform, which returns the DCT coefficients of the shifted, scaled and/or differentiated signal. The properties are derived by considering the inverse discrete transform as a cosine series expansion of the original continuous signal, assuming sampling in accordance with the Nyquist criterion. This approach can be applied in the signal domain, to give, for example, DCT based interpolation or derivatives. The same approach can be taken in decoding from the DCT to give, for example, derivatives in the signal domain. The techniques may prove useful in compressed domain processing applications, and are interesting because they allow operations from the continuous domain such as differentiation to be implemented in the discrete domain. An image matching algorithm illustrates the use of the properties, with improvements in computation time and matching quality.

The Australian insolvency regime revisited: a precis of the next leap forward

Australian corporate insolvency laws contained within Chapter 5 of the Corporations Act are currently being reviewed with respect to four principal areas identified by Australian Government Treasury. The four themes of review include employee ‘benefit’ enhancements; seeking to deter misconduct of company officers; rules around insolvency practitioner disclosure with respect to their remuneration and related independence issues; and some minor proposed changes to the voluntary administration procedure, widely regarded as requiring only minor adjustment. At this time, the draft legislation is not available for general release and is being discussed within the Australian Government appointed Insolvency Law Advisory Group. The next steps are public comment for review of draft legislation and then operation of the legislative change. These are expected to occur in 2007. This paper seeks to outline the likely issues associated with the expected reforms of the Australian insolvency regime.

Tracking the states of a nonlinear system in the weight-space of a feed-forward neural network

Nonlinear, non-stationary signals are commonly found in a variety of disciplines such as biology, medicine, geology and financial modeling. The complexity (e.g. nonlinearity and non-stationarity) of such signals and their low signal to noise ratios often make it a challenging task to use them in critical applications. In this paper we propose a new neural network based technique to address those problems. We show that a feed forward, multi-layered neural network can conveniently capture the states of a nonlinear system in its connection weight-space, after a process of supervised training. The performance of the proposed method is investigated via computer simulations.

Curvature-driven smoothing: a learning algorithm for feed-forward networks

The performance of feed-forward neural networks in real applications can be often be improved significantly if use is made of a-priori information. For interpolation problems this prior knowledge frequently includes smoothness requirements on the network mapping, and can be imposed by the addition to the error function of suitable regularization terms. The new error function, however, now depends on the derivatives of the network mapping, and so the standard back-propagation algorithm cannot be applied. In this paper, we derive a computationally efficient learning algorithm, for a feed-forward network of arbitrary topology, which can be used to minimize the new error function. Networks having a single hidden layer, for which the learning algorithm simplifies, are treated as a special case.

Regularization and complexity control in feed-forward networks

In this paper we consider four alternative approaches to complexity control in feed-forward networks based respectively on architecture selection, regularization, early stopping, and training with noise. We show that there are close similarities between these approaches and we argue that, for most practical applications, the technique of regularization should be the method of choice.

Topographic mappings and feed-forward neural networks

This thesis is a study of the generation of topographic mappings - dimension reducing transformations of data that preserve some element of geometric structure - with feed-forward neural networks. As an alternative to established methods, a transformational variant of Sammon's method is proposed, where the projection is effected by a radial basis function neural network. This approach is related to the statistical field of multidimensional scaling, and from that the concept of a 'subjective metric' is defined, which permits the exploitation of additional prior knowledge concerning the data in the mapping process. This then enables the generation of more appropriate feature spaces for the purposes of enhanced visualisation or subsequent classification. A comparison with established methods for feature extraction is given for data taken from the 1992 Research Assessment Exercise for higher educational institutions in the United Kingdom. This is a difficult high-dimensional dataset, and illustrates well the benefit of the new topographic technique. A generalisation of the proposed model is considered for implementation of the classical multidimensional scaling (¸mds}) routine. This is related to Oja's principal subspace neural network, whose learning rule is shown to descend the error surface of the proposed ¸mds model. Some of the technical issues concerning the design and training of topographic neural networks are investigated. It is shown that neural network models can be less sensitive to entrapment in the sub-optimal global minima that badly affect the standard Sammon algorithm, and tend to exhibit good generalisation as a result of implicit weight decay in the training process. It is further argued that for ideal structure retention, the network transformation should be perfectly smooth for all inter-data directions in input space. Finally, there is a critique of optimisation techniques for topographic mappings, and a new training algorithm is proposed. A convergence proof is given, and the method is shown to produce lower-error mappings more rapidly than previous algorithms.