Nanolayer CrAlN/TiSiN coating designed for tribological applications

With the goal to produce a hard and tough coating intended for tribological applications, CrAlN/TiSiN nanolayer coating was prepared by alternative deposition of CrAlN and TiSiN layers. In the first part of the article, a detailed study of phase composition, microstructure, and layer structure of CrAlN/TiSiN coating is presented. In the second part, its mechanical properties, fracture and tribological behavior are compared to the nanocomposite TiSiN coating. An industrial magnetron sputtering unit was used for coating deposition. X-ray photoelectron spectroscopy, energy dispersive X-ray spectroscopy, X-ray diffraction, scanning electron microscopy, and transmission electron microscopy were used for compositional and microstructural analysis. Mechanical properties and fracture behavior were studied by instrumented indentation and focused ion beam techniques. Tribological properties were evaluated by ball-on-disk test in a linear reciprocal mode. A complex layer structure was found in the nanolayer coating. The TiSiN layers were epitaxially stabilized inside the coating which led to formation of dislocations at interfaces, to introduction of disturbances in the coating growth, and as a result, to development of fine-grained columnar microstructure. Indentation load required for the onset of fracture was twice lower for the nanolayer CrAlN/TiSiN, compared to the nanocomposite TiSiN coating. This agrees very well with their mechanical properties, with H³/E² being twice higher for the TiSiN coating. However, the nanolayer coating experienced less severe damage, which had a strong impact on tribological behavior. A magnitude of order lower wear rate and four times lower steady state friction coefficient were found for the nanolayer coating.     

A propositional probabilistic logic with discrete linear time for reasoning about evidence

The aim of the paper is to present a sound, strongly complete and decidable probabilistic temporal logic that can model reasoning about evidence. The formal system developed here is actually a solution of a problem proposed by Halpern and Pucella (J Artif Intell Res 26:1–34, 2006).     

Flow profile measurement in microchannel using the optical feedback interferometry sensing technique

The need to accurately measure flow profiles in microfluidic channels is well recognised. In this work, we present a new optical feedback interferometry (OFI) flow sensor that accurately measures local velocity in fluids and enables reconstruction of a velocity profile inside a microchannel. OFI is a self-aligned interferometric technique that uses the laser as both the transmitter and the receiver thus offering high sensitivity, fast response, and a simple and compact optical design. The system described here is based on a commercial semiconductor laser and has been designed to achieve a micrometer-range spatial resolution. The sensor performance was validated by reconstructing the velocity profile inside a circular cross-section flow-channel with 320  $\upmu $ m internal diameter, with a relative error smaller than 1.8 %. The local flow velocity is directly measured, thus avoiding the need for model based profile calculation and uncertainties inherent to this approach. The system was validated by successfully extracting the flow profiles in both Newtonian and shear-thinning liquids.     

On projection methods,convergence and robust formulations in topology optimization

Mesh convergence and manufacturability of topology optimized designs have previously mainly been assured using density or sensitivity based filtering techniques. The drawback of these techniques has been gray transition regions between solid and void parts, but this problem has recently been alleviated using various projection methods. In this paper we show that simple projection methods do not ensure local mesh-convergence and propose a modified robust topology optimization formulation based on erosion, intermediate and dilation projections that ensures both global and local mesh-convergence.     

Parallel programming for multimedia applications

Computing capabilities are continuing to increase with the availability of multi core and many core processors. The wide availability of multi core processors has made parallel programming possible for end user applications running on desktops, workstations, and mobile devices. While parallel hardware has become common, software that exploits parallel capabilities is just beginning to take hold. Multimedia applications, with their data parallel nature and large computing requirements will benefit significantly from parallel programming. In this paper an overview of parallel programming is presented and languages and tools for parallel programming such as OpenMP and CUDA are introduced within the scope of multimedia applications.     

Adaptive content-based music retrieval system

This paper presents a tunable content-based music retrieval (CBMR) system suitable the for retrieval of music audio clips. The audio clips are represented as extracted feature vectors. The CBMR system is expert-tunable by altering the feature space. The feature space is tuned according to the expert-specified similarity criteria expressed in terms of clusters of similar audio clips. The main goal of tuning the feature space is to improve retrieval performance, since some features may have more impact on perceived similarity than others. The tuning process utilizes our genetic algorithm. The R-tree index for efficient retrieval of audio clips is based on the clustering of feature vectors. For each cluster a minimal bounding rectangle (MBR) is formed, thus providing objects for indexing. Inserting new nodes into the R-tree is efficiently performed because of the chosen Quadratic Split algorithm. Our CBMR system implements the point query and the n-nearest neighbors query with the O(logn) time complexity. Different objective functions based on cluster similarity and dissimilarity measures are used for the genetic algorithm. We have found that all of them have similar impact on the retrieval performance in terms of precision and recall. The paper includes experimental results in measuring retrieval performance, reporting significant improvement over the untuned feature space.     

FM radio for indoor localization with spontaneous recalibration

The position of mobile users has become highly important information in pervasive computing environments. Indoor localization systems based on Wi–Fi signal strength fingerprinting techniques are widely used in office buildings with an existing Wi–Fi infrastructure. Our previous work has proposed a solution based on exploitation of a FM signal to deal with environments not covered with Wi–Fi signal or environments with only a single Wi–Fi access point. However, a general problem of indoor wireless positioning systems pertains to signal degradation due to the environmental factors affecting signal propagation. Therefore, in order to maintain a desirable level of localization accuracy, it becomes necessary to perform periodic calibrations of the system, which is either time consuming or requires dedicated equipment and expert knowledge. In this paper, we present a comparison of FM versus Wi–Fi positioning systems and a combination of both systems, exploiting their strengths for indoors positioning. We also address the problem of recalibration by introducing a novel concept of spontaneous recalibration and demonstrate it using the FM localization system. Finally, the results related to device orientation and localization accuracy are discussed.     

On the implementation of bytecode compression for interpreted languages

This paper describes a new method for code space optimization for interpreted languages called LZW‐CC . The method is based on a well‐known and widely used compression algorithm, LZW , which has been adapted to compress executable program code represented as bytecode. Frequently occurring sequences of bytecode instructions are replaced by shorter encodings for newly generated bytecode instructions. The interpreter for the compressed code is modified to recognize and execute those new instructions. When applied to systems where a copy of the interpreter is supplied with each user program, space is saved not only by compressing the program code but also by automatically removing the unused implementation code from the interpreter. The method's implementation within two compiler systems for the programming languages Haskell and Java is described and implementation issues of interest are presented, notably the recalculations of target jumps and the automated tailoring of the interpreter to program code. Applying LZW‐CC to nhc98 Haskell results in bytecode size reduction by up to 15.23% and executable size reduction by up to 11.9%. Java bytecode is reduced by up to 52%. The impact of compression on execution speed is also discussed; the typical speed penalty for Java programs is between 1.8 and 6.6%, while most compressed Haskell executables run faster than the original. Copyright © 2008 John Wiley & Sons, Ltd.     

Performance measurement of e-learning using student satisfaction analysis

The purpose of this paper is to analyze e-learning system quality through the analysis of student satisfaction and the usage of learning materials. This analysis takes into consideration both online and traditional students who are using the same e-learning system. The goal of the analysis is to identify factors which influence student satisfaction and to address heterogeneous styles and needs of both groups of students, so that future pedagogical and motivational methods in teaching and learning can be appropriately selected, developed and implemented. It was of particular interest to explore student satisfaction with quality of an e-learning system and online study approach. Reasons that may influence opinions of online and traditional students are examined and presented. The results are used to give recommendations for e-learning improvements and to propose the model with 4 groups of dimensions for performance measurement each of which best represents satisfaction of both groups of students.