Automatic grading and packing of prawns

Prawns are a substantial Australian resource but presently are processed in a very labour-intensive manner. A prototype system has been developed for automatically grading and packing prawns into single-layer 'consumer packs' in which each prawn is approximately straight and has the same orientation. The novel technology includes a machine vision system that has been specially programmed to calculate relevant parameters at high speed and a gripper mechanism that can acquire, straighten and place prawns of various sizes. The system can be implemented on board a trawler or in an onshore processing facility. © 1993.

Pentacene on Ni(111): room-temperature molecular packing and temperature-activated conversion to graphene

We investigate, using scanning tunnelling microscopy, the adsorption of pentacene on Ni(111) at room temperature and the behaviour of these monolayer films with annealing up to 700 °C. We observe the conversion of pentacene into graphene, which begins from as low as 220 °C with the coalescence of pentacene molecules into large planar aggregates. Then, by annealing at 350 °C for 20 minutes, these aggregates expand into irregular domains of graphene tens of nanometers in size. On surfaces where graphene and nickel carbide coexist, pentacene shows preferential adsorption on the nickel carbide phase. The same pentacene to graphene transformation was also achieved on Cu(111), but at a higher activation temperature, producing large graphene domains that exhibit a range of moiré superlattice periodicities.

Fingerprint analysis using wavelet transform with application to compression and feature extraction

The main goal of this research is to design an efficient compression al~ gorithm for fingerprint images. The wavelet transform technique is the principal tool used to reduce interpixel redundancies and to obtain a parsimonious representation for these images. A specific fixed decomposition structure is designed to be used by the wavelet packet in order to save on the computation, transmission, and storage costs. This decomposition structure is based on analysis of information packing performance of several decompositions, two-dimensional power spectral density, effect of each frequency band on the reconstructed image, and the human visual sensitivities. This fixed structure is found to provide the "most" suitable representation for fingerprints, according to the chosen criteria. Different compression techniques are used for different subbands, based on their observed statistics. The decision is based on the effect of each subband on the reconstructed image according to the mean square criteria as well as the sensitivities in human vision. To design an efficient quantization algorithm, a precise model for distribution of the wavelet coefficients is developed. The model is based on the generalized Gaussian distribution. A least squares algorithm on a nonlinear function of the distribution model shape parameter is formulated to estimate the model parameters. A noise shaping bit allocation procedure is then used to assign the bit rate among subbands. To obtain high compression ratios, vector quantization is used. In this work, the lattice vector quantization (LVQ) is chosen because of its superior performance over other types of vector quantizers. The structure of a lattice quantizer is determined by its parameters known as truncation level and scaling factor. In lattice-based compression algorithms reported in the literature the lattice structure is commonly predetermined leading to a nonoptimized quantization approach. In this research, a new technique for determining the lattice parameters is proposed. In the lattice structure design, no assumption about the lattice parameters is made and no training and multi-quantizing is required. The design is based on minimizing the quantization distortion by adapting to the statistical characteristics of the source in each subimage. 11 Abstract Abstract Since LVQ is a multidimensional generalization of uniform quantizers, it produces minimum distortion for inputs with uniform distributions. In order to take advantage of the properties of LVQ and its fast implementation, while considering the i.i.d. nonuniform distribution of wavelet coefficients, the piecewise-uniform pyramid LVQ algorithm is proposed. The proposed algorithm quantizes almost all of source vectors without the need to project these on the lattice outermost shell, while it properly maintains a small codebook size. It also resolves the wedge region problem commonly encountered with sharply distributed random sources. These represent some of the drawbacks of the algorithm proposed by Barlaud [26). The proposed algorithm handles all types of lattices, not only the cubic lattices, as opposed to the algorithms developed by Fischer [29) and Jeong [42). Furthermore, no training and multiquantizing (to determine lattice parameters) is required, as opposed to Powell's algorithm [78). For coefficients with high-frequency content, the positive-negative mean algorithm is proposed to improve the resolution of reconstructed images. For coefficients with low-frequency content, a lossless predictive compression scheme is used to preserve the quality of reconstructed images. A method to reduce bit requirements of necessary side information is also introduced. Lossless entropy coding techniques are subsequently used to remove coding redundancy. The algorithms result in high quality reconstructed images with better compression ratios than other available algorithms. To evaluate the proposed algorithms their objective and subjective performance comparisons with other available techniques are presented. The quality of the reconstructed images is important for a reliable identification. Enhancement and feature extraction on the reconstructed images are also investigated in this research. A structural-based feature extraction algorithm is proposed in which the unique properties of fingerprint textures are used to enhance the images and improve the fidelity of their characteristic features. The ridges are extracted from enhanced grey-level foreground areas based on the local ridge dominant directions. The proposed ridge extraction algorithm, properly preserves the natural shape of grey-level ridges as well as precise locations of the features, as opposed to the ridge extraction algorithm in [81). Furthermore, it is fast and operates only on foreground regions, as opposed to the adaptive floating average thresholding process in [68). Spurious features are subsequently eliminated using the proposed post-processing scheme.

Cyclic imides and an open-chain amide carboxylic acid from the facile reaction of cis-cyclohexane-1,2-dicarboxylic anhydride with the isomeric monofluoroanilines

The structures of the cyclic imides cis-2-(2-fluorophenyl)-3a,4,5,6,7,7a-hexahydroisoindole-1,3-dione, C14H14FNO2, (I), and cis-2-(4-fluorophenyl)-3a,4,5,6,7,7a-hexahydroisoindoline-1,3-dione, C14H14FNO2, (III), and the open-chain amide acid rac-cis-2-[(3-fluorophenyl)carbamoyl]cyclohexane-1-carboxylic acid, C14H16FNO3, (II), are reported. Cyclic imides (I) and (III) are conformationally similar, with comparable ring rotations about the imide N-Car bond [the dihedral angles between the benzene ring and the five-membered isoindole ring are 55.40 (8)° for (I) and 51.83 (7)° for (III)]. There are no formal intermolecular hydrogen bonds involved in the crystal packing of either (I) or (III). With the acid (II), in which the meta-related F-atom substituent is rotationally disordered (0.784:0.216), the amide group lies slightly out of the benzene plane [the interplanar dihedral angle is 39.7 (1)°]. Intermolecular amide-carboxyl N-HO hydrogen-bonding interactions between centrosymmetrically related molecules form stacks extending down b, and these are linked across c by carboxyl-amide O-HO hydrogen bonds, giving two-dimensional layered structures which lie in the (011) plane. The structures reported here represent examples of compounds analogous to the phthalimides or phthalanilic acids and have little precedence in the crystallographic literature.

Hydrogen-bonding in cyclic imides and amide carboxylic acid derivatives from the facile reaction of cis-cyclohexane-1,2-carboxylic anhydride with o- and p-anisidine and m- and p-aminobenzoic acids

The structures of the open chain amide carboxylic acid rac-cis-[2-(2-methoxyphenyl)carbamoyl]cyclohexane-1-carboxylic acid, C15H19NO4, (I) and the cyclic imides rac-cis-2-(4-methoxyphenyl)-3a,4,5,6,7,7-hexahydroisoindole-1,3-dione,C15H17NO3, (II), chiral cis-2-(3-carboxyphenyl)-3a,4,5,6,7,7a-hexahydroisoindole-1,3-dione, C15H15NO4,(III) and rac-cis-2-(4-carboxyphenyl)- 3a,4,5,6,7,7a-hexahydroisoindole-1,3-dione monohydrate, C15H15NO4. H2O) (IV), are reported. In the amide acid (I), the phenylcarbamoyl group is essentially planar [maximum deviation from the least-squares plane = 0.060(1)Ang. for the amide O atom], the molecules form discrete centrosymmetric dimers through intermolecular cyclic carboxy-carboxy O-H...O hydrogen-bonding interactions [graph set notation R2/2(8)]. The cyclic imides (II)--(IV) are conformationally similar, with comparable phenyl ring rotations about the imide N-C(aromatic) bond [dihedral angles between the benzene and isoindole rings = 51.55(7)deg. in (II), 59.22(12)deg. in (III) and 51.99(14)deg. in (IV). Unlike (II) in which only weak intermolecular C-H...O(imide) hydrogen bonding is present, the crystal packing of imides (III) and (IV) shows strong intermolecular carboxylic acid O-H...O hydrogen-bonding associations. With (III), these involve imide O-atom acceptors, giving one-dimensional zigzag chains [graph set C(9)], while with the monohydrate (IV), the hydrogen bond involves the partially disordered water molecule which also bridges molecules through both imide and carboxyl O-atom acceptors in a cyclic R4/4(12) association, giving a two-dimensional sheet structure. The structures reported here expand the structural data base for compounds of this series formed from the facile reaction of cis-cyclohexane-1,2-dicarboxylic anhydride with substituted anilines, in which there is a much larger incidence of cyclic imides compared to amide carboxylic acids.

A simulated annealing algorithm for energy efficient virtual machine placement

Improving energy efficiency has become increasingly important in data centers in recent years to reduce the rapidly growing tremendous amounts of electricity consumption. The power dissipation of the physical servers is the root cause of power usage of other systems, such as cooling systems. Many efforts have been made to make data centers more energy efficient. One of them is to minimize the total power consumption of these servers in a data center through virtual machine consolidation, which is implemented by virtual machine placement. The placement problem is often modeled as a bin packing problem. Due to the NP-hard nature of the problem, heuristic solutions such as First Fit and Best Fit algorithms have been often used and have generally good results. However, their performance leaves room for further improvement. In this paper we propose a Simulated Annealing based algorithm, which aims at further improvement from any feasible placement. This is the first published attempt of using SA to solve the VM placement problem to optimize the power consumption. Experimental results show that this SA algorithm can generate better results, saving up to 25 percentage more energy than First Fit Decreasing in an acceptable time frame.

Modeling heat and mass transfer process during convection drying of fruit

Fruit drying is a process of removing moisture to preserve fruits by preventing microbial spoilage. It increases shelf life, reduce weight and volume thus minimize packing, storage, and transportation cost and enable storage of food under ambient environment. But, it is a complex process which involves combination of heat and mass transfer and physical property change and shrinkage of the material. In this background, the aim of this paper to develop a mathematical model to simulate coupled heat and mass transfer during convective drying of fruit. This model can be used predict the temperature and moisture distribution inside the fruits during drying. Two models were developed considering shrinkage dependent and temperature dependent moisture diffusivity and the results were compared. The governing equations of heat and mass transfer are solved and a parametric study has been done with Comsol Multiphysics 4.3. The predicted results were validated with experimental data.

Multiphysics modelling of convective drying of food materials

Currently, 1.3 billion tonnes of food is lost annually due to lack of proper processing and preservation method. Drying is one of the easiest and oldest methods of food processing which can contribute to reduce that huge losses, combat hunger and promote food security. Drying increase shelf life, reduce weight and volume of food thus minimize packing, storage, and transportation cost and enable storage of food under ambient environment. However, drying is a complex process which involves combination of heat and mass transfer and physical property change and shrinkage of the food material. Modelling of this process is essential to optimize the drying kinetics and improve energy efficiency of the process. Since material properties varies with moisture content, the models should not consider constant materials properties, constant diffusion .The objective of this paper is to develop a multiphysics based mathematical model to simulate coupled heat and mass transfer during convective drying of fruit considering variable material properties. This model can be used predict the temperature and moisture distribution inside the food during drying. Effect of different drying air temperature and drying air velocity on drying kinetics has been demonstrated. The governing equations of heat and mass transfer were solved with Comsol Multiphysics 4.3.

Thermal stability and hot-stage Raman spectroscopic study of Ca-montmorillonite modified with different surfactants : a comparative study

Three long chain cationic surfactants were intercalated into Ca-montmorillonite through ion exchangeand the obtained organoclays were characterized by X-ray diffraction (XRD), high resolution thermo-gravimetric analysis (TG) and Raman spectroscopy. The intercalation of surfactants not only changes thesurface properties of clay from hydrophilic to hydrophobic but also greatly increases the basal spacing ofthe interlayers based on XRD analysis. The thermal stability of organoclays intercalated with three sur-factants (TTAB, DTAB and CTAB) and the different arrangements of the surfactant molecules intercalatedinto Ca-montmorillonite were determined by TG-DTG analysis. A Raman spectroscopic study on the Ca-montmorillonite modified by three surfactants prepared at different concentrations provided the detailedconformational ordering of different intercalated long-chain surfactants under different conditions. Thewavenumber of the antisymmetric stretching mode is more sensitive than that of the symmetric stretch-ing mode to the mobility of the tail of the amine chain. At room temperature, the conformational orderingis more easily affected by the packing density in the lateral model. With the increase of the temperature,the positions of both the antisymmetric and symmetric stretching bands shift to higher wavenumbers,which indicates a decrease of conformational ordering. This study offers new insights into the struc-ture and properties of Ca-montmorillonite modified with different long chain surfactants. Moreover, theexperimental results confirm the potential applications of organic Ca-montmorillonites for the removalof organic impurities from aqueous media.

Bi-2223 precursor billets for pit wire production

High temperature superconductor precursor billets (feed rods) have been developed for loading into silver tubes. The billets are loaded prior to rolling or drawing operations in PIT wire manufacture. Investigations have shown that wires and tapes prepared from feed rod loaded tubes show enhanced uniformity of electrical transport properties when compared with conventional powder packing, especially in wires drawn to long lengths. Analysis on production feed rods have shown carbon content to be as low as 110 ppm. © 1999 IEEE.

Effect of dangling chains on the structure and physical properties of a tightly crosslinked poly(ethylene glycol) network

Major imperfections in crosslinked polymers include loose or dangling chain ends that lower the crosslink d., thereby reducing elastic recovery and increasing the solvent swelling. These imperfections are hard to detect, quantify and control when the network is initiated by free radical reactions. As an alternative approach, the sol-​gel synthesis of a model poly(ethylene glycol) (PEG-​2000) network is described using controlled amts. of bis- and mono-​triethoxy silyl Pr urethane PEG precursors to give silsesquioxane (SSQ, R-​SiO1.5) structures as crosslink junctions with a controlled no. of dangling chains. The effect of the no. of dangling chains on the structure and connectivity of the dried SSQ networks has been detd. by step-​crystn. differential scanning calorimetry. The role that micelle formation plays in controlling the sol-​gel PEG network connectivity has been studied by dynamic light scattering of the bis- and mono-​triethoxy silyl precursors and the networks have been characterized by 29Si solid state NMR, sol fraction and swelling measurements. These show that the dangling chains will increase the mesh size and water uptake. Compared to other end-​linked PEG hydrogels, the SSQ-​crosslinked networks show a low sol fraction and high connectivity, which reduces solvent swelling, degree of crystallinity and the crystal transition temp. The increased degree of freedom in segment movement on the addn. of dangling chains in the SSQ-​crosslinked network facilitates the packing process in crystn. of the dry network and, in the hydrogel, helps to accommodate more water mols. before reaching equil.

A comparative study of the semi-elastic and fully-elastic MapReduce models

MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation in cloud computing. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NP-complete. Thus, in this paper we propose a new heuristic algorithm for the mappers/reducers placement problem in cloud computing and evaluate it by comparing with other several heuristics on solution quality and computation time by solving a set of test problems with various characteristics. The computational results show that our heuristic algorithm is much more efficient than the other heuristics and it can obtain a better solution in a reasonable time. Furthermore, we verify the effectiveness of our heuristic algorithm by comparing the mapper/reducer placement for a benchmark problem generated by our heuristic algorithm with a conventional mapper/reducer placement which puts a fixed number of mapper/reducer on each machine. The comparison results show that the computation using our mapper/reducer placement is much cheaper than the computation using the conventional placement while still satisfying the computation deadline.

A more efficient and effective heuristic algorithm for the MapReduce placement problem in cloud computing

The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation in cloud computing. From the computational point of view, the mappers/reducers placement problem is a generalization of the classical bin packing problem, which is NP-complete. Thus, in this paper we propose a new heuristic algorithm for the mappers/reducers placement problem in cloud computing and evaluate it by comparing with other several heuristics on solution quality and computation time by solving a set of test problems with various characteristics. The computational results show that our heuristic algorithm is much more efficient than the other heuristics. Also, we verify the effectiveness of our heuristic algorithm by comparing the mapper/reducer placement for a benchmark problem generated by our heuristic algorithm with a conventional mapper/reducer placement. The comparison results show that the computation using our mapper/reducer placement is much cheaper while still satisfying the computation deadline.

A new grouping genetic algorithm for the MapReduce placement problem in cloud computing

MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NPcomplete. Thus, in this paper we propose a new grouping genetic algorithm for the mappers/reducers placement problem in cloud computing. Compared with the original one, our grouping genetic algorithm uses an innovative coding scheme and also eliminates the inversion operator which is an essential operator in the original grouping genetic algorithm. The new grouping genetic algorithm is evaluated by experiments and the experimental results show that it is much more efficient than four popular algorithms for the problem, including the original grouping genetic algorithm.