Randoμ

EURUSD 120min Mov Avg Exp Ribbon - Rate of Change

Σπeechless

Trendlines Rulez

And just at the moment I was wondering where the QQQs are headed on a daily basis a very informative chart popped out of nowhere, trying to shed some light into the future. Good old technical analysis at its best :)

Acme Pair

The same fractal looking formation of the relationship of VXX and XIV with purple smoothed dynamics underneath.

Refer to this post for the source code of the accompanying Acme System in EasyLanguage.

And another view on long term Fibonacci waving of EURUSD versus the aussie and the Nasdaq.

And still another taken on past February. Seems my favorite workspace huh?

A new bullish channel in the forming at Qs, maybe nearing the ceiling of the channel sometime soon though.

Mean Reveρsion Φracτal

The πerfect Neck & Shoulders?

EURUSD Fibonacci Update

Acme R revisited

Even a little smoother equity curve.
Not applicable to many other symbols though...
Optimization parameters :

RectangleLength = 5
RectangleRange = 4
RectangleFactor = 1.5
RectangleRatio = 0.8

Trading Session = Extended with Pre and Post Market

Tradestation Strategy Performance Report - GOOG 120 min

Khan Academy Avatars

Avatars were added to Khan Academy profiles recently 

I picked this one :)

Acme R System

Promising?

Tradestation Strategy Performance Report - GOOG 120 min (31.07.2009-31.01.2012)

Millionaire at last!

@Khan Academy of course ;)

21022012

EURUSD 52wk hi/lo no confirmation

EURAUD VXX Gold

Positive & negative correlation

Xmmm

EURUSD vs AUD vs QQQ

VXX vs 52wk hi/lo vs Gold

π as Pi not Pie

Since it is the current favicon I wanted to clarify this :)

CodingBat Array-3

Some neat pieces of code:

seriesUp
public int[] seriesUp(int n) {
  int len=n*(n+1)/2, k=1,num=0;
  int[] result=new int[len];
  for (int i=0;i<n;i++){
    for (int j=0;j<k&&i+j<len;j++){
      result[num++]=j+1;
    }
    k++;
  }
  return result;
}


maxMirror

public int maxMirror(int[] nums) {

  int len=nums.length,count=0,max=0,k=0;

  for (int i=0;i<len;i++){

    count=0;

    for (int j=len-1;i+count<len&&j>-1;j--){

      if(nums[i+count]==nums[j]){

        count++;

      }

      else{

        if (count>0){

          max=Math.max(count,max);

          count=0;

        }

      }

    }

    max=Math.max(count,max);

  }

  return max;

}


countClumps

public int countClumps(int[] nums) {

  int len=nums.length,count=0,result=0;

  for (int i=0;i<len;i++){

    count=0;

    for (int j=i;j<len;j++){

      if (nums[i]==nums[j]){

        count++;

      }

    }

    if (count>1){

      result++;

      i+=count-2;

      count=0;

    }

  }

  return result;

}

CodingBat String-3 sumNumbers

It puzzled me a bit so I thought to share this...

public int sumNumbers(String str) {
  int len=str.length(),sum=0,count=0;
  boolean num=false;
  String tmp="";
  for (int i=0;i<len;i++){
    if (Character.isDigit(str.charAt(i))){
      num=false;
      tmp="";
      count=0;
      for (int j=i;j<len;j++){
        if (Character.isDigit(str.charAt(j))){
          count++;
          num=true;
          tmp+=str.charAt(j);
        }
        else{
          if (num) {
            break;
          }
        }
      }
      if (tmp.length()>0){
        i+=count;
        sum+=Integer.parseInt(tmp);
      }
    }
  }
  return sum;
}