Driver to drive?

Skybuck Flying · Jan 2, 2009

Hello,

It seems these drivers still have some issue's on XP x64.

Sometimes BF2 sort of hangs, graphics reacts but nothing else happens.

Reboot is necessary.

Also during shutdown DLLML.EXE still crashes sometimes and holds up the
shutdown...

Bye,
Skybuck.

Michael · Jan 2, 2009

Jim Thompson wrote:

Well... ya know... I mean ... like, wha'cher point? ;-)

Americans: Tune in "News Hour" on PBS, listen to the long discussions and count the number of times
a guest's response begins with:
1) "Well"
2) "I mean"
3) "Ya know"
4) all of the above

---
Michael

Or, in Obama's case, "Uh... uh... uh............"

Surely you meant to say "In Dubya's case...", didn't you, Jim? He is the unrivaled king of "uh".

krw · Jan 2, 2009

In article <495E7852.557C4625@att.net>, NoSpam@att.net says...>

Jim Thompson wrote:

Well... ya know... I mean ... like, wha'cher point? ;-)

Americans: Tune in "News Hour" on PBS, listen to the long discussions and count the number of times
a guest's response begins with:
1) "Well"
2) "I mean"
3) "Ya know"
4) all of the above

---
Michael

Or, in Obama's case, "Uh... uh... uh............"

Surely you meant to say "In Dubya's case...", didn't you, Jim? He is the unrivaled king of "uh".

Obviously groupies never actually listen to Obama bin Biden.

Jim Thompson · Jan 2, 2009

On Fri, 02 Jan 2009 20:25:55 GMT, Michael <NoSpam@att.net> wrote:

Jim Thompson wrote:

Well... ya know... I mean ... like, wha'cher point? ;-)

Americans: Tune in "News Hour" on PBS, listen to the long discussions and count the number of times
a guest's response begins with:
1) "Well"
2) "I mean"
3) "Ya know"
4) all of the above

---
Michael

Or, in Obama's case, "Uh... uh... uh............"

Surely you meant to say "In Dubya's case...", didn't you, Jim? He is the unrivaled king of "uh".

krw · Jan 3, 2009

On Fri, 02 Jan 2009 16:39:23 -0700, Jim Thompson
<To-Email-Use-The-Envelope-Icon@My-Web-Site.com> wrote:

On Fri, 02 Jan 2009 20:25:55 GMT, Michael <NoSpam@att.net> wrote:

Jim Thompson wrote:

Well... ya know... I mean ... like, wha'cher point? ;-)

Americans: Tune in "News Hour" on PBS, listen to the long discussions and count the number of times
a guest's response begins with:
1) "Well"
2) "I mean"
3) "Ya know"
4) all of the above

---
Michael

Or, in Obama's case, "Uh... uh... uh............"

Surely you meant to say "In Dubya's case...", didn't you, Jim? He is the unrivaled king of "uh".

Only if you ignore every Obama interview where he hadn't pre-screened
the questions.

Anytime his mouth opens without a teleprompter in sight.

JosephKK · Jan 3, 2009

On Fri, 2 Jan 2009 01:44:03 +0100, Frank Buss <fb@frank-buss.de>
wrote:

osr@uakron.edu wrote:

Possible Sorting structure. 1 Gbyte SD
I'm trying to think of a way to divide up a 1 gig card so the
microcontroller can run a fast bubble sort. I am not a mathmatician.
I hate math. So I'm looking for a simple elegant way by dividing up
the virtual disk into "sectors with subsectors" to minimize search
times. It does no good for the micro to need more then 5 seconds to
search for a incoming number..

If you just want to search for a number, use a binary search algorithm. For
sorting big arrays, bubble sort is terrible, because you need O(n^2) steps
and it needs many reads and writes, which is very slow for SD cards. Use
quick sort.

No. Quicksort also has O(n^2) worst case performance. Use b+ trees,
O(log

) performance both max and average.

BTW: It's not good to hate math for electronics and programming. I don't
know much about math, but I like it, e.g. see my last paper and source code
for calculating the magnetic field:
http://www.frank-buss.de/magnetfeld/index.html (sorry, it is in German)

JosephKK · Jan 3, 2009

On Thu, 01 Jan 2009 19:10:21 -0600, krw <krw@att.bizzzzzzzzzzz> wrote:

On Fri, 2 Jan 2009 02:01:05 +0100, Frank Buss <fb@frank-buss.de
wrote:

krw wrote:

Unless there is a good chance your data is already sorted, which it
often is. In this case, a bubble sort isn't all that bad.

If it is already sorted, bubble sort is still a bad idea for inserting new
items, because you still need many read and writes. If new entries needs to
be added on a SD card, something like a balanced tree would be better.

True. My point was that the possibility shouln't be ignored just
because it was the first sort most have done and considered
"inelegant" by the script kiddies. It's still useful (and simple .

Straightforward basic b-trees are simple to implement and understand.
And nothing more complex here is needed.

Frank Buss · Jan 3, 2009

JosephKK wrote:

No. Quicksort also has O(n^2) worst case performance. Use b+ trees,
O(log) performance both max and average.

You are right, but the right algorithm depends on the data, if you really
need it fast. Quicksort is faster than other sorting algorithms for many
input data arrays and can be done in place. That's the reason why it is
e.g. used for qsort in glibc, but for small subsets qsort uses insertion
sort:

http://cvs.savannah.gnu.org/viewvc/libc/stdlib/qsort.c?root=libc&view=markup

Trees are more complex, need more memory and are only useful, if you need
to change the data at runtime.

--
Frank Buss, fb@frank-buss.de
http://www.frank-buss.de, http://www.it4-systems.de

Phil Allison · Jan 4, 2009

"Sylvia Else"

Phil Allison wrote:

** In an earlier post you state the PCB had been subjected to water
ingress and insect attack - so almost anything is possible.

Odds are, the switching transistor was forced hard on by the above,
taking out the 8.2 ohms and Q1 in quick succession.

Relace whatever parts you find are damaged, clean the PCB carefully with
detergent and a brush (as you would washing glass ware etc in the sink )
rinse with clean water and dry thoroughly with lotsa hot air ( ie a hair
dryer).

Then cross you fingers and try it again.

If all is well, coat the PCB is clear acrylic lacquer to help it survive.

It's true that I mentioned brushing away a dead spider.

I wish I'd noted exactly where the spider was. It conceivably was around
the 200K resistor, which could explain both the failures, and the demise
of the spider.

Anyone know the resistance of a small spider before it dies from shock?

** If you see one with three red stripes across its abdomen

- means it is 2.2 kohms, +/- 20 % .............

...... Phil

onlinepoker · Jan 4, 2009

kredit bei bon kredit,kredite sicherheiten,kleinkredit,express
kredit,kredit auskunft,kredit ohne schufa von,kredite ohne schufa
de,kredit selbstaendige,online kredit trotz schufa,serioese kredite
ohne schufa,ueber bonkredit,online kredit ab,kredit ohne
schufa,kredite sicherheiten,

+
+
+++ GUENSTIGE KREDITE ONLINE +++ KREDITE IM INTERNET OHNE SCHUFA +++
+
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
+
+
+
+

+
+
+
+
+++ GUENSTIGE KREDITE ONLINE +++ KREDITE IM INTERNET OHNE SCHUFA +++
+
+
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
http://forum.hartz4-info.org/showthread.php?t=46
+
+
+
+

auch ohne schufa bon kredit in Merseburg
handy ohne schufa kredit bonitaetspruefung in Antigua und Barbuda
privat kredit ohne schufa kredite ohne in Rumänien
kredit bonitaetspruefung kreditangebot in Myanmar
kredit arbeitslose kredite ohne in Euskirchen
sofortkredite ohne schufa bonkredit de in Reutlingen
baufinanzierung online kredite privat in Ratzeburg
kredit vergleich kreditvermittlung in Republik Kongo
kredite schufafrei kredite in Nordrhein-Westfalen
kredit de online kredit im in Northeim
geld kredit kredit arbeitslos in Flensburg
www bon kredit ch kredit baufinanzierung in Rumänien
privatkredit ohne schufa clp kredit in Coburg
meinungen ueber bon kredit kredite ohne schufa in in Neustrelitz
kredit ohne schufaeintrag schweizer kredit in Ebersberg
sofort kredit ohne schufa serioese online kredite in Heinsberg
erfahrung mit bon kredit kredite schnell in Berlin

http://www.search.mississippi.gov/cs.html?url=http://forum.hartz4-info.org/showthread.php?t=46&kredit
rechner girokonto online in Weißenfels
http://www.search.mississippi.gov/cs.html?url=http://forum.hartz4-info.org/showthread.php?t=46&mit
bonkredit kreditangebote in Angola
http://www.search.mississippi.gov/cs.html?url=http://forum.hartz4-info.org/showthread.php?t=46&geld
kredit ohne schufa schweizer kredit online in Bad Windsheim
http://www.search.mississippi.gov/cs.html?url=http://forum.hartz4-info.org/showthread.php?t=46&kredit
sofortzusage online kredit fuer arbeitslose in Fürth
http://www.search.mississippi.gov/cs.html?url=http://forum.hartz4-info.org/showthread.php?t=46&ueber
bonkredit schweizer kredit online in Norwegen

JosephKK · Jan 4, 2009

On Sat, 3 Jan 2009 18:20:53 +0100, Frank Buss <fb@frank-buss.de>
wrote:

JosephKK wrote:

No. Quicksort also has O(n^2) worst case performance. Use b+ trees,
O(log) performance both max and average.

You are right, but the right algorithm depends on the data, if you really
need it fast. Quicksort is faster than other sorting algorithms for many
input data arrays and can be done in place. That's the reason why it is
e.g. used for qsort in glibc, but for small subsets qsort uses insertion
sort:

http://cvs.savannah.gnu.org/viewvc/libc/stdlib/qsort.c?root=libc&view=markup

Trees are more complex, need more memory and are only useful, if you need
to change the data at runtime.

No they are not more complex. They do use a bit more data memory but
less code space. And the data must be repeatedly changeable during
run time for this application.

Jasen Betts · Jan 4, 2009

On 2009-01-02, osr@uakron.edu <osr@uakron.edu> wrote:

Possible Sorting structure.

don't sort, hash instead.

Jasen Betts · Jan 4, 2009

On 2009-01-02, krw <krw@att.bizzzzzzzzzzz> wrote:

On Fri, 2 Jan 2009 01:44:03 +0100, Frank Buss <fb@frank-buss.de
wrote:

osr@uakron.edu wrote:

Possible Sorting structure. 1 Gbyte SD
I'm trying to think of a way to divide up a 1 gig card so the
microcontroller can run a fast bubble sort. I am not a mathmatician.
I hate math. So I'm looking for a simple elegant way by dividing up
the virtual disk into "sectors with subsectors" to minimize search
times. It does no good for the micro to need more then 5 seconds to
search for a incoming number..

If you just want to search for a number, use a binary search algorithm. For
sorting big arrays, bubble sort is terrible, because you need O(n^2) steps
and it needs many reads and writes, which is very slow for SD cards. Use
quick sort.

Unless there is a good chance your data is already sorted, which it
often is. In this case, a bubble sort isn't all that bad.

the best case for bubble sort is with data that's already sorted
but if you know the data is sorted why sort it again?

sorting doesn't seem usefully applicable to this application anyway.

BTW: It's not good to hate math for electronics and programming. I don't
know much about math, but I like it, e.g. see my last paper and source code
for calculating the magnetic field:
http://www.frank-buss.de/magnetfeld/index.html (sorry, it is in German)

Jasen Betts · Jan 4, 2009

On 2009-01-03, Frank Buss <fb@frank-buss.de> wrote:

JosephKK wrote:

No. Quicksort also has O(n^2) worst case performance. Use b+ trees,
O(log) performance both max and average.

You are right, but the right algorithm depends on the data, if you really
need it fast. Quicksort is faster than other sorting algorithms for many
input data arrays and can be done in place. That's the reason why it is
e.g. used for qsort in glibc, but for small subsets qsort uses insertion
sort:

Trees are more complex, need more memory and are only useful, if you need
to change the data at runtime.

Isn't that a requirement for this device?

The easiest solution is just get a 2G memory card.
Then each phone number in the north-american numbering
plan can map to a single bit

krw · Jan 5, 2009

On 4 Jan 2009 23:41:49 GMT, Jasen Betts <jasen@xnet.co.nz> wrote:

On 2009-01-02, krw <krw@att.bizzzzzzzzzzz> wrote:
On Fri, 2 Jan 2009 01:44:03 +0100, Frank Buss <fb@frank-buss.de
wrote:

osr@uakron.edu wrote:

Possible Sorting structure. 1 Gbyte SD
I'm trying to think of a way to divide up a 1 gig card so the
microcontroller can run a fast bubble sort. I am not a mathmatician.
I hate math. So I'm looking for a simple elegant way by dividing up
the virtual disk into "sectors with subsectors" to minimize search
times. It does no good for the micro to need more then 5 seconds to
search for a incoming number..

If you just want to search for a number, use a binary search algorithm. For
sorting big arrays, bubble sort is terrible, because you need O(n^2) steps
and it needs many reads and writes, which is very slow for SD cards. Use
quick sort.

Unless there is a good chance your data is already sorted, which it
often is. In this case, a bubble sort isn't all that bad.

the best case for bubble sort is with data that's already sorted
but if you know the data is sorted why sort it again?

Probability.

sorting doesn't seem usefully applicable to this application anyway.

If it's not (already sorted) this time, but is 99% of the time? Or if
you want to verify that data is sorted...

Archimedes' Lever · Jan 5, 2009

On Sun, 04 Jan 2009 19:02:00 -0600, krw <krw@att.bizzzzzzzzzzz> wrote:

the best case for bubble sort is with data that's already sorted
but if you know the data is sorted why sort it again?

Probability.

The bubble sort is the best sort routine, regardless of start ordering.

krw · Jan 5, 2009

On Sun, 04 Jan 2009 17:52:46 -0800, Archimedes' Lever
<OneBigLever@InfiniteSeries.Org> wrote:

On Sun, 04 Jan 2009 19:02:00 -0600, krw <krw@att.bizzzzzzzzzzz> wrote:

the best case for bubble sort is with data that's already sorted
but if you know the data is sorted why sort it again?

Probability.

The bubble sort is the best sort routine, regardless of start ordering.

Don't be a total idiot.

Greegor · Jan 5, 2009

On Jan 1, 2:02 am, Robert Baer <robertb...@localnet.com> wrote:
[...]

* What are these "long DTMF 2" and "long DTMF 3" signals?

On a portion of those auto calling setups, they
trigger a message where it calls out your phone
number and says that it's being removed from
their database.

Some use 2 and others use 3.

DTMF is another name for "touch tones".

Dual Tone Mixed Frequency.

JosephKK · Jan 7, 2009

On 4 Jan 2009 23:19:34 GMT, Jasen Betts <jasen@xnet.co.nz> wrote:

On 2009-01-02, osr@uakron.edu <osr@uakron.edu> wrote:

Possible Sorting structure.

don't sort, hash instead.

Hashing is suboptimal in both code space and data space for the
problem at hand, and can have poor execution times if poorly
implemented. Not that it couldn't work acceptably, 100 ms is a long
time at 300,000 instructions per second let alone a few million per
second.

Robert Baer · Jan 7, 2009

JosephKK wrote:

On 4 Jan 2009 23:19:34 GMT, Jasen Betts <jasen@xnet.co.nz> wrote:

On 2009-01-02, osr@uakron.edu <osr@uakron.edu> wrote:

Possible Sorting structure.

don't sort, hash instead.

Hashing is suboptimal in both code space and data space for the
problem at hand, and can have poor execution times if poorly
implemented. Not that it couldn't work acceptably, 100 ms is a long
time at 300,000 instructions per second let alone a few million per
second.

Sort???

Why? Maybe 200-400 *max* entries in whitelist and 300-1000 in blacklist.
While notfound scan table(s).

Driver to drive?

Skybuck Flying

Guest

Michael

Guest

krw

Guest

Jim Thompson

Guest

krw

Guest

JosephKK

Guest

JosephKK

Guest

Frank Buss

Guest

Phil Allison

Guest

onlinepoker

Guest

JosephKK

Guest

Jasen Betts

Guest

Jasen Betts

Guest

Jasen Betts

Guest

krw

Guest

Archimedes' Lever

Guest

krw

Guest

Greegor

Guest

JosephKK

Guest

Robert Baer

Guest

Log in

Welcome to EDABoard.com

Sponsor