Scispace (Formerly Typeset)
  1. Home
  2. Journals
  3. Information Sciences
  4. 1970
  1. Home
  2. Journals
  3. Information Sciences
  4. 1970
Showing papers in "Information Sciences in 1970"
Journal Article•10.1016/S0020-0255(70)80056-1•
Numerical methods for fuzzy clustering

[...]

Enrique H. Ruspini1•
University of California, Los Angeles1
01 Jul 1970-Information Sciences
TL;DR: In this paper, the authors considered the problem of decomposition of the probability density function of the original set into the weighted sum of the component fuzzy set densities, which is done by optimization of some functional defined over all possible fuzzy classifications.

597 citations

Journal Article•10.1016/S0020-0255(70)80046-9•
On system parameter identifiability

[...]

R. M. Staley1, P. C. Yue1•
University of California, Los Angeles1
01 Apr 1970-Information Sciences
TL;DR: Nessary and sufficient conditions are obtained for the system parameters to be identifiable in the deterministic sense and stochastically identifiable and these conditions are shown to be significant in studying the asymptotic properties of maximum likelihood estimators.

52 citations

Journal Article•10.1016/0020-0255(70)90034-4•
On the evolution of artificial intelligence

[...]

Laurent Siklóssy1•
University of California, Irvine1
01 Oct 1970-Information Sciences
TL;DR: This research presents a new generation of artificial intelligence programs which perform tasks which are similar to tasks that increasingly younger human beings can perform.

34 citations

Journal Article•10.1016/S0020-0255(70)80044-5•
Substitution in families of languages

[...]

Seymour Ginsburg1, Edwin H. Spanier2•
University of Southern California1, University of California, Berkeley2
01 Jan 1970-Information Sciences
TL;DR: The effect of substitution in families of languages, especially an AFL (i.e., abstract family of languages), is considered and the main results shown are the following: The substitution of one AFL into another is an AFL.

34 citations

Journal Article•10.1016/S0020-0255(70)80050-0•
Conjugate convex functions, duality, and optimal control problems I: Systems governed by ordinary differential equations

[...]

W. Heins1, S. K. Mitter1•
Case Western Reserve University1
01 Apr 1970-Information Sciences
TL;DR: Existence theorems for optimal control problems are obtained using the duality theory and a direct relationship between duality and Pontryagin's Maximum Principle is exhibited.

16 citations

Journal Article•10.1016/0020-0255(70)90035-6•
Nonlinear sequential algorithms for estimation under uncertainty

[...]

M. Z. Dajani, Andrew P. Sage
01 Oct 1970-Information Sciences
TL;DR: This paper derives nonlinear sequential filter algorithms for conditional mean estimation of a Gauss Markov process when there is uncertainty as to the presence of the GaussMarkov process (signal process) in the observation.

14 citations

Journal Article•10.1016/S0020-0255(70)80042-1•
Proof of the basic invariant imbedding method for Fredholm integral equations with displacement kernels. part II

[...]

J. L. Casti1, Robert E. Kalaba1•
University of Southern California1
01 Jan 1970-Information Sciences
TL;DR: The theorem below shows that there exists a Cauchy problem whose solution satisfies a family of Fredholm integral equations with displacement kernels.

12 citations

Journal Article•10.1016/S0020-0255(70)80038-X•
Étude expérimentale du Nombre de Dépassements d'un Seuil par une Fonction aléatoire et Application à la Détection des Signaux

[...]

John M. Warmerdam1, Timothy L. Jacobs1•
Duke University1
01 Jan 1970-Information Sciences
TL;DR: The performance of a signal detection system by means of counting the number of times a level is crossed by the input function is derived.

10 citations

Journal Article•10.1016/S0020-0255(70)80047-0•
A learning scheme for the Nearest Neighbour Classifier

[...]

N.L. Ford1, B.G. Batchelor, B. R. Wilkins1•
University of Southampton1
01 Apr 1970-Information Sciences
TL;DR: This paper describes an alternative approach in which the locates do not necessarily represent real patterns, and the training procedure consists of adjusting the positions of the locate so as to optimise the decision surface.

10 citations

Journal Article•10.1016/S0020-0255(70)80039-1•
Response identification of distributed systems with noisy measurements at finite points

[...]

Paul C. Badavas1, George N. Saridis1•
Purdue University1
01 Jan 1970-Information Sciences
TL;DR: A stochastic approximation algorithm is proposed for the on-line estimation of the parameters in an assumed approximate response of a class of distributed systems minimizing a mean-square error criterion.

8 citations

Journal Article•10.1016/S0020-0255(70)80053-6•
Computational algorithms for discrete detection and likelihood ratio computation

[...]

J. Robert McLendon, Andrew P. Sage
01 Jul 1970-Information Sciences
TL;DR: A pseudo Bayes approach to likelihood ratio determination for discrete time random processes imbedded in Gaussian noise is presented, suggesting an estimator-correlator type structure for the optimum digital detector.
Journal Article•10.1016/0020-0255(70)90037-X•
On the existence of generators for certain AFL

[...]

Seymour Ginsburg1, Gene F. Rose2•
University of Southern California1, Case Western Reserve University2
01 Oct 1970-Information Sciences
TL;DR: It is shown that under mild conditions on a tape function f, the AFL generated by the languages accepted by f-tape-bounded (deterministic) Turing acceptors is generated by a single language i.e., is principal.
Journal Article•10.1016/0020-0255(70)90033-2•
The threshold effect of a nonlinear learning algorithm for pattern recognition

[...]

Y.T. Chien1•
University of Connecticut1
01 Oct 1970-Information Sciences
TL;DR: Results of this experiment have shown significant improvement over an ordinary linear algorithm in handling character samples with various imperfections due to the poor quality in writing or printing encountered in practice.
Journal Article•10.1016/S0020-0255(70)80048-2•
Some aspects of the recognition of convex polyhedra from two plane projections. I

[...]

Pierluigi Della Vigna1, Fabrizio Luccio2•
Polytechnic University of Milan1, University of Pisa2
01 Apr 1970-Information Sciences
TL;DR: A deterministic approach to the reconstruction of convex polyhedra from two perspective images is presented, and the complications introduced by a quantization effect on such images are examined.
Journal Article•10.1016/S0020-0255(70)80055-X•
Expansion of multivariate weakly stationary stochastic processes

[...]

Elias Masry1•
University of California, San Diego1
01 Jul 1970-Information Sciences
TL;DR: Two distinct series representations are derived for the class of second order, mean-square continuous, weakly stationary multivariate stochastic processes.
Journal Article•10.1016/S0020-0255(70)80049-4•
Consistent properties of composite formation under a binary relation

[...]

John C. Schwebel1, Bruce H. McCormick1•
University of Illinois at Urbana–Champaign1
01 Apr 1970-Information Sciences
TL;DR: The object of this paper is to characterize binary relations by their consistent composite formation properties by the use of reduction theorems and by the construction of example systems.
Journal Article•10.1016/S0020-0255(70)80040-8•
Parallel shape recognition and its implementation on a fixed-size VLSI architecture

[...]

Heng-Da Cheng1, X. Cheng2•
Utah State University1, Concordia University Wisconsin2
01 Jan 1970-Information Sciences
TL;DR: This work generalizes that circuit construction method for group multiplication requiring time at most one unit greater than the lower bound so as to render it applicable to any function f:X"1 x X"2 -> Y, where X"1 andX"2 are finite sets.
Journal Article•10.1016/S0020-0255(70)80043-3•
Sequential estimation with unestimated parameters-The forced case

[...]

Lawrence Schwartz
01 Jan 1970-Information Sciences
TL;DR: A sequential estimation computation for the state of a system given noisy observations is made more complicated by the presence of random forcing of the system and by uncertain parameters, even if the uncertain parameters are not estimated.
Journal Article•10.1016/S0020-0255(70)80054-8•
Solution of a poker variant

[...]

Edward O. Thorp1•
University of California, Irvine1
01 Jul 1970-Information Sciences
TL;DR: It is shown that, under certain restrictions, two-person inverse poker and two- person ordinary poker are isomorphic games.
Journal Article•10.1016/S0020-0255(70)80045-7•
The lambda-gamma calculus: A language adequate for defining recursive functions

[...]

P. C. Gilmore
01 Apr 1970-Information Sciences
TL;DR: An applied lambdagamma calculus with a successor function as the only primitive function is described in the paper as a fully formal theory with axioms and rules of deduction.
Journal Article•10.1016/0020-0255(70)90036-8•
Problem-solving machines for euclidean geometry

[...]

Motokiti Kondô1, Haruo Murata2•
Tokyo Metropolitan University1, Sophia University2
01 Oct 1970-Information Sciences
TL;DR: This work constructs a mathematical code system, MCS, as a machine solvable language, and gives expandability of the thesaurus by giving a formal procedure of translation from an input language to MCS to retrieve a solution using it as an index.
Journal Article•10.1016/S0020-0255(70)80051-2•
A note on optimal nonlinear prediction for independent increment processes

[...]

J. R. Fisher, E. B. Stear1•
University of California, Santa Barbara1
01 Jul 1970-Information Sciences
TL;DR: The prediction problem requires solution of the filtering problem plus extrapolation of the last filter output through the nonlinear system dynamics, and it is shown that the conditional density function of the system state during the extrapolation operation satisfies the Fokker-Planck-Kolmogorov-Feller equation.
Journal Article•10.1016/S0020-0255(70)80052-4•
A method for the structural analysis of two-dimensional mathematical expressions

[...]

Shi-Kuo Chang1•
IBM1
01 Jul 1970-Information Sciences
TL;DR: Algorithms are developed to test whether a pattern has a (strongly) well-formed structure with respect to a given structure specification scheme, which is applicable to the analysis of two-dimensional mathematical expressions and the format of printed material.

Tools

SciSpace AgentBiomedical AgentSciSpace RecruitSciSpace for EnterpriseAgent GalleryChat with PDFLiterature ReviewAI WriterFind TopicsParaphraserCitation GeneratorExtract DataAI DetectorCitation Booster

Learn

ResourcesLive Workshops

SciSpace

CareersSupportBrowse PapersPricingSciSpace Affiliate ProgramCancellation & Refund PolicyTermsPrivacyData Sources

Directories

PapersTopicsJournalsAuthorsConferencesInstitutionsCitation StylesWriting templates

Extension & Apps

SciSpace Chrome ExtensionSciSpace Mobile App

Contact

support@scispace.com
SciSpace

© 2026 | PubGenius Inc. | Suite # 217 691 S Milpitas Blvd Milpitas CA 95035, USA

soc2
Secured by Delve