859 resultados para constant modulus algorithm
Resumo:
Collection : Les archives de la Révolution française ; 3.1
Resumo:
The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.
Resumo:
Random coefficient regression models have been applied in differentfields and they constitute a unifying setup for many statisticalproblems. The nonparametric study of this model started with Beranand Hall (1992) and it has become a fruitful framework. In thispaper we propose and study statistics for testing a basic hypothesisconcerning this model: the constancy of coefficients. The asymptoticbehavior of the statistics is investigated and bootstrapapproximations are used in order to determine the critical values ofthe test statistics. A simulation study illustrates the performanceof the proposals.
Resumo:
In this paper we propose a Pyramidal Classification Algorithm,which together with an appropriate aggregation index producesan indexed pseudo-hierarchy (in the strict sense) withoutinversions nor crossings. The computer implementation of thealgorithm makes it possible to carry out some simulation testsby Monte Carlo methods in order to study the efficiency andsensitivity of the pyramidal methods of the Maximum, Minimumand UPGMA. The results shown in this paper may help to choosebetween the three classification methods proposed, in order toobtain the classification that best fits the original structureof the population, provided we have an a priori informationconcerning this structure.
Resumo:
Constant interest rate (CIR) projections are often criticized on the grounds that they are inconsistent with the existence of a unique equilibrium in a variety of forward-looking models. This note shows howto construct CIR projections that are not subject to that criticism, using a standard New Keynesian model as a reference framework.
Resumo:
We present a simple randomized procedure for the prediction of a binary sequence. The algorithm uses ideas from recent developments of the theory of the prediction of individual sequences. We show that if thesequence is a realization of a stationary and ergodic random process then the average number of mistakes converges, almost surely, to that of the optimum, given by the Bayes predictor.
Resumo:
ABSTRACT The population dynamics of a species tends to change from the core to the periphery of its distribution. Therefore, one could expect peripheral populations to be subject to a higher level of stress than more central populations (the center–periphery hypothesis) and consequently should present a higher level of fluctuating asymmetry. To test these predictions we study asymmetry in wing shape of five populations of Drosophila antonietae collected throughout the distribution of the species using fluctuating asymmetry as a proxy for developmental instability. More specifically, we addressed the following questions: (1) what types of asymmetry occur in populations of D. antonietae? (2) Does the level of fluctuating asymmetry vary among populations? (3) Does peripheral populations have a higher fluctuating asymmetry level than central populations? We used 12 anatomical landmarks to quantify patterns of asymmetry in wing shape in five populations of D. antonietae within the framework of geometric morphometrics. Net asymmetry – a composite measure of directional asymmetry + fluctuating asymmetry – varied significantly among populations. However, once net asymmetry of each population is decomposed into directional asymmetry and fluctuating asymmetry, most of the variation in asymmetry was explained by directional asymmetry alone, suggesting that populations of D. antonietae have the same magnitude of fluctuating asymmetry throughout the geographical distribution of the species. We hypothesize that larval development in rotting cladodes might play an important role in explaining our results. In addition, our study underscores the importance of understanding the interplay between the biology of a species and its geographical patterns of asymmetry.