I remember the day like it was yesterday. Pac Man had finally arrived on the Atari 2600.  It was a clear and sunny day, but it was slightly brisk. My dad drove us down to the video store about three miles from our Michigan house. If I remember correctly, the price for the game was $24.99.  It was quite expensive for the day, probably equaling a $70 game in today’s market, but it was mine. There *was* no question about it. If you purchase a game, it’s your game… right?

You couldn’t be more wrong.  With all the licensing agreements in games today, you only purchase the right to play it. You don’t actually “own” the game. 

Today, game designers want total control over the money that comes in for a game. They add in clauses that keep the game from being resold, rented, borrowed, copied, etc. All of the content in the game, including the items you find that are specifically for you, are owned by the software developer. Why, you ask, do they do this? It’s all about the money.

This need for greed started years ago, when people started modifying current games on the market. One of the first games like this was Doom. There were so many third part mods made, but because of licensing agreement, none of these versions were available for resale. The end user, or you, had to purchase Doom before they could even install the mod.  None of these “modders” were allowed to make any money off their creation.

A business rule is the basic unit of rule processing in a Business Rule Management System (BRMS) and, as such, requires a fundamental understanding. Rules consist of a set of actions and a set of conditions whereby actions are the consequences of each condition statement being satisfied or true. With rare exception, conditions test the property values of objects taken from an object model which itself is gleaned from a Data Dictionary and UML diagrams. See my article on Data Dictionaries for a better understanding on this subject matter.

A simple rule takes the form:

if condition(s)

then actions.

An alternative form includes an else statement where alternate actions are executed in the event that the conditions in the if statement are not satisfied:

if condition(s)

then actions

else alternate_actions

It is not considered a best prectice to write rules via nested if-then-else statements as they tend to be difficult to understand, hard to maintain and even harder to extend as the depth of these statements increases; in other words, adding if statements within a then clause makes it especially hard to determine which if statement was executed when looking at a bucket of rules. Moreoever, how can we determine whether the if or the else statement was satisfied without having to read the rule itself. Rules such as these are often organized into simple rule statements and provided with a name so that when reviewing rule execution logs one can determine which rule fired and not worry about whether the if or else statement was satisfied. Another limitation of this type of rule processing is that it does not take full advantage of rule inferencing and may have a negative performance impact on the Rete engine execution. Take a class with HSG and find out why.

Rule Conditions

Straight up and full disclosure. I'm prejudiced. As a research assignment, the heading is a joke. I'll give you the answer in two words, and then tell you why.

How does HTML 5 compare with flash? Answer: it doesn't.

Lest you think I dislike Adobe's Flash, let's put the cards on the table. I loved Flash. Long before Adobe was Adobe, they had a competitor called Macromedia. Adobe bought that firm. That made my life simpler. I only had to work with one vendor.

Flash was a pretty compelling solution. I used it to mimic operations in Windows to prepare people for the CompTIA exams. The only bugaboo was that dang right-click stuff. A little bit of code from the Microsoft Visual Studio .Net let me flip the left and right mouse buttons so that the right mouse button instead of controlling the Flash player, emulated doing a right-click in the Windows operating system.

I will begin our blog on Java Tutorial with an incredibly important aspect of java development:  memory management.  The importance of this topic should not be minimized as an application's performance and footprint size are at stake.

From the outset, the Java Virtual Machine (JVM) manages memory via a mechanism known as Garbage Collection (GC).  The Garbage collector

• Manages the heap memory.   All obects are stored on the heap; therefore, all objects are managed.  The keyword, new, allocates the requisite memory to instantiate an object and places the newly allocated memory on the heap.  This object is marked as live until it is no longer being reference.
• Deallocates or reclaims those objects that are no longer being referened. 
• Traditionally, employs a Mark and Sweep algorithm.  In the mark phase, the collector identifies which objects are still alive.  The sweep phase identifies objects that are no longer alive.
• Deallocates the memory of objects that are not marked as live.
• Is automatically run by the JVM and not explicitely called by the Java developer.  Unlike languages such as C++, the Java developer has no explict control over memory management.
• Does not manage the stack.  Local primitive types and local object references are not managed by the GC.

So if the Java developer has no control over memory management, why even worry about the GC?  It turns out that memory management is an integral part of an application's performance, all things being equal.  The more memory that is required for the application to run, the greater the likelihood that computational efficiency suffers. To that end, the developer has to take into account the amount of memory being allocated when writing code.  This translates into the amount of heap memory being consumed.

Memory is split into two types:  stack and heap.  Stack memory is memory set aside for a thread of execution e.g. a function.  When a function is called, a block of memory is reserved for those variables local to the function, provided that they are either a type of Java primitive or an object reference.  Upon runtime completion of the function call, the reserved memory block is now available for the next thread of execution.  Heap memory, on the otherhand, is dynamically allocated.  That is, there is no set pattern for allocating or deallocating this memory.  Therefore, keeping track or managing this type of memory is a complicated process. In Java, such memory is allocated when instantiating an object:

String s = new String();  // new operator being employed
String m = "A String";    /* object instantiated by the JVM and then being set to a value.  The JVM
calls the new operator */