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

Context-Aware Semantic Type Identification for Relational Attributes

Journal of Computer Science & Technology 2023年第4期38卷 927-946页

作者：丁玥郭雨荷卢卫李海翔张美慧李晖潘安群杜小勇 Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Renmin University of China Beijing 100872China School of Information Renmin University of ChinaBeijing 100872China Tencent(Beijing)Technology Company Limited Beijing 100080China School of Computer Science and Technology Beijing Institute of TechnologyBeijing 100081China College of Computer Science and Technology Guizhou UniversityGuiyang 550025China Tencent(Shenzhen)Technology Company Limited Shenzhen 518057China

Identifying semantic types for attributes in relations,known as attribute semantic type(AST)identification,plays an important role in many data analysis tasks,such as data cleaning,schema matching,and keyword search in ***,due to a lack of unified naming standards across prevalent information systems(*** islands),AST identification still remains as an open *** tackle this problem,we propose a context-aware method to figure out the ASTs for relations in this *** transform the AST identification into a multi-class classification problem and propose a schema context aware(SCA)model to learn the representation from a collection of relations associated with attribute values and schema *** on the learned representation,we predict the AST for a given attribute from an underlying relation,wherein the predicted AST is mapped to one of the lab.led *** improve the performance for AST identification,especially for the case that the predicted semantic types of attributes are not included in the lab.led ASTs,we then introduce knowledge base embeddings(***)to enhance the above representation and construct a schema context aware model with knowledge base enhanced(SCA-KB)to get a stable and robust *** experiments based on real datasets demonstrate that our context-aware method outperforms the state-of-the-art approaches by a large margin,up to 6.14%and 25.17%in terms of macro average F1 score,and up to 0.28%and 9.56%in terms of weighted F1 score over high-quality and low-quality datasets respectively.

关键词： attribute semantic type(AST)identification context-aware semantic embedding knowledge base embedding

来源：评论

学校读者我要写书评

暂无评论

An Efficient Customized Blockchain System for Inter-Organizational Processes

An Efficient Customized Blockchain System for Inter-Organiza...

引用

2023 IEEE International Conference on Web Services, ICWS 2023

作者： Wang, Puwei Sun, Zhouxing Li, Rui Chen, Jinchuan Gong, Ping Du, Xiaoyong Renmin University of China School of Information China Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China Renmin University of China School of Mathematics China Fujian Normal University College of Computer and Cyber Security China

ISBN: (纸本)9798350304855

Blockchain technologies pave a promising way for implementing the inter-organizational processes. Most of the current research works translate the execution logic in the process models into the smart contracts, which can run independently on the blockchain without the outside process engine. However, the works usually suffer from the execution and storage costs, since the translation needs to be done when the processes are deployed. In this paper, we customize a process engine for executing the inter-organizational business processes via a blockchain-style procedure, i.e., checking the validity of transactions, adding the valid transactions into the blockchain through the consensus mechanism, and then updating the process states according to the committed transactions. And then, we build a blockchain system by embedding the customized process engine into the blockchain nodes. Moreover, in order to realize the interactions between the inter-organizational processes running on blockchain and the services outside blockchain, we propose a blockchain-based approach for service registration, binding and invocation, and design a lease-based concurrency control protocol to logically isolate transactions from each other when invoking the services simultaneously. Finally, we implement a prototype system based on a permissioned blockchain platform Hyperledger Fabric and a process engine Activiti. The experimental results show the proposed blockchain system can execute the inter-organizational processes correctly and efficiently. © 2023 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Scheduling Optimization of Coal Washing Process Based on Two-Stage Fuzzy Heuristic Algorithm 13

Scheduling Optimization of Coal Washing Process Based on Two...

引用

13th IEEE data Driven Control and Learning Systems Conference, DDCLS 2024

作者： Zhou, Hui Wang, Zhiyuan Han, Zhongyang Wang, Linqing Zhao, Jun Wang, Wei Dalian University of Technology Key Lab. of Intelligent Control and Optimization for Industrial Equipment of Ministry of Education Dalian116024 China School of Control Science and Engineering Dalian University of Technology Dalian116024 China

ISBN: (纸本)9798350361674

Coal washing and sorting plays a vital role for coal production. Reasonable scheduling of washing and sorting equipment, crushers and various coal silos in the coal washing and sorting process can effectively increase the total value of product coal and reduce the total energy consumption of equipment. In this paper, a multi-constrained nonlinear mixed integer programming model considering the start and stop of each equipment in the washing process is established to realize the specific regulation of the washing process. In order to overcome the problem such as local convergence when solving high-dimensional space problems, a two-stage fuzzy heuristic algorithm is proposed in this paper. In the first stage, a variety of population genetic algorithms based on fuzzy adaptive strategy control are designed for global search to establish an elite population bank to preserve high-quality individuals produced by various groups. In the second stage, an improved simulated annealing algorithm is used to perform a local search with a backtracking process on specific neighbors of individuals in the elite population bank, which can improve the stability of the algorithm and reduce the situation of falling into local convergence. Then the real data of a Chinese coal mining company was used for experiments, where the proposed algorithm is compared with other commonly used methods. The experimental results demonstrate that the proposed algorithm can increase the total coal value of the washed product by at least 1.7% compared to other algorithms, and the average total number of starts and stops of the equipment is reduced by about 7.3%, which are effectively beneficial for the related enterprise. © 2024 IEEE.

关键词： Coal mines

来源：评论

学校读者我要写书评

暂无评论

Feature Enhancement for Multi-modal Entity Alignment Transformer

Feature Enhancement for Multi-modal Entity Alignment Transfo...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Zewen Deng Zan Zhang Bingbing Dong Xiulin Zheng Xindong Wu 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 China

ISBN: (数字)9798331508821

ISBN: (纸本)9798331508838

Multi-modal entity alignment (MMEA) aims to identify equivalent entities across different multi-modal knowledge graphs. In these graphs, entities are enriched with information from various modalities, such as text, images, and numerical data, making the alignment task both challenging and crucial for improving knowledge graph quality. Current MMEA algorithms typically encode entity information separately for each modality using corresponding encoders, and then integrate these representations through various modal fusion strategies. However, these methods often fail to fully exploit the multi-modal information of entities. To address this issue, we propose a feature-enhanced multi-modal entity alignment transformer (FEMEAT). FEMEAT enhances entity attribute information by incorporating modal distribution data, which captures the inherent distribution of different modalities for each entity. This inclusion allows the model to have a richer understanding of entity characteristics across modalities. Additionally, FEMEAT utilizes an Optical Character Recognition (OCR) model to extract and incorporate textual information from images. By integrating this text extracted from images, the model can better utilize the visual modality, enhancing its ability to understand and process multi-modal information. Furthermore, FEMEAT employs a multi-head cross-modal attention (MHCA) mechanism for modal fusion to achieve comprehensive multi-modal entity representation. This mechanism enables the model to attend to different modalities simultaneously and learn a detailed representation of entities by considering the interactions between modalities. The multi-head cross-modal attention mechanism facilitates a nuanced understanding and integration of multi-modal data. Experimental results demonstrate that our model achieves state-of-the-art (SOTA) performance across various training scenarios. The code and datasets used in this study can be accessed at https://***/zewenD/FEMEAT.

关键词： Training Visualization Attention mechanisms Optical character recognition Noise knowledge graphs Transformers Robustness Numerical models data mining

来源：评论

学校读者我要写书评

暂无评论

High Dynamic Collab.rative Team Query via Multi-Fuzzy-Constrained Graph Pattern Matching

High Dynamic Collaborative Team Query via Multi-Fuzzy-Constr...

引用

IEEE International Conference on Cloud Computing and Big data Analysis (ICCCBDA)

作者： Tao Hu Zan Zhang Chenyang Bu Lei Li 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 China

ISBN: (数字)9798350373554

ISBN: (纸本)9798350373561

Graph pattern matching is a technique widely used in various fields such as protein structure analysis, social group querying, and expert localization. This technique involves finding matching subgraphs in large social networks that align with the patterns specified in the pattern graph. In this paper, we focus on a specific sub-problem in social group querying, known as the cooperative team query, which arises from practical applications, where the nodes in the pattern graph and the data graph represent team member entities, while the edges represent their social relationships. We note that the requirements of many teams in the real world are dynamic, necessitating iterative computation for graph pattern matching using traditional methods. To address this challenge in highly dynamic systems, we propose a graph pattern matching method based on core pattern graph matching cache. This approach involves extracting the core pattern graph, and comprising core team members based on the characteristics of cooperative teams. The core graph-based matching cache enables the second half of the algorithm to operate on an order-of-magnitude smaller graph, significantly improving efficiency. Additionally, the multi-threaded approach fully leverages hardware resources, synchronizing multiple matching result of the core pattern graph to reduce matching time. Experimental results on three real social network datasets demonstrate that our proposed algorithm, Core Pattern Graph Matching Cache-based Multi-threaded Exploration (CCMTE), significantly outperforms existing methods in terms of efficiency.

关键词： Proteins Location awareness Social networking (online) Social groups Heuristic algorithms knowledge graphs Hardware

来源：评论

学校读者我要写书评

暂无评论

A compact broadband amplifier for 5G FR2 in 65nm CMOS

A compact broadband amplifier for 5G FR2 in 65nm CMOS

引用

2023 International Applied Computational Electromagnetics Society Symposium, ACES-China 2023

作者： Wu, Qingyan Wen, Jincai School of Electronics and Information Engineering Hangzhou Dianzi University Hangzhou China Ministry of Education Hangzhou Dianzi University Key Lab. of Rf Circuits and Systems Hangzhou China

ISBN: (纸本)9781733509657

In this paper, a compact broadband amplifier is realized based on 65nm CMOS technology. The three differential CMOS pairs adopt the common source (CS) structure, rely on the capacitance neutralization technology and use the transformer for impedance transformation to achieve ultra-wideband matching. The simulation results show that in FR2 frequency band (24.26 - 52.6GHz), the output gain of the amplifier is 17±2.5dB, the DC power consumption is 45mW, the supply voltage is 1V, and the core circuit area is 0.11mm2. © 2023 Applied Computational Electromagnetics Society (ACES).

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

Efficient Mobile Deployment of Lightweight CNN-Transformer Model for Crop Disease Diagnosis in Smart Agriculture 4

Efficient Mobile Deployment of Lightweight CNN-Transformer M...

引用

4th Asia Conference on Information engineering, ACIE 2024

作者： Lv, Zirong China University of Geosciences Hubei Key Lab. of Adv. Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education School of Automation Wuhan China

ISBN: (纸本)9798350371925

Crop disease diagnosis is of great significance for crop yield and agricultural production. Deep learning methods have become a major research direction for solving crop disease diagnosis. However, recent studies have shown that deploying complex neural network models on mobile devices poses a significant challenge to mobile hardware performance. To address this issue, this paper proposes a lightweight network model based on the Transformer and deploys it on mobile devices. Compared to other lightweight network models, our approach significantly reduces computational complexity using Transformer modules and exhibits a particular advantage in recognition accuracy. It achieves a recognition rate of 97.76% for ten categories of tomato diseases, while the model size is only 3.86 MB. Furthermore, we deploy the model on embedded devices and apply it to tomato crop recognition, enabling farmers to monitor crop conditions in real-time and realizing smart agriculture. © 2024 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

knowledge-augmented Self-training of A Question Rewriter for Conversational knowledge Base Question Answering

Knowledge-augmented Self-training of A Question Rewriter for...

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Ke, Xirui Zhang, Jing Lv, Xin Xu, Yiqi Cao, Shulin Li, Cuiping Chen, Hong Li, Juanzi School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education China Department of Computer Science and Technology Tsinghua University Beijing China

The recent rise of conversational applications such as online customer service systems and intelligent personal assistants has promoted the development of conversational knowledge base question answering (ConvKBQA). Different from the traditional single-turn KBQA, ConvKBQA usually explores multi-turn questions around a topic, where ellipsis and coreference pose great challenges to the single-turn KBQA systems which require self-contained questions. In this paper, we propose a rewrite- and-reason framework to first produce a full-fledged rewritten question based on the conversation history and then reason the answer by existing single-turn KBQA models. To overcome the absence of the rewritten supervision signals, we introduce a knowledge-augmented self-training mechanism to transfer the question rewriter from another dataset to adapt to the current knowledge base. Our question rewriter is decoupled from the subsequent QA process, which makes it easy to be united with either retrieval-based or semantic parsing-based KBQA models. Experiment results demonstrate the effectiveness of our method and a new state-of-the-art result is achieved. The code and dataset are availab.e online now. © 2022 Association for Computational Linguistics.

关键词： knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

Anatomical Prior Guided Spatial Contrastive Learning for Few-Shot Medical Image Segmentation 24

Anatomical Prior Guided Spatial Contrastive Learning for Few...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Huang, Wendong Hu, Jinwu Bi, Xiuli Xiao, Bin Chongqing Key Laboratory of Image Cognition Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Post and Telecommunications Chongqing China Pazhou Lab School of Software Engineering South China University of Technology Guangzhou China

ISBN: (纸本)9798400706868

Few-shot semantic segmentation has considerable potential for low-data scenarios, especially for medical images that require expert-level dense annotations. Existing few-shot medical image segmentation methods strive to deal with the task by means of prototype learning. However, this scheme relies on support prototypes to guide the segmentation of query images, ignoring the rich anatomical prior knowledge in medical images, which hinders effective feature enhancement for medical images. In this paper, we propose an anatomical prior guided spatial contrastive learning, called APSCL, which exploits anatomical prior knowledge derived from medical images to construct contrastive learning from a spatial perspective for few-shot medical image segmentation. The new framework forces the model to learn the features in line with the embedded anatomical representations. Besides, to fully exploit the guidance information of the support samples, we design a mutual guidance decoder to predict the lab.l of each pixel in the query image. Furthermore, our APSCL can be trained end-to-end in the form of episodic training. Comprehensive experiments on three challenging medical image datasets, i.e., CHAOS-T2, MS-CMRSeg, and Synapse, prove that our method significantly surpasses state-of-the-art few-shot medical segmentation methods, with a mean improvement of 3.61%, 2.30%, and 6.38% on the Dice score, respectively. © 2024 ACM.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Throughput-oriented associated transaction assignment in sharding blockchains for IoT social data storage

引用

Digital Communications and Networks 2022年第6期8卷 885-899页

作者： Liping Tao Yang Lu Xu Ding Yuqi Fan Jung Yoon Kim School of Computer Science and Information Engineering Hefei University of TechnologyHefei230009China Engineering Research Center of Safety Critical Industrial Measurement and Control Technology Ministry of EducationHefei University of TechnologyHefei230009China Institute of Industry&Equipment Technology Hefei University of TechnologyHefei230009China Key Laboratory of Knowledge Engineering with Big Data(Hefei University of Technology) Ministry of EducationHefei230009China Graduate School of Game Gachon UniversitySeongnam-Si461-701South Korea

Blockchain is a viable solution to provide data integrity for the enormous volume of 5G IoT social data, while we need to break through the throughput bottleneck of blockchain. Sharding is a promising technology to solve the problem of low throughput in blockchains. However, cross-shard communication hinders the effective improvement of blockchain throughput. Therefore, it is critical to reasonably allocate transactions to different shards to improve blockchain throughput. Existing research on blockchain sharding mainly focuses on shards formation, configuration, and consensus, while ignoring the negative impact of cross-shard communication on blockchain throughput. Aiming to maximize the throughput of transaction processing, we study how to allocate blockchain transactions to shards in this paper. We propose an Associated Transaction assignment algorithm based on Closest Fit (ATCF). ATCF classifies associated transactions into transaction groups which are then assigned to different shards in the non-ascending order of transaction group sizes periodically. Within each epoch, ATCF tries to select a shard that can handle all the transactions for each transaction group. If there are multiple such shards, ATCF selects the shard with the remaining processing capacity closest to the number of transactions in the transaction group. When no such shard exists, ATCF chooses the shard with the largest remaining processing capacity for the transaction group. The transaction groups that cannot be completely processed within the current epoch will be allocated in the subsequent epochs. We prove that ATCF is a 2-approximation algorithm for the associated transaction assignment problem. Simulation results show that ATCF can effectively improve the blockchain throughput and reduce the number of cross-shard transactions.

关键词： IoT social data Blockchain Shar ding Associated transactions Transaction assi gnment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：