20 resultados para finite and infinitesimal models


Relevância:

100.00% 100.00%

Publicador:

Resumo:

The estimation of data transformation is very useful to yield response variables satisfying closely a normal linear model, Generalized linear models enable the fitting of models to a wide range of data types. These models are based on exponential dispersion models. We propose a new class of transformed generalized linear models to extend the Box and Cox models and the generalized linear models. We use the generalized linear model framework to fit these models and discuss maximum likelihood estimation and inference. We give a simple formula to estimate the parameter that index the transformation of the response variable for a subclass of models. We also give a simple formula to estimate the rth moment of the original dependent variable. We explore the possibility of using these models to time series data to extend the generalized autoregressive moving average models discussed by Benjamin er al. [Generalized autoregressive moving average models. J. Amer. Statist. Assoc. 98, 214-223]. The usefulness of these models is illustrated in a Simulation study and in applications to three real data sets. (C) 2009 Elsevier B.V. All rights reserved.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

For the first time, we introduce a class of transformed symmetric models to extend the Box and Cox models to more general symmetric models. The new class of models includes all symmetric continuous distributions with a possible non-linear structure for the mean and enables the fitting of a wide range of models to several data types. The proposed methods offer more flexible alternatives to Box-Cox or other existing procedures. We derive a very simple iterative process for fitting these models by maximum likelihood, whereas a direct unconditional maximization would be more difficult. We give simple formulae to estimate the parameter that indexes the transformation of the response variable and the moments of the original dependent variable which generalize previous published results. We discuss inference on the model parameters. The usefulness of the new class of models is illustrated in one application to a real dataset.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper proposes a method to locate and track people by combining evidence from multiple cameras using the homography constraint. The proposed method use foreground pixels from simple background subtraction to compute evidence of the location of people on a reference ground plane. The algorithm computes the amount of support that basically corresponds to the ""foreground mass"" above each pixel. Therefore, pixels that correspond to ground points have more support. The support is normalized to compensate for perspective effects and accumulated on the reference plane for all camera views. The detection of people on the reference plane becomes a search for regions of local maxima in the accumulator. Many false positives are filtered by checking the visibility consistency of the detected candidates against all camera views. The remaining candidates are tracked using Kalman filters and appearance models. Experimental results using challenging data from PETS`06 show good performance of the method in the presence of severe occlusion. Ground truth data also confirms the robustness of the method. (C) 2010 Elsevier B.V. All rights reserved.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also strip objects are considered. Moreover, 2D and 3D problems are treated. Twice-differentiable models for all these problems are presented. A strategy to reduce the complexity of evaluating the models is employed and, as a consequence, instances with a large number of items can be considered. Numerical experiments show the flexibility and reliability of the new unified approach. (C) 2007 Elsevier Ltd. All rights reserved.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this paper, we determine the lower central and derived series for the braid groups of the projective plane. We are motivated in part by the study of Fadell-Neuwirth short exact sequences, but the problem is interesting in its own right. The n-string braid groups B(n)(RP(2)) of the projective plane RP(2) were originally studied by Van Buskirk during the 1960s. and are of particular interest due to the fact that they have torsion. The group B(1)(RP(2)) (resp. B(2)(RP(2))) is isomorphic to the cyclic group Z(2) of order 2 (resp. the generalised quaternion group of order 16) and hence their lower central and derived series are known. If n > 2, we first prove that the lower central series of B(n)(RP(2)) is constant from the commutator subgroup onwards. We observe that Gamma(2)(B(3)(RP(2))) is isomorphic to (F(3) X Q(8)) X Z(3), where F(k) denotes the free group of rank k, and Q(8) denotes the quaternion group of order 8, and that Gamma(2)(B(4)(RP(2))) is an extension of an index 2 subgroup K of P(4)(RP(2)) by Z(2) circle plus Z(2). As for the derived series of B(n)(RP(2)), we show that for all n >= 5, it is constant from the derived subgroup onwards. The group B(n)(RP(2)) being finite and soluble for n <= 2, the critical cases are n = 3, 4. We are able to determine completely the derived series of B(3)(RP(2)). The subgroups (B(3)(RP(2)))((1)), (B(3)(RP(2)))((2)) and (B(3)(RP(2)))((3)) are isomorphic respectively to (F(3) x Q(8)) x Z(3), F(3) X Q(8) and F(9) X Z(2), and we compute the derived series quotients of these groups. From (B(3)(RP(2)))((4)) onwards, the derived series of B(3)(RP(2)), as well as its successive derived series quotients, coincide with those of F(9). We analyse the derived series of B(4)(RP(2)) and its quotients up to (B(4)(RP(2)))((4)), and we show that (B(4)(RP(2)))((4)) is a semi-direct product of F(129) by F(17). Finally, we give a presentation of Gamma(2)(B(n)(RP(2))). (C) 2011 Elsevier Inc. All rights reserved.