Artinian cofinite modules over complete Noetherian local rings

Let (R, m) be a complete Noetherian local ring, I an ideal of R and M a nonzero Artinian R-module. In this paper it is shown that if p is a prime ideal of R such that dim R/p = 1 and (0:M p) is not finitely generated and for each i ? 2 the R-module Ext _R ⁱ (M,R/p) is of finite length, then the R-module Ext _R ¹ (M, R/p) is not of finite length. Using this result, it is shown that for all finitely generated R-modules N with Supp(N) ? V (I) and for all integers i ? 0, the R-modules Ext _R ⁱ (N,M) are of finite length, if and only if, for all finitely generated R-modules N with Supp(N) ? V (I) and for all integers i ? 0, the R-modules Ext _R ⁱ (M,N) are of finite length.     

Newtonian and Shear-thinning Taylor flow heat transfer in wavy micro-tubes: a numerical study

Meccanica - In the present study, the two-phase gas–liquid convective heat transfer is numerically studied inside uniformly heated wavy micro-tubes in the Taylor flow regime. Both Newtonian...     

From inflation to acceleration,with phantom and canonical scalar fields in non-flat universe

Motivated by the recent work of Elizalde et al. [E. Elizalde, S. Nojiri, S.D. Odintsov, D. Saez–Gomez, V. Faraoni, Phys. Rev. D 77 (2008) 106005], we generalize their work to the non-flat case. We consider a universe filled with matter and show that it is possible to obtain both inflation and accelerated expansion at late times by using a single scalar field. Realistic examples are worked out in order to illustrate this fact. Then we extend the problem to the interacting case.     

An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers

This article presents an exact algorithm for the precedence-constrained traveling salesman problem, which is also known as the sequential ordering problem. This NP-hard problem has applications in various domains, including operational research and compilers. In this article, the problem is presented and solved in the context of minimizing switching energy in compilers. Most previous work on minimizing switching energy in the compiler domain has been limited to simple heuristics that are not guaranteed to give an optimal solution. In this work, we present an exact algorithm for solving the switching energy minimization problem using a branch-and-bound approach. The proposed algorithm is simple and intuitive, yet powerful. It is the first exact algorithm for the switching energy problem that is shown to solve real instances of the problem within a few seconds per instance. Compared to previous work in the operational research domain, the proposed algorithm is believed to be the most powerful exact algorithm that does not require a linear programming formulation. The proposed algorithm is experimentally evaluated using instances taken from a production compiler. The results show that with a time limit of 10 ms per node, the proposed algorithm optimally solves 99.8 % of the instances. It optimally solves instances with up to 598 nodes within a few seconds. The resulting switching cost is 16 % less than that produced without energy awareness and 5 % less than that produced by a commonly used heuristic.     

An ant colony algorithm for the pos/neg weighted p-median problem

Let a graph G = (V, E) with vertex set V and edge set E be given. The classical graph version of the p-median problem asks for a subset of cardinality p, so that the (weighted) sum of the minimum distances from X to all other vertices in V is minimized. We consider the semi-obnoxious case, where every vertex has either a positive or a negative weight. This gives rise to two different objective functions, namely the weighted sum of the minimum distances from X to the vertices in V\X and, differently, the sum over the minimum weighted distances from X to V\X. In this paper an Ant Colony algorithm with a tabu restriction is designed for both problems. Computational results show its superiority with respect to a previously investigated variable neighborhood search and a tabu search heuristic.This research has partially been supported by the Spezialforschungsbereich F 003 “Optimierung und Kontrolle”, Projektbereich Diskrete Optimierung.     

An efficient PDF calculation of flame temperature and major species in turbulent non-premixed flames

In spite of recent developments in the PDF calculations of turbulent flames, the high computational time required to implement PDF simulations makes it intractable in practical applications. Therefore, it is important to design and select different parameters for PDF calculation of most important quantities, i.e. temperature and major species means, in an efficient manner. The ingredients of the present model are a standard k$k$–ε$\epsilon$ turbulence closure for modeling flow field and a joint composition PDF closure for the scalar fields. A modified Curl model is applied to consider molecular mixing in PDF transport equation and a simplified two-step mechanism which lowers the computational cost is incorporated to describe the chemistry. The flow field is solved numerically using an upwind discretization for the convective terms and a central discretization for the diffusion terms by coupling it with an Eulerian Monte Carlo algorithm to solve PDF transport equation. To show the superiority of the current PDF calculations over traditional moment-closure methods commonly used in practical applications, simulation is also performed by RANS method which shows large discrepancies, especially in prediction of maximum flame temperature (on the basis of present results, predicted flame temperature has 26%$26\%$ error via RANS method and 8%$8\%$ error via PDF method). Stoichiometric flame length predicted by RANS has 10%$10\%$ error while, by PDF method, this error is negligible and about 0.6%$0.6\%$. The effect of coefficient _CΦ$C_{\Phi }$ on the modified Curl model is also investigated and it is concluded that the commonly used value _CΦ=2.0$C_{\Phi }=2.0$ is the best choice for the case of study. The numerical results obtained reveal that Westbrook–Drier mechanism is working very well in fuel-lean (F<_Fst$F<F_{\mathit{st}}$) non-premixed combustion and also it predicts the total heat released in methane combustion in a very good agreement with the experiment.     

Bone regeneration based on nano-hydroxyapatite and hydroxyapatite/chitosan nanocomposites: an in vitro and in vivo comparative study

Surface morphology, surface wettability, and size distribution of biomaterials affect their in vitro and in vivo bone regeneration potential. Since nano-hydroxyapatite has a great chemical and structural similarity to natural bone and dental tissues, incorporated biomaterial of such products could improve bioactivity and bone bonding ability. In this research, nano-hydroxyapatite (23 ± 0.09 nm) and its composites with variety of chitosan content [2, 4, and 6 g (45 ± 0.19, 32 ± 0.12, and 28 ± 0.12 nm, respectively)] were prepared via an in situ hybridization route. Size distribution of the particles, protein adsorption, and calcium deposition of powders by the osteoblast cells, gene expression and percentage of new bone formation area were investigated. The highest degree of bone regeneration potential was observed in nano-hydroxyapatite powder, while the bone regeneration was lowest in nano-hydroxyapatite with 6 g of chitosan. Regarding these data, suitable size distribution next to size distribution of hydroxyapatite in bone, smaller size, higher wettability, lower surface roughness of the nano-hydroxyapatite particles and homogeneity in surface resulted in higher protein adsorption, cell differentiation and percentage of bone formation area. Results obtained from in vivo and in vitro tests confirmed the role of surface morphology, surface wettability, mean size and size distribution of biomaterial besides surface chemistry as a temporary bone substitute.