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

Science China(Technological Sciences) 1996年第1期39卷 1-10页

作者：程晓春姜云飞刘叙华 Open Lab for Symbolic Computation and Knowledge Engineering Department of Computer ScienceJilin UniversityChangchun 130023China

Dialectic operator fuzzy logic (DOFL) is presented which is relevant,paraconsistent and *** can vividly describe the belief revision in the cognitive process and can infer reasonably well while the knowledge is incons... 详细信息

关键词： operator fuzzy logic relevant logic nonmonotonic logic paraconsistent logic.

来源：评论

学校读者我要写书评

暂无评论

Science Letters:Model for cascading failures in congested Internet

引用

Journal of Zhejiang University-Science A(Applied Physics & engineering) 2008年第10期9卷 1331-1335页

作者： Jian WANG Yan-heng LIU Jian-qi ZHU Yu JIAO Key Lab of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun 130012 China

Cascading failures often occur in congested networks such as the Internet. A cascading failure can be described as a three-phase process： generation, diffusion, and dissipation of the congestion. In this account, we present a function that represents the extent of congestion on a given node. This approach is different from existing fimctions based on betweenness centrality. By introducing the concept of ＇delay time＇, we designate an intergradation between permanent removal and nonremoval. We also construct an evaluation fimction of network efficiency, based on congestion, which measures the damage caused by cascading failures. Finally, we investigate the effects of network structure and size, delay time, processing ability and packet generation speed on congestion propagation. Also, we uncover the relationship between the cascade dynamics and some properties of the network such as structure and size.

关键词： Complex network Cascading failures Congestion effects Propagation model

来源：评论

学校读者我要写书评

暂无评论

Meta-GPS++: Enhancing Graph Meta-Learning with Contrastive Learning and Self-Training

引用

ACM Transactions on knowledge Discovery from Data 2024年第9期18卷 1-30页

作者： Liu, Yonghao Li, Mengyu Li, Ximing Huang, Lan Giunchiglia, Fausto Liang, Yanchun Feng, Xiaoyue Guan, Renchu Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China University of Trento Trento Italy Zhuhai Lab. of the Key Lab. of Symbolic Computation and Knowledge Eng. of the Ministry of Education Zhuhai College of Science and Technology Zhuhai China

Node classification is an essential problem in graph learning. However, many models typically obtain unsatisfactory performance when applied to few-shot scenarios. Some studies have attempted to combine meta-learning with graph neural networks to solve few-shot node classification on graphs. Despite their promising performance, some limitations remain. First, they employ the node encoding mechanism of homophilic graphs to learn node embeddings, even in heterophilic graphs. Second, existing models based on meta-learning ignore the interference of randomness in the learning process. Third, they are trained using only limited labeled nodes within the specific task, without explicitly utilizing numerous unlabeled nodes. Finally, they treat almost all sampled tasks equally without customizing them for their uniqueness. To address these issues, we propose a novel framework for few-shot node classification called Meta-GPS. Specifically, we first adopt an efficient method to learn discriminative node representations on homophilic and heterophilic graphs. Then, we leverage a prototype-based approach to initialize parameters and contrastive learning for regularizing the distribution of node embeddings. Moreover, we apply self-Training to extract valuable information from unlabeled nodes. Additionally, we adopt S (scaling and shifting) transformation to learn transferable knowledge from diverse tasks. The results on real-world datasets show the superiority of Meta-GPS. Our code is available here. © 2024 Copyright held by the owner/author(s).

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Extracting a justification for OWL ontologies by critical axioms

引用

Frontiers of Computer Science 2020年第4期14卷 55-64页

作者： Yuxin YE Xianji CUI Dantong OUYANG College of Computer Science and Technology Jilin UniversityChangchun130012China Key Lab of Symbolic Computation and Knowledge Engineering(Jilin University) Ministry of EducationChangchun130012China College of Information and Communication Engineering Dalian Minzu UniversityDalian116600China

Extracting justifications for web ontology language(OWL)ontologies is an important mission in ontology *** this paper,we focus on black-box techniques which are based on ontology *** creating a recursive expansion procedure,all elements which are called critical axioms in the justification are explored one by *** this detection procedure,an axiom selection function is used to avoid testing irrelevant *** addition,an incremental reasoning procedure has been proposed in order to substitute series of standard reasoning tests *** is implemented by employing a pseudo model to detect“obvious”satisfiability *** experimental results show that our proposed strategy for extracting justifications for OWL ontologies by adopting incremental expansion is superior to traditional Black-box methods in terms of efficiency and performance.

关键词： description logics automated reasoning ontology engineering justification

来源：评论

学校读者我要写书评

暂无评论

The Discrete Approximation Problem for a Special Case of Hermite-Type Polynomial Interpolation

引用

Journal of Systems Science & Complexity 2022年第5期35卷 2004-2015页

作者： GONG Yihe JIANG Xue ZHANG Shugong College of Science Northeast Electric Power UniversityJilin 132000China School of Mathematics and Systematic Sciences Shenyang Normal UniversityShenyang 110034China Institute of Mathematics Key Lab.of Symbolic Computation and Knowledge Engineering(Ministry of Education)Jilin UniversityChangchun 130012China

Every univariate Hermite interpolation problem can be written as a pointwise limit of Lagrange ***,this property is not preserved for the multivariate *** this paper,the authors first generalize the result of *** an application,the authors consider the discrete approximation problem for a special case when the interpolation condition contains all partial derivatives of order less than n and one nth order differential *** addition,for the case of n≥3,the authors use the concept of Cartesian tensors to give a sufficient condition to find a sequence of discrete points,such that the Lagrange interpolation problems at these points converge to the given Hermite-type interpolant.

关键词： Discrete approximation problem Hermite interpolation Lagrange interpolation

来源：评论

学校读者我要写书评

暂无评论

Warburg Effects in Cancer and Normal Proliferating Cells:Two Tales of the Same Name

引用

Genomics, Proteomics & Bioinformatics 2019年第3期17卷 273-286页

作者： Huiyan Sun Liang Chen Sha Cao Yanchun Liang Ying Xu The China-Japan Union Hospital Jilin UniversityChangchun 130033China MOE Key Laboratory of Symbolic Computation and Knowledge Engineering College of Computer Science and TechnologyJilin UniversityChangchun 130012China Computational Systems Biology Lab Department of Biochemistry and Molecular Biology and Institute of BioinformaticsUniversity of GeorgiaAthensGA 30602USA Faculty of Health Sciences University of MacaoTaipaMacao SAR 999078China Department of Biostatistics School of MedicineIndiana UniversityIndianapolisIN 46202USA Zhuhai Laboratory of MOE Key Laboratory of Symbolic Computation and Knowledge Engineering Zhuhai College of Jilin UniversityZhuhai 519041China

It has been observed that both cancer tissue cells and normal proliferating cells(NPCs)have the Warburg *** goal here is to demonstrate that they do this for different *** accomplish this,we have analyzed the transcriptomic data of over 7000 cancer and control tissues of 14 cancer types in TCGA and data of five NPC types in *** analyses reveal that NPCs accumulate large quantities of ATPs produced by the respiration process before starting the Warburg effect,to raise the intracellular pH from 6.8 to 7.2 and to prepare for cell division *** cell cycle starts,the cells start to rely on glycolysis for ATP generation followed by ATP hydrolysis and lactic acid release,to maintain the elevated intracellular pH as needed by cell division since together the three processes are pH *** cells go back to the normal respirationbased ATP production once the cell division phase *** comparison,cancer cells have reached their intracellular pH at 7.4 from top down as multiple acid-loading transporters are up-regulated and most acid-extruding ones except for lactic acid exporters are *** cells use continuous glycolysis for ATP production as way to acidify the intracellular space since the lactic acid secretion is decoupled from glycolysis-based ATP generation and is pH balanced by increased expressions of acid-loading ***-expression analyses suggest that lactic acid secretion is regulated by external,non-pH related ***,our data strongly suggest that the two cell types have the Warburg effect for very different reasons.

关键词： Cancer Warburg effect Fenton reaction Cell proliferation pH homeostasis

来源：评论

学校读者我要写书评

暂无评论

The Newton interpolation bases on lower sets

引用

Journal of Information and computational Science 2006年第3期3卷 385-394页

作者： Chen, Tao Dong, Tian Zhang, Shugong Key Lab. of Symbolic Computation and Knowledge Engineering Institute of Math. Jilin University Changchun 130012 China

Newton's algorithm for constructing univariate interpolation polynomial is well-known. In this paper, we generalize Newton's formula to multivariate Lagrange interpolation. For some type of subset ΧL, so-called lower subset, of a tensor product grid, we present directly an interpolation basis of Newton type which spans a minimal degree interpolation space for Lagrange interpolation on ΧL. We show that this basis is always a Newton interpolation basis for arbitrary ordered set of point evaluation functionals.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

Interpolation basis for nonuniform rectangular grid

引用

Journal of Information and computational Science 2005年第4期2卷 671-680页

作者： Dong, Tian Zhang, Shugong Lei, Na Key Lab. of Symbolic Computation and Knowledge Engineering Institute of Math. Jilin University Changchun 130012 China

This paper deals with Hermite interpolation on nonuniform rectangular grids with constructive algebraic geometry tools. We focus on the UR (U = uniform, R = rectangular sets of nodes) Hermite interpolation schemes. The expressions of minimal degree interpolation bases for 2-dimensional real space 2 are presented. The method is simple and easy to be generalized.

关键词： computational geometry

来源：评论

学校读者我要写书评

暂无评论

Revisit the logical difference of description logic terminologies

引用

Journal of Convergence Information Technology 2011年第4期6卷 240-245页

作者： Feng, Shasha Ouyang, Dantong Liu, Jie College of Computer Science and Technology Jilin University Key Lab of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China

The logical difference is important to ontology engineers in capturing and understanding the difference between different versions of given ontology. For acyclic EL terminologies, in which the well applied medical ontology SNOMED CT is represented, there are two methods proposed in computing the logical difference between terminologies: direct computation method and uniform interpolant method. We argue that the later method outperforms the former one in showing the dependency between entailments in the logical difference through the introduction of concept difference. The resulting logical difference conveys more information to ontology engineers than direct computation method.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Model for cascading failures in congested Internet

引用

Journal of Zhejiang University-Science A(Applied Physics & engineering) 2008年第10期9卷 1331-1335页

Cascading failures often occur in congested networks such as the Internet. A cascading failure can be described as a three-phase process: generation, diffusion, and dissipation of the congestion. In this account, we present a function that represents the extent of congestion on a given node. This approach is different from existing functions based on betweenness centrality. By introducing the concept of ''delay time'', we designate an intergradation between permanent removal and nouremoval. We also construct an evaluation function of network efficiency, based on congestion, which measures the damage caused by cascading failures. Finally, we investigate the effects of network structure and size, delay time, processing ability and packet generation speed on congestion propagation. Also, we uncover the relationship between the cascade dynamics and some properties of the network such as structure and size.

关键词： Complex network Cascading failures Congestion effects Propagation model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：