Mosques Smart Domes System using Machine Learning Algorithms

• URL: http://arxiv.org/abs/2009.10616v1
• Date: Sun, 30 Aug 2020 19:51:30 GMT
• Title: Mosques Smart Domes System using Machine Learning Algorithms
• Authors: Mohammad Awis Al Lababede, Anas H. Blasi, Mohammed A. Alsuwaiket
• Abstract summary: This paper aims to solve problems by building a model of smart mosques domes using weather features and outside temperatures. The experiments of this paper were applied on Prophet mosque in Saudi Arabia, which basically contains twenty seven manually moving domes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Millions of mosques around the world are suffering some problems such as ventilation and difficulty getting rid of bacteria, especially in rush hours where congestion in mosques leads to air pollution and spread of bacteria, in addition to unpleasant odors and to a state of discomfort during the pray times, where in most mosques there are no enough windows to ventilate the mosque well. This paper aims to solve these problems by building a model of smart mosques domes using weather features and outside temperatures. Machine learning algorithms such as k Nearest Neighbors and Decision Tree were applied to predict the state of the domes open or close. The experiments of this paper were applied on Prophet mosque in Saudi Arabia, which basically contains twenty seven manually moving domes. Both machine learning algorithms were tested and evaluated using different evaluation methods. After comparing the results for both algorithms, DT algorithm was achieved higher accuracy 98% comparing with 95% accuracy for kNN algorithm. Finally, the results of this study were promising and will be helpful for all mosques to use our proposed model for controlling domes automatically.

Related papers

• Movement Control of Smart Mosque's Domes using CSRNet and Fuzzy Logic Techniques [0.0]
  This paper proposes a smart dome model to preserve the fresh air and allow the sunlight to enter the mosque. The proposed model controls domes movements based on the weather conditions and the overcrowding rates in the mosque.
  arXiv  Detail & Related papers  (2024-10-13T09:39:44Z)
• MUSE: Machine Unlearning Six-Way Evaluation for Language Models [109.76505405962783]
  Language models (LMs) are trained on vast amounts of text data, which may include private and copyrighted content. We propose MUSE, a comprehensive machine unlearning evaluation benchmark. We benchmark how effectively eight popular unlearning algorithms can unlearn Harry Potter books and news articles.
  arXiv  Detail & Related papers  (2024-07-08T23:47:29Z)
• Hidden Markov Models with Random Restarts vs Boosting for Malware Detection [5.414308305392762]
  We compare boosted HMMs (using AdaBoost) to HMMs trained with multiple random restarts, in the context of malware detection. We find that random restarts perform surprisingly well in comparison to boosting.
  arXiv  Detail & Related papers  (2023-07-17T13:21:58Z)
• Mispronunciation Detection of Basic Quranic Recitation Rules using Deep Learning [0.0]
  In Islam, readers must apply a set of pronunciation rules called Tajweed rules to recite the Quran. The number of Tajweed teachers is not enough nowadays for daily recitation practice for every Muslim. We propose a solution that consists of Mel-Frequency Cepstral Coefficient (MFCC) features with Long Short-Term Memory (LSTM) neural networks which use the time series.
  arXiv  Detail & Related papers  (2023-05-10T19:31:25Z)
• Quran Recitation Recognition using End-to-End Deep Learning [0.0]
  The Quran is the holy scripture of Islam, and its recitation is an important aspect of the religion. Recognizing the recitation of the Holy Quran automatically is a challenging task due to its unique rules. We propose a novel end-to-end deep learning model for recognizing the recitation of the Holy Quran.
  arXiv  Detail & Related papers  (2023-05-10T18:40:01Z)
• Lightning Fast Video Anomaly Detection via Adversarial Knowledge Distillation [106.42167050921718]
  We propose a very fast frame-level model for anomaly detection in video. It learns to detect anomalies by distilling knowledge from multiple highly accurate object-level teacher models. Our model achieves the best trade-off between speed and accuracy, due to its previously unheard-of speed of 1480 FPS.
  arXiv  Detail & Related papers  (2022-11-28T17:50:19Z)
• Increasing Students' Engagement to Reminder Emails Through Multi-Armed Bandits [60.4933541247257]
  This paper shows a real-world adaptive experiment on how students engage with instructors' weekly email reminders to build their time management habits. Using Multi-Armed Bandits (MAB) algorithms in adaptive experiments can increase students' chances of obtaining better outcomes. We highlight problems with these adaptive algorithms - such as possible exploitation of an arm when there is no significant difference.
  arXiv  Detail & Related papers  (2022-08-10T00:30:52Z)
• On-board Volcanic Eruption Detection through CNNs and Satellite Multispectral Imagery [59.442493247857755]
  Authors propose a first prototype and a study of feasibility for an AI model to be 'loaded' on board. As a case study, the authors decided to investigate the detection of volcanic eruptions as a method to swiftly produce alerts. Two Convolutional Neural Networks have been proposed and created, also showing how to correctly implement them on real hardware.
  arXiv  Detail & Related papers  (2021-06-29T11:52:43Z)
• Provably Robust Metric Learning [98.50580215125142]
  We show that existing metric learning algorithms can result in metrics that are less robust than the Euclidean distance. We propose a novel metric learning algorithm to find a Mahalanobis distance that is robust against adversarial perturbations. Experimental results show that the proposed metric learning algorithm improves both certified robust errors and empirical robust errors.
  arXiv  Detail & Related papers  (2020-06-12T09:17:08Z)
• Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds [48.312484940846]
  We revisit the problem of online learning with sleeping experts/bandits. In each time step, only a subset of the actions are available for the algorithm to choose from. We give an algorithm that provides a no-approximate-regret guarantee for the general sleeping expert/bandit problems.
  arXiv  Detail & Related papers  (2020-03-07T02:13:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.