A logical physical ontology is code theory, wherein reality is neither deterministic nor random. In light of Conway and Kochen’s free will theorem [1] and strong free will theorem [2], we discuss the plausibility of a third axiomatic option geometric language; the code theoretic axiom. We suggest freewill choices at the syntactically free steps of a geometric language of spacetime form the code...

Recently, a wealth of algorithms for the efficient coding of 3D triangle meshes have been published (e.g. [1,2,4,5,6,7,8]). All these focus on achieving the most compact code for the connectivity data, resulting in between 0.7 and 2 bits per triangle on the average. The geometric data, i.e. the vertex coordinates, are then coded in an order induced by the connectivity code, which is probably no...

We survey the role of symmetry in diffeomorphic registration of landmarks, curves, surfaces, images and higher-order data. The infinite dimensional problem of finding correspondences between objects can for a range of concrete data types be reduced resulting in compact representations of shape and spatial structure. This reduction is possible because the available data is incomplete in encoding...

The Gilbert type bound for codes in the title is reviewed, both for small and large alphabets. Constructive lower bounds better than these existential bounds are derived from geometric codes, either over Fp or Fp2 , or over even degree extensions of Fp. In the latter case the approach is concatenation with a good code for the Hamming metric as outer code and a short code for the Lee metric as a...

Let G be an n-dimensional geometric lattice. Suppose that 1 < e, f < n 1, e + f > n, but e and f are not both n 1. Then, in general, there are E, FE G with dimE=e, dimF=f, EvF=l, and dimEhF=e+f-n-l; any exception can be embedded in an n-dimensional modular geometric lattice M in such a way that joins and dimensions agree in G and M, as do intersections of modular pairs, while each point and lin...

Feature location is a major problem in supporting legacy code. Two methods, the Sojhare Reconnaissance technique and the Dependency Graph search method, have been proposed to help software engineers locate features in a program that needs to be modiped. Both methods have been developed and evaluated largely using relatively modern C code. This report describes preliminary experiences in adaptin...

This note presents a detailed and self-contained discussion of the Dirichlet problem of real Monge-Ampère equations in strictly convex domains and complex Monge-Ampère equations in strongly pseudo-convex domains. Sections 1.1 and 1.2 follow [2] and [3] respectively, while Sections 2.1, 2.2 and 2.3 are based on [5], [4] and [1] respectively. This note is written for lectures in the Special Lectu...

Since the angular deviation produced when shooting a QR code image by a camera would cause geometric distortion of the QR code image, the traditional algorithm of QR code image correction would produce distortion. Therefore this paper puts forward the algorithm which combines corner detection with convex hull algorithm. Firstly, binaryzation of the collected QR code image with uneven light is o...

Contour representation of binary object is increasingly used in image processing and pattern recognition. Chain code and crack code are popular methods of contour encoding. However, by using these methods, an accurate estimate of geometric features like area and perimeter of objects are difficult to obtain. Midcrack code, another contour encoding method, can help to obtain more accurate estimat...