Computational Infrastructure for Operations Research Home Page. MOEA Framework. Armadillo C++ matrix library. Mathnet/mathnet-numerics. Math.NET Numerics - Home. Math.NET Neodym - Signal Processing - Home. Math.NET Yttrium - Symbolic Graphs (Experimental) - Home. MiniZinc. Or-tools - Operations Research Tools developed at Google.
MSDN Magazine Authors. James McCaffrey New features in .NET 4.5 that make it much easier to work with an effective alternative to Windows Communication Foundation called async socket programming.
James McCaffrey shows how async socket programming works. March 2014 Extracting frequently occurring item-sets from a list of transactions is a surprisingly tricky but useful task. This article explains the Apriori algorithm and presents a complete demo program. January 2014 Following on his previous column in which he explained the details of RBF networks, James McCaffrey now provides practical guidance on implementing RBF network training. December 2013 The Computer Security Division of the U.S. government's National Institute of Standards and Technology provides resources to protect information systems against cyber threats. Government Special Issue 2013 Radial basis function (RBF) networks are software systems that have certain similarities to neural networks.
October 2013 September 2013 August 2013 June 2013 May 2013. Hilbert Engine. Multidimensional problems require a multidimensional solution Hilbert Technology Inc. holds seven issued US patents on its unique mathematical method for storing, organizing and analyzing data.
The core of the Company’s software technology, the Hilbert Engine, uniquely transforms relational data into a multidimensional coordinate system (Hilbert space) which enables new capabilities and flexibilities in searching, sorting and querying data. Hilbert applies this enhanced functionality to structured, unstructured and hybrid (containing both structured and unstructured) data formats. Once data are migrated (transformed) into Hilbert’s multidimensional space, the data are immediately viewable for inclusion into any analysis without the costly and time-consuming normalization step.
The data stay where they are, they are not physically consolidated into a central data store. Hard core multicore with TestNG. I recently implemented a new feature in TestNG that took me down an interesting technical path that ended up mixing graph theory with concurrency.
Here are a few notes. The problem TestNG allows you to declare dependencies among your test methods. Here is a simple example: In this example, b1() will not run until a1() has completed and passed. Things get more interesting when you want to run these four test methods in parallel. The current algorithm is therefore simple: Break all the test methods into two categories: free and dependent.Free methods are thrown into the thread pool and executed by the Executor, one method per worker, which guarantees full parallelism.Dependent methods are sorted and run into an executor that contains just one thread.
This has been the scheduling algorithm for more than five years. Improvements For example, consider the following example: Since all four methods are dependent, they will all be running in the same thread, regardless of the thread pool size. Or… PCL - Point Cloud Library (PCL) Solver Foundation. Using Microsoft Solver Foundation to solve linear programming tasks - Gunnar Peipman's ASP.NET blog. One of soon-to-starts projects uses linear programming for some optimizations.
As it is not very familiar topic to me I started looking for examples and tools so I am prepared better when action starts. In this posting I will show you how to solve simple linear programming tasks using Microsoft Solver Foundation – free math package available by DevLabs. Linear programming is used in many real-life calculations: business, economy, transportation, energy, telecommunications, manufacturing etc. The goal is holy: to make optimal decisions and save resources like money, time and materials.
Prerequisites What is linear programming? Linear programming is specific case of mathematical programming or optimization. We have function to be maximized: f(x,y) = c1x1 + c2x2. Based on this information we will find the maximum value. Example exercises I found some good linear programming exercises from Brunel University home page. A company makes two products (X and Y) using two machines (A and B). Linear programming solution examples. OR-Notes are a series of introductory notes on topics that fall under the broad heading of the field of operations research (OR).
They were originally used by me in an introductory OR course I give at Imperial College. They are now available for use by any students and teachers interested in OR subject to the following conditions. A full list of the topics available in OR-Notes can be found here. Linear programming solution examples Linear programming example 1997 UG exam A company makes two products (X and Y) using two machines (A and B). At the start of the current week there are 30 units of X and 90 units of Y in stock. The demand for X in the current week is forecast to be 75 units and for Y is forecast to be 95 units. Formulate the problem of deciding how much of each product to make in the current week as a linear program. Solution Let x be the number of units of X produced in the current week y be the number of units of Y produced in the current week then the constraints are: maximise.