• Minecraft
    New surival map! now open!
  • Ohio Northern University
    See what's happening at ONU
  • Computer Science
    Read my latest CS Articles!



Matt on Facebook Kyltmer.com RSS Matt on Twitter Matt on G+

Minecraft Server Updated

The Server at mc.kyltmer.com has been updated to Minecraft 1.5.2 Beta. Clients may be updated.

- Matt

Minecraft Surival Map is live

The evaluation period is over and the new map has been born.

Play for free at http://mc.kyltmer.com/

 

- Matt

New Minecraft Server Website Created.

Website at http://mc.kyltmer.com/ has just been put up. This is the hub for news and downloads for our Minecraft Server.

The server itself, also at address “mc.kyltmer.com” and the default port for 25565, should be online sometime EARLY this week and will be effectively permanent.

Cya soon.
- Matt

Minecraft 1.5 Experimental Server

I’ve been wanting to bring a Minecraft server back. SO…….. for the next two weeks, I’ll be hosting a 1.5 Minecraft server for evaluation purposes!

Help test the server by playing around on: dns.kyltmer.com:7332

Like I said, I’m gonna be hosting this for two weeks. I plan to have it up until March 30, 2013 and have a decision whether to put a full-time server BACK in place by the beginning of April.

I’m going to need the help of my friends to complete this evaluation, because I’m going to need YOUR FEEDBACK on how the server runs and what needs to be improved upon.

I’m going to be setting up a Facebook event as well to help get attention for this server. There you can read EXACTLY the same information that is being presented here. I (as I’ve said) would REALLY appreciate your comments on the server either as posts to the Fb event or as replies to this post on kylt.com

Have a fun time playing. I hope we can get a decent server running this year!

 

- Matt

Java Threading

In computer programming, multi-threading is allowing a program to run at multiple point of the code at once. (so to speak…)

If you create a new thread, you allow code to be executed con-currently to the thread that created that thread.

We can go about defining a new thread in Java like this….

public class MyThread extends Thread {
     public void run() {
          // Do stuff here.
     }
}

To create a thread we need to extend from Thread (this creates the Runnable for us).  ”run,” here, is an override from Thread.run().  By overriding we can define the functionality for this thread.

To call the thread, we can do this…

MyThread mt = new MyThread();
mt.start();

This starts MyThread.run() in a separate thread with con-current running time to the thread in which MyThread.start() is called.

 

- Matt

Stack

A stack is a ‘first in, last out’ data structure. A stack data structure can be thought literally of things in the real world being stacked on top of each other.  When something is placed (pushed) on the top is the the next thing that will be taken (popped) off of that stack.

Operations on a stack: push(object); pop(); top(); empty();

class Stack {
     StackNode top;

     Stack() {
          top = null;
     }

     void push(type value) {
          top = new StackNode(value, top);
          return;
     }

     type pop() {
          type value = top.value;
          top = top.next;
          return value;
     }

     type top() {
          return top.value;
     }

     bool empty() {
          return top == null;
     }

     class StackNode {
          type value;
          StackNode next;

          StackNode(type value, StackNode next) {
               this.value = value;
               this.next = next;
          }
     }
}

Merge sort

Merge Sort is a recursive ‘divide and conquer’ algorithm for sort a collection of objects.

void mergeSort(a[]) {
     if (a.Length < 2) return;
     array[] front = new array[a.Length / 2];
     array[] back = new array[a.Length - front.Length];
     for (int i = 0; i < front.Length; i++) front[i] = a[i];
     for (int i = 0; i < back.Length; i++) back[i] = a[front.Length + i];
     mergeSort(front);
     mergeSort(back);
     int i = 0, fi = 0, bi = 0;
     while ((fi < front.Length) && (bi < back.Length)) {
          if (front[fi] < back[bi]) a[i] = front[fi++];
          else a[i] = back[bi++];
          i++;
     }
     while (fi < front.Length) a[i++] = front[fi++];
     while (bi < back.Length) a[i++] = back[bi++];
     return;
}

League Nights Part 1

Just playing League of Legends with mah friends!

YouTube embed test

C “Hello World”

C is a very stripped down language used almost everywhere. Here’s how you’d get a program started.

#include "stdio.h" // Note 1

main(void) { // Note 2
     printf("Hello, World!"); // Note 3
     return 0; // Note 4
}

Notes:

  1. The #include directive tells the compiler to gather code from other files / libraries. “stdio.h” is the library for standard IO (input/output) and there is where the function printf is defined.
  2. main is the function called automatically with the program starts. By leaving off a return type, we are implicitly defining a return type of integer. void is a keyword to represent nothing. In this context it declares a list of zero formal parameters to main.
  3. This is the call to printf. printf simply prints text for an expression to the console.
  4. A return value of 0 from a C program tells the operating system that the program completed successfully. Any other return value would signal some sort of error escape from the program.