1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
aksik [14]
3 years ago
10

You are asked to add speech to a robotic receptionist that sits at the front desk of a large organization. The robot has an anim

ated face and can track users with a laser range finder. The system already has been used with type-in and print out information. Explain what their requirements and restrictions would be. How would these components interact with the existing dialog component? How would you evaluate it?
Computers and Technology
2 answers:
Firlakuza [10]3 years ago
7 0

Explanation:

The requirements would be that the receptionist robot detects the incoming person and speak;

<em>Good morning (based on time), Welcome to XYZ organization. How can i help you. Do you need to visit HR, finance, marketing, sales, engineering etc representative or other function?</em>

Now based on that a visitee information is printed out.

Limitation

A person comes who does not understand what robot speaks

Interaction with existing dialogue would be made possible through speech recognition system

The system will work well as speech recognition has now been used in many functions and robots have also now become quite advanced

Maru [420]3 years ago
4 0

Answer:

Refer below for the explanation.

Explanation:

Requirements:

Robot that is installed with the laser range finder detects when the person is coming and ask him the basic questions.

Hello, how are you. Welcome to the company. Where do you want to go?

Restrictions:

As there is speech recognition and text-to-speech components so it will help the user if the robot is unable to answer his questions.

You might be interested in
What are the major differences between searching and sorting in Java? What are some of the differences in the techniques used in
Studentka2010 [4]

Answer:  

  • Searching is a technique to look for an item or target value in a data structure like searching for a phone number in a directory.Data structure can be an array,List etc. Searching algorithms are used for searching. Most common examples are Linear Search and Binary Search. Lets take the example Linear Search in order to explain it using JAVA. Its the simplest searching algorithm. To search for a specific element, look at each element in the data structure sequentially and check if it matches with the element being searched for.
  • Sorting is a technique of arranging the elements in a specific order e.g. numerical sorting, ordering students according to their exam score. This order can be ascending or descending or alphabetical order. Contrary to search it returns the data structure e.g. an array in which the elements of array are sorted in a particular order. Sorting algorithms are used to sort elements in a data structure. Some common examples of sorting algorithms are Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, Heap Sort etc. JAVA uses Array.Sort() built-in function for sorting an array. By default it sorts the input array in ascending order.
  • Selection Sort: It is a sorting technique which divides an array into two subarrays. One subarray in the left is sorted and the other one at right is unsorted. This is an in-place algorithm. It is not a good option for large data. Initially the sorted part is empty and all elements are placed in unsorted array. First the element which is the smallest in the unsorted array is selected and swapped with the leftmost array element and becomes part of the sorted array. In each iteration the smallest element from the unsorted array is selected and moved to sorted part of the array.The worst case time complexity of this algorithm is O(n)^2 as we have to find the smallest for every element in the array.
  • Merge Sort: It is a comparison based algorithm. It works on divide and conquer technique. It uses recursion approach for sorting. This means it breaks the problem(lets say array list to be sorted) into sub problems (smaller parts) and then solves (in this case sorts) each sub problem in a recursive manner. At the end it merges the solutions (hence the merged sorted array). Although selection sort works faster when data set is small merge sort outperforms it for larger data sets. Merge sort is a stable algorithm and works best for linked lists. Its not an in place algorithm. Time complexity of merge sort is O(n*log n) for best, average and worst cases because it always divides the array in two parts and takes linear time to merge these part. O(n(logn)) time complexity makes it better,more efficient and faster to sort large data sets.
  •  Big Oh O notation is an asymptotic annotation written as O(n) which is a mathematical way to represent the upper bound of the running time of   algorithm (sorting algorithm in this case). It computes the worst case time complexity. Worst case time complexity means that the longest amount of time or maximum number of operations that will be required for a sorting algorithm to complete. The time complexity mostly gets affected as the size of the input varies.
  • For example lets find out the worst-case time complexity of Bubble Sort for a list of n elements. Worst case is when the array is reversed sorted. At first iteration it would make n-1 comparisons. At iteration 1, for n-2 times and so total comparison will be O(n^)2. So the time to run program is proportional to the square of the input size.
  • Searching algorithms are used when there is a need to find a specific data item from bulk of data item. Searching algorithms make this hectic process easier. For example you want to find phone number of person from directory. without searching algorithm looking for each phone number in the directory manually can be very time consuming. For example you have to find address of a customer number 254 from database to deliver a product. Instead  of manually looking for customer numbers you can simply use  linear search algorithm that will start from customer 1 and sequentially searches for specific customer 254 number and provides the address in a shorter time.
  • Sorting reduces complexity of problems e.g reducing the searching complexity. It is easier to locate data elements in a sorted list than unsorted. For example comparing two large data sets containing millions of records. If both the data sets are ordered, the comparison gets easier. Moreover every sorting algorithm has certain usage. Like merge sort is useful for linked lists,heap sort is good with arrays and uses less memory. If data is small with large values, selections sort is better for this. It doesn’t require any additional space. Databases use merge sort to arrange data that is too large to be loaded completely into memory.  Heap sort is used in reading bar codes on plastic cards. Quick sort is used to maintain sports score on the basis of win-loss ratio.
5 0
3 years ago
In a proper webpage, which tag holds all of a webpages visible HTML?
Evgen [1.6K]

Body.


head contains all of the data that we generally don't see.


Link is used to link to external stylesheets.


script is where you would type scrips.


doctype is used to tell the browser the document type.

6 0
3 years ago
Though there are no specific federal laws for cyberbullying, in some cases cyberbullying
inessss [21]
Cyberbullying overlaps with discriminatory harassment
7 0
3 years ago
Who is familiar with Pixlr E.com on here????!!!!!
dsp73

meAnswer:

Explanation:

5 0
2 years ago
Which of the following is a basic strategy for minimizing the opportunity for error in a process?
dolphi86 [110]

Answer: b) Standardizing how the process is completed

Explanation:

Occurrence of error in a process can be due to several reason like human error,equipmental error, qualitative error etc.It includes internal as well as external factor.To eliminate the occurrence of fault in process, it is better to follow standard and systematic working in uniform way so that any kind of manipulation and modification does not lead to error.

  • Other options are not appropriate because trying harder will not correct chances of fault rather it will only waste the efforts.Not depending on technology is also not the solution to gain accuracy in process.
  • Thus, the correct option is option(b).
6 0
2 years ago
Other questions:
  • In three or four sentences, describe how a person buys and sells stock.
    6·2 answers
  • Complete the following:_____
    9·1 answer
  • Okay so, not really a question but whatever it’s been bothering me.
    9·2 answers
  • Dr. Patterson’s office calls to give patient Sara Martin her test results from her most recent visit. Her husband answers the ph
    8·2 answers
  • Software that protects confidentiality by screening outgoing documents to identify and block transmission of sensitive informati
    12·1 answer
  • ) Which is true about the agile method?
    7·1 answer
  • Which of the following is true regarding a class and interface types? Group of answer choices You can convert from a class type
    9·1 answer
  • Write a C++ programthat returns the type of a triangle (scalene, equilateral,or
    12·1 answer
  • Define the terms network, LAN, WAN, and Internet.
    11·1 answer
  • Please explain what steps you will take to prevent hackers from getting access to your personal information.
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!