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

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Zhang, Yuanpeng Qian, Yurong Xiao, Xiaojun Hu, Xiaowen Huang, Zhijian Deng, Lei Xinjiang University School of Software Urumqi China Central South University School of Computer Science and Engineering Changsha China

ISBN: (纸本)9798350337488

tRNAs play a pivotal role in protein synthesis by transporting amino acids to the ribosome according to mRNA instructions. These molecules are essential regulators in various biological processes, and their dysregulation is closely linked to human diseases. Predicting associations between tRNAs and diseases is valuable for uncovering biomarkers that aid in disease prevention, detection, prognosis, diagnosis, and treatment. However, experimental validation of such associations is resource-intensive, necessitating the development of robust computational methods. In this study, we propose PTDA-SWGCL, a novel model for predicting potential tRNA-disease associations. PTDA-SWGCL integrates tRNA and disease similarity information derived from Gaussian kernel similarity, sequence similarity, and semantic similarity. It initializes tRNA and disease embeddings using this similarity information and refines them through supplementarily weight and graph comparison learning training on the tRNA-disease association graph. The final association pair prediction is obtained by the inner product of the tRNA and disease embeddings. Experimental results demonstrate that PTDA-SWGCL outperforms state-of-the-art methods. Case studies confirm its effectiveness in predicting tRNA-disease associations. The code and data are available at https://***/ZYPssss/PTDA-SWGCL. © 2023 IEEE.

关键词： graph contrastive learning similarity supplementary weighting tRNA-disease association

来源：评论

学校读者我要写书评

暂无评论

CSP-RM: Reputation Management Decision Support for Crowdsourcing Service Providers

CSP-RM: Reputation Management Decision Support for Crowdsour...

引用

2023 IEEE International Conference on Web Services, ICWS 2023

作者： Wang, Shipeng Li, Qingzhong Cui, Lizhen Jiang, Yali Shen, Zhiqi Yu, Han Shandong University School of Software Jinan China China Nanyang Technological University School of Computer Science and Engineering Singapore

ISBN: (纸本)9798350304855

The increasing popularity of crowdsourcing has resulted in the emergence of multiple crowdsourcing service providers (CSPs), such as Mechnical Turk and Crowdflower, which compete to attract crowd workers (CWs). CWs can share their experience working for various CSPs, which forms the basis of CSP reputation score. This information can be used for trust building and facilitating future CWs' decisions on which CSP to work for. Existing reputation management research in crowdsourcing has mainly focused on controlling task quality and improving revenue from the perspective of CSPs. Little attention has been paid to helping CSPs manage their reputation to attract and retain CWs. In this paper, we propose the Crowdsourcing Service Provider Reputation Management (CSP-RM) framework to bridge this important gap. Based on the current reputation of CSPs, it dynamically balances the trade-off between the reputation maintenance cost and the long-term profit for a given CSP. It performs dynamic commission allocation for a CSP based on Lyapunov optimization to guide the recruitment of CWs, while considering the revenue and the changes in the number of CWs. Extensive experiments based on highly competitive crowdsourcing market demonstrate that CSP-RM makes the most advantageous cost-benefit trade-off compared to existing approaches, outperforming the best baseline by 23.83%, 39.21% and 3.36% in terms of average cumulative revenue, average number of CWs and public reputation, respectively. To the best of our knowledge, it is the first decision support framework for enabling CSPs to recruit more CWs in a highly competitive market, while maintaining their reputation and ensuring long-term benefit. © 2023 IEEE.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Fast Super-Resolution Network via Dynamic Path Selection 2

Fast Super-Resolution Network via Dynamic Path Selection

引用

2nd International Conference on Image Processing, computer Vision and Machine Learning, ICICML 2023

作者： Jia, Longfei Hu, Yuguo Tian, Xianlong Luo, Wenwei University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu China University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu China

ISBN: (纸本)9798350331417

In the context of edge computing environments, where the storage space and computational resources are constrained, complex super-resolution network models face significant challenges during inference. In this paper, we propose a Fast Super-Resolution Network (FSRN) based on the dynamic path selection mechanism. This method employs a policy network to boost the inference process of super-resolution network models, enabling efficient super-resolution tasks under resource limitations. The primary function of the policy network is to intelligently select appropriate inference paths based on input data and available computational resources. Its key objective is to minimize the degradation in super-resolution quality while reducing the computational burden as much as possible. In view of this objective, we designed a reward function to guide the policy network in discovering the optimal strategies. With the guidance of the policy network, we successfully enhanced the inference speed of super-resolution network models on edge devices while efficiently reducing computational overhead. Extensive experiments verify that the proposed method can significantly reduce the inference time at the cost of slight or even no performance degradation. © 2023 IEEE.

关键词： accelerate reasoning edge computing resource constrained Super-resolution

来源：评论

学校读者我要写书评

暂无评论

Adaptive IoT Decision Making in Uncertain Environments 7

Adaptive IoT Decision Making in Uncertain Environments

引用

7th IEEE International Conference on Smart Internet of Things, SmartIoT 2023

作者： Wang, Yan Zheng, Liwei He, Jingjing Cui, Zhanqi Computer School Software Engineering Research Center Beijing Information Science and Technology University Beijing China

ISBN: (纸本)9798350316575

The rapid growth of the Internet of Things (IoT) has led to widespread deployment of IoT systems in domains such as smart homes, healthcare, and transportation. However, IoT systems often operate under uncertainty, making it difficult to predict and control their behavior. In this paper, we propose an adaptive decision making approach for IoT systems in uncertain, dynamic environments. We present a framework with perception, decision and execution layers to handle uncertainty in IoT systems. The perception layer senses the environment and system state. The decision layer employs an optimized deep Q-network algorithm (Ad-DQN) specifically designed to handle uncertain environments, enabling it to make informed decisions based on learned experiences. The execution layer implements the actions. We demonstrate the framework on an intelligent air conditioning system as a case study of an IoT system operating under uncertainty. The Ad-DQN based decision layer adapts the air conditioning control policy to maximize comfort while minimizing energy usage. Experiments show our method outperforms traditional DQN method in uncertain environments. © 2023 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

AI-Driven Virtual Mock Interview Development 13

AI-Driven Virtual Mock Interview Development

引用

Joint 13th International Conference on Soft Computing and Intelligent Systems and 25th International Symposium on Advanced Intelligent Systems, SCIS and ISIS 2024

作者： Mishra, Prabhat Kumar Arulappan, Arun Kumar Ra, In-Ho Thanga Mariappan, L. Gina Rose, G. Lee, Young-Seok School of Computer Science Engineering and Information Systems Vit University Vellore India School of Computer and Software Kunsan National University Gunsan Korea Republic of Anna University Department of Computer Technology Chennai India

ISBN: (纸本)9798350373332

The integration of Artificial Intelligence (AI) into educational technologies marks a significant shift in learning methodologies and operational dynamics within educational institutions. At the forefront is an AI-driven virtual mock interview platform designed to address the high Customer Acquisition Costs (CAC) in the edtech sector, especially for interview preparation services. This initiative harnesses a blend of AI technologies, including ADA 2 for creating context-aware embeddings and Machine Learning (ML), to transform the traditional mock interview process into a dynamic, cost-effective system. Central to the platform is its use of advanced Natural Language Processing (NLP) techniques and GPT-4 Large Language Model (LLM), automating the process of mock interviews and providing personalized feedback, ensuring a preparation journey that meets specific candidate needs and mirrors real interview scenarios. A key evaluation among 100 students from a cohort of 1800 demonstrated a 90% cost reduction for three mock interviews, reducing expenses from 3000 to just 300 per candidate. This cost efficiency significantly enhances access to quality interview preparation, improving student satisfaction and accessibility. Moreover, the platform provides valuable insights into student performance, setting a new standard in educational technology by offering an effective, personalized interview preparation experience. This project reflects a holistic approach to student development and the critical role of technology in addressing the evolving needs of learners. © 2024 IEEE.

关键词： Cost reduction

来源：评论

学校读者我要写书评

暂无评论

A Scheme Library-Based Ant Colony Optimization with 2-Opt Local Search for Dynamic Traveling Salesman Problem

引用

computer Modeling in engineering & sciences 2023年第5期135卷 1209-1228页

作者： Chuan Wang Ruoyu Zhu Yi Jiang Weili Liu Sang-Woon Jeon Lin Sun Hua Wang College of Software Henan Normal UniversityXinxiang453007China College of Computer and Information Engineering Henan Normal UniversityXinxiang453007China School of Computer Science and Engineering South China University of TechnologyGuangzhou510006China School of Computer Science Guangdong Polytechnic Normal UniversityGuangzhou510665China Department of Military Information Engineering Hanyang UniversityAnsan15588South Korea College of Engineering and Science Institute for Sustainable Industries and Liveable CitiesVictoria UniversityMelbourneVIC 8001Australia

The dynamic traveling salesman problem(DTSP)is significant in logistics distribution in real-world applications in smart cities,but it is uncertain and difficult to *** paper proposes a scheme library-based ant colony optimization(ACO)with a two-optimization(2-opt)strategy to solve the DTSP *** work is novel and contributes to three aspects:problemmodel,optimization framework,and ***,in the problem model,traditional DTSP models often consider the change of travel distance between two nodes over time,while this paper focuses on a special DTSP model in that the node locations change dynamically over ***,in the optimization framework,the ACO algorithm is carried out in an offline optimization and online application framework to efficiently reuse the historical information to help fast respond to the dynamic *** framework of offline optimization and online application is proposed due to the fact that the environmental change inDTSPis caused by the change of node location,and therefore the newenvironment is somehowsimilar to certain previous *** way,in the offline optimization,the solutions for possible environmental changes are optimized in advance,and are stored in a mode scheme *** the online application,when an environmental change is detected,the candidate solutions stored in the mode scheme library are reused via ACO to improve search efficiency and reduce computational ***,in the algorithm design,the ACO cooperates with the 2-opt strategy to enhance search *** evaluate the performance of ACO with 2-opt,we design two challenging DTSP cases with up to 200 and 1379 nodes and compare them with other ACO and genetic *** experimental results show that ACO with 2-opt can solve the DTSPs effectively.

关键词： Dynamic traveling salesman problem(DTSP) offline optimization and online application ant colony optimization(ACO) two-optimization(2-opt)strategy

来源：评论

学校读者我要写书评

暂无评论

3D Atrous Spatial Pyramid Pooling based Multi-Scale Feature Fusion Network for Hyperspectral Image Classification

3D Atrous Spatial Pyramid Pooling based Multi-Scale Feature ...

引用

2023 International Conference on Remote Sensing, Mapping, and Geographic Systems, RSMG 2023

作者： Zhu, Tianxing Liu, Qin Zhang, Lixiang School of Software Engineering Tongji University Shanghai China School of Computer Science Northwestern Polytechnical University Xi’an China

ISBN: (纸本)9781510668898

The convolutional neural network (CNN) has been widely adopted in the processing of hyperspectral images (HSI) due to its remarkable capabilities in feature extraction. However, CNN-based methods for HSI classification still face the challenge of extracting spectral-spatial features that are more effective while considering all spectral bands. This paper reviews various spectral and spectral-spatial classifiers that have been developed to overcome the challenges of HSI classification, including the limitations of handcrafted features and the problems caused by spectral variability and nonlinearity. The paper proposes a novel method, the 3D ASPP Multi-Scale Feature Fusion Network (3A-MFFN), which simultaneously preserves high-resolution spatial detail information and high-level semantic information of HSI. The proposed network extracts and fuses multi-scale features for HSI classification using a multi-scale 3D ASPP convolution block to fuse different levels of feature output. The paper presents experiments and analysis to demonstrate the effectiveness of the proposed method. The results suggest that the 3A-MFFN algorithm can significantly enhance the classification accuracy of HSI with limited samples, making it a valuable contribution to the hyperspectral remote sensing community. © 2023 SPIE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Sensitive Information Protection Model Based on Bayesian Game

引用

computers, Materials & Continua 2022年第10期73卷 883-898页

作者： Yuzhen Liu Zhe Liu Xiaoliang Wang Qing Yang Guocai Zuo Frank Jiang School of Computer Science and Engineering Hunan University of Science and TechnologyXiangtan411201China Hunan Key Laboratory for Service computing and Novel Software Technology Xiangtan411201China College of computer and information engineering Hunan University of Technology and BusinessChangshaChina School of Computer Science and Information Engineering Guangzhou Maritime UniversityGuangzhouChina Hunan Software Vocational and Technical University XiangtanChina School of Engineering and IT University of New South WalesNSWAustralia

A game measurement model considering the attacker’s knowledge background is proposed based on the Bayesian game theory aiming at striking a balance between the protection of sensitive information and the quality of *** quantified the sensitive level of information according to the user’s personalized sensitive information protection *** on the probability distribution of sensitive level and attacker’s knowledge background type,the strategy combination of service provider and attacker was analyzed,and a game-based sensitive information protection model was *** the combination of strategies under Bayesian equilibrium,the information entropy was used to measure the leakage of sensitive ***,in the paper the influence of the sensitive level of information and the attacker’s knowledge background on the strategy of both sides of the game was considered *** on,the leakage of the user’s sensitive information was ***,the feasibility of the model was described by experiments.

关键词： Sensitive information game theory Bayesian equilibrium sensitive level information entropy

来源：评论

学校读者我要写书评

暂无评论

Research to Practice of Blended Learning in computer Programming Course 53

Research to Practice of Blended Learning in Computer Program...

引用

53rd IEEE ASEE Frontiers in Education International Conference, FIE 2023

作者： Zhang, Liang Chen, Tianyi Zong, Yue Zhang, Lijun School of Computer Science and Engineering Beihang University Beijing China School of Aeronautic Science and Engineering Beihang University Beijing China School of Software Beihang University Beijing China

ISBN: (纸本)9798350336429

This research to practice WIP paper presented a Blended Learning (BL) approach to teaching Data Structures and Programming in Python (DSPP) course. This approach increased students' learning engagement, academic performance, and course satisfaction. There is an intense need to study the BL approach in higher education, especially during the COVID-19 epidemic. Although BL pedagogy has achieved great success in college, there needs to be more quantitative research and practice in the computer programming course. This paper takes the DSPP course as an example to introduce the BL approach in detail. First, we designed the BL process for the computer programming course, which includes specific pre-class, in-class, and after-class activities. Second, we divide a course's knowledge and BL activities into remember, understand, apply, analyze, evaluate, and create levels according to Bloom's Taxonomy. So the knowledge and activities can be corresponding according to the cognitive level. We take a chapter in the DSPP course as an example to introduce it in detail. Third, to support the efficient implementation of BL activities, we have designed and developed several online learning systems, including an Online Judge system (OJ), Question&Anwser website (Q&A), and Peer Review Studio (PRS). To assess the effectiveness of the BL approach, we conducted the study at the DSPP course for undergraduate students in 2021 and 2023. In 2021, we taught the DSPP course in traditional pedagogy. In 2023, we began to implement BL pedagogy. By analyzing students' learning data, we compared the effect of the two pedagogy. We use the nonparametric independent-samples Kruskal-Wallis test to measure the changes in learning engagement, course performance, and student satisfaction. The results show that they were significantly improved in 2022. The course questionnaire of 2022 shows that most students prefer the BL approach. © 2023 IEEE.

关键词： Active Learning Blended Learning Bloom's Taxonomy computer programming Online Learning System

来源：评论

学校读者我要写书评

暂无评论

A quantum federated learning framework for classical clients

引用

science China(Physics,Mechanics & Astronomy) 2024年第5期67卷 1-10页

作者： Yanqi Song Yusen Wu Shengyao Wu Dandan Li Qiaoyan Wen Sujuan Qin Fei Gao State Key Laboratory of Networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing 00876China Department of Physics The University of Western AustraliaPerthWA 6009Australia School of Computer Science(National Pilot Software Engineering School) Beijing University of Posts and TelecommunicationsBeijing100876China

Quantum federated learning(QFL)enables collaborative training of a quantum machine learning(QML)model among multiple clients possessing quantum computing capabilities,without the need to share their respective local ***,the limited availability of quantum computing resources poses a challenge for each client to acquire quantum computing *** raises a natural question:Can quantum computing capabilities be deployed on the server instead?In this paper,we propose a QFL framework specifically designed for classical clients,referred to as CC-QFL,in response to this *** each iteration,the collaborative training of the QML model is assisted by the shadow tomography technique,eliminating the need for quantum computing capabilities of ***,the server constructs a classical representation of the QML model and transmits it to the *** clients encode their local data onto observables and use this classical representation to calculate local *** local gradients are then utilized to update the parameters of the QML *** evaluate the effectiveness of our framework through extensive numerical simulations using handwritten digit images from the MNIST *** framework provides valuable insights into QFL,particularly in scenarios where quantum computing resources are scarce.

关键词： client server quantum

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：