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

42nd IEEE International Conference on Computer Communications, INFOCOM 2023

作者： Wang, Puwei Sun, Zhouxing Zhan, Ying Li, Haoran Du, Xiaoyong Renmin University of China School of Information China Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Beijing100872 China Guizhou University of Finance and Economics Guiyang City550025 China

ISBN: (纸本)9798350334142

In edge computing (EC), resource allocation is to allocate computing, storage and networking resources on the edge nodes (ENs) efficiently and reasonably to tasks generated by users. Due to the resource-limitation of ENs, the tasks often need to compete for the resources. Pricing mechanisms are widely used to deal with the resource allocation problem, and the valuations of tasks play a critical role in the price mechanisms. However, users naturally are not willing to expose the valuations of their tasks due to conflicts of interests. Current research works usually adopt truthful auctions to motivate the users to report honestly the valuations of their tasks. In this paper, we introduce the marginal value to estimate the valuations of tasks, and propose a marginal value-based pricing mechanism using the incentive theory, which motivates the tasks with higher marginal values to actively request more resources. The EC platform sets the resource prices using the price mechanism, and then the users determine their resource requests relying on the resource prices and the valuations of their tasks. After receiving the deadline-sensitive tasks from the users, the resource allocation can be modeled as a knapsack problem with the deadline constraints. Extensive experimental results demonstrate that our approach is computationally efficient and is promising in enhancing the utility of the EC platform and the tasks. © 2023 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

P-TECS: An Energy Balance Algorithm for Opportunistic Networks Integrating Multiple Node Attributes 5th

P-TECS: An Energy Balance Algorithm for Opportunistic Netwo...

引用

5th International Conference on Security and Privacy in New Computing Environments, SPNCE 2022

作者： Xu, Gang Yang, Xiaoying Chen, Jingjian Huang, Baoqi College of Computer Science Inner Mongolia University Hohhot010021 China Inner Mongolia A.R. Key Laboratory of Data Mining and Knowledge Engineering Inner Mongolia University Hohhot010021 China

ISBN: (纸本)9783031306228

This paper proposes an energy balance opportunistic networks routing algorithm P-TECS. The P-TECS solves the problems of energy consumption of key nodes in existing opportunistic routing algorithms. This paper defines the relay degree of communication between nodes, and designs a P-TECS opportunistic routing algorithm integrating dynamic attributes of multiple nodes. Simulation results show that in resource-constrained opportunistic networks, P-TECS significantly improves the message delivery rate and average remaining energy of nodes, and significantly reduces the routing overhead rate. © 2023, ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

P2 Law: Scaling Law for Post-Training After Model Pruning

arXiv

引用

arXiv 2024年

作者： Chen, Xiaodong Hu, Yuxuan Zhang, Xiaokang Wang, Yanling Li, Cuiping Chen, Hong Zhang, Jing School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China Zhongguancun Laboratory China

Pruning has become a widely adopted technique for reducing the hardware requirements of large language models (LLMs). To recover model performance after pruning, post-training is commonly employed to mitigate the resulting performance degradation. While post-training benefits from larger datasets, once the dataset size is already substantial, increasing the training data provides only limited performance gains. To balance post-training cost and model performance, it is necessary to explore the optimal amount of post-training data. Through extensive experiments on the Llama-3 and Qwen-2.5 series models, pruned using various common pruning methods, we uncover the scaling Law for Post-training after model Pruning, referred to as the P2 Law. This law identifies four key factors for predicting the pruned model’s post-training loss: the model size before pruning, the number of post-training tokens, the pruning rate, and the model’s loss before pruning. Moreover, P2 Law can generalize to larger dataset sizes, larger model sizes, and higher pruning rates, offering valuable insights for the post-training of pruned LLMs. © 2024, CC BY.

关键词： Digital elevation model

来源：评论

学校读者我要写书评

暂无评论

Dynamic Scaling of Unit Tests for Code Reward Modeling

arXiv

引用

arXiv 2025年

作者： Ma, Zeyao Zhang, Xiaokang Zhang, Jing Yu, Jifan Luo, Sijia Tang, Jie School of Information Renmin University of China China Tsinghua University China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China

Current large language models (LLMs) often struggle to produce accurate solutions on the first attempt for code generation. Prior research tackles this challenge by generating multiple candidate solutions and validating them with LLM-generated unit tests. The execution results of unit tests serve as reward signals to identify correct solutions. As LLMs always confidently make mistakes, these unit tests are not reliable, thereby diminishing the quality of reward signals. Motivated by the observation that scaling the number of solutions improves LLM performance, we explore the impact of scaling unit tests to enhance reward signal quality. Our pioneer experiment reveals a positive correlation between the number of unit tests and reward signal quality, with greater benefits observed in more challenging problems. Based on these insights, we propose CodeRM-8B, a lightweight yet effective unit test generator that enables efficient and high-quality unit test scaling. Additionally, we implement a dynamic scaling mechanism that adapts the number of unit tests based on problem difficulty, further improving efficiency. Experimental results show that our approach significantly improves performance across various models on three benchmarks (e.g., with gains of 18.43% for Llama3-8B and 3.42% for GPT-4o-mini on HumanEval Plus). © 2025, CC BY-SA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Partial Label Feature Selection: An Adaptive Approach

引用

IEEE Transactions on knowledge and data engineering 2024年第8期36卷 4178-4191页

作者： Zan Zhang Jialu Yao Lin Liu Jiuyong Li Lei Li Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei Anhui China School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei Anhui China UniSA STEM University of South Australia Adelaide SA Australia Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei Anhui China

As an emerging weakly supervised learning framework, partial label learning aims to induce a multi-class classifier from ambiguous supervision information where each training example is associated with a set of candidate labels, among which only one is the true label. Traditional feature selection methods, either for single label and multiple label problems, are not applicable to partial label learning as the ambiguous information contained in the label space obfuscates the importance of features and misleads the selection process. This makes the selection of a proper feature subset from partial label examples particularly challenging, and therefore has rarely been investigated. In this paper, we propose a novel feature selection algorithm for partial label learning, named PLFS, which considers not only the relationships between features and labels, but also exploits the relationships between instances to select the most informative and important features to enhance the performance of partial label learning. PLFS constructs an adaptive weighted graph to exploit the similarity information among instances, differentiate the label space and weight the feature space, which leads to the selection of a proper feature subset. Extensive experiments over a broad range of benchmark data sets clearly validate the effectiveness of our proposed feature selection approach.

关键词： Feature extraction Supervised learning Training knowledge engineering Labeling Classification algorithms Big data

来源：评论

学校读者我要写书评

暂无评论

Automatic Fusion for Multimodal Entity Alignment: A New Perspective from Automatic Architecture Search

Automatic Fusion for Multimodal Entity Alignment: A New Pers...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Chenyang Bu Yunpeng Hong Shiji Zang Guojie Chang Xindong Wu Key Laboratory of Knowledge Engineering With Big Data (the Ministry of Education of China) School of Computer Science and Engineering HeFei University of Technology

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Integrating multimodal data from diverse sources is crucial for enhancing various applications. Multimodal entity alignment (MMEA), which discovers equivalent entities across different sources and modalities, aims to eliminate data silos for comprehensive integration. A key challenge in MMEA is effectively fusing vector representations from different modalities of the same entity for optimal entity matching. Existing fusion methods involve individual fusion operators (e.g., concatenation and summation) or the manual design of complex network structures, incurring significant human resource costs. In this paper, for the first time, we introduce the research question of automatic fusion for MMEA and propose an efficient approach from the perspective of automated architecture search. Experimental comparisons with state-of-the-art methods on real-world datasets demonstrate the effectiveness of the proposed approach.

关键词： Costs Search methods Complex networks Vectors

来源：评论

学校读者我要写书评

暂无评论

A Part-of-Speech Tagging Model Employing Word Clustering and Syntactic Parsing

引用

Chinese Journal of Electronics 2025年第1期23卷 109-114页

作者： Lichi Yuan School of Information Technology Jiangxi University of Finance and Economics Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

Part-Of-Speech tagging is a basic task in the field of natural language processing. This paper builds a POS tagger based on improved Hidden Markov model, by employing word clustering and syntactic parsing model. Firstly, In order to overcome the defects of the classical HMM, Markov family model (MFM), a new statistical model was introduced. Secondly, to solve the problem of data sparseness, we propose a bottom-to-up hierarchical word clustering algorithm. Then we combine syntactic parsing with part-of-speech tagging. The Part-of-Speech tagging experiments show that the improved Part-Of-Speech tagging model has higher performance than Hidden Markov models (HMMs) under the same testing conditions, the precision is enhanced from 94.642% to 97.235%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Measuring China's Real Estate Financial Innovation from the Perspective of Government,Enterprises and the Public:Index Compilation and Its Spatial-Temporal Characteristics Analysis

引用

Journal of Systems Science and Information 2023年第1期11卷 1-34页

作者： Jichang DONG Lijun YIN Xiaoting LIU Xiuting LI School of Economics and Management University of Chinese Academy of SciencesBeijing 100190China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of SciencesBeijing 100190China China Construction Second Engineering Bureau Co.Ltd Beijing 100070China

In recent years,China has witnessed the rapid development in housing finance,and there have emerged constantly real estate finance innovations;however,there exists no relevant index for measuring the innovations of China's real estate *** on the perspectives of the governments,enterprises and the public,this paper constructs the"innovation index of real estate finance"on a quarterly basis from 2009 to 2019,with the method of empowerment which combines the subjective method(analytic hierarchy process)and the objective one(range coefficient method).It clearly and concretely depicts the innovations in housing finance and the related temporal-spatial characteristics in China since the outbreak of the financial crisis in *** index covers 30 provinces,autonomous regions and municipalities directly under the central government,and analyzes its temporal and spatial *** findings show that there exist a strong spatial autocorrelation and a big regional difference in innovations.

关键词： governments enterprises public real estate finance innovation

来源：评论

学校读者我要写书评

暂无评论

SLMP: A Scientific Literature Management Platform Based on Large Language Models 15

SLMP: A Scientific Literature Management Platform Based on L...

引用

15th IEEE International Conference on knowledge Graph, ICKG 2024

作者： Guo, Menghao Jiang, Jinling Wu, Fan Sun, Shanxin Zhang, Chen Li, Wenhui Sun, Zeyi Chen, Guangyong Wu, Xindong Research Center for Life Sciences Computing Zhejiang Lab Hangzhou China Research Center for Data Hub and Security Zhejiang Lab Hangzhou China Research Center for High Efficiency Computing System Zhejiang Lab Hangzhou China Hefei University of Technology Key Laboratory of Knowledge Engineering With Big Data Hefei China

ISBN: (纸本)9798331508821

This paper presents a Scientific Literature Management Platform (SLMP, demo link1 ) based on large language models (LLMs). The platform consists of four modules: literature management, literature extraction, literature retrieval, and question answering. The core techniques used to support the four modules across the platform include a fine-tuned model PaperExtractGPT and a continual pre-training model ChatPaperGPT based on ChatGLM2 using the data from scientific research literature, responsible for information extraction and communication, respectively. Due to their powerful capabilities in natural language understanding and generation, LLMs can understand complex scientific concepts based on the provided contexts, and thus generate high-quality texts and conduct in-depth information retrieval and question answering. Our platform can help researchers manage and utilize literature more effectively and efficiently for finding relevant literature, obtaining required information, and generating new knowledge. © 2024 IEEE.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

Enabling Efficient NVM-Based Text Analytics without Decompression

Enabling Efficient NVM-Based Text Analytics without Decompre...

引用

International Conference on data engineering

作者： Xiaokun Fang Feng Zhang Junxiang Nong Mingxing Zhang Puyun Hu Yunpeng Chai Xiaoyong Du Key Laboratory of Data Engineering and Knowledge Engineering (MOE) and School of Information Renmin University of China Department of Computer Science and Engineering Tsinghua University

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Text analytics directly on compression (TADOC) is a promising technology designed for handling big data analytics. However, a substantial amount of DRAM is required for high performance, which limits its usage in many important scenarios where the capacity of DRAM is limited, such as memory-constrained systems. Non-volatile memory (NVM) is a novel storage technology that combines the advantage of reading per-formance and byte addressability of DRAM with the durability of traditional storage devices like SSD and HDD. Unfortunately, no research demonstrates how to use NVM to reduce DRAM utilization in compressed data analytics. In this paper, we propose N-TADOC, which substitutes DRAM with NVM while maintaining TADOC's analytics performance and space savings. Utilizing an NVM block device to reduce DRAM utilization presents two challenges, including poor data locality in traversing datasets and auxiliary data structure reconstruction on NVM. We develop novel designs to solve these challenges, including a pruning method with NVM pool management, bottom-up upper bound estimation, correspondent data structures, and persistence strategy at different levels of cost. Experimental results show that on four real-world datasets, N-TADOC achieves 2.04× performance speedup compared to the processing directly on the uncompressed data and 70.7% DRAM space saving compared to the original TADOC.

关键词： Performance evaluation Upper bound data analysis Costs Nonvolatile memory Random access memory Estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：