HP is taking legal action against Oracle for allegedly breaching its 2010 partnership agreement of porting HP’s core software products with the latest versions of Itanium. In March, Oracle announced it would not be developing any new versions for products designed for the Itanium processor. Itanium has the ability to power the so-called Business Critical Systems hardware for extremely demanding enterprise applications. However, Oracle said the chip line is about to die.

The companies’ lawyer met in the Santa Clara County Superior Court with Judge James Kleinberg presiding to discuss their side of the event. Others in the courtroom included Ann Livermore, HP board member and former enterprise business chief, and Oracle’s co-President Safra Catz. Catz and Livermore were the two key negotiators for the agreement. Livermore was to testify later in the day. Kleinberg is set to rule if the companies had a legally binding contract.

Jeff Thomas, HP’s lawyer, focused on the so-called Hurd Agreement wording, where the companies reiterated their partnership after Oracle hired Mark Hurd, former CEO for HP. HP also sued Hurd for breaking the confidentiality agreement.

Thomas and the lead lawyer for Oracle focused on one paragraph of the agreement, which read Oracle would continue to provide its product suite on the HP platform in a way that’s consistent with the existing partnership before Hurd’s hiring.

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

Studying a functional programming language is a good way to discover new approaches to problems and different ways of thinking. Although functional programming has much in common with logic and imperative programming, it uses unique abstractions and a different toolset for solving problems. Likewise, many current mainstream languages are beginning to pick up and integrate various techniques and features from functional programming.

Many authorities feel that Haskell is a great introductory language for learning functional programming. However, there are various other possibilities, including Scheme, F#, Scala, Clojure, Erlang and others.

Haskell is widely recognized as a beautiful, concise and high-performing programming language. It is statically typed and supports various cool features that augment language expressivity, including currying and pattern matching. In addition to monads, the language support a type-class system based on methods; this enables higher encapsulation and abstraction. Advanced Haskell will require learning about combinators, lambda calculus and category theory. Haskell allows programmers to create extremely elegant solutions.

Scheme is another good learning language -- it has an extensive history in academia and a vast body of instructional documents. Based on the oldest functional language -- Lisp -- Scheme is actually very small and elegant. Studying Scheme will allow the programmer to master iteration and recursion, lambda functions and first-class functions, closures, and bottom-up design.

Supported by Microsoft and growing in popularity, F# is a multi-paradigm, functional-first programming language that derives from ML and incorporates features from numerous languages, including OCaml, Scala, Haskell and Erlang. F# is described as a functional language that also supports object-oriented and imperative techniques. It is a .NET family member. F# allows the programmer to create succinct, type-safe, expressive and efficient solutions. It excels at parallel I/O and parallel CPU programming, data-oriented programming, and algorithmic development.

Scala is a general-purpose programming and scripting language that is both functional and object-oriented. It has strong static types and supports numerous functional language techniques such as pattern matching, lazy evaluation, currying, algebraic types, immutability and tail recursion. Scala -- from "scalable language" -- enables coders to write extremely concise source code. The code is compiled into Java bytecode and executes on the ubiquitous JVM (Java virtual machine).

Like Scala, Clojure also runs on the Java virtual machine. Because it is based on Lisp, it treats code like data and supports macros. Clojure's immutability features and time-progression constructs enable the creation of robust multithreaded programs.

Erlang is a highly concurrent language and runtime. Initially created by Ericsson to enable real-time, fault-tolerant, distributed applications, Erlang code can be altered without halting the system. The language has a functional subset with single assignment, dynamic typing, and eager evaluation. Erlang has powerful explicit support for concurrent processes.

Computer Programming as a Career?

What little habits make you a better software engineer?

Recently, the new iOS update had added Reminders to the iPhone. If you ever found yourself setting notes on your iPhone to remember to do things, such as buying milk while at the grocery store, this process has become leagues upon leagues simpler, and faster. On your iPhone is an application named “Reminders”. Tap on this application and experience the new world of To-Do lists.

Right away, you are greeted by a screen that looks similar to a notepad, where you would be scribbling down reminders for this, and for that. To start off, tap on the plus button, and you are able to input the reminder you want. Say you want to be reminded to “Buy Milk.” Just type that into the application and you’re good to go.

But wait, there’s more. What this new application brings to the table that is extremely useful is the fact that your iPhone can remind you to do that task at a certain location, which, in this case, is buying milk. If you had saved your regular grocery store in your Maps application as a favorite location, you are able to do so. (To save a favorite location, go into your Maps application, search for your nearest grocery store that you regularly shop at, tap on the pin, tap on the blue arrow to get more information, and “Add to Bookmarks.”) In order to remind you to buy milk at your favorite grocery store, slide the “Off” to “On” and you are now able to set where you would like to be reminded at, and at what point in time. Now, you will never leave the grocery store without buying milk!