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

lasttry04

by Alfonso Nieto-Castanon

Status: Passed
Results: 1164 (cyc: 10, node: 1161)
CPU Time: 42.377
Score: 1212.27
Submitted at: 2012-11-07 15:43:58 UTC
Scored at: 2012-11-07 20:42:16 UTC

Current Rank: 6th (Highest: 4th )
Based on: try188 (diff)

Comments
Please login or create a profile.
Code
function xyOut = solver(a, xyIn, wts)
diag(sum(a));
[V,nill0]=eig(ans-a,ans);
N = length(a);
[p1i,p2i] = find( triu(a,1));
[pickr,pickc] = find(tril(true(length(p1i)),-1));

for ss=1:3
    [xy{ss} xy{ss+3}] = solver_alfonsoz (a, ss+1, N, V+rand(N)/25, 0);
end
xy{7} = solver_hannes(xyIn, N, V(:,2:3),0);

Nss=1;
for ss=1:Nss
    [xy{7+ss+(0:2)*Nss}] = solver_alfonsoz(a, ss+1, N, V+rand(N)/25, 1);
end

NN=inf(1,numel(xy));
for ss=find(cellfun('length',xy))
 NN(ss)=gradeIt(p1i,p2i,pickr,pickc,xy{ss});
end

[ZBest,best] = min(NN);
xyOut = xy{best};

xyOut = bsxfun(@minus,xyOut,round(wts*(xyOut-xyIn)./sum(wts)));

%%%sprev = rng(0,'twister');

for ii=1:2
for jiggle=1:15
 xyOutZ=xyOut+randi([-ii ii],N,2);
 gradeIt(p1i,p2i,pickr,pickc,xyOutZ);
 if ans<ZBest && size(unique(xyOutZ,'rows'),1)==N
  xyOut=xyOutZ;
  ZBest=ans;
 end
end
end

%%%rng(sprev);
end

function varargout = solver_alfonsoz(a, ss, N, V, newversion)
WXY0=2*pi*randn(3,200);
XYOUT0=cell(1,3);
if newversion
    ww=(.05:.9/N:.9499999999)';
    ww=(ww-.5)./sqrt(ww.*(1-ww));
    thr=0.001+ss*5.1e-2;
else
    thr=0.002+ss*5.1e-4;
end
thr_d=(3.15 + ss*0.102);
randn('seed',ss+10*newversion);
xyOut=V(:,2:3);
sN=sqrt(N);
for ncut=1:2+newversion
    Mbeta=((1-ss/15)*eye(N)+(ss/15)*bsxfun(@rdivide,a+eye(N),sum(a,2)+1))^10;
    for n1=1:117
        xyOut=Mbeta*xyOut;
        if newversion
            wxy0=WXY0(ncut,n1);
            wxy=[cos((0:3)/4*pi+wxy0);sin((0:3)/4*pi+wxy0)];
            [nill,wz]=sort(xyOut*wxy,1);
            for n2=1:size(wz,2), wz(wz(:,n2),n2)=ww; end
            xyOut=.5*xyOut+.5*wz*wxy';
        else
            bsxfun(@minus,xyOut,sum(xyOut)/N);
            [c1,D]=svd(ans');
            xyOut=ans*c1*diag(sN./(.1+D([1 4])))*c1';
        end
    end
    XYOUT0{ncut}=xyOut;
    [i,j]=find(a>thr);
    dd=sum((xyOut(i,:)-xyOut(j,:)).^2,2);
    mdd=mean(dd);
    k=find(dd>thr_d*mdd);
    if isempty(k), break; end
    a(i(k)+N*(j(k)-1))=thr*(~newversion+newversion*thr_d./dd(k));
end

if ~newversion
    XYOUT0{2}=xyOut;
    single_idx = find(sum(a)==1);
    [singles_link, nill0] = find(a(:,single_idx)==1);
    xyOut(single_idx,:)=xyOut(singles_link,:);
    XYOUT0{1}=xyOut;
    ncut=2;
end

for zsingle=1:ncut
    xyOut0=XYOUT0{zsingle};
    xyOut0=sqrt(N)*detrend(xyOut0,'constant')*diag(1./max(eps,std(xyOut0,1,1)));
    k=4+~newversion;
    [sxyOut0,idxequal]=sortrows(round(15*xyOut0));
    idxequal=idxequal(all(~diff(sxyOut0,1,1),2));
    xyOut=round(xyOut0);
    while size(unique(xyOut,'rows'),1)~=N
        k=k*(1.0+ss*0.055);
        xyOut=xyOut0*k;
        xyOut(idxequal,:)=(xyOut0(idxequal,:)+randn(numel(idxequal),2)/(9+ss))*k;
        xyOut=round(xyOut);
    end
    XYOUT0{zsingle}=xyOut;
end 
varargout=XYOUT0;
end

function xyOut = solver_hannes(xyIn, N, V,xyOut)
mult    = norm(max(xyIn)-min(xyIn))/norm(max(V)-min(V));
while size(unique(xyOut,'rows'),1)<N
    xyOut       = round(V*mult);
    [nill0,i]       = unique(xyOut,'rows');
    m           = setdiff(1:N,i);
    xyOut(m,:)  = xyOut(m,:) + randi([-1 1],length(m),2);
    mult        = mult*1.5;
end
end

function ans = gradeIt(p1i,p2i,pickr,pickc,XYnew)
  X = [XYnew(p1i,:) XYnew(p2i,:)];
  xa = X(pickr,:);
  xb = X(pickc,:);
  A13 = xa(:,1) - xa(:,3);
  A24 = xa(:,2) - xa(:,4);
  B13 = xb(:,1) - xb(:,3);
  B24 = xb(:,2) - xb(:,4);
  A = xb(:,1).*xb(:,4) - xb(:,2).*xb(:,3);
  B = xa(:,1).*xa(:,4) - xa(:,2).*xa(:,3);
  AA = (xa(:,1).*B24 - xa(:,2).*B13 + A) ...
     .*(xa(:,3).*B24 - xa(:,4).*B13 + A);
  BB = (xb(:,1).*A24 - xb(:,2).*A13 + B) ...
     .*(xb(:,3).*A24 - xb(:,4).*A13 + B);
 
  sum((AA <=0)  & (BB <=0));
end