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

arXiv 2021年

作者： Wang, Ying Qiao, Liang Xu, Chang Liu, Yepang Cheung, Shing-Chi Meng, Na Yu, Hai Zhu, Zhiliang Software College Northeastern University China State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China Southern University of Science and Technology China Hong Kong University of Science and Technology China Virginia Tech United States

Ever since its first release in 2009, the Go programming language (Golang) has been well received by software communities. A major reason for its success is the powerful support of library-based development, where a Golang project can be conveniently built on top of other projects by referencing them as libraries. As Golang evolves, it recommends the use of a new library-referencing mode to overcome the limitations of the original one. While these two library modes are incompatible, both are supported by the Golang ecosystem. The heterogeneous use of library-referencing modes across Golang projects has caused numerous dependency management (DM) issues, incurring reference inconsistencies and even build failures. Motivated by the problem, we conducted an empirical study to characterize the DM issues, understand their root causes, and examine their fixing solutions. Based on our findings, we developed HERO, an automated technique to detect DM issues and suggest proper fixing solutions. We applied HERO to 19,000 popular Golang projects. The results showed that HERO achieved a high detection rate of 98.5% on a DM issue benchmark and found 2,422 new DM issues in 2,356 popular Golang projects. We reported 280 issues, among which 181 (64.6%) issues have been confirmed, and 160 of them (88.4%) have been fixed or are under fixing. Almost all the fixes have adopted our fixing suggestions. Copyright © 2021, The Authors. All rights reserved.

关键词： Ecosystems

来源：评论

学校读者我要写书评

暂无评论

Diff9D: Diffusion-Based Domain-Generalized Category-Level 9-DoF Object Pose Estimation

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第7期47卷 5520-5537页

作者： Jian Liu Wei Sun Hui Yang Pengchao Deng Chongpei Liu Nicu Sebe Hossein Rahmani Ajmal Mian National Engineering Research Center for Robot Visual Perception and Control Technology College of Electrical and Information Engineering School of Robotics and the State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body Hunan University Changsha China Institute of Artificial Intelligence and Robotics Xi’an Jiaotong University Xi’an China Department of Information Engineering and Computer Science University of Trento Trento Italy School of Computing and Communications Lancaster University Lancaster U.K. Department of Computer Science The University of Western Australia Crawley WA Australia

Nine-degrees-of-freedom (9-DoF) object pose and size estimation is crucial for enabling augmented reality and robotic manipulation. Category-level methods have received extensive research attention due to their potential for generalization to intra-class unknown objects. However, these methods require manual collection and labeling of large-scale real-world training data. To address this problem, we introduce a diffusion-based paradigm for domain-generalized category-level 9-DoF object pose estimation. Our motivation is to leverage the latent generalization ability of the diffusion model to address the domain generalization challenge in object pose estimation. This entails training the model exclusively on rendered synthetic data to achieve generalization to real-world scenes. We propose an effective diffusion model to redefine 9-DoF object pose estimation from a generative perspective. Our model does not require any 3D shape priors during training or inference. By employing the Denoising Diffusion Implicit Model, we demonstrate that the reverse diffusion process can be executed in as few as 3 steps, achieving near real-time performance. Finally, we design a robotic grasping system comprising both hardware and software components. Through comprehensive experiments on two benchmark datasets and the real-world robotic system, we show that our method achieves state-of-the-art domain generalization performance.

关键词： Shape Solid modeling Three-dimensional displays Pose estimation Training Robots Grasping Diffusion models Real-time systems Point cloud compression

来源：评论

学校读者我要写书评

暂无评论

Meta-path-based outlier detection in heterogeneous information network

引用

Frontiers of computer science 2020年第2期14卷 388-403页

作者： Lu LIU Shang WANG Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012China College of Software Jilin UniversityChangchun 130012China College of Computer Science and Technology Jilin UniversityChangchun 130012China College of Communication Engineering Jilin UniversityChangchun 130012China Department of Computer Science New Jersey Institute of TechnologyUniversity HeightsNewark NJ 07102USA

Mining outliers in heterogeneous networks is crucial to many applications,but challenges *** this paper,we focus on identifying meta-path-based outliers in heterogeneous information network(HIN),and calculate the similarity between different types of *** propose a meta-path-based outlier detection method(MPOutliers)in heterogeneous information network to deal with problems in one go under a unified *** calculates the heterogeneous reachable probability by combining different types of objects and their *** discovers the semantic information among nodes in heterogeneous networks,instead of only considering the network *** also computes the closeness degree between nodes with the same type,which extends the whole heterogeneous ***,each node is assigned with a reliable weighting to measure its authority *** experiments on two real datasets(AMiner and Movies dataset)show that our proposed method is very effective and efficient for outlier detection.

关键词： data mining heterogeneous information network outlier detection short text similarity

来源：评论

学校读者我要写书评

暂无评论

Experimental optimal verification of three-dimensional entanglement on a silicon chip

arXiv

引用

arXiv 2022年

作者： Xia, Lijun Lu, Liangliang Wang, Kun Jiang, Xinhe Zhu, Shining Ma, Xiaosong National Laboratory of Solid-state Microstructures School of Physics Collaborative Innovation Center of Advanced Microstructures State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing210093 China Key Laboratory of Optoelectronic Technology of Jiangsu Province School of Physical Science and Technology Nanjing Normal University Nanjing210023 China Institute for Quantum Computing Baidu Research Beijing100193 China Institute for Quantum Optics and Quantum Information Austrian Academy of Sciences Vienna1090 Austria

High-dimensional entanglement is significant for the fundamental studies of quantum physics and offers unique advantages in various quantum information processing (QIP) tasks. Integrated quantum devices have recently emerged as a promising platform for creating, processing, and detecting complex high-dimensional entangled states. A crucial step towards practical quantum technologies is to verify that these devices work reliably with an optimal strategy. In this work, we experimentally implement an optimal quantum verification strategy on a three-dimensional maximally entangled state using local projective measurements on a silicon photonic chip. A 95% confidence is achieved from 1190 copies to verify the target quantum state. The obtained scaling of infidelity as a function of the number of copies is - 0.5497±0.0002, exceeding the standard quantum limit of -0.5 with 248 standard deviations. Our results indicate that quantum state verification could serve as an efficient tool for complex quantum measurement tasks. © 2022, CC BY-NC-ND.

关键词： Quantum optics

来源：评论

学校读者我要写书评

暂无评论

Service Reservation and Pricing for Green Metaverses: A Stackelberg Game Approach

arXiv

引用

arXiv 2023年

作者： Huang, Xumin Wu, Yuan Kang, Jiawen Nie, Jiangtian Zhong, Weifeng Kim, Dong In Xie, Shengli School of Automation Guangdong University of Technology Guangzhou510006 China State Key Laboratory of Internet of Things for Smart City University of Macau China Department of Computer and Information Science University of Macau China School of Computer Science and Engineering Nanyang Technological University Singapore The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

Metaverse enables users to communicate, collaborate and socialize with each other through their digital avatars. Due to the spatio-temporal characteristics, co-located users are served well by performing their software components in a collaborative manner such that a Metaverse service provider (MSP) eliminates redundant data transmission and processing, ultimately reducing the total energy consumption. The energy-efficient service provision is crucial for enabling the green and sustainable Metaverse. In this article, we take an augmented reality (AR) application as an example to achieve this goal. Moreover, we study an economic issue on how the users reserve offloading services from the MSP and how the MSP determines an optimal charging price since each user is rational to decide whether to accept the offloading service by taking into account the monetary cost. A single-leader multi-follower Stackelberg game is formulated between the MSP and users while each user optimizes an offloading probability to minimize the weighted sum of time, energy consumption and monetary cost. Numerical results show that our scheme achieves energy savings and satisfies individual rationality simultaneously compared with the conventional schemes. Finally, we identify and discuss open directions on how several emerging technologies are combined with the sustainable green Metaverse. © 2023, CC BY-NC-SA.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs

arXiv

引用

arXiv 2024年

作者： Xu, Yiming Shi, Bin Ma, Teng Dong, Bo Zhou, Haoyi Zheng, Qinghua Department of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China Department of Distance Education Xi’an Jiaotong University China School of Software Beihang University China Advanced Innovation Center for Big Data and Brain Computing Beihang University China

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph’s augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG. © 2024, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Multi-view clustering guided by unconstrained non-negative matrix factorization

引用

Knowledge-Based Systems 2023年 266卷

作者： Deng, Ping Li, Tianrui Wang, Dexian Wang, Hongjun Peng, Hong Horng, Shi-Jinn School of Computer and Software Engineering Xihua University Chengdu610039 China School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Chengdu611756 China Department of Computer Science and Information Engineering National Taiwan University of Science and Technology Taipei106 Taiwan

Multi-view clustering based on non-negative matrix factorization (NMFMvC) is a well-known method for handling high-dimensional multi-view data. To satisfy the non-negativity constraint of the matrix, NMFMvC is usually solved using the Karush–Kuhn–Tucker (KKT) conditions. However, this optimization method is poorly scalable. To this end, we propose an unconstrained non-negative matrix factorization multi-view clustering (uNMFMvC) model. First, the objective function was constructed by decoupling the elements of the matrix and combining the elements with a non-linear mapping function in a non-negative value domain. The objective function was then optimized using the stochastic gradient descent (SGD) algorithm. Subsequently, three uNMFMvC methods were constructed based on different mapping functions and detailed reasoning was provided. Finally, experiments were conducted on eight public datasets and compared with cutting-edge multi-view clustering methods. The experimental results demonstrate that the proposed model has significant advantages. © 2023 Elsevier B.V.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

The Singularity Set of Optimal Transportation Maps 10th

The Singularity Set of Optimal Transportation Maps

引用

10th International Conference on Numerical Geometry, Grid Generation, and Scientific Computing celebrating the 130th anniversary of B. N. Delaunay, NUMGRID 2020

作者： Luo, Zhongxuan Chen, Wei Lei, Na Guo, Yang Zhao, Tong Gu, Xianfeng Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province Dalian China School of Software Technology Dalian University of Technology Dalian China DUT-RU ISE Dalian University of Technolog Dalian China Department of Computer Science Stony Brook University Stony BrookNY United States INRIA Sophia-Antipolis and Telecom Paris Paris France

ISBN: (纸本)9783030767976

Optimal transportation plays an important role in many engineering fields, especially in deep learning. By Brenier theorem, computating optimal transportation maps is reduced to solving Monge–Ampère equations, which in turn is equivalent to construct Alexandrov polytopes. Furthermore, the regularity theory of Monge–Ampère equation explains mode collapsing issue in deep learning. Hence, computing and studying the singularity sets of OT maps become important. In this work, we generalize the concept of medial axis to power medial axis, which describes the singularity sets of optimal transportation maps. Then we propose a computational algorithm based on variational approach using power diagrams. Furthermore, we prove that when the measures are changed homotopically, the corresponding singularity sets of the optimal transportation maps are homotopic equivalent as well. © 2021, Springer Nature Switzerland AG.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Exploring reliable edge-cloud computing for service latency optimization in sustainable cyber-physical systems

Exploring reliable edge-cloud computing for service latency ...

引用

作者： Cao, Kun Wei, Tongquan Chen, Mingsong Li, Keqin Weng, Jian Tan, Wuzheng College of Information Science and Technology/College of Cyber Security Jinan University Guangzhou China School of Computer Science and Technology East China Normal University Shanghai China Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China Department of Computer Science State University of New York New PaltzNY United States

In recent years, the advance in information technology has promoted a wide span of emerging cyber-physical systems (CPS) applications such as autonomous automobile systems, healthcare monitoring, and process control systems. For these CPS applications, service latency management is extraordinarily important for the sake of providing high quality-of-experience to terminal users. Edge-cloud computing, integrating both edge computing and cloud computing, is regarded as a promising computation paradigm to achieve low service latency for terminal users in CPS. However, existing latency-aware edge-cloud computing methods dedicated for CPS fail to jointly consider energy budgets and reliability requirements, which may greatly degrade the sustainability of CPS applications. In this article, we explore the problem of minimizing service latency of edge-cloud computing coupled CPS under the constraints of energy budgets and reliability requirements. We propose a two-stage approach composed of static and dynamic service latency optimization. At static stage, Monte-Carlo simulation with integer-linear-programming technique is adopted to find the optimal computation offloading mapping and task backup number. At dynamic stage, a backup-adaptive dynamic mechanism is developed to avoid redundant data transmissions and executions for achieving additional energy savings and service latency enhancement. Experimental results show that our solution is able to reduce system service latency by up to 18.3% compared with representative baseline solutions. © 2021 John Wiley & Sons, Ltd.

关键词： Cyber Physical System

来源：评论

学校读者我要写书评

暂无评论

RSAFormer: A method of polyp segmentation with region self-attention transformer

引用

computers in Biology and Medicine 2024年 172卷 108268-108268页

作者： Yin, Xuehui Zeng, Jun Hou, Tianxiao Tang, Chao Gan, Chenquan Jain, Deepak Kumar García, Salvador School of Software Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China School of Cyber Security and Information Law Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Intelligent Control and Optimization for Industrial Equipment of Ministry of Education Dalian University of Technology Dalian116024 China Symbiosis Institute of Technology Symbiosis International University Pune412115 India Department of Computer Science and Artificial Intelligence Andalusian Research Institute in Data Science and Computational Intelligence University of Granada Granada18071 Spain

Colonoscopy has attached great importance to early screening and clinical diagnosis of colon cancer. It remains a challenging task to achieve fine segmentation of polyps. However, existing state-of-the-art models still have limited segmentation ability due to the lack of clear and highly similar boundaries between normal tissue and polyps. To deal with this problem, we propose a region self-attention enhancement network (RSAFormer) with a transformer encoder to capture more robust features. Different from other excellent methods, RSAFormer uniquely employs a dual decoder structure to generate various feature maps. Contrasting with traditional methods that typically employ a single decoder, it offers more flexibility and detail in feature extraction. RSAFormer also introduces a region self-attention enhancement module (RSA) to acquire more accurate feature information and foster a stronger interplay between low-level and high-level features. This module enhances uncertain areas to extract more precise boundary information, these areas being signified by regional context. Extensive experiments were conducted on five prevalent polyp datasets to demonstrate RSAFormer's proficiency. It achieves 92.2% and 83.5% mean Dice on Kvasir and ETIS, respectively, which outperformed most of the state-of-the-art models. © 2024 Elsevier Ltd

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：