All Matches

Solution Library

Expert Answer

Textbooks

Search Textbook questions, tutors and Books

Oops, something went wrong!

Change your search query and then try again

Result Not Found

Books FREE
Tutors
Study Help
Hire a Tutor
AI Study Help New

Search
Sign In
Register

study help
business
management and artificial intelligence

Questions and Answers of Management And Artificial Intelligence

9. Robots are assisting in sophisticated surgeries today. Usually these surgeries will be successful. However when they fail, there are of course complex legal issues. Review the literature and
8. You have seen the dialog between MrTomR and five-year-old Bobby in Section 15.0. Would such a dialog be possible today? Why or why not? What areas of AI that you have learned about in the text
7. Review Table 15.1 and determine if it is accurate. Are there any systems missing that should be in the table? Are there any trends you can see? What kind of progress in robotic systems does it
6. You have learned about the work of the remarkable Sebastian Thrun. What robotic systems has he built? Write a short paper about the systems we did not cover in our human interest box.
5. Review some of the works of Rodney Brooks. What is his approach to Robotics (see Chapter 6), what companies did he found, and which robotic systems should he be credited for?
4. Implement the Bug2 algorithm described in this chapter. You may assume that the obstacles are comprised of triangles of three cells in a discrete, well-defined space. When the robot encounters the
3. Compare the two films addressed above. Which do you believe is a better example of the theoretical, ethical, and technical issues of Robotics and AI? Explain.
2. Watch and review the movie Bicentennial Man. What major questions regarding robots does the film address?
1. Watch and review the movie IROBOT. What are the premier themes, methods, and technical issues addressed in this movie?
11. What is the Lovelace Project about? Do you believe it is sound and appropriate?
10. Describe the purposes and capabilities of the three significant modern-day robot projects presented in Section 15.3—Big Dog, Asimo, and Cog.
9. Discuss the purpose and capabilities of the Tortoise by Grey Walters.
8. Describe the purpose of the field of cybernetics.
7. Consider Asimov’s Three Laws of Robotics—are they still valid?
6. Describe the literary works of Karel Čapek, Mary Shelley, and Isaac Asimov and how they projected concerns and developments in robotics.
5. Name and describe two chess-related automata that were built in prior centuries.
they occur?
4. Describe the inventions of the father-son team Pierre and Henri-Louis Jaquet-Drov. When did
3. Describe some of the early myths about robotics that were presented in the chapter, including The Brass Head, the Homunculus, and the golem.
2. In the Story Box of MrTomR and Bobby, explain how today’s robots may or may not be able to perform the functions of MrTomR.
1. Discuss five areas of AI presented in previous chapters and their relationship to robotics.
5. How will we maintain “control” over the machines we have created?
4. And if life will be extendable in these ways, how will overpopulation be prevented?
3. Who will receive the best care (augmentations, resources) when there are limitations on availability?
2. Where, when, and what will define a person’s real identity – one’s essence (soul) ?
1. What defines a person – given all the augmentations we may soon acquire (better vision, better calculation skills, better health, longer life, etc.) ?
9. Describe how a human’s approach to planning is different from how a computer might tackle a planning problem. Describe how each one’s methods might also be similar.
8. How could computer planning be helpful in coping with natural disasters?
7. How might a computer-planning program be helpful to the military?
6. Consider how a STRIPS-like system would solve the famous Monkeys and Bananas Problem posed by John McCarthy:The Monkey is faced with the problem of getting a bunch of bananas hanging from the
5. Try one of the Practical Planners on the University of Edinburgh Web site www.aiai.ed.ac.uk/project/oplan and report on your experience.
4. What did the Sussman Anomaly demonstrate?
3. How would you get three blocks on Table X to be stacked on Table Y in the order A, B, C with block A on top? What operator(s) do you need in addition to those in Problem 2?
2. In the World of STRIPS, use the standard operators and actions to place three blocks—A, B, C—on top of each other on a table starting in the state, A is on C and B is on the table.
1. Recall the Donkey Puzzle presented in Chapter 3. Explain how you would define subgoals to solve this problem. How would a program recognize when the subgoals have been accomplished? Are there any
18. Name several areas where practical planners have been built.
17. What does O-Plan offer that the earlier planners didn’t?
16. What was the main feature of NONLIN?
15. What is Sussman’s Anomaly?
14. What is “One-Then-Best Backtracking”?
13. How did NOAH improve on what STRIPS started?
12. Name and describe five planning techniques.
11. Distinguish between partially and totally ordered planning.
10. What is the Frame Problem? What is the Qualification Problem? What is the ‘Ramification Problem’?
9. How would you distinguish planning from other kinds of play in games?
8. Explain how means-ends analysis works.
7. What is least-commitment search?
6. Name five different kinds of search methods in planning.
5. What system was developed to generalize on this system?
4. What is the system that many future planning systems were based on? Where was it developed? What could it do?
3. What was the first problem-solving system that performed planning? What was its purpose?
2. What are the essential components of a plan in the computer sense?
1. Why would one want to get a computer to be able to plan?
15. Explain the trends in NLP during the past 10–20 years. What are the challenges of Information Extraction?
14. Explain the difference between traditional Markov Chains and the Hidden Markov Model.
13. Consider the following grammar and the sentential forms it could produce. Draw a parse tree to demonstrate how the output strings below may be generated.S → aAb | bBA A → ab | aAB B → aB |
12. Consider the following CFG that generates sequences of letters:S -> a X c X -> b X c X -> b X d X -> b X e X -> c X e X -> f X X -> ga. If you had to write a parser for this grammar, would it be
11. Identify the different senses of the verb “roll” in the following sentences, and give an informal definition of each meaning. Try to identify how each different sense allows different
10. Bar-Hillel was astonished that no one had ever pointed out that in language understanding there is a world-modeling process going on in the mind of the listener. In what ways is this observation
9. Write as many interpretations as you can of the sentence:“Tom saw his dog in the park with the new glasses.”
8. Experience indicates that the average programmer produces N lines of documented, debugged code per day, on the average, for which N is some number less than 10. High-level code is typically n1
7. Winograd observes that the problem of determining the correct time context can be seen with the following sentences:a. Many rich people made their fortunes during the depression.b. Many rich
6. Obtain a copy of the early ELIZA program and run several pages of conversation with her.You should include reference to “computers,” family (mother, father, etc.), and perhaps use harsh
5. Describe how natural language processing has turned from the early ideals of AI researchers—clearly trying to distinguish syntax from semantics—to more recent approaches?
4. What was the concept behind the development of extended grammars?
3. Have a field day in parsing two of Yogi Berra’s famous phrases:“It’s getting late early”; and “That place is getting too crowded so nobody goes there anymore.”What are the syntactic
2. Write two context-free grammars to generate this sentence: “Time flies like an arrow.”
1. Explain the kind of difficulties that machine translation encountered.
24. What does Charniak see as the future of NLP and AI?
23. Describe the Penn Treebank Project.
22. Describe some of the main elements of Information Extraction.
21. What is the noisy-channel model?
20. What was one of the main efforts that led to the success of this approach?
19. Describe when and how statistical systems became prevalent in NLP systems.
18. What were the features of Schanks’ MARGIE, SAM, and PAM systems?
17. What is an HMM and how is it different from a Markov chain?
16. What is the CYK Algorithm and how does it work?
15. Describe the features of a finite state transition network.
14. What is a semantic grammar, who developed it, and for what system?
13. What is a case grammar?
12. What is a systemic grammar?
11. What is a transformational grammar?
10. Describe two features of Prolog that make it suitable for NLP.
9. Give an example of a regular grammar.
8. Describe the Chomsky Hierarchy of Grammars.
7. Describe five classes of understanding in terms of language.
6. Describe briefly the six periods of Natural Language Processing.
5. Research what Henri Kucera did to build the Brown Corpus.
4. Have they been accomplished after some 50 years?
3. What were the goals of machine translation?
2. Explain why language can be diabolical.
1. Describe some of the typical ambiguities of language.
14. In the Euclidean TSP, vertices are randomly placed in some square box (see Figure 12.37). No cost matrix is provided, as the distance between two points, P1 and P2, can be calculated by:d(P1, P2)
13. Write a program that uses S-ACO to solve the shortest path problem described in Chapter 2. Test your program on the map of northern China depicted in Figure 2.14(a). Experiment with various
12. Write a program that uses TS to find a minimum k-tree in a graph. Test your program on the graph shown in Figure 12.36, with k = 4.Your program begins with a greedy-based solution that selects
11. The minimum k-tree problem is to find a tree T in a labeled graph such that T has k edges and the total cost is minimal. For the graph shown in Figure 12.35, minimum 3-tree has a cost = 9.
10. Write a program that uses GP to solve the Tower of Hanoi Problem (consult Chapter 6) for n = 3 discs.
9. Write a program that uses GP to determine the chromatic number of a graph. Test your program on the graphs depicted in Figures 2.39 and 2.40.
8. Write a program that uses GP to construct a full adder.
7. Write a program that uses a GA to develop a strategy for the iterated Prisoner’s Dilemma.Use Koza’s ramped-half-and-half method to form the initial population for each of problems 8 and 9.

Showing 3200 - 3300 of 4588

First
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
Last

Services

Sitemap
Fun
Definitions
Become Tutor
Study Help Categories
Recent Questions
Expert Questions

Company Info

Security
Copyrights
Privacy Policy
Terms & Conditions
SolutionInn Fee
Scholarship

Get In Touch

About Us
Contact Us
Career
Jobs
FAQ
Campus Ambassador

Secure Payment

Download Our App

© 2024 SolutionInn. All Rights Reserved