James Peters

Prof. Dr. James Peters

orcid

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 December 2017 in Mathematics in Computer Science
Verified
Journal Article
Closed access
PDF file
ACA. Di Concilio
A. Di Concilio
CGC. Guadagni
C. Guadagni
JPJames Peters
James Peters
SRS. Ramanna
S. Ramanna

5 March 2013 in Mathematics in Computer Science
Verified
Journal Article
Open access
PDF file
JPJames Peters
James Peters
This article gives a brief overview of near sets. The proposed approach in introducing near sets is to consider a set theory-based form of nearness (proximity) called discrete proximity. There are two basic types of near sets, namely, spatially near sets and descriptively near sets. By endowing a nonempty set with some form of a nearness (proximity) relation, we obtain a structured set called a proximity spaces. Let \({\mathcal{P}(X)}\) denote the set of all subsets of a nonempty set X. One of the oldest forms of nearness relations p (later denoted by δ) was introduced by E. Čech during the mid-1930s, which leads to the discovery of spatially near sets, i.e., those sets that have elements in common. That is, given a proximity space (X, δ), for any subset \({A \in \mathcal{P}(X)}\) , one can discover nonempty nearness collections \({\xi(A) = \{B \in \mathcal{P}(X): A \, \delta \, B\} }\) . Recently, descriptively near sets were introduced as a means of solving classification and pattern recognition problems arising from disjoint sets (i.e, sets with empty spatial intersections) that resemble each other. One discovers descriptively near sets by choosing a set of probe functions Φ that represent features of points in a set and endowing the set of points with a descriptive proximity relation δ Φ and obtaining a descriptively structured set (called descriptive proximity space). Given a descriptive proximity spaces (X, δ Φ), one can discover collections of subsets that resemble each other. This leads to the discovery of descriptive nearness collections \({\xi_{\Phi}(A) = \{B \in \mathcal{P}(X): A \,\delta_{\Phi} \, B\} }\) . That is, if \({B \in \xi_{\Phi}(A)}\) , then A δ Φ B (relative to the chosen features of points in X, A resembles B). The focus of this tutorial is on descriptively near sets.

1 July 2017 in Physics of Life Reviews
Verified
Journal Article
Closed access
Arturo TozziArturo Tozzi
Arturo Tozzi
JPJames Peters
James Peters
AFAndrew A. Fingelkurts
Andrew A. Fingelkurts
AFAlexander Fingelkurts
Alexander Fingelkurts
Pedro C. MarijuánPedro C. Marijuán
Pedro C. Marijuán

3 February 2016 in Cognitive Neurodynamics
Verified
Journal Article
Closed access
PDF file
Arturo TozziArturo Tozzi
Arturo Tozzi
JPJames Peters
James Peters

1 January 2016 in Filomat
Verified
Journal Article
Open access
PDF file
JPJames Peters
James Peters
This article introduces proximal relator spaces. The basic approach is to define a nonvoid family of proximity relations RδΦ (called a proximal relator) on a nonempty set. The pair (X,RδΦ) (also denoted X(RδΦ)) is called a proximal relator space. Then, for example, the traditional closure of a subset of the Száz relator space (X,R) can be compared with the more recent descriptive closure of a subset of (X,RδΦ). This leads to an extension of fat and dense subsets of the relator space (X,R) to proximal fat and dense subsets of the proximal relator space (X,RδΦ).

23 February 2013 in Mathematics in Computer Science
Verified
Journal Article
Closed access
PDF file
JPJames Peters
James Peters