var fDesc=new Array(); fDesc[1] = "It is capable of launching up to ten simultaneous retrieval threads, filtering files on basis of type as well as size, searching for keywords and lots more. Teleport can mimic browsers more effectively on account of Cookie support."; fDesc[2] = ", you are given the task of uncovering the secret treasures hidden there by the Incas for hundreds of years. With great graphics and a match-3 game play, Treasure Puzzle is a great option among"; fDesc[3] = "through a plug-in. This program enables corporations to easily visualize, analyze and manipulate data for efficient enterprise information structural design."; fDesc[4] = "kinds of appliances, cabinets, tiling, decoration, technical symbols and space constraints. This new version features virtual reality, improved dimensions and much more."; fDesc[5] = "boring static wallpaper on your desktop. You can change the wallpaper with a specific delay or at specific times. Wallpapers are easily managed in multi-level categories which can have time constraints to give your desktop a time or season dependent look."; fDesc[6] = "1.0 comes with astonishing capabilities in form of a geometry software package that allows the user to interact with any figure numerically as well as symbolically, rather than just dealing with its dimensions alone."; fDesc[7] = ", FoxPro, Microsoft Excel documents, Interbase/Firebird, Lotus 1-2-3, MySQL, Oracle, Paradox, SQL Server, Text, ODBC, XM"; fDesc[8] = "complete MS SQL database or part of one into MySQL records. Regardless of the reason for converting or overwriting, the program does it efficiently and accurately."; fDesc[9] = "give the classic match 3 mechanics a new twist, but also its general approach is original. With beautiful background images and soothing music, this game seems to have been designed to play relaxingly, without time constraints or pressures."; fDesc[10] = ", rotating and scaling Rhino objects without exporting them. The application features the ability to constrain objects to curves, force objects to look at other objects, look-along constraints, viewport keyframing, constrain viewport camera location and target to path, automatic"; fDesc[11] = "You can reduce your shipping costs as the program will help you to get the optimum design of a packet that will occupy the least space and fit in with other packets in a container."; fDesc[12] = ", intuitive graphical user interface to direct specify or import and solve any type of constrained optimization problems arising in various industrial, financial and educational areas.A constrained optimization problem is stated as a linear program that size is unlimited.The linear program solver is based on interior-point method (Mehrotra predictor - corrector algorithm) and optimized for large sparse linear programs. The solver exploits a sparsity of the constraint matrix by implementing state-of-art ordering algorithm to preserve the matrix sparsity and hence reduce the calculation time dramatically. Almost every stage of the linear programming calculation can be saved in the debug files or traced for the deep analysis. The user can specify the linear program constraints in a dense form using the grids or in a sparse form using the particular constraints editor. The dense form is..."; fDesc[13] = "actualization of the progress status for various tasks and projects. This can be done as many times as required. The automatic scheduling can be re-launched."; fDesc[14] = "Organize connections and SQL commands, explore database objects, use powerful scripter. Native support MSSQL,ORACLE,INFORMIX."; fDesc[15] = ", computing efficiency index depending on these parameters. Using IOSO NS you can quickly solve optimization problem."; function tCollapseAll(maxID) { document.getElementById("alls_action").innerHTML = "Expand descriptions"; var id=1; for (id=1; id <= maxID; id++) { if (document.getElementById("desc_" + id)) tShowHide(id, 2); } } function tExpandAll(maxID) { document.getElementById("alls_action").innerHTML = "Collapse descriptions"; var id=1; for (id=1; id <= maxID; id++) { if (document.getElementById("more_" + id)) tShowHide(id, 1); } } function tShowHide(id, show) { var s = document.getElementById("more_" + id); if ((s.innerHTML!=fDesc[id] || show==1) && show!=2) { s.innerHTML = fDesc[id]; } else { s.innerHTML = '...'; } }