Siebel Open UI: Show / Hide Mandatory Controls – Configurable and Dynamic

Hello everybody! I’m back here after a while. Hope everyone is doing good. So, for past couple of weeks I am attending a training on Siebel Open UI. It’s like a long time dream come true. I am an amateur web developer and a Siebel consultant by profession. So when you get an opportunity to customize the long familiar Siebel Blue Screen (no pun intended) with all the power of HTML, JavaScript and CSS you feel like a kid in front of the Christmas tree on the merry morning.

After some random tampering with the UI, I thought of developing something working which can really be shown off in the real world. I got a nice opportunity when I came across one of the requirements from a Project for which I am currently working, for which the solution I thought can be built using only Open UI architecture. Forget about Siebel eScript, browser script etc., welcome to the world of JavaScript!

The Requirement:

In the Service Request More Info View there are two applets. Service Request Detail Applet and Service Request More Info Applet.

Based on the values of certain fields in the top applet we need to

  1. Show or hide certain fields in the bottom applet.
  2. Show mandatory icons against labels in the bottom applet.
  3. Validating said mandatory fields for IS NOT NULL before WriteRecord and show standard error message.

You are free to choose fields and values on both the applets as you see fit for your own implementation.

This should be done in such a way that this behavior should be entirely data driven.

You change data, the application behavior changes in real time.

You should use only Open UI JavaScript files, maybe some Siebel UI Configurations like Applet Web Templates.

Continue Reading

Counting Prime Numbers: Sieve of Eratosthenes using Java

Hello readers. Hope you all had a good week.

New results:

Old results:
CountPrime 5000 = 669 (Result in 10 seconds)
CountPrime 10000 = 1229 (Result in 85 seconds)

Last week I described here how to count prime numbers in a range using a rather unorthodox method called Hardy-Wright method. But as that method involves calculating factorials of all the numbers in the range [3..n], it is rather slow even when using multi-threading using a 8 core CPU.

So this week I was looking for a fast method to do this thing. I googled a bit and came across a method called Sieve of Eratosthenes.

Continue Reading

Counting Prime Numbers – Java SE Multi Threaded using BigInteger

Hope everybody enjoyed a good weekend.

So, this weekend I was going through the Programming Praxis website, and this problem caught my eye.

Prime numbers, they are a fascinating subject for mathematicians for several centuries now. Although there are other and faster methods of counting prime numbers up to a range, this method involves some rather unique programming techniques, like using very big numbers, looping through large mathematical range in parallel etc.
Continue Reading