793 resultados para Convex
Resumo:
We analyse credit market equilibrium when banks screen loan applicants. When banks have a convex cost function of screening, a pure strategy equilibrium exists where banks optimally set interest rates at the same level as their competitors. This result complements Broecker s (1990) analysis, where he demonstrates that no pure strategy equilibrium exists when banks have zero screening costs. In our set up we show that interest rate on loansare largely independent of marginal costs, a feature consistent with the extant empirical evidence. In equilibrium, banks make positive profits in our model in spite of the threat of entry by inactive banks. Moreover, an increase in the number of active banks increases credit risk and so does not improve credit market effciency: this point has important regulatory implications. Finally, we extend our analysis to the case where banks havediffering screening abilities.
Resumo:
We study the existence of moments and the tail behaviour of the densitiesof storage processes. We give sufficient conditions for existence andnon-existence of moments using the integrability conditions ofsubmultiplicative functions with respect to Lévy measures. Then, we studythe asymptotical behavior of the tails of these processes using the concaveor convex envelope of the release rate function.
Resumo:
The present paper makes progress in explaining the role of capital for inflation and output dynamics. We followWoodford (2003, Ch. 5) in assuming Calvo pricing combined with a convex capital adjustment cost at the firm level. Our main result is that capital accumulation affects inflation dynamics primarily through its impact on the marginal cost. This mechanism is much simpler than the one implied by the analysis in Woodford's text. The reason is that his analysis suffers from a conceptual mistake, as we show. The latter obscures the economic mechanism through which capital affects inflation and output dynamics in the Calvo model, as discussed in Woodford (2004).
Resumo:
We address the performance optimization problem in a single-stationmulticlass queueing network with changeover times by means of theachievable region approach. This approach seeks to obtainperformance bounds and scheduling policies from the solution of amathematical program over a relaxation of the system's performanceregion. Relaxed formulations (including linear, convex, nonconvexand positive semidefinite constraints) of this region are developedby formulating equilibrium relations satisfied by the system, withthe help of Palm calculus. Our contributions include: (1) newconstraints formulating equilibrium relations on server dynamics;(2) a flow conservation interpretation of the constraintspreviously derived by the potential function method; (3) newpositive semidefinite constraints; (4) new work decomposition lawsfor single-station multiclass queueing networks, which yield newconvex constraints; (5) a unified buffer occupancy method ofperformance analysis obtained from the constraints; (6) heuristicscheduling policies from the solution of the relaxations.
Resumo:
This paper studies the effects of uncertain lifetime on capitalaccumulation and growth and also the sensitivity of thoseeffects to the existence of a perfect annuities market. Themodel is an overlapping generations model with uncertainlifetimes. The technology is convex and such that the marginalproduct of capital is bounded away from zero. A contribution ofthis paper is to show that the existence of accidental bequestsmay lead the economy to an equilibrium that exhibits asymptoticgrowth, which is impossible in an economy with a perfect annuitiesmarket or with certain lifetimes. This paper also shows that ifindividuals face a positive probability of surviving in everyperiod, they may be willing to save at any age. This effect ofuncertain lifetime on savings may also lead the economy to anequilibrium exhibiting asymptotic growth even if there exists aperfect annuities market.
Resumo:
We address the problem of scheduling a multi-station multiclassqueueing network (MQNET) with server changeover times to minimizesteady-state mean job holding costs. We present new lower boundson the best achievable cost that emerge as the values ofmathematical programming problems (linear, semidefinite, andconvex) over relaxed formulations of the system's achievableperformance region. The constraints on achievable performancedefining these formulations are obtained by formulatingsystem's equilibrium relations. Our contributions include: (1) aflow conservation interpretation and closed formulae for theconstraints previously derived by the potential function method;(2) new work decomposition laws for MQNETs; (3) new constraints(linear, convex, and semidefinite) on the performance region offirst and second moments of queue lengths for MQNETs; (4) a fastbound for a MQNET with N customer classes computed in N steps; (5)two heuristic scheduling policies: a priority-index policy, anda policy extracted from the solution of a linear programmingrelaxation.
Resumo:
Although correspondence analysis is now widely available in statistical software packages and applied in a variety of contexts, notably the social and environmental sciences, there are still some misconceptions about this method as well as unresolved issues which remain controversial to this day. In this paper we hope to settle these matters, namely (i) the way CA measures variance in a two-way table and how to compare variances between tables of different sizes, (ii) the influence, or rather lack of influence, of outliers in the usual CA maps, (iii) the scaling issue and the biplot interpretation of maps,(iv) whether or not to rotate a solution, and (v) statistical significance of results.
Resumo:
El reconeixement dels gestos de la mà (HGR, Hand Gesture Recognition) és actualment un camp important de recerca degut a la varietat de situacions en les quals és necessari comunicar-se mitjançant signes, com pot ser la comunicació entre persones que utilitzen la llengua de signes i les que no. En aquest projecte es presenta un mètode de reconeixement de gestos de la mà a temps real utilitzant el sensor Kinect per Microsoft Xbox, implementat en un entorn Linux (Ubuntu) amb llenguatge de programació Python i utilitzant la llibreria de visió artifical OpenCV per a processar les dades sobre un ordinador portàtil convencional. Gràcies a la capacitat del sensor Kinect de capturar dades de profunditat d’una escena es poden determinar les posicions i trajectòries dels objectes en 3 dimensions, el que implica poder realitzar una anàlisi complerta a temps real d’una imatge o d’una seqüencia d’imatges. El procediment de reconeixement que es planteja es basa en la segmentació de la imatge per poder treballar únicament amb la mà, en la detecció dels contorns, per després obtenir l’envolupant convexa i els defectes convexos, que finalment han de servir per determinar el nombre de dits i concloure en la interpretació del gest; el resultat final és la transcripció del seu significat en una finestra que serveix d’interfície amb l’interlocutor. L’aplicació permet reconèixer els números del 0 al 5, ja que s’analitza únicament una mà, alguns gestos populars i algunes de les lletres de l’alfabet dactilològic de la llengua de signes catalana. El projecte és doncs, la porta d’entrada al camp del reconeixement de gestos i la base d’un futur sistema de reconeixement de la llengua de signes capaç de transcriure tant els signes dinàmics com l’alfabet dactilològic.
Resumo:
En aquest treball mostrem que, a diferència del cas bilateral, per als mercats multilaterals d'assignació coneguts amb el nom de Böhm-Bawerk assignment games, el nucleolus i el core-center, i. e. el centre de masses del core, no coincideixen en general. Per demostrar-ho provem que donant un m-sided Böhm-Bawerk assignment game les dues solucions anteriors poden obtenir-se respectivament del nucleolus i el core-center d'un joc convex definit en el conjunt format pels m sectors. Encara més, provem que per calcular el nucleolus d'aquest últim joc només les coalicions formades per un jugador o m-1 jugadors són importants. Aquests resultats simplifiquen el càlcul del nucleolus d'un multi-sided ¿¿ohm-Bawerk assignment market amb un número molt elevat d'agents.
Resumo:
The influence of relief forms has been studied by several authors and explains the variability in the soil attributes of a landscape. Soil physical attributes depend on relief forms, and their assessment is important in mechanized agricultural systems, such as of sugarcane. This study aimed to characterize the spatial variability in the physical soil attributes and their relationship to the hillslope curvatures in an Alfisol developed from sandstone and growing sugarcane. Grids of 100 x 100 m were delimited in a convex and a concave area. The grids had a regular spacing of 10 x 10 m, and the crossing points of this spacing determined a total of 121 georeferenced sampling points. Samples were collected to determine the physical attributes related to soil aggregates, porosity, bulk density, resistance to penetration and moisture within the 0-0.2 and 0.2-0.4 m depth. Statistical analyses, geostatistics and Student's t-tests were performed with the means of the areas. All attributes, except aggregates > 2 mm in the 0-0.2 m depth and macroporosity at both depths, showed significant differences between the hillslope curvatures. The convex area showed the highest values of the mean weighted diameter, mean geometric diameter, aggregates > 2 mm, 1-2 mm aggregates, total porosity and moisture and lower values of bulk density and resistance to penetration in both depth compared to the concave area. The number of soil attributes with greater spatial variability was higher in the concave area.
Resumo:
Soil science has sought to develop better techniques for the classification of soils, one of which is the use of remote sensing applications. The use of ground sensors to obtain soil spectral data has enabled the characterization of these data and the advancement of techniques for the quantification of soil attributes. In order to do this, the creation of a soil spectral library is necessary. A spectral library should be representative of the variability of the soils in a region. The objective of this study was to create a spectral library of distinct soils from several agricultural regions of Brazil. Spectral data were collected (using a Fieldspec sensor, 350-2,500 nm) for the horizons of 223 soil profiles from the regions of Matão, Paraguaçu Paulista, Andradina, Ipaussu, Mirandópolis, Piracicaba, São Carlos, Araraquara, Guararapes, Valparaíso (SP); Naviraí, Maracajú, Rio Brilhante, Três Lagoas (MS); Goianésia (GO); and Uberaba and Lagoa da Prata (MG). A Principal Component Analysis (PCA) of the data was then performed and a graphic representation of the spectral curve was created for each profile. The reflectance intensity of the curves was principally influenced by the levels of Fe2O3, clay, organic matter and the presence of opaque minerals. There was no change in the spectral curves in the horizons of the Latossolos, Nitossolos, and Neossolos Quartzarênicos. Argissolos had superficial horizon curves with the greatest intensity of reflection above 2,200 nm. Cambissolos and Neossolos Litólicos had curves with greater reflectance intensity in poorly developed horizons. Gleisols showed a convex curve in the region of 350-400 nm. The PCA was able to separate different data collection areas according to the region of source material. Principal component one (PC1) was correlated with the intensity of reflectance samples and PC2 with the slope between the visible and infrared samples. The use of the Spectral Library as an indicator of possible soil classes proved to be an important tool in profile classification.
Resumo:
Although assignment games are hardly ever convex, in this paper a characterization of their set or extreme points of the core is provided, which is also valid for the class of convex games. For each ordering in the player set, a payoff vector is defined where each player receives his marginal contribution to a certain reduced game played by his predecessors. We prove that the whole set of reduced marginal worth vectors, which for convex games coincide with the usual marginal worth vectors, is the set of extreme points of the core of the assignment game
Resumo:
This paper provides an axiomatic framework to compare the D-core (the set of undominatedimputations) and the core of a cooperative game with transferable utility. Theorem1 states that the D-core is the only solution satisfying projection consistency, reasonableness (from above), (*)-antimonotonicity, and modularity. Theorem 2 characterizes the core replacing (*)-antimonotonicity by antimonotonicity. Moreover, these axioms alsocharacterize the core on the domain of convex games, totally balanced games, balancedgames, and superadditive games
Resumo:
Diffusion MRI is a well established imaging modality providing a powerful way to non-invasively probe the structure of the white matter. Despite the potential of the technique, the intrinsic long scan times of these sequences have hampered their use in clinical practice. For this reason, a wide variety of methods have been proposed to shorten acquisition times. [...] We here review a recent work where we propose to further exploit the versatility of compressed sensing and convex optimization with the aim to characterize the fiber orientation distribution sparsity more optimally. We re-formulate the spherical deconvolution problem as a constrained l0 minimization.
Resumo:
We investigate numerically the scattering of a moving discrete breather on a pair of junctions in a Fermi-Pasta-Ulam chain. These junctions delimit an extended region with different masses of the particles. We consider (i) a rectangular trap, (ii) a wedge shaped trap, and (iii) a smoothly varying convex or concave mass profile. All three cases lead to DB confinement, with the ease of trapping depending on the profile of the trap. We also study the collision and trapping of two DBs within the profile as a function of trap width, shape, and approach time at the two junctions. The latter controls whether one or both DBs are trapped.