Salt-assisted solution combustion synthesis of NiFe2O4: Effect of salt type

The effects of three types of salt including NaF, KCl, and NaCl on the properties of NiFe₂O₄ nanoparticles using salt-assisted solution combustion synthesis (SSCS) have been investigated. The synthesized powders were evaluated by SEM, TEM, FTIR, XRD, and VSM analysis. Also, the specific surface area (SSA), as well as size distribution and volume of the porosities of NiFe₂O₄ powders were determined by the BET apparatus. The visual observations showed that the intensity and time of combustion synthesis of nanoparticles have been severely influenced by the type of salt. The highest crystallinity was observed in the synthesized powder using NaCl. The SSA has also been correlated completely to the type of salt. The quantities of SSA was achieved about 91.62, 64.88, and 47.22 m²g^-1 for the powders synthesized by KCl, NaCl, and NaF respectively. Although the magnetic hysteresis loops showed the soft ferromagnetic behavior of the NiFe₂O₄ nanoparticles in all conditions, KCl salt could produce the particles with the least coercivity and remanent magnetization. Based on the present study, the salt type is a key parameter in the SSCS process for the preparation of spinel ferrites. Thermodynamic evaluation also showed that the melting point and heat capacity are important parameters for the proper selection of the salt.     

Synthesis and characterization of novel diimide–dinaphthols and resulting poly(urethane–imide)s

Novel diols containing imide groups were prepared via condensation of aromatic dianhydrides with 5‐amino‐1‐naphthol. The diimide–dinaphthols prepared were characterized by conventional methods and used to synthesize new poly(urethane–imide)s (PUIs). All the polymers were characterized and their physical properties, such as solubility, solution viscosity, thermal stability, and thermal behaviour were studied. The polymers obtained showed more thermal stability than typical polyurethanes because of the presence of the imide groups. Copyright © 2003 Society of Chemical Industry     

Real-time processing and compression of DNA microarray images.

In this paper, we present a pipeline architecture specifically designed to process and compress DNA microarray images. Many of the pixilated image generation methods produce one row of the image at a time. This property is fully exploited by the proposed pipeline that takes in one row of the produced image at each clock pulse and performs the necessary image processing steps on it. This will remove the present need for sluggish software routines that are considered a major bottleneck in the microarray technology. Moreover, two different structures are proposed for compressing DNA microarray images. The proposed architecture is proved to be highly modular, scalable, and suited for a standard cell VLSI implementation.     

A quantitative comparison of the effects of modeling approaches on system verification using a controlled challenge problem

Requirements Engineering - To reduce program risks, engineering methods capitalizing on modeling and machine assistance have been extensively investigated within systems engineering (and more...     

Predicting roadheader performance by using artificial neural network

With growing use of roadheaders in the world and its significant role in the successful accomplishment of a tunneling project, it is a necessity to accurately predict performance of this machine in different ground conditions. On the other hand, the existence of some shortcomings in the prediction models has made it necessary to perform more research on the development of the new models. This paper makes an attempt to model the rate of roadheader performance based on the geotechnical and geological site conditions. For achieving the aim, an artificial neural network (ANN), a powerful tool for modeling and recognizing the sophisticated structures involved in data, is employed to model the relationship between the roadheader performance and the parameters influencing the tunneling operations with a high correlation. The database used in modeling is compiled from laboratory studies conducted at Azad University at Science and Research Branch, Tehran, Iran. A model with architecture 4-10-1 trained by back-propagation algorithm is found to be optimum. A multiple variable regression (MVR) analysis is also applied to compare performance of the neural network. The results demonstrate that predictive capability of the ANN model is better than that of the MVR model. It is concluded that roadheader performance could be accurately predicted as a function of unconfined compressive strength, Brazilian tensile strength, rock quality designation, and alpha angle R ² = 0.987. Sensitivity analysis reveals that the most effective parameter on roadheader performance is the unconfined compressive strength.     

An adaptive LSB matching steganography based on octonary complexity measure

Adaptive steganography methods tend to increase the security against attacks. Most of adaptive methods use LSB flipping (LSB-F) for embedding part of their algorithms. LSB-F is very much vulnerable against simple steganalysis methods but it allows the adaptive algorithms to be extractable at the receiver side. Use of LSB matching (LSB-M) could increase the security but extraction of data at the receiver is difficult or, in occasions, impossible. There are numerous attacks against LSB-M. In this paper we are proposing an adaptive algorithm which, unlike most adaptive methods, uses LSB-M as its embedding method. The proposed method uses a complexity measure based on a local neighborhood analysis for determination of secure locations of an image. Comparable adaptive methods that use LSB-M suffer from possible changes in the complexity of pixels when embedding is performed. The proposed algorithm is such that when a pixel is categorized as complex at the transmitter and is embedded the receiver will identify it as complex too, and data is correctly retrieved. Better performance of the algorithm is shown by obtaining higher PSNR values for the embedded images with respect to comparable adaptive algorithms. The security of the algorithm against numerous attacks is shown to be higher than LSB-M. Also, it is compared with a recent adaptive method and is proved to be advantageous for most embedding rates.     

Counting eosinophils in bronchoalveolar lavage fluid images with fuzzy methodology

This paper proposes a new fuzzy approach to count eosinophils, as a measure of inflammation, in bronchoalveolar lavage fluid images, provided by digital camera through microscope. We use fuzzy cluster analysis and fuzzy classification algorithm to determine the number of objects in an image. For this purpose, a fuzzy image processing procedure consisting of five main stages is presented. The first stage is pre-highlighting the objects in the images by using an image pre-processing method for enhancement, which is sharpening the image with the Laplaian high pass filter in order to have acceptable contrast in the image. The second stage is segmentation by clustering with fuzzy c-mean algorithm for portioning. In this stage the clustered data are the rough symbols of objects in the image containing noise. In the third step, first, a Gaussian low pass filter is used for noise reduction. Then, a contrast adoption in the image is done by modifying the membership functions in the image [H.R. Tizhoosh, G. Krell, B. Michaelis, Knowledge-based enhancement of megavoltage images in radiation therapy using a hybrid neuro-fuzzy system, Image and Vision Computing 19(July) (2000) 217–233]. Object recognition, the fourth stage, will be done by using fuzzy labeling for the objects in the image, using a fuzzy classification method. The number of labeled images shows the number of eosinophils in an image which is an index for diagnosing inflammation. The last stage is tuning parameters and verification of the system performance by using a feed forward Neural Network.     

GSAGA: A hybrid algorithm for task scheduling in cloud infrastructure

Cloud computing is becoming a very popular form of distributed computing, in which digital resources are shared via the Internet. The user is provided with an overview of many available resources. Cloud providers want to get the most out of their resources, and users are inclined to pay less for better performance. Task scheduling is one of the most important aspects of cloud computing. In order to achieve high performance from cloud computing systems, tasks need to be scheduled for processing by appropriate computing resources. The large search space of this issue makes it an NP-hard problem, and more random search methods are required to solve this problem. Multiple solutions have been proposed with several algorithms to solve this problem until now. This paper presents a hybrid algorithm called GSAGA to solve the Task Scheduling Problem (TSP) in cloud computing. Although it has a high ability to search the problem space, the Genetic Algorithm (GA) performs poorly in terms of stability and local search. It is therefore possible to create a stable algorithm by combining the general search capacities of the GA with the Gravitational Search Algorithm (GSA). Our experimental results indicate that the proposed algorithm can solve the problem with higher efficiency compared with the state-of-the-art.

     

Globally stable and high-performance Internet congestion control through a computational inspiration from nature

There are many reasons to worry that the current congestion control schemes in the Internet may be reaching its limits. Since the nature is a source of excellent solutions for complex problems, this work attempts to solve the congestion control problem, by adopting some biological principles and mechanisms. The current work proposes that the congestion problem in the Internet can be addressed through an inspiration from the population control tactics in nature. Toward this idea, each flow (W ) in the networ...