Institution
Jadavpur University
Education•Kolkata, India•
About: Jadavpur University is a education organization based out in Kolkata, India. It is known for research contribution in the topics: Population & Schiff base. The organization has 10856 authors who have published 27678 publications receiving 422069 citations. The organization is also known as: JU & Jadabpur University.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this paper, an acid dye, acid yellow 36, was used as the adsorbate for the removal of acid dyes from aqueous solution and the results showed that a pH value of 3 is favorable for the adsorption of acid dye.
926 citations
••
TL;DR: A simulated annealing based multiobjective optimization algorithm that incorporates the concept of archive in order to provide a set of tradeoff solutions for the problem under consideration that is found to be significantly superior for many objective test problems.
Abstract: This paper describes a simulated annealing based multiobjective optimization algorithm that incorporates the concept of archive in order to provide a set of tradeoff solutions for the problem under consideration. To determine the acceptance probability of a new solution vis-a-vis the current solution, an elaborate procedure is followed that takes into account the domination status of the new solution with the current solution, as well as those in the archive. A measure of the amount of domination between two solutions is also used for this purpose. A complexity analysis of the proposed algorithm is provided. An extensive comparative study of the proposed algorithm with two other existing and well-known multiobjective evolutionary algorithms (MOEAs) demonstrate the effectiveness of the former with respect to five existing performance measures, and several test problems of varying degrees of difficulty. In particular, the proposed algorithm is found to be significantly superior for many objective test problems (e.g., 4, 5, 10, and 15 objective problems), while recent studies have indicated that the Pareto ranking-based MOEAs perform poorly for such problems. In a part of the investigation, comparison of the real-coded version of the proposed algorithm is conducted with a very recent multiobjective simulated annealing algorithm, where the performance of the former is found to be generally superior to that of the latter.
764 citations
••
TL;DR: Thousands of hair, nail, and urine samples from people living in arsenic-affected villages have been analyzed to date; Bangladesh and West Bengal, 93 and 77% samples, on an average, contained arsenic above the normal/toxic level.
Abstract: Nine districts in West Bengal, India, and 42 districts in Bangladesh have arsenic levels in groundwater above the World Health Organization maximum permissible limit of 50 microg/L. The area and po...
751 citations
••
TL;DR: It is proved that curcumin-phospholipid complex has better hepatoprotective activity, owe to its superior antioxidant property, than freeCurcumin at the same dose level.
745 citations
••
01 Jan 2008TL;DR: Differential evolution has emerged as one of the fast, robust, and efficient global search heuristics of current interest as mentioned in this paper, which has been applied to the automatic clustering of large unlabeled data sets.
Abstract: Differential evolution (DE) has emerged as one of the fast, robust, and efficient global search heuristics of current interest. This paper describes an application of DE to the automatic clustering of large unlabeled data sets. In contrast to most of the existing clustering techniques, the proposed algorithm requires no prior knowledge of the data to be classified. Rather, it determines the optimal number of partitions of the data "on the run." Superiority of the new method is demonstrated by comparing it with two recently developed partitional clustering techniques and one popular hierarchical clustering algorithm. The partitional clustering algorithms are based on two powerful well-known optimization algorithms, namely the genetic algorithm and the particle swarm optimization. An interesting real-world application of the proposed method to automatic segmentation of images is also reported.
700 citations
Authors
Showing all 10999 results
Name | H-index | Papers | Citations |
---|---|---|---|
Subir Sarkar | 149 | 1542 | 144614 |
Amartya Sen | 149 | 689 | 141907 |
Susumu Kitagawa | 125 | 809 | 69594 |
Praveen Kumar | 88 | 1339 | 35718 |
Rodolphe Clérac | 78 | 506 | 22604 |
Rajesh Gupta | 78 | 936 | 24158 |
Santanu Bhattacharya | 67 | 400 | 14039 |
Swagatam Das | 64 | 370 | 19153 |
Anupam Bishayee | 62 | 237 | 11589 |
Michael G. B. Drew | 61 | 1315 | 24747 |
Soujanya Poria | 57 | 175 | 13352 |
Madeleine Helliwell | 54 | 370 | 9898 |
Tapas Kumar Maji | 54 | 253 | 9804 |
Pulok K. Mukherjee | 54 | 296 | 10873 |
Dipankar Chakraborti | 54 | 115 | 12078 |