H. Frank

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

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

Systems, architecture and hardware · 3 · 1 first-authorTheory of computation · 2 · 1 first-authorComputer networks · 1 · 1 first-author

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%
Theoretical computer science
3 papers
Algorithms and data structures · 43% Coding theory · 28% Automata and formal languages · 20%
Human-computer interaction and pervasive computing
1 paper
Usability and user experience research · 100%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › numerical linear algebra
linear system solving
0.011968
A Theorem on Linearity · IEEE Trans. Computers 1968
Electronic design automation › hardware verification and test › sequential circuit testing
checking experiments
0.011966
Improving Reliability of a Sequential Machine by Error-Correcting State Assignments · IEEE Trans. Electron. Comput. 1966
Electronic design automation › hardware verification and test
fault detection
0.011966
Improving Reliability of a Sequential Machine by Error-Correcting State Assignments · IEEE Trans. Electron. Comput. 1966
Electronic design automation
hardware verification and test
0.011966
Improving Reliability of a Sequential Machine by Error-Correcting State Assignments · IEEE Trans. Electron. Comput. 1966
Electronic design automation › hardware verification and test
sequential circuit testing
0.011966
Improving Reliability of a Sequential Machine by Error-Correcting State Assignments · IEEE Trans. Electron. Comput. 1966
Coding theory › error-correcting codes › block codes
linear code
0.011965
Cut-set matrices and linear codes (Corresp.) · IEEE Trans. Inf. Theory 1965
Automata and formal languages › finite automata
distinguishing sequences
0.011966
Improving Reliability of a Sequential Machine by Error-Correcting State Assignments · IEEE Trans. Electron. Comput. 1966
Automata and formal languages
finite automata
0.011966
Improving Reliability of a Sequential Machine by Error-Correcting State Assignments · IEEE Trans. Electron. Comput. 1966

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

state assignment · 0.0matrix representation · 0.0error-correcting codes · 0.0empirical study · 0.0correlation analysis · 0.0
YearPublicationVenuePosition
1989 A software engineering environment for distributed applications
Max Mühlhäuser, Alexander Schill, Jürgen Günter Kienhöfer, H. Frank, Lutz Heuser
Microprocessing and Microprogramming4
1975 Computer Networks
H. Frank
Networks1
1968 A Theorem on Linearity
abstract
Abstract—A system is linear if and only if it is zero-state linear, zero-input linear, and its input-output state equation has the decompostion property. In this note, it is shown that zero-state linearity is sufficient to imply that the set of states accessible from the zero state can be made into a vector space over the output field and the zeroinput response is a homomorphism on this vector space to the output space of the system. An application of the theorem to finite-state systems is given.
K. Doty, H. Frank
IEEE Trans. Computers2
1966 Improving Reliability of a Sequential Machine by Error-Correcting State Assignments
abstract
The problem considered in this paper is the design of a checking experiment which will determine from observation of input-output behavior whether a sequential switching circuit is operating correctly. An input sequence is applied to the circuit, and the output sequence is observed and compared to the correct output sequence which has been determined from the state table corresponding to the correctly operating circuit. The sequential machines under consideration here must be 1) strongly connected, 2) reduced, and 3) have a distinguishing sequence [1]. The malfunctions which occur in the circuit are assumed to be those which do not increase the number of states in the circuit. In Hennie [1], a general synthesis procedure is proposed for checking experiments on machines in the class defined previously. The procedure to be proposed here is a modification of that procedure for which the upper bound on the length is reduced. Familiarity with at least the first portion of Hennie [1] on the synthesis of checking experiments for machines having distinguishing sequences is assumed.
H. Frank, Stephen S. Yau
IEEE Trans. Electron. Comput.1
1965 Cut-set matrices and linear codes (Corresp.)
S. Louis Hakimi, H. Frank
IEEE Trans. Inf. Theory2
1962 Quelques résultats théoriques et empiriques concernant l'accomodation informationelle (in French)
abstract
There are several experiences proving a linear relationship between information content of signs or events and reaction or perception time of the human operator (fig. l,2). As information is a function of probability there must be a convergence, called informational accomodation, of subjective to objective information if the (subjective) probability approaches the (objective) frequency. The speed of this process is correlated with intelligence, measured by success at school (average grades). The information of a sign or event multiplied by its frequency is called its striking valueA_i. It is shown, that the estimationss_iof frequencies equal the relative striking valuesa_i, even beyondh = 1/e \approx37% ifSsare not too aged, intelligent or experienced in giving estimates (fig.3). Other experiences show the influence of thea_ieven during the process of informational accommodation (fig.4,5).
H. Frank
IRE Trans. Inf. Theory1