A generalized scheme for mapping parallel algorithms

A generalized mapping strategy that uses a combination of graph theory, mathematical programming, and heuristics is proposed. The authors use the knowledge from the given algorithm and the architecture to guide the mapping. The approach begins with a graphical representation of the parallel algorithm (problem graph) and the parallel computer (host graph). Using these representations, the authors generate a new graphical representation (extended host graph) on which the problem graph is mapped. An accurate characterization of the communication overhead is used in the objective functions to evaluate the optimality of the mapping. An efficient mapping scheme is developed which uses two levels of optimization procedures. The objective functions include minimizing the communication overhead and minimizing the total execution time which includes both computation and communication times. The mapping scheme is tested by simulation and further confirmed by mapping a real world application onto actual distributed environments     

On the network effect in Web 2.0 applications

In recent years, the proliferation of the world wide web has lead to an increase in a number of applications such as search, social networks and auctions, whose success depends critically upon the number of users of that service. Two examples of such applications are internet auctions and social networks. One of the characteristics of online auctions is that a successful implementation requires a high volume of buyers and sellers at its website. Consequently, auction sites which have a high volume of traffic have an advantage over those in which the volume is limited. This results in even greater polarization of buyers and sellers towards a particular site. The same is true for social networks in which greater use of a given social network increases the use from other participants on the network. This is often referred to as the “network effect” in a variety of interaction-centric applications in networks. While this effect has qualitatively been known to increase the value of the overall network, its effect has never been modeled or studied rigorously. In this paper, we construct a Markov model to analyze the network effect in the case of two important classes of web applications. These correspond to auctions and social networks. We show that the network effect is very powerful and can result in a situation in which an auction or a social networking site can quickly overwhelm its competing sites. Thus, the results of this paper show the tremendous power of the network effect for Web 2.0 applications.     

Computation of surface orientation and structure of objects using grid coding

In this correspondence, algorithms are introduced to infer surface orientation and structure of visible object surfaces using grid coding. We adopt the active lighting technique to spatially ``encode' the scene for analysis. The observed objects, which can have surfaces of arbitrary shape, are assumed to rest on a plane (base plane) in a scene which is ``encoded' with light cast through a grid plane. Two orthogonal grid patterns are used, where each pattern is obtained with a set of equally spaced stripes marked on a glass pane. The scene is observed through a camera and the object surface orientation is determined using the projected patterns on the object surface. If the surfaces under consideration obey certain smoothness constraints, a dense orientation map can be obtained through proper interpolation. The surface structure can then be recovered given this dense orientation map. Both planar and curved surfaces can be handled in a uniform manner. The algorithms we propose yield reasonably accurate results and are relatively tolerant to noise, especially when compared to shape-from-shading techniques. In contrast to other grid coding techniques reported which match the grid junctions for depth reconstruction under the stereopsis principle, our techniques use the direction of the projected stripes to infer local surface orientation and do not require any correspondence relationship between either the grid lines or the grid junctions to be specified. The algorithm has the ability to register images and can therefore be embedded in a system which integrates knowledge from multiple views.     

Parallel 2-d convolution on a mesh connected array processor

In this correspondence, a parallel 2-D convolution scheme is presented. The processing structure is a mesh connected array processor consisting of the same number of simple processing elements as the number of pixels in the image. For most windows considered, the number of computation steps required is the same as that of the coefficients of a convolution window. The proposed scheme can be easily extended to convolution windows of arbitrary size and shape. The basic idea of the proposed scheme is to apply the 1-D systolic concept to 2-D convolution on a mesh structure. The computation is carried out along a path called a convolution path in a systolic manner. The efficiency of the scheme is analyzed for windows of various shapes. The ideal convolution path is a Hamiltonian path ending at the center of the window, the length of which is equal to the number of window coefficients. The simple architecture and control strategy make the proposed scheme suitable for VLSI implementation.     

Diels-alder adducts from safflower oil fatty acids: I. Maleic anhydride as dienophile

The Diels-Alder reaction between alkali conjugated and elaidinized safflower oil fatty acids and maleic anhydride was studied under various experimental conditions. The principal product which was obtained in 51–55% yields was a mixture of the adduct of maleic anhydride and maleic acid in 40∶60 proportions. The isolation and properties of this mixed adducts from the reaction mixture and their conversion to trimethyl, tributyl and triallyl esters are described. The trimethyl ester was also obtained in good yield from the methyl esters of the fatty acids and dimethyl maleate.     

Synthesis of ethyl propionate catalyzed by poly(N‐AEAAm‐co‐AAc)‐cl‐MBAm hydrogel‐immobilized lipase of Bacillus coagulans MTCC‐6375

A purified alkaline thermotolerant bacterial lipase of Bacillus coagulans MTCC‐6375 was efficiently immobilized onto poly(N‐AEAAm‐co‐AAc‐cl‐MBAm)‐hydrogel at pH 8.5 and at temperature 55°C in 16 h. The hydrogel‐bound matrix possessed 1.04 U/g (matrix) lipase activity with a specific activity of 1.8 U/mg of protein. The immobilized lipase resulted in formation of 52.5 mM of ethyl propionate (52% conversion) at 55°C in 9 h in n‐nonane. Ethanol and propionic acid when used in a ratio of 300 : 100 mM, respectively, in n‐nonane along with 10 mg of hydrogel‐bound lipase resulted in optimal synthesis of ethyl propionate (82.5 mM). Addition of molecular sieves (3 Å, 0.7 g/reaction volume) further enhanced the conversion rate to 82.4% resulting in 83.5 mM of ethyl propionate. Incubation temperature below or above 55°C had a marked effect on the synthesis of ethyl propionate. However, esterification performed in n‐heptane at 65°C resulted in 87.5 mM of ethyl propionate with a conversation rate of 89.3%. © 2007 Wiley Periodicals, Inc. J Appl Polym Sci 2007     

Rheological characteristics of coal tar and petroleum pitches with and without additives

An extensive study of rheological characteristics of coal tar and petroleum pitches with and without additives, namely, petroleum coke, natural graphite and carbon black has been made. It is found that all pitches, pure or mixed with a carbon additive are not Newtonian as reported in the literature, but behave Theologically as Bingham plastics with certain yield stress and plastic viscosity at all temperatures of measurement between 85–180°C. The yield stress and plastic viscosity both decrease with increase in temperature of the pitch. A pure petroleum pitch having the same softening point as that of a coal tar pitch is found to have a lower viscosity compared to that of the latter at all temperatures of measurement. This suggests that the criterion of softening point as a measure of suitability of a coal tar pitch binder in the manufacture of artificial carbon is not sufficient for petroleum pitches. Addition of ten parts of carbon black by weight of pitch results in a considerable decrease in viscosity change with temperature of the coal tar pitch compared to almost insignificant change in the case of the petroleum pitch of the same softening point. However, the addition of petroleum coke or natural graphite makes the pitch more viscous but does not change the temperature dependence of viscosity of either of the two types of pitches. The implications are discussed.     

Diels-alder adducts from safflower fatty acids: III. Acrylic and related acid dienophiles

The Diels-Alder adducts from alkali conjugated and elaidinized safflower fatty acids with acrylic, methacrylic, crotonic and cinnamic acids and their esters as dienophiles were obtained in 40–64% yields. Low yields of 16–18% were obtained when 10-undecenoic acid and its ester were used. Most of the adducts could be estimated quantitatively in the reaction products by column chromatography or gas liquid chromatography (GLC). For the estimation of the adducts from crotonic and 10-undecenoic acids a combination of column chromatography and GLC techniques was employed. Partitioning between hexane and 90% methanol, partial esterification with alkali washing, and splitting and fractional distillation under reduced pressure were methods used to obtain the adducts in 90–95% purity.     

On the applicability of diploid genetic algorithms in dynamic environments

Diploid genetic algorithms (DGAs) promise robustness as against simple genetic algorithms which only work towards optimization. Moreover, these algorithms outperform others in dynamic environments. The work examines the theoretical aspect of the concept by examining the existing literature. The present work takes the example of dynamic TSP to compare greedy approach, genetic algorithms and DGAs. The work also implements a greedy genetic approach for the problem. In the experiments carried out, the three variants of dominance were implemented and 115 runs proved the point that none of them outperforms the other.