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

Arithmetic Expression Evaluations with Membranes

Chinese Journal of Electronics 2014年第1期23卷 55-60页

作者： GUO Ping CHEN Haizhu ZHENG Hui College of Computer Science Chongqing University Chongqing Key Laboratory of Software Theory and Technology Department of Software Engineering Chongqing College of Electronic Engineering

Arithmetic operations and expression evaluations are fundamental in computing models. This paper firstly designs arithmetic membranes without priority rules for basic arithmetic operations, and then proposes an algorithm to construct expression P systems based on several of such membranes after designing synchronous and asynchronous transmission strategies among the *** any arithmetic expression, an expression P system can be built to evaluate it effectively. Finally, we discuss different parallelism strategies through which different expression P systems can be built for an arithmetic expression.

关键词： Membrane computing Cell-like P systems Arithmetic operations Expression P systems

来源：评论

学校读者我要写书评

暂无评论

Diff-Reg v2: Diffusion-Based Matching Matrix Estimation for Image Matching and 3D Registration

arXiv

引用

arXiv 2025年

作者： Wu, Qianliang Jiang, Haobo Ding, Yaqing Luo, Lei Xie, Jin Yang, Jian PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education China School of Computer Science and Engineering Nanjing University of Science and Technology China Nanyang Technological University Singapore Visual Recognition Group Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic State Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Intelligence Science and Technology Nanjing University Suzhou China

Establishing reliable correspondences is crucial for all registration tasks, including 2D image registration, 3D point cloud registration, and 2D-3D image-to-point cloud registration. However, these tasks are often complicated by challenges such as scale inconsistencies, symmetry, and large deformations, which can lead to ambiguous matches. Previous feature-based and correspondence-based methods typically rely on geometric or semantic features to generate or polish initial potential correspondences. Some methods typically leverage specific geometric priors, such as topological preservation, to devise diverse and innovative strategies tailored to a given enhancement goal, which cannot be exhaustively enumerated. Additionally, many previous approaches rely on a single-step prediction head, which can struggle with local minima in complex matching scenarios. To address these challenges, we introduce an innovative paradigm that leverages a diffusion model in matrix space for robust matching matrix estimation. Our model treats correspondence estimation as a denoising diffusion process in the matching matrix space, gradually refining the intermediate matching matrix to the optimal one. Specifically, we apply the diffusion model in the doubly stochastic matrix space for 3D-3D and 2D-3D registration tasks. In the 2D image registration task, we deploy the diffusion model in a matrix sub-space, where dual-softmax projection regularization is applied. For all three registration tasks, we provide adaptive matching matrix embedding implementations tailored to the specific characteristics of each task while maintaining a consistent"match-to-warp" encoding pattern. Furthermore, we adopt a lightweight design for the denoising module. In inference, once points or image features are extracted and fixed, this module performs multi-step denoising predictions through reverse sampling. Evaluations on both 2D and 3D registration tasks demonstrate the effectiveness of our approach. Copyrigh

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Evaluating Logical Expressions by Membrane Systems

引用

Chinese Journal of Electronics 2014年第2期23卷 278-283页

作者： GUO Ping JI Jinfang CHEN Haizhu LIU Ran College of Computer Science Chongqing University Chongqing Key Laboratory of Software Theory and Technology Department of Software Engineering Chongqing College of Electronic Engineering

Boolean and relational operations, which are defined for solving mathematically logical problems,are always required in computing models. Membrane computing is a kind of distributed parallel computing *** this paper, we design different membranes for implementing primary Boolean and relational operations respectively. And based on these membranes, a membrane system can be constructed by a present algorithm for evaluating a logical expression. Some examples are given to illustrate how to perform the Boolean, relational operations and evaluate the logical expression correctly in these membrane systems.

关键词： Boolean operation Relational operation Logical expression Membrane computing P systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive Perception for Unified Visual Multi-modal Object Tracking

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年

作者： Hu, Xiantao Zhong, Bineng Liang, Qihua Shi, Liangtao Mo, Zhiyi Tai, Ying Yang, Jian Guangxi Normal University Guangxi Key Lab of Multi-Source Information Mining Guilin541004 China Guangxi Normal University Security Guilin541004 China Guangxi Normal University Intelligent Technology Guilin541004 China Guangxi Normal University Ministry of Education Guilin541004 China Wuzhou University School of Data Science Wuzhou543002 China Wuzhou University Software Engineering Wuzhou543002 China Nanjing University State Key Laboratory for Novel Software Technology Suzhou215163 China Nanjing University of Science and Technology School of Computer Science Nanjing210094 China Nanjing University of Science and Technology Engineering Nanjing210094 China

Recently, many multi-modal trackers prioritize RGB as the dominant modality, treating other modalities as auxiliary, and fine-tuning separately various multi-modal tasks. This imbalance in modality dependence limits the ability of methods to dynamically utilize complementary information from each modality in complex scenarios, making it challenging to fully perceive the advantages of multi-modal. As a result, a unified parameter model often underperforms in various multi-modal tracking tasks. To address this issue, we propose APTrack, a novel unified tracker designed for multi-modal adaptive perception. Unlike previous methods, APTrack explores a unified representation through an equal modeling strategy. This strategy allows the model to dynamically adapt to various modalities and tasks without requiring additional fine-tuning between different tasks. Moreover, our tracker integrates an adaptive modality interaction (AMI) module that efficiently bridges cross-modality interactions by generating learnable tokens. Experiments conducted on five diverse multi-modal datasets (RGBT234, LasHeR, VisEvent, DepthTrack, and VOT-RGBD2022) demonstrate that APTrack not only surpasses existing state-of-the-art unified multi-modal trackers but also outperforms trackers designed for specific multi-modal tasks. © 2020 IEEE.

关键词： Multicarrier modulation

来源：评论

学校读者我要写书评

暂无评论

BERT4Anno: An annotation misuse detection method for Java

引用

Information and software Technology 2025年 184卷

作者： Yang, Jingbo Ji, Xin Wu, Wenjun Liao, Xingchuang Zhang, Kui Dong, Linxiao Xiang, Nan Jian, Ren School of Computer Science and Engineering Beihang University China State Key Laboratory of Complex and Critical Software Environment Beihang University China State Grid Nanjing Power Supply Company China Institute of Artificial Intelligence Beihang University China Hangzhou International Innovation Institute Beihang University China

Context: Developers leverage Java annotations to implement functions such as creating objects and operating databases. However, mastering annotations is challenging, and misused annotations might cause an application to crash. Although state-of-the-art techniques attempt to solve this problem, they do not provide conclusions on Java annotation misuse types, nor do they leverage project-level information, which results in low efficiency in detecting annotation misuses. Objective: To summarize Java annotation misuse types and provide a more efficient method for detecting misused annotations. Method: Firstly, to categorize Java annotation misuses, we conduct an empirical study and curate 321 annotation misuse questions from Stack Overflow. Secondly, to better detect these misuses, we propose a BERT-based method, BERT4Anno, which takes project structure and resource configuration into account—factors often neglected by state-of-the-art methods. In BERT4Anno, a novel Annotation Usage Project Representation (AUPR) technique is designed to leverage the information of the interconnections among source code, configuration and project structure. Moreover, an AUPR-based Named Entity Recognition (ANER) task by fine-tuning BERT is devised to learn annotation usage knowledge. With the knowledge, the fine-tuned model can detect misused annotations. Finally, to evaluate our proposed method, two datasets, mainly curated from GitHub and comprising 404 Java projects/files with annotation misuse instances, are used for the experiments. Results: The Java annotation misuses are categorized into 14 types based on how the curated questions violate the correct annotation usage knowledge. The comparison experiment demonstrates the superior performance of our method over state-of-the-art baselines in terms of precision, recall, and F1 score, while our visualization technique provides insightful interpretations of the mechanism underlying the model's outperformance. Conclusion: By leveraging t

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Leveraging Auxiliary Knowledge for Web Service Clustering

引用

Chinese Journal of Electronics 2016年第5期25卷 858-865页

作者： TIAN Gang WANG Jian HE Keqing SUN Cheng'ai State Key Laboratory of Software Engineering School of Computer Wuhan University College of Information and Science Engineering Shandong University of Science and Technology

By grouping Web services that share similar functionalities, Web service clustering can greatly enhance Web service discovery and selection. Most existing clustering techniques are designed to handle long text documents. However, the descriptions of most publicly available Web services are in the form of short text, which impairs the quality of service clustering due to the sparseness of useful information. Towards this issue, we propose a new service clustering approach based on transfer learning from auxiliary long text data obtained from *** handle the inconsistencies in semantics and topics between service descriptions and auxiliary data, we introduce a novel topic model – Tag aided dual Author topical model(TD-ATM), which jointly learns two sets of topics on the two data sets and automatically couples the topic parameters to avoid the potential inconsistencies between these two data sets. Experimental results show the proposed approach outperforms several existing Web service clustering approaches.

关键词： Web service clustering Tags Topic model Transfer learning

来源：评论

学校读者我要写书评

暂无评论

An Access Control Framework for Reflective Middleware

引用

Journal of computer Science & Technology 2008年第6期23卷 895-904页

作者：黄罡孙连山 Key Laboratory of High Confidence Software Technologies Ministry of Education School of Electronics Engineering and Computer Science Peking University

Reflective middleware opens up the implementation details of middleware platform and applications at runtime for improving the adaptability of middleware-based systems. However, such openness brings new challenges to access control of the middleware-based systems. Some users can access the system via reflective entities, which sometimes cannot be protected by access control mechanisms of traditional middleware. To deliver high adaptability securely, reflective middleware should be equipped with proper access control mechanisms for potential access control holes induced by reflection. One reason of integrating these mechanisms in reflective middleware is that one goal of reflective middleware is to equip applications with reflection capabilities as transparent as possible. This paper studies how to design a reflective J2EE middleware -- PKUAS with access control in mind. At first, a computation model of reflective system is built to identify all possible access control points induced by reflection. Then a set of access control mechanisms, including the wrapper of MBeans and a hierarchy of Java class loaders, are equipped for controlling the identified access control points. These mechanisms together with J2EE access control mechanism form the access control framework for PKUAS. The paper evaluates the security and the performance overheads of the framework in quality and quantity.

关键词： reflective middleware access control J2EE

来源：评论

学校读者我要写书评

暂无评论

ForkXplorer:an approach of fork summary generation

引用

Frontiers of computer Science 2022年第2期16卷 1-15页

作者： Zhang ZHANG Xinjun MAO Chao ZHANG Yao LU Key Laboratory of Software Engineering for Complex Systems College of ComputerNational University of Defense TechnologyChangsha 410073China

Pull-based development has become an important paradigm for distributed software *** this model,each developer independently works on a copied repository(i.e.,a fork)from the central *** is essential for developers to maintain awareness of the state of other forks to improve collaboration *** this paper,we propose a method to automatically generate a summary of a *** first use the random forest method to generate the label of a fork,i.e.,feature implementation or a bug *** on the information of the fork-related commits,we then use the TextRank algorithm to generate detailed activity information of the ***,we apply a set of rules to integrate all related information to construct a complete fork *** validate the effectiveness of our method,we conduct 30 groups of manual experiment and 77 groups of case studies on *** propose Fea_(avg)to evaluate the performance of Fea_(avg)the generated fork summary,considering the content accuracy,content integrity,sentence fluency,and label extraction *** results show that the average of of the fork summary generated by this method is *** than 63%of project maintainers and the contributors believe that the fork summary can improve development efficiency.

关键词： open source software pull-based development fork summary distributed cooperative development

来源：评论

学校读者我要写书评

暂无评论

NewBalance: Efficient Data Space Management and Algorithmic Optimization for Large-Scale Storage Systems

引用

Chinese Journal of Electronics 2017年第3期26卷 493-501页

作者： XU Guangping LIN Sheng SHI Kai ZHANG Hua Tianjin Key Laboratory of Intelligence Computing and New Software Technology Computer and Communication Engineering School Tianjin University of Technology

Fragmentation usually occurs when data space of original storage nodes has to be reallocated to new added storage nodes during the scale-out evolution of the large-scale storage *** greatly influences its performance and becomes a challenge to manage the whole *** present an efficient space management framework,called New Balance,to reduce fragmentation with the minimum data movement while keeping the storage system load *** space management framework has two phases including the collection phase and the allocation *** the collection phase,we propose a novel algorithm,called the greedy bi-direction collector,which collects enough space for the new storage *** the allocation phase,we formally represent it as a variant of the bin packing problem and then utilize some bin packing heuristics including the first fitting and the best fitting to allocate collected intervals to new added storage *** experimental results show that the amount of intervals can be reduced by 20%;5%and our algorithmic optimization improves the data lookup performance by at least 10%and the scale-out performance by 2X;X.

关键词： Large-scale storage systems Space management Algorithmic optimization Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

A general framework for computing maximal contractions

引用

Frontiers of computer Science 2013年第1期7卷 83-94页

作者： Jie LUO State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing 100191 China

This paper investigates the problem of computing all maximal contractions of a given formula set F with re- spect to a consistent set A of atomic formulas and negations of atomic formulas. We first give a constructive definition of minimal inconsistent subsets and propose an algorithmic framework for computing all minimal inconsistent subsets of any given formula set. Then we present an algorithm to com- pute all maximal contractions from minimal inconsistent sub- sets. Based on the algorithmic framework and the algorithm, we propose a general framework for computing all maximal contractions. The computability of the minimal inconsistent subset and maximal contraction problems are discussed. Fi- nally, we demonstrate the ability of this framework by apply- ing it to the first-order language without variables and design an algorithm for the computation of all maximal contractions.

关键词： maximal contraction minimal inconsistent sub- set computability algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：