Filters








446,938 Hits in 4.9 sec

A multiplicative up-propagation algorithm

Jong-Hoon Ahn, Seungjin Choi, Jong-Hoon Oh
2004 Twenty-first international conference on Machine learning - ICML '04  
The monotonic convergence of the multiplicative up-propagation algorithm is shown.  ...  The multilayer generative network with nonnegativity constraints, is learned by a multiplicative uppropagation algorithm, where the weights in each layer are updated in a multiplicative fashion while the  ...  We propose a new algorithm, called multiplicative up-propagation, that realizes this interpretation in layered networks. Figure 2 .  ... 
doi:10.1145/1015330.1015379 dblp:conf/icml/AhnCO04 fatcat:eylijixhpnbzpgghb32nxre5wy

Sequential circuit fault simulation by fault information tracing algorithm: FIT

Yoshihiro Kitamura
1991 Proceedings of the 28th conference on ACM/IEEE design automation conference - DAC '91  
This paper presents a sequential circuit fault simulation method using a Fault Information Tracing algorithm (FIT).  ...  This technique drastically reduces fault effect propagation, achieves precise results, and is applicable to single and multiple stuck-at faults.  ...  This paper presents an FIT algorithm extension to multiple faults, and a sequential circuit fault simulation algorithm using the extension.  ... 
doi:10.1145/127601.127649 dblp:conf/dac/Kitamura91 fatcat:juob7scqf5alhctyeu6keycpga

Toward an FPGA architecture optimized for public-key algorithms

Adam J. Elbirt, Christof Paar, John Schewel, Peter M. Athanas, Steven A. Guccione, Stefan Ludwig, John T. McHenry
1999 Reconfigurable Technology: FPGAs for Computing and Applications  
It also proposes a new FPGA architecture optimized for the wide-operand additions required for modular multiplication.  ...  Additionally, algorithm agility is required to support algorithm independent protocols, a feature of most modern security protocols.  ...  Montgomery has proposed a solution to avoid carry propagation when performing modular multiplication 4 .  ... 
doi:10.1117/12.359540 fatcat:cuq7oeqkl5e2ppyzhhpvt22kwe

Low Power Design on Algorithmic and Architectural Level: A Case Study of an HSDPA Baseband Digital Signal Processing System

M. Schamann, S. Hessel, U. Langmann, M. Bucker
2007 2007 Design, Automation & Test in Europe Conference & Exhibition  
The presented strategy reduces the arithmetic operations for convenient propagation conditions up to 70 % which relates to an estimated power reduction of up to 40 % while the overall performance is not  ...  Three promising algorithms for the equalization of the propagation channel are compared regarding performance, complexity and power consumption using fixed-point SystemC models.  ...  Depending on the propagation conditions (here a VA30 channel) the control unit reduces the number of multiplications and additions adaptively by up to 71.9 % each.  ... 
doi:10.1109/date.2007.364495 fatcat:pwnywdz4unb77igq7oua7cptra

Power optimization of digital baseband WCDMA receiver components on algorithmic and architectural level

M. Schämann, M. Bücker, S. Hessel, U. Langmann
2008 Advances in Radio Science  
The optimization strategies result in a reduction of the number of arithmetic operations up to 70% for single components which leads to an estimated power reduction of up to 40% while the BER performance  ...  Additionally, for the Prefilter Rake equalizer the power estimations of a modified Griffith (LMS) and a Levinson (RLS) algorithm have been compared with the tool ORINOCO supplied by ChipVision.  ...  For the investigated application of an HSDPA receiver the number of required multiplications and additions could be reduced by up to 71.9% and the energy consumption could be reduced by up to 42% for subcomponents  ... 
doi:10.5194/ars-6-325-2008 fatcat:fxzpzjdwcveq7htqyn42tc45me

Label Propagation on K-partite Graphs with Heterophily [article]

Dingxiong Deng, Fan Bai, Yiqi Tang, Shuigeng Zhou, Cyrus Shahabi, Linhong Zhu
2017 arXiv   pre-print
With this model, we develop a novel label inference algorithm framework with update rules in near-linear time complexity.  ...  We propose a K-partite label propagation model to handle the mystifying combination of heterogeneous nodes/relations and heterophily propagation.  ...  Label Propagation We summarize a set of representative label propagation algorithms in Table 1 .  ... 
arXiv:1701.06075v1 fatcat:4cvenwhqpbcgxkkwe7g6cbcl7y

Automatic Generation of Propagation Complete SAT Encodings [chapter]

Martin Brain, Liana Hadarean, Daniel Kroening, Ruben Martins
2015 Lecture Notes in Computer Science  
This paper gives an abstract satisfaction based formalisation of one aspect of encoding quality, the propagation strength, and shows that propagation complete SAT encodings can be modelled by our formalism  ...  This allows a more rigorous approach to designing encodings as well as improved performance.  ...  To do this we consider the unit propagation algorithm as a map from UP : E M → (P Σ → P Σ ) that uses a set of clauses to add assignments to a partial assignment. Definition 4.  ... 
doi:10.1007/978-3-662-49122-5_26 fatcat:tbehj2iedza23ed3kve47wwcom

Terahertz scattering by dense media

Mayank Kaushik, Brian W.-H. Ng, Bernd M. Fischer, Derek Abbott
2012 Applied Physics Letters  
Phys. 2, 512-537 (1961)] and offers a rather simple and computationally efficient method for accurately explaining the multiple scattering response of a medium.  ...  In this letter, we propose an iterative algorithm that builds on the effective field theory proposed by P. C. Waterman and R. Truell [J. Math.  ...  Giuston et al. 5 argued that the assumption of such a fictitious host medium should account for the multiple-scattering processes (up to second order) that occur among the particles.  ... 
doi:10.1063/1.4720078 fatcat:mlcbittkhbcspglwtwlixymkt4

Parallelising Matrix Operations on Clusters for an Optimal Control-Based Quantum Compiler [chapter]

T. Gradl, A. Spörl, T. Huckle, S. J. Glaser, T. Schulte-Herbrüggen
2006 Lecture Notes in Computer Science  
In terms of computation, quantum systems provide a unique potential for coherent parallelisation that may exponentially speed up algorithms as in Shor's prime factorisation.  ...  Here we show concepts of parallelisation tailored to run on high-end computer clusters speeding up matrix multiplication, exponentials, and trace evaluations used in numerical quantum control.  ...  Helpful discussion with Michael Riss on the 'treelike' matrix multiplication is gratefully acknowledged.  ... 
doi:10.1007/11823285_78 fatcat:54bvbq6hefd4fmb4osdfmg4e3e

Seed based plant propagation algorithm for multiple travelling salesman problem

S Kalaiarasi, P Sriramya
2018 International Journal of Engineering & Technology  
Here seed based plant propagation algorithm is applied for the multiple travelling salesman problem that is also a optimization problem, and the result is compared with a short-cut routing algorithm.  ...  The result shows that Seed based Propagation Algorithm is easy to implement since it has few parameters to be utilized and also time complexity is reduced when implemented in multiple travelling salesman  ...  Plants evolved in a variety of ways to propagate. The strawberry plant uses runners and seeds to propagate. The SbPPA is applied to multiple travelling salesman problem.  ... 
doi:10.14419/ijet.v7i2.33.14823 fatcat:e6b7rnkzwvb65ovsdqfo4gt7ca

Parallel density matrix propagation in spin dynamics simulations

Luke J. Edwards, Ilya Kuprov
2012 Journal of Chemical Physics  
It is demonstrated that the large communication overhead associated with each propagation step (two-sided multiplication of the density matrix by an exponential propagator and its conjugate) may be avoided  ...  Good scaling is demonstrated on a 128-core (16 nodes, 8 cores each) cluster.  ...  algorithm for density matrix propagation.  ... 
doi:10.1063/1.3679656 pmid:22299862 fatcat:4vzo24ak6zgathsbiopg635oo4

Application of Levenberg-Marguardt Algorithm for Prime Radio Propagation Wave Attenuation Modelling in Typical Urban, Suburban and Rural Terrains

Joseph Isabona, Department of Physics, Faculty of Science, Federal University Lokoja, PMB. 1154, Lokoja, Kogi State, Divine O. Ojuh
2021 International Journal of Intelligent Systems and Applications  
The resultant outcome of the proposed propagation loss modelling using LMA indicates a high approximation efficacy over the popular Gauss-Newton algorithm (GNA) modelling method, which has been used to  ...  This paper proposes and demonstrates the real-time application of the LMA in developing a log-distance like propagation loss model based on received radio strength measurements conducted over deployed  ...  Compute the metric, CC , retract the step and raise up the damping parameter by a factor  up , that is     up .Otherwise, accept the step if   new ,  new rr and Check the convergence.  ... 
doi:10.5815/ijisa.2021.03.04 fatcat:kp7f3fqpcbeo7mdveszmyh3n5e

Faster Biological Gradient Descent Learning [article]

Ho Ling Li
2020 arXiv   pre-print
A number of algorithms have been developed to speed up convergence and improve robustness of the learning.  ...  Back-propagation is a popular machine learning algorithm that uses gradient descent in training neural networks for supervised learning, but can be very slow.  ...  Discussion DLR has shown the possibility of a local and biological gradient descent optimization algorithm that can speed up neural network training with back-propagation.  ... 
arXiv:2009.12745v1 fatcat:hwohq2pl2zab3iecsl62ilkfdm

Residual strength prediction for aircraft panels with Multiple Site Damage, using the ?EPFEAM? for stable crack growth analysis

C. R. Pyo, H. Okada, S. N. Atluri
1995 Computational Mechanics  
In this paper, a new analytical method for solving stable crack propagation problems in a ductile panel with a row of cracks, is presented.  ...  The crack propagation algorithm utilizes the analytic crack solution to release the stresses ahead the crack tip. The T~ integral is employed as the crack extension criterion.  ...  propagation algorithm, based on the finite element alternating method, we first solve a problem of crack propagation in a linear elastic solid.  ... 
doi:10.1007/bf00369780 fatcat:deznejii5bgcxc75pbkkigkkwe

Efficient Irregular Wavefront Propagation Algorithms on Intel(R) Xeon Phi(TM)

Jeremias M. Gomes, George Teodoro, Alba de Melo, Jun Kong, Tahsin Kurc, Joel H. Saltz
2015 2015 27th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)  
Therefore, we propose a new IWPP algorithm that can take advantage of the supported SIMD instruction set.  ...  We investigate the execution of the Irregular Wavefront Propagation Pattern (IWPP), a fundamental computing structure used in several image analysis operations, on the Intel® Xeon Phi™ co-processor.  ...  Related Work The IWPP may be modeled as a graph scan algorithm with multiple sources.  ... 
doi:10.1109/sbac-pad.2015.13 pmid:27298591 pmcid:PMC4903027 fatcat:byrmgedw4vf7fbcdbv6pzwr2za
« Previous Showing results 1 — 15 out of 446,938 results