In this paper, the notions of L-fuzzy subalgebra degree and L-subalgebras on an effect algebra are introduced some characterizations given. We use four kinds cut sets L-subsets to characterize degree. induce convexity by degree, we prove that a morphism between two algebras is preserving mapping monomorphism convex-to-convex mapping. Finally, it proved set all can form L-convexity, its L-convex...

We construct a degree which fails to be computably enumerable in any computably enumerable set strictly below

Often, when dealing with real-world recognition problems, we do not need, and often cannot have, knowledge of the entire set possible classes that might appear during operational testing. In such cases, need to think robust classification methods able deal "unknown" properly reject samples belonging never seen training. Notwithstanding, existing classifiers date were mostly developed for closed...

开放环境下的模式识别与文字识别应用中，新数据、新模式和新类别不断涌现，要求算法具备应对新类别模式的能力。针对这一问题，研究者们开始聚焦开放集文字识别（open-set text recognition，OSTR）任务。该任务要求，算法在测试（推断）阶段，既能识别训练集见过的文字类别，还能够识别、拒识或发现训练集未见过的新文字。开放集文字识别逐步成为文字识别领域的研究热点之一。本文首先对开放集模式识别技术进行简要总结，然后重点介绍开放集文字识别的研究背景、任务定义、基本概念、研究重点和技术难点。同时，针对开放集文字识别三大问题（未知样本发现、新类别识别和上下文信息偏差），从方法的模型结构、特点优势和应用场景的角度对相关工作进行了综述。最后，对开放集文字识别技术的发展趋势和研究方向进行了分析展望。;Text recognition is focused on transcription-...

In traditional semantic segmentation, knowing about all existing classes is essential to yield effective results with the majority of approaches. However, these methods trained in a Closed Set fail when new are found test phase, not being able recognize that an unseen class has been fed. This means they suitable for Open scenarios, which very common real-world computer vision and remote sensing...

In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.

The classical Hermite interpolation technique approximates a given differentiable function defined in an open subset of R with a polynomial of a given degree which takes at an assigned set points p1, . . . , pn, usually assumed to be sufficiently general, the same values as the function and of its derivatives up to orderm1, . . . ,mn respectively. A geometric counterpart of Hermite interpolatio...