Please view the full post to see the Unity content.

Click the Start button to begin the Balloon’s journey.
Aid the Balloon by steering it to safety using the left and right keys.

I’d also like to add a special thank you to:

• Ben Carruthers for the present meshes
• Matthew Perkins for the music

Description of the System

This system manages new land development applications.  It accepts applications, manages the business process (interacts with Cadastre and the City Council) and notifies the applicant if their land development is approved or rejected.

Due to limitations of only having a one-man-band and limited time, some of the extra functionality, such as the DNR, NRW and EPA were stripped from the scope of the project. Given more time I would also have expanded the functionality to generate a quote to send the client and request an accept or reject message from the client.

Logical Layered Architecture Diagram

Interaction Diagram (Level 0) and Choreography

The Client lodges a development application with the Assessment Manager (AM) . The AM retrieves geographical information about the lot from Cadastre. The AM then sends this information to the City Council which processes the information and either approves or rejects the application.

Logical Layered Architecture

At the basic layer the system uses two services. The Cadastre service wraps the geographical information database. The City Council service provides logic for validating development applications.

At the process layer the Assessment Manager utilise both of the basic layer services to provide new functionality needed to carry the business model from start to finish.

At the enterprise layer exists the Application Portal, enabling the clients the ability to submit development applications into the assessment manager’s process.

SOA Design

The design was developed using a top-down approach, looking at what serviced needed to be developed, rather than the bottom-up, since the scenario did not have existing proven business models.  This process broke the system down into service packages. These services were designed with the idea of being re-usable with loose coupling. The basic services are more re-useable than the higher level services.

The system allows users to submit a development application via a website. This development application is sent to the assessment manager for retrieves information about the lot being developed from the Cadastre. This new information is sent with the development application to the City Council for validation. The result of the validation process is emailed to the applicant.

In an alternative design, I considered adding an additional data-centric service to store the Development Applications. I could then use this data to extend the functionality of the client’s web application. The reason for not doing this originally was due to the limitations of only having one person.

One assumption was that every application submitted to the City Council could be automated and required no human input. Another assumption was that every applicant had an email address handy for contact purposes.

Aspects of Service Orientation

• 1 Logic-Centric Service – provides reusability for other systems.
• 1 Data-Centric Service (Data Encapsulation) – able to abstract data.
• 1 Process-Centric Service/Asynchronous – Matches business model flow.
• 1 Web Application – Easy access, available on all operating systems.
• Loose-coupling – Elements of the system can change if required, it’s a fluid system made up of services.
• Reusable – Can be used again by other systems
• Abstraction – Data and details are hidden from view.

Physical Deployment Diagram

The system is spread across BPEL, LINUX and WINDOWS servers and a client pc.

Services technologies Table

Process-Oriented Service Internal Behaviour

The website has two main functions:

• Firstly, to provide an outlet of GODS related information (such as news, events and competitions) to the public and members alike.
• Secondly, to provide a  TAB (a system that manages internal competitions data).

The website features three area, one of the general public, one for the paid members of the society, and one for the GODS administrator.

The general public area allows access to everyone, giving the public the ability to learn about the Debating Society, find contact details, read about the external competitions that GODS participates in, public events (such as Charity and Comedy Nights) that GODS host, and membership details and benefits.

The members area allows paid members to receive special members only news and events, view members only resources (tips and tutorials), and look up their TAB results for previous debating weeks.

The administration area provides the GODS Admin the ability to maintain and adjust content on the website. It also contains the interface of the TAB system that is necessary to update the TAB database.

The website was created in Visual Studio 2008 using ASP.Net, AJAX, and MySQL Database.

Click here to see the GODS WEBSITE : www.gods.org.au

The transposition helper reads in ‘cipher text’ from a file and outputs every possible key and associated ‘plain text’ equivalent of the ‘cipher text’ for a given block size. As such it uses a brute force method, while there are faster, more optimized, means for find a transposition cipher key, I deemed it unnecessary to spend the time developing such an algorithm as this program met my requirements and solved my cipher text. (As a side note, I received a seven (7) for Cryptology, seven being the highest possible achievement on a scale of one to seven).

The Transposition Helper was tested up to a period (or block size) of 11, it therefore generated 11!(factorial) keys, which is approximately 40 million keys, but did take some time to finish.  Running the Transposition Helper up to a block size of 9 can be completed relatively fast.

A Transposition Helper example:

The following cipher text

eThu qkicr bnowo ffx lel

when passed through the Transposition Helper with a block size of three (3) would generate the following output into a textfile.

012
eThu qkicr bnowo ffx lel
021
ehTuq kcirb nwoof f xlle
102
Teh uqikc rbonw ofxf ell
120
The quick brown fox fell
201
heTqu ckibr wnofo fxlle
210
hTeq ucikb rwonf o xflel

Thus allowing us to see that the ‘cipher text’ could be decrypted using the key 120 (or BCA).

eThu qkicr bnowo ffx lel ==> The quick brown fox fell

Some Transposition Cipher Background Info:

Decryption can be done manually first by breaking the cipher text into blocks and then anagramming.

A transposition cipher permutes characters usually in a fixed period (d) and permutation (f).
Generally transposition ciphers can permute rows or columns and output in row or column order, in the above program only permutation of rows and output in row were considered.

Each block of characters is re-ordered using the permutation.
There are d! permutations of length d.  (Remember that d! = d X (d – 1)X (d – 2) X . . . X 2 X 1)
When d = 10 there are thus 3,628,800 keys.

A simple example:
Let the period d = 4, and the permutation f = (4 1 2 3).
Plaintext: CRYP TOGR APHY
Ciphertext: PCRY RTOG YAPH
To decrypt apply the inverse permutation:
f-1 = (2 3 4 1)

The assignment was developed using the NetBeans IDE, creating a Java Class Library called “DigitalCircuits”.

Basic Components

Most of these implementations are the same, so code was refactored by creating sub-classes such as CircuitComponent, Gate, BinaryGate, UnaryGate in order to avoid duplicating fields and code. Each of the individual Gate class implementations only include code that is unique to them, i.e. the name of the image file and the method for recomputing outputs.

Binary Gates

Unary Gates

LED Output

A digital LED component was used to display output states. An LED component has one input and no output terminals. The user interface of the LED is similar to a gate, but there are two images, one to be shown when the input is true and one to be shown when the input is false:

Switch Input

Input is supported by digital Switch component. The Switch component outputs either true or false depending on its state.

Gate Testing

Bit Adder Circuit

A Bit Adder circuit performs addition of one bit numbers using the other gates.
This circuit is designed to add together two one bit numbers (plus a carry bit). It produces a one bit number as output, plus a carry bit (if the addition overflows).

Bit Adder Component

To create an n-bit adder we would need to chain together n of these circuits. Displaying the entire circuit replicated many times is not ideal, so the entire circuit is encapsulated as a single digital component.

4 Bit Adder Circuit

Next, we’ll chain together a sequence of bit adders to create a 4-bit adder. Two higher level input and output components that allow 4-bit numbers to be entered and displayed in decimal form were created. These two components are DigitalInput and DigitalOutput respectively.

The DigitalInput and DigitalOutput Components were used with the Bit Adder Component to create the following 4-bit adder test circuit

Connecting Wires

To order to visually depict which components are connected Connecting Wires were added to the Components. Each Component in the Circuit Board container draws its incoming connections. This was an optional task only recommended for high achieving students.

The two main differences between connectN and a standard connect 4 (aka 4-in-a-row) are as follows:

• The game is over when the board is full.
• The winner has the highest number of connectN’s.

Overall this was a fabulous project,
Excellent concept and very well realised.

- Jane Turner
(Brisbane International Game Developers Association Representative)

Many modern video games focus on immersing the player; they use realistic graphics and interesting stories to draw the player into the game world, making them believe that they are part of the game, rather than an objective observer. While the use of graphics and narrative as an immersion tool is widespread within the gaming industry, modern games are lacking in the realistic representation of flora and fauna within the environment. The lack of an effective behavioural representation ruins the immersion for the player as the behaviours of the flora and fauna within the game are not convincing enough to maintain the illusion of a game world.

In the perfect world these behaviours would be modelled by Artificial Intelligence (AI), due to the time and budget constraints AI coders usually resort to using coding tricks rather than actual AI to make creatures within a game seem real. Background creatures usually wander aimlessly around the game world instead following a set of needs based behaviours. This project aimed to create a solution that will allow an AI team to implement realistic, needs based AI modelling into a game within the time and budget constraints of a large project.

The aim of this project was to create a reusable AI module (AiMe) that could be implemented into video games that are currently in development, quickly and efficiently. AiMe acting as the environmental AI engine for the game, calculating the behaviours of all flora and fauna within the game world. The AiMe module would be easier and cheaper to implement into a video game than any hard coded solution, proving a cost effective investment for any Game studio.

This project will allow studios to implement a realistic environmental AI simulation without spending costly time and resources creating a custom solution. The AiMe module will also be reusable, allowing studios to use it in many different games without having to create a new solution.

This project was being developed by the following people:

• Rowan Hellings
• Simon Rylance
• Jenny Hodgson
• David Gamer