Announcement

Collapse

Forum Rules (Everyone Must Read!!!)

1] What you CAN NOT post.

You agree, through your use of this service, that you will not use this forum to post any material which is:
- abusive
- vulgar
- hateful
- harassing
- personal attacks
- obscene

You also may not:
- post images that are too large (max is 500*500px)
- post any copyrighted material unless the copyright is owned by you or cited properly.
- post in UPPER CASE, which is considered yelling
- post messages which insult the Armenians, Armenian culture, traditions, etc
- post racist or other intentionally insensitive material that insults or attacks another culture (including Turks)

The Ankap thread is excluded from the strict rules because that place is more relaxed and you can vent and engage in light insults and humor. Notice it's not a blank ticket, but just a place to vent. If you go into the Ankap thread, you enter at your own risk of being clowned on.
What you PROBABLY SHOULD NOT post...
Do not post information that you will regret putting out in public. This site comes up on Google, is cached, and all of that, so be aware of that as you post. Do not ask the staff to go through and delete things that you regret making available on the web for all to see because we will not do it. Think before you post!


2] Use descriptive subject lines & research your post. This means use the SEARCH.

This reduces the chances of double-posting and it also makes it easier for people to see what they do/don't want to read. Using the search function will identify existing threads on the topic so we do not have multiple threads on the same topic.

3] Keep the focus.

Each forum has a focus on a certain topic. Questions outside the scope of a certain forum will either be moved to the appropriate forum, closed, or simply be deleted. Please post your topic in the most appropriate forum. Users that keep doing this will be warned, then banned.

4] Behave as you would in a public location.

This forum is no different than a public place. Behave yourself and act like a decent human being (i.e. be respectful). If you're unable to do so, you're not welcome here and will be made to leave.

5] Respect the authority of moderators/admins.

Public discussions of moderator/admin actions are not allowed on the forum. It is also prohibited to protest moderator actions in titles, avatars, and signatures. If you don't like something that a moderator did, PM or email the moderator and try your best to resolve the problem or difference in private.

6] Promotion of sites or products is not permitted.

Advertisements are not allowed in this venue. No blatant advertising or solicitations of or for business is prohibited.
This includes, but not limited to, personal resumes and links to products or
services with which the poster is affiliated, whether or not a fee is charged
for the product or service. Spamming, in which a user posts the same message repeatedly, is also prohibited.

7] We retain the right to remove any posts and/or Members for any reason, without prior notice.


- PLEASE READ -

Members are welcome to read posts and though we encourage your active participation in the forum, it is not required. If you do participate by posting, however, we expect that on the whole you contribute something to the forum. This means that the bulk of your posts should not be in "fun" threads (e.g. Ankap, Keep & Kill, This or That, etc.). Further, while occasionally it is appropriate to simply voice your agreement or approval, not all of your posts should be of this variety: "LOL Member213!" "I agree."
If it is evident that a member is simply posting for the sake of posting, they will be removed.


8] These Rules & Guidelines may be amended at any time. (last update September 17, 2009)

If you believe an individual is repeatedly breaking the rules, please report to admin/moderator.
See more
See less

S.o.s!!

Collapse
X
 
  • Filter
  • Time
  • Show
Clear All
new posts

  • Re: S.o.s!!

    Originally posted by Siamanto View Post
    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?
    this post = teh win.

    Comment


    • Re: S.o.s!!

      Originally posted by Siamanto View Post
      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
      this post = teh win.

      Comment


      • Re: S.o.s!!

        Originally posted by Sip View Post
        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.







        Originally posted by Sip View Post
        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???
        What if I find someone else when looking for you? My soul shivers as the idea invades my mind.

        Comment


        • Re: S.o.s!!

          Originally posted by Sip View Post
          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.
          What if I find someone else when looking for you? My soul shivers as the idea invades my mind.

          Comment


          • 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?
            Last edited by Sip; 09-25-2007, 01:30 PM.
            this post = teh win.

            Comment


            • Re: S.o.s!!

              Originally posted by Sip View Post
              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.
              Last edited by Siamanto; 09-25-2007, 05:41 PM.
              What if I find someone else when looking for you? My soul shivers as the idea invades my mind.

              Comment


              • Re: S.o.s!!

                I guess that answered my question.
                this post = teh win.

                Comment


                • 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.
                  Last edited by Sip; 09-25-2007, 09:11 PM.
                  this post = teh win.

                  Comment


                  • Re: S.o.s!!

                    Originally posted by Sip View Post
                    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.







                    Originally posted by Sip View Post
                    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?







                    Originally posted by Sip View Post
                    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?"







                    Originally posted by Sip View Post
                    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????









                    Originally posted by Sip View Post
                    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
                    Last edited by Siamanto; 09-26-2007, 12:01 PM.
                    What if I find someone else when looking for you? My soul shivers as the idea invades my mind.

                    Comment


                    • 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.
                      this post = teh win.

                      Comment

                      Working...
                      X