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

Clyde Martin

dblp:05/6736 · also Clyde F. Martin · DBLP profile ↗
← Back
12ranked-venue papers
3as first author
0since 2021 · last 2014
0000-0002-5449-0653ORCID · verified

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

Theory of computation · 7Artificial intelligence and machine learning · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-authorSystems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
3 papers
Coding theory · 50% Mathematical optimization · 50%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization
inverse problems
0.011998
Input Recovery from Noisy Output Data, Using Regularized Inversion of the Laplace Transform · IEEE Trans. Inf. Theory 1998
Cryptographic primitives and cryptanalysis
stream cipher
0.011993
An algorithm for the k-error linear complexity of binary sequences with period 2n · IEEE Trans. Inf. Theory 1993
Coding theory › sequences › linear complexity
k-error linear complexity
0.011993
An algorithm for the k-error linear complexity of binary sequences with period 2n · IEEE Trans. Inf. Theory 1993
Coding theory › sequences
pseudorandom sequences
0.011993
An algorithm for the k-error linear complexity of binary sequences with period 2n · IEEE Trans. Inf. Theory 1993
Coding theory › sequences › pseudorandom sequences
autocorrelation
0.011976
The Autocorrelation Structure of Tausworthe Pseudorandom Number Generators · IEEE Trans. Computers 1976

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

regularized inversion · 0.0mean-square error analysis · 0.0decimation · 0.0
YearPublicationVenuePosition
2014 ${L^1}$ Control Theoretic Smoothing Splines
abstract
In this letter, we propose control theoretic smoothing splines with L1optimality for reducing the number of parameters that describes the fitted curve as well as removing outlier data. A control theoretic spline is a smoothing spline that is generated as an output of a given linear dynamical system. Conventional design requires exactly the same number of base functions as given data, and the result is not robust against outliers. To solve these problems, we propose to use L1optimality, that is, we use the L1norm for the regularization term and/or the empirical risk term. The optimization is described by a convex optimization, which can be efficiently solved via a numerical optimization software. A numerical example shows the effectiveness of the proposed method.
Masaaki Nagahara, Clyde Martin
IEEE Signal Process. Lett.2
2002 Value of information in the Polya urn process
Clyde Martin, Yu-Chi Ho
Inf. Sci.1
1998 Input Recovery from Noisy Output Data, Using Regularized Inversion of the Laplace Transform
abstract
In a dynamical system the input is to be recovered from finitely many measurements, blurred by random error, of the output of the system. As usual, the differential equation describing the system is reduced to multiplication with a polynomial after applying the Laplace transform. It appears that there exists a natural, unbiased, estimator for the Laplace transform of the output, from which an estimator of the input can be obtained by multiplication with the polynomial and subsequent application of a regularized inverse of the Laplace transform. It is possible, moreover, to balance the effect of this inverse so that ill-posedness remains restricted to its actual source: differentiation. The rate of convergence of the integrated mean-square error is a positive power of the number of data. The order of the differential equation has an adverse effect on the rate which, on the other hand, increases with the smoothness of the input as usual.
Aswini K. Dey, Clyde Martin, Frits H. Ruymgaart
IEEE Trans. Inf. Theory2
1995 Problems of Optimization with Application to Prosthetic Design and Stress Fracture Prediction
abstract
Examines the effects of geometry and material properties on criteria that could be used in establishing a notion of optimal form in bone or prosthetic devices. This is accomplished by determining extreme values of functionals that are measures of strain energy and compliance. The governing differential equation includes the effects of collageneous tissue acting on the bone and in the case of the prosthetic model, interfacial interactions between the device and the bone. Augmented Lagrange techniques and non-linear conjugate gradient methods are used to determine the optimal solution.>
Clyde Martin, Carroll Nunn, Carroll Schovanec
CBMS1
1995 Fatigue Effects in Muscular Control
abstract
A muscular control model is examined in order to determine possible fatigue effects on the monosynaptic reflex. The muscle dynamics and neural spindle receptors are represented in standard fashion as 4-element viscoelastic models. A theoretical derivation of the afferent spindle output is given. This afferent information from the muscle-spindle and delay effects are incorporated into the feedback loop. Fatigue effects upon system performance and stability are illustrated by means of numerical simulations.>
Clyde Martin, Lawrence Schovanec
CBMS1
1993 An algorithm for the k-error linear complexity of binary sequences with period 2n
abstract
Certain applications require pseudo-random sequences which are unpredictable in the sense that recovering more of the sequence from a short segment must be computationally infeasible. It is shown that linear complexity is useful in determining such sequences. A generalized linear complexity that has application to the security of stream ciphers is proposed, and an efficient algorithm is given for the case in which the sequence is binary with period 2/sup n/. This algorithm generalizes an algorithm presented by R.A. Games and A.H. Chan (1983).>
Mark Stamp 0001, Clyde Martin
IEEE Trans. Inf. Theory2
1989 Feedback Transformations on Tori
Wijesuriya P. Dayawansa, David L. Elliott, Clyde Martin
Math. Syst. Theory3
1988 A Convolution Method for Inverse Heat Conduction Problems
David S. Gilliam, Bernard Anthony Mair, Clyde Martin
Math. Syst. Theory3
1986 Global Observability of Flows on the Torus: An Application to Number Theory
Lance Drager, Clyde Martin
Math. Syst. Theory2
1983 Lie and Morse Theory for Periodic Orbits of Vector Fields and Matrix Riccati Equations, II
Robert Hermann, Clyde Martin
Math. Syst. Theory2
1982 Lie and Morse Theory for Periodic Orbits of Vector Fields and Matrix Riccati Equations, I: General Lie-Theoretic Methods
Robert Hermann, Clyde Martin
Math. Syst. Theory2
1976 The Autocorrelation Structure of Tausworthe Pseudorandom Number Generators
abstract
Given that the autocorrelations for any repeating number sequence are known, this paper gives an algorithm for determining the autocorrelation structure of a new sequence obtained from the original sequence by proper decimation. Therefore, for certain random number generators, it is possible to choose a proper decimation which results in a long interval in which the autocorrelations are small for all shifts.
Frank Neuman, Clyde Martin
IEEE Trans. Computers2