Prediction of flow stress at hot working condition

A mathematical model has been developed to determine flow stress at hot deformation condition. The proposed model is capable of including work softening due to dynamic phase transformations as well as the effect of temperature and strain rate variation on flow stress utilizing the additivity rule for strain. To verify the model, hot compression tests for two grades of steels has been carried out. The comparison between the experimental and theoretical results confirms the validity of the model.     

Total Synthesis of Albicidin: A Lead Structure from Xanthomonas albilineans for Potent Antibacterial Gyrase Inhibitors

The peptide antibiotic albicidin, which is synthesized by the plant pathogenic bacterium Xanthomonas albilineans, displays remarkable antibacterial activity against various Gram‐positive and Gram‐negative microorganisms. The low amounts of albicidin obtainable from the producing organism or through heterologous expression are limiting factors in providing sufficient material for bioactivity profiling and structure–activity studies. Therefore, we developed a convergent total synthesis route toward albicidin. The unexpectedly difficult formation of amide bonds between the aromatic amino acids was achieved through a triphosgene‐mediated coupling strategy. The herein presented synthesis of albicidin confirms the previously determined chemical structure and underlines the extraordinary antibacterial activity of this compound. The synthetic protocol will provide multigram amounts of albicidin for further profiling of its drug properties.     

Constrained kernelized partial least squares

Nonlinear kernel methods have been widely used to deal with nonlinear problems in latent variable methods. However, in the presence of structured noise, these methods have reduced efficacy. We have previously introduced constrained latent variable methods that make use of any available additional knowledge about the structured noise. These methods improve performance by introducing additional constraints into the algorithm. In this paper, we build upon our previous work and introduce hard‐constrained and soft‐constrained nonlinear partial least squares methods using nonlinear kernels. The addition of nonlinear kernels reduces the effects of structured noise in nonlinear spaces and improves the regression performance between the input and response variables. Copyright © 2014 John Wiley & Sons, Ltd.     

Characterizing local rings via homological dimensions and regular sequences

Let (R,m) be a Noetherian local ring of depth d and C a semidualizing R-complex. Let M be a finite R-module and t an integer between 0 and d. If the G_C-dimension of M/aM is finite for all ideals a generated by an R-regular sequence of length at most d−t then either the G_C-dimension of M is at most t or C is a dualizing complex. Analogous results for other homological dimensions are also given.     

Finite element implementation of boundary conditions for the pressure Poisson equation of incompressible flow

In this paper we address the problem of the implementation of boundary conditions for the derived pressure Poisson equation of incompressible flow. It is shown that the direct Galerkin finite element formulation of the pressure Poisson equation automatically satisfies the inhomogeneous Neumann boundary conditions, thus avoiding the difficulty in specifying boundary conditions for pressure. This ensures that only physically meaningful pressure boundary conditions consistent with the Navier-Stokes equations are imposed. Since second derivatives appear in this formulation, the conforming finite element method requires C¹ continuity. However, for many problems of practical interest (i.e. high Reynolds numbers) the second derivatives need not be included, thus allowing the use of more conventional C⁰ elements. Numerical results using this approach for a wall-driven contained flow within a square cavity verify the validity of the approach. Although the results were obtained for a two-dimensional problem using the p-version of the finite element method, the approach presented here is general and remains valid for the conventional h-version as well as three-dimensional problems.     

A generalization of Eagon–Reiner’s theorem and a characterization of bi-CMt bipartite and chordal graphs

We give a generalization of Eagon-Reiner’s theorem relating Betti numbers of the Stanley-Reisner ideal of a simplicial complex and the CM_t property of its Alexander dual. Then we characterize bi-CM_t bipartite graphs and bi-CM_t chordal graphs. These are generalizations of recent results due to Herzog and Rahimi.     

A framework of irregularity enlightenment for data pre-processing in data mining

Irregularities are widespread in large databases and often lead to erroneous conclusions with respect to data mining and statistical analysis. For example, considerable bias is often resulted from many parameter estimation procedures without properly handling significant irregularities. Most data cleaning tools assume one known type of irregularity. This paper proposes a generic Irregularity Enlightenment (IE) framework for dealing with the situation when multiple irregularities are hidden in large volumes of data in general and cross sectional time series in particular. It develops an automatic data mining platform to capture key irregularities and classify them based on their importance in a database. By decomposing time series data into basic components, we propose to optimize a penalized least square loss function to aid the selection of key irregularities in consecutive steps and cluster time series into different groups until an acceptable level of variation reduction is achieved. Finally visualization tools are developed to help analysts interpret and understand the nature of data better and faster before further data modeling and analysis.     

Influence of Compatibilizer-Type and Processing Approach on the Dispersion of OMMT in High-Density Polyethylene Matrix

High-density polyethylene/organoclay nanocomposites were prepared via melt intercalation in an internal mixer using both a direct mixing and master batching method. Two types of maleic anhydride grafted polyethylene, high-density polyethylene grafted maleic anhydride, and linear low-density polyethylene grafted maleic anhydride, (HDPE-g-MA, LLDPE-g-MA) were used as compatibilizers to enhance the dispersibility of nanoclay in HDPE. Dispersion of organoclay in the nanocomposites was characterized by using X-ray diffraction (XRD), transmission electron microscopy (TEM), and rheological mechanical spectroscopy (RMS). Effects of clay content and degree of clay dispersion on the rheological and tensile properties were also investigated. Furthermore, the effect of order of mixing on the dispersion and distribution of the clay layers was studied. The obtained results showed that organoclay in the nanocomposites were dispersed homogeneously and exfoliated better when HDPE-g-MA and the direct mixing route were used. Although in the master batching method clay intercalated better, clay layers chiefly remain in compatibilizer rich areas. On the other hand, direct mixing was observed to lead to clay particles being dispersed in the HDPE matrix or at the interface of the matrix and compatibilizer and, consequently, better improvement in the tensile modulus was achieved. It was determined that the compatibilizer with the higher miscibility with the matrix was the key factor for achieving better exfoliation of clay sheets.     

A New Construction for Cohen–Macaulay Graphs

Let G be a finite simple graph on a vertex set V(G) = {x ₁₁,…, x _n1}. Also let m ₁,…, m _n  ≥ 2 be integers and G ₁,…, G _n be connected simple graphs on the vertex sets V(G _i ) = {x _i1,…, x _{im i} }. In this article, we provide necessary and sufficient conditions on G ₁,…, G _n for which the graph obtained by attaching the G _i to G is unmixed or vertex decomposable. Then we characterize Cohen–Macaulay and sequentially Cohen–Macaulay graphs obtained by attaching the cycle graphs or connected chordal graphs to arbitrary graphs.