检索结果-内蒙古大学图书馆

SMART AGRICULTURE: INTEGRATING AIR QUALITY MONITORING WITH DEEP LEARNING FOR PROCESS OPTIMIZATION*

Scalable computing 2025年第3期26卷 1005-1016页

作者： Shobana, J. Subramanian, A Venkata Balamurugan, P. Perumal, Sivakumar Sankari, V. Eldho, K.J. Nareshkumar, R. Department of Data Science and Business Systems School of Computing College of Engineering and Technology SRM Institute of Science and Technology Tamilnadu Kattankulathur India Department of Computer Science and Engineering GITAM University Bengaluru India Department of Computer Science and Engineering J N N Institute of Enginering India Saveetha university Chennai India Department of Computer Science and Engineering Sasi Institute of Technology and Engineering Andhra Pradesh Tadepalligudem India Department of Artificial Intelligence and Data Science K.Ramakrishnan College of Engineering Kariyamanickam Rd Tamil Nadu Samayapuram India PG and Research Department of Computer Science Mary Matha Arts and Science College Kerala Mananthavady India Department of Networking and Communications School of Computing College of Engineering and Technology SRM Institute of Science and Technology Tamilnadu Kattankulathur India

Modernization and intense industrialization have led to a substantial improvement in people’s quality of life. However, the aspiration for achieving an improved quality of life results in environmental contamination. A primary consequence of environmental degradation is air pollution, resulting from rising levels of poisonous chemicals in the atmosphere, which may induce detrimental health conditions in humans. It is harmful to both humans and agriculture. Given that the effects of air pollution on plants may not be readily apparent, it is important to analyse the necessary data and compute the outcomes. Farmers prioritise on pests and plant diseases, frequently neglecting the detrimental impacts of air pollution. Some plant species can withstand high amounts of pollution from suspended particulate matter and accumulated gases, while others are more susceptible to harm. Therefore, plants’ reaction to air pollution is influenced by the kind of harmful compounds, their levels, and the plant’s susceptibility to them. The LSTM +CNN Proposed Ensemble method may be used to analyse the impact of air pollution on agriculture by examining trends in crop production over time and predicting which crop is more resistant based on the pollution data. The initiative created for this aim may assist farmers in determining the most suitable crop to cultivate in their fields to minimize the impact of air pollution on agricultural yield. The findings show deep learning algorithms correctly predict hourly pollutant concentrations such as carbon monoxide, sulphur dioxide, nitrogen dioxide, ground-level ozone, and particulate matter 2.5, along with the hourly Air Quality Index (AQI) for California. A proposed model used test RMSE values as a measure to evaluate prediction performance, achieving the best possible results. © 2025 SCPE.

关键词： Nitrogen oxides

来源：评论

学校读者我要写书评

暂无评论

Detecting the symptoms of COVID-19 during pandemic environment using smart spectacle thermal images and deep capsule networks

引用

Multimedia Tools and Applications 2025年第8期84卷 4475-4501页

作者： Dwarakanath, B. Pandimurugan, V. Mohandas, R. Sambath, M. Baiju, B.V. Chinnasamy, A. SRM Institute of Science and Technology Ramapuram Chennai India Networking and Communications School of Computing SRMIST kattankulathur Chennai India Computational Intelligence School of Computing SRMIST kattankulathur Chennai India Computer Science and Engineering Hindustan Institute of Technology and Science Chennai India School of Computer Science and Engineering Vellore Institute of Technology Vellore India Department of Data Science and Business Systems School of Computing SRMIST kattankulathur Chennai India

The pandemic creates a more complicated providence of medical assistance and diagnosis procedures. In the world, Covid-19, Severe Acute Respiratory Syndrome Coronavirus-2 (SARS Cov-2), and plague are widely known pandemic disease desperations. Due to the recent COVID-19 pandemic tragedies, various medical diagnosis models and intelligent computing solutions are proposed for medical applications. In this era of computer-based medical environment, conventional clinical solutions are surpassed by many Machine Learning and Deep Learning-based COVID-19 diagnosis models. Anyhow, many existing models are developing lab-based diagnosis environments. Notably, the Gated Recurrent Unit-based Respiratory data Analysis (GRU-RE), Intelligent Unmanned Aerial Vehicle-based Covid data Analysis (Thermal Images) (I-UVAC), and Convolutional Neural Network-based computer Tomography Image Analysis (CNN-CT) are enriched with lightweight image data analysis techniques for obtaining mass pandemic data at real-time conditions. However, the existing models directly deal with bulk images (thermal data and respiratory data) to diagnose the symptoms of COVID-19. Against these works, the proposed spectacle thermal image data analysis model creates an easy and effective way of disease diagnosis deployment strategies. Particularly, the mass detection of disease symptoms needs a more lightweight equipment setup. In this proposed model, each patient's thermal data is collected via the spectacles of medical staff, and the data are analyzed with the help of a complex set of capsule network functions. Comparatively, the conventional capsule network functions are enriched in this proposed model using adequate sampling and data reduction solutions. In this way, the proposed model works effectively for mass thermal data diagnosis applications. In the experimental platform, the proposed and existing models are analyzed in various dimensions (metrics). The comparative results obtained in the experiments just

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

AG Codes Have No List-Decoding Friends: Approaching the Generalized Singleton Bound Requires Exponential Alphabets

引用

IEEE Transactions on Information Theory 2025年第4期71卷 2443-2451页

作者： Alrabiah, Omar Guruswami, Venkatesan Li, Ray University of California at Berkeley Department of Electrical Engineering and Computer Science BerkeleyCA94709 United States University of California at Berkeley Department of Electrical Engineering and Computer Science Department of Mathematics Simons Institute for the Theory of Computing BerkeleyCA94709 United States Santa Clara University Department of Mathematics and Computer Science Santa ClaraCA95053 United States

A simple, recently observed generalization of the classical Singleton bound to list-decoding asserts that rate R codes are not list-decodable using list-size L beyond an error fraction L/L+1 (1-R) (the Singleton bound being the case of L=1 , i.e., unique decoding). We prove that in order to approach this bound for any fixed L > 1 , one needs exponential alphabets. Specifically, for every L > 1 and R ∈ (0,1) , if a rate R code can be list-of-L decoded up to error fraction L/L+1 (1-R - ∈ ) , then its alphabet must have size at least exp (ΩL,R(1\ ∈)) . This is in sharp contrast to the situation for unique decoding where certain families of rate R algebraic-geometry (AG) codes over an alphabet of size O(1\ ∈2) are unique-decodable up to error fraction (1-R-\ ∈ )2 . Our bounds hold even for subconstant ∈ ≥ 1/n , implying that any code exactly achieving the L-th generalized Singleton bound requires alphabet size 2ΩL,R(n) . Previously this was only known only for L=2 under the additional assumptions that the code is both linear and MDS. Our lower bound is tight up to constant factors in the exponent—with high probability random codes (or, as shown recently, even random linear codes) over exp(OL(1\ ∈)) -sized alphabets, can be list-of-L decoded up to error fraction L/L+1 (1-R -∈ ) . © 1963-2012 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Automated face recognition using deep learning technique and center symmetric multivariant local binary pattern

引用

Neural computing and Applications 2025年第1期37卷 263-281页

作者： Sekhar, J.C. Josephson, P. Joel Chinnasamy, A. Maheswari, M. Sankar, S. Kalangi, Ruth Ramya Department of Computer Science and Engineering NRI Institute of Technology Andhra Pradesh Guntur India Department of Electronics and Communication Engineering Malla Reddy Engineering College Telangana Hyderabad India Department of Data Science and Business Systems School of Computing SRMIST Kattankulathur Chennai India Department of Computer Science and Engineering Panimalar Engineering College Chennai India Department of Computer Science and Engineering Saveetha School of Engineering SIMATS Chennai India Department of Computer Science and Engineering Koneru Lakshmaiah Education Foundation Andhra Pradesh Vijayawada India

Researchers have recently created several deep learning strategies for various tasks, and facial recognition has made remarkable progress in employing these techniques. Face recognition is a noncontact, nonobligatory, acceptable, and harmonious biometric recognition method with a promising national and social security future. The purpose of this paper is to improve the existing face recognition algorithm, investigate extensive data-driven face recognition methods, and propose a unique automated face recognition methodology based on generative adversarial networks (GANs) and the center symmetric multivariable local binary pattern (CS-MLBP). To begin, this paper employs the center symmetric multivariant local binary pattern (CS-MLBP) algorithm to extract the texture features of the face, addressing the issue that C2DPCA (column-based two-dimensional principle component analysis) does an excellent job of removing the global characteristics of the face but struggles to process the local features of the face under large samples. The extracted texture features are combined with the international features retrieved using C2DPCA to generate a multifeatured face. The proposed method, GAN-CS-MLBP, syndicates the power of GAN with the robustness of CS-MLBP, resulting in an accurate and efficient face recognition system. Deep learning algorithms, mainly neural networks, automatically extract discriminative properties from facial images. The learned features capture low-level information and high-level meanings, permitting the model to distinguish among dissimilar persons more successfully. To assess the proposed technique’s GAN-CS-MLBP performance, extensive experiments are performed on benchmark face recognition datasets such as LFW, YTF, and CASIA-WebFace. Giving to the findings, our method exceeds state-of-the-art facial recognition systems in terms of recognition accuracy and resilience. The proposed automatic face recognition system GAN-CS-MLBP provides a solid basis for a

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

DELTa: Dynamic Energy-and-Latency-aware Task scheduling for Fog-Cloud Paradigm

引用

IEEE Access 2025年 13卷 74617-74633页

作者： Mahapatra, Abhijeet Pradhan, Rosy Majhi, Santosh K. Mishra, Kaushik Department of Computer Science & Engineering Odisha Burla768018 India Sikkim Manipal University Sikkim Manipal Institute of Technology Department of Artificial Intelligence and Data Science Sikkim India Department of Electrical Engineering Odisha Burla768018 India Department of Computer Science and Information Technology Chhattisgarh Bilaspur495009 India Manipal Academy of Higher Education Manipal Institute of Technology Bengaluru Department of Computer Science and Engineering Manipal India

The rapid proliferation of IoT devices like smartphones, smartwatches, etc. has significantly elevated the quantity of data requiring execution. It poses challenges for centralized Cloud computing servers, such as latency overhead and increased consumption of energy. To address this, Fog computing has been incorporated in this research as a complementary paradigm to the Cloud-based computing model. It thereby reduces the huge distance between end-user IoT gadgets and the Cloud computing servers. In order to improve the latency and waiting time this research employs a Multi-Level Queue (MLQ) for classifying tasks based on their priority. For parallel processing, a Self-adaptive Fuzzy C-means++ (SaFCm++) approach has been applied to cluster the Fog computing nodes depending on the heterogeneity of the computational nodes. For efficient scheduling, a Dynamic Energy-and-Latency-aware Task scheduling (DELTa) approach has been proposed to optimize latency, makespan, and utilization of resources. Extensive simulations are carried out for different test cases considering task and machine heterogeneity, followed by a statistical analysis. The overall improvements of the proposed method over other baselines are 9.75% for makespan, 64.59% for service latency, 13.90% for resource utilization, and 12.75% for energy consumption. The proposed energy-efficient scheduling method effectively manages diverse tasks and resources, enhancing task processing efficiency while minimizing energy consumption and maximizing resource utilization. Furthermore, the value of the Friedman statistics FF for the proposed model is estimated at 5.44, which shows superiority over the crucial value for four methodologies and four evaluation matrices. © 2013 IEEE.

关键词： Fog computing

来源：评论

学校读者我要写书评

暂无评论

Artificial intelligence algorithms for object detection and recognition in video and images

引用

Multimedia Tools and Applications 2025年 1-18页

作者： Dakshinamoorthy, Prabakar Rajaram, Gnanajeyaraman garg, Shruti Murugan, Prabhu Manimaran, A. Sundar, Ramesh Department of Data Science and Business System School of Computing SRM Institute of Science and Technology SRM Nagar Kattankulathur Chennai India Department of Computer Science Engineering Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Tamilnadu Chennai India Birla Institute of Technology Mesra Ranchi India Department of ECE Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Chennai602105 India Department of Computer Science Engineering Saveetha School Of EngineeringSaveetha Institute of Medical and Technical Sciences Chennai6021055 India Department of Netwoking and Communication School of Computing SRM Institute of Science and Technology SRM Nagar Kattankulathur Chennai India

The usage of machine learning and deep learning algorithms have necessitated Artificial Intelligence'. AI is aimed at automating things by limiting human interference. It is widely used in IT, healthcare, finance, and agriculture. It is achieved through several deep learning algorithms that reflect the human brain's intelligence. These AI algorithms can be manipulated according to changing needs and improved efficiency. This paper tries to utilize the developments made in AI technology to classify the images and recognize the objects present in them. One widely used AI algorithm is CNN (Convolutional Neural Networks). The CNN is a deep learning-based algorithm that consists of various layers that extract and filters the parameters present in the images. Some additional layers of ResNet50 and the CNN algorithm are used to extract the parameters to improve image recognition accuracy. The image dataset taken for training and testing the proposed model is imageNet. The images are initially processed before sending them to the proposed model. The proposed model is trained, validated, and tested through the images obtained after the initial processing. The same process is repeated several times until getting the maximum accuracy. The accuracy of the proposed model in terms of image recognition is recorded. The obtained results are compared with other image classification algorithms like VGG16 and VGG19. It is concluded that the proposed model outperforms other traditional methods in terms of accuracy. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

A General Framework for Clustering and Distribution Matching with Bandit Feedback

引用

IEEE Transactions on Information Theory 2025年第3期71卷 2116-2139页

作者： Yavas, Recep Can Huang, Yuqi Tan, Vincent Y. F. Scarlett, Jonathan CNRS@CREATE DesCartes Program CREATE Tower 138602 Singapore National University of Singapore Department of Computer Science Queenstown119077 Singapore National University of Singapore School of Computing Department of Information Systems and Analytics Queenstown119077 Singapore National University of Singapore Department of Mathematics Department of Electrical and Computer Engineering Queenstown119077 Singapore Institute of Data Science National University of Singapore Department of Computer Science The Department of Mathematics Queenstown119077 Singapore

We develop a general framework for clustering and distribution matching problems with bandit feedback. We consider a K-armed bandit model where some subset of K arms is partitioned into M groups. Within each group, the random variable associated to each arm follows the same distribution on a finite alphabet. At each time step, the decision maker pulls an arm and observes its outcome from the random variable associated to that arm. Subsequent arm pulls depend on the history of arm pulls and their outcomes. The decision maker has no knowledge of the distributions of the arms or the underlying partitions. The task is to devise an online algorithm to learn the underlying partition of arms with the least number of arm pulls on average and with an error probability not exceeding a pre-determined value δ. Several existing problems fall under our general framework, including finding M pairs of arms, odd arm identification, and N-ary clustering of K arms belong to our general framework. We derive a non-asymptotic lower bound on the average number of arm pulls for any online algorithm with an error probability not exceeding δ. Furthermore, we develop a computationally-efficient online algorithm based on the Track-and-Stop method and Frank-Wolfe algorithm, and show that the average number of arm pulls of our algorithm asymptotically matches that of the lower bound. Our refined analysis also uncovers a novel bound on the speed at which the average number of arm pulls of our algorithm converges to the fundamental limit as δ vanishes. © 1963-2012 IEEE.

关键词： Random variables

来源：评论

学校读者我要写书评

暂无评论

Innovative Video Classification Method based on Deep Learning Approach

引用

Recent Patents on engineering 2025年第2期19卷 95-107页

作者： Hemamalini, V. Jayasutha, D. Vinothini, V.R. Devi, R. Manjula Kumar, A. Anitha, E. Department of Networking and Communications School of Computing SRM Institute of Science and Technology Chennai India Department of Computer Science and Engineering Arjun College of Technology Coimbatore Thamaraikulam India Department of Mathematics Bannari Amman Institute of Technology Sathyamangalam Erode638401 India Department of Computer Science and Design Kongu Engineering College Perundurai Erode638060 India Department of Civil Engineering University Institute of Engineering & Technology Maharshi Dayanand University Rohtak124001 India Department of Artificial Intelligence and Data Science Sri Eshwar College of Engineering Coimbatore641202 India

Background: The automated classification of videos through artificial neural networks is addressed in this work. To explore the concepts and measure the results, the data set UCF101 is used, consisting of video clips taken from YouTube to recognize actions. The study is carried out with the authors' resources to determine the feasibility of independent research in the area. Methods: This work was developed in the Python programming language using the Keras library with Tensorflow as the back-end. The objective is to develop a network that presents performance compatible with the state of the art in terms of classifying videos according to the actions taken. Results: Given the hardware limitations, there is considerable distance between the implementation possibilities in this work and what is known as the state-of-the-art. Conclusion: Throughout the work, some aspects in which this limitation influenced the development are presented, but it is shown that this realization is feasible and that obtaining expressive results is possible 98.6% accuracy is obtained in the UCF101 data set, compared to the 98 percentage points of the best result ever reported, using, however, considerably fewer resources. In addition, the importance of transfer learning in achieving expressive results as well as the different performances of each architecture are reviewed. Thus, this work may open doors to carry patent-based outcomes. © 2025 Bentham science Publishers.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Enhancing waste sorting and recycling efficiency: robust deep learning-based approach for classification and detection

引用

Neural computing and Applications 2025年第6期37卷 4567-4583页

作者： Sayem, Faizul Rakib Islam, Md. Sakib Bin Naznine, Mansura Nashbat, Mohammad Hasan-Zia, Mazhar Kunju, Ali K Ansaruddin Khandakar, Amith Ashraf, Azad Majid, Molla Ehsanul Kashem, Saad Bin Abul Chowdhury, Muhammad E. H. Department of Electrical and Electronic Engineering University of Dhaka Dhaka Bangladesh Department of Biomedical Engineering Military Institute of Science and Technology Dhaka Bangladesh Department of Computer Science & Engineering Rajshahi University of Engineering & Technology Rajshahi6204 Bangladesh Chemical Engineering Department University of Doha for Science and Technology Doha Qatar Department of Electrical Engineering Qatar University Doha2713 Qatar Computer Applications Department Academic Bridge Program Qatar Foundation Doha Qatar Department of Computing Science AFG College With the University of Aberdeen Doha Qatar

Given the severity of waste pollution as a major environmental concern, intelligent and sustainable waste management is becoming increasingly crucial in both developed and developing countries. The material composition and volume of urban solid waste are key considerations in processing, managing, and utilizing city waste. Deep learning technologies have emerged as viable solutions to address waste management issues by reducing labor costs and automating complex tasks. However, the limited number of trash image categories and the inadequacy of existing datasets have constrained the proper evaluation of machine learning model performance across a large number of waste classes. In this paper, we present robust waste image classification and object detection studies using deep learning models, utilizing 28 distinct recyclable categories of waste images comprising a total of 10,406 images. For the waste classification task, we proposed a novel dual-stream network that outperformed several state-of-the-art models, achieving an overall classification accuracy of 83.11%. Additionally, we introduced the GELAN-E (generalized efficient layer aggregation network) model for waste object detection tasks, obtaining a mean average precision (mAP50) of 63%, surpassing other state-of-the-art detection models. These advancements demonstrate significant progress in the field of intelligent waste management, paving the way for more efficient and effective solutions. © The Author(s) 2024.

关键词： Deep learning for waste management Intelligent waste management Object detection in waste management Sustainable waste processing Urban solid waste Waste image classification

来源：评论

学校读者我要写书评

暂无评论

PALCT: vehicle-to-vehicle communication based on pseudonym assignment and encryption scheme using delay minimisation cover tree algorithm

引用

International Journal of Vehicle Information and Communication Systems 2025年第2期10卷 132-147页

作者： Tandon, Righa Gupta, P.K. Chitkara University Institute of Engineering and Technology Chitkara University Punjab India Department of Computer Science and Engineering Jaypee University of Information Technology HP Solan173 234 India Department of Data Science School of Computing Mohan Babu University AP Tirupati517 102 India

Vehicle-to-vehicle communication is one of the new paradigms of networking, which should be secure, fast, and efficient. In this paper, we propose a framework that implements the pseudonym-based authentication scheme in which communication among vehicles is encrypted by using a matrix array symmetric key (MASK), digital signature algorithm (DSA), and intelligent water drop (IWD). The proposed security scheme also ensures the handling of many security attacks like key-guessing, non-repudiation, replay, and modification. In the proposed scheme, to preserve the identity of the vehicle, we have provided the different pseudonyms for each vehicle in the network that ensure secure communication among vehicles. Furthermore, the proposed delay minimisation cover tree algorithm ensures the issue of timed delay during vehicle-to-vehicle communication. In this algorithm, we have used Dijkstra’s algorithm for finding the optimal shortest path during vehicular communication. The results obtained show that the proposed scheme is effective and efficient, as it reduces the time delay by 4% for 140 vehicle nodes and 28.4% for 1000 vehicle nodes. Copyright © 2025 Inderscience Enterprises Ltd.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：