Papers

Software is an integral part of many critical and non-critical applications, and virtually any industry is dependent on computers for their basic functioning. Techniques to measure and ensure reliability of hardware have seen rapid advances, leaving Software as the bottleneck in achieving overall system reliability. Hence there rises a situation for the developers to develop high quality software. Having that in mind it is necessary to provide the reliability of the software to the developers before it is shipped. This can be achieved based on immune system. The immune system that is otherwise known as 'second brain' for its abilities to recognize new intruders and remember past occurrences. Simulating the immune system or translating immune system mechanisms into software learning is an interesting topic on its own. This will produce high quality, reliable results over a wide variety of problems compared to a range of other approaches, without the need of expert fine-tuning.
 

Cryptography is the art of achieving security by encoding messages to keep the information non-readable. Cryptography actually is a mathematical scrambling and unscrambling of data to achieve, Confidentiality (Readable only to sender and receiver); Integrity (not modified by any one to integrity of message); Non repudiation (sender can't refuse the claim of not sending); and Entity authentication. While sending or receiving the data, special keys are used to encrypt/decrypt data to verify the original contents. This key makes the process of cryptography secure. Public key systems use two keys such that one key, the public key, can be used to encrypt some text that can then only be decrypted using the securely-held private key. There are two approaches for the generation of encryption/decryption keys i.e. software and hardware. The purpose of this paper is to generate encryption key using hardware technique. To design electronics circuit basic concept is derived from the Knapsack problem. Then R-2R ladder network is used for the implementation of Knapsack algorithm. The electronics circuit design is evaluated using (ORCAD-Pcpise) software and analyzed practically on electronics bread board as well. The circuit implementation aim is achieved through many intermediate steps which are followed as firstly terminology and transformation are defined foe public key cryptography, then the knapsack problem is discussed and after that knapsack algorithm (greedy algorithm) is achieved using the electronics circuits. Some modification also has been discussed to make circuit more practical and more secure.

A subset S of V is called a dominating set in G, if every vertex in V- S is adjacent to at least one vertex in S. A Dominating set is said to be independent dominating set if the induced subgraph < V > is independent. The minimum cardinality taken over all, such independent dominating sets is called the independent domination number and is denoted by g_i(G). The minimum number of colours required to colour all the vertices such that adjacent vertices do not receive the same colour is the chromatic number c(G). It was already proved that g_i(G) + c(G) £ 2n-1 and corresponding extremal graphs were characterized of order up to 2n-5. In this paper we characterize the class of graphs for which g_i(G)+c(G) = 2n-6 for any n > 3.
 

In this Paper an algorithm for Cut plane Segmentation method for ROI coding is proposed. Various results for Segmentation, Slicing, Searching and then ROI cut in the image are observed.

This paper deals with the performance evaluation of a Commercial mill system involving two essential components viz. one main unit and two associate units. Associate units depend upon main unit for functioning. Only one repairman is used for repairing the failed components of all the units. Taking exponential failure rates and arbitrary, repair rates, various system effectiveness measures such as transition probabilities, mean time to system failure, availability, busy period of repairman are calculated. At last, profit analysis is done on the basis of above measures.

The present paper discusses the operational behaviour of feeding system (i.e. the main functionary part) of the sugar plant. The system consist of three subsystems (having a number of units with different configurations) i.e. the crushing system, bagasse carrying system and the steam generation system. The units of crushing and bagasse system are in series while the units of Boilers and steam generation system are in parallel. Taking constant failure or general repair rates for each subsystem, the steady state availability are evaluated. Availability tables for various failure and repair rates with graphs are given followed by a parameter. 
 

Machine learning classifiers are mostly used for prediction of system behavior ,Evolution and comparison of different machine learning classifiers used in Data Mining practical in health datasets, how to select the most suited data mining algorithm for a medical application. In this paper we used three medical datasets for our experiment. Experiment performed on WEKA 3.5.7 software which is a newest version of WEKA software. 
 

The present paper deals with the reliability analysis of two-unit identical system, which is affected by common cause shock (CCS) failures and human errors along with individual failures. The influence of CCS failures in addition to human errors is emphasized in the reliability analysis of a system. Expressions for system reliability and mean time between failures (MTBF) are developed when the system is affected by CCS failures as well as human errors. Also, these reliability indices are compared in the presence of CCS failures as well as human errors with that of the situation when CCS failures are affecting the system. Reliability Plots are shown and Numerical illustration of MTBF results is also presented to support the model. 
 

Let and denote the class of functions , where  and that map the unit disc onto starlike and convex domains respectively satisfying. In this paper, sharp coefficient estimates, distortion properties for functions in and have been obtained. This leads to extreme points.

The present paper is an extension work of the Barnsley¹ and Devaney³. We introduce Poincare and Shift maps, furthermore we establish and proved some theorems for topological sensitivity and global stability.