Social collaborative filtering using local dynamic overlapping community detection

The Journal of Supercomputing - Recommender systems play an important role in dealing with the problems caused by the great and growing amount of information, and the collaborative filtering method...     

Java multimedia telecollaboration

Using Java-based tools in multimedia collaborative environments accessed over the Internet can increase an application's client base. Most operating systems support Java, and its "compile once-run everywhere" architecture is easy to maintain and update. The Java-based tools presented here let users share Internet resources, including resources originally designed for single use.     

Selectivity Enhancement to the Exclusive Formation of Ethyltoluenes and Hydrogen During Dehydroalkylation of Toluene with Ethane

The dehydroalkylation of toluene with ethane to the isomeric ethyltoluenes was studied on 0.4Pt/H-ZSM-5 at varying contact times (1/WHSV). At a high contact time of 1.0 h, toluene disproportionation and hydrogenolysis reactions dominate, resulting in low selectivity to the desired ethyltoluenes via the alkylation reaction. However, at a low contact time of 0.12 h side reactions are eliminated, resulting in maximum selectivities to the kinetically favored ethyltoluenes and hydrogen. Results at high selectivities to ethyltoluenes provide significant insight into reaction pathways.     

Reconstruction of reflectance spectra using weighted principal component analysis

The weighted principal component analysis technique is employed for reconstruction of reflectance spectra of surface colors from the related tristimulus values. A dynamic eigenvector subspace based on applying certain weights to reflectance data of Munsell color chips has been formed for each particular sample and the color difference value between the target, and Munsell dataset is chosen as a criterion for determination of weighting factors. Implementation of this method enables one to increase the influence of samples which are closer to target on extracted principal eigenvectors and subsequently diminish the effect of those samples which benefit from higher amount of color difference. The performance of the suggested method is evaluated in spectral reflectance reconstruction of three different collections of colored samples by the use of the first three Munsell bases. The resulting spectra show considerable improvements in terms of root mean square error between the actual and reconstructed reflectance curves as well as CIELAB color difference under illuminant A in comparison to those obtained from the standard PCA method. © 2008 Wiley Periodicals, Inc. Col Res Appl, 33, 360–371, 2008     

Pharmacology and subcellular distribution of [3H]rilmenidine binding sites in rat brain

We have previously reported that in rat brain membranes, [3H]rilmenidine, in addition to labelling alpha2-adrenoceptors and the I2B-subtype of imidazoline receptor binding site (I2B-RBS), may label an additional I-RBS population, distinct from previously classified I1-RBS and I2-RBS. In this study, using crude or fractionated rat brain membranes we examined the possible association of [3H]rilmenidine-labelled I-RBS with the A- and B-isoforms of monoamine oxidase (MAO) by studying the inhibition of [3H]rilmenidine binding by a number of MAO inhibitors; and comparing the maximal binding density (Bmax) and subcellular distribution of [3H]rilmenidine binding sites with that of MAO-A and MAO-B catalytic sites labelled by [3H]RO41-1049 and [3H]RO19-6327 and 12-RBS labelled by [3H]2-BFI. Inhibition of [3H]rilmenidine binding by all MAO inhibitors tested produced very shallow curves (slope 0.29-0.56). Clorgyline and moclobemide (selective MAO-A inhibitors) displayed moderate affinities (60-140 nM), while pargyline (non-selective MAO-inhibitor), RO41-1049 (selective MAO-A inhibitor) and RO19-6327 (selective MAO-B inhibitor) exhibited very low affinities (> 2 microM) for 50-75% of [3H]rilmenidine-labelled I-RBS in crude brain membranes and even lower affinity for the remaining binding. Under identical buffer conditions, the Bmax of [3H]rilmenidine-labelled I-RBS (1.45+/-0.14 pmol/mg protein) was considerably lower than those of MAO-A (13.10+/-0.15 pmol/mg) and MAO-B (10.35+/-0.50 pmol/mg) sites. These results suggest that [3H]rilmenidine does not interact directly with the active catalytic site of either MAO enzyme and could at best only associate with a subpopulation of MAO molecules. Binding studies on five fractions of rat cortex homogenates-nuclear (N), heavy (M) and light (L) mitochondrial, microsomal non-mitochondrial (P), and soluble cytosolic (S) fractions-revealed that 45% of total [3H]rilmenidine binding was present in the P fraction cf. 20 and 23% in the M and L fractions, in contrast to [3H]RO19-6327 and [3H]2-BFI which bound 11-13% in the P fraction and 36-38% and 35-44% in the M and L fractions, respectively. Binding of all ligands in the N fraction was 6-15% of total. These studies reveal that [3H]rilmenidine-labelled I-RBS, unlike the I2-RBS, are not predominantly associated with mitochondrial fractions containing the MAO enzymes (and cytochrome oxidase activity), but appear to be distributed in both the mitochondrial and plasma membrane fractions in rat cerebral cortex.     

Query processing optimization in broadcasting XML data in mobile communications

Todays, XML as a de facto standard is used to broadcast data over mobile wireless networks. In these networks, mobile clients send their XML queries over a wireless broadcast channel and recieve their desired XML data from the channel. However, downloading the whole XML data by a mobile device is a challenge since the mobile devices used by clients are small battery powered devices with limited resources. To meet this challenge, the XML data should be indexed in such a way that the desired XML data can be found easily and only such data can be downloaded instead of the whole XML data by the mobile clients. Several indexing methods are proposed to selectively access the XML data over an XML stream. However, the existing indexing methods cause an increase in the size of XML stream by including some extra information over the XML stream. In this paper, a new XML stream structure is proposed to disseminate the XML data over a broadcast channel by grouping and summarizing the structural information of XML nodes. By summarizing such information, the size of XML stream can be reduced and therefore, the latency of retrieving the desired XML data over a wirless broadcast channel can be reduced. The proposed XML stream structure also contains indexes in order to skip from the irrelevant parts over the XML stream. It therefore can reduce the energy consumption of mobile devices in downloading the results of XML queries. In addition, our proposed XML stream structure can process different types of XML queries and experimental results showed that it improves the performace of XML query processing over the XML data stream compared to the existing research works in terms of access and tuning times.

     

Incorporation of a Regularization Term to Control Negative Correlation in Mixture of Experts

Combining accurate neural networks (NN) in the ensemble with negative error correlation greatly improves the generalization ability. Mixture of experts (ME) is a popular combining method which employs special error function for the simultaneous training of NN experts to produce negatively correlated NN experts. Although ME can produce negatively correlated experts, it does not include a control parameter like negative correlation learning (NCL) method to adjust this parameter explicitly. In this study, an approach is proposed to introduce this advantage of NCL into the training algorithm of ME, i.e., mixture of negatively correlated experts (MNCE). In this proposed method, the capability of a control parameter for NCL is incorporated in the error function of ME, which enables its training algorithm to establish better balance in bias-variance-covariance trade-off and thus improves the generalization ability. The proposed hybrid ensemble method, MNCE, is compared with their constituent methods, ME and NCL, in solving several benchmark problems. The experimental results show that our proposed ensemble method significantly improves the performance over the original ensemble methods.     

A robust critical path in an environment with hybrid uncertainty

In this article, we consider the project critical path problem in an environment with hybrid uncertainty. In this environment, the duration of activities are considered as random fuzzy variables that have probability and fuzzy natures, simultaneously. To obtain a robust critical path with this kind of uncertainty a chance constraints programming model is used. This model is converted to a deterministic model in two stages. In the first stage, the uncertain model is converted to a model with interval parameters by alpha-cut method and distribution function concepts. In the second stage, the interval model is converted to a deterministic model by robust optimization and min-max regret criterion and ultimately a genetic algorithm with a proposed exact algorithm are applied to solve the final model. Finally, some numerical examples are given to show the efficiency of the solution procedure.     

Fundamental parameters affecting electrospinning of PAN nanofibers as uniaxially aligned fibers

Electrospinning with a collector consisting of two pieces of electrically conductive substrates separated by a gap has been used to prepare uniaxially aligned PAN nanofibers. Solution of 15 wt % of PAN/DMF was used tentatively for electrospinning. The effects of width of the gap and applied voltage on degree of alignment were investigated using image‐processing technique by Fourier power spectrum method. The electrospinning conditions that gave the best alignment of nanofibers for 10–15 wt % solution concentrations were experimentally obtained. Bundles like multifilament yarns of uniaxially aligned nanofibers were prepared using a new simple method. After‐treatments of these bundles were carried out in boiling water under tension. A comparison was made between the crystallinity and mechanical behavior of posttreated and untreated bundles. © 2006 Wiley Periodicals, Inc. J Appl Polym Sci 101: 4350–4357, 2006     

A novel image encryption based on hash function with only two-round diffusion process

In this paper, a novel algorithm for image encryption based on hash function is proposed. In our algorithm, a 512-bit long external secret key is used as the input value of the salsa20 hash function. First of all, the hash function is modified to generate a key stream which is more suitable for image encryption. Then the final encryption key stream is produced by correlating the key stream and plaintext resulting in both key sensitivity and plaintext sensitivity. This scheme can achieve high sensitivity, high complexity, and high security through only two rounds of diffusion process. In the first round of diffusion process, an original image is partitioned horizontally to an array which consists of 1,024 sections of size 8 × 8. In the second round, the same operation is applied vertically to the transpose of the obtained array. The main idea of the algorithm is to use the average of image data for encryption. To encrypt each section, the average of other sections is employed. The algorithm uses different averages when encrypting different input images (even with the same sequence based on hash function). This, in turn, will significantly increase the resistance of the cryptosystem against known/chosen-plaintext and differential attacks. It is demonstrated that the 2D correlation coefficients (CC), peak signal-to-noise ratio (PSNR), encryption quality (EQ), entropy, mean absolute error (MAE) and decryption quality can satisfy security and performance requirements (CC <0.002177, PSNR <8.4642, EQ >204.8, entropy >7.9974 and MAE >79.35). The number of pixel change rate (NPCR) analysis has revealed that when only one pixel of the plain-image is modified, almost all of the cipher pixels will change (NPCR >99.6125 %) and the unified average changing intensity is high (UACI >33.458 %). Moreover, our proposed algorithm is very sensitive with respect to small changes (e.g., modification of only one bit) in the external secret key (NPCR >99.65 %, UACI >33.55 %). It is shown that this algorithm yields better security performance in comparison to the results obtained from other algorithms.