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

Implementation of Generate and Test Algorithm for Junior High School Zoning System in Malang 4

学校读者我要写书评

暂无评论

Implementation of Generate and Test Algorithm for Junior Hig...

4th International Conference on Vocational Education and Training, ICOVET 2020

作者： Ratnasar, Novia Agustin Mawarni, Inggar Tri Nur Handayani, Anik Wibawa, Aji Prasetya Hammad, Jehad A. H Wibowotomo, Budi Sugandi, MacHmud Universitas Negeri Malang Vocational Education Program Department Indonesia Universitas Negeri Malang Electrical Engineering Dept Indonesia Al-Quds Open University Faculty of Technology and Applied Sciences Department of Computer Information Systems Palestine Universitas Negeri Malang Industrial Technology Department Malang65145 Indonesia Universitas Negeri Malang Mechanical ENgineering Department Malang65145 Indonesia

ISBN: (纸本)9781728181318

Admission of new students in 2019 through zoning still faces many obstacles, one of which is the readiness of the application to determine the distance of a student's house from the nearest recommended school. The purpose of this study is to provide better recommendations regarding the shortest and most accurate distance in the zoning system for admission of junior high school students in Malang by using the Generate and Test algorithm without having to do it manually or using other map applications. The results of this study indicate that the distance value obtained from the haversine formula corresponds to the original distance measured through a zoning application that applies the Generate and Test algorithm to measure the closest distance from the student's location. The recommended distance is given through a process of repetition and comparison of nodes. By using the generate and test algorithm for the search process the shortest distance from the user to the destination school has an average time of 6.2MB, the level of accuracy is the same as the Haversine calculation. © 2020 IEEE.

关键词： Students

Corrigendum to "Energy efficiency in software: A case study on sustainability in personal health records" [J. Clean. Prod. 282 (2021) 124262]

学校读者我要写书评

暂无评论

Journal of cleaner production 2021年 296卷 126544页

作者： José A García-Berná José L Fernández-Alemán Juan M Carrillo de Gea Ambrosio Toval Javier Mancebo Coral Calero Félix García Department of Informatics and Systems Faculty of Computer Science University of Murcia Spain. Department of Information Technologies and Systems Faculty of Computer Science University of Castilla-La Mancha Ciudad Real Spain.

[This corrects the article DOI: 10.1016/***.2020.124262.].

关键词：

Influencer Detection with Dynamic Graph Neural Networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Tiukhova, Elena Penaloza, Emiliano Garcia, Hernan Bahnsen, Alejandro Correa Óskarsdóttir, María Baesens, Bart Snoeck, Monique Bravo, Cristián Research Center for Information Systems Engineering Faculty of Economics and Business KU Leuven Naamsestraat 69 Leuven3000 Belgium Department of Statistical and Actuarial Sciences The University of Western Ontario 1151 Richmond Street LondonONN6A 5B7 Canada Rappi BogotáCl.93 #19-58 Colombia Department of Computer Science Reykjavík University Menntavegi 1 Reykjavík102 Iceland

Leveraging network information for prediction tasks has become a common practice in many domains. Being an important part of targeted marketing, influencer detection can potentially benefit from incorporating dynamic network representation. In this work, we investigate different dynamic Graph Neural Networks (GNNs) configurations for influencer detection and evaluate their prediction performance using a unique corporate data set. We show that using deep multi-head attention in GNN and encoding temporal attributes significantly improves performance. Furthermore, our empirical evaluation illustrates that capturing neighborhood representation is more beneficial that using network centrality measures. © 2022, CC BY.

关键词： Graph neural networks

Evo-RL: Evolutionary-Driven Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Hallawa, Ahmed Born, Thorsten Schmeink, Anke Dartmann, Guido Peine, Arne Martin, Lukas Iacca, Giovanni Eiben, A.E. Ascheid, Gerd Integrated Signal Processing Systems RWTH Aachen University Department of Intensive Care and Intermediate Care University Hospital RWTH Aachen Research Area Information Theory and Systematic Design of Communication Systems RWTH Aachen University Research Area Distributed Systems Trier University of Applied Sciences Department of Information Engineering and Computer Science University of Trento Computer Science Department Vrije Universiteit Amsterdam Netherlands

In this work, we propose a novel approach for reinforcement learning driven by evolutionary computation. Our algorithm, dubbed as Evolutionary-Driven Reinforcement Learning (Evo-RL), embeds the reinforcement learning algorithm in an evolutionary cycle, where we distinctly differentiate between purely evolvable (instinctive) behaviour versus purely learnable behaviour. Furthermore, we propose that this distinction is decided by the evolutionary process, thus allowing Evo-RL to be adaptive to different environments. In addition, Evo-RL facilitates learning on environments with rewardless states, which makes it more suited for real-world problems with incomplete information. To show that Evo-RL leads to state-of-the-art performance, we present the performance of different state-of-the-art reinforcement learning algorithms when operating within Evo-RL and compare it with the case when these same algorithms are executed independently. Results show that reinforcement learning algorithms embedded within our Evo-RL approach significantly outperform the stand-alone versions of the same RL algorithms on OpenAI Gym control problems with rewardless states constrained by the same computational budget. Copyright © 2020, The Authors. All rights reserved.

关键词： Evolutionary algorithms

Supervised morphological segmentation using rich annotated lexicon 12

学校读者我要写书评

暂无评论

Supervised morphological segmentation using rich annotated l...

12th International Conference on Recent Advances in Natural Language Processing, RANLP 2019

作者： Ansari, Ebrahim Žabokrtský, Zdeněk Mahmoudi, Mohammad Haghdoost, Hamid Vidra, Jonáš Institute of Formal and Applied Linguistics Faculty of Mathematics and Physics Charles University Czech Republic Department of Computer Science and Information Technology Institute for Advanced Studies in Basic Sciences Iran

ISBN: (纸本)9789544520557

Morphological segmentation of words is the process of dividing a word into smaller units called morphemes;it is tricky especially when a morphologically rich or polysynthetic language is under question. In this work, we designed and evaluated several Recurrent Neural Network (RNN) based models as well as various other machine learning based approaches for the morphological segmentation task. We trained our models using annotated segmentation lexicons. To evaluate the effect of the training data size on our models, we decided to create a large hand-annotated morphologically segmented corpus of Persian words, which is, to the best of our knowledge, the first and the only segmentation lexicon for the Persian language. In the experimental phase, using the hand-annotated Persian lexicon and two smaller similar lexicons for Czech and Finnish languages, we evaluated the effect of the training data size, different hyper-parameters settings as well as different RNN-based models. © 2019 Association for Computational Linguistics (ACL). All rights reserved.

关键词： Recurrent neural networks

Latency Analysis of Multiple Classes of AVB Traffic in TSN with Standard Credit Behavior using Network Calculus

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhao, Luxi Pop, Paul Zheng, Zhong Daigmorte, Hugo Boyer, Marc Department of Applied Mathematics and Computer Science Technical University of Denmark Denmark Department of Electronics and Information Engineering Beihang University Beijing China RealTime-at-Work Toulouse France Department on Information Processing and Systems at ONERA Toulouse France

Time-Sensitive Networking (TSN) is a set of amendments that extend Ethernet to support distributed safety-critical and real-time applications in the industrial automation, aerospace and automotive areas. TSN integrates multiple traffic types and supports interactions in several combinations. In this paper we consider the configuration supporting Scheduled Traffic (ST) traffic scheduled based on Gate-Control-Lists (GCLs), Audio-Video-Bridging (AVB) traffic according to IEEE 802.1BA that has bounded latencies, and Best-Effort (BE) traffic, for which no guarantees are provided. The paper extends the timing analysis method to multiple AVB classes and proofs the credit bounds for multiple classes of AVB traffic, respectively under frozen and non-frozen behaviors of credit during guard band (GB). They are prerequisites for non-overflow credits of Credit-Based Shaper (CBS) and preventing starvation of AVB traffic. Moreover, this paper proposes an improved timing analysis method reducing the pessimism for the worst-case end-to-end delays of AVB traffic by considering the limitations from the physical link rate and the output of CBS. Finally, we evaluate the improved analysis method on both synthetic and real-world test cases, showing the significant reduction of pessimism on latency bounds compared to related work, and presenting the correctness validation compared with simulation results. We also compare the AVB latency bounds in the case of frozen and non-frozen credit during GB. Additionally, we evaluate the scalability of our method with variation of the load of ST flows and of the bandwidth reservation for AVB traffic. Copyright © 2020, The Authors. All rights reserved.

关键词： Calculations

Exploring cement Production's role in GDP using explainable AI and sustainability analysis in Nepal

学校读者我要写书评

暂无评论

Case Studies in Chemical and Environmental Engineering 2025年 11卷

作者： Poudyal, Ramhari Paneru, Biplov Paneru, Bishwash Giri, Tilak Paneru, Bibek Reynolds, Tim Poudyal, Khem Narayan Dangi, Mohan B. Purbanchal University Himalayan Institute of Science and Technology (HIST) Information Systems Engineering Department Safa Urja (Clean Energy) Co. Ltd Nepal Nepal Department of Electronics and Communication Engineering Nepal Engineering College Pokhara University Bhaktapur Nepal Department of Applied Sciences and Chemical Engineering Institute of Engineering Pulchowk Campus Tribhuvan University Nepal Department of Mechanical and Aerospace Engineering Institute of Engineering Pulchowk Campus Tribhuvan University Nepal Faculty of Management Tribhuvan University Nepal Anglia Ruskin University Cambridge United Kingdom Department of Geography and City & Regional Planning California State University Fresno 93740 CA United States

Due to rising demand, the worldwide cement market is expected to increase from $340.61 billion in 2022 to $481.73 billion by 2029. Quarrying, raw material processing, and calcination are steps in cement production. The societies in India and Nepal have to deal with environmental issues such as air pollution, resource depletion, and the effects of climate change. A case study of Nepal's Udayapur Cement Industry Limited (UCIL) exposed antiquated production methods that reduce energy efficiency. Utilizing regression models like Extra Trees (Extremely Randomized Trees) Regressor, CatBoost (Categorial Boosting) Regressor, and XGBoost (eXtreme Gradient Boosting) Regressor, Random Forest and Ensemble of Sparse Embedded Trees (SET) machine learning is used to examine the demand, supply, and Gross Domestic Product (GDP) performance of cement manufacturing in India which shares a common cement related infrastructure to Nepal. Since businesses understand how important sustainability is to attract new customers and minimizing environmental effects, our study emphasizes the necessity of sustainable practices in the cement production industry. On evaluation, the Extra Trees Regressor showed strong performance, along with the SET (Stacking) model, which was further validated using a nested cross-validation technique. Random Forest, on the other hand, had trouble;it displayed the greatest RMSE (15617.85) and the lowest testing (0.8117), suggesting poorer generalization. The SET (Stacking) Ensemble model gained a testing R² score (0.9372) and a testing RMSE (9019.76). In cross-validation, the Extra Trees model with a mean cross-validation R² score of 0.93 and a low standard deviation of 0.04 proved to be the best-performing model, as evidenced by lower differences in R² score across folds compared to other models, demonstrating its high predictive performance. The SHAP (SHapley Additive exPlanations) interpretability analysis indicates that populatio

关键词： Energy conservation Energy efficiency Energy management Guided user interface (GUI) Machine learning SHAP analysis Sustainability UCIL

An Empirical Study of In-App Advertising Issues Based on Large Scale App Review Analysis

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Gao, Cuiyun Zeng, Jichuan Lo, David Xia, Xin King, Irwin Lyu, Michael R. School of Computer Science and Technology Harbin Institute of Technology Shenzhen China Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Hong Kong School of Information Systems Singapore Management University Singapore Singapore Faculty of Information Technology Monash University Australia

In-app advertising closely relates to app revenue. Reckless ad integration could adversely impact app reliability and user experience, leading to loss of income. It is very challenging to balance the ad revenue and user experience for app developers. In this paper, we present a large-scale analysis on ad-related user feedback. The large user feedback data from App Store and Google Play allow us to summarize ad-related app issues comprehensively and thus provide practical ad integration strategies for developers. We first define common ad issues by manually labeling a statistically representative sample of ad-related feedback, and then build an automatic classifier to categorize ad-related feedback. We study the relations between different ad issues and user ratings to identify the ad issues poorly scored by users. We also explore the fix durations of ad issues across platforms for extracting insights into prioritizing ad issues for ad maintenance. We summarize 15 types of ad issues by manually annotating 903/36,309 ad-related user reviews. From a statistical analysis of 36,309 ad-related reviews, we find that users care most about the number of unique ads and ad display frequency during usage. Besides, users tend to give relatively lower ratings when they report the security and notification related issues. Regarding different platforms, we observe that the distributions of ad issues are significantly different between App Store and Google Play. Moreover, some ad issue types are addressed more quickly by developers than other ad issues. We believe the findings we discovered can benefit app developers towards balancing ad revenue and user experience while ensuring app reliability. Copyright © 2020, The Authors. All rights reserved.

关键词： Marketing

Single Server Queues with Batch Poisson Input and Multiple Types of Outgoing Calls 1

学校读者我要写书评

暂无评论

18th International Conference on information Technologies and Mathematical Modelling, ITMM 2019

作者： Nazarov, Anatoly Phung-Duc, Tuan Paul, Svetlana Lizura, Olga Institute of Applied Mathematics and Computer Science National Research Tomsk State University 36 Lenina Avenue Tomsk634050 Russia Faculty of Engineering Information and Systems University of Tsukuba 1-1-1 Tennodai TsukubaIbaraki305-8573 Japan

ISBN: (数字)9783030333881

ISBN: (纸本)9783030333874

In this paper, we consider a single server queueing model with Batch Poisson input flow. Upon arrival, an incoming call from the batch occupies the server, if the server is idle. Other calls from the batch join the orbit and try to occupy the server after an exponentially distributed time. If the server is busy all incoming calls from the batch join the orbit and make a delay for an exponentially distributed time then repeat their request for service. The server makes an outgoing call in its idle time. Our contribution is to derive the stationary probability distribution of the number of incoming calls in the system. © 2019, Springer Nature Switzerland AG.

关键词： Queueing theory