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

2021 IEEE International Conference on Automatic Control and Intelligent Systems, I2CACIS 2021

作者： Alomari, Mohammad Ahmed Ahmed Al-Qasem Al-Hadi, Ismail Yusoff, M. Hafiz Sulaiman, Ibrahim Mohammed Universiti Tenaga Nasional Institute of Informatics and Computing in Energy Malaysia Faculty of Ocean Engineering Technology Informatics Malaysia School of Informatics and Computing Malaysia Faculty of Informatics and Computing Malaysia

ISBN: (纸本)9781665403436

A survey by Malaysian Communication and Multimedia Commission (MCMC) has shown that Internet users in Malaysia has increased up to 88.7% in year 2020 compared to 76.9% in year 2016 which is quite high increase in percentage. The pervasive use of smartphones and computers nowadays as well as the availability of high-speed Internet access has brought a new way of promoting products. E-commerce is a buy and sell system that can be accessed globally around the world. This system can provide efficient strategies for promoting products and services. It is widely agreed that even small enhancements in promotion techniques can increase the profitability of any e-commerce system. In this paper, a research has been conducted to study methods to enhance product promotion among Malaysians. The study investigates through a survey the factors affecting users' WTP (willing-to-pay) during performing e-commerce transaction as well as factors what attract/repel them more. To achieve the study aim, a group of 385 respondents throughout Malaysia have been involved in this research through questionnaire study. Detailed analysis has been introduced to clarify the results. The study has identified the top e-commerce platforms that are used by Malaysians to execute product promotion. The results show that promotion through e-commerce platforms could increase profitability and help businesses to expand rapidly. This is due to the fast market penetration of online promoting compared to conventional one. © 2021 IEEE.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

AI-Driven Learning Management Systems:Modern Developments, Challenges and Future Trends during theAge of ChatGPT

引用

Computers, Materials & Continua 2024年第8期80卷 3289-3314页

作者： Sameer Qazi Muhammad Bilal Kadri Muhammad Naveed Bilal AKhawaja Sohaib Zia Khan Muhammad Mansoor Alam Mazliham Mohd Su’ud Department of Computer Science Faculty of EngineeringScience and TechnologyIQRA UniversityKarachi75500Pakistan College of Computer and Information Sciences Prince Sultan UniversityRiyadh11586Saudi Arabia Faculty of Engineering Department of Electrical EngineeringIslamic University of MadinahP.O.BOX 170Madinah41411Saudi Arabia Faculty of Engineering Department of Mechanical EngineeringIslamic University of MadinahP.O.BOX 170Madinah41411Saudi Arabia Faculty of Computing Riphah International UniversityIslamabad46000Pakistan Faculty of Computing and Informatics(FCI)Multimedia University Cyberjaya63100Malaysia Faculty of Engineering and Information Technology School of Computer ScienceUniversity of Technology SydneySydneyNSW 2007Australia

COVID-19 pandemic restrictions limited all social activities to curtail the spread of the *** foremost and most prime sector among those affected were schools,colleges,and *** education system of entire nations had shifted to online education during this *** shortcomings of Learning Management Systems(LMSs)were detected to support education in an online mode that spawned the research in Artificial Intelligence(AI)based tools that are being developed by the research community to improve the effectiveness of *** paper presents a detailed survey of the different enhancements to LMSs,which are led by key advances in the area of AI to enhance the real-time and non-real-time user *** AI-based enhancements proposed to the LMSs start from the Application layer and Presentation layer in the form of flipped classroom models for the efficient learning environment and appropriately designed UI/UX for efficient utilization of LMS utilities and resources,including AI-based *** layer enhancements are also required,such as AI-based online proctoring and user authentication using *** extend to the Transport layer to support real-time and rate adaptive encrypted video transmission for user security/privacy and satisfactory working of *** also needs the support of the Networking layer for IP-based geolocation features,the Virtual Private Network(VPN)feature,and the support of Software-Defined Networks(SDN)for optimum Quality of Service(QoS).Finally,in addition to these,non-real-time user experience is enhanced by other AI-based enhancements such as Plagiarism detection algorithms and Data Analytics.

关键词： Learning management systems chatbots ChatGPT online education Internet of Things(IoT) artificial intelligence(AI) convolutional neural networks natural language processing

来源：评论

学校读者我要写书评

暂无评论

Parameterized Complexity Classification for Interval Constraints 18

Parameterized Complexity Classification for Interval Constra...

引用

18th International Symposium on Parameterized and Exact Computation, IPEC 2023

作者： Dabrowski, Konrad K. Jonsson, Peter Ordyniak, Sebastian Osipov, George Pilipczuk, Marcin Sharma, Roohani School of Computing Newcastle University United Kingdom Department of Computer and Information Science Linköping University Sweden School of Computing University of Leeds United Kingdom Faculty of Mathematics Informatics and Mechanics University of Warsaw Poland IT University Copenhagen Denmark Max Planck Institute for Informatics Saarland Informatics Campus Saarbrücken Germany

ISBN: (纸本)9783959773058

Constraint satisfaction problems form a nicely behaved class of problems that lends itself to complexity classification results. From the point of view of parameterized complexity, a natural task is to classify the parameterized complexity of MinCSP problems parameterized by the number of unsatisfied constraints. In other words, we ask whether we can delete at most k constraints, where k is the parameter, to get a satisfiable instance. In this work, we take a step towards classifying the parameterized complexity for an important infinite-domain CSP: Allen's interval algebra (IA). This CSP has closed intervals with rational endpoints as domain values and employs a set A of 13 basic comparison relations such as "precedes" or "during" for relating intervals. IA is a highly influential and well-studied formalism within AI and qualitative reasoning that has numerous applications in, for instance, planning, natural language processing and molecular biology. We provide an FPT vs. W[1]-hard dichotomy for MinCSP(Γ) for all Γ ⊆ A. IA is sometimes extended with unions of the relations in A or first-order definable relations over A, but extending our results to these cases would require first solving the parameterized complexity of Directed Symmetric Multicut, which is a notorious open problem. Already in this limited setting, we uncover connections to new variants of graph cut and separation problems. This includes hardness proofs for simultaneous cuts or feedback arc set problems in directed graphs, as well as new tractable cases with algorithms based on the recently introduced flow augmentation technique. Given the intractability of MinCSP(A) in general, we then consider (parameterized) approximation algorithms. We first show that MinCSP(A) cannot be polynomial-time approximated within any constant factor and continue by presenting a factor-2 fpt-approximation algorithm. Once again, this algorithm has its roots in flow augmentation. © 2023 Schloss Dagstuhl- Leibniz-Zentrum f

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Juris-informatics: Law for AI and Law of AI

Juris-Informatics: Law for AI and Law of AI

引用

2024 IEEE International Conference on Big Data, BigData 2024

作者： Satoh, Ken Takeda, Hideaki Goebel, Randy Kano, Yoshinobu Kim, Mi-Young Rabelo, Juliano Yoshioka, Masaharu Center for Juris-Informatics Tokyo Japan University of Alberta Dept. of Computing Science Alberta Machine Intelligence Institute EdmontonAB Canada Shizuoka University Faculty of Informatics Shizuoka Hamamatsu Japan University of Alberta Augustana Faculty Dept. of Science AB Canada Hokkaido University Faculty of Information Science and Technology Hokkaido Sapporo Japan

ISBN: (纸本)9798350362480

This paper presents an outline of our research project developed at our research center for "Juris-informatics". "Juris-informatics"is a research field based on two main topics;"Law by AI"and "Law of AI". "Law by Ai"is a research field where we investigate a support tool by AI for legal activities such as legal reasoning and legal document processing. "Law of AI"is a research field where we conduct research on legal control of AI such as considering the legal responsibility of AI and legal compliance of AI. © 2024 IEEE.

关键词： informatics

来源：评论

学校读者我要写书评

暂无评论

Bringing Culture to Life: A Usability Study of Web-AR Folklore Storytelling

Bringing Culture to Life: A Usability Study of Web-AR Folklo...

引用

2024 IEEE International Conference on computing, ICOCO 2024

作者： Sani, Zaidatol Haslinda Abdullah Nizam, Dinna Nina Mohd Naim, Nur Faraha Mohd Amat, Nur Asmiaty User Experience Research Group Faculty of Computing and Informatics Universiti Malaysia Sabah Sabah Malaysia Centre for the Promotion of Knowledge and Language Learning Universiti Malaysia Sabah Sabah Malaysia

ISBN: (纸本)9798331530303

Learning about culture is essential, and expanding the methods of cultural education beyond traditional learning is crucial. Technology offers new opportunities to not only enhance cultural learning but also promote tourism by introducing cultural elements through innovative platforms. This study evaluates the usability of a web-AR app designed to introduce the Bajau Samah culture through folklore storytelling, providing both an educational tool and a tourism promotion method. The app consists of six pages, allowing users to interact with augmented reality (AR) by scanning markers. Users can zoom and rotate 3D models, listen to audio, and read accompanying narratives. A total of 33 participants took part in the usability study, with more than half of them having no prior experience with AR. The System Usability Scale (SUS) score was 83.5%, indicating good usability. While some usability issues were identified and suggestions for improvement were provided, overall, participants enjoyed using the web-AR app and found it effective in educating them about Bajau Samah culture through AR-folklore storytelling. ©2024 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Dynamic Data Structures for Parameterized String Problems 40

Dynamic Data Structures for Parameterized String Problems

引用

40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023

作者： Olkowski, Jędrzej Pilipczuk, Michal Rychlicki, Mateusz Węgrzycki, Karol Zych-Pawlewicz, Anna Faculty of Mathematics Informatics and Mechanics University of Warsaw Poland Institute of Informatics University of Warsaw Poland School of Computing University of Leeds United Kingdom Saarland University Saarbrücken Germany Max Planck Institute for Informatics Saarbrücken Germany

ISBN: (纸本)9783959772662

We revisit classic string problems considered in the area of parameterized complexity, and study them through the lens of dynamic data structures. That is, instead of asking for a static algorithm that solves the given instance efficiently, our goal is to design a data structure that efficiently maintains a solution, or reports a lack thereof, upon updates in the instance. We first consider the Closest String problem, for which we design randomized dynamic data structures with amortized update times dO(d) and |Σ|O(d), respectively, where Σ is the alphabet and d is the assumed bound on the maximum distance. These are obtained by combining known static approaches to Closest String with color-coding. Next, we note that from a result of Frandsen et al. [J. ACM’97] one can easily infer a meta-theorem that provides dynamic data structures for parameterized string problems with worst-case update time of the form Ok(log log n), where k is the parameter in question and n is the length of the string. We showcase the utility of this meta-theorem by giving such data structures for problems Disjoint Factors and Edit Distance. We also give explicit data structures for these problems, with worst-case update times O(k2k log log n) and O(k2 log log n), respectively. Finally, we discuss how a lower bound methodology introduced by Amarilli et al. [ICALP’21] can be used to show that obtaining update time O(f(k)) for Disjoint Factors and Edit Distance is unlikely already for a constant value of the parameter k. © Jędrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Węgrzycki, and Anna Zych-Pawlewicz.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Fruit Detection and Recognition Using Faster R-CNN with FPN30 Pre-trained Network 8

Fruit Detection and Recognition Using Faster R-CNN with FPN3...

引用

8th IEEE International Conference on Recent Advances and Innovations in Engineering, ICRAIE 2023

作者： Roslan, Muhammad Izzat Ibrahim, Zaidah Adnan, Nur Aina Khadijah Diah, Norizan Mat Narawi, Nur Azima Alya Arif, Yunifa Miftachul Universiti Teknologi MARA Shah Alam College of Computing Informatics and Mathematics Selangor 40450 Malaysia Universitas Islam Negeri Maulana Malik Ibrahim Informatics Engineering Faculty of Science and Technology Malang Indonesia

ISBN: (纸本)9798350315516

Accurate and reliable fruit detection and recognition in orchards is critical for enabling higher-level agriculture tasks such as fruit picking. However, detecting and recognizing fruits with occlusion by neighboring fruits is extremely difficult. Faster R-CNN (Faster Region-based Convolutional Neural Network) is a well-known deep learning technology for object detection and recognition. Thus, this study investigates the application of Faster R-CNN for apple detection and recognition. Two different datasets have been constructed under variable illumination conditions and occlusion;an inter-class dataset that consists of images of apples and oranges, and an intra-class dataset that consists of images of two types of apples, namely fuji and royal gala apples. Results indicate that Faster R-CNN can detect and recognize apples from oranges, and the fuji apple in the orchards, with high accuracy. This suggests that Faster R-CNN can be used practically in the real orchard context. © 2023 IEEE.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Modified canny edge detection technique for identifying endpoints 14

Modified canny edge detection technique for identifying endp...

引用

14th Seminar on Science and Technology 2021, S and T 2021

作者： Kieu, S.T.H. Bade, A. Hijazi, M.H.A. Faculty of Science and Natural Resources Universiti Malaysia Sabah Malaysia Faculty of Computing and Informatics Universiti Malaysia Sabah Malaysia

Edge detection is an image processing technique that retains the edges of an object in an image while discarding other features. The Canny edge detection technique is regarded as one of the most successful edge detection algorithms because of the good edge detection effect. However, one of its problems is the discontinued edges. In this paper, we present an endpoint identification algorithm that can pinpoint the position of the discontinued edges. After the endpoints are identified, they are paired together based on distance, and the broken gaps are filled by connecting the endpoints. Results have shown that, visually, our method has fewer discontinued edges when compared to Canny. Also, the mean square error of our method is lower than traditional Canny, indicating that our technique produces edge images that are more accurate than the traditional Canny. © 2022 Institute of Physics Publishing. All rights reserved.

关键词： Edge detection

来源：评论

学校读者我要写书评

暂无评论

Automated Ground Truth Annotation for Forest and Non-Forest Classification in Satellite Remote Sensing Images 4

Automated Ground Truth Annotation for Forest and Non-Forest ...

引用

4th International Conference on Artificial Intelligence and Data Sciences, AiDAS 2023

作者： Jelas, Imran Md Zulkifley, Mohd Asyraf Abdullah, Mardina Universiti Kebangsaan Malaysia Faculty of Engineering and Built Environment Selangor Malaysia College of Computing Informatics and Mathematics Universiti Teknologi Mara Perak Malaysia

ISBN: (纸本)9798350318432

Accurate ground truth annotation plays a vital role in training and evaluating deep learning models for forest and non-forest classification tasks. This paper introduces a robust algorithm designed to automate the annotation process, specifically targeting the identification of regions of interest;either forest or non-forest based on satellite images. The algorithm incorporates advanced image processing techniques, such as Gaussian blur and thresholding, to enhance the accuracy and reliability of the generated ground truth annotations. To determine the optimal sequence of steps, the results from a pilot test revealed that applying Gaussian blur before grayscale and thresholding operation yielded the best performance. The proposed algorithm presents a systematic and efficient approach to generate the ground truth annotations, effectively reducing manual effort and minimizing subjectivity among human annotators. Evaluation against a set of referenced ground truth dataset showcases the algorithm's effectiveness, with an impressive SSIM value of 0.874640, thus, accurately identifying the forest and non-forest regions. The study contributes to the field of forest monitoring by offering a valuable tool to researchers engaged in land cover analysis using satellite imagery. Moreover, it paves the way for future advancements in automated annotation techniques. The study uniquely emphasizes the aim of minimizing biases and uncertainties, which stands as a novel and pivotal contribution. The study underscores the significance of harnessing cutting-edge technology to foster efficiency, dependability, and precision in analyzing complex forest ecosystems. © 2023 IEEE.

关键词： Satellite imagery

来源：评论

学校读者我要写书评

暂无评论

Languages Given by Finite Automata over the Unary Alphabet 43

Languages Given by Finite Automata over the Unary Alphabet

引用

43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023

作者： Czerwiski, Wojciech Dbski, Maciej Gogasz, Tomasz Hoi, Gordon Jain, Sanjay Skrzypczak, Micha Stephan, Frank Tan, Christopher Warsaw Poland Faculty of Mathematics Institute of Informatics Informatics and Mechanics School of Informatics and IT School of Informatics and IT Temasek Polytechnic Singapore Singapore School of Computing National University of Singapore Singapore University of Warsaw Poland National University of Singapore Singapore Department of Mathematics National University of Singapore Singapore

ISBN: (纸本)9783959773041

This paper studies the complexity of operations on finite automata and the complexity of their decision problems when the alphabet is unary and n the number of states of the finite automata considered. The following main results are obtained: (1) Equality and inclusion of NFAs can be decided within time 2O((n log n)1/3);previous upper bound 2O((n log n)1/2) was by Chrobak (1986) via DFA conversion. (2) The state complexity of operations of UFAs (unambiguous finite automata) increases for complementation and union at most by quasipolynomial;however, for concatenation of two n-state UFAs, the worst case is an UFA of at least 2O(n1/6) states. Previously the upper bounds for complementation and union were exponential-type and this lower bound for concatenation is new. © 2023 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： Finite automata

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：