Bøker av Nabendu Chaki

The book is a collection of peer-reviewed best selected research papers presented at the International Conference on Data Analytics and Insights (ICDAI 2023), organized by Techno International, Kolkata, India, during May 11¿13, 2023. The book covers important topics like sensor and network data analytics and insights; big data analytics and insights; biological and biomedical data analysis and insights; optimization techniques, time series analysis and forecasting; power and energy systems data analytics and insights; civil and environmental data analytics and insights; and industry and applications.

This book covers various topics, including collective intelligence, intelligent transportation systems, fuzzy systems, Bayesian network, ant colony optimization, data privacy and security, data mining, data warehousing, big data analytics, cloud computing, natural language processing, swarm intelligence, and speech processing. This book is a collection of high-quality research work on cutting-edge technologies and the most-happening areas of computational intelligence and data engineering. It includes selected papers from the International Conference on Computational Intelligence and Data Engineering (ICCIDE 2021).

The studies discussed here seek to extract finite state models corresponding to goal models with the help of model transformation. The authors also discuss how the goal maintenance problem can be mapped to the state-space search problem, and how A* search can be used to identify an optimal goal model configuration that is free from all conflicts.

The book focuses on an image processing technique known as binarization. In addition to this, the book presents techniques for preparing a reference image which is very much important for quantitative evaluation of the binarization techniques.

The book presents various state-of-the-art approaches for process synchronization in a distributed environment. At the same time, the solutions consider the priority of the requesting processes and allocate resource for the earliest request when no such request from a higher priority process is pending.