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

Intelligent Cybernetics Technology & Applications (ICICyTA), International Conference on

作者： Alwan Kemal Dana Sulistiyo Kusumo Rosa Reska Riskiana Software Engineering Department School of Computing Telkom University Bandung Indonesia

ISBN: (数字)9798331506490

ISBN: (纸本)9798331506506

In software development, the quality control process is a critical element that aims to oversee and verify product quality. Poor quality control processes are frequently a key factor in software project failures. software testing is key to identifying defects, but designing an effective test suite requires a huge effort that can affect cost, effectiveness, maintenance time, and development schedules. The Directorate of the Center for Excellence in Information Technology (PUTI) as one of the IT support units within Telkom University, is currently facing the same challenges in managing the BaSO application, which is an application for making official letters online. This application requires further testing to ensure that each function runs properly in various browser and device environments. In this case, the reuse and pattern approach was proposed as a solution, and based on this approach, a test case catalog was created. To assess the design system's impact and effectiveness, an experimental study was conducted for the PUTI QA team to test the BaSO application. The experimental results show that the use of a test case catalog during the test case development process can increase the reusability of test cases, with an average precision value of about 50%. In addition, the obtained test case variation value also increased by 35.5%. The findings highlight the significant impact of using a test case catalog, thus contributing to a more effective software testing process.

关键词： software testing Schedules Process control Quality control Feature extraction software Product design Quality assessment Pattern recognition software development management

来源：评论

学校读者我要写书评

暂无评论

QoS-aware Dynamic Service Caching and Updating in Cost-efficient Multi-Access Edge computing 22

QoS-aware Dynamic Service Caching and Updating in Cost-effic...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Lu, Shuaibing Jin, Xin Wu, Jie Zhou, Shuyang Wu, Shen Yang, Jackson Yan, Ran Beijing University of Technology College of Computer Science Beijing China Temple University Center for Networked Computing United States Beijing Jiaotong University School of Software Engineering Beijing China

ISBN: (纸本)9798331509712

In the context of mobile edge computing, achieving dynamic service caching and updating to guarantee the QoS of users and reduce system costs is a challenging problem. However, existing research still has certain deficiencies in considering the dynamic behavior of users and the limited storage resources of edge servers. To address this problem, this paper proposes three novel strategies for the different stages of service caching and updating to jointly optimize the delay and cost. At the initial service caching stage, we propose a caching strategy based on dynamic programming, taking into account the constraint of limited memory resources. Given the dynamic behavior of users, we formulate the joint optimization problem as a Markov Decision Process (MDP) and design a service extension strategy based on Q-learning at the service updating decision-making stage and a replacement strategy taking both the distribution of service replications and service access frequency into account at the service updating replacement stage to guarantee the QoS of users. We effectively tackle the challenges arising from the dynamic behavior of users and limited storage resources. Through extensive comparative experiments, our approach outperforms traditional strategies by significantly reducing user latency and system cost. © 2024 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Advancements in quantum image filtering:Exponential speedup on a subset of images

引用

Science China(Physics,Mechanics & Astronomy) 2024年第9期67卷 13-13页

作者： Lvzhou Li Institute of Quantum Computing and Software School of Computer Science and EngineeringSun Yat-sen UniversityGuangzhou 510006China

The pursuit of quantum supremacy in computational tasks has driven the exploration of quantum algorithms capable of surpassing classical *** the realm of image processing,a notable advancement towards this objective is highlighted in the study by Cui et al.[1].Their work proposes a quantum image filtering(QImF)algorithm that exhibits exponential acceleration for a specific subset of images,offering a glimpse into the potential of quantum computing in image processing.

关键词： quantum subset filtering

来源：评论

学校读者我要写书评

暂无评论

Crawling and Exploring RESTful Web APIs from RapidAPI 17th

Crawling and Exploring RESTful Web APIs from RapidAPI

引用

CCF 17th International Conference on Service Science, CCF ICSS 2024

作者： Li, Wen Ren, Hongshuai Nie, Yamei Liu, Zihao Kang, Guosheng Liu, Jianxun Peng, Zhenlian School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

ISBN: (纸本)9789819757596

RapidAPI serves as a marketplace and management platform that integrates a wide range of Web APIs, offering developers access to a rich pool of API resources. More and more researchers are delving into ways to maximize the value created by leveraging these resources. Thus, acquiring the Web API data and knowing the details is of significance for researchers and ordinary users. In this paper, we propose the methodology of crawling Web APIs from RapidAPI (https://***/hub) and provide rich visualizations and statistical analysis for the crawled dataset. The crawling code and the crawled dataset are open for public access (https://***/IntelligentServiceLab/RESTful-API-Crawler) so that researchers and users can acquire them with no effort. Moreover, the use cases of RESTful Web APIs are provided as a usage reference for users and developers. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Web crawler

来源：评论

学校读者我要写书评

暂无评论

GoMatching: A Simple Baseline for Video Text Spotting via Long and Short Term Matching 38

GoMatching: A Simple Baseline for Video Text Spotting via Lo...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： He, Haibin Ye, Maoyuan Zhang, Jing Liu, Juhua Du, Bo Tao, Dacheng School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Wuhan University China College of Computing & Data Science Nanyang Technological University Singapore

Beyond the text detection and recognition tasks in image text spotting, video text spotting presents an augmented challenge with the inclusion of tracking. While advanced end-to-end trainable methods have shown commendable performance, the pursuit of multi-task optimization may pose the risk of producing sub-optimal outcomes for individual tasks. In this paper, we identify a main bottleneck in the state-of-the-art video text spotter: the limited recognition capability. In response to this issue, we propose to efficiently turn an off-the-shelf query-based image text spotter into a specialist on video and present a simple baseline termed GoMatching, which focuses the training efforts on tracking while maintaining strong recognition performance. To adapt the image text spotter to video datasets, we add a rescoring head to rescore each detected instance's confidence via efficient tuning, leading to a better tracking candidate pool. Additionally, we design a long-short term matching module, termed LST-Matcher, to enhance the spotter's tracking capability by integrating both long- and short-term matching results via Transformer. Based on the above simple designs, GoMatching delivers new records on ICDAR15-video, DSText, BOVText, and our proposed novel test set with arbitrary-shaped text termed ArTVideo, which demonstrates GoMatching's capability to accommodate general, dense, small, arbitrary-shaped, Chinese and English text scenarios while saving considerable training budgets. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MH-pFLID: Model Heterogeneous personalized Federated Learning via Injection and Distillation for Medical Data Analysis 41

MH-pFLID: Model Heterogeneous personalized Federated Learnin...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Xie, Luyuan Lin, Manqing Luan, Tianyu Li, Cong Fang, Yuejian Shen, Qingni Wu, Zhonghai School of Software and Microelectronics Peking University Beijing China National Engineering Research Center for Software Engineering Peking University Beijing China PKU-OCTA Laboratory for Blockchain and Privacy Computing Peking University Beijing China State University of New York BuffaloNY United States

Federated learning is widely used in medical applications for training global models without needing local data access. However, varying computational capabilities and network architectures (system heterogeneity), across clients pose significant challenges in effectively aggregating information from non-independently and identically distributed (non-IID) data. Current federated learning methods using knowledge distillation require public datasets, raising privacy and data collection issues. Additionally, these datasets require additional local computing and storage resources, which is a burden for medical institutions with limited hardware conditions. In this paper, we introduce a novel federated learning paradigm, named Model Heterogeneous personalized Federated Learning via Injection and Distillation (MH-pFLID). Our framework leverages a lightweight messenger model that carries concentrated information to collect the information from each client. We also develop a set of receiver and transmitter modules to receive and send information from the messenger model, so that the information could be injected and distilled with efficiency. Our framework eliminates the need for public datasets and efficiently share information among clients. Our experiments on various medical tasks including image classification, image segmentation, and time-series classification, show MH-pFLID outperforms state-of-the-art methods in all these areas and has good generalizability. Copyright 2024 by the author(s)

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Multi-view Hypergraph-based Self-supervised Learning Model for Web API Recommendation 22

Multi-view Hypergraph-based Self-supervised Learning Model f...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Shen, Jiexun Li, Dongfan Chen, Wanjun Xiao, Yong Kang, Guosheng Liu, Jianxun Peng, Zhenlian School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

ISBN: (纸本)9798331509712

With the rapid development of service computing technology, how to recommend the desirable Web APIs to developers from the large number of APIs is a challenge. The traditional methods based on collaborative filtering are limited by data sparsity. With the support of multi-dimensional relational feature modeling, graph neural network-based methods are proposed to mitigate data sparsity, but their convolution nature may amplify the noise effect. Therefore, how to simultaneously reduce the impact of sparsity and noisy data has been an open question in the field of API recommendation. To address the problem, this paper proposes a self-supervised learning method based on multi-view hypergraph for Web API recommendation. First, the Mashup-API interaction graph is transformed into a hypergraph, and the hyperedges are used as intermediate hubs to transfer messages between nodes, maintaining the global collaboration effect between Mashup and API nodes. Then, a multi-view strategy is adopted to generate embeddings of Mashups and APIs through information fusion, by which recommendation probability is derived by dot product between the embeddings of Mashups and Web APIs. To train the model parameters effectively, a self-supervised learning method is used to reduce the effect of noisy data to improve the embeddings. Extensive experiments are conducted on a real-world dataset, and the experimental results show that the proposed model outperforms the baselines. © 2024 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

A Zero-Knowledge Set Membership Proof Scheme Based on the SM2 Algorithm 24

A Zero-Knowledge Set Membership Proof Scheme Based on the SM...

引用

2024 Guangdong-Hong Kong-Macao Greater Bay Area International Conference on Digital Economy and Artificial Intelligence, DEAI 2024

作者： Zhou, Yin Dai, Bingrong Li, Chao School of Computer and Information Engineering Shanghai Polytechnic University My Street Shanghai201209 China Department of Computing Shanghai Development Center of Computer SoftWare Technology Shanghai201102 China

ISBN: (纸本)9798400717147

With the widespread application of blockchain technology, various range proof protocols based on zero-knowledge proofs have been proposed. However, existing range proof protocols suffer from issues such as high communication overhead and computational complexity. Therefore, this paper introduces an efficient and secure Zero-Knowledge Set Membership Proof Protocol (ZSMPP) to address these challenges. Building upon improvements to the proof structure of range proof protocols, the paper integrates the SM2 identity-based digital signature algorithm, effectively avoiding the time-consuming bilinear pairing operations and reducing computational costs. The proposed protocol offers an efficient and secure solution for the given problem. Experimental results demonstrate that, compared to protocols proposed by Bootle, Deng, Mao, and others, the protocol presented in this paper exhibits superior computational efficiency, providing an efficient and secure solution for data security and individual privacy protection in the digital age. © 2024 ACM.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Implementation of a continuous-time quantum walk on a sparse graph

引用

Physical Review A 2024年第5期110卷 052215-052215页

作者： Zhaoyang Chen Guanzhong Li Lvzhou Li Institute of Quantum Computing and Software School of Computer Science and Engineering Sun Yat-sen University Guangzhou 510006 China

Continuous-time quantum walks (CTQWs) play a crucial role in quantum computing, especially for designing quantum algorithms. However, how to efficiently implement CTQWs is a challenging issue. In this paper, we study the implementation of CTQWs on sparse graphs, i.e., constructing efficient quantum circuits for implementing the unitary operator e−iHt, where H=γA (γ is a constant and A corresponds to the adjacency matrix of a graph). Our result is, for a d-sparse graph with N vertices and evolution time t, we can approximate e−iHt by a quantum circuit with gate complexity (d3∥H∥tNlog2(N))1+o(1), compared to the general Pauli decomposition, which scales like (∥H∥tN4log2(N))1+o(1). For sparse graphs, for instance, d=O(1), we obtain a noticeable improvement. Interestingly, our technique is related to graph decomposition. More specifically, we decompose the graph into a union of star graphs, and correspondingly, the Hamiltonian H can be represented as the sum of some Hamiltonians Hj, where each e−iHjt is a CTQW on a star graph which can be implemented efficiently.

关键词： Quantum algorithms & computation Quantum computation Quantum walks

来源：评论

学校读者我要写书评

暂无评论

Differential-Trust-Mechanism Based Trade-off Method Between Privacy and Accuracy in Recommender Systems

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 5054-5068页

作者： Xu, Guangquan Feng, Shicheng Xi, Hao Yan, Qingyang Li, Wenshan Wang, Cong Wang, Wei Liu, Shaoying Tian, Zhihong Zheng, Xi Qingdao Huanghai University School of Big Data Qingdao China Tianjin University College of Intelligence and Computing Tianjin300350 China KLISS and School of Software Beijing100084 China Sichuan University School of Cyber Science and Engineering Chengdu610207 China Xi’an Jiaotong University School of Cyber Science and Engineering Xi’an710049 China East China Normal University Shanghai200062 China Hiroshima University School of Informatics and Data Science Higashihiroshima739-8511 Japan Guangzhou University Cyberspace Institute of Advanced Technology Guangdong Key Laboratory of Industrial Control System Security Huangpu Research School of Guangzhou University China Macquarie University School of Computing SydneyNSW2109 Australia

In the era where Web3.0 values data security and privacy, adopting groundbreaking methods to enhance privacy in recommender systems is crucial. Recommender systems need to balance privacy and accuracy, while also having the ability to overcome cold start problems. The Differential Trust Mechanism (DTM) introduced in this paper is such an approach. The DTM provides a unique use of Gaussian distributions in modeling trust relationships within data, offering a novel way to balance recommendation accuracy with user privacy. This mechanism innovatively applies differential privacy principles, using Gaussian noise addition to protect individual user data from inference attacks, while maintaining the integrity and utility of the overall dataset. Unlike traditional anonymization techniques that often compromise data utility or vulnerability to reverse engineering, DTM provides a robust solution by dynamically adjusting privacy levels based on the trustworthiness of data requests. By combining DTM with existing mainstream recommendation algorithms, the prediction accuracy of MAE and RMSE increases by at least 6.60% and 2.69%, respectively. This dual benefit positions DTM as a significant advancement in secure data processing, especially relevant for online businesses and platforms where personalized recommendations are crucial yet privacy concerns are paramount. © 2005-2012 IEEE.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：