| Message |
Details |
TurboCLT 1.4.3
Updated to use https against Invelos. The old version seems to work, too, but it may be a bit sluggish. | Posted: Topic Replies: 71, Topic Views: 27845 |
 |
Quoting GSyren:
Quote:
DvdpScheduler 3.1.5
Fixed a bug in Repair where DvdpScheduler did not always sense that the repair was finished.
Well, that ended up in the wrong thread. But that's water under the bridge now, since there is a later version of that tool, announced in the correct thread. So, please ignore!  | Posted: Topic Replies: 71, Topic Views: 27845 |
|
| So, did you try the new version? | Posted: Topic Replies: 20, Topic Views: 9809 |
|
SharpnessCheck 1.1.0
It looks like I was wrong. I don't think it is a memory leak. It probably is a hardware issue, sort of. Too powerful hardware. I ran some tests, and with my 6 core cpu (running 12 tasks), the program topped about 1,3 GB memory. That means that if you have a cpu with more than 6 cores, you could possibly hit that 2 GB limit.
I have made two changes. First of all I have compiled for 64 bit. Secondly, I have added a setting where you can limit the number of tasks used. By default the program uses all it can get, but you can limit it if needed.
@species_8472, I hope that this solves the problem.
PS. If anyone actually wants the 32 bit version, let me know. | Posted: Topic Replies: 20, Topic Views: 9809 |
|
That’s odd. I have run the program quite a few times and I haven’t seen this error.
Still, unless it’s a hardware issue (which I doubt), it would seem that I have a memory leak. I normally compile for "Any CPU", which I believe limits the usable memory to 2 GB. That should be more than enough.
I’ll take a look and see if I can spot any possible memory leak. I can also re-compile for 64 bit only. I don’t think very many people run on 32 bit anymore. That will remove any memory restraints. But that’s rather hiding the problem instead of solving it.
Out of curiosity, does this error occur every time you run the program? | Posted: Topic Replies: 20, Topic Views: 9809 |
|
You may need to unblock the help file in order for it to display correctly.
In Explorer, right click on the help file and select Properties. Near the bottom you should see where you unblock it. Click there and the help file should work as intended.
And yes, lower value is meant to indicate blurrier cover. Your mileage may vary …  | Posted: Topic Replies: 20, Topic Views: 9809 |
|
SharpnessCheck 1.0.1
A bug fix and a small enhancement (in case anyone is interested):
1) After Re-load result, the Save result menu item could be disabled so you couldn't save any changes. Fixed.
2) If you press spacebar to flag a row, the next row is now automatically selected. | Posted: Topic Replies: 20, Topic Views: 9809 |
|
Quoting Darth Maher:
Quote:
Sorry to resurrect this old thread - is there a way to place the numbered titles at the end (after Z)?
If you mean that you want to place titles that start with a number at the end, the only thing I can think of is to change the sort title for each of them. For example change the sort title for "13 Going on 30" to "ZZZ13 Going on 30". That should sort it last. | Posted: Topic Replies: 11, Topic Views: 6521 |
|
SharpnessCheck 1.0.0
I asked ChatGPT if there was any software component that could help determine how sharp an image was. It pointed me to Accord.NET, or more specifically Accord.Imaging. My interest was piqued,so I decided to write a tool that used this component. And SharpnessCheck is the result.
My goal was to find the least sharp cover scans, so I could scan them - hopefully better - myself. So, did SharpnessCheck fulfill my dreams? Eh, not quite. Accord.Imaging's routines for determining sharpness was - I presume - meant for photographs. Cover scans don't have quite the same properties as regular photographs, so that might explain why the results are not quite what you would expect.
Still, I don't see any reason why I shouldn't share this tool, so you can play with it yourselves. On my initial tests it was quite slow. Scanning some 9000 images took about 14 minutes. Then I decided to go parallel. That was a new experience for me. This lets me use all the CPU cores for processing the image checks. Did that make a difference? You bet! It reduced the time from 14 minutes to 1 1/2. Now, the result will of course depend on your CPU. Mine is an Intel i5 with 6 cores, allowing 12 parallel tasks to run.
See the help file for details!
PS: Just so you know, this will hog your CPU quite a bit. | Posted: Topic Replies: 20, Topic Views: 9809 |
|
| Did you change the media type to DVD? | Posted: Topic Replies: 9, Topic Views: 5786 |
|
We may not have seen contributions in approved state this long, but we have seen very long waits for contributions to be approved. I’m not very concerned.
Given that Invelos did communicate about the server crash, I would be very surprised if they wouldn’t let us know if they intend to close shop altogether. A last goodbye, so to speak. Am I overly optimistic? | Posted: Topic Replies: 26, Topic Views: 10542 |
|
If you're interested in the classic style stop-motion, you might want to check out this:
It's not Brett Piper's best, but it's fun. And the DVD also contains two of his puppet shorts, Journey to the Center of the Earth, and 20,000 Leagues beneath the Sea. UPC 089218-119995 | Posted: Topic Replies: 0, Topic Views: 1939 |
|
DpOscars 2.1.1
Just two cosmetic fixes:
- Clicking the Statistics tab made the program appear to hang for a few seconds. This was because WPF doesn't try to populate the tab before it is selected. Not a big deal, but I found a way around that.
- I never liked the way that the categories were cased. I wanted the Associated Press style of title case, but it was so darn complicated that I never attempted it. BUT ... I asked ChatGPT to create a function for that. It took a few tries with different prompts, but in the end I got something that seems to work. So I applied it to the category names, and for good measure to the movie names as well. It doesn't change the function of the program, but it looks better. | Posted: Topic Replies: 32, Topic Views: 15120 |
|