In this study, cooling of a hot obstacle in a rectangular cavity filled with water-CuO nanolfuid has been examined numerically. This cavity has an inlet and outlet and the cold nanofuid comes from the left side of the cavity and after cooling the hot obstacle, it goes out from the opposite site. All of the walls are insulated, and the SIMPLER algorithm has been employed for solving the governin...

The increasing population of elders in the near future, and their expectations for a independent, safe and in-place living require new practical systems and technologies to fulfil their demands in sustainable ways. This paper presents our own reflection on the great relevance of FQAS’ main topics for recent developments on the context of Home Assistance. We show how those developments employ se...

Land change science has demonstrated that rural livelihoods around the world both drive and reflect changing environmental regimes and political economic/ structural transformations. This article explores the relationship between increasingly globalized rural livelihoods and in-place land change, assessing results from social surveys of smallholding households in the southern Yucatán region. We...

................................................................................................................. XII

Given a rectangular m × n matrix stored as a two-dimensional array, we want to transpose it in place andmeasure the cost by the number of memory writes and the number of auxiliary cells used. We propose a transposition algorithm with optimal complexity O(mn) using only min(m, n) auxiliary memory cells. © 2009 Elsevier Inc. All rights reserved.

In this paper, we consider the problem of designing in-place algorithms for computing the maximum area empty rectangle of arbitrary orientation among a set of points in 2D, and the maximum volume empty axisparallel cuboid among a set of points in 3D. If n points are given in an array of size n, the worst case time complexity of our proposed algorithms for both the problems is O(n); both the alg...

An in-place algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. In this paper we describe three in-place algorithms for computing the convex hull of a planar point set. All three algorithms are optimal, some more so than others. . .

We present a new Algorithm for In-Place Rectangular Transposition of an m by n matrix A that is efficient. In worst case it is O(N logN) where N = mn. It uses a bit-vector of size IWORK words to further increase its efficiency. When IWORK=0 no extra storage is used. We also review some of the other existing algorithms for this problem. These contributions were made by Gower, Windley, Knuth, Mac...