The Halfspace Depth Characterization Problem

2020 ◽  
pp. 379-389
Author(s):  
Stanislav Nagy
Keyword(s):  
Characterization Problem

scholarly journals The characterization problem for endomorphism rings

1991 ◽  
Vol 50 (1) ◽  
pp. 116-137 ◽  
Author(s):  
J. L. García
Keyword(s):  
Endomorphism Ring ◽  
Free Module ◽  
Endomorphism Rings ◽  
Characterization Problem ◽  
Algebraic Properties

AbstractWe consider the problem of characterizing by abstract properties the rings which are isomorphic to the endomorphism ring End (RF) of some free module F over a ring R in a given class R of rings. We solve this problem when R is any class of rings (by employing topological notions) and when R is the class of all the left Kasch rings (in terms of algebraic properties only).

scholarly journals Aleph–zero categorical Stone algebras

1978 ◽  
Vol 26 (3) ◽  
pp. 337-347 ◽  
Author(s):  
Philip Olin
Keyword(s):  
Boolean Algebra ◽  
Characterization Problem ◽  
A Chain ◽  
Dense Set

AbstractThis paper is a contribution to the problem of characterizing the ℵ0-categorical Stone algebras. If the dense set is either finite or a chain, the problem is solved by reducing it to the ℵ0-categoricity of the skeleton and the dense set, solutions for these being known. If the dense set is a Boolean algebra, we show that this type of reduction works for certain subclasses but not for all such algebras. For generalized Post algebras the characterization problem is solved completely.

An Approach to the Workload Characterization Problem

Computer ◽  
1976 ◽  
Vol 9 (6) ◽  
pp. 18-32 ◽  
Author(s):  
A.K. Agrawala ◽  
J.M. Mohr ◽  
R.M. Bryant
Keyword(s):  
Workload Characterization ◽  
Characterization Problem

scholarly journals Prospects for automated solution of the subject characterization problem in the bibliographic services

1982 ◽  
Vol 64 ◽  
pp. 147-154
Author(s):  
S. Schiminovich
Keyword(s):  
Classification Schemes ◽  
Automated Generation ◽  
Characterization Problem ◽  
Subject Headings ◽  
The Subject ◽  
Astronomy And Astrophysics

AbstractEvidence is presented on the feasibility of an automated generation of classification schemes and the subsequent indexing of papers with the automatically generated subject headings. The output generated for Astronomy and Astrophysics compares favorably with the schemes used by the services and is not inconsistent with recently proposed classifications. Implementation of the automatic techniques seems not only feasible but desirable. However, it would require that the services include for each paper in their database its citations to other papers.

Separating Points by Parallel Hyperplanes— Characterization Problem

2007 ◽  
Vol 18 (5) ◽  
pp. 1356-1363 ◽  
Author(s):  
Silvia Ghilezan ◽  
Jovanka Pantovic ◽  
Jovisa Zunic
Keyword(s):  
Characterization Problem

scholarly journals On Cui-Kano's Characterization Problem on Graph Factors

2013 ◽  
Vol 74 (3) ◽  
pp. 335-343 ◽  
Author(s):  
Hongliang Lu ◽  
David G.L. Wang
Keyword(s):  
Characterization Problem ◽  
Graph Factors

Characterizations of Spherical Neighbourhoods

1970 ◽  
Vol 22 (2) ◽  
pp. 431-435 ◽  
Author(s):  
C. M. Petty ◽  
J. M. Crotty
Keyword(s):  
Metric Space ◽  
Metric Spaces ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Characterization Problem ◽  
Necessary And Sufficient

If Σ is a specified class of metric spaces and M ∈ Σ, then the characterization problem is to find necessary and sufficient conditions which distinguish the spherical neighbourhoods (open spheres) of M among a specified class of subsets of M.In a metric space M the notation pqr means p ≠ q ≠ r and pq + qr = pr.M is said to be uniformly locally externally convex if there exists δ > 0 such that if p, q ∈ M, p ≠ q, and pq < δ, then there exists r ∈ M such that the relation pqr subsists. We will prove the following result.

Sign in / Sign up

Export Citation Format

Share Document