analytic continuation of overconvergent eigenforms let f be an overconvergent p adic eigenform of level np r r 1 with non zero up eigenvalue we show how f may be analytically continued to a subset of x1 np r an containing for example all the supersingular locus using these results we extend the main theorem of bt to many ramified cases

multiple comparison of several linear regression models research on multiple comparison during the past 50 years or so has focused mainly on the comparison of several population means several years ago spurrier considered the multiple comparison of several simple linear regression lines he constructed simultaneous confidence bands for all of the contrasts of the simple linear regression lines over the entire range when the models have the same design matrices this article extends spurrier s work in several directions first multiple linear regression models are considered and the design matrices are allowed to be different second the predictor variables are either unconstrained or constrained to finite intervals third the types of comparison allowed can be very flexible including pairwise many one and successive two simulation methods are proposed for the calculation of critical constants the methodologies are illustrated with examples

appendix to the iwasawa conjecture for totally real fields by a wiles arithmetic minimal compactification of the hilbert blumenthal moduli spaces the arithmetic theory of toroidal compactification of the hilbert blumenthal moduli spaces was described in rapoport s thesis rap while the arithmetic theory of minimal compactification has been lacking for a long time after faltings work on the arithmetic compactification of siegel moduli spaces fa it was obvious to the experts that the same things could be done in the hilbertblumenthal case in similar but simpler ways in fact what emerged was a machinery to compactify moduli spaces coming from abelian varieties it turns out that the arithmetic minimal compactification of the hilbert blumenthal moduli spaces could have been done more than ten years ago rap contains everything that is needed so in some sense i am writing a summary and an appendix to rap the purpose of this appendix is to explain this remark and show that this theory of minimal compactification can be useful in number theory for instance one can replace for almost all primes by for all primes outside the level and the discriminant in the main result of br la two more applications are given here one about p adic monodromy the other about positivity of the hodge line bundle the sections of which are hilbert modular forms for a systematic exposition of the theory of semi abelian degeneration and compactification the reader is referred to the book fa ch where the more

formes modulaires p adiques de hilbert de poids 1 nous montrons un theoreme de relevement modulaire pour des representations galoisiennes p adiques de dimension 2 non ramifiees en p des corps totalement reels peu ramifies en p

three dimensional euclidean distance transformation and its application to shortest path planning in this paper we present a novel method to obtain the three dimensional euclidean distance transformation edt in two scans of the image the shortest path can be extracted based on the distance maps using the minimum value tracing the edt is obtained correctly and efficiently in a constant time for arbitrary types of images including the existence of obstacles by adopting the new dynamically rotational mathematical morphology we not only guarantee the collision free in the shortest path but also reduce the time complexity dramatically

pooling data for stability studies testing the equality of batch degradation slopes pharmaceutical products are routinely monitored for their stability over time stability studies generally consist of a random sample of dosage units e g tablets capsules vials from a batch or several batches placed in a storage room and periodically assayed for their drug content the degradation of the drug product is modeled and according to the guideline for submitting documentation for stability studies of human drugs and biologics food and drug administration 1987 the shelf life is calculated as the time point at which the lower 95 confidence limit about the fitted regression line crosses the lowest acceptable limit for drug content frequently 90 of the labeled amount when multiple batches are manufactured preliminary testing for any batch differences both slope and intercept should precede pooling stability data from all batches in the analysis the guideline recommends a level of significance of 25 for such preliminary testing based on the work described by bancroft 1964 biometrics 20 427 442 using such a large significance level helps ensure that the power of the test for the batch differences is sufficiently high this paper presents an approach whereby the power of the test is fixed and the significance level of the test needed to obtain this power is calculated from the data if the observed significance level does not achieve the calculated significance level then the data can be pooled examples will illustrate the relative performance of the fda guideline and the proposed procedure

new algorithms for euclidean distance transformation of an n dimensional digitized picture with applications abstract in this paper we propose a new method to obtain the euclidean distance transformation and the voronoi diagram based on the exact euclidean metric for an n dimensional picture we present four algorithms to perform the transformation which are constructed by the serial composition of n dimensional filters when performed by a general purpose computer they are faster than the method by h yamada for a two dimensional picture those algorithms require only one n dimensional array for storing input output pictures and a single one dimensional array for a work area if an input picture needs not be preserved

pooling batches in drug stability study by using constant width simultaneous confidence bands one important study objective in drug stability studies is to estimate the shelf life of a drug a key statistical problem involved in this is how to assess the practical equivalence of different batches of the same drug so that different batches can be subgrouped to produce a single shelf life for the drug in this paper constant width simultaneous confidence bands are proposed to quantify the magnitude of difference between different batches with a particular view to establish the practical equivalence of different batches this approach is suitable for the situation that the intercepts and slopes of the regression lines for the batches cannot be assumed to be equal it is shown how constant width simultaneous confidence bands can be easily constructed for the multiple comparison of several general linear regression models in particular it is shown that constant width simultaneous confidence bands have a better chance to establish the equivalence than and so are preferable to the hyperbola shaped simultaneous confidence bands considered j am stat assoc 2004 99 395 403

assessing nonsuperiority noninferiority or equivalence when comparing two regression models over a restricted covariate region in many scientific problems the purpose of the comparison of two regression models which describe the relationship between a same response variable and several same covariates for two different groups is to demonstrate that one model is no higher than the other by a negligible amount or to demonstrate that the models have only negligible differences and so they can be regarded as describing practically the same relationship between the response variable and the covariates in this article methods based on one sided pointwise confidence bands are proposed for assessing the nonsuperiority of one model to the other and for assessing the equivalence of two regression models examples from qt qtc study and from drug stability study are used to illustrate the methods

integral models of hilbert modular varieties in the ramified case deformations of modular galois representations and weight one forms we prove the strong artin conjecture for continuous totally odd two dimensional representations of the absolute galois group of a totally real field f

spatial planning a configuration space approach this paper presents algorithms for computing constraints on the position of an object due to the presence of ther objects this problem arises in applications that require choosing how to arrange or how to move objects without collisions the approach presented here is based on characterizing the position and orientation of an object as a single point in a configuration space in which each coordinate represents a degree of freedom in the position or orientation of the object the configurations forbidden to this object due to the presence of other objects can then be characterized as regions in the configuration space called configuration space obstacles the paper presents algorithms for computing these configuration space obstacles when the objects are polygons or polyhedra

classicality for small slope overconvergent automorphic forms on some compact pel shimura varieties of type c we study the rigid cohomology of the ordinary locus in some compact pel shimura varieties of type c with values in automorphic local systems and use it to prove a small slope criterion for classicality of overconvergent hecke eigenforms this generalises work of coleman and is a first step in an ongoing project to extend the cohomological approach to classicality to higher dimensional shimura varieties

efficient euclidean distance transform algorithm of binary images in arbitrary dimensions in this paper we propose an efficient algorithm i e pbedt for short to compute the exact euclidean distance transform edt of a binary image in arbitrary dimensions the pbedt is based on independent scan and implemented in a recursive way i e the edt of a d dimensional image is able to be computed from the edts of its d 1 dimensional sub images in each recursion all of the rows in the current dimensional direction are processed one by one the points in the current processing row and their closest feature points in d 1 dimensional sub images can be shown in a euclidean plane by using the geometric properties of the perpendicular bisector the closest feature points of d 1 dimensional sub images are easily verified so as to lead to the edt of a d dimensional image after eliminating the invalid points the time complexity of the pbedt algorithm is linear in the amount of both image points and dimensions with a small coefficient compared with the state of the art edt algorithms the pbedt algorithm is much faster and more stable in most cases

a euclidean distance transform using grayscale morphology decomposition a fast and exact euclidean distance transformation using decomposed grayscale morphological operators is presented applied on a binary image a distance transformation assigns each object pixel a value that corresponds to the shortest distance between the object pixel and the background pixels it is shown that the large structuring element required for the euclidean distance transformation can be easily decomposed into 3 spl times 3 windows this is possible because the square of the euclidean distance matrix changes uniformly both in the vertical and horizontal directions a simple extension for a 3d euclidean distance transformation is discussed a fast distance transform for serial computers is also presented acting like thinning algorithms the version for serial computers focuses operations only on the potential changing pixels and propagates from the boundary of objects significantly reducing execution time nonsquare pixels can also be used in this algorithm an example application shape filtering using arbitrary sized circular dilation and erosion is discussed rotation invariant basic morphological operations can be done using this example application

a mathematical morphology approach to euclidean distance transformation a distance transformation technique for a binary digital image using a gray scale mathematical morphology approach is presented applying well developed decomposition properties of mathematical morphology one can significantly reduce the tremendous cost of global operations to that of small neighborhood operations suitable for parallel pipelined computers first the distance transformation using mathematical morphology is developed then several approximations of the euclidean distance are discussed the decomposition of the euclidean distance structuring element is presented the decomposition technique employs a set of 3 by 3 gray scale morphological erosions with suitable weighted structuring elements and combines the outputs using the minimum operator real valued distance transformations are considered during the processes and the result is approximated to the closest integer in the final output image

overconvergent hilbert modular forms we generalize the construction of the eigencurve by coleman mazur to the setting of totally real fields and show that a finite slope hilbert modular eigenform can be deformed into a one parameter family of finite slope eigenforms the key point is to show the overconvergence of the canonical subgroup and the complete continuity of the u p operator we deduce this form some general considerations in rigid analytic geometry

modularity lifting in parallel weight one we prove an analogue of the main result of buzzard and taylor 8 for totally real elds in which p is unramied this can be used to prove certain cases of the strong artin conjecture over totally real elds

a morphological approach to shortest path planning for rotating objects this paper presents a mathematical morphology based approach to find the shortest path of an arbitrarily shaped moving object with rotations amid obstacles of arbitrary shapes by utilizing the proposed rotational morphology along with the continuous turning angle constraint the representation framework of the motion planning problem becomes simple and practical two vehicle models with different driving and turning systems are used in solving the path planning problem and their strategies are presented simulation results show that our algorithm works successfully in various conditions