S.o.s!!

[Sip]

Re: S.o.s!!

All the projects that you have described so far are small scale projects from an IT point of view that may be of great value to Electrical Engineering and the Semi-conductor/Electronics sectors; but not IT per se.

You are confusing the application domain of the computing problem I have asked you and the essence of the computing problem I have posed. The application domain could easily have been optimizing the UPS or fedex package delivery strategy and then, would you again belittle the challenge as it only applies to the package deliverers?

I would say the application domain (whether it be electrical engineering and semiconductor or not) is less relevant. The main question is, is the ALGORITHMIC question I have posed above a challenge or not?

[Sip]

Re: S.o.s!!

You've been asked to show it and, instead, you started talking about a different project. Such complex problems are "multi-dimensional" in nature and you may be surprised how algorithms may not be the challenge.

OF COURSE they are multi-dimensional and complex problems When I say "algorithm", of course I am NOT talking about a one dimensional sort of integers

[Siamanto]

Re: S.o.s!!

You are confusing the application domain of the computing problem I have asked you and the essence of the computing problem I have posed. The application domain could easily have been optimizing the UPS or fedex package delivery strategy and then, would you again belittle the challenge as it only applies to the package deliverers?

No, I'm not confusing the application domain and the software solution and, yes, similar optimization algorithms are used by UPS, Fedex or Call Center scheduling.
I said it and repeat: They may be of great value for the application domain but they are small scale projects, from an IT perspective, and have little IT value.

I would say the application domain (whether it be electrical engineering and semiconductor or not) is less relevant. The main question is, is the ALGORITHMIC question I have posed above a challenge or not?

How many times simple statements should be repeated before you understand them - I've even put it in bold in my previous post? Lets's repeat: I've said: "As I have promised, I will come back to it once we sort out the existing open questions."
Let's see if you will repeat the same question???

[Siamanto]

Re: S.o.s!!

OF COURSE they are multi-dimensional and complex problems When I say "algorithm", of course I am NOT talking about a one dimensional sort of integers

Instead of conveniently hiding, why don't you?
1- Functionally specify the problem
2- Describe a solution: architecture and technology
3- Show that the challenge is algorithmic in nature

Running away will not help you.

[Sip]

Re: S.o.s!!

I am starting to see where the problem is here. You don't seem to have even understood the question I have posed you above. I think the problem is you have severely misrepresented how much you actually know about algorithms and computer science in general. I apologize if my questions haven't made much sense to you but they were only posted at the level which you seemed to indicate you would understand. After all, you have been making fun of CS grad students and their capabilities so I took that as the base line of where you see yourself.

Would a more detailed spec of just the rectangle packing problem be something you might like to address? I realize the overall chip design algorithm might be a bit much

Now this is a serious question just so that I know at what level I should keep the discussions ... Siamanto, are you familiar with the concept of NP Completeness?

[Siamanto]

Re: S.o.s!!

I am starting to see where the problem is here. You don't seem to have even understood the question I have posed you above. I think the problem is you have severely misrepresented how much you actually know about algorithms and computer science in general. I apologize if my questions haven't made much sense to you but they were only posted at the level which you seemed to indicate you would understand. After all, you have been making fun of CS grad students and their capabilities so I took that as the base line of where you see yourself.

Would a more detailed spec of just the rectangle packing problem be something you might like to address? I realize the overall chip design algorithm might be a bit much

Now this is a serious question just so that I know at what level I should keep the discussions ... Siamanto, are you familiar with the concept of NP Completeness?

Still running away and hiding behind new subjects just because you don't have the courage to admit and/or realize that the IT challenge of a search engine is not of algorithmic nature, and lack the knowledge and skills to show that it is.
It's pointless to keep on opening new subjects when already open ones remain unanswered; apparently, that's your way of conveniently running away and/or hiding. As I have repeated many times, I'll address the new ones once the already open ones are closed.

You always wanted to be given the chance to prove yourself - i.e. your silly "contest" or whatever, so here's the opportunity. Instead of conveniently hiding, why don't you?
1- Functionally specify the problem
2- Describe a solution: architecture and technology
3- Show that the challenge is algorithmic in nature

Also, the absurd and ridiculous argument - or maybe, excuse - that it "can get quite confusing about where the 'enterprise infrastructure' stops and where the 'search algorithm' begins" can only mean one thing: you have absolutely no idea what you're talking about - that probably explains why you find it confusing.

Running away will not help you. All you have achieved - your examples, arguments etc. - simply confirms your IT profile, as I see it.

[Sip]

Re: S.o.s!!

I guess that answered my question.

[Sip]

Re: S.o.s!!

Wow I see a nice edit job on the post above ... so maybe I should say your original rambling answered my question ... as far as my "IT" profile, I have NEVER claimed to be an "IT" guy. You are the one that claims you are some sort of CS expert yet even the most basic CS concepts seem to be quite troubling to you.

I am NOT an IT guy ... thus, I don't have to demonstrate my IT knowledge as I don't claim to have any real IT knowledge.

Siamanto, you seem to be REALLY confused about the differences of "CS" and "IT". I have answered your question. I have put forth a specific algorithmic question and you are again trying to avoid answering whether it is in fact a challenge or not ... either you don't know and don't want to admit it, or you know damn well you are wrong (as usual - how many times has it been now?) and don't want to admit it.

[Siamanto]

Re: S.o.s!!

as far as my "IT" profile, I have NEVER claimed to be an "IT" guy....


I am NOT an IT guy ... thus, I don't have to demonstrate my IT knowledge as I don't claim to have any real IT knowledge.

For the record: I have added the "IT" to simply indicate that it was about your technical/professional profile - not as a person - and, when it comes to profiles, "IT profile" or "CS profile" are not distinguished - though, unusually, some may.

In any case, you sound so funny considering that you, so confidently and arrogantly, made such pretentious statements about IT systems/problems such as search engines, mail spam filters etc.

You are the one that claims you are some sort of CS expert yet even the most basic CS concepts seem to be quite troubling to you.

Are you referring to conversations that you had within yourself? Otherwise, why don't you quote a text that shows that "even the most basic CS concepts seem to be quite troubling to" me?

Just being funny or another stupid and unfounded claim of yours...just like the one about search engines?

Siamanto, you seem to be REALLY confused about the differences of "CS" and "IT".

You should stop having conversations within yourself. Just curious, how did you come to that conclusion? Can you quote a text that shows it?

You're funny! We're done with IT, so, just curious, are you a CS specialist - or an "CS guy" as you say? Just curious, as you see it, what would be the difference between an "IT specialist" and a "CS specialist?"

I have answered your question. I have put forth a specific algorithmic question and you are again trying to avoid answering whether it is in fact a challenge or not ...

You're getting funnier! So, "putting forth a specific algorithmic question" that is totally unrelated to search engines, mail spam filters etc. is an "answer????" to my question that asked you to show how the challenges of those IT systems - i.e. search engines, mail spam filters etc. - are algorithmic in nature?

So jumping to another subject is answering a question?

You keep on amazing me and I really would like to see what happens in your mind????

either you don't know and don't want to admit it, or you know damn well you are wrong (as usual - how many times has it been now?) and don't want to admit it.

It's amazing how you repeatedly ask questions when they were already answered several times; I'll simply copy and paste, wondering after how many minutes I'll have to do the same?

It's pointless to keep on opening new subjects when already open ones remain unanswered; apparently, that's your way of conveniently running away and/or hiding. As I have promised, I'll address the new ones once the already open ones are closed.

You always wanted to be given the chance to prove yourself - i.e. your silly "contest" or whatever, so here's the opportunity. Instead of conveniently hiding, why don't you?
1- Functionally specify the problem
2- Describe a solution: architecture and technology
3- Show that the challenge is algorithmic in nature

[Sip]

Re: S.o.s!!

Siamanto, I really don't think I am capable of answering your questions. Also, sorry about all the bad stuff I have said about you and I hope you will forgive me one day.