|
Happens. I misread stuff all the time. My girlfriend, for example. She writes me a note "I love you. Clean the bathroom, if you find time." and I take it to mean what it says: if I find time, I'll clean the bathroom. Unfortunately, my chainsaw breaks and I have to mend it because I need it the next day... and then I spend the night on the couch 
Cheers,
Sebastian
--
Contra vim mortem non est medicamen in hortem.
|
|
|
|
|
|
Bassam Abdul-Baki wrote: Only 474 pages.
I've seen worse.
_________________________
Asu no koto o ieba, tenjo de nezumi ga warau.
Talk about things of tomorrow and the mice in the ceiling laugh. (Japanese Proverb)
|
|
|
|
|
Yeah, me too. But still, I downloaded it and can't print it. So I have to wait for my SONY reader to come in.
"I know which side I want to win regardless of how many wrongs they have to commit to achieve it." - Stan Shannon
Web - Blog - RSS - Math - LinkedIn
|
|
|
|
|
Bassam Abdul-Baki wrote:
Only 474 pages.
No wonder the explanation in the topology book on my shelf was a hard read; it was less than 10% that size thus must have left out important details 
|
|
|
|
|
Hi,
Do you know any open-source/free implementation/library for circular layout algortihm similar to
this?
Any ideas/links to any information on the topic would be usefull.
Thanks.
Vitaliy Tsvayer
Tikle
|
|
|
|
|
Have you looked around on sourceforge?
"Any sort of work in VB6 is bound to provide several WTF moments." - Christian Graus
|
|
|
|
|
I'm trying to make a 3D scene using OpenGVS, but I need to make the scene looks like the pictures in a black-white TV. I tried to acquire the pixel color buffer before render,and render the pixels just using their luminance.However, it's very inefficient and can't meet the need.
Who can tell me how to solve the problem?Thanks for the help.
|
|
|
|
|
first off, infrared is not a simple greyscale luminance.
Second, you can't get a real infrared from color.
Simulating it means recalculating and restoring all your textures.... or using a shader.
I use a shader, it's very few lines and very efficient, but requires a decent graphics card and you don't have to rebuild the textures, you can use the same textures as true-color, just change the rendering algorithm through a shader.
As for my algorithm.... well.... that is the stuff that builds thesis papers.
However, I googled this[^] discussion so I don't have to talk about my algorithm. 
_________________________
Asu no koto o ieba, tenjo de nezumi ga warau.
Talk about things of tomorrow and the mice in the ceiling laugh. (Japanese Proverb)
|
|
|
|
|
I will start by confessing to the truth.
Yes this is a school project.
Yes I am supposed to do this all by myself
And yes I want your help.
Please help me to express this problem mathematically
This project focuses on the design of a model that could be used to find the shortest path between three points. The shortest distance between any two points is a straight line. The three points are, selected randomly
The selected path is expected to fulfils the following requirements
The selected path should yield the most viable (and shortest?) distance
By pass all settlement with a population density greater than a specified value
By pass all evaluation above a specified height.
By pass all evaluation below sea level
By pass settlements that, although, do not fall in the urban area classification is of importance It is essentially a routing problem.
Any bright idea how I can go about this app?.
ihe
|
|
|
|
|
In general, what you're describing is the traveling salesman problem, which runs in eponential time for an exact answer. Butw with just 3 points a brute force solution checking all routes is possible.
|
|
|
|
|
Yes. So how can I solve it.I need an alogorithms i can use. I do not want to use brute force solution to check all the possible routes.( As the points are not fixed. )
ihe
|
|
|
|
|
If you want an exact solution, brute force is the only option. If you can find a non brute force solution that gives the optimal route in all cases, you've just proved P=NP. If an approximate solution is good enough, and your points obey the triangle inequality(1) then something like the A* algorythm can be used to fine one. Google is your friend.
(1) the distance from A to C is shorter than the distance from A to B plus the distance from B to C for all points A, B, C.
|
|
|
|
|
I'll give you a hint to help you get started ...
Google for the A* algorithm.
If you decide to become a software engineer, you are signing up to have a 1/2" piece of silicon tell you exactly how stupid you really are for 8 hours a day, 5 days a week
Zac
|
|
|
|
|
Thank you for the hint.
ihe
|
|
|
|
|
as with the others... you can use brute-force min-max scoring of paths to try all paths. This is an exponential of data therefore inefficient, but always finds the right solution. Every choice generates a new branch of every other choice it has, and so forth, and so on.
A* and Dynamic A* get into AI decisions of "pre-pruning" paths before evaluating them based on some judgement rules. This is not always the "best" solution, but generates a fast "good" solution.
check path navigation in AI game programming wisdom series of books.
_________________________
Asu no koto o ieba, tenjo de nezumi ga warau.
Talk about things of tomorrow and the mice in the ceiling laugh. (Japanese Proverb)
|
|
|
|
|
Thank you. Where can find this "AI game programming wisdom series of books" on the web .
ihe
|
|
|
|
|
|
This one's a repost, but a classic and deserving of the new Math forum.
The Klein Four Group[^]
Finite Simple Group (of Order Two)[^]
The path of love is never smooth
But mine's continuous for you
You're the upper bound in the chains of my heart
You're my Axiom of Choice, you know it's true
But lately our relation's not so well-defined
And I just can't function without you
I'll prove my proposition and I'm sure you'll find
We're a finite simple group of order two
I'm losing my identity
I'm getting tensor every day
And without loss of generality
I will assume that you feel the same way
Since every time I see you, you just quotient out
The faithful image that I map into
But when we're one-to-one you'll see what I'm about
'Cause we're a finite simple group of order two
Our equivalence was stable,
A principal love bundle sitting deep inside
But then you drove a wedge between our two-forms
Now everything is so complexified
When we first met, we simply connected
My heart was open but too dense
Our system was already directed
To have a finite limit, in some sense
I'm living in the kernel of a rank-one map
From my domain, its image looks so blue,
'Cause all I see are zeroes, it's a cruel trap
But we're a finite simple group of order two
I'm not the smoothest operator in my class,
But we're a mirror pair, me and you,
So let's apply forgetful functors to the past
And be a finite simple group, a finite simple group,
Let's be a finite simple group of order two
(Oughter: "Why not three?")
I've proved my proposition now, as you can see,
So let's both be associative and free
And by corollary, this shows you and I to be
Purely inseparable. Q. E. D.
"I know which side I want to win regardless of how many wrongs they have to commit to achieve it." - Stan Shannon
Web - Blog - RSS - Math - LinkedIn
|
|
|
|
|
Good read on OGRs.[^]
They have a distributed software application like SETI if you're into that.
"I know which side I want to win regardless of how many wrongs they have to commit to achieve it." - Stan Shannon
Web - Blog - RSS - Math - LinkedIn
|
|
|
|
|
It's interesting that these types of problems have found applications in engineering.
|
|
|
|
|
All Math is related somehow. All all science use Math.
"I know which side I want to win regardless of how many wrongs they have to commit to achieve it." - Stan Shannon
Web - Blog - RSS - Math - LinkedIn
|
|
|
|
|
it's been a long time since i had to do this stuff, and i can't figure out how to solve what seems like it should be a simple calculation...
you have 6000 marbles in a box. 300 of them are black, the rest are white. you draw ten marbles without replacement.
what are the odds that three of the marbles you draw are black ?
|
|
|
|
|
I'd have to look up how to handle the other 7 marbles, but the probability of getting at least 3 black ones is calculated by:
300/6000 * 299/5999 * 298/5998 = 0.000123815
You can approximate it fairly closely with .05^3 for a simpler calculation (comes out to be .000125)
I think you can just multiple the rest of the fractions out:
300/6000 * 299/5999 * 298/5998 * 5700/5997 * 5699/5996 * 5698/5995 * 5697/5994 * 5696/5993 * 5695/5992 * 5694/5991 = 0.000086752
If you decide to become a software engineer, you are signing up to have a 1/2" piece of silicon tell you exactly how stupid you really are for 8 hours a day, 5 days a week
Zac
|
|
|
|
|
Zac Howland wrote: the probability of getting at least 3 black ones is calculated by:
300/6000 * 299/5999 * 298/5998 = 0.000123815
isn't that the probability of choosing three black in a row ? those denominators (total number of marbles left) will change, if you draw a white one between black ones.
i believe this problem is classified as a Hypergeometric Distribution problem. but, the technique for calculating that requires that i calculate things like 6000! (a.k.a. 2.69 * 10^20065). there has to be a simpler way to do it.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
