Goliath Designs

OpenSource! System Information Monitor

admin — Wed, 30 Dec 2009 21:41:09 +0000

Forget about what you thought is possible, and embrace Change

System Information Monitor was born with the idea of breaking free from platforms and installers. 4 weeks and a lot of hacking later, we have success.

the Prototype

click to launch the prototype

the Product

the Tech

Features

» Monitors System Information

» Supports Windows, Linux, Unix, Solaris

» No Install, Launch from the browser

» 26 Different Skins

» Open Source

APIs Utilized

» Hyperic Sigar

» JFreeChart

» Swing Application Framework

» Substance

» Swing

Other boring info

The guts of System Monitor lay in concurrency. At any point in time System Monitor is utilizing a thread pool in order to poll information from the operating system. Each of these sources respond at very diferrent rates so the thread pool keeps things flowing in at a near constant rate.

sharing is Caring

Sourceforge

http://sysinfomonitor.sourceforge.net

Subversion

svn co https://sysinfomonitor.svn.sourceforge.net/svnroot/sysinfomonitor sysinfomonitor

the Glorious Code

Because documentation comes first!

Online JavaDocs

Snatch it!

System Information Monitor

Just a taste

// only a snippet to protect the eyes

    @Override
    public void update() {
        final int currentCpu = this.cpu;

        Runnable updateData = new Runnable() {

            public void run() {
                chart.setNotify(false);

                LinkedList> cpuHistory = cpuProcess.getCpuHistory();
                LinkedList cpu;

                counter = counter.add(BigInteger.ONE);

                if (dataset.getColumnCount() > 0) {
                    dataset.removeColumn(0);
                }

                if (currentCpu == -1) {
                    // Number of CPUs
                    for (int i = 0; i < cpuHistory.size(); i++) {
                        cpu = cpuHistory.get(i);
                        dataset.addValue((Number) cpu.getFirst(), i, counter);
                    }
                } else {
                    if (currentCpu < cpuHistory.size()) {
                        cpu = cpuHistory.get(currentCpu);
                        dataset.addValue((Number) cpu.getFirst(), currentCpu, counter);
                    }
                }

                chart.setNotify(true);
                chart.fireChartChanged();
            }
        };
        SwingUtilities.invokeLater(updateData);
    }

    /**
     * Moves all the data from the CpuProcess to the dataset.  This operation
     * will do a complete replace on the dataset information.
     */
    private void moveData() {
        final int currentCpu = this.cpu;

        Runnable updateData = new Runnable() {

            public void run() {
                chart.setNotify(false);
                dataset.clear();

                LinkedList> cpuHistory = cpuProcess.getCpuHistory();
                LinkedList cpu;

                if (currentCpu == -1) {
                    // Number of CPUs
                    for (int i = 0; i < cpuHistory.size(); i++) {
                        cpu = cpuHistory.get(i);

                        BigInteger beforeCount = counter;

                        // Number of datapoints
                        for (int j = 0; j < cpu.size(); counter = counter.add(BigInteger.ONE), j++) {
                            dataset.addValue((Number) cpu.get(j), i, counter);
                        }

                        counter = beforeCount;
                    }
                } else {
                    cpu = cpuHistory.get(currentCpu);

                    BigInteger beforeCount = counter;

                    // Number of datapoints
                    for (int j = 0; j < cpu.size(); counter = counter.add(BigInteger.ONE), j++) {
                        dataset.addValue((Number) cpu.get(j), currentCpu, counter);
                    }

                    counter = beforeCount;
                }

                counter = counter.add(BigInteger.valueOf(cpuHistory.get(0).size()));

                chart.setNotify(true);
                chart.fireChartChanged();
            }
        };
        SwingUtilities.invokeLater(updateData);
    }
}

PHASE – 10 Weeks, Start to Finish

admin — Wed, 30 Dec 2009 21:39:17 +0000

a 3d Engine, a 3d World, a 3d Game, everything from scratch

the Concept

the Creation

in the wild

the Ups and Downs

5 things that went right

» Implemented all game mechanics

» Created a node based graphics engine

» Create a configuration manager

» Extremely motivated developers

» Early specialization of developers

5 things that went wrong

» Lua integration

» Learning curve for design patterns

» Not focusing on cohesion

» Not testing builds on other machines

» Destructors were put off till the end of development

5 things that should have changed

» More focus on gameplay

» Utilize Lua more

» Focus on learning openGL

» Learn advanced Visual Studio practices

» Stress documentation

TDD for the win – AES Encryption

admin — Wed, 30 Dec 2009 21:35:51 +0000

Because documentation > testing && testing > coding

The Standard

» No cow-boy coding here! FIPS-197

Don’t worry, I got it Covered

and I’ll tell you exactly how too.

better yet, I’ll show you.

AES_java

// only a snippet because I care about your eyes
// but click here for the uncensored code

  /**
   * Applies S-Box substitution to each byte of a state matrix.
   *
   * @param s
   *          A state matrix having Nb columns and 4 rows.
   * @return s, after S-box substitution is applied to each byte.
   */
  protected int[][] subBytes(int[][] s) {
    for (int i = 0; i < 4; i++) {
      for (int j = 0; j < Nb; j++) {
        s[i][j] = subWord(s[i][j]) & 0xFF;
      }
    }
    return s;
  }

  /**
   * Applies S-box substitution to each byte of a 4-byte word.
   *
   * @param w
   *          A 4-byte word.
   * @return w, after S-box substitution is applied to each byte.
   */
  protected static int subWord(int w) {
    int subWord = 0;
    for (int i = 24; i >= 0; i -= 8) {
      int in = w << i >>> 24;
      subWord |= sBox[in] << (24 - i);
    }
    return subWord;
  }

  /**
   * Multiplies x times a polynomial b(x) in GF(2^8) modulo the irreducible
   * polynomial m(x) = x^8+x^4+x^3+x+1. (i.e. m(x) = 0x11b).
   *
   * @param b
   *          A polynomial b(x) = b7x^7+b6x^6+b5x^5+b4x^4+b3x^3+b2x^2+b1x+b0 in
   *          GF(2^8).
   * @return xb(x) mod x8+x4+x3+x+1.
   */
  protected static int xtime(int b) {
    if ((b & 0x80) == 0)
      return b << 1;
    return (b << 1) ^ 0x11b;
  }
}