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

WRC Symposium on Advanced Robotics and Automation (WRC SARA)

作者： Fangjun Luan Shitong Liu Shuai Yuan Shenyang Branch of National Special Computer Engineering Technology Research Center Shenyang China School of Computer Science and Engineering Shenyang Jianzhu University Shenyang China Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang China

ISBN: (数字)9798331506100

ISBN: (纸本)9798331506117

Aiming at the interference problem of outliers in point set matching, we propose an optimized variational Bayesian point set matching algorithm using coordinate ascent and simulated annealing. For the complex terms in the objective function, we introduce the coordinate ascending strategy and use the Monte Carlo integral stochastic approximation and control variable method to directly optimize the parameters. To enhance the generalization ability of the algorithm and avoid falling into the local optimal solution, we use the simulated annealing scheme to optimize the spatial mapping of the point set. Finally, the affine transform point set matching experiment and the non-rigid point set matching experiment represent our algorithm have a good matching effect and high accuracy.

关键词： Monte Carlo methods Annealing Integral equations Simulated annealing Transforms Interference Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Divide-Solve-Combine: An Interpretable and Accurate Prompting Framework for Zero-shot Multi-Intent Detection 39

Divide-Solve-Combine: An Interpretable and Accurate Promptin...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Qin, Libo Chen, Qiguang Zhou, Jingxuan Wang, Jin Fei, Hao Che, Wanxiang Li, Min School of Computer Science and Engineering Central South University China Key Laboratory of Data Intelligence and Advanced Computing in Provincial Universities Soochow University China Research Center for Social Computing and Information Retrieval Harbin Institute of Technology China Yunnan University China National University of Singapore Singapore

ISBN: (纸本)157735897X

Zero-shot multi-intent detection is capable of capturing multiple intents within a single utterance without any training data, which gains increasing attention. Building on the success of large language models (LLM), dominant approaches in the literature explore prompting techniques to enable zero-shot multi-intent detection. While significant advancements have been witnessed, the existing prompting approaches still face two major issues: lacking explicit reasoning and lacking interpretability. Therefore, in this paper, we introduce a Divide-Solve-Combine Prompting (DSCP) to address the above issues. Specifically, DSCP explicitly decomposes multi-intent detection into three components including (1) single-intent division prompting is utilized to decompose an input query into distinct sub-sentences, each containing a single intent;(2) intent-by-intent solution prompting is applied to solve each sub-sentence recurrently;and (3) multi-intent combination prompting is employed for combining each sub-sentence result to obtain the final multi-intent result. By decomposition, DSCP allows the model to track the explicit reasoning process and improve the interpretability. In addition, we propose an interactive divide-solve-combine prompting (Inter-DSCP) to naturally capture the interaction capabilities of large language models. Experimental results on two standard multi-intent benchmarks (i.e., MIXATIS and MIXSNIPS) reveal that both DSCP and Inter-DSCP obtain substantial improvements over baselines, achieving superior performance and higher interpretability. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LightDAG: A Low-latency DAG-based BFT Consensus through Lightweight Broadcast

LightDAG: A Low-latency DAG-based BFT Consensus through Ligh...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Xiaohai Dai Guanxiong Wang Jiang Xiao Zhengxuan Guo Rui Hao Xia Xie Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China School of Computer Science and Artificial Intelligence Wuhan University of Technology China School of Computer Science and Technology Hainan University China

ISBN: (数字)9798350387117

ISBN: (纸本)9798350387124

To improve the throughput of Byzantine Fault Tolerance (BFT) consensus protocols, the Directed Acyclic Graph (DAG) topology has been introduced to parallel data processing, leading to the development of DAG-based BFT consensus. However, existing DAG-based works heavily rely on Reliable Broadcast (RBC) protocols for block broadcasting, which introduces significant latency due to the three communication steps involved in each RBC. For instance, DAGRider, a representative DAG-based protocol, exhibits the best latency of 12 steps, considerably higher than non-DAG protocols like PBFT, which only requires 3 steps. To tackle this issue, we propose LightDAG, which replaces RBC with lightweight broadcasting protocols such as Consistent Broadcast (CBC) and Plain Broadcast (PBC). Since CBC and PBC can be implemented in two and one communication steps, respectively, LightDAG achieves low *** our proposal, we present two variants of LightDAG, namely LightDAG1 and LightDAG2, each providing a trade-off between the best latency and the expected worst latency. In LightDAG1, every block is broadcast using CBC, which exhibits a best latency of 5 steps and an expected worst latency of 14 steps. Since CBC cannot guarantee the totality property, we design a block retrieval mechanism in LightDAG1 to assist replicas in retrieving missing blocks. LightDAG2 utilizes a combination of PBC and CBC for block broadcasting, resulting in the best latency of 4 steps and an expected worst latency of 12(t+1) steps, where t represents the number of actual Byzantine replicas. Since a Byzantine replica may equivocate through PBC, LightDAG2 prohibits blocks from directly referencing contradictory blocks. To ensure liveness, we propose a mechanism to identify and exclude Byzantine replicas if they engage in equivocation attacks. Extensive experiments have been conducted to evaluate LightDAG, and the results demonstrate its feasibility and efficiency.

关键词： Fault tolerance Distributed processing Directed acyclic graph Fault tolerant systems Broadcasting Throughput data processing

来源：评论

学校读者我要写书评

暂无评论

HYPERBOLIC HYPERGRAPH NEURAL NETWORKS FOR MULTI-RELATIONAL KNOWLEDGE HYPERGRAPH REPRESENTATION

arXiv

引用

arXiv 2024年

作者： Li, Mengfan Shi, Xuanhua Qiao, Chenqi Zhang, Teng Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Knowledge hypergraphs generalize knowledge graphs using hyperedges to connect multiple entities and depict complicated relations. Existing methods either transform hyperedges into an easier-to-handle set of binary relations or view hyperedges as isolated and ignore their adjacencies. Both approaches have information loss and may potentially lead to the creation of sub-optimal models. To fix these issues, we propose the Hyperbolic Hypergraph Neural Network (H2GNN), whose essential component is the hyper-star message passing, a novel scheme motivated by a lossless expansion of hyperedges into hierarchies. It implements a direct embedding that consciously incorporates adjacent entities, hyper-relations, and entity position-aware information. As the name suggests, H2GNN operates in the hyperbolic space, which is more adept at capturing the tree-like hierarchy. We compare H2GNN with 15 baselines on knowledge hypergraphs, and it outperforms state-of-the-art approaches in both node classification and link prediction tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Learning Superconductivity from Ordered and Disordered Material Structures 38

Learning Superconductivity from Ordered and Disordered Mater...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Chen, Pin Peng, Luoxuan Jiao, Rui Mo, Qing Wang, Zhen Huang, Wenbing Liu, Yang Lu, Yutong National Supercomputer Center in Guangzhou School of Computer Science and Engineering Sun Yat-sen University China Dept. of Comp. Sci. & Tech. Institute for AI BNRist Center Tsinghua University China Institute for AIR Tsinghua University China Gaoling School of Artificial Intelligence Renmin University of China China Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China

Superconductivity is a fascinating phenomenon observed in certain materials under certain conditions. However, some critical aspects of it, such as the relationship between superconductivity and materials' chemical/structural features, still need to be understood. Recent successes of data-driven approaches in material science strongly inspire researchers to study this relationship with them, but a corresponding dataset is still lacking. Hence, we present a new dataset for data-driven approaches, namely SuperCon3D, containing both 3D crystal structures and experimental superconducting transition temperature (Tc) for the first time. Based on SuperCon3D, we propose two deep learning methods for designing high Tc superconductors. The first is SODNet, a novel equivariant graph attention model for screening known structures, which differs from existing models in incorporating both ordered and disordered geometric content. The second is a diffusion generative model DiffCSP-SC for creating new structures, which enables high Tc-targeted generation. Extensive experiments demonstrate that both our proposed dataset and models are advantageous for designing new high Tc superconducting candidates. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic Deep Sparse Multi-Trial Vector-based Differential Evolution Clustering with Manifold Learning and Incremental Technique

TechRxiv

引用

TechRxiv 2023年

作者： Hadikhani, Parham Lai, Daphne Teck Ching Ong, Wee-Hong Nadimi-Shahraki, Mohammad H. The School of Digital Science Universiti Brunei Darussalam Brunei Faculty of Computer Engineering Big Data Research Center Najafabad Branch Islamic Azad University Najafabad Iran

Most deep clustering methods despite providing complex networks to learn better from data, use a shallow clustering method. These methods have difficulty in finding good clusters due to the lack of ability to handle between local search and global search to prevent premature convergence. In other words, they do not consider different aspects of the search and it causes them to get stuck in the local optimum. In addition, the majority of existing deep clustering approaches perform clustering with the knowledge of the number of clusters, which is not practical in most real scenarios where such information is not available. To address these problems, this paper presents a novel automatic deep sparse clustering approach based on an evolutionary algorithm called Multi-Trial Vector-based Differential Evolution (MTDE). Sparse auto-encoder is first applied to extract embedded features. Manifold learning is then adopted to obtain representation and extract the spatial structure of features. Afterward, MTDE clustering is performed without prior information on the number of clusters to find the optimal clustering solution. The proposed approach was evaluated on various datasets, including images and time-series. The results demonstrate that the proposed method improved MTDE by 18.94 % on average and compared to the most recent deep clustering algorithms, is consistently among the top three in the majority of datasets. © 2023, CC BY.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Container lifecycle-aware scheduling for serverless computing

Container lifecycle-aware scheduling for serverless computin...

引用

作者： Wu, Song Tao, Zhiheng Fan, Hao Huang, Zhuo Zhang, Xinmin Jin, Hai Yu, Chen Cao, Chun National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

Elastic scaling in response to changes on demand is a main benefit of serverless computing. When bursty workloads arrive, a serverless platform launches many new containers and initializes function environments (known as cold starts), which incurs significant startup latency. To reduce cold starts, platforms usually pause a container after it serves a request, and reuse this container for subsequent requests. However, this reuse strategy cannot efficiently reduce cold starts because the schedulers are agnostic of container lifecycle. For example, it may ignore soon available containers or evict soon needed containers. We propose a container lifecycle-aware scheduling strategy for serverless computing, CAS. The key idea is to control distribution of requests and determine creation or eviction of containers according to different lifecycle phases of containers. We implement a prototype of CAS on OpenWhisk. Our evaluation shows that CAS reduces 81% cold starts and therefore brings a 63% reduction at 95th percentile latency compared with native scheduling strategy in OpenWhisk when there is worker contention between workloads, and does not add significant performance overhead. © 2021 John Wiley & Sons Ltd.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

On Pipelined GCN with Communication-Efficient Sampling and Inclusion-Aware Caching

On Pipelined GCN with Communication-Efficient Sampling and I...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Shulin Wang Qiang Yu Xiong Wang Yuqing Li Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Cyber Science and Engineering Wuhan University Wuhan China

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Graph convolutional network (GCN) has achieved enormous success in learning structural information from unstructured data. As graphs become increasingly large, distributed training for GCNs is severely prolonged by frequent cross-worker communications. Existing efforts to improve the training efficiency often come at the expense of GCN performance, while the communication overhead persists. In this paper, we propose PSC-GCN, a holistic pipelined framework for distributed GCN training with communication-efficient sampling and inclusion-aware caching, to address the communication bottleneck while ensuring satisfactory model performance. Specifically, we devise an asynchronous pre-fetching scheme to retrieve stale statistics (features, embedding, gradient) of boundary nodes in advance, such that the embedding aggregation and model update are pipelined with statistics transmission. To alleviate communication volume and staleness effect, we introduce a variance-reduction based sampling policy, which prioritizes inner nodes over boundary ones for reducing the access frequency to remote neighbors, thus mitigating cross-worker statistics exchange. Complementing graph sampling, a feature caching module is co-designed to buffer hot nodes with high inclusion probability, ensuring that frequently sampled nodes will be available in local memory. Extensive evaluations on real-world datasets show the superiority of PSC-GCN over state-of-the-art methods, where we can reduce training time by 72%-80% without sacrificing model accuracy.

关键词： Training Estimation error Accuracy Graph convolutional networks Computational modeling Probability Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

UCPM: Uncertainty-Guided Cross-Modal Retrieval with Partially Mismatched Pairs

引用

IEEE Transactions on Image Processing 2025年 34卷 3622-3634页

作者： Zha, Quanxing Liu, Xin Cheung, Yiu-Ming Peng, Shu-Juan Xu, Xing Wang, Nannan Huaqiao University Department of Computer Science Xiamen 361021 China Key Laboratory of Pattern Recognition and Computer Vision Xiamen 361021 China Huaqiao University Fujian Key Laboratory of Big Data Intelligence and Security Xiamen 361021 China Hong Kong Baptist University Department of Computer Science Hong Kong Huaqiao University Department of Artificial Intelligence Xiamen 361021 China Fujian Province University Key Laboratory of Computer Vision and Machine Learning (Huaqiao University) Xiamen 361021 China University of Electronic Science and Technology of China Center for Future Multimedia School of Computer Science and Engineering Chengdu 610051 China Xidian University State Key Laboratory of Integrated Services Networks Xi’an 710071 China

The manual annotation of perfectly aligned labels for cross-modal retrieval (CMR) is incredibly labor-intensive. As an alternative, the collection of co-occurring data pairs from the Internet is a remarkably cost-effective way, but which, inevitably induces the Partially Mismatched Pairs (PMPs) and therefore significantly degrades the retrieval performance without particular treatment. Previous efforts often utilize the pair-wise similarity to filter out the mismatched pairs, and such operation is highly sensitive to mismatched or ambiguous data and thus leads to sub-optimal performance. To alleviate these concerns, we propose an efficient approach, termed UCPM, i.e., Uncertainty-guided Cross-modal retrieval with Partially Mismatched pairs, which can significantly reduce the adverse impact of mismatched data pairs. Specifically, a novel Uncertainty Guided Division (UGD) strategy is sophisticatedly designed to divide the corrupted training data into confident matched (clean), easily-identifiable mismatched (noisy) and hardly-determined hard subsets, and the derived uncertainty can simultaneously guide the informative pair learning while reducing the negative impact of potential mismatched pairs. Meanwhile, an effective Uncertainty Self-Correction (USC) mechanism is concurrently presented to accurately identify and rectify the fluctuated uncertainty during the training process, which further improves the stability and reliability of the estimated uncertainty. Besides, a Trusted Margin Loss (TML) is newly designed to enhance the discriminability between those hard pairs, by dynamically adjusting their soft margins to amplify the positive contributions of matched pairs while suppressing the negative impacts of mismatched pairs. Extensive experiments on three widely-used benchmark datasets, verify the effectiveness and reliability of UCPM compared with the existing SOTA approaches, and significantly improve the robustness in both synthetic and real-world PMPs. The code i

关键词： Cross-modal retrieval partially mismatched pairs trusted margin loss uncertainty guided division uncertainty self-correction

来源：评论

学校读者我要写书评

暂无评论

Born with a Silver Spoon: On the (In)Security of Native Granted App Privileges in Custom Android ROMs

Born with a Silver Spoon: On the (In)Security of Native Gran...

引用

IEEE Symposium on Security and Privacy

作者： Chao Wang Yanjie Zhao Jiapeng Deng Haoyu Wang Huazhong University of Science and Technology Wuhan China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology.

ISBN: (数字)9798331522360

ISBN: (纸本)9798331522377

The customization and fragmentation of the Android ecosystem have fostered its prosperity and highlighted the growing importance of conducting security audits on these customized systems. This significance is driven by the distinct strategies that Original Equipment Manufacturers (OEMs) deploy to enhance device performance and user experience, which are important to their competitive differentiation. A key aspect of these strategies includes system-level optimizations for super apps and other widely used apps, marking a competitive trend among OEMs. Granting privileges to such apps often stems from trust in these apps. However, without proper validation of apps' identities, this can lead to severe implicit trust vulnerabilities, providing a convenient pathway for malicious apps to impersonate privileged ones and gain their access rights. For malicious developers, exploiting these vulnerabilities is both cost-effective and potentially highly rewarding. In this study, we undertook a comprehensive analysis of 686 custom Android ROMs from 46 OEMs, aimed at uncovering potential security risks associated with implicit trust vulnerabilities in apps. Our investigation identified 3,085 instances where thirdparty app package names were embedded within the ROMs. Alarmingly, only seven of these instances had implemented adequate authentication mechanisms to mitigate the associated risks, exposing 3,078 potential vulnerabilities that exhibited an increasing trend over time. We have reported 22 manually confirmed cases to seven relevant OEMs. As of the time of writing this paper, four vulnerabilities have been explicitly acknowledged by the OEMs, and one has been assigned a CVE ID.

关键词： Silver Privacy Authentication Pressing Writing Market research User experience Security Protection Read only memory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：