Sunday, September 17, 2006
Very good video of REC Trichy - Reminiscence
Eyes will become moist for sure and heart will ache once again for glory days....
Check it here.
Monday, July 24, 2006
All Dostoevsky said was 'we shall be with Christ.'
Most revealing paragraph is:
As for Dostoevsky himself, though tortured by fear, he nevertheless held fast to that "philosophy" which the pervert Freud detested. As one of Dostoevsky's fellow conspirators on the scaffold recalled: "All Dostoevsky said was 'we shall be with Christ.'" Yes, Dostoevsky had Christian faith. Holy Bible faith. Hebrews Chapter 11 faith. In his moment of greatest fear the image of a waiting Christ sustained him, preserved his sanity. To the pervert Freud, this faith shackles man. But to the condemned man, the man facing his own grave, this faith is liberating.
Of course, history records that shortly after Dostoevsky uttered his famous words, just as the rifles were due to fire upon the first three, a reprieve was granted.
Monday, July 10, 2006
Garbage Collection and JVM Tuning
I had a miserable time in 2003 while trying to tune JVM on Red Hat Linux 7.3 with JBoss.
Since then, I keep a note of GC Notes and following articles are worth sharing with all.
How we solved our GC Problem?
A Collection of JVM options
Friday, July 07, 2006
Brief Note about MD5, Hash, Checksum and Digest
I started off with wikipedia and google search; both of these gave me a bunch of info which I have summarized here for a quick intro.
What is "Hash"?
---------------
The term "hash" apparently comes by way of analogy with its standard meaning in
the physical world, to "chop and mix."
In the SHA-1 algorithm, for example, the domain is "flattened" and "chopped" into "words"
which are then "mixed" with one another using carefully chosen mathematical functions.
Hash Function
----------------
A hash function (or hash algorithm) is a way of creating a small digital "fingerprint"
from any kind of data.
The function chops and mixes the data to create the fingerprint, often called a hash
value.
The hash value is commonly represented as a short string of random-looking letters
and numbers (Binary data written in hexadecimal notation).
A good hash function is one that yields few hash collisions in expected input domains.
In hash tables and data processing, collisions inhibit the distinguishing of data,
making records more costly to find.
Error Detection - Use of Hash Function and Redundancy Check
-------------------------------------------------------------------------
Using a hash function to detect errors in transmission is straightforward.
The hash function is computed for the data at the sender, and the value of this hash is
sent with the data. The hash function is performed again at the receiving end, and if
the hash values do not match, an error has occurred at some point during the transmission.
This is called a redundancy check.
Checksum
---------------
This article is about checksums calculated using addition.
The term "checksum" is sometimes used in a more general sense to refer to any kind of
redundancy check.
A checksum is a form of redundancy check, a very simple measure for protecting the integrity
of data by detecting errors in data that is sent through space (telecommunications) or time (storage).
It works by adding up the basic components of a message, typically the asserted bits, and
storing the resulting value.
Later, anyone can perform the same operation on the data, compare the result to
the authentic checksum, and (assuming that the sums match) conclude that the
message was probably not corrupted.
The simplest form of checksum, which simply adds up the asserted bits in the data,
cannot detect a number of types of errors. In particular, such a checksum is not changed by:
* reordering of the bytes in the message
* inserting or deleting zero-valued bytes
* multiple errors which sum to zero
More sophisticated types of redundancy check, including Fletcher's checksum, Adler-32, and
cyclic redundancy checks (CRCs), are designed to address these weaknesses by considering not only the value of each byte but also its position.
The cost of the ability to detect more types of errors is the increased complexity of computing
the checksum.
These types of redundancy check are useful in detecting accidental modification such as corruption to stored data or errors in a communication channel. However, they provide no security against a malicious agent as their simple mathematical structure makes them trivial to circumvent.
To provide this level of integrity, the use of a cryptographic hash function, such as SHA-256,
is necessary. (Collisions have been found in the popular MD5 algorithm and finding collisions in SHA-1 seems possible, but there is no evidence as of 2005 that SHA-256 suffers similar weaknesses.)
On Unix, there is a tool called "cksum" that generates both a 32 bit CRC and a byte count for
any given input file.
CRC
----
A cyclic redundancy check (CRC) is a type of hash function used to produce a checksum
a small, fixed number of bits against a block of data, such as a packet of network traffic or
a block of a computer file. The checksum is used to detect errors after transmission or storage.
A CRC is computed and appended before transmission or storage, and verified afterwards by recipient to confirm that no changes occurred on transit. CRCs are popular because they are simple to implement in binary hardware, are easy to analyze mathematically, and are particularly good at detecting common errors caused by noise in transmission channels.
Hashes are "digests", not "encryption"
-------------------------------------
Encryption transforms data from a cleartext to ciphertext and back (given the right keys),
and the two texts should roughly correspond to each other in size: big cleartext yields
big ciphertext, and so on. "Encryption" is a two-way operation.
Hashes, on the other hand, compile a stream of data into a small digest
(a summarized form: think "Reader's Digest"), and it's strictly a one way operation. All hashes of the same type have the same size no matter how big the inputs are:
We'll note here that though hashes and digests are often informally called "checksums",
they really aren't. True checksums, such as a Cyclic Redundancy Check are designed to
catch data-transmission errors and not deliberate attempts at tampering with data.
Cipher
---------
A cipher is an algorithm for performing encryption (and the reverse, decryption)
A series of well-defined steps that can be followed as a procedure. An alternative term is encipherment
Excellent References:
-----------------------
1) An Illustrated Guide to Cryptographic Hashes
2) What is a Digital Signature
Thursday, May 11, 2006
IO Redirection in Java
java test >myfile
Same thing can be achieved by using PrintWriter cleverly.
System class has methods to let you set your own PrintWriter to it. - System.setOut()
As a point of interest, the JDK 1.3 implementation of java.lang.System has internal code of this form:
FileOutputStream fdOut =
new FileOutputStream(FileDescriptor.out);
setOut0(new PrintStream(
new BufferedOutputStream(fdOut, 128), true));
Check out this TechTips for more info about IO Redirection and Array Manipulation.
Sunday, January 08, 2006
VI Editor Related Links
Friday, January 06, 2006
Good FAQ on Changing Unix Shell
Thursday, January 05, 2006
Web Security - Why SSL is not enough to protect Credit Card
Does SSL protect you, or is it a condom that is open at both ends?
Read this article to understand the limitation that SSL does not really ensure the authenticity of both ends, automatically.
Excerpt:
What it does not do is actually secure any of the data that passes through the pipe, or really know where either end of the pipe actually is. What you can be sure of is that anything put into one end of the pipe is going to come out wherever the other end is.
But surely the data is fully protected? Yes, whilst the data is in the pipe it is protected. Now, assuming - and unfortunately that's what we have to do - that you know for sure where each end of the pipe is, and you are sure that each end is very secure, and you know for certain who is at each end, then you're OK. If any of those is not true then you do have a problem.
My data is SSL protected between the server, and me so why should I worry? Well no one at the server end really knows whom the data is from because they don't know what your identity is. They assume that data arriving through the pipe is right, and that your identity can be presumed from the data, not the other way around. Unfortunately there are hacker attacks that divert your link through their own site, where they can pretend to each end that they are the other entity without either end being the wiser. (This is called a man-in-the-middle attack using web site spoofing.)
There is no easy for Server to establish the identity of client and vice-versa. Sure, we do get padlock but most of the people would not bother to check the certificate if they are valid, genuine or fake.
Tuesday, December 27, 2005
Web Services - RPC Vs Document
Mitch has done a good job of clarifying it in his article.
A Distinction has been made between Communication Pattern and Style.
Excerpt:
we turn to the two decisions for formatting the contents of a message's
element. The style, or binding style, decision controls how the elements just under the SOAP body are constructed. The two choices are:
- RPC: Add extra elements to simulate a method call. (Note that RPC is also a communication pattern.)
- Document: Just send the XML as is. There's also a variation called wrapped that is still specified as document.
Here's an example of an RPC-style message:
RPC relies on some rules. Observe that the root element is qualified with a namespace, but the two child elements use unqualified names. The root element is named after the operation: opName for a SOAP request, opNameResponse for a SOAP response. Each child is a parameter, or a return value named opNameReturn.
Now here's an example of a document-style message:
Observe that all elements are defined within the same namespace. With a document-style Web service, you're free to define the XML however you wish because all the XML is explicitly specified.
Next, we examine how binding style is specified in the WSDL. There actually is a style attribute in the
Table 1. How binding style is specified in a WSDL document
| | RPC | Document |
| style="rpc" | style="document" |
| Any number of | Single |
A WSDL document provides the interface (a generic "list of methods") and a set of instructions that describe how the service is bound to a messaging protocol.
The WSDL 1.1 specification distinguishes two different binding styles, as follows:
* RPC Style: This style specifies that the
* Document Style: In this style, there is no wrapper element. Instead, the message parts appear directly under the
Within those styles, you can also have an encoded use or a literal use:
* Encoded: In this use, each message part references an abstract type using the type attribute. The message is produced using an encoding specified by the encodingStyle attribute. The encoding most frequently used is SOAP Encoding, which is a set of serialization rules defined in SOAP 1.1. The rules specify how objects, structures, arrays, and object graphs should be serialized. In general, applications that use SOAP encoding focus on remote procedure calls, and likely use the RPC message style.
* Literal: In this use, each part references a concrete schema definition using either the element or type attribute. In other words, data is serialized according to a given schema. In practice, this schema is usually expressed using W3C XML Schema.
To summarize, the binding style/use combinations are:
* RPC/encoded
* RPC/literal
* Document/encoded
* Document/literal
Refer to this JDC Tip
Websphere - Utility Jar
This article suggests different ways to achieve the same in WSAD/RAD.
Web Services - What a Pain it is to work with?
Read this bileblog entry to understand it better....
Tuesday, November 15, 2005
Greg Chappell on Importance of Processes
He has been trying to develop healthy work ethic with Indian Cricket Team.
As a part of that, He is pushing players to follow right processes.
Read this Answer from him:
CricInfo:You've spoken about concentrating on the "processes" and not worrying about the results. What exactly are these processes?
Chappell:I don't want to give too much away from the point of view of exactly what we're thinking about. But basically, if you're worrying about the outcomes, about things you can't control, then you're going to get into trouble. We really focused on the areas that we can control and we're focusing on getting good in those areas. We're making sure that we engender the culture of creating successful habits. That's something we've worked very hard on over the last few months and we saw the benefits during the Sri Lankan series.
Hats off to Chappell.
He is doing us an immense service.
Saturday, October 29, 2005
Sacred Psychiatry
Sacred Psychiatry
In Kerala the mentally disturbed have a remarkable alternative to drugs and dungeon
It seems that there is a temple in Kerala, India which is credited with healing of lots of people with mental health problem.You can read the article here
Vimanika Shastra - Does it indicate that we had UFOs thousands of years back
I came across its english translation here.
It makes an interesting read and does indicate that UFOs might not be an object of our imagination.
Friday, October 28, 2005
MS Office 12 - A Way for Microsoft to get into BI Market?
E-Week story is indicating it to be so...
Friday, October 21, 2005
PHP - It is gaining Momentum
PHP 6 would be supporting Unicode and that should help its adoption.
Certainly, it is worth watching out for...