Regular textures can be modelled as consisting of periodic patterns where a fundamental unit, or texel, occurs repeatedly. This paper explores the use of a representation of texel geometry for classification and comparison of regular texture images. Texels are automatically extracted from images and the distribution of texel shape and orientation is modelled. The application of this model to im...

What is the smallest circular or square wall hole that a regular tetrahedron can pass? This problem was solved by Itoh–Tanoue– Zamfirescu [8]. Then, we settled the case of equilateral triangular hole in [1]. Motivated by these results, we consider the corresponding problems in higher dimensions. Among other results, we determine the minimum (n−1)-dimensional ball hole that a unit regular n-simp...

In this work we use the GPU porting task for the operative Japanese weather prediction model “ASUCA” as an opportunity to examine productivity issues with OpenACC when applied to structured grid problems. We then propose “Hybrid Fortran”, an approach that combines the advantages of directive based methods (no rewrite of existing code necessary) with that of stencil DSLs (memory layout is abstra...

Submit Manuscript | http://medcraveonline.com Abbreviations: BHU: Basic Health Unit; BMI: Body Mass Index; EDS: Excessive Daytime Sleepiness; ESS: Epworth Sleepiness Scale; ICSD-3: International Classification of Sleep Disorders -3a edition; NRPE: Non-Regular Physical Exercise; PSQI: Pittsburgh Sleep Quality Index; RPE: Regular physical Exercise; SCF: Statement of Consent Form; SF-36: Medical O...

Submit Manuscript | http://medcraveonline.com Abbreviations: BHU: Basic Health Unit; BMI: Body Mass Index; EDS: Excessive Daytime Sleepiness; ESS: Epworth Sleepiness Scale; ICSD-3: International Classification of Sleep Disorders -3a edition; NRPE: Non-Regular Physical Exercise; PSQI: Pittsburgh Sleep Quality Index; RPE: Regular physical Exercise; SCF: Statement of Consent Form; SF-36: Medical O...

Let K denote the class of functions g(z) = z + a 2 z 2 + ··· which are regular and univalently convex in the unit disc E. In the present note, we prove that if f is regular in E, f (0) = 0, then for g ∈ K, f (z) + αzf (z) ≺ g(z) + αzg (z) in E implies that f (z) ≺ g(z) in E, where α > 0 is a real number and the symbol " ≺ " stands for subordination.

We prove #P-completeness for counting the number of forests in regular graphs and chordal graphs. We also present algorithms for this problem, running in O∗(1.8494m) time for 3-regular graphs, and O∗(1.9706m) time for unit interval graphs, where m is the number of edges in the graph and O∗-notation ignores a polynomial factor. The algorithms can be generalized to the Tutte polynomial computation.

Let [Formula: see text] be a nonempty set and let the full transformation semigroup on text]. The main objective of this paper is to study subsemigroup defined by where fixed subset We describe regular elements in text], show that if only finite. characterize unit-regular prove Green’s relations also determine ideals investigate its kernel. This extends several results have appeared literature.

We prove #P-completeness for counting the number of forests in regular graphs and chordal graphs. We also present algorithms for this problem, running in O∗(1.8494m) time for 3-regular graphs, and O∗(1.9706m) time for unit interval graphs, where m is the number of edges in the graph and O∗-notation ignores a polynomial factor. The algorithms can be generalized to the Tutte polynomial computation.

Let K n denote a regular n-gon with unit side length. For two regular polygons K n and K m let the relative Newton number N(K n ; K m) of K n and K m be the maximum number of congruent copies of K m that can touch K n without having interior points in common. In this paper we determine the exact value of N(K n ; K m) for various pairs (n; m).