scispace - formally typeset
Search or ask a question
Institution

Jadavpur University

EducationKolkata, 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
More filters
Journal ArticleDOI
P.K. Malik1
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

Journal ArticleDOI
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

Journal ArticleDOI
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

Journal ArticleDOI
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

Journal ArticleDOI
01 Jan 2008
TL;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

NameH-indexPapersCitations
Subir Sarkar1491542144614
Amartya Sen149689141907
Susumu Kitagawa12580969594
Praveen Kumar88133935718
Rodolphe Clérac7850622604
Rajesh Gupta7893624158
Santanu Bhattacharya6740014039
Swagatam Das6437019153
Anupam Bishayee6223711589
Michael G. B. Drew61131524747
Soujanya Poria5717513352
Madeleine Helliwell543709898
Tapas Kumar Maji542539804
Pulok K. Mukherjee5429610873
Dipankar Chakraborti5411512078
Network Information
Related Institutions (5)
Indian Institutes of Technology
40.1K papers, 652.9K citations

96% related

Indian Institute of Technology Kharagpur
38.6K papers, 714.5K citations

95% related

Indian Institute of Technology Kanpur
28.6K papers, 576.8K citations

94% related

Indian Institute of Technology Bombay
33.5K papers, 570.5K citations

94% related

Indian Institute of Technology Delhi
26.9K papers, 503.8K citations

93% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202385
2022332
20211,949
20201,936
20191,737
20181,807