The aim of this study is to develop a scale for teachers’ evaluation the distance education process and examine evaluations according variables gender occupational seniority with measurement tool. sampling research consists 616 secondary school teachers who work in large city south Turkey, selected by cluster method. In analysis data, respectively; exploratory confirmatory factor analysis, Cron...

The Falconer conjecture says that if a compact planar set has Hausdorff dimension > 1, then the Euclidean distance set ∆(E) = {|x − y| : x, y ∈ E} has positive Lebesgue measure. In this paper we prove, under the same assumptions, that for almost every ellipse K, ∆ K (E) = {||x − y|| K : x, y ∈ E} has positive Lebesgue measure, where || · || K is the norm induced by an ellipse K. Equivalently, w...

In [2] the pseudo-metric distmax min on compact subsets A and B of a topological space generated from arbitrary metric space is defined. Using this notion we define the Hausdorff distance (see e.g. [6]) of A and B as a maximum of the two pseudo-distances: from A to B and from B to A. We justify its distance properties. At the end we define some special notions which enable to apply the Hausdorf...

In [1] the pseudo-metric dist min on compact subsets A and B of a topological space generated from arbitrary metric space is defined. Using this notion we define the Hausdorff distance (see e.g. [5]) of A and B as a maximum of the two pseudo-distances: from A to B and from B to A. We justify its distance properties. At the end we define some special notions which enable to apply the Hausdorff d...

In this paper, we determine the parameters of Z q-MacDonald Code of dimension k for any positive integer q ≥ 2. Further, we have obtained the weight distribution of Z q-MacDonald code of dimension 3 and furthermore, we have given the weight distribution of Z q-Simplex code of dimension 3 for any positive integer q ≥ 2. and Minimum Hamming distance.

A finite set of vectors \(\mathcal {X}\) in the d-dimensional Euclidean space \(\mathbb {R}^d\) is called a 2-distance set, if mutual distances between distinct elements has cardinality exactly 2. In this note we report, among other things, results computer-aided enumeration sets {R}^4\).