Knowledge based Components in ES and ES Shell
R. B. Mishra*
* Department of Computer Engg. IT-BHU , Varanasi – 221005
Knowledge based systems (KBS) components: Knowledge Representation, inference an user's interface contain different methods mechanism and types respectively. In the development of Expert system shell and Expert System (ES) in general, the gradients or constituents, the different KBS components are deployed. Conventional but pioneering ES shell have utilized certain in gradients more or less. This paper makes a comparative view of ES shell of large size, middle size and small size. It draws the table showing the constituents components in some pioneer ES and ES shell. The modern KBS components and certain ES shell and the future view of KBS components have also been described in this paper.
Probabilistic Approach Towards Development of an Efficient Routing Algorithm to Predict and Control the Congestion in Computer Networks
Anup Kumar Biswas 1 , Asok Kumar 2 , S. S. Singh 3 and S. K. Sarkar 4
-
Department of Electronics and Telecommunication Engineering, Jadavpur University,
Kolkata 700032, India
2. Asansol Engineering College, Asansol, West Bengal , India
3. ICFAI Tech, Bhubaneswar, Orisa , India
4. Corresponding Author, Department of Electronics and Telecommunication Engineering,
Jadavpur University, Kolkata - 700032, Email: su_sarkar@hotmail.com
A virtual computer network is simulated and various path lengths are calculated for different positions of the source(s) and destination(s). The congestion level of each path is also computed for the simulated virtual network in a probabilistic fashion. Delays in various paths between source and destination nodes are computed as well. By taking the path length and the congestion level together, the algorithm-based c-program is applied to select the path dynamically between the source and destination to initiate an efficient routing scheme thereby controlling the congestion in the network.
A Neural Network Control Mechanism based on Heisenberg uncertainly Principal
Ashish Chaturvedi & Manu Pratap Singh*
* Corresponding Author Agra-282002, U.P., India. Department of Computer Science, Institute of Computer and Information Science. Khandari, Dr. B. R. Ambedkar University, (E-mail: manu_p_singh@hotmail.com )
A control mechanism based on uncertainly principle can be designed by using the pattern classification technique with Back-propagation learning rule of Article Neural Networks. In this process a suitable arrangement can be constricted that contains an adjustable slit apparatus from which the beam of electrons comes out and strikes on a screen. This arrangement also contains two carefully designed experiments, one of them can be used to recise determination in position and second one can be used to precise determination in momentum of electrons. The control mechanism will determine which experiment should work at a time .
Quality Control for EPL Model with Shortage
Madhu Jain*, G. C. Sharma* and Shalini Rathore**
* Institute of Basic Science, Khandari , Agra – 282002 (India).
** St. John's College, Agra – 282002 (India).
In this paper a production inventory model with shortage has been developed by using a modified cost function dependent on the mixed trend of different components of production. An attempt has been made to optimize the production lot size and the concept of quality control has been introduced. The results are illustrated by taking numerical examples and depicted graphically.
A Lexical Relation Extraction Algorithm for Indexing Software Components in a Software Library
Rajender Nath* & Anil Vohra**
* Lacturer, Dept. of Computer Science & Applications, Kurukshetra University Kurukshetra, Haryana, India, E-Mail: rnath_2k3@rediffmail.com
** Prof, Dept. of Electronic Science, Kurukshetra University Kurukshetra, Haryana, India. E-Mail :
vohras@sancharnet.in , eledkuk@sancharnet.in
Although systematic software reuse has been an active research area for more than a decade, yet indexing problem of the software component in a software library has not been solved satisfactorily. Most of the software component-Indexing strategies are single keyword-based, manual and domain specific. To demonstrate the feasibility of the algorithm, it has been implemented in C language and the results of the experiments have been reported.
(m, M) Machining System with Spares, Reneging and Degraded Failure Rate
Madhu Jain & Sandhya Maheshwari
School of Mathematical Sciences, Institute of Basic Sciences, Khandari, Agra-282002 (India)
This paper deals with the machine repair problem consisting of M identical units which are operating under the care of R repairmen S warm spares are also available to replace the failed units. The failure times and repair times of units are independently and identically distributed. The repairmen are assumed to repair the failed components with slow rate when at least one repairman is free otherwise they switch at faster rate. The units may renege while waiting in the queue due to impatience. The reneging is assumed to be exponentially distributed. When all spares are used, the failure of units occurs in degraded fashion. The steady state queue size distribution has been obtained. Various system performance measures such as average number of operating units, average spare parts which are functioning as a standby, expected number of repairmen etc. have been established. The total expected cost per unit time for the system has also been obtained .
Region Growing Approach For Image Segmentation
Prakul Sharma , Lalit K. Awasthi,* R. K. Sharma, Mahesh C. Govil**
*NIT, Hamirpur,
**NIT Jaipur
The term image processing generally refers to processing of a two dimensional picture by a digital computer. In a broader context, it implies digital processing of any two dimensional data. An image given in the form of transparency, slide, photograph or chart is first digitized and stored as a matrix of binary digits in computer memory. This digitized image can then be processed and/or displayed on a high-resolution television monitor. The image segmentation is vital to understand, interpret and process an image. Segmentation can be boundary-based or Region-based. Here a region based segmentation approach is devised for segmentation because it is simplar and gives better results. In this paper, the region-based segmentation algorithm has been applied to the test images and the results are provided.
Key Transport Protocol in Braid Groups
Sunder Lal & Atul Chaturvedi*
* Department of Mathematics, Institute of Basic Science, (Dr. B.R.A. University) Khandari, Agra – 282002 (UP) - India
In this paper we propose a new key transportation protocol using braid groups and also an authenticated version of this protocol. Our protocols are based on Conjugacy Search Problem (CSP) in braid group. The security is based on the assumption that the solution of CSP is hard, if braids of sufficient size are considered .
Synchronous Checkpointing Protocols for Mobile Distributed Systems : A Comparative Study
Parveen Kumar*, Lalit Kumar*, R. K. Chauhan**
* NIT, Hamirpur (HP);
** K.U. Kurukshetra (Haryana),
lalitdec@yahoo.com ; pk223475@yahoo.com , 01972-223514; 094180-94770
Check pointing is an efficient way of implementing fault tolerance in distributed systems. Mobile computing raises many new issues, such as high mobility, lack of stable storage on mobile hosts (MHs), low bandwidth of wireless channels, limited battery life and disconnections. These issues make the traditional check pointing protocols unsuitable for check pointing mobile systems. Minimum-process coordinated check pointing is a preferred approach to introduce fault tolerance in mobile distributed systems transparently. This approach is domino-free, requires at most two checkpoints of each process on stable storage, and forces only interacting processes to checkpoint. Sometimes, it also requires piggybacking of information onto normal messages, blocking of the underlying computation or taking some useless checkpoints. In this paper, we point out some complexities and inconsistencies in the existing coordinated check pointing protocols for mobile distributed systems and compare them. We provide future directions for designing more efficient synchronous check pointing protocols for mobile systems.
E Services : Concepts and intelligent Computing Models R. B. Mishra*
* Depertment of Computer Engg., IT-BHU, Varanasi-221005
E-services have changed the pattern of e-commerce by deploying e-CRM and m-commerce as its subsets. There are two views of e-services: Inward and outward. The inward view comprises of customer-buyer's relationship, customer personality, their trust, interaction and etc. where as the outward view concerns with net, wireless and radio communication. In this paper a review has been performed on the various concepts in E-services and the use of intelligent computing models: KBS, ANN and Agent.
Finite Variance Scaling Analysis of the Monthly Data of the Sunspot Numbers
Dipendra Nath Ghosh*, Koushik Ghosh* & Abhoy Chand Mondal**
* Department of Mathematics, Dr. B. C. Roy Engineering College, Durgapur – 713206, India.
** Department of Computer Science, University of Burdwan, Burdwan, India.
The scaling behaviour of the monthly sunspot number is analysed using the monthly data of the sunspot numbers during the time period from January, 1749 to February, 2005. In the present analysis the monthly sunspot data is processed through finite variance scaling method in order to find the corresponding Hurst exponent. The study reveals that the present data of monthly sunspot number exhibits anti-persistent behaviour ( or , negative autocorrelation ) and has underlying trends .
|
