Connectionist Network and its Application for Optimization
Journal Title: Indian Journal of Computer Science and Engineering - Year 2011, Vol 2, Issue 2
Abstract
Connectionist network is the network of processing elements. These processing elements are connected with each other. It suggests that we may consider it as the fully connected network. The processing elements of this network are basically MP model neuron and normally, employee the bipolar non-linear output function. This network can be used as the associative memory if some constraints are imposed. The constraints of symmetric interconnections between the nodes and bipolar information processing are the normally used constraints. The associative memory feature of connectionist network has various applications in real world. The most widely used application is the optimization.
Authors and Affiliations
SUNITA CHAND , DR. MANU PRATAP SINGH
DIGITAL WATERMARKING SCHEMES FOR AUTHORIZATION AGAINST COPYING OR PIRACY OF COLOR IMAGES
This paper presents digital watermarking methods for authorization against copying or piracy of color images. Watermarking is a very important field for copyrights of various electronic documents and media. With images w...
Disorder Speech Clustering For Clinical Data Using Fuzzy C-Means Clustering And Comparison With SVM Classification
Speech is the most vital skill of communication. Stammering is speech which is hesitant, stumbling, tense or jerky to the extent that it causes anxiety to the speaker. In the existing system, there are many effective tre...
Program and Data Protection: Copyright, Patent, Trade Secret and Trademark
The study of this paper will describe the perspective view of legal issues and propose the alternative approaches to protecting software. Some legal issues like copyright, patent and trademark are used for providing the...
A hybrid approach based on EP and PSO for proficient solving of Unit Commitment Problem
Unit Commitment Problem (UCP) is a nonlinear mixed integer optimization problem used in the scheduling operation of power system generating units subjected to demand and reserve requirement constraints for achieving mini...
A GENETIC ALGORITHM FOR FINITE STATE AUTOMATA
The genetic algorithm is described, including its three main steps: selection, crossover, and mutation. A comparison between implementation costs and running times of regular expressions matching a string is then made. T...