Application of effective medium approximation theory to ocean remote sensing under wave breaking

Based on the effective medium approximation theory of composites, the empirical model proposed by Pandey and Kakar is remedied to investigate the microwave emissivity of sea surface under wave breaking driven by strong wind. In the improved model, the effects of seawater bubbles, droplets and difference in temperature of air and sea interface (DTAS) on the emissivity of sea surface covered by whitecaps are discussed. The model results indicate that the effective emissivity of sea surface increases with DTAS increasing, and the impacts of bubble structures and thickness of whitecaps layer on the emissivity are included in the model by introducing the effective dielectric constant of whitecaps layer. Moreover, a good agreement is obtained by comparing the model results with the Rose's experimental data.

On the evaluation of diffusivities in gels using the diffusion cell technique

Modeling of the gel-immobilized cell system requires accurate measurement of diffusion coefficients. Three methods of the quasi-steady-state (QSS) method, the time-lag (TL) method and a variant quasi-steady-state (VQSS) method were critically assessed and compared for the evaluation of diffusivities using the diffusion cell technique. Experimental data from our laboratory were used for the analysis of the influence of crucial theoretical assumptions not being fulfilled in each method. The results highlighted a risk in obtaining highly variable diffusion coefficients by not validating the QSS and the accuracy of the measurements. In the TL method, the estimation of diffusivities based on the plot intercept that was mostly used in the literature, results in a many fold lower value when compared to that based on the plot slope. The comparison with the QSS and VQSS methods confirmed similar diffusivity obtained by the TL method based on the plot slope. It thus suggested that the correct estimation of diffusivities by the TL method could be based on the plot slope only. Furthermore, the errors associated with the solute mass in the gel, the sample withdrawal and the non-negligible concentration changes in the chambers were also discussed. It is concluded that diffusion cell technique has to be employed cautiously for a correct evaluation of diffusivities. (C) 2001 Elsevier Science B.V. All rights reserved.

Extensions of a Theory of Networks for Approximation and Learning: Outliers and Negative Examples

Learning an input-output mapping from a set of examples can be regarded as synthesizing an approximation of a multi-dimensional function. From this point of view, this form of learning is closely related to regularization theory. In this note, we extend the theory by introducing ways of dealing with two aspects of learning: learning in the presence of unreliable examples and learning from positive and negative examples. The first extension corresponds to dealing with outliers among the sparse data. The second one corresponds to exploiting information about points or regions in the range of the function that are forbidden.

A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees

We present a constant-factor approximation algorithm for computing an embedding of the shortest path metric of an unweighted graph into a tree, that minimizes the multiplicative distortion.

Approximation-based feature selection and application for algae population estimation

Q. Shen and R. Jensen, 'Approximation-based feature selection and application for algae population estimation,' Applied Intelligence, vol. 28, no. 2, pp. 167-181, 2008. Sponsorship: EPSRC RONO: EP/E058388/1

A stochastic approximation algorithm with step size adaptation

Plakhov, A.Y.; Cruz, P., (2004) 'A stochastic approximation algorithm with step size adaptation', Journal of Mathematical Science 120(1) pp.964-973 RAE2008

Formation of channels for fast-ion diffusion in alkali silicate melts: A quasielastic neutron scattering study

Kargl, Florian; Meyer, A.; Koza, M.M.; Schober, H., (2006) 'Formation of channels for fast-ion diffusion in alkali silicate melts: A quasielastic neutron scattering study', Physical Review B: Condensed Matter and Materials Physics 74 pp.14304 RAE2008

Inelastic neutron scattering on sodium aluminosilicate melts: sodium diffusion and intermediate range order

Kargl, Florian; Meyer, A., (2004) 'Inelastic neutron scattering on sodium aluminosilicate melts: sodium diffusion and intermediate range order', Chemical Geology 213(1-3) pp.165-172 RAE2008

Li+ Diffusion and its Structural Basis in the Nanocrystalline and Amorphous Forms of Two-dimensionally Ion-conducting LixTiS2

Winter, Rudolf; Heitjans, P., (2001) 'Li+ Diffusion and its Structural Basis in the Nanocrystalline and Amorphous Forms of Two-dimensionally Ion-conducting LixTiS2', Journal of Physical Chemistry B 105(26) pp.6108-6115 RAE2008

Molecular dynamics-based approach to study the anisotropic self-diffusion of molecules in porous materials with multiple cage types: Application to H-2 in losod

Van den Berg, A. W. C., Flikkema, E., Lems, S., Bromley, S. T., Jansen, J. C. (2006). Molecular dynamics-based approach to study the anisotropic self-diffusion of molecules in porous materials with multiple cage types: Application to H-2 in losod. Journal of physical chemistry b, 110 (1), 501-506. RAE2008

On the Performance of Polynomial-time CLIQUE Approximation Algorithms on Very Large Graphs

The performance of a randomized version of the subgraph-exclusion algorithm (called Ramsey) for CLIQUE by Boppana and Halldorsson is studied on very large graphs. We compare the performance of this algorithm with the performance of two common heuristic algorithms, the greedy heuristic and a version of simulated annealing. These algorithms are tested on graphs with up to 10,000 vertices on a workstation and graphs as large as 70,000 vertices on a Connection Machine. Our implementations establish the ability to run clique approximation algorithms on very large graphs. We test our implementations on a variety of different graphs. Our conclusions indicate that on randomly generated graphs minor changes to the distribution can cause dramatic changes in the performance of the heuristic algorithms. The Ramsey algorithm, while not as good as the others for the most common distributions, seems more robust and provides a more even overall performance. In general, and especially on deterministically generated graphs, a combination of simulated annealing with either the Ramsey algorithm or the greedy heuristic seems to perform best. This combined algorithm works particularly well on large Keller and Hamming graphs and has a competitive overall performance on the DIMACS benchmark graphs.

Amorphous Placement and Informed Diffusion for Timely Monitoring by Autonomous, Resource-Constrained, Mobile Sensors

Personal communication devices are increasingly equipped with sensors for passive monitoring of encounters and surroundings. We envision the emergence of services that enable a community of mobile users carrying such resource-limited devices to query such information at remote locations in the field in which they collectively roam. One approach to implement such a service is directed placement and retrieval (DPR), whereby readings/queries about a specific location are routed to a node responsible for that location. In a mobile, potentially sparse setting, where end-to-end paths are unavailable, DPR is not an attractive solution as it would require the use of delay-tolerant (flooding-based store-carry-forward) routing of both readings and queries, which is inappropriate for applications with data freshness constraints, and which is incompatible with stringent device power/memory constraints. Alternatively, we propose the use of amorphous placement and retrieval (APR), in which routing and field monitoring are integrated through the use of a cache management scheme coupled with an informed exchange of cached samples to diffuse sensory data throughout the network, in such a way that a query answer is likely to be found close to the query origin. We argue that knowledge of the distribution of query targets could be used effectively by an informed cache management policy to maximize the utility of collective storage of all devices. Using a simple analytical model, we show that the use of informed cache management is particularly important when the mobility model results in a non-uniform distribution of users over the field. We present results from extensive simulations which show that in sparsely-connected networks, APR is more cost-effective than DPR, that it provides extra resilience to node failure and packet losses, and that its use of informed cache management yields superior performance.

Estimating stochastic volatility diffusion using conditional moments of integrated volatility

We exploit the distributional information contained in high-frequency intraday data in constructing a simple conditional moment estimator for stochastic volatility diffusions. The estimator is based on the analytical solutions of the first two conditional moments for the latent integrated volatility, the realization of which is effectively approximated by the sum of the squared high-frequency increments of the process. Our simulation evidence indicates that the resulting GMM estimator is highly reliable and accurate. Our empirical implementation based on high-frequency five-minute foreign exchange returns suggests the presence of multiple latent stochastic volatility factors and possible jumps. © 2002 Elsevier Science B.V. All rights reserved.