149 resultados para bounded rationality

em Indian Institute of Science - Bangalore - Índia


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Numerical and experimental studies of a supersonic jet (Helium) inclined at 45 degrees to a oncoming Mach 2 flow have been carried out. The numerical study has been used to arrive at a geometry that could reduce an oncoming Mach 5.75 flow to Mach 2 flow and in determining the jet parameters. Experiments are carried out in the IISc. hypersonic shock tunnel HST2 at similar conditions obtained from numerical studies. Flow visualization studies carried out using Schlieren technique clearly show the presence of the bow shock in front of the jet exposed to supersonic cross flow. The jet Mach number is experimentally found to be approximate to 3. Visual observations show that the jet has penetrated up to 60% of the total height of the chamber.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Abstract is not available.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Let Ohm be a bounded domain in IRN, N greater than or equal to 2, lambda > 0, q is an element of (0, N - 1) and alpha is an element of (1, N/N-1 In this article we show the existence of at least two positive solutions for the following quasilinear elliptic problem with an exponential type nonlinearity:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The instability of coupled longitudinal and transverse electromagnetic modes associated with long wavelengths is studied in bounded streaming plasmas. The main conclusions are as follows: (i) For long waves for which O (k 2)=0, in the absence of relative streaming motion of electrons and ions and aωp/c<0.66, the whole spectrum of harmonic waves is excited due to finite temperature and boundary effects consisting of two subseries. One of these subseries can be identified with Tonks-Dattner resonance oscillations for the electrons, and arises primarily due to the electrons with frequencies greater than the electrostatic plasma frequency corresponding to the electron density in the midplane in the undisturbed state. The other series arises primarily due to ion motion. When aωp/c>0.66, in addition to the above spectrum of harmonic waves, the system admits an infinite number of growing and decaying waves. The instability associated with these modes is found to arise due to the interaction of the waves inside the plasma with the external electromagnetic field. (ii) For modes with comparatively shorter wavelengths for which O (k3)=0, the coupling due to finite temperature sets in, and it is found that the two series of harmonic waves obtained in (i) deriving energy from the transverse modes also become unstable. Thus, for these wavelengths the system admits three sets of growing and decaying modes, first two for all values of aωp/c and the third for (aωp/c) > 0.66. (iii) The presence of streaming velocities introduces various other coupling mechanisms, and we find that even for the wavelengths for which O (k2)=0, we get three sets of growing and decaying waves. The numerical values for the growth rates show that the streaming velocities enhance the growth rates of instability significantly.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The present study of the stability of systems governed by a linear multidimensional time-varying equation, which are encountered in spacecraft dynamics, economics, demographics, and biological systems, gives attention the lemma dealing with L(inf) stability of an integral equation that results from the differential equation of the system under consideration. Using the proof of this lemma, the main result on L(inf) stability is derived according; a corollary of the theorem deals with constant coefficient systems perturbed by small periodic terms. (O.C.)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A method involving eigenfunction expansion and collocation is employed to solve the axisymmetric problem of a slowly and steadily rotating circular disc in a fluid of finite extent whose surface is covered with a surfactant film. The present method (originally described by Wang (Acta Mech. 94, 97, 1992)) is observed to produce results of practical importance associated with the problem more quickly and more easily than the one used earlier by Shail and Gooden (Int. J. Multiphase Flow 7, 245, 1992). (C) 1994 Academic Press, Inc.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Combinatorial exchanges are double sided marketplaces with multiple sellers and multiple buyers trading with the help of combinatorial bids. The allocation and other associated problems in such exchanges are known to be among the hardest to solve among all economic mechanisms. In this paper, we develop computationally efficient iterative auction mechanisms for solving combinatorial exchanges. Our mechanisms satisfy Individual-rationality (IR) and budget-nonnegativity (BN) properties. We also show that our method is bounded and convergent. Our numerical experiments show that our algorithm produces good quality solutions and is computationally efficient.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Consider a sequence of closed, orientable surfaces of fixed genus g in a Riemannian manifold M with uniform upper bounds on the norm of mean curvature and area. We show that on passing to a subsequence, we can choose parametrisations of the surfaces by inclusion maps from a fixed surface of the same genus so that the distance functions corresponding to the pullback metrics converge to a pseudo-metric and the inclusion maps converge to a Lipschitz map. We show further that the limiting pseudo-metric has fractal dimension two. As a corollary, we obtain a purely geometric result. Namely, we show that bounds on the mean curvature, area and genus of a surface F subset of M, together with bounds on the geometry of M, give an upper bound on the diameter of F. Our proof is modelled on Gromov's compactness theorem for J-holomorphic curves.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We investigate the following problem: given a set of jobs and a set of people with preferences over the jobs, what is the optimal way of matching people to jobs? Here we consider the notion of popularity. A matching M is popular if there is no matching M' such that more people prefer M' to M than the other way around. Determining whether a given instance admits a popular matching and, if so, finding one, was studied by Abraham et al. (SIAM J. Comput. 37(4):1030-1045, 2007). If there is no popular matching, a reasonable substitute is a matching whose unpopularity is bounded. We consider two measures of unpopularity-unpopularity factor denoted by u(M) and unpopularity margin denoted by g(M). McCutchen recently showed that computing a matching M with the minimum value of u(M) or g(M) is NP-hard, and that if G does not admit a popular matching, then we have u(M) >= 2 for all matchings M in G. Here we show that a matching M that achieves u(M) = 2 can be computed in O(m root n) time (where m is the number of edges in G and n is the number of nodes) provided a certain graph H admits a matching that matches all people. We also describe a sequence of graphs: H = H(2), H(3), ... , H(k) such that if H(k) admits a matching that matches all people, then we can compute in O(km root n) time a matching M such that u(M) <= k - 1 and g(M) <= n(1 - 2/k). Simulation results suggest that our algorithm finds a matching with low unpopularity in random instances.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The product dimension of a graph G is defined as the minimum natural number l such that G is an induced subgraph of a direct product of l complete graphs. In this paper we study the product dimension of forests, bounded treewidth graphs and k-degenerate graphs. We show that every forest on n vertices has product dimension at most 1.441 log n + 3. This improves the best known upper bound of 3 log n for the same due to Poljak and Pultr. The technique used in arriving at the above bound is extended and combined with a well-known result on the existence of orthogonal Latin squares to show that every graph on n vertices with treewidth at most t has product dimension at most (t + 2) (log n + 1). We also show that every k-degenerate graph on n vertices has product dimension at most inverted right perpendicular5.545 k log ninverted left perpendicular + 1. This improves the upper bound of 32 k log n for the same by Eaton and Rodl.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A series expansion for Heckman-Opdam hypergeometric functions phi(lambda) is obtained for all lambda is an element of alpha(C)*. As a consequence, estimates for phi(lambda) away from the walls of a Weyl chamber are established. We also characterize the bounded hypergeometric functions and thus prove an analogue of the celebrated theorem of Helgason and Johnson on the bounded spherical functions on a Riemannian symmetric space of the noncompact type. The L-P-theory for the hypergeometric Fourier transform is developed for 0 < p < 2. In particular, an inversion formula is proved when 1 <= p < 2. (C) 2013 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We prove that a proper holomorphic map between two nonplanar bounded symmetric domains of the same dimension, one of them being irreducible, is a biholomorphism. Our methods allow us to give a single, all-encompassing argument that unifies the various special cases in which this result is known. We discuss an application of these methods to domains having noncompact automorphism groups that are not assumed to act transitively.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The separation dimension of a graph G is the smallest natural number k for which the vertices of G can be embedded in R-k such that any pair of disjoint edges in G can be separated by a hyperplane normal to one of the axes. Equivalently, it is the smallest possible cardinality of a family F of total orders of the vertices of G such that for any two disjoint edges of G, there exists at least one total order in F in which all the vertices in one edge precede those in the other. In general, the maximum separation dimension of a graph on n vertices is Theta(log n). In this article, we focus on bounded degree graphs and show that the separation dimension of a graph with maximum degree d is at most 2(9) (log*d)d. We also demonstrate that the above bound is nearly tight by showing that, for every d, almost all d-regular graphs have separation dimension at least d/2]

Relevância:

20.00% 20.00%

Publicador:

Resumo:

It is known that all the vector bundles of the title can be obtained by holomorphic induction from representations of a certain parabolic group on finite-dimensional inner product spaces. The representations, and the induced bundles, have composition series with irreducible factors. We write down an equivariant constant coefficient differential operator that intertwines the bundle with the direct sum of its irreducible factors. As an application, we show that in the case of the closed unit ball in C-n all homogeneous n-tuples of Cowen-Douglas operators are similar to direct sums of certain basic n-tuples. (c) 2015 Academie des sciences. Published by Elsevier Masson SAS. All rights reserved.