‎let $v$ be a vector space over a field $f$ of characteristic $pgeq 0$ and let‎ ‎$t$ be a regular subgroup of the affine group $agl(v)$‎. ‎in the finite dimensional case we show that‎, ‎if $t$ is abelian or $p>0$‎, ‎then $t$ is unipotent‎. ‎for $t$ abelian‎, ‎pushing forward some ideas used in [a‎. ‎caranti‎, ‎f‎. ‎dalla volta and m‎. ‎sala‎, ‎abelian regular subgroups of the affine group and r...

Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of p-ary linear codes with two or three weights are constructed from quadratic Bent functions over the finite field Fp, where p is an odd prime. They include some earlier linear codes as special cases. The weight distributions...

Some referring expressions, such as pronominal this and that, are particularly difficult to resolve automatically and, therefore, are treated minimally if at all by most reference resolution systems. Other referring expressions, such as he, she, and they, are treated by many systems but, as yet, not with sufficient accuracy. We describe a system called CROSS (CoReference for the OntoSem2 langua...

Isogonal polyhedra are those polyhedra having the property of being vertextransitive. By this we mean that every vertex can be mapped to any other vertex via a symmetry of the whole polyhedron; in a sense, every vertex looks exactly like any other. The Platonic solids are examples, but these are bounded polyhedra and our focus here is on infinite polyhedra. When the polygons of an infinite isog...

Our aim in this paper is to analyse a variation on a simple random walk that may tend to speed up the cover time of a connected graph. This variation is just one of several possible approaches which include (i) non-bactracking walks, see Alon, Benjamini, Lubetzky and Sodin [3], (ii) walks that prefer unused edges, see Berenbrink, Cooper and Friedetzky [4] or (iii) walks that a biassed toward lo...

We give a new lower bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≥ 14 ¥ n 2 ¦ ¥ n−1 2 ¦ ¥ n−2 2 ¦ ¥ n−3 2 ¦ and we extend the proof of the result to pseudolinear drawings of Kn.

Technosphere insulin (TI), an inhaled insulin with a fast onset of action, provides a novel option for the control of prandial glucose. A euglycemic glucose clamp study was performed to compare the effects of TI and regular human insulin (RHI) on the induced glucose infusion rate (GIR) in healthy volunteers. Generation of a dose-response relationship between insulin dose and effect (expressed a...

Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes with a few weights are constructed from inhomogeneous quadratic functions over the finite field GF(p), where p is an odd prime. They include some earlier li...