Nano and micro structural studies of thin films of ZnO

Zinc oxide thin films grown by sol–gel and RF sputtering methods have been characterized. The characterization techniques used involve ellipsometry, optical absorption, scanning tunneling microscopy, scanning and transmission electron microscopy. The films grown by sol–gel spin method which followed zinc acetate route exhibited a smoother texture than the films, which were deposited by using zinc nitrate route. The later type of films showed a dendritic character. Nano-structured fine grains of size ranging from 20 to 60 nm were observed with zinc nitrate precursor film. Individual grains show a sharp contrast with different facets and boundaries. Crystal planes and lattice parameters calculated by electron diffraction and X-ray diffraction are quite close and in agreement with the reported values in literature. Scanning tunneling microscopy has been used for measuring the average roughness of the surface and estimating the lattice constants. The STM studies of RF sputtered films, although showing a ZnO structure, exhibited a disturbed lattice. This was presumably due to the fact that after deposition the films were not annealed. Nanographs of 2D and 3D view of atomic positions of ZnO have been presented by using scanning tunneling microscopy.     

Efficient approximation of correlated sums on data streams

In many applications such as IP network management, data arrives in streams and queries over those streams need to be processed online using limited storage. Correlated-sum (CS) aggregates are a natural class of queries formed by composing basic aggregates on (x, y) pairs and are of the form SUM{g(y) : x /spl les/ f(AGG(x))}, where AGG(x) can be any basic aggregate and f(), g() are user-specified functions. CS-aggregates cannot be computed exactly in one pass through a data stream using limited storage; hence, we study the problem of computing approximate CS-aggregates. We guarantee a priori error bounds when AGG(x) can be computed in limited space (e.g., MIN, MAX, AVG), using two variants of Greenwald and Khanna's summary structure for the approximate computation of quantiles. Using real data sets, we experimentally demonstrate that an adaptation of the quantile summary structure uses much less space, and is significantly faster, than a more direct use of the quantile summary structure, for the same a posteriori error bounds. Finally, we prove that, when AGG(x) is a quantile (which cannot be computed over a data stream in limited space), the error of a CS-aggregate can be arbitrarily large.     

On Advances in Statistical Modeling of Natural Images

Statistical analysis of images reveals two interesting properties: (i) invariance of image statistics to scaling of images, and (ii) non-Gaussian behavior of image statistics, i.e. high kurtosis, heavy tails, and sharp central cusps. In this paper we review some recent results in statistical modeling of natural images that attempt to explain these patterns. Two categories of results are considered: (i) studies of probability models of images or image decompositions (such as Fourier or wavelet decompositions), and (ii) discoveries of underlying image manifolds while restricting to natural images. Applications of these models in areas such as texture analysis, image classification, compression, and denoising are also considered.     

Hilbert-Schmidt lower bounds for estimators on matrix lie groupsfor ATR

Deformable template representations of observed imagery model the variability of target pose via the actions of the matrix Lie groups on rigid templates. In this paper, we study the construction of minimum mean squared error estimators on the special orthogonal group, SO(n), for pose estimation. Due to the nonflat geometry of SO(n), the standard Bayesian formulation of optimal estimators and their characteristics requires modifications. By utilizing Hilbert-Schmidt metric defined on GL(n), a larger group containing SO(n), a mean squared criterion is defined on SO(n). The Hilbert-Schmidt estimate (HSE) is defined to be a minimum mean squared error estimator, restricted to SO(n). The expected error associated with the HSE is shown to be a lower bound, called the Hilbert-Schmidt bound (HSB), on the error incurred by any other estimator. Analysis and algorithms are presented for evaluating the HSE and the HSB in cases of both ground-based and airborne targets     

Design and analysis of a video-on-demand server

The availability of high-speed networks, fast computers and improved storage technology is stimulating interest in the development of video on-demand services that provide facilities similar to a video cassette player (VCP). In this paper, we present a design of a video-on-demand (VOD) server, capable of supporting a large number of video requests with complete functionality of a remote control (as used in VCPs), for each request. In the proposed design, we have used an interleaved storage method with constrained allocation of video and audio blocks on the disk to provide continuous retrieval. Our storage scheme interleaves a movie with itself (while satisfying the constraints on video and audio block allocation. This approach minimizes the starting delay and the buffer requirement at the user end, while ensuring a jitter-free display for every request. In order to minimize the starting delay and to support more non-concurrent requests, we have proposed the use of multiple disks for the same movie. Since a disk needs to hold only one movie, an array of inexpensive disks can be used, which reduces the overall cost of the proposed system. A scheme supported by our disk storage method to provide all the functions of a remote control such as “fast-forwarding”, “rewinding” (with play “on” or “off”), “pause” and “play” has also been discussed. This scheme handles a user request independent of others and satisfies it without degrading the quality of service to other users. The server design presented in this paper achieves the multiple goals of high disk utilization, global buffer optimization, cost-effectiveness and high-quality service to the users.     

On fuzzy sobriety

This paper mainly shows that sober fuzzy topological spaces form the epireflective hull of the fuzzy Sierpinski space in the category of T₀-fuzzy topological spaces.     

A method for using legacy data for metamodel-based design of large-scale systems

Despite a steady increase in computing power, the complexity of engineering analyses seems to advance at the same rate. Traditional parametric design analysis is inadequate for the analysis of large-scale engineering systems because of its computational inefficiency; therefore, a departure from the traditional parametric design approach is required. In addition, the existence of legacy data for complex, large-scale systems is commonplace. Approximation techniques may be applied to build computationally inexpensive surrogate models for large-scale systems to replace expensive-to-run computer analysis codes or to develop a model for a set of nonuniform legacy data. Response-surface models are frequently utilized to construct surrogate approximations; however, they may be inefficient for systems having with a large number of design variables. Kriging, an alternative method for creating surrogate models, is applied in this work to construct approximations of legacy data for a large-scale system. Comparisons between response surfaces and kriging are made using the legacy data from the High Speed Civil Transport (HSCT) approximation challenge. Since the analysis points already exist, a modified design-of-experiments technique is needed to select the appropriate sample points. In this paper, a method to handle this problem is presented, and the results are compared against previous work.     

Irregular, unknown light sources in dynamic global illumination

The goal in global illumination solutions for dynamic environments is to update a scene based on past scenes. For this difficult problem, current state of the art solutions are either not applicable, or unduly complex, when there are large changes in the illumination of unbounded number of objects. Such changes may be caused by the appearance of unexpected (at modeling time), irregular light sources.

We define a subset of dynamic environments in which new light sources may be user introduced, and implement solutions that complement existing schemes.     

Surface behaviour of as-Cast Al–Fe intermetallic composites

In order to produce energy-efficient material for tribological applications, Al–Fe inter-metallic composites have been produced by liquid metallurgy route. Iron content of the composites varies from 1.67 to 11.2 wt.%. These composites have been tested for their wear properties at different parameters. Debris and wear tracks have been studied in detail to see the surface effects during dry sliding and have been correlated to wear properties. Observations show that low loads and sliding velocities are dominated by oxidative debris and largely covered wear track surface with smooth oxide layer is observed. Whereas metallic debris dominates at higher loads and sliding velocities and highly deformed wear track surface with deep grooves and gross delamination were observed. Further, wear rate is seen to increase continuously with load whereas with sliding velocity it attains a minima after initial decrease and then increases continuously. Low solubility of iron supports the formation of FeAl₃ and an increase in hardness from 95 to 179 VHN continuously improves the wear resistance with increase in percentage iron.