Using the console for something other than CLI
Pages: 12
> Duoas: I may have completely misunderstood your post, particularly the last part, but are you suggesting programmers should be taught to design UIs?
Yep. UI design is an integral part of an application's design.
So, if all you want to do is code FFTs and eigenvector transformations, then sure, you can do that.
But if you want people to actually be able to use your stuff... you must provide some form of ''user interface'' so that they don't have to hack at your code and compile it into their own little programs to apply it to their data. Understanding how your users want to interact with their data (that is, how they want your program to work for them) is the difference between software that sells and software you couldn't give away -- which directly translates to "was it worth the time I spent bit-twiddling my algorithms to perfection since I don't have a job now?".
As for the database search... Charles Watson, CEO of Little Infosystems Payroll, Inc., is more likely to grok the first method... Whereas Gary Johnson, Professional Database Programming Consultant, wouldn't care less either way. And Sue Lederer, occasional Word user and Solitare player would never go near the thing.
But, as things go, I would be more inclined to provide a graphical way of assembling queries. See http://www.google.com/advanced_search for an example.
Hope this helps.
Yep. UI design is an integral part of an application's design.
So, if all you want to do is code FFTs and eigenvector transformations, then sure, you can do that.
But if you want people to actually be able to use your stuff... you must provide some form of ''user interface'' so that they don't have to hack at your code and compile it into their own little programs to apply it to their data. Understanding how your users want to interact with their data (that is, how they want your program to work for them) is the difference between software that sells and software you couldn't give away -- which directly translates to "was it worth the time I spent bit-twiddling my algorithms to perfection since I don't have a job now?".
As for the database search... Charles Watson, CEO of Little Infosystems Payroll, Inc., is more likely to grok the first method... Whereas Gary Johnson, Professional Database Programming Consultant, wouldn't care less either way. And Sue Lederer, occasional Word user and Solitare player would never go near the thing.
But, as things go, I would be more inclined to provide a graphical way of assembling queries. See http://www.google.com/advanced_search for an example.
Hope this helps.
Last edited on
On the other hand, if you actually know what
stand for (i actually know only eigeinvectors (*yes I do!*)), while for fast fourier transform I have only skimmed through wikipedia (and been to lecture in which the lecturer had skimmed through wikipedia before walking to class), then you wouldn't actually be bothered with lack of UI (cause that would be the least of your problems, which you could handle in days at the worst, provided you are learning a new programming language)
| So, if all you want to do is code FFTs and eigenvector transformations, then sure, you can do that. |
stand for (i actually know only eigeinvectors (*yes I do!*)), while for fast fourier transform I have only skimmed through wikipedia (and been to lecture in which the lecturer had skimmed through wikipedia before walking to class), then you wouldn't actually be bothered with lack of UI (cause that would be the least of your problems, which you could handle in days at the worst, provided you are learning a new programming language)
Last edited on
While we're on the subject of FFTs, I'm for some reason extremely interested in them, but I can't seem to decipher the Wikipedia article. A book I could find a good explanation (a programming-oriented one if possible)? And, would you say I'd be able to grasp it with just algebra and a little calculus (limits and derivatives)?
LOL. I didn't say the stuff past the UI wasn't fun. ;-]
A Fourier Transform is used to separate a complex waveform into its constituent components.
http://en.wikipedia.org/wiki/Fourier_analysis#Applications_in_signal_processing
Doing that is a rather messy process, but it is very useful. A example is when you sharpen an image in Photoshop or the GIMP. This has both military and civil uses, such as identifying an aircraft and its markings from photographs. Another example is when your telephone company's computers recognize which button you just pressed on the phone (by decomposing the sound wave, or tone, produced).
It is also very computation intensive, so what is usually termed as an "FFT" is a Fast Fourier Transform -- which specializes on a discrete (or finite) sampling.
Google around "fourier analysis" for some good stuff. Near the top of that is this very good tutorial:
http://www.sunlightd.com/Fourier/
Have fun!
A Fourier Transform is used to separate a complex waveform into its constituent components.
http://en.wikipedia.org/wiki/Fourier_analysis#Applications_in_signal_processing
Doing that is a rather messy process, but it is very useful. A example is when you sharpen an image in Photoshop or the GIMP. This has both military and civil uses, such as identifying an aircraft and its markings from photographs. Another example is when your telephone company's computers recognize which button you just pressed on the phone (by decomposing the sound wave, or tone, produced).
It is also very computation intensive, so what is usually termed as an "FFT" is a Fast Fourier Transform -- which specializes on a discrete (or finite) sampling.
Google around "fourier analysis" for some good stuff. Near the top of that is this very good tutorial:
http://www.sunlightd.com/Fourier/
Have fun!
The general Fourier transform is when you integrate over anything; the discrete one (which is referred to as fast fourier transform) is when you integrate over a finite set (integrating over finite set = taking a sum. It sounds more sophisticated to say integrate though >:). We are educated people and must not say things simply when they can be said in a complicated fashion!).
The thing is, when you do the discrete transform, you can actually carry out the computations. Try googling
"using fast fourier transform to multiply polynomials"
This one seems to have all the concept but no details
http://knol.google.com/k/chris-nash/multiplication-using-the-fast-fourier/2v1zaodjuunh/7#
This seems like some more detailed guide
"http://net.pku.edu.cn/~course/cs101/resource/Intro2Algorithm/book6/chap32.htm"
You might also wanna review complex roots of unity
http://en.wikipedia.org/wiki/Root_of_unity
in case you have forgotten how to multiply complex roots of unity.
The thing is, when you do the discrete transform, you can actually carry out the computations. Try googling
"using fast fourier transform to multiply polynomials"
This one seems to have all the concept but no details
http://knol.google.com/k/chris-nash/multiplication-using-the-fast-fourier/2v1zaodjuunh/7#
This seems like some more detailed guide
"http://net.pku.edu.cn/~course/cs101/resource/Intro2Algorithm/book6/chap32.htm"
You might also wanna review complex roots of unity
http://en.wikipedia.org/wiki/Root_of_unity
in case you have forgotten how to multiply complex roots of unity.
Last edited on
*Disch marks thread as officially hijacked.
All the same I guess, I didn't have anything else to say on the original subject anyway XD
All the same I guess, I didn't have anything else to say on the original subject anyway XD
Topic archived. No new replies allowed.
Pages: 12