|
Rather than annoying new members N times (some do understand from a single read, you should not punish them for being new here), we should be given a button "poster needs to read the rules again" next to "vote to remove", so readers can inflict the pop-up rules as much as is required.
Luc Pattyn [Forum Guidelines] [My Articles]
- before you ask a question here, search CodeProject, then Google
- the quality and detail of your question reflects on the effectiveness of the help you are likely to get
- use the code block button (PRE tags) to preserve formatting when showing multi-line code snippets
|
|
|
|
|
I like it.
Yusuf
Oh didn't you notice, analogous to square roots, they recently introduced rectangular, circular, and diamond roots to determine the size of the corresponding shapes when given the area. Luc Pattyn[^]
|
|
|
|
|
Luc Pattyn wrote: we should be given a button "poster needs to read the rules again"
Open to abuse. If a poster doesn't like a reply, or just has a vendetta against a member, they can annoy a member indefinitely. Perhaps it would be possible to put some form of restriction on it? (e.g. 3 votes required or cannot be performed on [silver|gold] members and above
|
|
|
|
|
of course, similar to the "vote to remove", whatever the filter is there.
Luc Pattyn [Forum Guidelines] [My Articles]
- before you ask a question here, search CodeProject, then Google
- the quality and detail of your question reflects on the effectiveness of the help you are likely to get
- use the code block button (PRE tags) to preserve formatting when showing multi-line code snippets
|
|
|
|
|
No slight on the forum or its denizens, but chances are 13 people aren't going to vote to force a member to click through the guidelines of posting. The criteria would have to be far lower in order for the system to be practical
|
|
|
|
|
OK, let's have just one counter belonging to the account, not the message;
- increment it by readers clicking the "poster needs to learn the rules" button;
- when poster posts a message:
* if >= N show the pop-up and decrement by N
* else decrement by 1 but not below zero (or not below -N ?)
Some experiments will indicate what a good value for N would be, let's start with 10.
Luc Pattyn [Forum Guidelines] [My Articles]
- before you ask a question here, search CodeProject, then Google
- the quality and detail of your question reflects on the effectiveness of the help you are likely to get
- use the code block button (PRE tags) to preserve formatting when showing multi-line code snippets
|
|
|
|
|
I think I understand that. It would be a good idea if it were implemented, but I doubt ten people would band together and force a poster to read the posting guidelines. It might be more efficient to set N to 5
|
|
|
|
|
Computafreak wrote: If a poster doesn't like a reply, or just has a vendetta against a member, they can annoy a member indefinitely.
yea that would be cool 
Yusuf
Oh didn't you notice, analogous to square roots, they recently introduced rectangular, circular, and diamond roots to determine the size of the corresponding shapes when given the area. Luc Pattyn[^]
|
|
|
|
|
Can someone please let me know how to implement the peak to valley method for segmenting characters like for example segmenting the characters of a license plate to read them
|
|
|
|
|
|
i had downloaded few mathcad files but these dont open with many mathcad softwres, please help me in finding either a software for same or some file converter so dat d file could be converted and accessed........
the xtension of d files are ResDll DLL...
also posted alonwith it is d site from where d mathcad fie has been downloaded...
http://www.users.csbsju.edu/~frioux/workinprogress.html">
amansingh
|
|
|
|
|
Nobody, and I mean nobody, is going to do urgent homework requests for you. That defeats the purpose of the homework you should be doing on your own so that you can learn.
It's unfortunate and inconvenient, I know, but education is all about learning. But that's just one of those annoying aspects of life.
|
|
|
|
|
Welcome to CP's Memorable Quotes list [^].
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong.
-- Iain Clarke
[My articles]
|
|
|
|
|
I am writing a web contetnt extractor that will be going to extract the a part of the content from any website(suppose JOB information part).The problem is the different structure of the information.How could i recognize the different structure and extract the exact information from the site.
|
|
|
|
|
As with any lexical analysis I suppose you'd have to start with a tokenizer and get that up and running. The next logical step would be to code a parser.
|
|
|
|
|
I have the html document even i f i am knowing the structure then even i am able to extract the information.but the problem is of not having the structure as same as other web sites.
|
|
|
|
|
uprndra wrote: I have the html document even i f i am knowing the structure then even i am able to extract the information.but the problem is of not having the structure as same as other web sites.
What, exactly, do you mean by "not having the structure as same as other web sites"?
If you want to extract a particular section of a webpage (regardless of which webpage), you'll need to go the tokenize and parse route.
|
|
|
|
|
I have a few problems of the same general format, and was wondering if there are any good algorithms; it's not necessary to get the optimal solution--just a decent one.
I have about 100 bitmaps that are 24 rows by 80 bits. All of the bitmaps will probably have a total of around 400-450 different rows. I need to allocate the different rows into four sets of 128 different rows, such that each bitmap may be represented entirely with rows from one set. It will almost certainly be necessary to include some rows in more than one set, but this must not be done excessively.
I am well aware that such a data format (storing each bitmap as a byte indicating which set to use, and then 24 bytes indicating which rows to use within that set) is not the most efficient from a space perspective, but the data is for use on a rather slow processor which can't afford to waste any time processing it.
Are there any common algorithms which could be readily adapted to the purpose, or should I try to cobble together some heuristics and see what happens?
|
|
|
|
|
There are many possible approaches, and it's possible there's no solution for a given set of bitmaps.
The problem is in partitioning the bitmaps into the four sets, which suggests a kind of cluster analysis may be helpful.
1. Make a 100 x 100 integer array with rows and columns representing the bitmaps.
2. For row r, and column c, set the value of the cell to the number of rows bitmap r has in common with bitmap c.
3. Go through the array in descending cell order, i.e. start with the highest cell value, and link the two bitmaps corresponding to this cell, to form a cluster. Note that if both bitmaps are already in clusters, this operation will combine the clusters into a bigger cluster. But DON'T do the combination if the total number of unique rows from the two clusters is greater than 128 (since it wouldn't fit into one set.)
4. When you can no longer make any more clusters, assign the four largest clusters to the four sets.
5. Assign the remaining bitmaps to the four sets, picking the set that already has the most rows in common with the bitmap being assigned.
This will cluster the bitmaps that have the most rows in common, making efficient use of your four sets. While not optimal, this will give you a decent solution.
|
|
|
|
|
I'll have to give that a try. There are a few similar problems I have, with somewhat different parameters; the approach may work well if there are 100 groups of things, but may not work so well in a variation with 1,000 groups. Even there, though, it might not be too totally horrible if it's possible to quickly identify how many items are shared by two groups (doing 1,000,000 such match-ups might not be too horrible if they took a microsecond each, but would be annoying if they took a millisecond).
I'd been debating whether it would be better to grow clusters separately, or whether it would be better to pick an item to start a cluster, and then grow that cluster until things don't fit any more, then start another cluster, etc. I suppose the best approach may depend upon the exact data to be processed, but the data won't exist until after the compressor is done.
Basically, I'm trying to compress some level-design data for use on a very old video game system (Atari 2600, running off a 1.19MHz 6502 with 128 bytes of RAM and 8x4k banks of ROM). The goal will be to take a level design and process it into the format necessary for the game. I can't know what sorts of levels will be designed until I get some idea of what's likely to fit. It would be possible to accommodate 20 rooms of arbitrary data, but many rooms are going to have rows in common, so in practice it should be able to accommodate a lot more than 20 rooms. I don't know how much more, however.
|
|
|
|
|
Can anyone plz help us with how to recognise the characters on a license plate of a vehicle in c#.
Is there any algorithm to recognise characters? the license plates have printed letters on them and are written in English.
|
|
|
|
|
This problem has been solved by a variety of methods over the years. The first step is isolating the individual characters in the image. Many approaches then divide a character into a grid, and average the level in each grid cell. At this point, I've seen three approaches:
1. Input the cell values to a neural net to train it to recognize the characters,
2. Heuristically come up with rules that differentiate the characters, and
3. Use the averages and standard deviations of the rows and columns with discriminant analysis (http://statsoft.nl/uk/textbook/stdiscan.html[^]).
You can probably find source code somewhere on the web to do this.
|
|
|
|
|
thanks a lot for ur help.....
i know theoretically some how to implement it but i cant the hang of how to start of with the code my characters are not getting segmented properly
|
|
|
|
|
actually segmenting the characters worked only for one image , i applied thinning to individual character to get the skeleton but then i dunno how to proceed with recognition ...
plz help if u can
|
|
|
|
|
Well, you can trace vertical lines in the bitmap, and see if they intersect characters. When you find a vertical line that doesn't intersect a character, it's in a boundry between two characters. You can then do a binary search to find the X coordinate where it changes from character to boundary.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
