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

IEEE International Conference on Services computing (SCC)

作者： Yi Pan Xiaoning Sun Yunni Xia Wanbo Zheng Xin Luo College of Computer Science Chongqing University Chongqing China Data Science Research Center Faculty of Science Kunming University of Science and Technology Kunming China Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China Hengrui (Chongqing) Artificial Intelligence Research Center Cloudwalk China

ISBN: (数字)9781728187891

ISBN: (纸本)9781728187907

The cloud computing paradigm is featured by its ability to offer elastic computational resource provisioning patterns and deliver on-demand and versatile services. It's thus getting increasingly popular to build business process and workflow-based applications upon cloud computing platforms. However, it remains a difficulty to guarantee cost-effectiveness and quality of service of cloud-based workflows because real-world cloud services are usually subject to real-time performance variations or fluctuations. Existing researches mainly consider that cloud are with constant performance and formulate the scheduling decision-making as a static optimization problem. In this work, instead, we consider that scientific computing processes to be supported by decentralized cloud infrastructures are with fluctuating QoS and aim at managing the monetary cost of workflows with the completion-time constraint to be satisfied. We address the performance-trend-aware workflow scheduling problem by leveraging a time-series-based prediction model and a Critical-Path-Duration-Estimation-based (CPDE for short) scheduling strategy. The proposed method is capable of exploiting real-time trends of performance changes of cloud infrastructures and generating dynamic workflow scheduling plans. To prove the effectiveness of our proposed method, we build a large-prime-number-generation workflow supported by real-world third-party commercial clouds and show that our method clearly beats existing approaches in terms of cost, workflow completion time, and Service-Level-Agreement (SLA) violation rate.

关键词： Cloud computing Processor scheduling Computational modeling Quality of service Predictive models Dynamic scheduling Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Investigating 16 Open Clusters in the Kepler/K2 - Gaia DR3 field. I. Membership, Binary, and Rotation

arXiv

引用

arXiv 2023年

作者： Long, Liu Bi, Shaolan Zhang, Jinghua Zhang, Xianfei Zhang, Liyun Ge, Zhishuai Li, Tanda Chen, Xunzhou Li, YaGuang Ye, LiFei Sun, TianCheng Zhou, JianZhao Institute for Frontiers in Astronomy and Astrophysics Beijing Normal University Beijing102206 China Department of Astronomy Beijing Normal University Beijing100875 China South-Western Institute for Astronomy Research Yunnan University Chenggong District Kunming650500 China College of Physics Guizhou University Guiyang550025 China State Key Laboratory of Public Big Data Guizhou University Guiyang550025 China Beijing Planetarium Beijing Academy of Science and Technology Beijing100044 China Research Center for Intelligent Computing Platforms Zhejiang Laboratory Hangzhou311100 China School of Physics University of Sydney NSW2006 Australia Stellar Astrophysics Centre Department of Physics and Astronomy Aarhus University Ny Munkegade 120 Aarhus CDK-8000 Denmark

Using data from the Gaia data Release 3 (Gaia DR3) and Kepler/K2, we present a catalog of 16 open clusters with ages ranging from 4 to 4000 Myr, which provides detailed information on membership, binary systems, and rotation. We assess the memberships in 5D phase space, and estimate the basic parameters of each cluster. Among the 20,160 members, there are 4,381 stars identified as binary candidates and 49 stars as blue straggler stars. The fraction of binaries vary in each cluster, and the range between 9% to 44%. We obtain the rotation periods of 5,467 members, of which 4,304 are determined in this work. To establish a benchmark for the rotation-age-color relation, we construct color-period diagrams. We find that the rotational features of binaries are similar to that of single stars, while features for binaries are more scattered in the rotation period. Moreover, the morphology of the color-period relationship is already established for Upper Scorpius at the age of 19 Myr, and some stars of varying spectral types (i.e. FG-, K-, and M-type) show different spin-down rates after the age of ∼ 110 Myr. By incorporating the effects of stalled spin-down into our analysis, we develop an empirical rotation-age-color relation, which is valid with ages between 700 - 4000 Myr and colors corresponding to a range of 0.5 BP − GRP)0 Copyright © 2023, The Authors. All rights reserved.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Learning with Group Noise

arXiv

引用

arXiv 2021年

作者： Wang, Qizhou Yao, Jiangchao Gong, Chen Liu, Tongliang Gong, Mingming Yang, Hongxia Han, Bo Department of Computer Science Hong Kong Baptist University Hong Kong Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of MoE School of Computer Science and Engineering Nanjing University of Science and Technology China Data Analytics and Intelligence Lab Alibaba Group China Department of Computing Hong Kong Polytechnic University Hong Kong Trustworthy Machine Learning Lab School of Computer Science University of Sydney Australia School of Mathematics and Statistics University of Melbourne Australia

Machine learning in the context of noise is a challenging but practical setting to plenty of real-world applications. Most of the previous approaches in this area focus on the pairwise relation (casual or correlational relationship) with noise, such as learning with noisy labels. However, the group noise, which is parasitic on the coarse-grained accurate relation with the fine-grained uncertainty, is also universal and has not been well investigated. The challenge under this setting is how to discover true pairwise connections concealed by the group relation with its fine-grained noise. To overcome this issue, we propose a novel Max-Matching method for learning with group noise. Specifically, it utilizes a matching mechanism to evaluate the relation confidence of each object (cf. Figure 1) w.r.t. the target, meanwhile considering the Non-IID characteristics among objects in the group. Only the most confident object is considered to learn the model, so that the fine-grained noise is mostly dropped. The performance on a range of real-world datasets in the area of several learning paradigms demonstrates the effectiveness of Max-Matching. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Anomaly detection on attributed networks via contrastive self-supervised learning

arXiv

引用

arXiv 2021年

作者： Liu, Yixin Li, Zhao Pan, Shirui Gong, Chen Zhou, Chuan Karypis, George The Department of Data Science and AI Faculty of Information Technology Monash University ClaytonVIC3800 Australia The Alibaba Group Hangzhou310000 China The PCA Laboratory Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China The Department of Computing The Hong Kong Polytechnic University Hong Kong The Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100093 China The Department of Computer Science and Engineering University of Minnesota MinneapolisMN55455 United States

Anomaly detection on attributed networks attracts considerable research interests due to wide applications of attributed networks in modeling a wide range of complex systems. Recently, the deep learning-based anomaly detection methods have shown promising results over shallow approaches, especially on networks with high-dimensional attributes and complex structures. However, existing approaches, which employ graph autoencoder as their backbone, do not fully exploit the rich information of the network, resulting in suboptimal performance. Furthermore, these methods do not directly target anomaly detection in their learning objective and fail to scale to large networks due to the full graph training mechanism. To overcome these limitations, in this paper, we present a novel Contrastive self-supervised Learning framework for Anomaly detection on attributed networks (CoLA for abbreviation). Our framework fully exploits the local information from network data by sampling a novel type of contrastive instance pair, which can capture the relationship between each node and its neighboring substructure in an unsupervised way. Meanwhile, a well-designed graph neural network-based contrastive learning model is proposed to learn informative embedding from high-dimensional attributes and local structure and measure the agreement of each instance pairs with its outputted scores. The multi-round predicted scores by the contrastive learning model are further used to evaluate the abnormality of each node with statistical estimation. In this way, the learning model is trained by a specific anomaly detection-aware target. Furthermore, since the input of the graph neural network module is batches of instance pairs instead of the full network, our framework can adapt to large networks flexibly. Experimental results show that our proposed framework outperforms the state-of-the-art baseline methods on all seven benchmark datasets. © 2021, CC BY.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Self-to-self transitions in open quantum systems:the origin and solutions

Self-to-self transitions in open quantum systems:the origin ...

引用

第三十九届中国控制会议

作者： Fang Gao Yaoxiong Wang Qing Gao Dewen Cao Feng Shuang College of Electrical Engineering Guangxi University Institute of Intelligent Machines Chinese Academy of Sciences School of Automation Science and Electrical Engineering Beihang University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University University Key Laboratory of Intelligent Perception and Computing of Anhui Province Anqing Normal University

The information of quantum pathways can be extracted in the framework of the Hamiltonianencoding and Observable-decoding *** closed quantum systems,only off-diagonal elements of the Hamiltonian in the Hilbert space is required to be encoded to obtain the desired *** open quantum systems,environment-related terms will appear in the diagonal elements of the Hamiltonian in the Liouville *** diagonal encodings have to be performed to differentiate different pathways,which will lead to self-to-self transitions and inconsistency of pathway amplitudes with Dyson *** this work,a well-designed transformation is proposed to avoid the counterintuitive transitions and the inconsistency,with or without control *** simulations show that the method are consistent with Dyson expansion.

关键词： Self-to-self transitions in open quantum systems:the origin and solutions origin

来源：评论

学校读者我要写书评

暂无评论

Towards Graph Self-Supervised Learning with Contrastive Adjusted Zooming

arXiv

引用

arXiv 2021年

作者： Zheng, Yizhen Jin, Ming Pan, Shirui Li, Yuan-Fang Peng, Hao Li, Ming Li, Zhao Department of Data Science and AI Faculty of IT Monash University ClaytonVIC3800 Australia School of Information and Communication Technology Griffith University Australia SouthportQLD4222 Australia Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China Key Laboratory of Intelligent Education Technology Application of Zhejiang Province Zhejiang Normal University Jinhua321004 China Alibaba Group Hangzhou311100 China

Graph representation learning (GRL) is critical for graph-structured data analysis. However, most of the existing graph neural networks (GNNs) heavily rely on labeling information, which is normally expensive to obtain in the real world. Although some existing works aim to effectively learn graph representations in an unsupervised manner, they suffer from certain limitations, such as the heavy reliance on monotone contrastiveness and limited scalability. To overcome the aforementioned problems, in light of the recent advancements in graph contrastive learning, we introduce a novel self-supervised graph representation learning algorithm via Graph Contrastive Adjusted Zooming, namely G-Zoom, to learn node representations by leveraging the proposed adjusted zooming scheme. Specifically, this mechanism enables G-Zoom to explore and extract self-supervision signals from a graph from multiple scales: micro (i.e., node-level), meso (i.e., neighborhood-level), and macro (i.e., subgraph-level). Firstly, we generate two augmented views of the input graph via two different graph augmentations. Then, we establish three different contrastiveness on the above three scales progressively, from node, neighboring, to subgraph level, where we maximize the agreement between graph representations across scales. While we can extract valuable clues from a given graph on the micro and macro perspectives, the neighboring-level contrastiveness offers G-Zoom the capability of a customizable option based on our adjusted zooming scheme to manually choose an optimal viewpoint that lies between the micro and macro perspectives to better understand the graph data. Additionally, to make our model scalable to large graphs, we employ a parallel graph diffusion approach to decouple model training from the graph size. We have conducted extensive experiments on real-world datasets, and the results demonstrate that our proposed model outperforms state-of-the-art methods consistently. © 2021, CC BY.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A Deep Concept-aware Model for predicting and explaining restaurant future status

A Deep Concept-aware Model for predicting and explaining res...

引用

IEEE International Conference on Web Services (ICWS)

作者： Hao Liao Xiaojie Zhang Xin Li Mingyang Zhou Alexandre Vidmer Rui Mao Guangdong Province Key Laboratory of Popular High Performance Computers College of Computer Science and Software Engineering Shenzhen University Guangdong Province Engineering Center of China-made High Performance Data Computing System Shenzhen City Key Laboratory of Service Computing and Application Shenzhen China Institute of Big Data Intelligent Management and Decision Shenzhen University Shenzhen China

ISBN: (数字)9781728187860

ISBN: (纸本)9781728187877

Nowadays, with the development of web services, the survival of online service has captured public attention significantly. Future prediction of business is crucial to the shopkeepers. Predicting how the business will develop and explaining what key factors are leading to it are two most important tasks. Existing literatures usually tackle only one of these two tasks, ignoring that they are two closely related tasks and complement each other. In this paper, we propose a review-based neural model, named Deep Concept-aware Model (DCA), to predict restaurants' future status and provide explainable sentences simultaneously in an end2end framework. Specifically, we use co-attention to select concepts and implement prediction and explanation tasks through Factorization Machine and Gated Recurrent Unit, respectively. We conduct extensive experiments on three Chinese cities' datasets. The proposed joint model outperforms the state-of-the-art baseline methods for both prediction (average 40.96% improvement in AUC) and explanation (average 9.72% improvement in BLEU and 86.05% in Precision metric of ROUGE).

关键词： Web services Urban areas Predictive models Prediction algorithms data models Task analysis Business

来源：评论

学校读者我要写书评

暂无评论

A Causal Adversarial Graph Neural Network for Multi-Center Autism Spectrum Disorder Identification

SSRN

引用

SSRN 2025年

作者： Zhang, Zhuan Wang, Lihui Chen, Qijian Wang, Li Jian, Caiqing Zhu, Yue-Min Wei, Hongjiang Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China University Lyon INSA Lyon CNRS Inserm IRP Metislab CREATIS UMR5220 U1206 Lyon69621 France

Due to the heterogeneous distributions of multi-center rs-fMRI data, currently it is still challenging to identify accurately autism spectrum disorder (ASD) patients from these heterogenous data. To deal with the influence of heterogeneous distributions on multi-center ASD diagnosis, a novel causal adversarial graph neural network (CAG) for multi-center ASD prediction is proposed in this work. CAG mainly consists of a graph filtering (GF) module and a learnable causal graph predictor (CGP). Specifically, the brain connection graph is first constructed from rs-fMRI data, after passing a GF module, the filtered graph is further divided by a causal subgraph and causally irrelevant subgraph. The ground-truth environmental labels and ASD labels are predicted from causal subgraph by a clustering method and a classification block, respectively. In addition, from the filtered graph and causally irrelevant subgraph, the environmental labels are predicted, while from the causally irrelevant subgraph the ASD labels are predicted. Assuming that the predicted environmental labels are independent to causal subgraph, while the predicted ASD labels are independent to causally irrelevant subgraph, accordingly, several adversarial losses are implemented by reversing the gradient. Through this adversarial learning strategy, the derived causal graph can predict multi-center ASD. The comparison experiments on both ABIDE-I and ABIDE-II datasets demonstrate that, the ACC and AUC of CAG has been improved by 3.78\% and 7.38\% at least comparing against the existing methods. Moreover, some abnormal functional connectivities in ASD group are identified from the causal subgraph which may provide useful imaging biomarkers for the early diagnosis of ASD. © 2025, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Accountable privacy-enhanced multi-authority attribute-based authentication scheme for cloud services*✰

引用

Computer Communications 2025年

作者： Xin Liu Hao Wang Bo Zhang Bin Zhang School of Information Engineering Shandong Youth University of Political Science Jinan 250103 China New Technology Research and Development Center of Intelligent Information Controlling in Universities of Shandong Jinan 250103 China Smart Healthcare Big Data Engineering and Ubiquitous Computing Characteristic Laboratory in Universities of Shandong Jinan 250103 China School of Information Science and Engineering Shandong Normal University Jinan 250358 China School of Information Science and Engineering University of Jinan Jinan 250022 China

Current attribute-based authentication (ABA) schemes have three major drawbacks: first, the single attribute authority (AA) becomes the system bottleneck, i.e., if the AA is corrupted, the entire system will stop working; second, user privacy is not completely secured; and third, malicious users may exploit their anonymity. To overcome these defects, we improved a previously established privacy-preserving decentralized ciphertext policy attribute-based encryption (PPD-CP-ABE) scheme, obtaining a PPD-CP-ABE with verifiable outsourced decryption (PPD-CP-ABE-VOD). This improved scheme uses outsourced decryption, secure two-party computation protocol, and zero-knowledge proofs. We transformed the PPD-CP-ABE-VOD scheme into a new privacy-enhanced multi-authority ABA scheme using an identity tracing mechanism based on linear encryption. This new scheme has the following advantages over similar schemes. First, it introduces multiple AAs and does not require users to trust AA fully. Second, it protects users’ attributes, global identifiers, and access behavior, thus strengthening user privacy protection. Finally, it balances user privacy protection and user accountability. Theoretical and experimental analyses have shown that the new scheme is comparable to recently proposed ABA systems in terms of performance in the key generation and authentication phases, despite appending multiple security properties.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DiffuSETS: 12-Lead ECG generation conditioned on clinical text reports and patient-specific information

引用

Patterns 2025年

作者： Yongfan Lai Jiabo Chen Qinghao Zhao Deyun Zhang Yue Wang Shijia Geng Hongyan Li Shenda Hong State Key Laboratory of General Artificial Intelligence Beijing 100871 China School of Intelligence Science and Technology Peking University Beijing 100871 China National Institute of Health Data Science Peking University Beijing 100191 China PKU-WUHAN Institute for Artificial Intelligence Wuhan 430073 China Tianjin Key Laboratory of Visual Computing and Intelligent Perception College of Computer Science Nankai University Tianjin 300350 China Department of Cardiology Peking University People’s Hospital Beijing 100044 China HeartVoice Medical Technology Hefei 230088 China

The scarcity of high-quality electrocardiogram (ECG) data, driven by privacy concerns and limited medical resources, creates a pressing need for effective ECG signal generation. Existing approaches for generating ECG signals typically rely on small training datasets, lack comprehensive evaluation frameworks, and overlook potential applications beyond data augmentation. To address these challenges, we propose DiffuSETS, a framework capable of generating ECG signals with high semantic alignment and fidelity. DiffuSETS accepts various modalities of clinical text reports and patient-specific information as inputs, enabling the creation of clinically meaningful ECG signals. Additionally, we introduce a comprehensive benchmarking methodology to assess the effectiveness of ECG generative models. Our model achieves excellent results in tests, proving its superiority in the task of ECG generation. Furthermore, we showcase its potential to mitigate data scarcity while exploring applications in cardiology education and medical knowledge discovery.

关键词： cardiology electrocardiogram signal processing ECG generation diffusion model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：