Intangible Assets as defined in AASB 138

Date group commenced operations 1 January 2000 (Y2K0) Group Asset Register Company name : Recticity Pty Ltd - a private Australian limited company Partnerships : KoalaCNC Registered business names : KoalaCNC       Registered Australian Trademarks Tyts AT-1730262 Womens Fashion Art AT-1618359 Grit Fashions AT-1639489 Photons3D AT-1694606 Cexy AT-1706657 Phairies AT-1717735 Slotball AT-1677981 KoalaCNC AT-1401642       Wholly owned fully developed internet infrastructure Ipresources.com (this website) Recticity.com with Cexy subsite Photonnica.com Photons3D.com RectiG.com RectiQ.com FSReflection.com WomensFashionArt.com Phairies.com GritFashions.com [ Technology websites - hidden from public view ]
© Recticity Pty Ltd  - a private Australian company
Recticity Group Home page Resourcing Contact Us Asset Register
IC Manufacture
Technology (protected)
Subsidiaries
Operating system dev
Applications dev
Systems architecture
Networks architecture
and Associates
Recti-SPOL (Syncopated Parallelisable Operational Language) Recti-PDP (Programming Desktop Protocol) Recti-PE (Programming Environment)
- (void) detectFocus {     int *greyData = malloc(width*height*sizeof(int));     // Grayscale     for (int i = 0; i < width*height; i++) {         int r = data[i*4 + 0];         int g = data[i*4 + 1];         int b = data[i*4 + 2];         int grey = ((r<<6)-(r<<3)-(r<<1)+(g<<7)+(g<<6)-(g<<3)+(b<<4)+(b<<1));         greyData[i] = grey;     }         long *sums = malloc(width*sizeof(long));     for (int x = 0; x < width; x++)         sums[x] = 0;         for (int y = 1; y < 21; y++)         for (int x = 0; x < width; x++)             sums[x] += greyData[y*width + x];         long *histHor = malloc(width*sizeof(long));     long *histVer = malloc(height*sizeof(long));     for (int x = 0; x < width; x++)         histHor[x] = 0;     for (int y = 0; y < height; y++)         histVer[y] = 0;         for (int y = 11; y < height-11; y++) {         long total = 0;                 for (int i = 0; i < 21; i++)             total += sums[i];                 for (int x = 11; x < width-11; x++) {             int index = (y*width + x)*4;             int bl = (int)(total / (21*21));             total -= sums[x-10];             total += sums[x+11];             int r = data[index+0];             int g = data[index+1];             int b = data[index+2];             int grey = (r<<6)-(r<<3)-(r<<1)+(g<<7)+(g<<6)-(g<<3)+(b<<4)+(b<<1);             grey -= bl;             grey = (grey > 0 ? grey : 0) >> 8;             g = grey + data[index+1];             data[index+1] = g < 255 ? g : 255;                         histHor[x] += grey;             histVer[y] += grey;         }                 for (int x = 0; x < width; x++) {             sums[x] -= greyData[(y-10)*width + x];             sums[x] += greyData[(y+11)*width + x];         }     }         for (int x = 0; x < width; x++) {