Effect of reinforcement on the barrier and dielectric properties of epoxidized natural rubber–graphene nanocomposites

The influence of epoxidation level of natural rubber (i.e., ENR25, ENR50) on the dielectric and oxygen gas barrier properties of thermally reduced graphene oxide (GR) and graphite (GT) (with 2%·w/w) filled nanocomposites are investigated here. GR, GT filled epoxidized natural rubber (ENR) nanocomposites were fabricated by mechanical mixing using environment friendly two‐roll mill mixing method. Raman spectroscopy and Fourier transform infrared spectroscopy studies were carried out to investigate the extent of chemical interactions between GR and ENR. Morphological studies were done using transmission electron microscopy to evaluate the distribution of GR and GT in the ENR. The improved gas barrier and dielectric properties of GT‐ENR and GR–ENR composites synthesized by a novel green ecofriendly method is correlated with the chemical interactions among GT, GR, and ENR. POLYM. ENG. SCI., 55:2439–2447, 2015. © 2015 Society of Plastics Engineers     

A fuzzy approach to transport optimization problem

This paper presents an algorithm to solve a fuzzy transportation problem in which demand, supply and transportation costs are uncertain. Existing solution methods convert a fuzzy transportation problem into two or more crisp transportation problems and solves it. But, the proposed algorithm solves a fuzzy transportation problem without converting it into a crisp transportation problem. This approach results in a fuzzy total transportation cost, which is a fuzzy number. Sudhagar score method is used to rank fuzzy numbers. In comparing results of existing methods with the proposed method, this algorithm outperforms the previous ones. Two numerical examples explain working procedure of the proposed algorithm.     

Optimal Technology Selection and Operation of Commercial-Building Microgrids

The deployment of small ( ${≪}1hbox{--}2$ MW) clusters of generators, heat and electrical storage, efficiency investments, and combined heat and power (CHP) applications (particularly involving heat-activated cooling) in commercial buildings promises significant benefits but poses many technical and financial challenges, both in system choice and its operation; if successful, such systems may be precursors to widespread microgrid deployment. The presented optimization approach to choosing such systems and their operating schedules uses Berkeley Lab's Distributed Energy Resources Customer Adoption Model (DER-CAM), extended to incorporate electrical and thermal storage options. DER-CAM chooses annual energy bill minimizing systems in a fully technology-neutral manner. An illustrative example for a hypothetical San Francisco hotel is reported. The chosen system includes one large reciprocating engine and an absorption chiller providing an estimated 11% cost savings and 8% carbon emission reductions under idealized circumstances.      

On the cubicity of bipartite graphs

A unit cube in k-dimension (or a k-cube) is defined as the Cartesian product R₁×R₂×?×Rk, where each Ri is a closed interval on the real line of the form [ai,ai+1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. Many NP-complete graph problems can be solved efficiently or have good approximation ratios in graphs of low cubicity. In most of these cases the first step is to get a low dimensional cube representation of the given graph.It is known that for a graph G, . Recently it has been shown that for a graph G, cub(G)?4(Δ+1)lnn, where n and Δ are the number of vertices and maximum degree of G, respectively. In this paper, we show that for a bipartite graph G=(A∪B,E) with |A|=n₁, |B|=n₂, n₁?n₂, and Δ^′=min{ΔA,ΔB}, where ΔA=maxa∈Ad(a) and ΔB=maxb∈Bd(b), d(a) and d(b) being the degree of a and b in G, respectively, cub(G)?2(Δ^′+2)⌈lnn₂⌉. We also give an efficient randomized algorithm to construct the cube representation of G in 3(Δ^′+2)⌈lnn₂⌉ dimensions. The reader may note that in general Δ^′ can be much smaller than Δ.     

Prioritization of satellite-derived potential fishery grounds: an analytical hierarchical approach-based model using spatial and non-spatial data

Forecast of potential fishing grounds can save considerable amounts of fuel and time involved in marine fishing operations, making the operation more profitable. This study investigates the prospects of using a decision support system for forecasting potential fishery zones and prioritizing them according to profitability using multi-criteria analysis. Ocean Colour Monitor-derived chlorophyll concentration and National Oceanic and Atmospheric Administration Advanced Very High Resolution Radiometer-derived sea surface temperature maps were integrated to demarcate the potential fishery zones (PFZs). QuickSCAT (NASA) scatterometer wind data obtained from the global 25 km × 25 km gridded dataset were used for updating the locations of PFZ features. An analytical hierarchy process-based prioritization model, which considers different parameters favouring a targeted species, distance to the zone and historical catch per unit effort as the major decision-making parameters, was used to rank the zones based on feasibility. A software package was developed incorporating the above-mentioned functionalities for automatic data processing and PFZ map generation.     

Tile Complexity of Approximate Squares

The standard Tile Assembly Model (TAM) of Winfree (Algorithmic self-assembly of DNA, Ph.D. thesis, 1998) is a mathematical theory of crystal aggregations via monomer additions with applications to the emerging science of DNA self-assembly. Self-assembly under the rules of this model is programmable and can perform Turing universal computation. Many variations of this model have been proposed and the canonical problem of assembling squares has been studied extensively. We consider the problem of building approximate squares in TAM. Given any $\varepsilon \in (0,\frac{1}{4}]$ we show how to construct squares whose sides are within (1±ε)N of any given positive integer N using $O( \frac{\log \frac{1}{\varepsilon}}{\log \log\frac{1}{\varepsilon}} + \frac{\log \log \varepsilon N}{\log \log \log \varepsilon N} )$ tile types. We prove a matching lower bound by showing that $\varOmega( \frac{\log \frac{1}{\varepsilon}}{\log \log\frac{1}{\varepsilon}} + \frac{\log \log \varepsilon N}{\log \log \log \varepsilon N} )$ tile types are necessary almost always to build squares of required approximate dimensions. In comparison, the optimal construction for a square of side exactly N in TAM uses $O(\frac{\log N}{\log \log N})$ tile types. The question of constructing approximate squares has been recently studied in a modified tile assembly model involving concentration programming. All our results are trivially translated into the concentration programming model by assuming arbitrary (non-zero) concentrations for our tile types. Indeed, the non-zero concentrations could be chosen by an adversary and our results would still hold. Our construction can get highly accurate squares using very few tile types and are feasible starting from values of N that are orders of magnitude smaller than the best comparable constructions previously suggested. At an accuracy of ε=0.01, the number of tile types used to achieve a square of size 10⁷ is just 58 and our constructions are proven to work for all N≥13130. If the concentrations of the tile types are carefully chosen, we prove that our construction assembles an L×L square in optimal assembly time O(L) where (1?ε)N≤L≤(1+ε)N.     

The fuzzy Hough transform-feature extraction in medical images

Identification of anatomical features is a necessary step for medical image analysis. Automatic methods for feature identification using conventional pattern recognition techniques typically classify an object as a member of a predefined class of objects, but do not attempt to recover the exact or approximate shape of that object. For this reason, such techniques are usually not sufficient to identify the borders of organs when individual geometry varies in local detail, even though the general geometrical shape is similar. The authors present an algorithm that detects features in an image based on approximate geometrical models. The algorithm is based on the traditional and generalized Hough Transforms but includes notions from fuzzy set theory. The authors use the new algorithm to roughly estimate the actual locations of boundaries of an internal organ, and from this estimate, to determine a region of interest around the organ. Based on this rough estimate of the border location, and the derived region of interest, the authors find the final (improved) estimate of the true borders with other (subsequently used) image processing techniques. They present results that demonstrate that the algorithm was successfully used to estimate the approximate location of the chest wall in humans, and of the left ventricular contours of a dog heart obtained from cine-computed tomographic images. The authors use this fuzzy Hough transform algorithm as part of a larger procedure to automatically identify the myocardial contours of the heart. This algorithm may also allow for more rapid image processing and clinical decision making in other medical imaging applications.     

Stratification effects on transient Stokes flow in the presence of a permeable boundary

The transient unbounded flow of a stratified viscous fluid over an oscillating permeable boundary has been considered. The viscosity and the density of the fluid have been assumed to decay exponentially in the direction normal to the bounding permeable wall. The initial value problem associated with the resulting diffusion equation, subject to the Beavers-Joseph boundary condition, has been solved analytically. The solution for the transient velocity has been expressed in terms of error and exponential functions of complex arguments. The effects of fluid stratification and the bounding porous medium on the fluid velocity have been analyzed.