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

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

来源：评论

学校读者我要写书评

暂无评论

Improving the Efficiency of Blockchain Applications with Smart Contract based Cyber-insurance

Improving the Efficiency of Blockchain Applications with Sma...

引用

IEEE International Conference on Communications (ICC)

作者： Jia Xu Yongqi Wu Xiapu Luo Dejun Yang Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China Department of Computing The Hong Kong Polytechnic University Hongkong China Department of Computer Science Colorado School of Mines Golden USA

ISBN: (数字)9781728150895

ISBN: (纸本)9781728150901

Blockchain based applications benefit from decentralization, data privacy, and anonymity. However, they may suffer from inefficiency due to underlying blockchain. In this paper, we aim to address this limitation while still enjoying the privacy and anonymity. Taking the blockchain based crowdsourcing system as an example, we propose a new smart contract based cyber-insurance framework, which can greatly shorten the delay, and enable the workers to obtain the economic compensation for increased security risk caused by a conflict between the need to provide service quickly and delay in payment. We model the process of determining insurance premium and number of confirmations as a Stackelberg Game and prove the existence of Stackelberg Equilibria, at which the utility of the requester is maximized, and none of the workers can improve its utility by unilaterally deviating from its current strategy. The experimental results show that our framework can definitely improve the time efficiency of crowdsourcing. Particularly, it takes on average only 33% of the time required by the naive blockchain based crowdsouring solution for time-sensitive cases.

关键词： Contracts Crowdsourcing Task analysis Insurance Bitcoin

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Based Valid Bug Reports Determination and Explanation

Deep Learning Based Valid Bug Reports Determination and Expl...

引用

International Symposium on Software Reliability Engineering (ISSRE)

作者： Jianjun He Ling Xu Yuanrui Fan Zhou Xu Meng Yan Yan Lei Key Laboratory of Dependable Service Computing in Cyber Physical Society (Chongqing University) Ministry of Education China School of Big Data and Software Engineering Chongqing University Chongqing China College of Computer Science and Technology Zhejiang University Hangzhou China

ISBN: (数字)9781728198705

ISBN: (纸本)9781728198712

Bug reports are widely used by developers to fix bugs. Due to the lack of experience, reporters may submit numerous invalid bug reports. Manually determining valid bug reports is a laborious task. Automatically identifying valid bug reports can save time and effort for bug analysis. In this paper, we propose a deep learning-based approach to determine and explain valid bug reports using only textual information i.e., summaries and descriptions of bug reports. Convolutional neural network (CNN) is applied to capture their contextual and semantic features. Moreover, by analyzing the spatial structure of CNN, we backtrack the trained CNN model to get phrases that can explain valid bug reports determination. After inspecting the phrases manually, we summarize some valid bug report patterns. We evaluate our approach on five large-scale open-source projects containing a total of 540491 bug reports. On average, across the five projects, our approach achieves 0.85, 0.80, 0.69 and improves the state-of-the-art approach by 8.97%, 9.59%, 9.52% in terms of AUC, F1-score for valid bug reports, and F1-score for invalid bug reports, respectively. From the summarized patterns, we can find that determining valid bug reports is mainly due to three categories of patterns: Attachment, Environment, and Reproduce.

关键词： Fans Computer bugs Semantics Feature extraction Software reliability Task analysis Open source software

来源：评论

学校读者我要写书评

暂无评论

Edge-cloud cooperation driven surface roughness classification method for selective laser melting

引用

Advanced Engineering Informatics 2025年 66卷

作者： Ma, Shuaiyin Huang, Yuming Liu, Yang Yan, Zhiqiang Lv, Jingxiang Cai, Wei School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications Xi'an710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an710121 China Shaanxi Union Research Centre of University and Enterprise for 5G+ Industrial Internet Communication Terminal Technology Xi'an University of Posts and Telecommunications Xi'an710121 China Department of Management and Engineering Linköping University LinköpingSE-581 83 Sweden Industrial Engineering and Management University of Oulu Oulu90570 Finland Key Laboratory of Road Construction Technology and Equipment of MOE Chang'an University Xi'an710064 China College of Engineering and Technology Southwest University Chongqing400715 China

Additive manufacturing (AM) technology is extensively utilized in aerospace and industrial manufacturing. However, parts built using AM are susceptible to spheroidization, porosity, cracks, and poor surface quality, making it difficult to establish an actionable product quality degree. Hence, developing a reasonable method to equate product quality with a new degree and further analyzing the product quality based on these standards has proven effective for enhancing part quality in AM. To achieve this goal, this paper proposes a surface roughness classification method that utilizes surface roughness analysis and sample enhancement. This method leverages edge cloud cooperation to efficiently analyze and integrate data from different sensors, enabling real-time monitoring and adjustment of the manufacturing process. Subsequently, the quality degree analysis system was developed utilizing matter-element extension cloud model. Furthermore, a bidirectional-gated recurrent unit (Bi-GRU) based model for quality classification and recognition has been established, with Wasserstein generative adversarial network (WGAN) employed for sample enhancement to address the issue of imbalanced column classification and to enhance the accuracy of both classification and recognition. Finally, the results obtained from this case study demonstrate through comparative experiments that the proposed method for classifying surface roughness can accurately identify 98% of prepared samples. © 2025 The Authors

关键词： Inspection

来源：评论

学校读者我要写书评

暂无评论

Efficient dynamical system resource management method in cloud computing

Efficient dynamical system resource management method in clo...

引用

7th International Symposium on Test Automation and Instrumentation, ISTAI 2018

作者： Wu, Tianshu Wang, Shuai Shi, Xiaoyu College of Computer Science Chongqing University Chongqing400044 China China West Noraml Univerisity 637002 China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China

The resource management of virtualisation system is a core issue in the field of cloud computing. For achieving the goal of efficient manage system resource without performance loss in clouding environment, the authors propose an optimal load balancing controller to assign the resource to different virtual machines, which run on a single physical server. Here, the authors focus on dynamical web workloads that the system resource management problem can be formulated as a dynamical optimisation problem. In the face of dynamical and robust workloads, the authors present an alternative approach based on the constrained boundary linear quadratic control (cBLQC) method, the optimal resource allocation scheme is solved by minimising the quadratic cost function with constrains on the system input and output. Different with existing works that assume a particular distribution for system noise or ignore the noise directly, the authors loosen the restrictions on system noise, which simply assume that system noise belongs with some reasonable norm-bounded set. Experiments on the Xen-based platform with a set of workload patterns show that the efficiency of authors’ method in terms of control precision and stability. © 2019 Institution of Engineering and Technology. All rights reserved.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A Deep Learning Model Incorporating Knowledge Representation Vectors and Its Application in Diabetes Prediction

引用

Disease Markers 2022年第1期2022卷 7593750页

作者： Xu, He Zheng, Qunli Zhu, Jingshu Xie, Zuoling Cheng, Haitao Li, Peng Ji, Yimu School of Computer Science Nanjing University of Posts and Telecommunications Nanjing 210023 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Jiangsu Province Nanjing 210023 China Institute of High Performance Computing and Big Data Nanjing University of Posts and Telecommunications Nanjing 210023 China Nanjing Center of HPC China Nanjing 210023 China Jiangsu Research Engineering of HPC and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing 210023 China Department of Endocrinology Zhongda Hospital Southeast University Nanjing 210009 China

The deep learning methods for various disease prediction tasks have become very effective and even surpass human experts. However, the lack of interpretability and medical expertise limits its clinical application. This paper combines knowledge representation learning and deep learning methods, and a disease prediction model is constructed. The model initially constructs the relationship graph between the physical indicator and the test value based on the normal range of human physical examination index. And the human physical examination index for testing value by knowledge representation learning model is encoded. Then, the patient physical examination data is represented as a vector and input into a deep learning model built with self-attention mechanism and convolutional neural network to implement disease prediction. The experimental results show that the model which is used in diabetes prediction yields an accuracy of 97.18% and the recall of 87.55%, which outperforms other machine learning methods (e.g., lasso, ridge, support vector machine, random forest, and XGBoost). Compared with the best performing random forest method, the recall is increased by 5.34%, respectively. Therefore, it can be concluded that the application of medical knowledge into deep learning through knowledge representation learning can be used in diabetes prediction for the purpose of early detection and assisting diagnosis. © 2022 He Xu et al.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A novel noise reduction and interaction enrichment recommendation model via contrastive learning

引用

Neurocomputing 2025年 645卷

作者： Zhang, Zhiqiang Wu, Qi Deng, Jiangzhou Ye, Jianmei Yang, Fang Wang, Yong Khushvakhtzoda, Kobiljon Kh. Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China School of Economics and Management Chongqing University of Posts and Telecommunications Chongqing400065 China Research Center of Digital Intelligence Technology Innovation and Industry Development Chongqing University of Posts and Telecommunications Chongqing400065 China Mashang Consumer Finance Co. Ltd. Chongqing400065 China National Academy of Sciences of Tajikistan Dushanbe734025 Tajikistan

To address the challenge of noisy data in recommendation systems, we propose a novel model that combines adaptive denoising with structural similarity-based interaction filling to improve recommendation accuracy. Our method dynamically prunes noisy interactions using a threshold-based denoising strategy without requiring auxiliary information. To compensate for information loss and preserve data sparsity, we introduce a structural similarity-based approach that fills pruned interactions with high-reliability user–item pairs, computed via cosine similarity. We further enhance representation learning via a contrastive learning framework that separates reliable and unreliable interactions based on mutual information maximization. Experimental results on three public datasets demonstrate that our model outperforms state-of-the-art baselines, achieving up to 4.5% and 6.7% improvements in Recall@5 and NDCG@5, respectively, confirming its effectiveness and practical applicability. © 2025 Elsevier B.V.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Poisoning attack against estimating from pairwise comparisons

arXiv

引用

arXiv 2021年

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Cao, Xiaochun Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen518055 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer and Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China The School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Big Data Mining and Knowledge Management The School of Economics and Management University of Chinese Academy of Sciences Beijing100049 China

As pairwise ranking becomes broadly employed for elections, sports competitions, recommendation, information retrieval and so on, attackers have strong motivation and incentives to manipulate or disrupt the ranking list. They could inject malicious comparisons into the training data to fool the target ranking algorithm. Such a technique is called "poisoning attack" in regression and classification tasks. In this paper, to the best of our knowledge, we initiate the first systematic investigation of data poisoning attack on the pairwise ranking algorithms, which can be generally formalized as the dynamic and static games between the ranker and the attacker, and can be modeled as certain kinds of integer programming problems mathematically. To break the computational hurdle of the underlying integer programming problems, we reformulate them into the distributionally robust optimization (DRO) problems, which are computational tractable. Based on such DRO formulations, we propose two efficient poisoning attack algorithms and establish the associated theoretical guarantees including the existence of Nash equilibrium and the generalization ability bounds. The effectiveness of the suggested poisoning attack strategies is demonstrated by a series of toy simulations and several real data experiments. These experimental results show that the proposed methods can significantly reduce the performance of the ranker in the sense that the correlation between the true ranking list and the aggregated results with toxic data can be decreased dramatically. © 2021, CC BY-NC-ND.

关键词： Toys

来源：评论

学校读者我要写书评

暂无评论

Probing Globular Cluster with MeerKAT and FAST: A Pulsar Polarization Census

arXiv

引用

arXiv 2025年

作者： Zhang, Lei Abbate, Federico Li, Di Possenti, Andrea Bailes, Matthew Ridolfi, Alessandro Freire, Paulo C.C. Ransom, Scott M. Zhang, Yong-Kun Guo, Meng Ni, Meng-Meng Hu, Jia-Le Feng, Yi Wang, Pei Zhang, Jie Zhi, Qi-Jun National Astronomical Observatories Chinese Academy of Sciences Beijing100101 China Centre for Astrophysics and Supercomputing Swinburne University of Technology VIC3122 Australia INAF Osservatorio Astronomico di Cagliari Via della Scienza 5 SelargiusI-09047 Italy Max-Planck-Institut für Radioastronomie Auf dem Hügel 69 BonnD-53121 Germany Department of Astronomy Tsinghua University Beijing100190 China Swinburne University of Technology VIC3122 Australia Faculty of Physics University of Bielefeld Bielefeld33501 Germany National Radio Astronomy Observatory 520 Edgemont Road Charlottesville22903 United States National Supercomputing Center in Jinan Qilu University of Technology Jinan250103 China Jinan Institute of Supercomputing Technology 28666 East Jingshi Road Jinan250103 China Research Center for Intelligent Computing Platforms Zhejiang Laboratory Hangzhou311100 China Institute for Astronomy School of Physics Zhejiang University Hangzhou310027 China College of Physics and Electronic Engineering Qilu Normal University Jinan250200 China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal University Guiyang550001 China

Only one globular cluster (GC), 47 Tuc, has been found to containintracluster medium, with an electron density 100 times higher than that of theISM in its vicinity. The characteristics of this intracluster medium areclosely related to GC evolution and the compact objects within. However,significant knowledge gaps remain regarding the ionized gas content of GCs,particularly in Galactic halo clusters. We carried out a polarization census ofGC pulsars using MeerKAT and FAST. This first combined effort of observationsfrom these two major radio telescopes resulted in high signal-to-noise ratio,full polarization pulse profiles for 43 pulsars in 8 GCs, doubling the numberof rotation measures (RMs) known in these clusters. The accuracy of dispersionmeasures (DMs) was improved by a factor of 8 compared to previous *** intracluster medium was found, and at least two halo GCs showed morestringent upper limits on electron density than that detected in 47 Tuc. Thesurprising barrenness of GCs suggests effective gas removal mechanisms, such asstrong winds from millisecond pulsars and/or ionizing radiation from post-AGBstars and young white dwarfs. Copyright © 2025, The Authors. All rights reserved.

关键词： White dwarfs

来源：评论

学校读者我要写书评

暂无评论

Convergence Analysis of an SLF-NMU Algorithm for Non-negative Latent Factor Analysis on a High-Dimensional and Sparse Matrix

Convergence Analysis of an SLF-NMU Algorithm for Non-negativ...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Zhigang Liu Xin Luo Chongqing Engineering Research Center of Big Data Application for Smart Cities and Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China

Non-negative latent factor (NLF) models have been frequently applied to information extraction, pattern recognition, and community detection. An NLF model can well represent a high-dimensional and sparse (HiDS) matrix of non-negative data and efficiently acquire useful knowledge from it. A single latent factor-dependent, non-negative and multiplicative update (SLF-NMU) algorithm is highly efficient to build NLF model. However, its convergence ability on such a matrix is still unveiled in theory. This paper presents the convergence property of an SLF-NMU algorithm. We theoretically prove that it can guarantee its convergence to a Karush-Kuhn-Tucher (KKT) stationary point. Empirical studies on two HiDS matrices from practical applications indicate that an SLF-NMU algorithm make an NLF model to converge at a relatively steady state.

关键词： Sparse matrices Convergence Computational modeling Analytical models Linear programming data models Technological innovation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：