Anand Rangarajan, Alan Yuille, Eric Mjolsness · 2008
The softassign quadratic assignment algoithm is a discrete time, continuous state, synchronous updating optimizing neural network. While its effectiveness has been shown in the traveling salesman problem, graph matching and graph partitioning in thousands of simulations, there was no associated study of its convergence properties. Here, we construct discrete time Lyapunov functions for the cases of exact and approximate doubly stochastic constraint satisfaction which can be used to show convergence to a fixed point. The combination of good convergence properties and experimental success make the softassign algorithm the technique of choice for neural QAP optimization. 1
Cited by 0
Author(s) Nokia, Workpackage Wp, Est Person Months et al. · 2008
Version: v06 Total number of pages: 80 This deliverable has two major subjects. The first one is a presentation and evaluation of existing and new soft-configurable technologies. Different categories of concepts are introduced and compared. A final evaluation is done to find out those approaches, which best fit to the special situation in MUMOR. The second major subject is an analysis of the examined systems UMTS/FDD, HSDPA/FDD and UMTS/TDD in terms of possible re-configuration, i.e. optimised solutions for multi-mode baseband designs are presented. The focus in this document is on algorithm level, but final optimisation will only show in the implementation. For this reason measurements are defined and evaluated for both algorithm level and implementation level to have a good estimation how the decisions and optimisation made on algorithm level will influence the final implementation.
Cited by 0
Dr K. Rameshbabu, B Sreelatha, P. Bharathi · 2015
Abstract — The JPEG2000 standard for still image compression provides rich set of features, including lossless and lossy compression, region of interest coding, and progressive transmission. JPEG2000 provides lower bit rates at the same rate distortion and subjective quality levels as the older JPEG standards. The features were realized using two techniques namely the Discrete Wavelet Transform (DWT), and Hardware architecture for the proposed process was developed, realized in VHDL, and synthesized for implementation on FPGA XILINX
Cited by 0
turan, feyza · Mendeley Data · 2025
This algorithm includes the MATLAB file used for the calculations in the paper titled "Technical and Economic Assessments in Customized Cost Analysis for Second-Life Batteries."
Cited by 0Open access
Samuel C. Hsieh · AccessScience · 2015
AccessScience is an authoritative and dynamic online resource that contains incisively written, high-quality educational material covering all major scientific disciplines. An acclaimed gateway to scientific knowledge, AccessScience is continually expanding the ways it can demonstrate and explain core, trustworthy scientific information that inspires and guides users to deeper knowledge.
Cited by 0
Mingyan Yu, Ying Yan, Haiyuan Liu et al. · 2016
algorithm Abstract: This paper combines the global optimization ability of the symbiotic parallel genetic algorithm and the local optimization ability of the improved LMBP algorithm to research,proposes an neural network structure optimization symbiotic parallel genetic algorithm and to testify the correctness and validity of this algorithm by the simulation experiments. This algorithm realizes unequal length coding, large probability cross, small probability variation, cross and variation between sub-populations, information exchanging between sub-populations etc, and successful implements the optimization of neural network structure. The experimental results shows that this algorithm having reliable performance, searching a large space, be able to find the feasible solution within the specified generalization and approximation error range.
Cited by 0
John A. Matthews · Encyclopedia of Environmental Change · 2014
Cited by 0
2012
A multipole expansion approximates the potential at the origin due to particles within a sphere centered at a distant point r. space Evaluating the energy of a system of N bodies interacting via a pairwise potential is naïvely an O(N) problem. The Fast Multipole Method [1] allows approximation to a specified level of accuracy in only O(N) time. It is widely used in molecular dynamics and astrophysical simulations. r multipole expansion 3D space is divided into an octree of cubic boxes.
Cited by 0
Ritu Devi, Mukesh Sharma · 2015
Classification is one of the major research area of image mining. The classification is basically to categorize the related images in similar groups. In this paper, the image classification for the satellite images is performed. The complete work is the hybrid approach that will use the concept of moment analysis along with histogram analysis to perform the image classification. Finally the segment detection will be performed by using the improved moment analysis (IMA) algorithm. The work is divided in two phases, the histogram analysis phase will improve the efficiency and the moment based analysis will improve the accuracy of the work. Finally a new technique to polarimetric SAR image classification is introduced & obtained results are compared with other competitive classifiers result.
Cited by 0
Franco P. Preparata, Eli Upfal · 2015
Cited by 0
I. Mourtaji, M. Bouhorma, M. Benahmed et al. · 2015
Ad Hoc Networks provide a real opportunity to design flexible networks, very simple to deploy. However they remain a particular computation environment, characterized by the deficiency of pre-existed and centralized infrastructure. In the other hand, SIP protocol, which knows a huge booming in internet networks, requires centralized entities, like proxy server, registrar server and location service; consequently SIP is not adapted to Ad Hoc networks. We have presented in a new technique VNSIP (Virtual Network for Session Initiation Protocol) to fix the problem related to constraints of SIP deployment in MANET (Mobile Ad Hoc Networks). In this paper we use a new algorithm which we have called MCAC (MANET Call Admission Control) to improve VNSIP Performances.
Cited by 0
SpringerReference · 2011
Cited by 0
Shashi Shekhar, Hui Xiong · Encyclopedia of GIS · 2008
Cited by 0
Gurtej Singh, Amritpal Kaur · 2015
Nature plays a vital role in solving complicated problems in computer science. It helps us in finding the optimal desired way to solve extremely dynamic, difficult and robust problems. Bio inspired algorithm help us to cope with the technological need of a new era. Many researchers did enormous work in this area from the past few decades. However, still there is a large more scope for bio inspired algorithm (BIA) in exploring new application and opportunities in cloud computing. This paper presents a broad, detailed in of some Bio inspired algorithm, which was used in order to tackle various challenges faced in Cloud Computing Resource management environment.
Cited by 0
Gary Kafer, Tyler Quick · 2023
Cited by 1Open access
Anne Kølbæk Iversen, Lotte Løvholm · 2023
Algorithm<br/>An algorithm, in a nutshell, is a step-by-step guide to solving a problem. It’s a set of instructions, like a recipe. Computer algorithms are sets of rules for calculations that take historical data and predict future successful outcomes.<br/><br/><br/><br/>How does the performativity of algorithms relate to that of bodies? And how may performative artistic practices contribute to a rethinking of the interrelations between bodies and the discourses, histories, technologies, practices, and networks they are actualized within and entangled with? Through the notion of “algorithm,” which titles this publication, we wish to explore further the complex interconnections of algorithmic information processing, technical infrastructures, the performativity of bodies and bacteria as well as cultural scripts, or codes.
Cited by 0
Eur Trans Telecomms, S. M. S. Sadough, M. Ichir et al. · 2013
Ultra wideband (UWB) communications involve very sparse channels, since the bandwidth increase results in a better time resolution. This property is used here to propose an efficient algorithm jointly estimating the channel and the transmitted symbols. More precisely, this paper introduces an expectation-maximisation (EM) algorithm within a wavelet domain Bayesian framework for semi-blind channel estimation of multiband orthogonal frequency-division multiplexing (MB-OFDM) based UWB communications. A prior distribution is chosen for the wavelet coefficients of the unknown channel impulse response (CIR) in order to model a sparseness property of the wavelet representation. This prior yields, in maximum a posteriori (MAP) estimation, a thresholding rule within the EM algorithm. We particularly focus on reducing the number of estimated parameters by iteratively discarding ‘insignificant ’ wavelet coefficients from the estimation process. Simulation results using UWB channels issued from both models and measurements show that under sparsity conditions, the proposed algorithm outperforms pilot based channel estimation in terms of mean square error (MSE) and bit error rate (BER). Moreover, the estimation accuracy is improved, while the computational complexity is reduced, when compared to traditional semi-blind methods. Copyright © 2008 John Wiley &amp; Sons, Ltd. 1.
Cited by 0
Alexis Boukouvalas, Dan Cornford, A. Boukouvalas et al. · 2009
Cited by 0
Li Yang (6520), Zhiming Zheng (736314) · Figshare · 2018
Cited by 0Open access
Chengqi Wang (849894), Xiao Zhang (152326), Zhiming Zheng (736314) · Figshare · 2016
Cited by 0Open access