Finish 2012-11-07 16:00:00 UTC

Quick15 Simpler

by Nicholas Howe

Status: Passed
Results: 1444 (cyc: 7, node: 440)
CPU Time: 10.104
Score: 1457.27
Submitted at: 2012-11-03 02:55:21 UTC
Scored at: 2012-11-03 03:01:05 UTC

Current Rank: 1210th (Highest: 1st )
Based on: Quick15 (diff)
Basis for: Quick16 (diff)

Comments
Please login or create a profile.
Code
function xyOut = solver(a, xyIn, wts)

rand('seed',2) % Make xyIn cases independent. Currently optimizing as a whole set

N=length(wts);


X=logical(speye(N));
D=inf(N);

D(X)=0;
for n=1:20,
    X=((a*X)>0)&(D>n);
    D(X)=n;
end


E=D-repmat(mean(D),N,1)-repmat(mean(D)',1,N)+mean(D(:));

[xyOut0,nill]=svd(E);
xyOut0=xyOut0(:,1:2); 

xyOut = xyOut0;

for ncut=1:2
    M=a+eye(size(a)); 
    Mbeta=(((0.9)*eye(N)+0.1*bsxfun(@rdivide,M,sum(M,2)))^10);
    for n1=1:120
        xyOut=Mbeta*xyOut;
        mxyOut=mean(xyOut,1);
        [c1,d1,c2]=svd(cov(xyOut,1));
        xyOut=(xyOut-mxyOut(ones(N,1),:))*c1*diag(1./sqrt(.1+diag(d1)))*c2'; %sqrtm(pinv(.1*eye(2)+cxyOut));
    end
    [i,j]=find(a>0.01); 
    dd=sum((xyOut(i,:)-xyOut(j,:)).^2,2);
    k=find(dd>4*mean(dd));
    if isempty(k), break; end
    a(i(k)+N*(j(k)-1))=0.009;
end
xyOut0=xyOut;

xyOut0=sqrt(N)*detrend(xyOut0,'constant')*diag(1./max(eps,std(xyOut0,1,1)));
% K=10;
k=5;
[sxyOut0,idxequal]=sortrows(round(15*xyOut0)/15);
idxequal=idxequal(all(~diff(sxyOut0,1,1),2));
xyOut=round(xyOut0);
while size(unique(xyOut,'rows'),1)~=N
    k=k*1.1;
    xyOut=xyOut0*k;
    xyOut(idxequal,:)=(xyOut0(idxequal,:)+randn(numel(idxequal),2)/10)*k;
    xyOut=round(xyOut);
end
if N<35 % small map knot lines
 xyOut=3*xyOut+(randi(3,N,2)-2);
end

dxy = round(wts*(xyOut-xyIn)./sum(wts)); % Howe's
xyOut = bsxfun(@minus,xyOut,dxy);

end