Refix solves the problem of binary dependency management in .NET solutions. Refix is the only binary you'll need to commit to your source code repository!
The XMLCPP library provides the implementation of XmlPull API v1 in C++. It can handle any encoding that are supported by `libiconv'. The parsed results are available in the form of std::wstring. So it can handle all unicode character set.
JQFramework is a set of classes designed to ease the production of highly parallel code in C#, for use on multi-processor systems and/or grid and cloud computing.
An interactive binary search tree. The user may interact with the tree by performing rotations, balancing, insertions, and deletions. For educational purposes
The MATLAB file contains a method to find the value of pi. This is just an extension of the general method of finding pi from within a circle. It uses 3D-matrices and some more stuffs, which can be very helpful for educational purposes. Also, do...
Testing a Full-Text Search Stemmer in C# is an informative article in which the author discusses about testing the output of the stemmer component in C#. You can use the stemmer component for FREETEXT queries and CONTAINS queries using the...
The role of private UDDI nodes in Web services, Part 1 is an online ASP.NET article for one of the advanced technology UDDI, involved in developing web services. The author has focussed on the ultimate role of UDDI in developing web services and...
This is an implementation of the binary search algorithm in (almost) one line. Given a number 'n' and a list 'L', the function returns the index of the number on the list, or -1.
Binary search trees provide O(lg n) performance on average for important operations such as item insertion, deletion, and search operations. Balanced trees provide O(lg n) even in the worst case. GNU libavl is the most complete,...
This function find the percentile of a list of values. Note that the list must be sorted already.
A simple example demonstrating the construction of binary trees.
A simple little task, how to find the intersection of two hashes. There's probably many ways to do this but there is one way to avoid...
The effect of fixed-point arithmetic in 16-bits PID controller C routines on the closed-loop precision is shown in this Simulink model.
Two Simulink blocks that implement single and double precision 16-bits PID C routines are...
CLAW is a C++ Library providing various tools in different domains, like a Tweener framework, BAÂ©zier curves manipulation, a map with multiple value types, a binary search tree container implemented as an AVL and an implementation of the...
Kruskal's algorithm is used to find the branches of a ''tree'' having the minimum weight in a system of branches. The application of this algorithm is wide. One example is in finding the shortest (and cheapest) path of interconnecting several...
aC++code which is written in "binary search tree" method,and works like dictionary(included each word and its meaning in a Node)this programe has to be able to add,update and pass the tree(in inorder way) which you definde.
Being a MySQL DBA , one faces a common issue in replication environment -> Disk space issue on master, since the number of binary logs have increased. Now, one of the solution to this would be using expire_logs_days parameter in your mysql...
this will find the solution of U''=k*U*U' by using taylor series 3rd order and secant method
it gives an idea about the nonlinear ode method and also gives the idea of solving problem in matlab
Find the projection of point P in R^n on the ellipsoid
E = { x = x0 + U*(z.*radii) : |z| = 1 }, where U is orthogonal matrix of the orientation of E, radii are the axis lengths, and x0 is the center.
Or on generalized conic E...
The purpose of this plugin is to strengthened our on page SEO by adding new internal linking to the blog post using the most popular keywords used by search engine visitors to find the blog post from search engine ( incoming search terms ). |