Breaking News
Hey! Join Us for Post Updates
Showing posts with label DOC download. Show all posts
Showing posts with label DOC download. Show all posts

Saturday, 13 April 2013

Psychology Facts | Study of Human Nature | Download PDF


What is Psychology

Psychology is an academic and applied discipline that involves the scientific study of mental functions and behaviors. Psychology has the immediate goal of understanding individuals and groups by both establishing general principles and researching specific cases, and by many accounts it ultimately aims to benefit society. In this field, a professional practitioner or researcher is called a psychologist and can be classified as a social, behavioral, or cognitive scientist. Psychologists attempt to understand the role of mental functions in individual and social behavior, while also exploring the physiological and neurobiological processes that underlie certain cognitive functions and behaviors.

READ MORE

Facts About Human Psychology

    1. 1. When a person laughs too much, even at stupid things, he is lonely deep inside.
      2. If a person sleeps a lot, he is sad.
      3. If a person speaks less, but speaks fast, he keeps secrets.
      4. If someone can’t cry, he is weak.
      5. If someone eats in an abnormal manner, he is tense.
      6. If someone cries on little things, he is innocent & soft-hearted.
      7. If someone becomes angry over silly or petty (small) things, it means he needs love
      8. Sometimes people push others away simply because they want those people to pull them closer.
      9. Unhappy people tend to watch more TV than those who are pleased & happy with their lives.
      10. If you are the 1st born among your siblings. You are more likely to desire control over others.
      11. A psychological study found that women are more attracted to men who barely show interest in them.
      12. A psychological study found that comparing yourself to others can instantly trigger sadness, causing you to feel less than.
      13. People who are generally “too nice” are also the ones to get hurt the most.

    Psychology Facts :  [DOC]


      14. When you’re single, all you see are happy couples. And when you’re committed, all you see are happy singles.
      15. Based on a psychological study, a crush only lasts for a maximum of 4 months. If it exceeds, you’re already in love.
      16. When you can’t stop thinking of someone, it’s more likely because they’re thinking about you as well.
      17. Psychological studies suggest that pretending not to miss someone tricks the mind into missing that person even more.
      18. The presence of beautiful women ignite stupid behavior in men.
      19. Personality psychology suggests that 3-5 years old girls’ and boys’ first crushes are their father and mother respectively.
      20. Psychologists discovered that knowing something is about to end makes us enjoy it all the more. ( :)End of the World ~2012)
      21. The psychological test results show symptoms of being in love very similar to severe OCD- Obsessive Compulsive Disorder.
      22. We are psychologically wired to crave tiny gadgets – we’ve been this way since we were cavemen.
      23. Psychological, disappointment can change a person’s outlook on relationships causing them push others away when they get to close.
      24. Psychologists have proven that we tend to over-estimate ourselves. We are not as nice as we think we are.
      25. Psychology claims that if two past lovers can remain just friends, its either they are still in love, or never were.
      26. When we sleep while hugging one pillow, we actually wish it to be the person we miss and love the most.
        27. If a person laughs too much, even at stupid things, he is lonely deep inside.
        28. If a person sleeps a lot, heis sad.
        29. If a person speaks less, but speaks fast, he keeps secrets.
        30. If some 1 can’t cry, he is weak.
        31. If some 1 eats in an abnormal manner, he istense.
        32. If some 1 cries on little things, he is innocent & soft-hearted.
        33. If some 1 becomes angry over silly or petty (small) things, it means he needs love.
      Share With Your Friends

      DOWNLOAD PSYCHOLOGY SYMBOL


  • Read more ...

    Monday, 8 April 2013

    What is 2PDA | PushDown Automata | PDF Download


    What is PDA

    In computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack.
    The PDA is used in theories about what can be computed by machines. It is more capable than a finite-state machine but less capable than a Turing machine. Because its input can be described with a formal grammar, it can be used in parser design. The deterministic pushdown automaton can handle all deterministic context-free languages while the non-deterministic version can handle all context-free languages.
    The term “pushdown” refers to the fact that the stack can be regarded as being “pushed down” like a tray dispenser at a cafeteria, since the operations never work on elements other than the top element. A stack automaton, by contrast, does allow access to and operations on deeper elements. Stack automata can recognize a strictly larger set of languages than deterministic pushdown automata.[citation needed] A nested stack automaton allows full access, and also allows stacked values to be entire sub-stacks rather than just single finite symbols.
    READ MORE >>

    What is 2PDA

    Formal Definition of Two-Stack Push Down Automaton
    is two-stack pushdown automaton to be a sextuple
    M = (K, Σ, Γ, Δ, s, F)
    K is a finite set of states,
    Σ is an alphabet (the input symbols),
    Γ is an alphabet (the stack symbols),
    s belongs to K is the initial state,
    F is subset of K is the set of final states, and
    Δ, the transition relation, is a finite subset of (K x (Σ U {e}) x Γ* x Γ*) x (K x Γ* x Γ*), where the third parameter pops the first stack, the fourth parameter pops the second stack, the fifth parameter pushes a symbol onto the first stack, and the sixth parameter pushes a symbol onto the second stack.
    2PDA :  [PDF]

    Relation of Two-Stack PDA to Chomsky Hierarchy

    In order to discuss where a two-stack PDA falls into the Chomsky Hierarchy, it is important to first explore its relation to a Turing Machine. Every two-stack PDA can be represented by a Turing Machine. To see this divide the Turing Machine’s tape into three areas, the first area corresponds to the input string of the PDA, the second area corresponds to the first stack’s contents, and the third area corresponds to the second stack’s contents.
    A push to the first or second stack is accomplished by the Turing Machine instruction that inserts the symbol being pushed to the cell that represents the top of the stack in the appropriate region.
    A pop to the first or second stack is accomplished by the Turing Machine instruction that reads the cell corresponding to the top of the stack in the appropriate region and then deletes that symbol, making sure to shift left all the cells that follow it.
    A reading of the input string in the two-stack PDA is accomplished by the Turing Machine instruction that reads the symbol at a cell on the Turing Machine’s region of the tape that represents the input string of the PDA and then overwriting it with a ‘b’ (the blank symbol).
    Thus using this algorithm, every two-stack PDA can be converted into a Turing Machine. There also exists an algorithm to convert every Turing Machine into a two-stack PDA. The two stacks are used to represent what is before and after the read head on the Turing Machine’s tape. When the Turing Machine’s head moves to the left or right, the two-stack PDA shifts symbols from the first stack to the second stack and vice versa. Thus every Turing Machine can be represented by a two-stack PDA. Since every Turing Machine can be represented by a two-stack PDA and every two-stack PDA can be represented by a Turing Machine, the two are equal.
    From the fact that two-stack PDA’s are essentially Turing Machines, it falls into the same place on the Chomsky hierarchy as Turing Machines. That means it can solve all problems that are solvable by a Turing Machine. From the Church-Turing thesis, we know that each Turing Machine is essentially an algorithm. Since every two-stack PDA is essentially a Turing Machine, it must be an algorithm also. Also, we know that a non-deterministic two-stack PDA is no more powerful than a deterministic PDA, because non-deterministic Turing Machines are no more powerful than deterministic Turing Machines. They may be able to calculate something more efficiently, but they are not more powerful.

    FOLLOW US FOR MORE

    Read more ...
    Designed By GyanVatika4U Team