Meeting the Software Challenge: A Model for is Transformation

As economic and technological trends create spiraling demand for software resources, IS managers must increasingly weigh the risks of new technology against the costs of falling behind. in this environment, successful management of the IS organization depends less on the transfer of technological implements than on adopting the characteristics of a learning organization: a mature process, a culture supportive of continuous change, and effective management.     

Spectral preconditioning of Krylov spaces: Combining PLS and PC regression

In regularized regression the vectors that lie in Krylov and eigen subspaces, formed in PLS and PC regressions respectively, provide useful low dimensional approximations for the LS regression coefficient vector. By preconditioning the LS normal equations we provide a framework in which to combine these methods, and so exploit both of their respective advantages. The link between the proposed method to orthogonal signal correction and to cyclic subspace regression is made. The performance of the proposed solution in reducing the dimension of the regression problem, and the shrinkage properties of the resulting coefficient vector, are both examined.     

A novel subspace identification approach with enforced causal models

Subspace identification methods (SIMs) for estimating state-space models have been proven to be very useful and numerically efficient. They exist in several variants, but all have one feature in common: as a first step, a collection of high-order ARX models are estimated from vectorized input–output data. In order not to obtain biased estimates, this step must include future outputs. However, all but one of the submodels include non-causal input terms. The coefficients of them will be correctly estimated to zero as more data become available. They still include extra model parameters which give unnecessarily high variance, and also cause bias for closed-loop data. In this paper, a new model formulation is suggested that circumvents the problem. Within the framework, the system matrices (A,B,C,D) and Markov parameters can be estimated separately. It is demonstrated through analysis that the new methods generally give smaller variance in the estimate of the observability matrix and it is supported by simulation studies that this gives lower variance also of the system invariants such as the poles.     

An advanced evenly-spaced streamline placement algorithm

This paper presents an advanced evenly-spaced streamline placement algorithm for fast, high-quality, and robust layout of flow lines. A fourth-order Runge-Kutta integrator with adaptive step size and error control is employed for rapid accurate streamline advection. Cubic Hermite polynomial interpolation with large sample-spacing is adopted to create fewer evenly-spaced samples along each streamline to reduce the amount of distance checking. We propose two methods to enhance placement quality. Double queues are used to prioritize topological seeding and to favor long streamlines to minimize discontinuities. Adaptive distance control based on the local flow variance is explored to reduce cavities. Furthermore, we propose a universal, effective, fast, and robust loop detection strategy to address closed and spiraling streamlines. Our algorithm is an order-of-magnitude faster than Jobard and Lefer's algorithm with better placement quality and over 5 times faster than Mebarki et al.'s algorithm with comparable placement quality, but with a more robust solution to loop detection.     

Determining the number of principal components for best reconstruction

A well-defined variance of reconstruction error (VRE) is proposed to determine the number of principal components in a PCA model for best reconstruction. Unlike most other methods in the literature, this proposed VRE method has a guaranteed minimum over the number of PC's corresponding to the best reconstruction. Therefore, it avoids the arbitrariness of other methods with monotonic indices. The VRE can also be used to remove variables that are little correlated with others and cannot be reliably reconstructed from the correlation-based PCA model. The effectiveness of this method is demonstrated with a simulated process.     

Discriminating between disturbance and process model mismatch in model predictive control

A novel method for discriminating faults in model predictive control is presented. The proposed method monitors the Kalman filter innovations to detect the presence of autocorrelation, which is an indication of suboptimal state estimation. The cause of the suboptimal state estimation is diagnosed by the observability of this innovations process. This task involves determining the order of the autocorrelation present in the innovations. The proposed MPC fault discrimination method is demonstrated on a SISO process and a MIMO process.     

New statistical methods for investigating submarine pockmarks

We investigate the applicability of some novel spatial analysis techniques, developed for studies of astrophysical datasets, to the analysis of spatial point data in sedimentary basins. The techniques are evaluated and compared with standard methods using two test areas that contain large numbers of submarine pockmarks developed in distributed arrays. The familiar Ripley K and Voronoi tesselation techniques are used, and the results are then compared with those obtained using more novel techniques, the correlation length and minimal spanning tree. The correlation length technique is found to identify the precise distances at which clustering occurs more accurately, making a physical interpretation more clear than is possible using the Ripley K. The minimal spanning tree is found to be powerful at identifying the space-filling nature of the pockmark distribution, and has the advantage of being immune to edge effects. The use of these two novel techniques permits more information to be extracted from the datasets, and demonstrates clear statistically significant differences between them, which are not detectable using standard techniques.     

Real time video frames allocation in mobile networks using cooperative pre-fetching

In this paper, we study the bandwidth allocation problem for serving video requests in a mobile real-time video player system. One of the main issues to maintain the quality of services (QoS) in mobile video playback is to ensure sufficient number of video frames available at the client side while a video is being played. However, due to the limited bandwidth of a mobile network and variable workload streaming video, this is not easy to achieve in practice. In addition, the communication link between mobile clients and a video server is subject to frequent errors and temporary disconnection. In this paper, we propose to use the notion of buffered bandwidth in addition to the network bandwidth to support real-time playback of videos at mobile clients. Based on this, we designed a bandwidth allocation scheme called Cooperative Pre-Fetching (CP) in which the amount of bandwidth to be allocated to serve a video request depends on the current buffer level of the video at the client relative to the target buffer level of the client. In determining the target buffer level, we consider the errors in communication to the client as well as the other clients who are concurrently served by the system. The buffered video frames at the clients are then used to minimize the impact of error in communications on the overall QoS of video playbacks in the whole system.