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

Integrity constraints in OWL ontologies based on grounded circumscription

Frontiers of Computer Science 2013年第6期7卷 812-821页

作者： Dantong OUYANG College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun 130012 China National Engineering Research Center of Geophysics Exploration Instruments Changchun 130026 China

The extensions for logic-based knowledge bases with integrity constraints are rather popular. We put forward an alternative criteria for analysis of integrity constraints in Web ontology language （OWL） ontology under the closed world assumption. According to this criteria, grounded circumscription is applied to define integrity constraints in OWL ontology and the satisfaction of the integrity constraints by minimizing extensions of the predicates in integrity con- straints. According to the semantics of integrity constraints, we provide a modified tableau algorithm which is sound and complete for deciding the consistency of an extended ontol- ogy. Finally, the integrity constraint validation is converted into the corresponding consistency of the extended ontology. Comparing our approach with existing integrity constraint validation approaches, we show that the results of our approach are more in accordance with user requirements than other approaches in certain cases.

关键词： semantic Web description logic ontology integrity constraints grounded circumscription

来源：评论

学校读者我要写书评

暂无评论

Boosting few-shot point cloud segmentation with intra-class correlation and iterative prototype fusion

引用

Computer Vision and Image Understanding 2025年 258卷

作者： Zhang, Xindan Li, Ying Zhang, Xinnian College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China of Information and Communication Technology Ajou University South Korea

Semantic segmentation of 3D point clouds is often limited by the challenge of obtaining labeled data. Few-shot point cloud segmentation methods, which can learn previously unseen categories, help reduce reliance on labeled datasets. However, existing methods are susceptible to correlation noise and suffer from significant discrepancies between support prototypes and query features. To address these issues, we first introduce an intra-class correlation enhancement module for filtering correlation noise driven by inter-class similarity and intra-class diversity. Second, to better represent the target classes, we propose an iterative prototype fusion module that adapts the query point cloud feature space, mitigating the problem of object variations in the support set and query set. Extensive experiments on S3DIS and ScanNet benchmark datasets demonstrate that our approach achieves competitive performance with state-of-the-art methods. © 2025 Elsevier Inc.

关键词： 3D semantic segmentation Few-shot learning

来源：评论

学校读者我要写书评

暂无评论

DeciLS-PBO: an effective local search method for pseudo-Boolean optimization

引用

Frontiers of Computer Science 2024年第5期18卷 239-241页

作者： Luyu JIANG Dantong OUYANG Qi ZHANG Liming ZHANG College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering(Ministry of Education) Jilin UniversityChangchun 130012China

1 Introduction Local search method is a rising star for solving combinatorial optimization problems in recent years,and the state-of-the-art local search-based incomplete Maximum Satisfiability(MaxSAT)solversshowpromi... 详细信息

关键词： Max optimization local

来源：评论

学校读者我要写书评

暂无评论

Research on Trust Prediction from a Sociological Perspective

引用

Journal of Computer Science & Technology 2015年第4期30卷 843-858页

作者：王英王鑫左万利 College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun 130012 China School of Computer Technology and Engineering Changehun Institute of Technology Changchun 130012 China

Trust, as a major part of human interactions, plays an important role in helping users collect reliable infor-mation and make decisions. However, in reality, user-specified trust relations are often very sparse and follow a power law distribution; hence inferring unknown trust relations attracts increasing attention in recent years. Social theories are frameworks of empirical evidence used to study and interpret social phenomena from a sociological perspective, while social networks reflect the correlations of users in real world; hence, making the principle, rules, ideas and methods of social theories into the analysis of social networks brings new opportunities for trust prediction. In this paper, we investigate how to exploit homophily and social status in trust prediction by modeling social theories. We first give several methods to compute homophily coe？cient and status coe？cient, then provide a principled way to model trust prediction mathe-matically, and propose a novel framework, hsTrust, which incorporates homophily theory and status theory. Experimental results on real-world datasets demonstrate the effectiveness of the proposed framework. Further experiments are conducted to understand the importance of homophily theory and status theory in trust prediction.

关键词： trust prediction homophily coefficient status coefficient social theory matrix factorization

来源：评论

学校读者我要写书评

暂无评论

A Simplified Rational Representation for Positive-Dimensional Polynomial Systems and SHEPWM Equations Solving

引用

Journal of Systems Science & Complexity 2017年第6期30卷 1470-1482页

作者： SHANG Baoxin ZHANG Shugong TAN Chang XIA Peng School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering (Ministry of Education) Jilin University College of Science Northeast Electric Power University College of Science Northeast Forestry University School of Mathematics Liaoning University

The paper is concerned with the improvement of the rational representation theory for solving positive-dimensional polynomial systems. The authors simplify the expression of rational representation set proposed by Tan and Zhang(2010), obtain the simplified rational representation with less rational representation sets, and hence reduce the complexity for representing the variety of a positive-dimensional ideal. As an application, the authors compute a "nearly" parametric solution for the SHEPWM problem with a fixed number of switching angles.

关键词： Positive-dimensional polynomial system solving rational univariate representation SHEPWM simplified rational representation

来源：评论

学校读者我要写书评

暂无评论

Experience Replay for Least-Squares Policy Iteration

引用

IEEE/CAA Journal of Automatica Sinica 2014年第3期1卷 274-281页

作者： Quan Liu Xin Zhou Fei Zhu Qiming Fu Yuchen Fu the School of Computer Science and Technology Soochow University the Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University the School of Computer Science and Technology Soochow University

Policy iteration,which evaluates and improves the control policy iteratively,is a reinforcement learning *** evaluation with the least-squares method can draw more useful information from the empirical data and therefore improve the data ***,most existing online least-squares policy iteration methods only use each sample just once,resulting in the low utilization *** the goal of improving the utilization efficiency,we propose an experience replay for least-squares policy iteration(ERLSPI)and prove its *** method combines online least-squares policy iteration method with experience replay,stores the samples which are generated online,and reuses these samples with least-squares method to update the control *** apply the ERLSPI method for the inverted pendulum system,a typical benchmark *** experimental results show that the method can effectively take advantage of the previous experience and knowledge,improve the empirical utilization efficiency,and accelerate the convergence speed.

关键词： Learning (artificial intelligence) Markov processes computational efficiency Convergence Least squares methods

来源：评论

学校读者我要写书评

暂无评论

Affine-periodic solutions by averaging methods

引用

Science China Mathematics 2018年第3期61卷 439-452页

作者： Jiamin Xing Xue Yang Yong Li College of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University School of Mathematics and Statistics Northeast Normal University Center for Mathematics and Interdisciplinary Sciences Northeast Normal University

This paper concerns the existence of affine-periodic solutions for perturbed affine-periodic *** kind of affine-periodic solutions has the form of x(t+T)≡Qx(t) with some nonsingular matrix Q,which may be quasi-periodic when Q is an orthogonal matrix. It can be even unbounded but x(t)/|x(t)| is quasi-periodic,like a helical line. for example x(t)=e^(at)(cos ωt, sin ωt), when Q is not an orthogonal matrix. The averaging method of higher order for finding affine-periodic solutions is given by topological degree.

关键词： affine-periodic solutions averaging method topological degree

来源：评论

学校读者我要写书评

暂无评论

Multiparticipant Federated Feature Selection Algorithm With Particle Swarm Optimization for Imbalanced Data Under Privacy Protection

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第5期4卷 1002-1016页

作者： Hu, Ying Zhang, Yong Gong, Dunwei Sun, Xiaoyan China University of Mining and Technology School of Information and Control Engineering Xuzhou221008 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China

In the real world, data describing the same learning task may be distributed in different institutions (called participants), and these participants cannot share their own data due to the need of privacy protection. How to select an optimal feature subset on the basis of ensuring the data privacy of each participant is an important and challenging topic. At the same time, data on part participants show imbalanced or even miss some classes, further increasing the difficulty of solving this kind of problem. In view of this, by introducing a trusted third party to process and integrate optimal information from participants, this article proposes a multiparticipant federated evolutionary feature selection algorithm for imbalanced data under privacy protection. First, a multilevel joint sample filling strategy with multiple participants (called sampling-rough selection-fine tuning strategy) is proposed to fill imbalanced or empty classes on each participant while ensuring data privacy. Then, a federated evolutionary feature selection method based on particle swarm optimization (PSO) is proposed by periodically sharing the optimal feature subsets obtained by PSOs on participants. Finally, the proposed algorithm is applied to 15 test datasets, and compared with several typical imbalanced feature selection algorithms and two kinds of ensemble feature selection algorithms. The experimental results show that the proposed algorithm can significantly promote the ability of each participant on processing imbalanced datasets, and improve the classification accuracy of obtained feature subsets while protecting the participants' data privacy. © 2020 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm with local search for advanced planning and scheduling

Genetic algorithm with local search for advanced planning an...

引用

3rd International Conference on Natural computation, ICNC 2007

作者： Pu, Yan Dayou, Liu Donghui, Yuan Ji, Yu Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)0769528759

In this paper, a genetic algorithm approach with a novel mutation operator based on perturbation and local search has been proposed to solve an advanced planning and scheduling (APS) model in manufacturing supply chain, in which each customer order has a due date, each operation could be performed on alternative machines. The objective is to minimize the makespan of each customer order while ensuring the due date constraints. Various sizes of numerical experiments were carried out to demonstrate the efficiency of the proposed GA and the results indicate that the presented algorithm performs much better than previous work especially in large size problems. © 2007 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

RETRACTED ARTICLE: The IDS model adapt to load characteristic under IPv6/4 environment

RETRACTED ARTICLE: The IDS model adapt to load characteristi...

引用

2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008

作者： Wei, Chuyi Fang, Zhiyi Li, Wei Liu, Xiaonan Yang, Hongjun Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (纸本)9781424421084

Thih paper proposed an intrusion detection system framework adapt to load characteristic under IPv6/4 environment; it uses decision-tree-based classification method, under guidance of a certain flow, creates dynamically rule matching tree adapt to load characteristic, reduces greatly the rule set that per packet or event need to be detected, improves the detection efficiency, can be utilized to solve the high packetloss problem; this paper proposed to make use of Petri net to built a mode to the complicated aggressive behavior, form the complicated aggressive rule library, improve the detection accuracy rate; in view of IPv6 security problem, make use of Snort rule description language, construct the detection rule under IPv6 environment; finally construct the platform in the local area network, carry on the simulation experiment. The experiment proved fully the feasibility and validity of intrusion detective method adapt to load characteristic under IPv6/4 environment. © 2008 IEEE.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：