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

International Conference on Computer Supported Cooperative Work in Design

作者： Yang Wang Jiayan Xiang Hangyu Cheng Wanjun Chen Yong Xiao Guosheng Kang 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

With the wide adoption of Web APIs released on Internet, users tend to reuse them for business requirements or software development. Mashup is a useful technology for composing Web APIs into a new and value-added application. With the increasing number of Web APIs and Mashups, the API-Mashup ecosystem has emerged based on the invocation relationship between Mashups and Web APIs. In this paper, we take ProgrammableWeb, a typical API-Mashup ecosystem, as an example to investigate its dynamic evolutionary analysis. Although there have been some works on the API-Mashup ecosystem, they mainly focus on static analysis, i.e., the static characteristics of the API- Mashup ecosystem on a fixed time point. This paper conducts a comprehensive study on the dynamic evolutionary analysis of the API-Mashup ecosystem with a long time range from 2005 to 2021. First, we conduct a dynamic statistical analysis based on the API-Mashup ecosystem dataset. Next, we construct two cooperation networks, one between Web APIs, and the other between their categories. And the general characteristics of the two cooperation networks are presented. Finally, we investigate the derived cooperation networks from four perspectives: dynamic characteristics, degree distribution, betweenness centrality, and assortative mixing. Meanwhile, the corresponding insights are uncovered. Our work provides a foundation for visualization and understanding of the API-Mashup ecosystem from the timeline.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Interactive Web API Recommendation for Mashup Development based on Light Neural Graph Collaborative Filtering

Interactive Web API Recommendation for Mashup Development ba...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Jiayan Xiang Wanjun Chen Yang Wang Bowen Liang Zihao Liu Guosheng Kang 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

With the development of Mashup technique, the number of Web APIs released on the Web continues to grow year by year. However, it is a challenging issue to find and select the desirable Web APIs among the large amount of Web APIs. Consequently, interactive Web API recommendation is used to alleviate the difficulty of service selection, when users or developers try to invoke Web APIs for solving their business requirements or software development requirements. Currently, there are several collaborative filtering based approaches proposed for Web API recommendation, while their recommendation performance is limited on both optimality and scalability. This paper proposes a light neural graph collaborative filtering based Web API recommendation approach, named LNGCF. Specifically, LNGCF learns user and item embeddings by linearly propagating them on the user-item interaction graph, and uses the weighted summation of the embeddings learned at all layers as the final embedding. Such simple, linear, and neat model is much easier to implement and train. A set of experiments are conducted on a real-world dataset. Experimental results demonstrate the substantial improvements on both optimality and scalability over the baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SMOG: Accelerating Subgraph Matching on GPUs

SMOG: Accelerating Subgraph Matching on GPUs

引用

IEEE Conference on High Performance Extreme computing (HPEC)

作者： Zhibin Wang Ziheng Meng Xue Li Xi Lin Long Zheng Chen Tian Sheng Zhong State Key Laboratory for Novel Software Technology Nanjing University Alibaba Group“ National Engineering Research Center for Big Data Technology and System/ Services Computing Technology and System Lab/Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Zhejiang Lab

Subgraph matching is a crucial problem in graph theory with diverse applications in fields, such as bioinformatics, social networks and recommendation systems. Accelerating subgraph matching can be greatly facilitated by GPUs, which offer exceptional parallelism and high memory bandwidth. By leveraging the power of multiple GPU cards, subgraph matching can be scaled to achieve unprecedented levels of performance. In this paper, we propose SMOG, an abbreviation for. Subgraph Matching On Multi-Card GPUs. It is a general, high-performance and scalable sub graph matching system that utilizes multi-card GPUs. To address the issue of duplication resulting from subgraph automorphism, SMOG introduces a two-step approach. Firstly, it analyzes the symmetry within the subgraph. Then, it adaptively adjusts the graph preprocessing and generates subgraph-aware GPU codes tailored to the given subgraph. Furthermore, SMOG leverages multi-level parallelism by designing the specific strategy for each level, enabling it to scale from 1 to 1,024 GPU cards, resulting in an extraordinary $553\times$ speedup. We evaluate SMOG on various subgraph queries and datasets. The experimental results demonstrate that SMOG outperforms the triangle-specific system TRUST with an average speedup of $2.94\times$ . And it performs significantly better than the subgraph matching system RPS by $203.55\times$ and the graph processing system Gunrock by 35, $455.52\times$ on average.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Comprehensive Semantic Repair of Obsolete GUI Test Scripts for Mobile Applications

Comprehensive Semantic Repair of Obsolete GUI Test Scripts f...

引用

International Conference on software Engineering (ICSE)

作者： Shaoheng Cao Minxue Pan Yu Pei Wenhua Yang Tian Zhang Linzhang Wang Xuandong Li State Key Lab for Novel Software Technology Nanjing University Nanjing China Department of Computing The Hong Kong Polytechnic University Hong Kong China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China

ISBN: (数字)9798400702174

ISBN: (纸本)9798350382143

Graphical User Interface (GUI) testing is one of the primary approaches for testing mobile apps. Test scripts serve as the main carrier of GUI testing, yet they are prone to obsolescence when the GUIs change with the apps' evolution. Existing repair approaches based on GUI layouts or images prove effective when the GUI changes between the base and updated versions are minor, however, they may struggle with substantial changes. In this paper, a novel approach named COSER is introduced as a solution to re-pairing broken scripts, which is capable of addressing larger GUI changes compared to existing methods. COSER incorporates both external semantic information from the GUI elements and internal semantic information from the source code to provide a unique and comprehensive solution. The efficacy of COSER was demonstrated through experiments conducted on 20 Android apps, resulting in superior performance when compared to the state-of-the-art tools METER and GUIDER. In addition, a tool that implements the COSER approach is available for practical use and future research.

关键词： Meters Source coding Semantics Layout Maintenance engineering Aging Mobile applications

来源：评论

学校读者我要写书评

暂无评论

An intelligent Resource Scheduling Method with Edge Channel Deployment for BPM 19

An Intelligent Resource Scheduling Method with Edge Channel ...

引用

2022 IEEE SmartWorld, 19th IEEE International Conference on Ubiquitous Intelligence and computing, 2022 IEEE International Conference on Autonomous and Trusted Vehicles Conference, 22nd IEEE International Conference on Scalable computing and Communications, 2022 IEEE International Conference on Digital Twin, 8th IEEE International Conference on Privacy computing and 2022 IEEE International Conference on Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PriComp/Metaverse 2022

作者： Liu, Bowen Dou, Wanchun Zhou, Xiaokang Zhang, Xuyun Qi, Lianyong Dai, Fei Chen, Chaochao Nanjing University State Key Laboratory for Novel Software Technology Nanjing China Shiga University Faculty of Data Science Hikone Japan Macquarie University Department of Computing Sydney Australia College of Computer and Software Qingdao China Southwest Forestry University College of Big Data and Intelligent Engineering Kunming China Zhejiang University College of Computer Science and Technology Hangzhou China

ISBN: (纸本)9798350346558

Edge computing is a novel computing paradigm that offers kinds of resources at the network edge. In edge computing, terminal users are connected to edge servers via the wireless network and there are various channels in each wireless link. These wireless channels are limited resource while different channel has different cost and service ability. The dynamic changes of users' status make it harder to find an appropriate method to satisfy the BPM requirements of channel deployment. With this observation, it is a tricky challenge to make a trade-off between the system cost(rental price) and the service ability(number of users). In view of this challenge, an intelligent resource scheduling method, named EdgeIRS, is proposed in this paper. In the technical sense, the EdgeIRS method can accommodate most users at the edge with a minimum cost of deploying channel resources in an online way. Its performance is analyzed theoretically and the experiments verify the superiority of the method. © 2022 IEEE.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

A Kind of new parallax algorithm based on symmetric continuous optimization 5

A Kind of new parallax algorithm based on symmetric continuo...

引用

2020 5th International Seminar on Computer technology, Mechanical and Electrical Engineering, ISCME 2020

作者： Jiang, Kaiwen Zhang, Degan Xu, Haixia Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education 300384 China Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin University of Technology Tianjin China School of Electronic and Information Engineering Tianjin Vocational Institute Tianjin300410 China

With the fast development of 3D imaginations becomes more and more fascination, multi-view stereo based 3D reconstruction is a significant technique for those application. To facilitate the subsequent processing of 3D reconstruction and reduce the possibility of other algorithms falling into local optimal solutions, attempting to get better and faster performance, a new parallax calculation based on symmetric continuous optimization is proposed in this paper. The algorithm is proposed here will be tested respectively in the same data, in order to certificate the algorithm applied is better than traditional minimize El algorithm. © Published under licence by IOP Publishing Ltd.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

REINFORCED IN-CONTEXT BLACK-BOX OPTIMIZATION

arXiv

引用

arXiv 2024年

作者： Song, Lei Gao, Chen-Xiao Xue, Ke Wu, Chenyang Li, Dong Hao, Jianye Zhang, Zongzhang Qian, Chao National Key Laboratory for Novel Software Technology Nanjing University China School of Artificial Intelligence Nanjing University China Huawei Noah’s Ark Lab China School of Computing and Intelligence Tianjin University China

Black-Box Optimization (BBO) has found successful applications in many fields of science and engineering. Recently, there has been a growing interest in meta-learning particular components of BBO algorithms to speed up optimization and get rid of tedious hand-crafted heuristics. As an extension, learning the entire algorithm from data requires the least labor from experts and can provide the most flexibility. In this paper, we propose RIBBO, a method to reinforce-learn a BBO algorithm from offline data in an end-to-end fashion. RIBBO employs expressive sequence models to learn the optimization histories produced by multiple behavior algorithms and tasks, leveraging the in-context learning ability of large models to extract task information and make decisions accordingly. Central to our method is to augment the optimization histories with regret-to-go tokens, which are designed to represent the performance of an algorithm based on cumulative regret over the future part of the histories. The integration of regret-to-go tokens enables RIBBO to automatically generate sequences of query points that satisfy the user-desired regret, which is verified by its universally good empirical performance on diverse problems, including BBO benchmark functions, hyper-parameter optimization and robot control problems. Copyright © 2024, The Authors. All rights reserved.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

New Method of MSCA for Edge computing 4

New Method of MSCA for Edge Computing

引用

4th IEEE International Conference on Smart Internet of Things, SmartIoT 2020

作者： Zhang, De-Gan Zhu, Hao-Li Zhang, Ting Wang, Jia-Xu Tianjin University of Technology Tianjin Key Lab of Intelligent Computing Novel Software Technology Tianjin300384 China Tianjin China

ISBN: (纸本)9781728165141

By innovative use of edge computing technology to construct a node data cache model and step-by-step calculation of node channel separation, a multi-strategy channel allocation algorithm (MSCA) for edge computing is proposed. The mechanism of this algorithm is to use edge computing technology to pre-store the data in the nodes in the multicast tree and calculate the channel separation between the nodes, and then select the transmission channel number of the node with the least interference to avoid mutual interference between node information transmissions. Through experimental tests and comparisons, the MSCA algorithm for edge computing presented in this paper can minimize channel interference and overall network energy consumption while satisfying throughput and end-To-end delay. © 2020 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Luban: Building Open-Ended Creative Agents via Autonomous Embodied Verification

arXiv

引用

arXiv 2024年

作者： Guo, Yuxuan Peng, Shaohui Guo, Jiaming Huang, Di Zhang, Xishan Zhang, Rui Hao, Yifan Li, Ling Tian, Zikang Gao, Mingju Li, Yutai Gan, Yiming Liang, Shuai Zhang, Zihao Du, Zidong Guo, Qi Hu, Xing Chen, Yunji University of Science and Technology of China China State Key Lab of Processors Institute of Computing Technology CAS China Cambricon Technologies China University of Chinese Academy of Sciences China Shanghai Innovation Center for Processor Technologies China Intelligent Software Research Center Institute of Software CAS China Institute of Computing Technology CAS China

Building open agents has always been the ultimate goal in AI research, and creative agents are the more enticing. Existing LLM agents excel at long-horizon tasks with well-defined goals (e.g., ‘mine diamonds’ in Minecraft). However, they encounter difficulties on creative tasks with open goals and abstract criteria due to the inability to bridge the gap between them, thus lacking feedback for self-improvement in solving the task. In this work, we introduce autonomous embodied verification techniques for agents to fill the gap, laying the groundwork for creative tasks. Specifically, we propose the Luban agent target creative building tasks in Minecraft, which equips with two-level autonomous embodied verification inspired by human design practices: (1) visual verification of 3D structural speculates, which comes from agent synthesized CAD modeling programs;(2) pragmatic verification of the creation by generating and verifying environment-relevant functionality programs based on the abstract criteria. Extensive multi-dimensional human studies and Elo ratings show that the Luban completes diverse creative building tasks in our proposed benchmark and outperforms other baselines (33% to 100%) in both visualization and pragmatism. Additional demos on the real-world robotic arm show the creation potential of the Luban in the physical world. © 2024, CC BY-NC-SA.

关键词： Computer aided design

来源：评论

学校读者我要写书评

暂无评论

Attention-Based Knowledge-aware Multi-Interest intelligent Model for Sequential Recommendation 19

Attention-Based Knowledge-aware Multi-Interest Intelligent M...

引用

作者： Li, Yang Li, Qianmu Meng, Shunmei Hou, Jun Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing China Wuyi University Intelligent Manufacturing Department Jiangmen China Nanjing University State Key Lab. for Novel Software Technology Nanjing China Nanjing Vocational University of Industry Technology School of Social Science Nanjing China

ISBN: (纸本)9798350346558

As a fundamental means of intelligent service, recommender systems have shown a trend of diversification. Sequential recommendation, a class of time-aware methods, aims to predict the user's next click. Multi-interest representation is a hot topic in recommender systems, but the research on how to apply multi-interest into sequences is still in the minority. And many methods will introduce knowledge graph to improve the representation of items, but how to consider both knowledge graph and user's multi-interest in sequential recommendation has become a temporary blank. In this paper, we propose an attentive sequential recommendation with knowledge-aware multi-interest module (AKAMI). Items are embedded from the sequence's structure and user's interests. Specifically, we represent items by stacking self-attention layers to mine the internal correlation of the sequence. Meanwhile, we segment the sequence via the common neighbors in the knowledge graph and cast the user's multi-interest based on the aggregation of subsequences. Multi-interests are integrated into item representation by the gating network adaptively. Comprehensive experiments on two real-world datasets show that the proposed model performs better than various representative methods under different evaluation metrics. Additionally, we also visually explain the model through a case study. © 2022 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：