Retrieval in existing e-recruitment system is on exact match between applicants' stored profiles and inquirer's request. These profiles are captured through online forms whose fields are tailored by recruiters and hence, applicants sometimes do not have privilege to present details of their worth that are not captured by the tailored fields thereby, leading to their disqualification. This paper presents a 3-tier system that models serialized documents of the applicants' worth and they are analyzed using document retrieval and natural language processing techniques for a human-like assessment. Its presentation tier was developed using java server pages and middle tier functionalities using web service technology. The data tier models résumés that have been tokenized and tagged using Brill Algorithm with my sequel. Within the middle tier, indexing was achieved using an inverted index whose terms are noun phrases extracted from résumés that have been tokenized and tagged using Brill Algorithm.

Regression testing is used to check that changes in the some functionality of the software to not affect its old behaviours. Test case prioritization is essential for reducing the cost of regression testing. In this paper a test cases prioritization model based on fuzzy logic is presented. State machine diagram is used to capture the behaviour of the system. Risk information is associated with the states. After change in the functionality of the system new state machine diagram is designed. This new state machine diagram is converted into Weighted Extended Finite State Machine (WEFSM). Weights are assigned to nodes and edges based on change and risk exposure. Risk exposure and change information of each test case is used as input to fuzzy model. Test cases are categorized in retestable, reusable and obsolete.

This paper proposes an exact solution of the classical Graetz problem in terms of an infinite series represented by a nonlinear partial differential equation considering two space variables, two boundary conditions and one initial condition. The mathematical derivation is based on the method of separation of variables whose several stages were illustrated to reach the solution of the Graetz problem.

Symmetric-key encryption is a traditional form of cryptography, in which a single key is used to encrypt and decrypt a message. In symmetric–key algorithm before any encrypted message is being transmitted, the sender and receiver must know the key value in advance. There are several drawbacks in symmetric-key algorithms. In some algorithms, the size of the key should be same as the size of the original plaintext and maintaining and remembering such a key is very difficult. Further, in symmetric-key algorithms, several round has to be performed to produce the ciphertext and perhaps the same key is used in each round which results in subkey generated from the current round is fully depending on the previous round. To avoid these, a novel approach in generating the key from the keystream for any symmetric-key algorithms using the Primitive Pythagorean Triples(PPT) has been proposed in this paper. The main advantage of this method is that the key value generated from the keystream is chosen by both the sender and the receiver. Further, the size of the key sequence is not limited but its size is arbitrary in length. Since, the keystream generated is random, no need to remember such keys by both the sender and the receiver.

How to manage patient's service time has been a burden in view of the condition of patients who have to wait for required service from doctors in many hospitals in developing countries. This paper deals with the management of service time of doctor's consultation using parallel service time. Though, the theoretical underlying distribution of service time is exponential, but this research showed service time to be non-exponential but, normal. This unusual distribution of service time was attributed to non-identical services required by patients from doctors in the considered sample space. Secondly, the mean service time from each service point as researched was found the same. This showed that no line could be preferred to other.