Author image not provided
 Pedro J Zufiria

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.37
Citation Count26
Publication count19
Publication years1990-2016
Available for download1
Average downloads per article129.00
Downloads (cumulative)129
Downloads (12 Months)32
Downloads (6 Weeks)6
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


19 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 19 of 19
Sort by:

1 published by ACM
May 2016 ACM Transactions on Mathematical Software (TOMS): Volume 42 Issue 2, June 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 32,   Downloads (Overall): 129

Full text available: PDFPDF
VBF is a collection of C++ classes designed for analyzing vector Boolean functions (functions that map a Boolean vector to another Boolean vector) from a cryptographic perspective. This implementation uses the NTL library from Victor Shoup, adding new modules that call NTL functions and complement the existing ones, making it ...
Keywords: Boolean functions, cryptography, nontrigonometric Fourier analysis, software

2
July 2012 MLDM'12: Proceedings of the 8th international conference on Machine Learning and Data Mining in Pattern Recognition
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

This paper addresses the problem of predicting several attributes corresponding to telephone users, based on information gathered from the network which defines their communication patterns. Two approaches are compared which are grounded on machine learning techniques: the initial approach makes use of link information between two users, looking for the ...

3
June 2011 NSW '11: Proceedings of the 2011 IEEE Network Science Workshop
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

This paper presents an algorithm for generating scale-free networks with adjustable clustering coefficient. The algorithm is based on a random walk procedure combined with a triangle generation scheme which takes into account genetic factors; this way, preferential attachment and clustering control are implemented using only local information. Simulations are presented ...
Keywords: random walk selection schemes, scale-free networks, adjustable clustering coefficient, triangle generation scheme, genetic factors

4
June 2009 IWANN '09: Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

The paper proposes a new method to estimate the distribution of the embedding dimension associated with a time series, using the <em>Self Organizing Map decision taken in Output Space</em> (SOMOS) dimensionality reduction neural network. It is shown that SOMOS, besides estimating the embedding dimension, it also provides an approximation of ...
Keywords: SOMOS architecture, time series, window size, embedding dimension

5
October 2007 Neurocomputing: Volume 70 Issue 16-18, October, 2007
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

In this paper, the behavior of the Sanger hebbian artificial neural networks is analyzed. Hebbian networks are employed to implement principal component analysis (PCA), and several improvements over the original model due to Oja have been developed in the last two decades. Among them, Sanger model is designed to directly ...
Keywords: DCT and DDT formulations, Hebbian models, Dynamic behavior, Sanger network

6
October 2007 Neurocomputing: Volume 70 Issue 16-18, October, 2007
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 10

This paper presents two different power system stabilizers (PSSs) which are designed making use of neural fuzzy network and genetic algorithms (GAs). In both cases, GAs tune a conventional PSS on different operating conditions and then, the relationship between these points and the PSS parameters is learned by the ANFIS. ...
Keywords: ANFIS, Genetic algorithms, Power system stabilizer, Neural networks, Fuzzy logic

7
June 2007 IWANN'07: Proceedings of the 9th international work conference on Artificial neural networks
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

In this paper, the behavior of some hebbian artificial neural networks with lateral weights is analyzed. Hebbian neural networks are employed in communications and signal processing applications for implementing on-line Principal Component Analysis (PCA). Different improvements over the original Oja model have been developed in the last two decades. Among ...

8
June 2005 IWANN'05: Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

In this paper, the behavior of the Sanger hebbian artificial neural networks [6] is analyzed. Hebbian neural networks are employed in communications and signal processing applications, among others, due to their capability to implement Principal Component Analysis (PCA). Different improvements over the original model due to Oja have been developed ...

9
June 2005 IWANN'05: Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

This paper presents an adaptive Power System Stabilizer (PSS) using an Adaptive Network Based Fuzzy Inference System (ANFIS) and Genetic Algorithms (GAs). Firstly, genetic algorithms are used to tune a conventional PSS on a wide range of operating conditions and then, the relationship between these operating points and the PSS ...

10
April 2004 Journal of Computational and Applied Mathematics: Volume 166 Issue 2, 15 April 2004
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

We present an investigation into the dynamics of a system, which underlies a new estimating algorithm for regression with grouped and nongrouped data. The algorithm springs from a simplification of the well-known EM algorithm, in which the expectation step of the EM is substituted by a modal step. This avoids ...
Keywords: censored data, imputation, regression, iterative estimation, global dynamics

11
August 2002 ICANN '02: Proceedings of the International Conference on Artificial Neural Networks
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

Recurrent Backpropagation schemes for fixed point learning in continuous-time dynamic neural networks can be formalized through a differential-algebraic model, which in turn leads to singularly perturbed training techniques. Such models clarify the relative time-scaling between the network evolution and the adaptation dynamics, and allow for rigorous local convergence proofs. The ...

12
August 2002 ICANN '02: Proceedings of the International Conference on Artificial Neural Networks
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

This work presents an EM approach for nonlinear regression with incomplete data. Radial Basis Function (RBF) Neural Networks are employed since their architecture is appropriate for an efficient parameter estimation. The training algorithm expectation (E) step takes into account the censorship over the data, and the maximization (M) step can ...

13
August 2002 Applied Mathematics and Computation: Volume 130 Issue 2, August 2002
Publisher: Elsevier Science Inc.
Bibliometrics:
Citation Count: 0

A global analysis of Branin's method (originally due to Davidenko) for finding all the real zeros of a vector function is carried out. The analysis is based on a global study of this method perceived of as a dynamical system. Since Branin's algorithm is closely related to homotopy methods, this ...
Keywords: Newton's method, Branin's method, homotopy, singularity, dynamical systems

14
August 2002 Applied Mathematics and Computation: Volume 130 Issue 2-3, August, 2002
Publisher: Elsevier Science Inc.
Bibliometrics:
Citation Count: 0

A global analysis of Branin's method (originally due to Davidenko) for finding all the real zeros of a vector function is carried out. The analysis is based on a global study of this method perceived of as a dynamical system. Since Branin's algorithm is closely related to homotopy methods, this ...
Keywords: Dynamical systems, Homotopy, Newton's method, Branin's method, Singularity

15
March 2002 Journal of Computational and Applied Mathematics - Special issue: Proceedings of the 9th International Congress on computational and applied mathematics: Volume 140 Issue 1-2, 1 March 2002
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 2

This paper addresses the use of dynamical system theory to tackle singular root-finding problems. The use of continuous-time methods leads to implicit differential systems when applied to singular nonlinear equations. The analysis is based on a taxonomy of singularities and uses previous stability results proved in the context of quasilinear ...
Keywords: stability, root-finding, explicit Runge-Kutta methods, implicit ODE, singularity

16
June 2001 IWANN '01: Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

Systolic architectures for Sanger and Rubner Neural Networks (NNs) are proposed, and the local stability of their learning rules is taken into account based on the indirect Lyapunov method. In addition, these learning rules are improved for applications based on Principal Component Analysis (PCA). The local stability analysis and the ...

17
November 1999 Journal of Computational and Applied Mathematics - Special issue on numerical methods for differential equations: Volume 111 Issue 1-2, Nov. 15, 1999
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 2

Keywords: cell-to-cell mapping, spatial discretization, impasse points, linearly implicit ODEs
Also published in:
November 1999  Proceedings of the on Numerical methods for differential equations

18
May 1991 Dynamics and Control: Volume 1 Issue 2, May 1991
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0


19
January 1990 Applied Mathematics and Computation: Volume 35 Issue 1, January 1990
Publisher: Elsevier Science Inc.
Bibliometrics:
Citation Count: 4

Based on dynamical systems theory, a computational method is proposed to locate all the roots of a nonlinear vector function. The computational approach utilizes the cell-mapping method. This method relies on discretization of the state space and is a convenient and powerful numerical tool for analyzing the global behavior of ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us