Unsteady Compressible Boundary-Layer Flow On The Stagnation Line Of An Infinite Swept Cylinder

Numerical solutions of flow and heat transfer process on the unsteady flow of a compressible viscous fluid with variable gas properties in the vicinity of the stagnation line of an infinite swept cylinder are presented. Results are given for the case where the unsteady temperature field is produced by (i) a sudden change in the wall temperature (enthalpy) as the impulsive motion is started and (ii) a sudden change in the free-stream velocity. Solutions for the simultaneous development of the thermal and momentum boundary layers are obtained by using quasilinearization technique with an implicit finite difference scheme. Attention is given to the transient phenomenon from the initial flow to the final steady-state distribution. Results are presented for the skin friction and heat transfer coefficients as well as for the velocity and enthalpy profiles. The effects of wail enthalpy parameter, sweep parameter, fluid properties and transpiration cooling on the heat transfer and skin friction are considered.

Pacific Journalism Review : Twenty years on the front line of regional identity and freedom

Pacific Journalism Review has consistently, at a good standard, honoured its 1994 founding goal: to be a credible peer-reviewed journal in the Asia-Pacific region, probing developments in journalism and media, and supporting journalism education. Global, it considers new media and social movements; ‘regional’, it promotes vernacular media, human freedoms and sustainable development. Asking how it developed, the method for this article was to research the archive, noting authors, subject matter, themes. The article concludes that one answer is the journal’s collegiate approach; hundreds of academics, journalists and others, have been invited to contribute. Second has been the dedication of its one principal editor, Professor David Robie, always somehow providing resources—at Port Moresby, Suva, and now Auckland—with a consistent editorial stance. Eclectic, not partisan, it has nevertheless been vigilant over rights, such as monitoring the Fiji coups d’etat. Watching through a media lens, it follows a ‘Pacific way’, handling hard information through understanding and consensus. It has 237 subscriptions indexed to seven databases. Open source, it receives more than 1000 site visits weekly. With ‘clientele’ mostly in Australia, New Zealand and ‘Oceania’, it extends much further afield. From 1994 to 2014, 701 articles and reviews were published, now more than 24 scholarly articles each year.

On the cubicity of bipartite graphs

A unit cube in k-dimension (or a k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k, where each R-i is a closed interval on the real line of the form [a(j), a(i), + 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 graph G, cub(G) <= left perpendicular2n/3right perpendicular. Recently it has been shown that for a graph G, cub(G) >= 4(Delta + 1) In n, where n and Delta are the number of vertices and maximum degree of G, respectively. In this paper, we show that for a bipartite graph G = (A boolean OR B, E) with |A| = n(1), |B| = n2, n(1) <= n(2), and Delta' = min {Delta(A),Delta(B)}, where Delta(A) = max(a is an element of A)d(a) and Delta(B) = max(b is an element of B) d(b), d(a) and d(b) being the degree of a and b in G, respectively , cub(G) <= 2(Delta' + 2) bar left rightln n(2)bar left arrow. We also give an efficient randomized algorithm to construct the cube representation of G in 3 (Delta' + 2) bar right arrowIn n(2)bar left arrow dimension. The reader may note that in general Delta' can be much smaller than Delta.

On the Cubicity of Interval Graphs

A k-cube (or ``a unit cube in k dimensions'') is defined as the Cartesian product R-1 x . . . x R-k where R-i (for 1 <= i <= k) is an interval of the form [a(i), a(i) + 1] on the real line. The k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that the k-cubes corresponding to two vertices in G have a non-empty intersection if and only if the vertices are adjacent. The cubicity of a graph G, denoted as cub(G), is defined as the minimum dimension k such that G has a k-cube representation. An interval graph is a graph that can be represented as the intersection of intervals on the real line - i. e., the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. We show that for any interval graph G with maximum degree Delta, cub(G) <= inverted right perpendicular log(2) Delta inverted left perpendicular + 4. This upper bound is shown to be tight up to an additive constant of 4 by demonstrating interval graphs for which cubicity is equal to inverted right perpendicular log(2) Delta inverted left perpendicular.

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs

A unit cube in k dimensions (k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), a(i) + 1] on the real line. A graph G on n nodes is said to be representable as the intersection of k-cubes (cube representation in k dimensions) if each vertex of C can be mapped to a k-cube such that two vertices are adjacent in G if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G denoted as cub(G) is the minimum k for which G can be represented as the intersection of k-cubes. An interesting aspect about cubicity is that many problems known to be NP-complete for general graphs have polynomial time deterministic algorithms or have good approximation ratios in graphs of low cubicity. In most of these algorithms, computing a low dimensional cube representation of the given graph is usually the first step. We give an O(bw . n) algorithm to compute the cube representation of a general graph G in bw + 1 dimensions given a bandwidth ordering of the vertices of G, where bw is the bandwidth of G. As a consequence, we get O(Delta) upper bounds on the cubicity of many well-known graph classes such as AT-free graphs, circular-arc graphs and cocomparability graphs which have O(Delta) bandwidth. Thus we have: 1. cub(G) <= 3 Delta - 1, if G is an AT-free graph. 2. cub(G) <= 2 Delta + 1, if G is a circular-arc graph. 3. cub(G) <= 2 Delta, if G is a cocomparability graph. Also for these graph classes, there axe constant factor approximation algorithms for bandwidth computation that generate orderings of vertices with O(Delta) width. We can thus generate the cube representation of such graphs in O(Delta) dimensions in polynomial time.

A literature survey on the real-time computational simulation of biological organs

This paper lists some references that could in some way be relevant in the context of the real-time computational simulation of biological organs, the research area being defined in a very broad sense. This paper contains 198 references.

Financial Futures Markets and Their Impact on the Real Economy in Middle and Low Income Countries

This project analyses the influence of the futures market on middle and low income countries. In it, I attempt to show that investments made by large investment funds in this market, as well as by certain pension plans, bring major consequences whose effects are more evident in less developed countries. The cornerstones of the work are as follows; to attempt to see the existing relationship between the commodity futures market and its underlying assets; analysing products such as wheat, rice and corn in-depth, because these are the most basic foodstuffs at a global level; to determine how an increase in trading in these markets can affect the lives of people in the poorest countries; to analyse investor concern regarding the consequences that their investments may have. Throughout the project we will see how large speculators use production forecasting models to determine the shortage of a commodity in order to take a position in the futures market to profit from it. In addition we will see how an increase in trading in this market causes an increase in the price of the underlying asset in the spot market. As for investor concern, I can say it is negligible, but the idea of running pension plans or investment funds that follow some social criteria has been welcomed by those interviewed, which makes me think that different legislation is possible. This legislation will only come into existence if it is demanded by the people. A fact that now becomes complicated because without a minimum financial basis, they cannot even know how the large investment funds trade with hunger in the world. The day when most people understand how large speculators profit from famine will be the day to put pressure on governments to begin to put limits on speculation. This makes financial awareness necessary in order to achieve a curb in excessive speculation.

On the troll line investigations off Cochin during five fishing seasons. Pt. 1. Investigations during 1960-61 and 1961-62 seasons

There is apparently great scope for improvement of the design and operational aspects of the gear particularly for the effective exploitation of seasonal fisheries like that of seer, tuna, barracuda etc. In order to evolve improved, yet cheap trolling gear regular investigations were undertaken by the Craft & Gear Wing of the Central Institute of Fisheries Technology, off Cochin for five fishing seasons and the results of these studies are incorporated in this paper.

On the troll line investigations off Cochin during five fishing seasons. Pt. 2. Investigations during 1963-64 season

During this season the investigations were mainly directed towards elucidation of the selective action of trolling lures. Feather jigs, buffalo horn jigs, stainless steel jigs, Japanese whale bone jigs and plastic jigs were selected. Operations were carried out from Fisheries technology No. 5.

On the troll line investigations off Cochin during five fishing seasons. Pt. 3. Investigations during 1965-66 and 1966-67 seasons

During these two seasons investigations were carried out with a view to exploring the possibility of this operation on commercial basis and to study the effect of certain meteorological factors on catch.

Vector bundles on the projective line and finite domination of chain complexes

We present an algebro-geometric approach to a theorem on finite domination of chain complexes over a Laurent polynomial ring. The approach uses extension of chain complexes to sheaves on the projective line, which is governed by a K-theoretical obstruction.