background and aims. orientation of the occlusal plane is one of the most important clinical procedures in prosthodontic rehabilitation of edentulous patients. the aim of this study was to define the best posterior reference point of ala-tragus line for orientation of occlusal plane for complete denture fabrication. materials and methods. fifty-three dental students (27 females and 26 males) wi...

We study three problems in combinatorial geometry. The problems investigated are con ict-free colorings of point sets in the plane with few colors, polychromatic colorings of the vertices of rectangular partitions in the plane and in higher dimensions and polygonalizations of point sets with few re ex points. These problems are problems of discrete point sets, the proofs are of combinatorial av...

We revisit an integrable (indeed, superintegrable and solvable) many-body model introduced almost two decades ago by Gibbons and Hermsen and by Wojciechowski, and we modify it so that its generic solutions are all isochronous (namely, completely periodic with fixed period). We then show how this model (or rather the more basic dynamical system that underlies its solvable character, and other av...

We present an algorithm for solving polynomial equations, which uses generalized eigenvalues and eigenvectors of resultant matrices. We give special attention to the case of two bivariate polynomials and the Sylvester or Bezout resultant constructions. We propose a new method to treat multiple roots, detail its numerical aspects and describe experiments on tangential problems, which show the ef...

We present a cutting plane algorithm for solving the following telecommunications network design problem: given point-to-point traffic demands in a network, specified survivability requirements and a discrete cost/capacity function for each link, findminimum cost capacity expansions satisfying the given demands. This algorithm is based on the polyhedral study described in [19]. In this paper we...

An extended version of Kelley’s cutting plane method is introduced in the present paper. The extended method can be applied for the solution of convex MINLP (mixed-integer non-linear programming) problems, while Kelley’s cutting plane method was originally introduced for the solution of convex NLP (non-linear programming) problems only. The method is suitable for solving large convex MINLP prob...

A computational approach to limit solutions is considered most challenging for two major reasons. A limit solution is likely to be non-smooth such that certain non-differentiable functions are perfectly admissible and make physical and mathematical sense. Moreover, the possibility of non-unique solutions makes it difficult to analyze the convergence of an iterative algorithm or even to define a...

In this paper we discuss the implementation of parallel multigrid methods on unstructured locally refined meshes for 2D linear elasticity calculations. The problem of rebalancing the workload of the processors during execution of the program is discussed in detail and a load balancing algorithm suited for hierarchical meshes is proposed. For large problems the efficiency per multigrid iteration...

Two parameters are identified for characterizing the deformation in the plastic zone near the tip of a crack when mixed mode conditions prevail. Details of the near-tip stress and strain distributions are presented f or hardening materials in which a diffus e plastic zone occurs under plane stress conditions. For small scale yielding the two near-tip parameters are related to the two elastic s ...