Calcium silicate hydrate—in-situ development of the silicate structure followed by infrared spectroscopy

In the current study, the development of the silicate structure of synthetic calcium silicate hydrates with different calcium contents was followed by in-situ infrared (IR) spectroscopy and correlated to the in-situ phase development evaluated by X-ray diffraction (XRD). A baseline correction method initially developed for X-ray diffractograms was successfully adapted for the complex background of the fingerprint region in in-situ IR, which significantly contributed to signal quality and reproducibility. The development of separate silicate infrared bands could be monitored over 24 h of reaction. These bands could be assigned to oligomeric and dimeric species based on their time and stoichiometry-dependent development. It was clearly shown that the main peak of the dimeric silicate species was overlooked in the literature. The correlation of time-dependent events to in-situ XRD revealed that changes in the unit cell of calcium silicate hydrate are related to silicate polymerization. The results were compared to ²⁹Si-MAS-NMR, which highlighted the benefits of in-situ IR spectroscopy.     

Modeling the Direct Synthesis of Dimethyl Ether using Artificial Neural Networks

Artificial neural networks (ANNs) are designed and implemented to model the direct synthesis of dimethyl ether (DME) from syngas over a commercial catalyst system. The predictive power of the ANNs is assessed by comparison with the predictions of a lumped model parameterized to fit the same data used for ANN training. The ANN training converges much faster than the parameter estimation of the lumped model, and the predictions show a higher degree of accuracy under all conditions. Furthermore, the simulations show that the ANN predictions are also accurate even at some conditions beyond the validity range.     

Aramid pulp treated with imidazolium ionic liquids as a filler in rigid polyurethane bio-foams

This article reports an aramid pulp (AP) treated with two ionic liquids (IL), namely 1-n-butyl-3-methylimidazolium chloride (C₄.Cl) and 1-carboxymethyl-3-methylimidazolium chloride (HO₂C), and its use as a filler in reinforced rigid polyurethane foams (RPUF). The RPUF were incorporated with the treated AP at three weight fractions (c.a. 0.1, 0.5, and 1.0 wt%) and were produced by the free rising method. The results showed that the studied IL promoted a better interaction between the AP and the RPUF system, which increased the overall reactivity, imparting a higher cell anisotropy. This also yielded a positive effect in mechanical properties and thermal stability of the RPUF. Compared to the neat RPUF, outstanding increases of approximately 50 and 20% were achieved in compressive modulus and strength, respectively. In all, the use of IL promoted increased compatibility between matrix and reinforcement, especially that HO₂C IL.     

Tetranorsesquiterpenoids as Attractants of Yucca Moths to Yucca Flowers

Journal of Chemical Ecology - The obligate pollination mutualism between Yucca and yucca moths is a classical example of coevolution. Oviposition and active pollination by female yucca moths occur...     

Bitwise dimensional co-clustering for analytical workloads

Analytical workloads in data warehouses often include heavy joins where queries involve multiple fact tables in addition to the typical star-patterns, dimensional grouping and selections. In this paper we propose a new processing and storage framework called bitwise dimensional co-clustering (BDCC) that avoids replication and thus keeps updates fast, yet is able to accelerate all these foreign key joins, efficiently support grouping and pushes down most dimensional selections. The core idea of BDCC is to cluster each table on a mix of dimensions, each possibly derived from attributes imported over an incoming foreign key and this way creating foreign key connected tables with partially shared clusterings. These are later used to accelerate any join between two tables that have some dimension in common and additionally permit to push down and propagate selections (reduce I/O) and accelerate aggregation and ordering operations. Besides the general framework, we describe an algorithm to derive such a physical co-clustering database automatically and describe query processing and query optimization techniques that can easily be fitted into existing relational engines. We present an experimental evaluation on the TPC-H benchmark in the Vectorwise system, showing that co-clustering can significantly enhance its already high performance and at the same time significantly reduce the memory consumption of the system.     

Performance models of storage contention in cloud environments

We propose simple models to predict the performance degradation of disk requests due to storage device contention in consolidated virtualized environments. Model parameters can be deduced from measurements obtained inside Virtual Machines (VMs) from a system where a single VM accesses a remote storage server. The parameterized model can then be used to predict the effect of storage contention when multiple VMs are consolidated on the same server. We first propose a trace-driven approach that evaluates a queueing network with fair share scheduling using simulation. The model parameters consider Virtual Machine Monitor level disk access optimizations and rely on a calibration technique. We further present a measurement-based approach that allows a distinct characterization of read/write performance attributes. In particular, we define simple linear prediction models for I/O request mean response times, throughputs and read/write mixes, as well as a simulation model for predicting response time distributions. We found our models to be effective in predicting such quantities across a range of synthetic and emulated application workloads.     

Simultaneous nonrigid registration of multiple point sets and atlas construction

Group-wise registration of a set of shapes represented by unlabeled point-sets is a challenging problem since, usually this involves solving for point correspondence in a nonrigid motion setting. In this paper, we propose a novel and robust algorithm that is capable of simultaneously computing the mean shape represented by a probability density function from multiple unlabeled point-sets and registering them non-rigidly to this emerging mean shape. This algorithm avoids the correspondence problem by minimizing the Jensen-Shannon (JS) divergence between the point sets. We motivate the use of the JS divergence by pointing out its close relationship to hypothesis testing. We derive the analytic gradient of the cost function in order to efficiently achieve the optimal solution. JS-divergence is symmetric with no bias toward any of the given shapes to be registered and whose mean is being sought. A by product of the registration process is a probabilistic atlas defined as the convex combination of the probability densities of the input point sets being aligned. Our algorithm can be especially useful for creating atlases of various shapes present in images as well as for simultaneously (rigidly or non-rigidly) registering 3D range data sets without having to establish any correspondence. We present experimental results on real and synthetic data.     

Probabilistic analysis of the application of the cross ratio to model based vision

The probability density function for the cross ratio is obtained under the hypothesis that the four image points have independent, identical, Gaussian distributions. The density function has six symmetries which are closely linked to the six different values of the cross ratio obtained by permuting the quadruple of points from which the cross ratio is calculated. The density function has logarithmic singularities corresponding to values of the cross ratio for which two of the four points are coincident. The cross ratio forms the basis of a simple system for recognising or classifying quadruples of collinear image points. The performance of the system depends on the choice of rule for deciding whether four image points have a given cross ratio . A rule is stated which is computationally straightforward and which takes into account the effects on the cross ratio of small errors in locating the image points. Two key properties of the rule are the probabilityR of rejection, and the probabilityF of a false alarm. The probabilitiesR andF depend on a thresholdt in the decision rule. There is a trade off betweenR andF obtained by varyingt. It is shown that the trade off is insensitive to the given cross ratio . LetF _w =max _o {F}. ThenR, F _w are related approximately by , provided ^–1 F _w 4. In the equation, is the accuracy with which image points can be located relative to the width of the image, andr _F is a constant known as the normalised false alarm rate. In the range ^–1 F _w 4 the probabilitiesR andF _w are related approximately by . The value ofr _F is 14.37. The consequences of these relations between R and F_w are discussed. It is conjectured that the above general form of the trade off betweenR andF _w holds for a wide class of scalar invariants that could be used for model based object recognition. Invariants with the same type of trade off between the probability of rejection and the probability of false alarm are said to be nondegenerate for model based vision.     

Secure video communication using firefly optimization and visual cryptography

In recent years, we face an increasing interest in protecting multimedia data and copyrights due to the high exchange of information. Attackers are trying to get confidential information from various sources, which brings the importance of securing the data. Many researchers implemented techniques to hide secret information to maintain the integrity and privacy of data. In order to protect confidential data, histogram-based reversible data hiding with other cryptographic algorithms are widely used. Therefore, in the proposed work, a robust method for securing digital video is suggested. We implemented histogram bit shifting based reversible data hiding by embedding the encrypted watermark in featured video frames. Histogram bit shifting is used for hiding highly secured watermarks so that security for the watermark symbol is also being achieved. The novelty of the work is that only based on the quality threshold a few unique frames are selected, which holds the encrypted watermark symbol. The optimal value for this threshold is obtained using the Firefly Algorithm. The proposed method is capable of hiding high-capacity data in the video signal. The experimental result shows the higher capacity and video quality compared to other reversible data hiding techniques. The recovered watermark provides better identity identification against various attacks. A high value of PSNR and a low value of BER and MSE is reported from the results.