Use of the Retarded Solution-Reprecipitation Process to Attain a Higher Initial Permeability in MnZn Ferrites

We investigated the effect of various amounts of liquid phase on microstructure development during sintering and the resulting magnetic permeability of MnZn ferrite (MZF) samples. Our results revealed that the microstructure and the final magnetic permeability depend on the thickness of the liquid-phase film during sintering. The solution-reprecipitation (S-R) process, which is associated with an intensive microstructure development in MZF, starts when a continuous liquid-phase film of critical thickness δ_o, which wets the MZF grains, is formed. The solid-state sintering that takes place before the formation of the continuous liquid-phase film is essential for the final microstructure of MZF.     

KINEMATIC VISCOSITY-TEMPERATURE BEHAVIOR OF HEAVY TBP-FRACTIONS (455°C+) OF ARABIAN CRUDE OILS

A generalized kinematic viscosity-temperature correlation for undefined liquid heavy petroleum fractions has been developed to represent the data for a wide range of temperature from 100°C to 200°C. The correlation is based on the experimental kinematic viscosity data of true boiling point fractions of four Arabian crude oils. The characterization property required for estimation is 50% boiling point. The proposed correlation fits the experimental data with an overall absolute error of 6.1%. Experimental measurements of kinematic viscosity of heavy true boiling point fractions of Arabian crude oils were also obtained in order to develop the proposed correlation.     

Transference and retrieval of voice message over low signal strength in satellite communication

This paper presents a method of transferring voice using short messaging service in satellite communication system. The method is especially applicable in a situation where signal strength is low and voice call is not possible. In a tunnel, basement or environment with bad climate conditions, signal strength usually gets weak which make voice call difficult but SMS works in such situation. An application has been developed using J2ME language in order to test the proposed method. For experimentation, Thuraya SG-2520 satellite phone has been used.     

Aggregation Operators of Interval‐Valued 2‐Tuple Linguistic Information

The group decision‐making problem with linguistic information evaluation values of decision makers are used based on 2‐tuple interval‐valued. Operational laws on interval value 2‐tuple are introduced. On the basis of these laws, new aggregation operators are introduced by using the Choquet integral. A multiple attribute decision‐making method based on these aggregation operators is proposed. An example is given to illustrate the efficiency, practicality, and feasibility of our method.     

Infrared spectroscopic investigation of tannins

Infrared spectroscopy is suggested as a diagnostic method for the characterisation and qualitative estimation of the two classes of tannins. Gallic acid, tannic acid and chebulinic acid have been taken as model compounds for the hydrolysable and catechin for the condensed tannins. The former class is marked by the presence of strong absorption maxima at 1710 – 35 cm^?1. The two classes have characteristic pattern of absorption, from which it is possible to characterise the particular type of tannin.     

Oxidation of Branched Chain Fatty Acids by Chromic Acid

The kinetics of oxidation of isobutyric and isovaleric acids by chromic acid in sulphuric acid medium have been studied. The end product acetic acid is supposed to be derived from the ketones which are the initial oxidation products of the corresponding branched chain fatty acids. The influence of acetic acid on the oxidation velocity has been examined and a marked effect on the rate constants with increasing acetic acid concentration has been observed. A mechanism involving the electrophilic attack of the oxidant on the tertiary carbon atom of the fatty acid to yield a carbonium ion has been postulated.     

DPV: a taxonomy for utilizing deep learning as a prediction technique for various types of cancers detection

Multimedia Tools and Applications - Deep learning (DL) is a type of machine learning capable of processing large quantities of data to provide analytic results based on a particular...     

Applicability of feed-forward and recurrent neural networks to Boolean function complexity modeling

In this paper, we present the feed-forward neural network (FFNN) and recurrent neural network (RNN) models for predicting Boolean function complexity (BFC). In order to acquire the training data for the neural networks (NNs), we conducted experiments for a large number of randomly generated single output Boolean functions (BFs) and derived the simulated graphs for number of min-terms against the BFC for different number of variables. For NN model (NNM) development, we looked at three data transformation techniques for pre-processing the NN-training and validation data. The trained NNMs are used for complexity estimation for the Boolean logic expressions with a given number of variables and sum of products (SOP) terms. Both FFNNs and RNNs were evaluated against the ISCAS benchmark results. Our FFNNs and RNNs were able to predict the BFC with correlations of 0.811 and 0.629 with the benchmark results, respectively.     

On minimum cost isolated failure immune networks

A telecommunications network is isolated failure immune (IFI) if and only if communication between operative sites can be completed as long as network failures are isolated. It is known that the class of minimal IFI networks is equivalent to the class of spanning 2-trees. To the best of our knowledge, this work is the first computational study dealing with the construction of a minimum cost IFI network. The problem is known to be NP-complete. We develop a tabu search based heuristic for solving the minimum cost spanning 2-tree (MCS2T) problem. The complex structure of 2-trees makes the tabu search heuristic highly dependent on the starting solution. We develop four heuristic algorithms to obtain diversified good starting solutions. They are: completion of a 2-tree from a spanning tree, two greedy approaches, and a method based on the recursive definition of a 2-tree. We also formulate an integer programming problem (IP) whose objective function value is a lower bound to the MCS2T problem. We solve the IP by developing a constraint generation scheme. The algorithms were tested on complete random graphs with Euclidean distances and on two real data sets (Civil Aeronautics Board) with instances of 10, 15, 20 and 25 nodes. As a result of this research for small problems (10 and 15 nodes), the heuristic solutions are on average within 0.8% from the optimal solution and for large problems (20 and 25 nodes), the average error is less than 2.8%.