|
|
|
|
|
Total Hits: 3 | Today: 0
|
Author: Pete O'Hanlon
|
Rating:
|
|
So, I’ve just started looking at a new .NET language from Microsoft called Axum (available here). At this point you might be tempted, as I originally was, to complain that there’s no need for Microsoft to produce yet another language. After all, we have perfectly servicable languages in C#, VB.NET and (for the linguistically adventurous) F#. Why on earth is Microsoft wasting its time on another language? Well, it turns out that there’s a very good reason for them to be looking into creating a ne...
|
|
|
|
Total Hits: 30 | Today: 0
|
Author: Scott Burgett
|
Rating:
|
|
In this article, I'll explain how one can add a 5 day forecast to their website using the National Weather Service's Experimental National Digital Forecast Database XML Web Service.
The National Digital Forecast Database (NDFD) XML is a service that provides data from the National Weather Service's digital forecast database. Requests for data are made over the Internet via a SOAP request and responses are returned in an XML format. The web service exposes two functions:...
|
|
|
|
Total Hits: 13 | Today: 0
|
Author: azamsharp
|
Rating:
|
|
We all talk about webservices, webservices can do this and webservices can do that. But when we are asked to make one, we hesitate. Maybe it's because we never made a webservice before, and all the time playing with Webforms and Windows Forms or even Console Applications. By the way, I love Console applications. In this article, I will show you how to create a simple webservice that is consumed by a Console application client....
|
|
|
|
Total Hits: 15 | Today: 0
|
Author: Advosol Inc.
|
Rating:
|
|
The OPC XML-DA standard and the currently widely used OPC DA V2 standard address the same tasks but the server interface is quite different, due to their different base, web services respectively DCOM. Developers of OPC client applications have to be aware of these differences. The sample client applications show how the Read and Subscribe/Poll functions are used from different kinds of applications. The VB.NET and C# samples use the .NET web services support, the HTML/ASP scripts use the MSSOAP...
|
|
|
|
Total Hits: 10 | Today: 0
|
Author: Alexandru Ghiondea
|
Rating:
|
|
Because of the stateless nature of the HTTP protocol a web server considers every request as a new one. This means that, if you want to track a series of related calls, you must establish a way of identifying if the current request is a new request or is related to another request. One way of doing that is to generate a token for the first request and then reuse the same token for related requests. The token can be anything from a number to a complex object, the only important thing is that the ...
|
|
|
|
Total Hits: 10 | Today: 0
|
Author: Stephane Rodriguez.
|
Rating:
|
|
Disclaimer: this article and source code are not endorsed by Microsoft. Use it at your own risk. You can freely reuse this code. Microsoft recently (as of February 5, 2006) shipped a preview of their new Internet Explorer release, along with an integrated RSS experience. This includes an RSS store mechanism combined with a documented COM interface. While Internet Explorer 7 is the default client for this RSS store, I thought it would be interesting to get behind the API and understand how the RS...
|
|
|
|
Total Hits: 27 | Today: 0
|
Author: Joseph A Reddy
|
Rating:
|
|
For me, in software development, it is all about why. I feel a very strong need to understand why I am doing everything and anything I do. Furthermore, I am upset with myself when I cannot clearly state why, and on the flip side take pride in knowing why: why I choose a minimum of three layers in darn near any application, why I rarely if ever read books on a language, why I don’t blindly choose auto numbers for primary keys in databases, why I prefer business-object-oriented development, why I...
|
|
|
|
Total Hits: 29 | Today: 0
|
Author: Sateesh Kumar
|
Rating:
|
|
In this article, we will look into setting up the environment for SLP Services. For small ISVs, it is hard to maintain their own licensing systems. So, it is feasible to go with SLP online services provided by Microsoft. In order to use SLP online services, we need to have an account. Go to SLP Site and click on New User as shown below:...
|
|
|
|
Total Hits: 39 | Today: 0
|
Author: en.csharp-online.net
|
Rating:
|
|
The heap sort does not require massive recursion or multiple arrays to work. This makes it an attractive option for very large data sets of millions of items. The heap sort works as it name suggests - it begins by building a heap out of the data set, and then removing the largest item and placing it at the end of the sorted array. After removing the largest item, it reconstructs the heap and removes the largest remaining item and places it in the next open position from the end of the sorted arr...
|
|
|
|
Total Hits: 28 | Today: 0
|
Author: en.csharp-online.net
|
Rating:
|
|
The Insertion sort works just like its name suggests - it inserts each item into its proper place in the final list. The simplest implementation of this requires two list structures - the source list and the list into which sorted items are inserted. To save memory, most implementations use an in-place sort that works by moving the current item past the already sorted items and repeatedly swapping it with the preceding item until it is in place....
|
|
|
|
Total Hits: 28 | Today: 0
|
Author: en.csharp-online.net
|
Rating:
|
|
The quick sort is an in-place, divide-and-conquer, massively recursive sort. As a normal person would say, it's essentially a faster in-place version of the merge sort. The quick sort algorithm is simple in theory, but very difficult to put into code. The recursive algorithm consists of four steps:
1. If there are one or less elements in the array to be sorted, return immediately.
2. Pick an element in the array to serve as a "pivot" point. (Usually the left-most element in the array...
|
|
|
|
Total Hits: 27 | Today: 0
|
Author: en.csharp-online.net
|
Rating:
|
|
The merge sort splits the list to be sorted into two equal halves, and places them in separate arrays. Each array is recursively sorted, and then merged back together to form the final sorted list. Elementary implementations of the merge sort make use of three arrays - one for each half of the data set and one to store the sorted list in. The below algorithm merges the arrays in-place, so only two arrays are required. There are non-recursive versions of the merge sort, but they don't yield any s...
|
|
|
|
|
|
