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.     

International contribution to library and information science in Poland: A bibliometric analysis

This article reports findings from the study of the international contribution to the system of library and information science communication in Poland in the years 2003–2005. The sample consists of articles published both in selected journals and collective works. Two important dimensions determining the internationalization of local scholarly communication are considered: direct contribution (foreign authors’ articles and papers and their translations published in Poland) and indirect contribution (citedness of foreign authors’ documents in articles and papers published in Poland). Bibliographic data about the geographical distribution and affiliation of foreign authors are gathered and analyzed. Furthermore, the findings of citation analysis are presented to determine the percentage share of citations received by foreign documents as well as to find out what is the structure of such citations regarding the language and form, which thematic areas are most replete with such citations and which foreign journals are most cited in Poland.     

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.     

Subquadratic Algorithms for 3SUM

We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with w-bit words, we obtain a running time of . In the circuit RAM with one nonstandard AC ⁰ operation, we obtain . In external memory, we achieve O(n ²/(MB)), even under the standard assumption of data indivisibility. Cache-obliviously, we obtain a running time of . In all cases, our speedup is almost quadratic in the “parallelism” the model can afford, which may be the best possible. Our algorithms are Las Vegas randomized; time bounds hold in expectation, and in most cases, with high probability.     

Towards measurable bounds on entanglement measures

While the experimental detection of entanglement provides already quite a difficult task, experimental quantification of entanglement is even more challenging, and has not yet been studied thoroughly. In this paper we discuss several issues concerning bounds on concurrence measurable collectively on copies of a given quantum state. Firstly, we concentrate on the recent bound on concurrence by (Mintert and Buchleitner in Phys Rev Lett 98:140505/1–140505/4, 2007). Relating it to the reduction criterion for separability we provide yet another proof of the bound and point out some possibilities following from the proof which could lead to improvement of the bound. Then, relating concurrence to the generalized robustness of entanglement, we provide a method allowing for construction of lower bounds on concurrence from any positive map (not only the reduction one). All these quantities can be measured as mean values of some two-copy observables. In this sense the method generalizes the Mintert–Buchleitner bound and recovers it when the reduction map is used. As a particular case we investigate the bound obtained from the transposition map. Interestingly, comparison with MB bound performed on the class of ${4\otimes 4}While the experimental detection of entanglement provides already quite a difficult task, experimental quantification of entanglement is even more challenging, and has not yet been studied thoroughly. In this paper we discuss several issues concerning bounds on concurrence measurable collectively on copies of a given quantum state. Firstly, we concentrate on the recent bound on concurrence by (Mintert and Buchleitner in Phys Rev Lett 98:140505/1–140505/4, 2007). Relating it to the reduction criterion for separability we provide yet another proof of the bound and point out some possibilities following from the proof which could lead to improvement of the bound. Then, relating concurrence to the generalized robustness of entanglement, we provide a method allowing for construction of lower bounds on concurrence from any positive map (not only the reduction one). All these quantities can be measured as mean values of some two-copy observables. In this sense the method generalizes the Mintert–Buchleitner bound and recovers it when the reduction map is used. As a particular case we investigate the bound obtained from the transposition map. Interestingly, comparison with MB bound performed on the class of 4?4{4\otimes 4} rotationally invariant states shows that the new bound is positive in regions in which the MB bound gives zero. Finally, we provide measurable upper bounds on the whole class of concurrences.