ParallelHashList version 1.0 ...

Hello, Description A parallel HashList with O(1) (best case) and O(log(n))(worst case) access that use a hash based method with an array of MREWs. This will allow to parallelize the writes and reads in separate chains , and also to parallelize the reads in the same chain. Language: FPC Pascal v2.2.0+ / Delphi 5+: http://www.freepascal.org/ Operating Systems: Win , Linux and Mac (x86). For benchmarks and a capacity planning example look here: http://pages.videotron.com/aminer/parallelhashlist/queue.htm You will find the zipfile in: Welcome: http://pages.videotron

A code of indexing permutations with repeated elements

In an earlier thread "Q: Indexing a special kind of permutations" I asked for code of indexing permutations with 2 kinds of elements that are equal in number. A follow-up kindly provided code for the general case of arbitrary number of kinds of elements without restrictions. However, the part of the code for computing the index from a given permutation was missing. Later I did the coding myself for the special case that I needed. I have just done a (complete) coding for the general case with a test program attached below. M. K. Shen ---------------------------------------------

Min and Max in Logn

Could some one please tell me what is wrong with algorithm. I am looking for algorithm which can find min or max in unsorted array in log n time so here is my thought of divide and conquer algorithm. Divide the array in two half and keep dividing it recursively until we have two elements. return the min of those two element. As my complexity comes T(n)=2*T(n/2)+O(1) So it solution is logn if i am correct. Here is my psudo code. int fun(int l,int h) { if(l+1==h) return min(A[l],A[h]) if(l==h) return A[l] return min(fun(l,l+h/2),fun(l+h/2+1,h)) } Am i correct or wrong ?

avi and assembly

Does anyone know where I can get the file format info for RIFF and AVI? I received some info using google but no development info. I am using nasm to disassemble the binarys and I do get assembly. GAS (GNU assembler) can't handle it. Does a hexdump in linux display all binary information that consits of the "file" or program? I'd like to be able to view section and segments and their tables and headers but alas the BFD is win32/PE and not ELF. Bill

[CfP] 2nd International Workshop on Context-oriented Programming

Call for Papers =============== 2nd International Workshop on Context-oriented Programming (COP'10) at ECOOP 2010, Maribor, Slovenia, June 21 or 22, 2010 http://soft.vub.ac.be/cop10/ Important Dates =============== - Paper submission: April 19, 2010 - Paper notification: May 5, 2010 - Early registration: May 10, 2010 Background ========== Context information plays an increasingly important role in our information centric world. Software systems must adapt to changing contexts over time, and must change even while they are running. Unfortunately, mainstream programmi

UML Survey

I am currently conducting a study that focuses primarily on how programmers work with UML specifications. I would like to invite members to participate. I also encourage members to distribute the link to this survey to anyone (in your organization or others in the field) that has some familiarity with UML and would be able to complete the survey. http://www.surveymonkey.com/s/UML Thanks for your support. If you have any questions or would like to receive the results of this research, let me know by sending me an email. If you don't wish to be involved in any future research, just

Algorithms for linear inequalities

Apologies if the solution to the following is well known, but I haven't managed to find anything. Given k linear inequalities in n real variables, i.e. a^i_1 x_1 + a^i_2 x_2 + ... + a^i_n x_n >= 0 (1 <= i <= k) (where the coefficients a^i_j are integers), how can I: 1. decide whether they are consistent (i.e. there is a solution other than the zero one) 2. more generally, write them in a canonical form (e.g., if the solution space is n-dimensional, then have one inequality for each hyperplane in its boundary) In the examples I'm interested in, n is typically around 10 or 20

Indicating truncation to the calling process

Hi, I understand that the msgrcv() function would read a message from the queue associated with the message queue id and place it in the buffer(userdefined). Further, it has an argument of type size_t that indicates the maximum size(in bytes) of the message that can be received or truncated incase of larger message. Incase of large messages, the truncated part of the message shall be lost . But is there a mechanism to indicate the calling process about truncation ? Or is there an alternate API that has an feature of indicating the calling thread of the truncation ? Any

Is there a newsgroup for algorithmic research?

Hi Subject says it all: Is there a newsgroup for algorithmic research? Or something similar? I would expect : Sorting, searching, merging, partitioning, threading, queing, memory management, virtual machine implementations, hashing, NP problems, heuristics, all kinds of data structures discussed and just about anything where some problem needs attacking. Thanks Stephen Howe

Overlay InputOnly window and XSetInputFocus

Hi, I have an overlay input-only window created as following: .... screen = DefaultScreen(dpy); width = DisplayWidth(dpy, screen); height = DisplayHeight(dpy, screen); root = RootWindow(dpy, screen); vmask |= CWDontPropagate; attrib.do_not_propagate_mask = KeyPressMask | KeyReleaseMask | ButtonPressMask | ButtonReleaseMask; window = XCreateWindow(dpy, root, 0, 0, width, height, 0, CopyFromParent, InputOnly, CopyFromParent, vmask, &attrib); /* Put the wait cursor into the window */ XDefineCursor(dpy, window, 0); .... Now, when this

Online Coding/Programming competition

Literati(National Institute of Technology, Kurukshetra(INDIA)) with Codechef presents the online coding competition on january,24 2010 (2:00 PM to 10:00 PM IST which means 8:30 AM to 4:30 PM GMT). Go fast and register yourself for this coding match and win good amount of cash prizes. relevant sites: http://www.literati.net.in/2010/encoder.php for information about the event. http://www.regonline.com/encoder_2010 for registering with encoder http://www.codechef.com/user/register for registering with codechef A team can be of atmost 2 participants. Y

OT/misc: maths (software vs traditional...).

observation: the math I know and use as a programmer is VERY different from the math used in math classes, physics classes, ... I had re-discovered this a few months back, after doing terribly at a math-related class I had, this being the first real re-exposure to traditional math in my case for ~5 years (I did well at this one, but bombed another class ~2 years earlier). (actually, me and academics in general is very "hit-or-miss", sometimes because of being rather confused, but more often had been due to being either depressed or apathetic and blowing stuff off, or sometime

AES and algebra

Is there a way one can come to understand encryption such as AES without having to study finate math? I am familiar with algebra is that possilby the only requirement one might need for basic encryption? Bill

How get percentage of use of cpu

Hello, How I can get percentage of CPU usage and temperature of every single core of my quad core? With GetSystemInfo API I can get only the number of cores. I need also get the percentage of used RAM. I tried: SYSTEM_INFO SysInfo; GetSystemInfo(&SysInfo); int nCpu = SysInfo.dwNumberOfProcessors; // Error. SYSTEM_INFORMATION_CLASS don't exist. SYSTEM_INFORMATION_CLASS SystemInformationClass = SYSTEM_PROCESSOR_PERFORMANCE_INFORMATION; PVOID SystemInformation; ULONG SystemInformationLength; PULONG ReturnLength; //

A question about subtracting numbers on a 2 complements machine

This question is from another forum that I sometimes hang out on.. "Assuming 8-bit 2's complement notation, what is the result of subtracting 00001011 from 00001101? (i.e. 00001101 - 00001011)" Person A says "0000 0010 with a signed carry flag" But Person B says "The question IS subtracting the larger number from the smaller number: 1101 - 1011 = 11111110 [-2]." His reasoning goes to person A goes "Your answer would be correct for unsigned but 2's complement is signed." So who would be right in this case?

Code and Creation 77046

This is a free and informational site I created for application development and application development source on the net. Enjoy, and it's free, nothing to register oir sign up for just an informational site. http://codeandcreation.com #j!dENIJr&tl*L(gk.Y$b>eFF

A tool that suggests optimized logic for a piece of code/module/function

Hi, There are certain editors that highlight the syntax/color for datatypes/variables or comments etc. Similarly, Is there a tool for C language that could suggest an optimized/alternate programming logic for the function that is written ? The optimized/alternate logic can be suggested as soon as we finish coding for one function or it can be suggested as soon as the code is compiled/parsed by that tool. It will be even more helpful if that tool also provides the cycle counts, cache usage, cache misses and lines of code also. It would be better if that tool has an op

glibc for win32 a long time waiting?

Dear all Will that be a source code that can be compiled on win32/gywgin? would gnulib-tool help? if not which files needs changing etc? not a straight forward change I guess! thanks i advance

Why QUARKS have assymptotic freedom:

Why QUARKS have assymptotic freedom: To find out why QUARKS have assymptotic freedom click link below: http://www.amperefitz.com/assymfree.htm Cheers Fitz

open all blocked sites in your country now

open all blocked sites in your country now Browse the internet securely using Your Proxy You can unblock popular social networking sites such as myspace, bebo, facebook and many other sites. http://alagmyproxy.zxq.net/proxy/index.php

Create empty files?

An application uses files with IDs. What of the following two variants is preferred? 1. To create empty IDs files at setup script. 2. If an IDs file is missing, treat it as if it would exist but empty. Why?

Q: Indexing a special kind of permutations

Permutations of n different objects can be ordered and thus mapped to numbers. There are good algorithms for doing the conversions. See http://stackoverflow.com/questions/1506078/fast-permutation-number-permutation-mapping-algorithms If there are only two kinds of objects (say, black and white), with n even and n/2 objects of each kind, are there good algorithms of doing the same? Thanks, M. K. Shen

Help required in programing the legal move generation of Connect-4 game.

I have programed a connect four in java using GUI. I have already coded a snippet that uses 2-d array(My board representation) for evaluation the winning conditions. i have declared a 2d array named board[width][height], where width is 7 and height is 6. and initialized all the elements to 0. Now I am planning to program an AI for it, for which I am planning to break the entire process into small parts(methods.) The first part will be consisting of all the legal moves which are allowed for the current position. In a position there are maximum 7 possible moves(towards the end there

"Unscrollable" features in window?

I have a question about scrolling. I put a detailed question into comp.os.ms-windows.programmer.win32 but it hasn=92t gathered any replies yet. So I=92m posting a more general question here, in the hope that someone will be able to give me a nudge in the right direction. I=92m using Windows. As you probably know, if a window is displayed on the screen, and another window covers part or all of it and is then removed, Windows sends a WM_PAINT message to the window to tell it to re-draw the missing part. It is possible to scroll a window, and one way of doing this is to use a function c

Solaris 2.6 boot errors

Hi, I often see this message while booting Solaris2.6 running on a ultra 440 Mhz CPU. Run fsck manually (fsck filesystem......). Exit the shell when done to continue the boot process. Type Ctrl-d to proceed with normal startup, (or give root password for system maintenance): The system was shutdown properly using init 5. My question is under what circumstances Solaris displays "Type Ctrl-d to proceed with normal startup" message?