OALib Journal期刊

ISSN: 2333-9721

费用:600人民币/ 99美元



2017 ( 1 )

2016 ( 25 )

2015 ( 146 )

2014 ( 161 )


匹配条件: “Satyendra Nath Mandal” ,找到相关结果约2483条。
Solution and Level Identification of Sudoku Using Harmony Search
Satyendra Nath Mandal,Saumi Sadhu
International Journal of Modern Education and Computer Science , 2013, DOI: 10.5815/ijmecs.2013.03.07
Abstract: Different optimization techniques have been used to solve Sudoku. Zong Woo Geem have applied harmony search in Sudoku to get better result. He has taken a Sudoku and time complexity has been optimized by different values of parameters. But, he has not given way of solution in details. He has also not given any idea to recognize the level of Sudoku. In this paper, an algorithm has been proposed based on harmony search to solve and identify the Sudoku efficiently. It has been observed that time complexity i.e. the maximum number of iteration has been reduced by choosing appropriate parameter values. The level of Sudoku has also been identified using probability metric. Finally, the number of iterations has been calculated with different values of parameters and the level of different Sudoku has been identified.
Performance Analysis for Detection and Location of Human Faces in Digital Image With Different Color Spaces for Different Image Formats
Satyendra Nath Mandal,Kumarjit Banerjee
International Journal of Image, Graphics and Signal Processing , 2012,
Abstract: A human eye can detect a face in an image whether it is in a digital image or also in some video. The same thing is highly challenging for a machine. There are lots of algorithms available to detect human face. In this paper, a technique has been made to detect and locate the position of human faces in digital images. This approach has two steps. First, training the artificial neural network using Levenberg–Marquardt training algorithm and then the proposed algorithm has been used to detect and locate the position of the human faces from digital image. The proposed algorithm has been implemented for six color spaces which are RGB, YES, YUV, YCbCr, YIQ and CMY for each of the image formats bmp, jpeg, gif, tiff and png. For each color space training has been made for the image formats bmp, jpeg, gif, tiff and png. Finally, one color space and particular image format has been selected for face detection and location in digital image based on the performance and accuracy.
Block Based Symmetry Key Visual Cryptography
Satyendra Nath Mandal,Subhankar Dutta,Ritam Sarkar
International Journal of Computer Network and Information Security , 2012,
Abstract: Visual cryptography is a method for protecting image-based secrets that has a computation-free decoding process. In this technique, numbers of shares have been generated from one image. The shares are sent through any channel to the receiver and the receiver can again produce original image by stacking all the shares in proper order. But, this method wastes a lot of bandwidth of the network. The techniques of generating shares have been used in several existing methods which are not unique. The different methods have been used in different types of images like binary, gray and color images. In this paper, a block based symmetry key visual cryptography algorithm has been proposed to convert image in encrypted form and decrypt the encrypted image into original form. The symmetric key has been generated from a real number. The encryption and decryption algorithm have been designed based on symmetry key. The algorithm with key has been used to encrypt image into single share and decrypt the single share into original image. The real number has been used to form the key may be predefined or may be sent by secure channel to the receiver. The proposed algorithm can be applied to any type images i.e. binary, gray scale and color images. A comparison has been made of the proposed algorithm with different existing algorithms like Ceaser cipher, transpose of matrix, bit comp, and transposition cipher based on the performance. The pixels distributed in original and share images have also been tested. Finally, it has shown that breaking of security level of proposed algorithm i.e. to guess the real number is huge time consuming.
Deterministic and Probabilistic Approach in Primality Checking for RSA Algorithm
Kumarjit Banerjee,Satyendra Nath Mandal,Sanjoy Das
Journal of Theoretical Physics and Cryptography , 2013,
Abstract: The RSA cryptosystem, invented by Ron Rivest, Adi Shamir and Len Adleman was first publicized in the August 1977 issue of Scientific American [1]. The security level of this algorithm very much depends on two large prime numbers [2]. In this paper two distinct approaches have been dealt with for primality checking. These are deterministic approach and probabilistic approach. For the deterministic approach, it has chosen modified trial division and for probabilistic approach, Miller-Rabin algorithm is considered. The different kinds of attacks on RSA and their remedy are also being discussed. This includes the chosen cipher text attacks, short private key exponent attack and frequency attack. Apart from these attacks, discussion has been made on how to choose the primes for the RSA algorithm. The time complexity has been demonstrated for the various algorithms implemented and compared with others. Finally the future modifications and expectations arising out of the current limitations have also been stated at the end.
Prediction of Adsorption of Cadmium by Hematite Using Fuzzy C-Means Clustering Technique
Satyendra Nath Mandal,Suhit Sinha,Saptarisha Chatterjee,Sankha Subhra Mullick
International Journal of Intelligent Systems and Applications , 2012,
Abstract: Clustering is partitioning of data set into subsets (clusters), so that the data in each subset share some common trait. In this paper, an algorithm has been proposed based on Fuzzy C-means clustering technique for prediction of adsorption of cadmium by hematite. The original data elements have been used for clustering the random data set. The random data have been generated within the minimum and maximum value of test data. The proposed algorithm has been applied on random dataset considering the original data set as initial cluster center. A threshold value has been taken to make the boundary around the clustering center. Finally, after execution of algorithm, modified cluster centers have been computed based on each initial cluster center. The modified cluster centers have been treated as predicted data set. The algorithm has been tested in prediction of adsorption of cadmium by hematite. The error has been calculated between the original data and predicted data. It has been observed that the proposed algorithm has given better result than the previous applied methods.
Frame Based Symmetric Key Cryptography
Uttam Kr. Mondal,Satyendra Nath Mandal,J. PalChoudhury,J.K.Mandal
International Journal of Advanced Networking and Applications , 2011,
Abstract: There are huge numbers of algorithms available in symmetry key block cipher. All these algorithms have been used either complicated keys to produce cipher text from plain text or a complicated algorithms for it. The level of security of all algorithms is dependent on either number of iterations or length of keys. In this paper, a symmetry key block cipher algorithm has been proposed to encrypt plain text into cipher text or vice versa using a frame set. A comparative study have been made with RSA, DES, IDEA, BAM and other algorithms with Chi-square value, frequency distribution, bit ratio to check the security level of proposed algorithm. Finally, a comparison has been made for time complexity for encryption of plain text and decryption from cipher text with the well-known existing algorithms.
In Search of Suitable Fuzzy Membership Function in Prediction of Time Series Data
Satyendra Nath Mandal,J.Pal Choudhury,S. R. Bhadra Chaudhuri
International Journal of Computer Science Issues , 2012,
Abstract: Many researchers have used fuzzy logic system to predict the time series data. In fuzzy system, the crisp data are converting into fuzzy data based on membership function. The futuristic data is predicted using previous data and fuzzy relation. But, in fuzzy system, there are many existing and derived membership functions which are used to fuzzify data. In this paper, an effort has been made to predict the time series data based on different fuzzy membership functions like Gaussian, Triangular, S-function, trapezoidal, Gbell, Dsigmoidal, Psigmoidal and Pi-shaped. A comparison has been made among the predicted data using different membership functions. One membership function has been selected based on minimum error in prediction of data. This process has been repeated on fifteen time series data sets. Finally, one membership function has been selected which has given minimum error in maximum cases.
Erythema Elevatum Diutinum
Chowdhury Satyendra Nath,Bandyopadhyay Debabrata
Indian Journal of Dermatology , 1997,
Abstract: A patient with a three year history is presented as a classic example of erythema elevatum diutinum which responded to dapsone therapy.
Basidiobolomycosis Successfully Treated With Fluconazole
Bandyopadhyay Debabrata,Chowdhury Satyendra Nath
Indian Journal of Dermatology , 1996,
Abstract: A case of basidiobolmycosis in a young housewife whose condition responded to a course of fluconazole is reported.
Uncertainty in Test Score Data and Classically Defined Reliability of Tests and Test Batteries, using a New Method for Test Dichotomisation
Satyendra Nath Chakrabartty,Kangrui Wang,Dalia Chakrabarty
Statistics , 2015,
Abstract: As with all measurements, the measurement of examinee ability, in terms of scores that the examinee obtains in a test, is also error-ridden. The quantification of such error or uncertainty in the test score data--or rather the complementary test reliability--is pursued within the paradigm of Classical Test Theory in a variety of ways, with no existing method of finding reliability, isomorphic to the theoretical definition that parametrises reliability as the ratio of the true score variance and observed (i.e. error-ridden) score variance. Thus, multiple reliability coefficients for the same test have been advanced. This paper describes a much needed method of obtaining reliability of a test as per its theoretical definition, via a single administration of the test, by using a new fast method of splitting of a given test into parallel halves, achieving near-coincident empirical distributions of the two halves. The method has the desirable property of achieving splitting on the basis of difficulty of the questions (or items) that constitute the test, thus allowing for fast computation of reliability even for very large test data sets, i.e. test data obtained by a very large examinee sample. An interval estimate for the true score is offered, given an examinee score, subsequent to the determination of the test reliability. This method of finding test reliability as per the classical definition can be extended to find reliability of a set or battery of tests; a method for determination of the weights implemented in the computation of the weighted battery score is discussed. We perform empirical illustration of our method on real and simulated tests, and on a real test battery comprising two constituent tests.

Copyright © 2008-2017 Open Access Library. All rights reserved.