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

11th International Conference on Information Technology in Medicine and Education, ITME 2021

作者： Han, Shu Wang, Hong School of Information Science and Engineering Shandong Normal University China Shandong Provincial Key Laboratory of Distributed Computing Software Jinan China

ISBN: (纸本)9781665406796

There is a huge gap between theory and practice in the traditional teaching model, which seriously degrades student's practical ability and problem-solving ability. To overcome the shortcomings of the traditional teaching model, this paper proposes a novel application design based on advanced project-driven in the teaching process of JSP courses, which is capable of simultaneously boosting students' theoretical and practical abilities. Particularly, the teaching knowledge points are decomposed into dual tasks involving theoretical and practical goals by following the way of 'project advanced guidance, task decomposition driven'. Compared with the traditional teaching model, splitting the knowledge points into the project during the teaching process can not only improve the learning efficiency but also cultivate the students' computer practice ability. The research results verify that our proposed teaching model allows students to deepen their knowledge mastery, establish a complete knowledge system, improve their practical ability, and finally apply theoretical knowledge to solve practical problems in the real world. © 2021 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Co-Evolution Algorithm with Variable-Importance Grouping for Large-Scale Optimization 13

A Cooperative Co-Evolution Algorithm with Variable-Importanc...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Li, Yongfeng Zhang, Yuze Ma, Lijia Ji, Junkai Liu, Dugang Leung, Victor C. M. Li, Jianqiang Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Guangdong Laboratory of Artificial Intelligence and Digital Economy Shenzhen518123 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518172 China The University of British Columbia Department of Electrical and Computer Engineering VancouverV6T 1Z4 Canada

ISBN: (纸本)9798350308365

Cooperative co-evolution (CC) is a promising direction in solving large-scale multiobjective optimization problems (LMOPs). However, most existing methods of grouping decision variables face some difficulties when searching in the huge search space. Specifically, the methods of grouping decision variables can be classified into two types, i.e., high-consumption grouping methods and non-consumption grouping methods. On the one hand, the former ones divide the decision variables into different groups based on the correlation analysis between variables, which consume much evaluation. This way may lead to premature convergence within limited computational resources. On the other hand, the later ones allocate the decision variables into sub-groups based on some metrics, e.g., order and size, which consume no evaluation while may cause the search fall into local optima. To alleviate the above issues, this paper proposes a CC-based algorithm with a variable-importance grouping (VIG) method, called VICCA. Firstly, the decision variables are classified into several subgroups according to their importance quantified by a meta-gene construction method. Secondly, a CC strategy is designed to simultaneously optimize all subgroups of decision variables formed by VIG using the differential evolution operator, which aims to accelerate the convergence speed. Thirdly, a global evolutionary strategy is proposed to optimize original decision variable space by the competitive swarm optimizer, aiming to maintain the diversity. Finally, the experiments demonstrate that our proposed VICCA has the significant advantage in solving LMOPs when compared with state-of-the-art evolutionary algorithms. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Multiobjective Sequential Transfer Optimization: Benchmark Problems and Preliminary Results 13

Multiobjective Sequential Transfer Optimization: Benchmark P...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Xue, Xiaoming Feng, Liang Yang, Cuie Liu, Songbai Song, Linqi Tan, Kay Chen City University of Hong Kong Department of Computer Science Hong Kong College of Computer Science Chongqing University Chongqing China Northeastern University State Key Lab of Synthetic Automation for Process Industries Shenyang China College of Computer Science and Software Engineering Shenzhen University Shenzhen China The Hong Kong Polytechnic University Department of Computing Hong Kong

ISBN: (纸本)9798350308365

In cases of frequent problem-solving of multiobjective optimization tasks from a domain due to changing conditions or problem features, a growing number of individual tasks will be solved and stored in a database, providing an opportunity for a target task at hand to achieve better optimization performance through knowledge transfer from the previously-solved tasks, which is also known as sequential transfer optimization. Despite a variety of transfer algorithms that have been developed over the years, the research on the design of benchmark problems for evaluating such algorithms received far less attention. Oftentimes, the source and target tasks in existing test problems are manually assembled or extended from specific practical problems, limiting their ability to represent the diverse yet complex source-target similarity relationships in real-world problems. In light of this, we propose design methods to generate multiobjective sequential transfer optimization problems (MSTOPs) systematically in this work, wherein the Pareto manifolds of individual tasks and the manifold-based similarity between the tasks can be customized with ease, enabling a broad spectrum of representation of the diverse similarity relationships between the source-target Pareto manifolds of MSTOPs. Lastly, a benchmark suite with 12 test problems is developed using the proposed methods, which would serve as an arena for electing superior multiobjective sequential transfer optimization algorithms. The source code is available at https://***/XmingHsueh/MSTOP. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Learnable Prompt as Pseudo-Imputation: Rethinking the Necessity of Traditional EHR Data Imputation in Downstream Clinical Prediction

arXiv

引用

arXiv 2024年

作者： Liao, Weibin Zhu, Yinghao Zhang, Zhongji Wang, Yuhang Wang, Zixiang Chu, Xu Wang, Yasha Ma, Liantao Peking University School of Computer Science Beijing China Ministry of Education Key Laboratory of High Confidence Software Technologies Beijing China Peking University National Engineering Research Center for Software Engineering Beijing China Peking University School of Software and Microelectronics Beijing China Peking University School of Computer Science Center on Frontiers of Computing Studies Beijing China Tianjin China

Analyzing the health status of patients based on Electronic Health Records (EHR) is a fundamental research problem in medical informatics. The presence of extensive missing values in EHR makes it challenging for deep neural networks (DNNs) to directly model the patient’s health status. Existing DNNs training protocols, including Impute-then-Regress Procedure and Jointly Optimizing of Impute-n-Regress Procedure, require the additional imputation models to reconstruction missing values. However, Impute-then-Regress Procedure introduces the risk of injecting imputed, non-real data into downstream clinical prediction tasks, resulting in power loss, biased estimation, and poorly performing models, while Jointly Optimizing of Impute-n-Regress Procedure is also difficult to generalize due to the complex optimization space and demanding data requirements. Inspired by the recent advanced literature of learnable prompt in the fields of NLP and CV, in this work, we rethought the necessity of the imputation model in downstream clinical tasks, and proposed Learnable Prompt as Pseudo-Imputation (PAI) as a new training protocol to assist EHR analysis. PAI no longer introduces any imputed data but constructs a learnable prompt to model the implicit preferences of the downstream model for missing values, resulting in a significant performance improvement for all state-of-the-arts EHR analysis models on four real-world datasets across two clinical prediction tasks. Further experimental analysis indicates that PAI exhibits higher robustness in situations of data insufficiency and high missing rates. More importantly, as a plug-and-play protocol, PAI can be easily integrated into any existing or even imperceptible future EHR analysis models. The code of this work is deployed publicly available at https://***/MrBlankness/PAI to help the research community reproduce the results and assist the EHR analysis tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

Fitweet: Arduino-Based Smartwatch for Early Anticipatory Anxiety Notification System 9th

Fitweet: Arduino-Based Smartwatch for Early Anticipatory Anx...

引用

9th International Conference on Computational Science and Technology, ICCST 2022

作者： Abdulmanab, Muhammad Rahiman Nor’Azman, Nur Faidz Hazirah Meon, Hasni Razak, Chempaka Seri Abdul Ab Hamid, Siti Hafizah Department of Software Engineering Faculty of Computer Science and Information Technology Universiti Malaya Kuala Lumpur Malaysia Department of Communication Faculty of Communication Visual Art and Computing Universiti Selangor Bestari Jaya Malaysia School of Pre-University Studies Taylor’s College Lakeside Campus Subang Jaya Malaysia

ISBN: (纸本)9789811984051

As anxiety becomes increasingly prevalent among youths especially university students, early prevention via anxiety disorder profiling is crucial. Nevertheless, most screening tools to date are not automated, labour-intensive and time-consuming. Mental health detection in online social networks (OSNs) using artificial intelligence (AI) can provide means for capturing overlooked behavioural attributes, but few are centred around anxiety detection. Internet of Things (IoT)’s increasing popularity enables bio-signals monitoring to aid in mental health care. However, minimum research has been devoted to IoT-based assistive technologies for anxiety, which currently are only used by individuals already diagnosed and actively monitored. This study proposes a novel approach to anticipatory anxiety detection for Malaysian university students aged between 18 and 25 inclusive as an early notification system using AI and IoT for bilingual Malay and English tweets and vital signs analysis respectively. Our result shows that Logistic Regression with Bag-of-Words (BoW) is the overall best performing model with 81.06% accuracy. The Arduino smartwatch sensor readings from the MAX30102 pulse oximeter sensor are used to determine different body conditions using a rule-based approach. The comparison test result between the prototype and conventional measuring devices shows the prototype’s ability to accurately distinguish vital signs with a relatively low Mean Absolute Percent Error (MAPE) rate of 10.92% and 1.51% for pulse rate and temperature respectively. Together, our proof-of-concept results indicate the potential of AI and IoT in deriving new measures of anxiety, by analysing social data combined with bio-signals monitoring to alert users regarding their anxiety state. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Mahalanobis Distance-based Multi-view Optimal Transport for Multi-view Crowd Localization

arXiv

引用

arXiv 2024年

作者： Zhang, Qi Zhang, Kaiyi Chan, Antoni B. Huang, Hui Visual Computing Research Center College of Computer Science and Software Engineering Shenzhen University Shenzhen China China Department of Computer Science City University of Hong Kong Hong Kong

Multi-view crowd localization predicts the ground locations of all people in the scene. Typical methods usually estimate the crowd density maps on the ground plane first, and then obtain the crowd locations. However, the performance of existing methods is limited by the ambiguity of the density maps in crowded areas, where local peaks can be smoothed away. To mitigate the weakness of density map supervision, optimal transport-based point supervision methods have been proposed in the single-image crowd localization tasks, but have not been explored for multi-view crowd localization yet. Thus, in this paper, we propose a novel Mahalanobis distance-based multi-view optimal transport (M-MVOT) loss specifically designed for multi-view crowd localization. First, we replace the Euclidean-based transport cost with the Mahalanobis distance, which defines elliptical iso-contours in the cost function whose long-axis and short-axis directions are guided by the view ray direction. Second, the object-to-camera distance in each view is used to adjust the optimal transport cost of each location further, where the wrong predictions far away from the camera are more heavily penalized. Finally, we propose a strategy to consider all the input camera views in the model loss (M-MVOT) by computing the optimal transport cost for each ground-truth point based on its closest camera. Experiments demonstrate the advantage of the proposed method over density map-based or common Euclidean distance-based optimal transport loss on several multi-view crowd localization datasets. Project page: MVOT Project. © 2024, CC BY.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

software and data provenance as a basis for eScience workflow 17

Software and data provenance as a basis for eScience workflo...

引用

17th IEEE International Conference on eScience, eScience 2021

作者： Conquest, Joseph Stiber, Michael University of Washington Bothell Computing and Software Systems Division School of Science Technology Engineering and Mathematics BothellWA98011 United States

ISBN: (纸本)9781665403610

While tracking data and software provenance is necessary in eScience, and often implemented in scientific workflow management tools, such tools generally don't provide graphical UIs that use provenance to guide workflow. Graphitti Workbench was built to center workflow around its PROV-DM based ProVis software and data provenance visualizer, making provenance more readily accessible to scientists. Using ProVis as the system desktop highlights the importance of provenance to inform future experiments and improves provenance understandability. Our usability study indicates that this solution is highly acceptable and that it provides easy deployment of experiments using provenance-based creation. © 2021 IEEE.

关键词： e-Science

来源：评论

学校读者我要写书评

暂无评论

Towards Enhanced Verification in Process Mining: A Ctmc-Based Probabilistic Model Checking Approach

SSRN

引用

SSRN 2024年

作者： Mangi, Fawad Ali Su, Guoxin Zhang, Minjie Liu, Li School of Computing and Information Technology University of Wollongong Wollongong2522 Australia Department of Computer Systems Engineering Mehran University of Engineering and Technology Sindh Jamshoro76062 Pakistan School of Big Data and Software Engineering Chongqing University Chongqing400030 China

Process mining is a rapidly growing research field that uses data science techniques to analyse business processes and extract insights about their performance, efficiency, and compliance. The process mining approach begins with process discovery, which involves creating process models based on event logs;and depending on the type of models discovered, the correctness of models needs to be guaranteed. Verification is paramount to ensure the accuracy and reliability of discovered process models in process mining, the current research lacks to model the stochastic nature of process mining models. This paper introduces a novel technique for verification of process mining models, leveraging continuous time Markov chain (CTMC) model of probabilistic model checking technique. The proposed method aims to address the inherent uncertainties and dynamic nature of real-world processes, providing a more robust and comprehensive verification framework compared to traditional methods. The technique employs CTMC to represent the stochastic behavior of processes, allowing for the incorporation of time and probability in the analysis of process models. This approach enables the evaluation of process models under various conditions and scenarios, considering the probabilistic aspects and temporal characteristics inherent in business processes. The paper presents a detailed methodology of the proposed technique, illustrating its application through a case study of loan application process performed in a financial institution, and empirical evaluations. © 2024, The Authors. All rights reserved.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

KNN-Based Collaborative Filtering for Fine-Grained Intelligent Grad-School Recommendation System 19th

KNN-Based Collaborative Filtering for Fine-Grained Intellig...

引用

19th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2023

作者： Xu, Jinfeng Liu, Jiyi Ma, Zixiao Wang, Yuyang Wang, Wei Ngai, Edith Department of Electrical and Electronic Engineering The University of Hong Kong 999077 Hong Kong School of Software Engineering Sun Yat-Sen University Guangdong Zhuhai528406 China Department of Electrical and Computer Engineering Duke University DurhamNC27708 United States Department of Computer Science Cornell University IthacaNY14853 United States Guangdong-Hong Kong-Macao Joint Laboratory for Emotional Intelligence and Pervasive Computing Artificial Intelligence Research Institute Shenzhen MSU-BITUniversity Guangdong Shenzhen518172 China

ISBN: (纸本)9783031651250

The development of the Internet has led to information overload, and how to filter and sift information is a rigorous requirement in all fields. In response to this challenge, recommendation systems have emerged as a valuable tool, offering personalized content and services by efficiently searching and processing dynamically generated information. For students applying to grad schools, finding relevant information can be time-consuming and unreliable from official websites or forums. In light of these challenges, we present a novel solution in the form of an application recommendation platform. Our proposed platform leverages specific open-source datasets and real-time information from platform users using KNN (K-Nearest Neighbor) and CF (Collaborative Filtering) techniques to provide recommendations based on users’ individual backgrounds, we aim to reduce the complexity inherent in information retrieval while simultaneously enhancing the relevance of the recommendations delivered to users. Specifically, we first collect user behavior data, then we will construct the data model and perform some preprocessing on it. Calculate the user similarity, and find out the K-nearest neighbors and rate based on K-nearest neighbors, finally, the recommendation engine is used to calculate the highest-rated items to be recommended to the users. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering 2024.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

A Review of Metamorphic Relation Representation Forms

A Review of Metamorphic Relation Representation Forms

引用

International Conference on Dependable Systems and Their Applications (DSA)

作者： Yin Zhao Meng Li Jie Liu School of Computing University of South China Hengyang China Hunan Engineering Research Center of Software Evaluation and Testing for Intellectual Equipment Hengyang China CNNC Key Laboratory on High Trusted Computing Hengyang China

Metamorphic testing can effectively alleviate the problem of testing oracle. The lack of specification descriptions of metamorphic relations affects its generalized application. This text categorizes metamorphic relations into three types based on their representation forms: arithmetic expressions, predicate expressions, and other categories. Among the one hundred and sixty-two relations classified, arithmetic expressions account for sixty-four percent. Within geometry, numerical programs, and algorithms, the main to employ relations on arithmetic expressions, while machine learning and optimization algorithms are mainly inclined toward hiring predicate expression relations. Meanwhile, the research findings about the construction methods of metamorphic relations, the generation of original test cases, and the utilization of testing tools have been systematically organized to guide the application of the above techniques based on representation forms. Moreover, it lays the foundation for studying the fundamental nature of relationships, such as complexity, similarity, and relation composite.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：