986 resultados para Communicating search. Tuberculin test
Resumo:
We analyze the impact on consumer prices of the size and bias of price comparison search engines. In the context of a model related to Burdett and Judd (1983) and Varian (1980), we develop and test experimentally several theoretical predictions. The experimental results confirm the model’s predictions regarding the impact of the number of firms, and the type of bias of the search engine, but reject the model’s predictions regarding changes in the size of the index. The explanatory power of an econometric model for the price distributions is significantly improved when variables accounting for risk attitudes are introduced.
Resumo:
Este estudo investiga o poder preditivo fora da amostra, um mês à frente, de um modelo baseado na regra de Taylor para previsão de taxas de câmbio. Revisamos trabalhos relevantes que concluem que modelos macroeconômicos podem explicar a taxa de câmbio de curto prazo. Também apresentamos estudos que são céticos em relação à capacidade de variáveis macroeconômicas preverem as variações cambiais. Para contribuir com o tema, este trabalho apresenta sua própria evidência através da implementação do modelo que demonstrou o melhor resultado preditivo descrito por Molodtsova e Papell (2009), o “symmetric Taylor rule model with heterogeneous coefficients, smoothing, and a constant”. Para isso, utilizamos uma amostra de 14 moedas em relação ao dólar norte-americano que permitiu a geração de previsões mensais fora da amostra de janeiro de 2000 até março de 2014. Assim como o critério adotado por Galimberti e Moura (2012), focamos em países que adotaram o regime de câmbio flutuante e metas de inflação, porém escolhemos moedas de países desenvolvidos e em desenvolvimento. Os resultados da nossa pesquisa corroboram o estudo de Rogoff e Stavrakeva (2008), ao constatar que a conclusão da previsibilidade da taxa de câmbio depende do teste estatístico adotado, sendo necessária a adoção de testes robustos e rigorosos para adequada avaliação do modelo. Após constatar não ser possível afirmar que o modelo implementado provém previsões mais precisas do que as de um passeio aleatório, avaliamos se, pelo menos, o modelo é capaz de gerar previsões “racionais”, ou “consistentes”. Para isso, usamos o arcabouço teórico e instrumental definido e implementado por Cheung e Chinn (1998) e concluímos que as previsões oriundas do modelo de regra de Taylor são “inconsistentes”. Finalmente, realizamos testes de causalidade de Granger com o intuito de verificar se os valores defasados dos retornos previstos pelo modelo estrutural explicam os valores contemporâneos observados. Apuramos que o modelo fundamental é incapaz de antecipar os retornos realizados.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
In the minimization of tool switches problem we seek a sequence to process a set of jobs so that the number of tool switches required is minimized. In this work different variations of a heuristic based on partial ordered job sequences are implemented and evaluated. All variations adopt a depth first strategy of the enumeration tree. The computational test results indicate that good results can be obtained by a variation which keeps the best three branches at each node of the enumeration tree, and randomly choose, among all active nodes, the next node to branch when backtracking.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Spodoptera frugiperda (Smith, 1797) (Lepidoptera: Noctuidae) is considered to be the main pest of maize crops in Brazil. Entomopathogenic nematodes (EPN) may be used to control this pest and exhibit different, unique abilities to search for their hosts. The movement of EPN in relation to S. frugiperda was evaluated. To test for horizontal movement, a styrofoam enclosure filled with sand was divided into segments, nematodes were placed at the entrance to the enclosure and a larva was placed at the end of each division. The same approach was used to evaluate vertical movement; however, PVC pipes were used in this case. In general, the mortality was inversely proportional to the initial distance between host and nematodes. In the vertical displacement test, both nematodes were able to kill the larvae up to a distance of 25 cm. Therefore, the infective juveniles of H. amazonensis and S. arenarium can search out, infect and kill larvae of S. frugiperda at distances of up to 60 cm and 25 cm of horizontal and vertical displacement, respectively.
Resumo:
Large scale combinatorial problems such as the network expansion problem present an amazingly high number of alternative configurations with practically the same investment, but with substantially different structures (configurations obtained with different sets of circuit/transformer additions). The proposed parallel tabu search algorithm has shown to be effective in exploring this type of optimization landscape. The algorithm is a third generation tabu search procedure with several advanced features. This is the most comprehensive combinatorial optimization technique available for treating difficult problems such as the transmission expansion planning. The method includes features of a variety of other approaches such as heuristic search, simulated annealing and genetic algorithms. In all test cases studied there are new generation, load sites which can be connected to an existing main network: such connections may require more than one line, transformer addition, which makes the problem harder in the sense that more combinations have to be considered.
Resumo:
This paper presents an efficient tabu search algorithm (TSA) to solve the problem of feeder reconfiguration of distribution systems. The main characteristics that make the proposed TSA particularly efficient are a) the way in which the neighborhood of the current solution was defined; b) the way in which the objective function value was estimated; and c) the reduction of the neighborhood using heuristic criteria. Four electrical systems, described in detail in the specialized literature, were used to test the proposed TSA. The result demonstrate that it is computationally very fast and finds the best solutions known in the specialized literature. © 2012 IEEE.
Resumo:
This paper proposes strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem (TEP). The concept of the binary numeral system (BNS) is used to reduce the number of binary and continuous variables related to the candidate transmission lines and network constraints that are connected with them. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) and additional constraints, obtained from power flow equilibrium in an electric power system are employed for more reduction in search space. The multistage TEP problem is modeled like a mixed binary linear programming problem and solved using a commercial solver with a low computational time. The results of one test system and two real systems are presented in order to show the efficiency of the proposed solution technique. © 1969-2012 IEEE.
Resumo:
The first search at the LHC for the extinction of QCD jet production is presented, using data collected with the CMS detector corresponding to an integrated luminosity of 10.7 fb-1 of proton-proton collisions at a center-of-mass energy of 8 TeV. The extinction model studied in this analysis is motivated by the search for signatures of strong gravity at the TeV scale (terascale gravity) and assumes the existence of string couplings in the strong-coupling limit. In this limit, the string model predicts the suppression of all high-transverse-momentum standard model processes, including jet production, beyond a certain energy scale. To test this prediction, the measured transverse-momentum spectrum is compared to the theoretical prediction of the standard model. No significant deficit of events is found at high transverse momentum. A 95% confidence level lower limit of 3.3 TeV is set on the extinction mass scale.
Resumo:
In this paper, to solve the reconfiguration problem of radial distribution systems a scatter search, which is a metaheuristic-based algorithm, is proposed. In the codification process of this algorithm a structure called node-depth representation is used. It then, via the operators and from the electrical power system point of view, results finding only radial topologies. In order to show the effectiveness, usefulness, and the efficiency of the proposed method, a commonly used test system, 135-bus, and a practical system, a part of Sao Paulo state's distribution network, 7052 bus, are conducted. Results confirm the efficiency of the proposed algorithm that can find high quality solutions satisfying all the physical and operational constraints of the problem.
Resumo:
Lianas can change forest dynamics, slowing down forest regeneration after a perturbation. In these cases, it may be necessary to manage these woody climbers. Our aim was to simulate two management strategies: (1) focusing on abundant liana species and (2) focusing on the largest lianas, and contrast them with the random removal of lianas. We applied mathematical simulations for liana removal in three different vegetation types in southeastern Brazil: a Rainforest, a Seasonal Tropical Forest, and a Woodland Savanna. Using these samples, we performed simulations based on two liana removal procedures and compared them with random removal. We also used regression analysis with quasi-Poisson distribution to test whether larger lianas were aggressive, i.e., if they climbed into many trees. The procedure of cutting larger lianas was as effective as cutting them randomly and proved not to be a good method for liana management. Moreover, most of the lianas climbed into one or two trees, i.e., were not aggressive. Cutting the most abundant lianas proved to be a more effective method than cutting lianas randomly. This method could maintain liana richness and presumably should accelerate forest regeneration.
Resumo:
The comparative cervical skin test for antemortem diagnosis of tuberculosis was done 169 times on 116 different white-tailed deer of known Mycobacterium bovis infection status. The sensitivity and specificity were 97 and 81%, respectively. The magnitude of change in skin thickness at test sites was not significantly influenced by dosage of inoculum, dissemination of the disease process, or repeated skin testing. However, the magnitude of change in skin thickness was significantly greater in deer infected for less than 109 days than in deer infected for more than 109 days. As used in the present study, the comparative cervical skin test is a sensitive method of antemortem diagnosis of M. bovis infection in white-tailed deer.
Resumo:
Recommendations • Become a beta partner with vendor • Test load collections before going live • Update cataloging codes to benefit your community • Don’t expect to drastically change cataloging practices