|
Benchmark Statistics on WebServers (.NET and/or Java) Hi Does anyone know of benchtests (memory overheads, cpu loads, delivery times, scalability) of J2EE, .NET, Websphere running a variety of different webpage generation technnologies (ASP, ASP.NET) and backend databases? I note with interest Facebook championing HipHop because it seems that PHP (and other script ... 19 Mar 2010 18:59
أكسب كارت شحن فئة 10 جنيهات لأى شبكة محمول فى مصر ÃßÓÈ ßÇÑÊ ÔÍä ÝÆÉ 10 ÌäíåÇÊ áÃì ÔÈßÉ ãÍãæá Ýì ãÕÑ ÃÏÎá æÊÚÑÝ Úáì ßíÝíÉ ÇáÍÕæá Úáì ßÇÑÊ ÔÍä áÃì ÔÈßÉ ãÍãæá Ýì ãÕÑ ãä åäÇ http://www.agd3as7ab.com/vb/showthread.php?p=7697#post7697... 19 Mar 2010 18:59
Simple question on XML Schema Greetings, I have two newbie questions. 1) Using XML Schema, how can I describe an XML document in which the root element is either A or B? Also, using DTD, how can the same be achieved? 2) In an XML driven messaging system, is it a good design practice to use XML documents with different root elements to ... 18 Mar 2010 05:55
Optimal string copy performance > I need to copy some RAM memory area to the screen buffer with as good a performance as possible. The prerequisites/restrictions are: 1.) it has to work under OS/2 - that is with 32-bit legacy - no 64-bit instructions 2.) if possible it should support INTEL and AMD CPUs but I might thin... 18 Mar 2010 04:49
Unspecified? This fragment of code is from zlib: /* We check for insufficient lookahead only every 8th comparison; * the 256th check will be made at strstart+258. */ do { } while( *++scan == *++match && *++scan == *++match && *++scan == *++match && *++scan == *++match... 17 Mar 2010 18:39
Warning to newbies Ted DeLoggio <tdeloggio(a)gmail.com> wrote: Rod Pemberton wrote: "spinoza1111" <spinoza1111(a)yahoo.com> wrote in message news:8e7a446f-d1b3-4566-a9cb-a50dcee719cc(a)s25g2000prd.googlegroups.com... Steve Wozniak has asked if the Toyota failures aren't software. Unlikely... No offense to the ... 16 Mar 2010 16:13
Idiotic programming style edicts > If an obscure technique is being employed, then a comment to that effect is a helpful pointer but I have seen _REALLY USEFUL_ comments along the following lines ... x := X + 1 ; increment x ... which only serve to increase the noise floor. In our shop, those appeared when we ... 20 Mar 2010 00:33
System Calls On Mar 14, 9:28 pm, "David H. Lipman" <DLipman~nosp...(a)Verizon.Net> wrote: From: "Karthik Balaguru" <karthikbalagur...(a)gmail.com> | On Mar 14, 6:08 am, "David H. Lipman" <DLipman~nosp...(a)Verizon.Net> | wrote: From: <spi...(a)freenet.co.uk> | And verily, didst Karthik Balaguru <karthikbalagur..... 17 Mar 2010 22:17
polynomial multiplication I am trying to solve the problems in "Data Structures and Algorithm Analysis in C". One of the questions asks you to find algorithms to find the product of two polynomials. The polynomials are represented using linked lists. The terms in the list may not be in sorted order. However the product itself should be a l... 19 Mar 2010 23:27
Looking for a development tool to list all the functions in a ?source file Lucius Sanctimonious <concordate(a)gmail.com> wrote: On Mar 5, 2:04 pm, Ramon F Herrera <ra...(a)conexus.net> wrote: I do most of my server-based coding using vi and Linux. I could use a CLI-based tool that takes a C or C++ file and displays all the function names in it, with signatures. TIA, ... 15 Mar 2010 01:21
Survey about 'The view of the IT staff on open source software' walec51 <walec5(a)gmail.com> wrote: Paul's point is that if you're only asking usenet, you'll get a ver specific subset of the IT community. Usenet users are hardly indicative of the general feelings/view points of the IT/programming community. In order to get a better sample size/distribution, you'd have to show ... 14 Mar 2010 15:25
A question about programming... Am I right to assume that the reason why most people take up programming is because they like programming? I'm just curious because the reason I took up programming was because it seemed like a safe outlet to escape my ongoing battles with alcoholism and depression. Over time, I learned to express my hate and anger... 16 Mar 2010 18:34
translating I am trying to translate this C++ program into C. I don't know if I'm writing code that would work or not. I am open to any critique. What they have-- /* chunks.cpp * * List the majors chunks of a RIFF file * */ #include <stdio.h> typedef unsigned char BYTE; typedef unsigned int DWORD; int Ge... 14 Mar 2010 16:32
instructor's solutions manual for Bayesian Core by Christian P. Robert and Jean-Michel Marin I have solutions manuals for the scientific textbooks .. They are all in PDF format .. If you are interested in any one, simply send me an email to macmorino(at)gmail(dot)com .. Please this service is NOT free. Here are solutions manuals to some titles.. Instructor's solutions manual for A Course in Modern Mat... 13 Mar 2010 16:28
Mindcontrol ... Hello, They have tortured Mr. Khedira, Amine Moulay Ramdane and many others with advanced Mindcontrol technologies (weapons ...) etc. ... We must not forget those innocents ! http://www.youtube.com/watch?v=PtrYF7pGZlM http://www.youtube.com/watch?v=eL35CyQfKx0&feature=related http://www.youtu... 11 Mar 2010 19:06
disassembly On 3/11/2010 6:45 AM, Bill Cunningham wrote: Can anyone read this disassembly of Adobe's media player? It kind of big so for whoever cares it's gzipped. I see loops and alot of 16 bit registers being used. (A) This is probably in direct violation of the EULA you agreed to when you downloaded the soft... 14 Mar 2010 20:59
ParallelQueueh ... Hello, Description: Description: Parallel algorithm to handle unbounded queue FIFO that use a parallel hash table (look at inthashlist inside the zip) with O(1) (best case) and O(n)(worst case) access. It's for educational purpose. Language: FPC Pascal v2.2.0+ / Delphi 5+: http://www.freepascal.org/... 11 Mar 2010 16:50
Depth of Binary Tree I have come accross with the code for finding Depth of tree, i am not getting this, please anyone throw a light on this .... http://www.math.bas.bg/~nkirov/2010/NETB201/slides/ch06/pic3.jpg please explain in code level rather than theoratical level. int depth(treenode *p) { if(p==NULL)return(0); i... 15 Mar 2010 14:36 |