Digital Circles Research Articles

The effect of the physical education program in improving motor coordination and adaptive behavior for students with mild mental disabilities

Mental disability has become viewed as a natural human phenomenon that requires dealing with it in a very positive manner. The mentally disabled have also become viewed as human individuals who deserve more care and attention in their upbringing and education so that they have the ability to adapt to the demands of life and make their way to life. The limits permitted by their abilities and energies. Hence the importance of research into developing the motor compatibility of the disabled child in order to develop adaptive behavior for them. Physical education programs at an early stage for the mentally disabled are of particular importance because the child begins to search for himself and the world around him through motor wandering and motor experiences, so what he has learned becomes a basis. Knowledge is based on and built upon. The research was conducted on a sample of students from the Raja Institute for Mental Disability in the city of Hilla. They are students with mild mental disabilities who are capable of learning for the academic year 2023-2024. The number of students was (20) students who were divided into two equal groups. An experimental design with two groups (experimental and control) was used to achieve the research objectives. The researcher used motor compatibility tests represented by the test (running, digital circles, crawling), and the adaptive behavior scale prepared by the American Association for Mental Disability and which was developed in Jordan by Al-Kilani. And Al-Batsh (2000). The researcher concluded the following: The proposed physical education program has a positive effect in developing motor coordination and adaptive behavior in children with mild mental disabilities (who are capable of learning). Implementing the proposed program for the mentally disabled in addition to preparing special programs for this group, due to its effective impact on developing both motor and cognitive abilities.

Sexual Norms Across Pornography Use, Sexual Fantasy, and In-Person Sexuality.

Sexual norms define perceptions of who is acceptable to partner with, how many partners are appropriate, and what sexual behaviors are acceptable to engage in. This shapes, in part, who has access to sexual pleasure and who is minoritized based on their sexuality. Though well theorized and researched for "in-person" sexuality, much less is known about sexual norms in other contexts/modalities, such as porn use and sexual fantasy, or how norms connect across these contexts. In the present study, we investigated sexual norms in porn, fantasy, and in-person sexuality, and similarities or differences between these. In an online study, gender/sex and sexually diverse participants (N = 706) manipulated digital circles representing porn use, sexual fantasy, and in-person sexuality. They used circle overlap to represent branchedness (i.e., distinction) and coincidence (i.e., similarity) in norm content, and circle size to indicate perceived norm strength. We found evidence that norm content was perceived to be more branched (i.e., distinct) than coincident (similar) and that norm strength for each context was high. This provides evidence that when people engage in each of these sexual contexts, they tend to do so through distinct normative lenses, rather than a singular lens that represents a universal set of norms applying across all sexual situations. This has implications for how we understand the associations between porn use, fantasy, and in-person sexuality, and highlights the importance of attending to sexuality in context.

The Number of Colon Crypts in Digital Mucosal Samples: A New Independent Parameter for Diagnosing Ulcerative Colitis.

It has been demonstrated that most routine biopsies from the colon and rectum display cross-cut crypts (CCC). The aim was to assess the number of CCC in microscopic isometric digital samples (0.500 mm2) from routine colon biopsies. Colon biopsies from 224 patients were investigated: 99 in patients with ulcerative colitis (UC), 31 UC in remission (UCR), 28 infectious colitis (IC), 7 resolved IC (RIC), 19 diverticular sigmoiditis (DS), and 40 normal colon mucosa (NCM). A total of 8,024 CCC were registered: 2,860 (35.6%) in UC, 1,319 UCR (16.4%), 849 (10.6%) in IC, 340 (4.2%) in RIC, 795 (9.9%) in DS, and 1,861 (23.2%) in NCM. The CCC frequencies in UC and IC were significantly lower (p<0.05) than those in UCR, RIC, DS, and NCM. By the simple algorithm of counting CCC in standardized isometric microscopic digital circles measuring 0.500 mm2, it was possible to differentiate between UC (long-lasting inflammation) and IC (short-lasting inflammation) on the one hand, and UCR, RIC, DS (persistent inflammation), and NCM, on the other. The counting of CCC in the algorithm by five pathologists working in three disparate European Countries, was found to be reproducible.

Sexual Orientation Across Porn Use, Sexual Fantasy, and In-Person Sexuality: Visualizing Branchedness and Coincidence via Sexual Configurations Theory.

Sexual orientation describes sexual interests, approaches, arousals, and attractions. People experience these interests and attractions in a number of contexts, including in-person sexuality, fantasy, and porn use, among others. The extent to which sexual orientation is divergent (branched) and/or overlapping (coincident) across these, however, is unclear. In the present study, a gender/sex and sexually diverse sample (N = 30; 15 gender/sex/ual minorities and 15 majorities) manipulated digital circles representing porn use, in-person sexuality, and fantasy on a tablet during in-person interviews. Participants used circle overlap to represent the degree of shared sexual interests across contexts and circle size to indicate the strength and/or number of sexual interests within contexts. Across multiple dimensions of sexual orientation (gender/sex, partner number, and action/behavior), we found evidence that sexual interests were both branched and coincident. These findings contribute to new understandings about the multifaceted nature of sexual orientations across contexts and provide a novel way to measure, conceptualize, and understand sexual orientation in context.

تصور مقترح لمخطط استراتیجیات التدریس التشارکیة عبر المنصات التعلیمیة الرقمیة. A Proposed Outline of Collaborative Teaching Strategies via Digital Instructional Platforms

هدف البحث إلى وضع تصور مقترح لمخطط بعض استراتيجيات التدريس التشارکية لتوظيفها عبر المنصات التعليمية الرقمية، واعتمد البحث على فلسفة استراتيجيات التدريس التشارکية في صياغة مراحلها بصورة إجرائية، وأسفرت نتائجه عن بعض النماذج المقترحة لاستراتيجيات التدريس التشارکية، والتي تمثلت في استراتيجية المحاکاة الرقمية والتي تمر بمراحل ثلاث؛ والتي اعتمدت في مراحلها على تنظيم الموقف التعليمي وتجزئته في صورة أدوار عدة، يقوم المشارکون بالاختيار من بينها، واستراتيجية الدوائر الرقمية والتي تعتمد على فعالية المتعلم داخل مجموعته عند أداء المهام التعليمية التشارکية، والتي تألفت من ثلاث مراحل رئيسة، واستراتيجية تکامل الخبرات الرقمية والتي تحقق الهدف منها بالمتعلم الخبير الذي يرقى في أدواره من متعلم إلى معلم داخل مجموعته، والتي تمر بمراحل ثلاث، واستراتيجية المزج بين المشکلات الافتراضية والواقعية، والتي تألفت من أربع مراحل رئيسة، ونجاحها يعتمد على صياغة خبرات تعليمية تعبر عن مشکلات يعايشها المتعلم أو يتخيلها عبر المنصة التعليمية الرقمية، واستراتيجية الفرق التنافسية الافتراضية، والتي استهدفت التنافس الإيجابي بين المتعلمين ورغبتهم في مزيد من التعلم للانتقال من مستوى أکاديمي إلى مستوى أعلى بالنسبة لخبرات التعلم المکتسبة، وقد تألفت من أربع مراحل رئيسة، ويوصي البحث بضرورة إجراء المزيد من الدراسات والبحوث التطبيقية والنوعية، التي تؤکد فعالية هذه النماذج المقترحة لاستراتيجيات التدريس التشارکية. The present research aimed to develop a suggested proposal of collaborative teaching strategies outline to be employed through digital educational platforms. The research is based on the philosophy of collaborative teaching strategies in formulating their phases in a procedural manner. The results of the research demonstrated some proposed models of collaborative teaching strategies, which were represented in the digital simulation strategy, which passes through three phases. The strategy relied on organizing the educational situation and dividing it into several roles to be chosen by the participants for developing the phases. The strategy of digital circles which depends on the effectiveness of the learner within his group when performing the collaborative educational tasks consisted of three main phases. The strategy of integrating digital experiences that achieves the goal of including the expert learner who progresses his role from a learner to a teacher within his group; such strategy passes through three phases. The strategy of blending hypothetical and realistic problems, which consisted of four main phases, and its success depends on the formulation of educational experiences that express problems encountered or imagined by the learner in the digital educational platform. The strategy of virtual competitive teams, which targeted positive competition among learners and their desire for more learning to move from an academic level to a higher level in relation to the acquired learning experiences, and it is consisted of four main phases. The research recommended conducting more applied and qualitative research investigating the effectiveness of such suggested strategies of collaborative teaching.

Recognition of Isothetic Arc Using Number Theoretic Properties

In this paper, we propose an arc recognition method based on the number theoretic properties of isothetic covers. A definition of digital circles is given based on the dilation of Euclidean circles with unit squares. We show that a variant of the digital circle is equivalent to the grid centers between the isothetic covers of disks. Number theoretic properties of the isothetic covers of disks are explored and show that the distribution of square numbers can be used to find the run lengths of the isothetic covers. Arc recognition algorithms are developed based on the number theoretic properties.

Fundamental group of the digital circle

An analog of extended real line, [Formula: see text]-sphere and [Formula: see text]-disc in the setting of digital topology has been provided and the fundamental group of the digital circle has been computed which comes out to be the additive group [Formula: see text] of integers.

On a Recursive Construction of Circular Paths and the Search for $$\pi $$ π on the Integer Lattice $$\mathbb {Z}^2$$ Z 2

Digital circles not only play an important role in various technological settings, but also provide a lively playground for more fundamental number-theoretical questions. In this paper, we present a new algorithm for the construction of digital circles on the integer lattice $$\mathbb {Z}^2$$ , which makes sole use of the signum function. By briefly elaborating on the nature of discretization of circular paths, we then find that this algorithm recovers, in a space endowed with $$\ell ^1$$ -norm, the defining constant $$\pi $$ of a circle in $$\mathbb {R}^2$$ .

Fast Estimation of Area-Coverage for Wireless Sensor Networks Based on Digital Geometry

In this paper, we propose a fast and nearly-accurate method of estimating the area covered by a set of $n$ identical and active sensor nodes that are randomly scattered over a 2D region. Since the estimation of collective coverage-area turns out to be computationally complex in the euclidean geometry, we represent each Euclidean circle in $\mathbb {R}^2$ with a digital circle in $\mathbb {Z}^2$ for enabling faster computation. Based on the underlying geometric properties of digital circles, we present a novel $O(n \log n)$ centralized algorithm and $O(d^2\log d)$ distributed algorithm for coverage estimation, where $d$ denotes the maximum degree of a node. In order to further expedite the estimation procedure, we approximate each digital circle by the tightest square that encloses it as well as by the largest square inscribed within it. Such approximation allows us to estimate the coverage-area, in a much simpler way, based on the intersection-geometry of a set of axis-parallel rectangles. Our experiments with random deployment of nodes demonstrate that the proposed algorithms estimate the area coverage with a maximum error of only 1.5 percent, while reducing the computational effort significantly compared to earlier work. The technique needs only simple data structures and requires a few primitive integer operations in contrast to classical methods, which need extensive floating-point computations for exact estimation. Furthermore, for an over-deployed network, the estimation provides an almost-exact measure of the covered area.

New parameter of roundness R: circularity corrected by aspect ratio

In this paper, we propose a new roundness parameter R, to denote circularity corrected by aspect ratio. The basic concept of this new roundness parameter is given by the following equation: $$ R=\mathrm{Circularity} + \left({\mathrm{Circularity}}_{\mathrm{perfect} \mathrm{circle}}-{\mathrm{Circularity}}_{\mathrm{aspect} \mathrm{ratio}}\right) $$ where Circularityperfect circle is the maximum value of circularity and Circularityaspect ratio is the circularity when only the aspect ratio varies from that of a perfect circle. Based on tests of digital circle and ellipse images using ImageJ software, the effective sizes and aspect ratios of such images for the calculation of R were found to range between 100 and 1024 pixels, and 10:1 to 10:10, respectively. R is thus given by $$ R = {\mathrm{C}}_{\mathrm{I}} + \left(0.913-{\mathrm{C}}_{\mathrm{AR}}\right) $$ where CI is the circularity measured using ImageJ software and CAR is the sixth-degree function of the aspect ratio measured using the same software. The correlation coefficient between the new parameter R and Krumbein’s roundness is 0.937 (adjusted coefficient of determination = 0.874). Results from the application of R to modern beach and slope deposits showed that R is able to quantitatively separate both types of material in terms of roundness. Therefore, we believe that the new roundness parameter R will be useful for performing precise statistical analyses of the roundness of particles in the future.

Speed Limit Road Sign Detection and Recognition System

Traffic signs in general and speed limit signs in particular are considered one of the most important means of traffic safety, and the aim of the current research is to design a system that detects and recognizes speed limit sign with high accuracy and high processing speed. At the beginning, red color objects are detected from the image and after finding the red color signs the circle is determined using Hough’s transform then from inside the circle, the numeric part from the circle image is extracted. Digital circle images are segmented to extract the number alone, and then these numbers are recognized by a trained neural network. Neural network achieved a success rate in recognition reached to 98.9%. Parallel programming concept is used to reduce the execution time using OpenMP and OpenCl programming. The study showed that the total execution speed according to the designed scheme to run the speed limit sign detection and recognition by using a mix of central processing unit with multi cores and graphics processing unit is 65 frames/sec for complete images and 90 frames/sec when cropping the effective part from the total size of the image. Recognition system is capable of recognizing the sign even if the vehicle speed exceeds 120 km/h.

A chronological and mathematical overview of digital circle generation algorithms – introducing efficient 4- and 8-connected circles

Circles are one of the basic drawing primitives for computers and while the naive way of setting up an equation for drawing circles is simple, implementing it in an efficient way using integer arithmetic has resulted in quite a few different algorithms. We present a short chronological overview of the most important publications of such digital circle generation algorithms. Bresenham is often assumed to have invented the first all integer circle algorithm. However, there were other algorithms published before his first official publication, which did not use floating point operations. Furthermore, we present both a 4- and an 8-connected all integer algorithm. Both of them proceed without any multiplication, using just one addition per iteration to compute the decision variable, which makes them more efficient than previously published algorithms.

Rotation invariant co-occurrence features based on digital circles and discrete Fourier transform

Grey-level co-occurrence matrices (GLCM) have been on the scene for almost forty years and continue to be widely used today. In this paper we present a method to improve accuracy and robustness against rotation of GLCM features for image classification. In our approach co-occurrences are computed through digital circles as an alternative to the standard four directions. We use discrete Fourier transform normalisation to convert rotation dependent features into rotation invariant ones. We tested our method on four different datasets of natural and synthetic images. Experimental results show that our approach is more accurate and robust against rotation than the standard GLCM features.

On covering a digital disc with concentric circles in [formula omitted

Digital circles and digital discs satisfy many bizarre anisotropic properties, understanding of which is essential for solving various problems in image analysis and computer graphics. In this paper we study the underlying properties of absentee pixels that appear while covering a digital disc with concentric digital circles. We present, for the first time, a mathematical characterization of these pixels based on number theory and digital geometry. Interestingly, the absentees occur in multitude, and we show that their count varies quadratically with the radius. The notion of infimum parabola and supremum parabola has been used to derive the count of these absentees. Using this parabolic characterization, we derive a necessary and sufficient condition for a pixel to be a disc absentee, and obtain the geometric properties of the absentees. An algorithm to locate the absentees is presented. We show that the ratio of the absentee pixels to the total number of disc pixels approaches a constant with increasing radius. Test results have been furnished to substantiate our theoretical findings.

Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary

The digital spaces have some properties that are not present in the Euclidean space. A digitized circle do not necessarily have the smallest (digital arc length) perimeter of all objects having a given area. In digital geometry various measures of perimeter and area lead to various definitions of digital circles using the digital version(s) of the isoperimetric inequality. Usually the square grid is used as digital plane with either the cityblock or the chessboard neighbourhood relation. In this paper the triangular grid is also used with two types of neighbourhood relation that play importance in Jordan curves. We search for those (digital) objects that have optimal measures and therefore they can be considered as digital circles by our definition. We show that special, (almost) regular hexagons are Pareto optimal, i.e. they fulfil both versions of the isoperimetric inequality: they have maximal area among objects having perimeter at most a given length; and they have minimal perimeter among objects enclosing at most a certain area. The optimal objects can be build in a similar way as the Wang-spiral for the square grid.

Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties

In this paper we provide an analytical description of various classes of digital circles, spheres and in some cases hyperspheres, defined in a morphological framework. The topological properties of these objects, especially the separation of the digital space, are discussed according to the shape of the structuring element. The proposed framework is generic enough so that it encompasses most of the digital circle definitions that appear in the literature and extends them to dimension 3 and sometimes dimension n.

Generalized Perpendicular Bisector and exhaustive discrete circle recognition

This paper presents a generalization of the notion of circumcenter as the intersection of perpendicular bisectors. We define Generalized Perpendicular Bisectors between two regions as an area where each point is the center of at least one circle crossing both regions. This allows us to determine all the possible discrete circle centers that cross a given set of pixels. The possible radii can then easily be determined. This exhaustive digital circle parameter computation is adapted to various types of circles/digitization schemes such as Naïve, Pythagorean and standard/supercover circles.

Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid

In this paper the nodes of the hexagonal grid are used as points. There are three types of neighbours on this grid, therefore neighbourhood sequences contain values 1, 2, 3. The grid is coordinatized by three coordinates in a symmetric way. Digital circles are classified based on digital distances using neighbourhood sequences. They can be triangle, hexagon, enneagon and dodecagon. Their corners and side-lengths are computed, such as their perimeters and areas. The radius of a digital disk is usually not well-defined, i.e., the same disk can have various radii according to the neighbourhood sequence used. Therefore the non-compactness ratio is used to measure the quality of approximation of the Euclidean circles. The best approximating neighbourhood sequence is presented. It is shown that the approximation can be improved using two neighbourhood sequences in parallel. Comparisons to other approximations are also shown.

Circular Motion Deblurring from a Single Image

In this paper, we present an algorithm to deblur the images degraded by the circular motion. We consider that the motion is driven by a constant acceleration and the point spread function is assumed to be unknown. Therefore, we perform motion estimation algorithms before deblurring the images. To deblur the images, we use a bidiagonalization algorithm employed together with Tikhonov regularization. Motion deblurring is perfomed at each circular motion path. The circular motion paths are obtained by using a digital circle generating algorithm. To obtain the complete deblurred images, deblurring results are combined. As the deblurred images are distorted by the empty pixels, the median filter is used to keep the images intact. Experimental results show the feasibility of the presented motion deblurring algorithm.

Digital circles of support: Meeting the information needs of older people

The UK Government strategy for aging in the 21st Century challenges conceptions of older people as passive recipients of care and promotes their engagement as active citizens. The strategy includes a commitment to test services which embody these principles with a range of innovative pilot projects. This paper summarises research on older people’s information needs and use which informed the design for one of these projects, Leeds Link-Age Plus. The research explored the complex circumstances around which older people access and use social and community information – a topic that has received limited attention in the literature. The paper is novel in considering how the use of informal networks for securing information, advice and advocacy can be supported by technology literate mediators, who may be older people, located within local community or voluntary organisations. Emphasising the mediator in design facilitates social contacts, directly addresses issues of trust and can reduce the chance of causing distress dealing with complex information. A model is suggested for using emerging technology to introduce new ways in which information for older adults can be improved by digital ‘circles of support’ – a form of social network where mediators collaborate to create and share self-authored content.