Numerical evaluation on thermal–hydraulic characteristics of dilute heat-dissipating nanofluids flow in microchannels

The present work deals with numerical investigations on heat transfer characteristics and friction factor of aqueous CuO nanofluids flow in a set of four microchannels connected in parallel under laminar regime. For each single phase, volume of fluid, mixture and Eulerian models, a particular computer code is developed to carefully simulate this problem. The three-dimensional steady-state governing equations are solved through finite volume method. The primary aim of this study is to comparatively distinguish the most appropriate and accurate model for numerical studies of nanofluids in microchannels. The results are compared with one another and the data obtained from an experimental work. Regarding the results, an acceptable consistency is observed for all models with the experimental data. The current study truly demonstrates that applying single-phase model to simulate and evaluate the laminar flow of CuO–water nanofluid inside microchannels with uniform wall temperature is more modest, precise and reliable compared with two-phase models.

     

Capable Lie algebras with the derived subalgebra of dimension 2 over an arbitrary field

In this paper, we classify all capable nilpotent Lie algebras with the derived subalgebra of dimension 2 over an arbitrary field. Moreover, the explicit structure of such Lie algebras of class 3 is given.     

Circular chromatic index of graphs of maximum degree 3

This paper proves that if G is a graph (parallel edges allowed) of maximum degree 3, then χ′_c(G) ≤ 11/3 provided that G does not contain H₁ or H₂ as a subgraph, where H₁ and H₂ are obtained by subdividing one edge of K (the graph with three parallel edges between two vertices) and K₄, respectively. As χ′_c(H₁) = χ′_c(H₂) = 4, our result implies that there is no graph G with 11/3 < χ′_c(G) < 4. It also implies that if G is a 2‐edge connected cubic graph, then χ′_c(G) ≤ 11/3. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 325–335, 2005     

A fuzzy shortest path with the highest reliability

This paper concentrates on a shortest path problem on a network where arc lengths (costs) are not deterministic numbers, but imprecise ones. Here, costs of the shortest path problem are fuzzy intervals with increasing membership functions, whereas the membership function of the total cost of the shortest path is a fuzzy interval with a decreasing linear membership function. By the max–min criterion suggested in [R.E. Bellman, L.A. Zade, Decision-making in a fuzzy environment, Management Science 17B (1970) 141–164], the fuzzy shortest path problem can be treated as a mixed integer nonlinear programming problem. We show that this problem can be simplified into a bi-level programming problem that is very solvable. Here, we propose an efficient algorithm, based on the parametric shortest path problem for solving the bi-level programming problem. An illustrative example is given to demonstrate our proposed algorithm.     

Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations

We consider stochastic programs where the distribution of the uncertain parameters is only observable through a finite training dataset. Using the Wasserstein metric, we construct a ball in the space of (multivariate and non-discrete) probability distributions centered at the uniform distribution on the training samples, and we seek decisions that perform best in view of the worst-case distribution within this Wasserstein ball. The state-of-the-art methods for solving the resulting distributionally robust optimization problems rely on global optimization techniques, which quickly become computationally excruciating. In this paper we demonstrate that, under mild assumptions, the distributionally robust optimization problems over Wasserstein balls can in fact be reformulated as finite convex programs—in many interesting cases even as tractable linear programs. Leveraging recent measure concentration results, we also show that their solutions enjoy powerful finite-sample performance guarantees. Our theoretical results are exemplified in mean-risk portfolio optimization as well as uncertainty quantification.

     

Exact and approximation product solutions form of heat equation with nonlocal boundary conditions using Ritz–Galerkin method with Bernoulli polynomials basis

In this article, a new method is introduced for finding the exact solution of the product form of parabolic equation with nonlocal boundary conditions. Approximation solution of the present problem is implemented by the Ritz–Galerkin method in Bernoulli polynomials basis. The properties of Bernoulli polynomials are first presented, then Ritz–Galerkin method in Bernoulli polynomials is used to reduce the given differential equation to the solution of algebraic equations. Illustrative examples are included to demonstrate the validity and applicability of the techniques presented in this article for finding the exact and approximation solutions. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1143–1158, 2017     

Hydrodynamics and oxygen mass transfer in a packed bed split-cylinder airlift reactor containing dilute alcoholic solutions

In this article, the influences of alcohols on the hydrodynamics and oxygen mass transfer characteristics in an airlift reactor equipped with packing were investigated. The hydrodynamic parameters and mass transfer coefficient in 1 % (v/v) aqueous solutions of four aliphatic alcohols were tested. It was concluded that alcohols addition increased gas holdup and gas–liquid mass transfer coefficient. The packing installation increased mass transfer coefficient, gas holdup and liquid circulation velocity, as well.     

FIXED POINT RESULTS ON METRIC-TYPE SPACES

In this paper we obtain fixed point and common fixed point theorems for self- mappings defined on a metric-type space, an ordered metric-type space or a normal cone metric space. Moreover, some examples and an application to integral equations are given to illustrate the usability of the obtained results.