|
|
|
|
|
Total Hits: 11 | Today: 0
|
Author: point64
|
Rating:
|
|
Base 64 literally means a positional numbering system using a base of 64. It is the largest power of two base that can be represented using only printable ASCII characters. This has led to its use as a transfer encoding for email among other things. All well-known variants of base 64 use the characters A–Z, a–z, and 0–9 in that order for the first 62 digits but the symbols chosen for the last two digits vary considerably between different systems that use base 64....
|
|
|
|
Total Hits: 14 | Today: 0
|
Author: Ethan Wilansky and Paul Olszewski and Rick Sneddon
|
Rating:
|
|
At the 2008 Office System Developer's Conference, one presenter metaphorically described a .?NET developer's first look at SharePoint® as equivalent to an experienced mountain climber staring at a smooth wall 100 feet tall and trying to figure out exactly how to scale it. Many Microsoft products offer a dizzying array of approaches to completing a task, and deploying custom SharePoint applications is a good example of such a case. Because SharePoint is a complex and sophisticated application pl...
|
|
|
|
Total Hits: 27 | Today: 0
|
Author: John Simmons / outlaw
|
Rating:
|
|
One of the most pervasive problems we face here at CodeProject is an inability to properly format articles. I think the most probable cause for this is that article authors use Microsoft Word or some other program to edit their article text, convert it to HTML, and then paste that HTML into the article editor in the Article Submission Wizard....
|
|
|
|
Total Hits: 38 | Today: 1
|
Author: Thanh Dao
|
Rating:
|
|
If you want to aggregate a web service with your application service, or if you are trying to implement someone else's WSDL, then you need to pay attention while viewing them. That means you are encountering the web service interoperability problem. That was the problem I had too, and I thought that having a GUI for viewing a WSDL like tree structure could be really cool....
|
|
|
|
Total Hits: 63 | Today: 1
|
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: 61 | 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....
|
|
|
|
Total Hits: 129 | Today: 0
|
Author: George Shagov
|
Rating:
|
|
In the beginning was � a word. And the word was � an algorithm!? Or should I say al-khwarizm? What Wikipedia says about the term algorithm?
Citing: �An algorithm (the word is derived from the name of the Persian mathematician Al-Khwarizmi), is a finite set of well-defined instructions for accomplishing some task which, given an initial state, will terminate in a corresponding recognizable end-state�.
Al-Khwarizmi? Citing: �Abu Abdullah Muhammad bi...
|
|
|
|
Total Hits: 119 | 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: 143 | 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: 117 | 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: 123 | Today: 1
|
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: 111 | 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...
|
|
|
|
|
|
