Technology is wonderful. It helps us run our businesses and connects us to the world. But when computer problems get in the way of getting what you need to get done, you can go from easygoing to mad-as-a-hornet in 3 seconds flat. Before you panic or give in to the temptation to throw your computer out the window, try these easy fixes.

5 Common Computer Problems

1. Sluggish PC

A sluggish PC often means low disk space caused by an accumulation of temporary Internet files, photos, music, and downloads. One of the easiest fixes for a slow PC is to clear your cache.

The way you’ll do this will depend on the Internet browser you use:

• Chrome– On the top right-hand side of the screen, you’ll see what looks like a window blind. Click on that. Click on ‘History’ and hit ‘Clear Browsing Data’.

• Safari– On the upper left-hand side, you’ll see a tab marked ‘Safari’. Click on that. Scroll down and hit ‘Empty Cache’.

• Internet Explorer– Click on ‘Tools’ and scroll down to ‘Internet Options’. Under ‘Browsing History’ click ‘Delete’. Delete files and cookies.

• FireFox – At the top of the window click ‘Tools’ then go to ‘Options’. Select the ‘Advanced’ panel and click on the ‘Network’ tab. Go to ‘Cached Web Content’ and hit ‘Clear Now’.

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 */

Today we live in the age of technology. It seems like everyone owns at least one computer, but few actually know how they work. We hear about Java tutorials and C# programming, but why are these things important?

There has been an increasing demand for those who are proficient in web development. It is a job field that has grown substantially in the past decade, and it is still continuing to flourish with no signs of stopping. Learning a web language is not only a useful skill, but a necessary one. So why, out of all of the available web languages, is Java the most valuable?

·         First off, it is a simple language that is easily learned and well known.

·         Java has been around for awhile now, and has earned its place as one of the pillars of modern day computer architecture. Information on Java is abundant, and ranges from online tutorials to books, such as "Java for Dummies."

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