Related questions
Concept explainers
1. Following question _Qestion 2 – Simple Machine-Learning Function Java Program
A Learning Function is an empirical formula which isresponsible for regulating the training of an agent
with respect to Machine Learning and
prototype Learning Function, ?, which tunes and regulates the training as well as learning in our AI
agents. This is defined such that: ? = ? ∗ Ω
Given that Ω = 0.567143 and ? is a dynamic variable, which is defined with respect to the day of
the week and the time of the day, as illustrated in the table below:
| Weekday/Time | Day-Light | Night-Time |
| Monday | 2.53 | 3.25 |
| Tuesday | 3.15 | 2.99 |
| Wednesday | 3.00 | 3.99 |
| Thursday | 2.41 | 2.68 |
| Friday | 1.99 | 3.73 |
| Saturday | 3.59 | 2.86 |
| Sunday | 2.00 | 2.59 |
Therefore, write a Java class/program correctly such that your source code will accomplish the following:
1. Display a prompt message for the user to enter the Weekday and the Time as a single input separated via the space character. Thus, valid inputs for Weekday and Time variables are: Monday – Sunday and Day-Light as well as Night-Time, respectively. Also, these inputs MUST be case-insensitive.
2. Validate the user’s inputs to ensure that only valid values were entered for Weekday and Time inputs. If an invalid input was received; display the respective error message, and end the program with a note to the user to retry again.
3.If the user has entered a valid input with respect to Weekday and Time, process the user’s inputs to determine the corresponding value for variable, ?.
4. Thereafter, compute the resultant value for our prototype learning function, ?, using the aforementioned empiric formula.
5. You MUST use the switch() statement to implement all your decision/selection logic withrespect to the value for variable ? in the Weekday/Time table given herein. In this regard, using an if() statement in lieu of switch() statement will be assumed as a logical failure.
6. After processing, display a confirmation message to the user in the form below: Value of the prototype Learning Function, ?, is: X.XX
7. Finally, display a complimentary-close message as follows: Thank you for contributing to this Machine Learning project!.
Step by stepSolved in 3 steps with 1 images
- 7. The following shows the state transition diagram of a Turing machine for language A = {a² In>0}. For example, strings a, aa, aaaa, and aaaaaaaa are members of language A. Modify this Turing machine to recognize language B = {a(2)-1 | n ≥ 0). For example, strings e, a, aaa, and aaaaaaa are members of language B. You can modify, add, or remove transitions, but you cannot add or remove any states. a → a, L 0-0,4 1+1, L 0-1,L U-1,L z→z,R 0 0-1,L U-1,L a➡z, R 31-0, R 1-0, R 2Daa,R aa, R 1 0-0, R 1-1,R U-U,R reject 0-0, R 31+1,R U-UR acceptarrow_forwardThis is an Automata and Computation question.arrow_forwardSolutions to a dynamic programming problem have (at minimum) three things: – A recurrence relation – A brief description of what your recurrence function represents and what each case represents. – A brief description of the memory element/storage and how it’s filled in. – Always give complete solutions, not just examples.– Always declare all your variables, in English. In particular, always describe the specific - problem your algorithm is supposed to solve. – Never use weak induction.arrow_forward
- Formal Specification Predicate Logic By quantificationA quantifier is a mechanism for specifying an expression about a set of values. Thereare three quantifiers that we can use, each with its own symbol:–The universal quantifier ∀This quantifier enables a predicate to make a statement about all the elements ina particular set. For example, if M(x) is the predicate x chases mice, we could write:∀x Cats ● M(x)This reads For all the x which are members of the set Cats, x chases mice, or, moresimply, All cats chase mice.– The existential quantifier ∃In this case, a statement is made about whether or not at least one element of a setmeets a particular criterion. For example, if, as above, P(n) is the predicate n is aprime number, then we could write:∃n ● P(n)This reads There exists an n in the set of natural numbers such that n is a primenumber, or, put another way, There exists at least one prime number in the set ofnatural numbers.–The unique existential quantifier !This quantifier…arrow_forwardFor the goal-based agent architecture given in the picture, write the pseudocode for the agent, given the following: function GOAL-BASED-AGENT (percept) returns an action persistent: state, the agent’s current conception of the world state model, a description of how the next state depends on the current state and action goal, a description of the desired goal state plan, a sequence of actions to take, initially empty action, the most recent action, initially nonearrow_forwardcan you help me with this problem because I am struggling can you please help me. Can you please do something visual to help me understand it better and can you explain you explain it step by step.arrow_forward
- A statement form is satisfiable if there is an assignment True/False for its variables such that the statement form is True. Otherwise, that is, if no such assignment exists, the statement form is called unsatisfiable. Consider the statement form = (p → q) ^ (~ p V r) ^ (qV ~ r) Use a possibility tree to decide if is satisfiable or not.arrow_forwardin imagearrow_forwardAssignment 6: Problem Set on TMs. 1. Given the following definition of a Turing machine M = (Q, E, I, 6, 91, accept, Greject): • Q={91, 92, 98, Jaccept, greject} « Σ = {0, 1, #} • T = EU {z, u} 0-0, R 1-1,R ## .R 0-2,R 9 0-2, L 9: 97 0-0, L 1-1, L #-#.R 1-2, R 9s 3. Prove that every regular language is decidable. ##.R 9 1-3, L 0-0, R 1-1, R 0-0, L 1-1,4 z-z, R Simulate the Turing machine on input (a) 010#1 and (b) 1#1. Use the concept of configurations to illustrate the transitions. z-z.R Garape Note: To simplify the figure, the reject state and transitions going to the reject state are not shown. Those transitions occur implicitly whenever a state lacks an outgoing transition for a particular symbol. R 2. Let A be the set of all strings over the alphabet (a, b) where the number of a's is twice as much as the number of b's. Construct the state diagram of a Turing machine that recognizes A.arrow_forward
- Can you please help me with this because I am struggling with this problem, Can you please do this problem step by step and can you do explanations as well.arrow_forwardConsider the language of balanced brackets that may be nested and concatenated, i.e., L = { , >, , >>, >, >, >, , ... }. Which is true about L? A. This language is regular. B. This language is context-free but not regular. C. This language is context-sensitive but not context-free. D. This language is Turing-decidable but not context-sensitive.arrow_forwarduse python languagearrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON 
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education