Thermal instability in a three-dimensional rigid container with prescribed heat flux at lower boundary

The Bénard–Marangoni convection is studied in a three-dimensional container with thermally insulated lateral walls and prescribed heat flux at lower boundary. The upper surface of the incompressible, viscous fluid is assumed to be flat with temperature dependent surface tension. A Galerkin–Tau method with odd and even trial functions satisfying all the essential boundary conditions except the natural boundary conditions at the free surface has been used to solve the problem. The critical Marangoni and Rayleigh numbers are determined for the onset of steady convection as a function of aspect ratios x0 and y0 for the cases of Bénard–Marangoni, pure Marangoni and pure Bénard convections. It is observed that critical parameters are decreasing with an increase in aspect ratios. The flow structures corresponding to the values of the critical parameters are presented in all the cases. It is observed that the critical parameters are higher for case with heat flux prescribed than those corresponding to the case with prescribed temperature. The critical Marangoni number for pure Marangoni convection is higher than critical Rayleigh number corresponding to pure Bénard convection for a given aspect ratio whereas the reverse was observed for two-dimensional infinite layer.

Coulomb-hole summations and energies for GW calculations with limited number of empty orbitals: a modified static remainder approach

Ab initio GW calculations are a standard method for computing the spectroscopic properties of many materials. The most computationally expensive part in conventional implementations of the method is the generation and summation over the large number of empty orbitals required to converge the electron self-energy. We propose a scheme to reduce the summation over empty states by the use of a modified static remainder approximation, which is simple to implement and yields accurate self-energies for both bulk and molecular systems requiring a small fraction of the typical number of empty orbitals.

A queuing approach for inventory planning with batch ordering in multi-echelon supply chains

This paper presents stylized models for conducting performance analysis of the manufacturing supply chain network (SCN) in a stochastic setting for batch ordering. We use queueing models to capture the behavior of SCN. The analysis is clubbed with an inventory optimization model, which can be used for designing inventory policies . In the first case, we model one manufacturer with one warehouse, which supplies to various retailers. We determine the optimal inventory level at the warehouse that minimizes total expected cost of carrying inventory, back order cost associated with serving orders in the backlog queue, and ordering cost. In the second model we impose service level constraint in terms of fill rate (probability an order is filled from stock at warehouse), assuming that customers do not balk from the system. We present several numerical examples to illustrate the model and to illustrate its various features. In the third case, we extend the model to a three-echelon inventory model which explicitly considers the logistics process.

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.

Effect of human telomerase reverse transcriptase transfection on differentiation in BeWo choriocarcinoma cells

Arrest of proliferation is one of the prerequisites for differentiation of cytotrophoblasts into syncytiotrophoblasts, and thus during differentiation telomerase activity, as well as human telomerase reverse transcriptase (hTERT) expression, is down-regulated. Considering this, it is of interest to investigate whether syncytium formation can be delayed by prolonging the expression of telomerase in cytotrophoblasts. BeWo cells were transfected with pLPC-hTERT retroviral vector and the reverse transcription-polymerase chain reaction analysis for hTERT mRNA concentrations in the transfected cells revealed a several-fold increase in hTERT mRNA compared with the cells transfected with empty vector, and this confirmed that the transfection was successful. An increase in the proliferation, as assessed by bromodeoxyuridine incorporation assay, as well as an increase in mRNA and protein concentration of various cyclins and proliferating cell nuclear antigen, was noticed. The effect of hTERT transfection was also assessed after the addition of forskolin to induce differentiation and it was observed that cell–cell fusion was delayed and differentiation did not occur in hTERT-transfected cells. However, the effects seen were only transient as stable transfection was not possible and the cells were undergoing apoptosis after 72 h, which suggested that apart from hTERT other factors might be important for immortalization of BeWo cells.

State Dependent Attempt Rate Modeling of Single Cell IEEE 802.11 WLANs with Homogeneous Nodes and Poisson Arrivals

Analytical models of IEEE 802.11-based WLANs are invariably based on approximations, such as the well-known mean-field approximations proposed by Bianchi for saturated nodes. In this paper, we provide a new approach for modeling the situation when the nodes are not saturated. We study a State Dependent Attempt Rate (SDAR) approximation to model M queues (one queue per node) served by the CSMA/CA protocol as standardized in the IEEE 802.11 DCF. The approximation is that, when n of the M queues are non-empty, the attempt probability of the n non-empty nodes is given by the long-term attempt probability of n saturated nodes as provided by Bianchi's model. This yields a coupled queue system. When packets arrive to the M queues according to independent Poisson processes, we provide an exact model for the coupled queue system with SDAR service. The main contribution of this paper is to provide an analysis of the coupled queue process by studying a lower dimensional process and by introducing a certain conditional independence approximation. We show that the numerical results obtained from our finite buffer analysis are in excellent agreement with the corresponding results obtained from ns-2 simulations. We replace the CSMA/CA protocol as implemented in the ns-2 simulator with the SDAR service model to show that the SDAR approximation provides an accurate model for the CSMA/CA protocol. We also report the simulation speed-ups thus obtained by our model-based simulation.

Geometry of the de-Sitter universe

By making use of the fact that the de-Sitter metric corresponds to a hyperquadric in a five-dimensional flat space, it is shown that the three Robertson-Walker metrics for empty spacetime and positive cosmological constant, corresponding to 3-space of positive, negative and zero curvative, are geometrically equivalent. The 3-spaces correspond to intersections of the hyperquadric by hyperplanes, and the time-like geodesics perpendicular to them correspond to intersections by planes, in all three cases.

Successful recovery of preimplantation embryos by nonsurgical uterine flushing in the bonnet monkey

A major limitation to progress in primate embryology is the lack of an adequate supply of preimplantation embryos. We describe a method for recovering preimplantation-embryos in bonnet monkeys (Macaca radiata ) using a nonsurgical uterine flushing technique similar to the one previously employed in rhesus monkeys. Forty cyclic females were screened for cervical cannulation, and 10% of these had an impassable cervix. Eleven females suitable for cannulation were selected, and 27 menstrual cycles were monitored over a 5-mo period. Seventy-one percent of the cycles showed estrogen peaks, which were observed between Days 9 and 14 of the cycle. Following natural mating, uterine flushings were performed on Days 5 to 8 of pregnancy (Day 0 = the day following the estrogen peak). Of the 27 recovery attempts, 9 (33.3%) resulted in the recovery of ovulation products, including those of an unfertilized oocyte and empty zona (2 cases), retarded cleavage-stage (4 to 8-cell) embryos (4 cases), morula (1 case) and blastocysts (2 cases). These results show, for the first time, that the nonsurgical uterine flushing technique can be successfully performed to recover uterine-stage preimplantation embryos from bonnet monkeys.

Assembly of physalis mottle virus capsid protein in Escherichia coli and the role of amino and carboxy termini in the formation of the icosahedral particles

The coat protein gene of physalis mottle tymovirus (PhMV) was over expressed in Escherichia coli using pET-3d vector. The recombinant protein was found to self assemble into capsids in vivo. The purified recombinant capsids had an apparent s value of 56.5 S and a diameter of 29(±2) nm. In order to establish the role of amino and carboxy-terminal regions in capsid assembly, two amino-terminal deletions clones lacking the first 11 and 26 amino acid residues and two carboxy-terminal deletions lacking the last five and ten amino acid residues were constructed and overexpressed. The proteins lacking N-terminal 11 (PhCPN1) and 26 (PhCPN2) amino acid residues self assembled into T = 3 capsids in vivo, as evident from electron microscopy, ultracentrifugation and agarose gel electrophoresis. The recombinant, PhCPN1 and PhCPN2 capsids were as stable as the empty capsids formed in vivo and encapsidated a small amount of mRNA. The monoclonal antibody PA3B2, which recognizes the epitope within region 22 to 36, failed to react with PhCPN2 capsids while it recognized the recombinant and PhCPN1 capsids. Disassembly of the capsids upon treatment with urea showed that PhCPN2 capsids were most stable. These results demonstrate that the N-terminal 26 amino acid residues are not essential for T = 3 capsid assembly in PhMV. In contrast, both the proteins lacking the C-terminal five and ten amino acid residues were present only in the insoluble fraction and could not assemble into capsids, suggesting that these residues are crucial for folding and assembly of the particles.

Popular Mixed Matchings

We study the problem of matching applicants to jobs under one-sided preferences: that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be rnore popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M,T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based oil the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distributions over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P,Q) >= phi(Q,P) for all mixed matchings Q. We show that popular mixed matchings always exist. and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem.

New eight node serendipity quadrilateral plate bending element for thin and moderately thick plates using Integrated Force Method

A new 8-node serendipity quadrilateral plate bending element (MQP8) based on the Mindlin-Reissner theory for the analysis of thin and moderately thick plate bending problems using Integrated Force Method is presented in this paper. The performance of this new element (MQP8) is studied for accuracy and convergence by analyzing many standard benchmark plate bending problems. This new element MQP8 performs excellent in both thin and moderately thick plate bending situations. And also this element is free from spurious/zero energy modes and free from shear locking problem.

Electronic Structure and Bonding in Neutral and Dianionic Boradiphospholes: R ' BC2P2R2 (R=H, tBu, R '=H, Ph)

Classical and non-classical isomers of both neutral and dianionic BC2P2H3 species, which are isolobal to Cp+ and Cp-, are studied at both B3LYP/6-311++G(d,p) and G3B3 levels of theory. The global minimum structure given by B3LYP/6-311+ + G(d,p) for BC2P2H3 is based on a vinylcyclopropenyl-type structure, whereas BC2P2H32- has a planar aromatic cyclopentadienyl-ion-like structure. However, at the G3B3 level, there are three low-energy isomers for BC2P2H3: 1)tricyclopentane, 2) nido and 3) vinylcyclopropenyl-type structures, all within 1.7 kcal mol(-1) of each other. On the contrary, for the dianionic species the cyclic planar structure is still the minimum. In comparison to the isolobal Cp+ and HnCnP5-n+ isomers, BC2P2H3 shows a competition between pi-delocalised vinylcyclopropenyl- and cluster-type structures (nido and tricyclopentane). Substitution of H on C by tBu, and H on B by Ph, in BC2P2H3 increases the energy difference between the low-lying isomers, giving the lowest energy structure as a tricyclopentane type. Similar substitution in BC2P2H32- merely favours different positional isomers of the cyclic planar geometry, as observed in 1) isoelectronic neutral heterodiphospholes EtBu2C2P2 (E=S, Se, Te), 2) monoanionic heterophospholyl rings EtBu2C2P2 (E=P-, As-, Sb-) and 3) polyphospholyl rings anions tBu(5-n)C(n)P(5-n) (n=0-5). The principal factors that affect the stability of three-, four-, and five-membered ring and acyclic geometrical and positional isomers of neutral and dianionic BC2P2H3 isomers appear to be: 1) relative bond strengths, 2) availability of electrons for the empty 2p boron orbital and 3) steric effects of the tBu groups in the HBC(2)P(2)tBu(2) systems.

Cost Sharing Mechanisms for Business Clusters with Strategic Firms

A business cluster is a co-located group of micro, small, medium scale enterprises. Such firms can benefit significantly from their co-location through shared infrastructure and shared services. Cost sharing becomes an important issue in such sharing arrangements especially when the firms exhibit strategic behavior. There are many cost sharing methods and mechanisms proposed in the literature based on game theoretic foundations. These mechanisms satisfy a variety of efficiency and fairness properties such as allocative efficiency, budget balance, individual rationality, consumer sovereignty, strategyproofness, and group strategyproofness. In this paper, we motivate the problem of cost sharing in a business cluster with strategic firms and illustrate different cost sharing mechanisms through the example of a cluster of firms sharing a logistics service. Next we look into the problem of a business cluster sharing ICT (information and communication technologies) infrastructure and explore the use of cost sharing mechanisms.

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.