LinearProgramming[c, m, b] finds a vector x that minimizes the quantity c.x subject to the constraints m.x >= b and x >= 0. LinearProgramming[c, m, {{b_1, s_1}, {b_2, s_2}, ...
MenuView[{lbl_1 -> expr_1, lbl_2 -> expr_2, ...}] represents an object in which selecting the menu item with label lbl_i displays expr_i. MenuView[{lbl_1 -> expr_1, lbl_2 -> ...
VertexEccentricity[g, s] gives the length of the longest shortest path from the source s to every other vertex in the graph g.
When derivatives cannot be computed symbolically, "Newton's" method will be used, but with a finite difference approximation to the Jacobian. This can have costs in terms of ...
Secure Socket Layer (SSL) is a protocol for providing secure transactions between servers and clients. It uses a certificate to identify one or both ends of the transaction. ...
Algebraic is now available as the newly added built-in Mathematica kernel function AlgebraicNumber. ToCommonField and ToNumberFieldElement are now available as the newly ...
FindEulerianCycle[g] finds an Eulerian cycle in the graph g if one exists.FindEulerianCycle[g, k] finds at most k Eulerian cycles.
LogLinearPlot[f, {x, x_min, x_max}] generates a log-linear plot of f as a function of x from x_min to x_max. LogLinearPlot[{f_1, f_2, ...}, {x, x_min, x_max}] generates ...
Some database operations involve carrying out a sequence of database commands. For example, information in two different tables may need to be updated. In these cases it may ...
The World Wide Web is increasingly being used for communication between applications. The programmatic interfaces made available over the web for application-to-application ...