|
|
|
Refined procedures for solving and performing sensitivity analysis on uni and multi dimensional, local or global optimization problems which may or may not have linear constraints. Specialized Linear programming algorithms based on the Simplex Algorithm and duality are included along with a framework for sensitivity analysis w.r.t. boundaries (duality, or direct approach), or object function coefficients.
This suite includes the following features: local unidimensional optimization; fast 'low level ' algorithms where the weight is on speed and not the accuracy of the results; bracketing algorithms - these methods find an interval where at least one extrema of a continuous function exists; locate algorithms - these methods converge to the extrema if the extrema is bracketed and the function under consideration is continuous; accurate `high level' algorithms; global unidimensional optimization - finds global minima / maxima; unconstrained local multidimensional optimization; unconstrained global multidimensional optimization; constrained optimization for derivable functions with linear constraints; linear programming - here the functions are linear and the constraints are linear; sensitivity Analysis - Stability of the value and location of the extremum
This product also contains the following feature:
GUI Bundle - we bundle a suite of graphical user interface JavaBean components allowing the developer to plug-in a wide range of GUI functionality (including charts/graphs) into their client applications.
|
|
|
global keys
local network administration
Global-Value-Chain Software
Draw family tree diagram
global data vault
-------------------------
|
|
Add refined procedures for solving and performing sensitivity analysis on uni and multi dimensional, local or global optimization problems which may or may not have constraints; to your .NET, COM and XML Web service Applications. Specialized Simplex Linear programming algorithm, including sensitivity analysis with respect to object functions coefficients or linear boundaries using a duality or direct approach.
This suite includes the following features:
Local UniDimensional -18 Distinct Algorithms involving different Location and Bracketing Algorithms. Bracketing: Acceleration, Parabolic extrapolation; Locate: Parabolic interpolation,
Linear, Brent, Cubic interpolation.
Global UniDimensional - Accurate high level algorithms for continuous and derivable object functions.
Local MultiDimensional - General Functions: Downhill simplex method of Nelder and Mead, Powell's method, Derivable functions: Steepest descent, Fletcher-Reeves, Polak-Riviere, Fletcher-Powell, Broyden-Fletcher-Goldfarb-Shanno
Global Multidimensional - Simulated annealing technique applied to local algorithm.
Constrained optimization - Linear: Rosen's gradient projection algorithm
Linear programming - Simplex algorithm, Duality, Sensitivity Analysis
This product also has the following technology aspects:
2-in-1: .NET and COM - Two DLLs, Two API Docs, Two sets of Client Examples all in 1 product. Offering a 1st class .NET and COM product implementation.
Extensive Client Examples - Multiple client examples including C# , VB.NET and C++.NET examples
Compatible Containers - Visual Studio 6 (incl. Visual Basic 6, Visual C++ 6), Visual Studio .NET (incl. Visual Basic .NET, Visual C# .NET, and Visual C++.NET), Borland's C++ Builder (incl. C++Builder, C++BuilderX, C++ 2005), Borland Delphi 3 - 2005, Office 97/2000/XP/2003.
WebCab Optimization (J2SE Edition): http://www.webcabcomponents.com/Java/demo/OptimizationJ2SEDemo.jar
WebCab Optimization for .NET: http://www.webcabcomponents.com/dotNET/demo/WebCabOptimizationDemoNETService.Msi |
|
Entry Service (ES) 3.1 is a software library for Java developers. It provides centralized access to distributed data though a single hierarchy of typed objects (entries). Entries can be stored in data sources of different types (XML files, RDBMS, etc.). Every data source is to be overbuilt with one entry service; services group together into one distributed hierarchy. Every service publishes its own part of a global entry (object) tree. The whole entry tree is accessible through any service running, through one program interface, in spite of where and how the objects are stored in fact. All the services provide the same view of data transparently.
Entries have stable and unique string identifier to refer from anywhere; the identifier reveals entry nesting structure. Entry nesting and service hierarchy are independent one from another, so entries can be moved into another service without changing their identifiers. ES-Path (XQuery/XPath-like language) exists to query the entry tree.
Distributed Refreshable Objects underlies this library, which adds more flexibility and efficiency to ES: a bunch of remote calls are collected and sent as one package through network; all remote entries are cached on client side with no stale data possible; subscription on entry changes is possible. All this is done with no any messaging server (peer-to-peer communication takes place), which gives very high scalability of the entry tree and possibility to use it in global scope.
The key features are:
- Single view of typed objects covering all data sources involved of any types (RDBMS, XML, etc.).
- Stable string object identifier to refer from anywhere; back reference navigation is supported;
- XQuery/XPath-like ES-Path language to query the whole tree.
- Remote entries are cached locally; no stale data is possible.
- No central messaging server needed to notify of changes; increased scalability.
- Effective network data interchange
Entry Service: http://www.fusionsoft-online.com/entryservice.php
|
|
|
|