％ Train a two layer neural network with the Levenberg-Marquardt
％ method.
％
％ If desired, it is possible to use regularization by
％ weight decay. Also pruned (ie. not fully connected) networks can
％ be trained.
％
％ given a set of corresponding input-output pairs and an initial
％ network,
％ [W1,W2,critvec,iteration,lambda]=marq(NetDef,W1,W2,PHI,Y,trparms)
％ trains the network with the Levenberg-Marquardt method.
％
％ The activation functions can be either linear or tanh. The
％ network architecture is defined by the matrix NetDef which
％ has two rows. The first row specifies the hidden layer and the
％ second row specifies the output layer.
The combinatorial core of the OVSF code assignment problem
that arises in UMTS is to assign some nodes of a complete binary
tree of height h (the code tree) to n simultaneous connections, such that
no two assigned nodes (codes) are on the same root-to-leaf path. Each
connection requires a code on a specified level. The code can change over
time as long as it is still on the same level. We consider the one-step code
assignment problem: given an assignment, move the minimum number of
codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm
to solve the problem optimally. We show that DCA does not
always return an optimal solution, and that the problem is NP-hard.
We give an exact nO(h)-time algorithm, and a polynomial time greedy
algorithm that achieves approximation ratio Θ(h). Finally, we consider
the online code assignment problem for which we derive several results
Description
The art galleries of the new and very futuristic building of the Center for Balkan Cooperation have the form of polygons (not necessarily convex). When a big exhibition is organized, watching over all of the pictures is a big security concern. Your task is that for a given gallery to write a program which finds the surface of the area of the floor, from which each point on the walls of the gallery is visible. On the figure 1. a map of a gallery is given in some co-ordinate system. The area wanted is shaded on the figure 2.
Start it with this document[13 pages only] if you want to develop some good web application using Java instead of reading large books.
This document prepared by myself. Clearly explains what is JDBC. and how you can connect to a particular database through JSP and Servlets. Examples are given.
Managing Humans is a selection of the best essays from Michael Lopps web site, Rands In Repose. Drawing on Lopp s management experiences at Apple, Netscape, Symantec, and Borland, this book is full of stories based on companies in the Silicon Valley where people have been known to yell at each other. It is a place full of dysfunctional bright people who are in an incredible hurry to find the next big thing so they can strike it rich and then do it all over again. Among these people are managers, a strange breed of people who through a mystical organizational ritual have been given power over your future and your bank account. Whether you re an aspiring manager, a current manager, or just wondering what the heck a manager does all day, there is a story in this book that will speak to you. You will learn:
* What to do when people start yelling at each other
* How to perform a diving save when the best engineer insists on resigning
* How to say "No" to the person who signs your paycheck
it is lms algo based noise cancellation program. with the p4 256 mb ram, xp/vista/dos/linux platform you can run it.
the procedure is given in documents.
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
I always believe that one will easily lag behind unless he keeps on learning. Of course, if I am given a chance for advanced studies in this famous University , I will stare to effort to master a good command of advance my capability.
