5 resultados para discrete choice theory
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo
Resumo:
The study aims to analyze the IT architecture management practices associated with their degree of maturity and the influence of institutional and strategic factors on the decisions involved through a case study in a large telecom organization. The case study allowed us to identify practices that led the company to its current stage of maturity and identify practices that can lead the company to the next stage. The strategic influence was mentioned by most respondents and the institutional influence was present in decisions related to innovation and those dealing with a higher level of uncertainties.
Resumo:
This work is supported by Brazilian agencies Fapesp, CAPES and CNPq
Resumo:
The Sznajd model is a sociophysics model that is used to model opinion propagation and consensus formation in societies. Its main feature is that its rules favor bigger groups of agreeing people. In a previous work, we generalized the bounded confidence rule in order to model biases and prejudices in discrete opinion models. In that work, we applied this modification to the Sznajd model and presented some preliminary results. The present work extends what we did in that paper. We present results linking many of the properties of the mean-field fixed points, with only a few qualitative aspects of the confidence rule (the biases and prejudices modeled), finding an interesting connection with graph theory problems. More precisely, we link the existence of fixed points with the notion of strongly connected graphs and the stability of fixed points with the problem of finding the maximal independent sets of a graph. We state these results and present comparisons between the mean field and simulations in Barabasi-Albert networks, followed by the main mathematical ideas and appendices with the rigorous proofs of our claims and some graph theory concepts, together with examples. We also show that there is no qualitative difference in the mean-field results if we require that a group of size q > 2, instead of a pair, of agreeing agents be formed before they attempt to convince other sites (for the mean field, this would coincide with the q-voter model).
Resumo:
Using the elements of the so-called KBc gamma subalgebra, we study a class of analytic solutions depending on a single function F(K) in the modified cubic superstring field theory. We compute the energy associated to these solutions and show that the result can be expressed in terms of a contour integral. For a particular choice of the function F(K), we show that the energy is given by integer multiples of a single D-brane tension.
Resumo:
In the framework of gauged flavour symmetries, new fermions in parity symmetric representations of the standard model are generically needed for the compensation of mixed anomalies. The key point is that their masses are also protected by flavour symmetries and some of them are expected to lie way below the flavour symmetry breaking scale(s), which has to occur many orders of magnitude above the electroweak scale to be compatible with the available data from flavour changing neutral currents and CP violation experiments. We argue that, actually, some of these fermions would plausibly get masses within the LHC range. If they are taken to be heavy quarks and leptons, in (bi)-fundamental representations of the standard model symmetries, their mixings with the light ones are strongly constrained to be very small by electroweak precision data. The alternative chosen here is to exactly forbid such mixings by breaking of flavour symmetries into an exact discrete symmetry, the so-called proton-hexality, primarily suggested to avoid proton decay. As a consequence of the large value needed for the flavour breaking scale, those heavy particles are long-lived and rather appropriate for the current and future searches at the LHC for quasi-stable hadrons and leptons. In fact, the LHC experiments have already started to look for them.