Effect of film thickness on hydrogen content in a-Si : H

The hydrogen content, its depth distribution, and its bonding configuration have been studied in hydrogenated amorphous silicon prepared by plasma-enhanced chemical vapor deposition with hydrogen-diluted silane. Nuclear reaction analysis and infrared spectroscopy were used to determine the total amount of hydrogen and its bonded component, respectively. It has been established that the total concentration of hydrogen does not depend on the film thickness, and has a uniform depth profile. The concentration of bonded hydrogen changes with the film thickness within the measurement accuracy. The data obtained suggest the presence of molecular (non-bonded) hydrogen, uniformly distributed in concentration across the film thickness.     

A streamlined approximation and duality scheme for structural optimization

An efficient and commonly used approach to structural optimization is to solve a sequence of approximate design problems that are constructed iteratively. As is well-known, a major part of the computational burden of this scheme lies in the sensitivity analysis needed to state the approximate problems. We propose a possibility for reducing this burden by streamlining the calculations in a combined approximation and duality scheme for structural optimization. The difference between this scheme and the traditional one is that, instead of calculating all the constraint gradients to state an approximate design problem explicitly, linear combinations of these gradients are generated as they are needed during the solution of the approximate problem by the dual method. We show, by analysing some typical scenarios of problem characteristics, that this rearrangement of the calculations may be a computationally viable alternative to the traditional scheme. An advantage of streamlining the calculations is that there is no need to incorporate an active set strategy in the scheme, as is usually done, since all the design constraints may be taken into consideration without any loss of computational efficiency. This may, clearly, enhance the practical rate of convergence of the overall approximation scheme. Moreover, the proposed rearrangement of the calculations may make it computationally viable to apply iterative equation solvers to the structural analysis problem. Numerical results with direct as well as iterative equation solvers show that the streamlined scheme is a feasible and promising approach to structural optimization.     

Use of sea water in the flotation of carbonate rich sedimentary phosphate rock

There is an appreciable amount of carbonaceous sedimentary phosphate deposits in the northern Africa and the Middle East which are expected to gain importance in the near future because of the depletion of the deposits in Florida. In many of the regions where phosphate deposits are found there is a shortage of fresh water, and sea is not very far. The use of sea water instead of fresh water in flotation of carbonaceous phosphate rock is successfully demonstrated. Thus an appreciable reduction in the operating cost and an ample amount of saving in the fresh water resources of the region is expected.     

Swelling activation energy of κ‐carrageenan in its gel state: A fluorescence study

A steady‐state fluorescence technique was employed to study the swelling of κ‐carrageenan gels at various temperatures. Pyranine was used as a fluorescence probe. The fluorescence intensity of pyranine was measured during the insitu swelling process of κ‐carrageenan gels. The fluorescence intensity increased exponentially as the swelling time increased. The increase in the fluorescence intensity was modeled with the Li–Tanaka equation, from which the swelling time constants and cooperative diffusion coefficients were determined. The swelling time constants decreased and the cooperative diffusion coefficients increased as the swelling temperature was increased. The swelling activation energies were measured to be 47.05 kJ/mol. © 2007 Wiley Periodicals, Inc. J Appl Polym Sci 2007     

Fractal Characteristics of Fracture Surfaces

Quantitative fractography is often used to study material failure mechanisms. During calculation of surface or profile roughness parameters, the magnification used in obtaining fractographic data is found to influence the value of the parameters. Fractal geometry has been developed into a tool capable of defining surface and profile topography without sensitivity to magnification, and several studies have related fractal dimension ( D _F) to other physical or mechanical properties. In this study, we obtained the fractal dimension of profiled fracture surfaces of one glass and three proprietary dental porcelains. The fracture toughness ( K _1c) of these materials was also measured using the indentation-strength method. Results show the surfaces to be fractal. No quantitative relationship between fractal dimension and toughness was found. Differences in K _1c were demonstrated between some materials. It is postulated that the size range within which fractal dimension can be defined as constant is dependent on the toughening mechanism, and that the relationship between K _Ic and D _F cannot be identical for all materials.     

Quality assessment for a visual and automatic license plate recognition

Video transmission and analysis is often utilized in applications outside of the entertainment sector, and generally speaking this class of video is used to perform specific tasks. Examples of these applications include security and public safety. The Quality of Experience (QoE) concept for video content used for entertainment differs significantly from the QoE of surveillance video used for recognition tasks. This is because, in the latter case, the subjective satisfaction of the user depends on achieving a given functionality. Recognizing the growing importance of video in delivering a range of public safety services, we focused on developing critical quality thresholds in license plate recognition tasks based on videos streamed in constrained networking conditions. Since the number of surveillance cameras is still growing it is obvious that automatic systems will be used to do the tasks. Therefore, the presented research includes also analysis of automatic recognition algorithms.     

Synthesis and mechanical properties of unsaturated polyester based nanocomposites

Two classes of nanocomposites were synthesized using an unsaturated polyester resin as the matrix and sodium montmorillonite as well as an organically modified montmorillonite as the reinforcing agents. X‐ray diffraction pattern of the composites showed that the interlayer spacing of the modified montmorillonite expanded from 1.25 nm to 4.5 nm, indicating intercalation. Glass transition values of these composites increased from 72°C, in the unfilled unsaturated polyester, to 86°C in the composite with 10% organically modified montmorillonite. From Scanning Electron Microscopy, it is seen that the degree of intercalation/exfoliation of the modified montmorillonite is higher than in the unmodified one. The mechanical properties also supported these findings, since in general, the tensile modulus, tensile strength, flexural modulus, flexural strength and impact strength of the composites with modified montmorillonite were higher than the corresponding properties of the composites with unmodified montmorillonite. The tensile modulus, tensile strength, flexural modulus and flexural strength values showed a maximum, whereas the impact strength exhibited a minimum at approximately 3–5 wt% modified montmorillonite content. These results imply that the level of exfoliation may also exhibit a maximum with respect to the modified montmorillonite content. The level of improvement in the mechanical properties was substantial. Adding only 3 wt% organically modified clay improved the flexural modulus of unsaturated polyester by 35%. The tensile modulus of unsaturated polyester was also improved by 17% at 5 wt% of organically modified clay loading.     

Piecewise-linear subband coding scheme for fast image decomposition

Transform coding methods play a very important role in the development of diverse multimedia technologies. The discrete cosine and wavelet transforms are frequently used in the field of image processing and set up a basis for contemporary image compression standards (JPEG, MPEG). In this paper a novel two-channel piecewise-linear subband coding scheme (PL-SBC) is introduced. Its most important advantage are exceptionally fast and easy for implementation computational algorithms combined with good reconstruction quality. The proposed PL-SBC system is based on the dual filter bank consisting of a single filter at the decomposition stage and a single one at the reconstruction stage. For the presented PL-SBC scheme, the conditions of perfect reconstruction and the piecewise-linear approximation filter bank have been defined. The compression properties of a new subband coding scheme have been analysed for different categories of images and in comparison with well-known signal transforms, such as cosine, piecewise-linear, piecewise-constant and wavelet transforms. The research includes a comparison of the reconstruction error both in objective as well as subjective approach.     

Optimally Adaptive Integration of Univariate Lipschitz Functions

We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an additive error of at most ε using as few samples of f as possible. We use the adaptive framework: on all problem instances an adaptive algorithm should perform almost as well as the best possible algorithm tuned for the particular problem instance. We distinguish between and , the performances of the best possible deterministic and randomized algorithms, respectively. We give a deterministic algorithm that uses samples and show that an asymptotically better algorithm is impossible. However, any deterministic algorithm requires samples on some problem instance. By combining a deterministic adaptive algorithm and Monte Carlo sampling with variance reduction, we give an algorithm that uses at most samples. We also show that any algorithm requires samples in expectation on some problem instance (f,ε), which proves that our algorithm is optimal.