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

Monte Carlo Simulation-Based Robust Workflow Scheduling for Spot Instances in Cloud Environments

Tsinghua science and Technology 2024年第1期29卷 112-126页

作者： Quanwang Wu Jianzhao Fang Jie Zeng Junhao Wen Fengji Luo College of Computer Science Chongqing UniversityChongqing 400044China National Experimental Teaching Demonstration Center Chongqing UniversityChongqing 400044China College of Big Data and Software Engineering Chongqing UniversityChongqing 400044China School of Civil Engineering The University of SydneySydney 2006Australia

When deploying workflows in cloud environments,the use of Spot Instances(SIs)is intriguing as they are much cheaper than on-demand ***,Sls are volatile and may be revoked at any time,which results in a more challenging scheduling problem involving execution interruption and hence hinders the successful handling of conventional cloud workflow scheduling *** some scheduling methods for Sls have been proposed,most of them are no more applicable to the latest Sls,as they have evolved by eliminating bidding and simplifying the pricing *** study focuses on how to minimize the execution cost with a deadline constraint when deploying a workflow on volatile Sls in cloud *** on Monte Carlo simulation and list scheduling,a stochastic scheduling method called MCLS is devised to optimize a utility function introduced for this *** the Monte Carlo simulation framework,MCLS employs sampled task execution time to build solutions via deadline distribution and list scheduling,and then returns the most robust solution from all the candidates with a specific evaluation mechanism and selection *** results show that the performance of MCLS is more competitive comparedwithtraditionalalgorithms.

关键词： constrained optimization Monte Carlo simulation robustness Spot Instances(Sls) workflow scheduling

来源：评论

学校读者我要写书评

暂无评论

TransRec++:Translation-based sequential recommendation with heterogeneous feedback

引用

Frontiers of Computer science 2022年第2期16卷 190-192页

作者： Zhuo-Xin ZHAN Ming-Kai HE Wei-Ke PAN Zhong MING National Engineering Laboratory for Big Data System Computing Technology Shenzhen UniversityShenzhen 518060China College of Computer Science and Software Engineering Shenzhen UniversityShenzhen 518060China

1 Introduction Nowadays,recommender systems are widely used because of the information overload problem on the *** are a variety of feedback in recommender systems,such as explicit feedback,implicit feedback,sequential feedback,*** them,modeling of heterogeneous sequential feedback,which contains not only different types of feedback such as examinations and purchases but also the sequential information,is an emerging and important problem receiving more and more *** sequential feedback is relatively easy to be collected in a deployed system and is also able to provide more information than the homogeneous feedback,which is thus expected to be helpful in improving the recommendation accuracy.

关键词： feedback recommendation sequential

来源：评论

学校读者我要写书评

暂无评论

Personality Enhanced Emotion Generation Modeling for Dialogue Systems

引用

COGNITIVE COMPUTATION 2024年第1期16卷 293-304页

作者： Liu, Zhiqiang Jia, Wenchao Zhou, Yutong Xu, Biqi Liu, Zhiqiang Wu, Zhuoyi College of Data Science and Application Inner Mongolia University of Technology Hohhot 010080 Inner Mongolia China Inner Mongolia Autonomous Region Engineering & Technology Research Centre of Big Data Based Software Service Hohhot 010080 Inner Mongolia China

Emotion plays a crucial role in human communication, as it adds depth and richness to conversations. In recent years, there has been growing interest in developing conversation systems with the ability to generate emotions. However, to create more engaging and realistic interactions, it is essential to consider the influence of personality on emotion generation. This paper proposes a novel approach that combines personality modeling with emotion generation for conversation systems. By incorporating personality traits into the emotion generation process, we aim to create more personalized and contextually appropriate emotional responses. Drawing from BigFive model and emotion computation techniques, our model takes into account individual differences in personality to generate emotions that align with each user's unique characteristics. Experiments show that combining emotion modeling with personality in a dialogue system helps improve the performance of emotion generation models. Additionally, it is also verified that our approach outperforms other baselines on several metrics.

关键词： Dialogue system Emotion generation Personality Anthropomorphism

来源：评论

学校读者我要写书评

暂无评论

Semantics Analytics of Origin-Destination Flows from Crowd Sensed Big data

引用

Computers, Materials & Continua 2019年第7期61卷 227-241页

作者： Ning Cao Shengfang Li Keyong Shen Sheng Bin Gengxin Sun Dongjie Zhu Xiuli Han Guangsheng Cao Abraham Campbell College of Computer Information and Engineering Nanchang Institute of TechnologyNanchangChina College of Information Engineering Sanming UniversitySanmingChina School of Data Science and Software Engineering Qingdao UniversityQingdaoChina School of Computer Science and Technology Harbin Institute of TechnologyWeihaiChina Public Teaching Department Qingdao Technical CollegeQingdaoChina School of Computer Science University College DublinDublinIreland

Monitoring,understanding and predicting Origin-destination(OD)flows in a city is an important problem for city planning and human ***-GPS traces,acted as one kind of typical crowd sensed data,it can be used to mine the semantics of OD *** this paper,we firstly construct and analyze a complex network of OD flows based on large-scale GPS taxi traces of a city in *** spatiotemporal analysis for the OD flows complex network showed that there were distinctive patterns in OD *** based on a novel complex network model,a semantics mining method of OD flows is proposed through compounding Points of Interests(POI)network and public transport network to the OD flows *** propose method would offer a novel way to predict the location characteristic and future traffic conditions accurately.

关键词： Origin-destination(OD)flows semantics analytics complex network big data analysis

来源：评论

学校读者我要写书评

暂无评论

Dual-Enhanced High-Order Self-Learning Tensor Singular Value Decomposition for Robust Principal Component Analysis

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第7期5卷 3564-3578页

作者： Xu, Honghui Fang, Chuangjie Wang, Renfang Chen, Shengyong Zheng, Jianwei Zhejiang University of Technology College of Computer Science and Technology Hangzhou310023 China Zhejiang Wanli University College of Big Data and Software Engineering Ningbo315200 China Tianjin University of Technology College of Computer Sciences and Engineering Tianjin300384 China

Recently, tensor singular value decomposition (TSVD) within high-order (Ho) algebra framework has shed new light on tensor robust principal component analysis (TRPCA) problem. However, HoTSVD lacks flexibility in handling the hidden correlations along different modes of large-scale multidimensional data. Moreover, the utilization of fixed or data-independent transformations in HoTSVD may result in suboptimality. For a relief, we propose a dual-enhanced self-learning TSVD along all modes to address computational flaws and learn a lossless transformation that induces a lower average-rank tensor. Specifically, we multiply the learnable semiorthogonal matrices obtained through Tucker compression with the original tensor along all modes, thus obtaining a core tensor with more inherent low rankness. Building upon this foundation, a new TNN is introduced by generalizing HoTSVD to Mode-k TSVD, followed by the facilitation to the core tensor, achieving dual-enhancement. Moreover, a reweighting scheme is imposed on the Mode-k HoTSVD to learn the global low-rank correlation and provide an efficient numerical solution. Finally, an alternating direction method of multipliers (ADMM)-based algorithm is developed as a solver. Experimental results on several types of multidimensional visual data, including light field images (LFI) and color videos, demonstrate the superiority of the proposal over previous state-of-the-art methods. © 2020 IEEE.

关键词： Discrete Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Stability Analysis of An e-SEIR System in Network Society

Stability Analysis of An e-SEIR System in Network Society

引用

2018 International Conference on Security, Pattern Analysis, and Cybernetics, SPAC 2018

作者： Ge, Shao-Ting Liu, Zhimin Kang, Lijuan Yuan, Zhenxiang Yao, Guanan Lin, Ruoxuan Qingdao University College of Data Science and Software Engineering Qingdao China Qingdao Technical College School of Information Qingdao China

ISBN: (纸本)9781728105512

We analyzed the a discrete-time e-SEIR system, which represents the computer virus propagation model in network society. Firstly, we derive two kinds of equilibriums for the model. Secondly, we obtain sufficient stability condition for the no-disease equilibrium using the first Lyapunov stability method. Lastly, we obtain stability conditions for the disease equilibrium using disc theory. © 2018 IEEE.

关键词： Digital control systems

来源：评论

学校读者我要写书评

暂无评论

Group Signature with Time-Bound Keys for Secure E-health Record Sharing

Group Signature with Time-Bound Keys for Secure E-health Rec...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Lu, Junze Hu, Chunqiang Ruan, Conghao Cai, Bin Xiang, Tao Chongqing University School of Big Data & Software Engineering China Chongqing University College of Computer Science China

ISBN: (纸本)9798350386226

With the advent of various mobile IoT devices, a large amount of e-health record (EHR) data has been generated. This data has great potential to improve medical research. However, there are many challenges regarding the sharing of medical data. Firstly, users are more inclined to interact anonymously. Secondly, verifying the validity of certificates in the case of anonymous interactions is challenging. In addition, it is necessary to uncover the identities of the actual interacting parties in the event of malicious behavior. Therefore, we address the above challenges and propose group signatures with time constraints to support anonymous and traceable EHR data sharing. First, we propose a group signature scheme that supports traceability. Second, to address the issue of validating anonymous certificates, we propose group signatures with time constraints that enable dynamic updates to validity. Through this, we can dynamically revoke group members. Lastly, security proofs and efficiency analyses demonstrate that our scheme is both secure and efficient. © 2024 IEEE.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

DeePMD-kit v3: A Multiple-Backend Framework for Machine Learning Potentials

arXiv

引用

arXiv 2025年

作者： Zeng, Jinzhe Zhang, Duo Peng, Anyang Zhang, Xiangyu He, Sensen Wang, Yan Liu, Xinzijian Bi, Hangrui Li, Yifan Cai, Chun Zhang, Chengqian Du, Yiming Zhu, Jia-Xin Mo, Pinghui Huang, Zhengtao Zeng, Qiyu Shi, Shaochen Qin, Xuejian Yu, Zhaoxi Luo, Chenxing Ding, Ye Liu, Yun-Pei Shi, Ruosong Wang, Zhenyu Bore, Sigbjørn Løland Chang, Junhan Deng, Zhe Ding, Zhaohan Han, Siyuan Jiang, Wanrun Ke, Guolin Liu, Zhaoqing Lu, Denghui Muraoka, Koki Oliaei, Hananeh Singh, Anurag Kumar Que, Haohui Xu, Weihong Xu, Zhangmancang Zhuang, Yong-Bin Dai, Jiayu Giese, Timothy J. Jia, Weile Xu, Ben York, Darrin M. Zhang, Linfeng Wang, Han School of Artificial Intelligence and Data Science Unversity of Science and Technology of China Hefei China AI for Science Institute Beijing100080 China DP Technology Beijing100080 China Academy for Advanced Interdisciplinary Studies Peking University Beijing100871 China State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences Beijing100871 China University of Chinese Academy of Sciences Beijing China Baidu Inc. Beijing China Department of Computer Science University of Toronto TorontoON Canada Department of Chemistry Princeton University PrincetonNJ08540 United States University of Chinese Academy of Sciences Beijing100871 China State Key Laboratory of Physical Chemistry of Solid Surfaces iChEM College of Chemistry and Chemical Engineering Xiamen University Xiamen361005 China College of Integrated Circuits Hunan University Changsha410082 China State Key Laboratory of Advanced Technology for Materials Synthesis and Processing Center for Smart Materials and Device Integration School of Material Science and Engineering Wuhan University of Technology Wuhan430070 China College of Science National University of Defense Technology Changsha410073 China Hunan Key Laboratory of Extreme Matter and Applications National University of Defense Technology Changsha410073 China ByteDance Research Beijing100098 China Ningbo Institute of Materials Technology and Engineering Chinese Academy of Sciences Ningbo315201 China College of Materials Science and Opto-Electronic Technology University of Chinese Academy of Sciences Beijing100049 China Key Laboratory of Theoretical and Computational Photochemistry of Ministry of Education College of Chemistry Beijing Normal University Beijing100875 China Department of Geosciences Princeton University PrincetonNJ08544 United States Department of Applied Physics and Applied Mathematics Columbia University New YorkNY10027 United States IKKEM Fujian Xiamen361005 China Graduate

In recent years, machine learning potentials (MLPs) have become indispensable tools in physics, chemistry, and materials science, driving the development of software packages for molecular dynamics (MD) simulations and related applications. These packages, typically built on specific machine learning frameworks such as TensorFlow, PyTorch, or JAX, face integration challenges when advanced applications demand communication across different frameworks. The previous TensorFlow-based implementation of DeePMD-kit exemplified these limitations. In this work, we introduce DeePMD-kit version 3, a significant update featuring a multi-backend framework that supports TensorFlow, PyTorch, JAX, and PaddlePaddle backends, and demonstrate the versatility of this architecture through the integration of other MLPs packages and of Differentiable Molecular Force Field. This architecture allows seamless backend switching with minimal modifications, enabling users and developers to integrate DeePMD-kit with other packages using different machine learning frameworks. This innovation facilitates the development of more complex and interoperable workflows, paving the way for broader applications of MLPs in scientific research. Copyright © 2025, The Authors. All rights reserved.

关键词： Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

Cancer classification with data augmentation based on generative adversarial networks

引用

Frontiers of Computer science 2022年第2期16卷 69-79页

作者： Kaimin WEI Tianqi LI Feiran HUANG Jinpeng CHEN Zefan HE College of Information Science and Technology Jinan UniversityGuangzhou 510632China Guangdong Key Laboratory of Data Security and Privacy Protection Guangzhou 510632China School of Software Engineering Beijing University of Posts and TelecommunicationsBeijing 100876China

Accurate diagnosis is a significant step in cancer *** learning can support doctors in prognosis decision-making,and its performance is always weakened by the high dimension and small quantity of genetic ***,deep learning can effectively process the high dimensional data with ***,the problem of inadequate data remains unsolved and has lowered the performance of deep *** end it,we propose a generative adversarial model that uses non target cancer data to help target generator *** use the reconstruction loss to further stabilize model training and improve the quality of generated *** also present a cancer classification model to optimize classification *** results prove that mean absolute error of cancer gene made by our model is 19.3%lower than DC-GAN,and the classification accuracy rate of our produced data is higher than the data created by *** for the classification model,the classification accuracy of our model reaches 92.6%,which is 7.6%higher than the model without any generated data.

关键词： data mining cancer data analysis deep learning generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

NERank+: a graph-based approach for entity ranking in document collections

引用

计算机科学前沿 2018年第3期12卷 504-517页

作者： Chengyu WANG Guomin ZHOU Xiaofeng HE Aoying ZHOU Shanghai Key Laboratory of Trustworthy Computing School of Computer Science and Software EngineeringEast China Normal University Shanghai 200062 China Department of Computer and Information Technology Zhejiang Police College Hangzhou 310053 China School of Data Science and Engineering East China Normal University Shanghai 200062 China

Most entity ranking research aims to retrieve a ranked list of entities from a Web corpus given a user *** rank order of entities is determined by the relevance between the query and contexts of ***,entities can be ranked directly based on their relative importance in a document collection,independent of any *** this paper,we introduce an entity ranking algorithm named NERank+.Given a document collection,NERank+ first constructs a graph model called Topical Tripartite Graph,consisting of document,topic and entity *** design separate ranking functions to compute the prior ranks of entities and topics,respectively.A meta-path constrained random walk algorithm is proposed to propagate prior entity and topic ranks based on the graph *** evaluate NERank+ over real-life datasets and compare it with *** results illustrate the effectiveness of our approach.

关键词： entity ranking Topical Tripartite Graph prior rank estimation meta-path constrained random walk

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：