Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Samuel D. Bedrosian

dblp:27/3492 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 1989
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Graph algorithms and graph theory · 100%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › network analysis
complex networks
0.011987
A fractal-graph approach to large networks · Proc. IEEE 1987
Graph algorithms and graph theory › random graph models
network growth models
0.011987
A fractal-graph approach to large networks · Proc. IEEE 1987
Physical-layer communications › antenna arrays
antenna array design
0.011986
Nonuniform linear arrays: Graph-theoretic approach to minimum redundancy · Proc. IEEE 1986
Graph algorithms and graph theory
graph algorithms
0.011986
Nonuniform linear arrays: Graph-theoretic approach to minimum redundancy · Proc. IEEE 1986
Graph algorithms and graph theory › graph algorithms
graph-theoretic optimization
0.011986
Nonuniform linear arrays: Graph-theoretic approach to minimum redundancy · Proc. IEEE 1986
Graph algorithms and graph theory
graph theory
0.011986
Nonuniform linear arrays: Graph-theoretic approach to minimum redundancy · Proc. IEEE 1986

Methods — techniques the papers use, named apart from their topics

graph-theoretic approach · 0.0closed-form derivation · 0.0fractal-graph analysis · 0.0
YearPublicationVenuePosition
1989 Color and language as man-machine interface parameters
abstract
Growing use of terminals for CAD/CAM as well as the general proliferation of work stations justifies focusing attention on effective communication at the terminal interface. Color is often used to enhance the flow of information even though many aspects of color are still not well understood. Close scrutiny of the color phenomena using fuzzy set concepts as well as conventional techniques has yielded quantitative results consistent with available folk theorems. These results and some new insight on earlier color selection methods are presented concisely. We build on our previous results: a 20 gray level criterion and the quantitative transformation yielding the number of colors C corresponding to a given number of gray levels L. This relation C = 0.074L3 and a fuzzy entropy-based information measure are found to fit closely a lognormal distribution. Natural (not computer) languages present a different problem because of more ambiguity and variability. the bridge here stems from the observation that corresponding to the upper bound of about 200 gray levels for vision, we find that the human larynx can produce about 200 distinctive sounds which is the key to language capability. We focus on English because it is an important special case for international technical and scientific discourse. Our concepts and techniques are extended to yield some initial informal results concerning usable vaocabulary. Based on the latter, we present a general display for number of gay levels, color, and English words.
Samuel D. Bedrosian
Int. J. Intell. Syst.1
1987 A fractal-graph approach to large networks
abstract
Here we propose a novel fractal-graph approach to complement the usual graph-theoretic methods which are critically limited when applied to large networks with their continued growth and dynamic characteristics. This fractal-graph approach uses the sometimes hidden underlying order inherent in typical networks and focusses on their global properties. This allows a prescription both for the growth of these complex networks and a framework for characterizing them in new ways.
Samuel D. Bedrosian, D. L. Jaggard
Proc. IEEE1
1986 Nonuniform linear arrays: Graph-theoretic approach to minimum redundancy
abstract
A closed-form equation is given for minimum redundancy linear arrays (MRLAs) based on a graph-theoretic approach. The results obtained include an expression for incremental change and a log-log plot for a large range of values as well as a plot of redundancy with limiting value of 4/3.
Samuel D. Bedrosian
Proc. IEEE1
1986 Effect of fuzzy membership on recognition of gray level images
N. X. Chen, Samuel D. Bedrosian
Pattern Recognit. Lett.2
1984 Significance of visual limitations in automated pattern recognition applications
Samuel D. Bedrosian
Pattern Recognit. Lett.1
1984 An information measure for fuzzy sets
abstract
The following topics are discussed: (1) a measure for the information contained in fuzzy sets, (2) the relation between fuzzy information and Shannon's information], and (3) the relation between fuzzy information and physical entropy. Some related examples are presented. The theoretical results are shown to conform well to previously published experimental results on monochrome images.
Wei-Xin Xie, Samuel D. Bedrosian
IEEE Trans. Syst. Man Cybern.2