HW9_3 The following data set represents the growth rate of bacteria k (per d) as a function of oxygen k = Emax c? (C,+ c²) concentration c (mg/L) and can be modeled by the equation 1.5 5.3 0.5 2.5 7.6 c (mg/L) 0.8 4.0 k (/day) 1.1 2.5 8.9 Linearize & solve for the linearized model coefficients using a MATLAB built-in function. Plot the straight line along with the linearized data. Next, determine the coefficients for the original model, and then create a second figure showing the original data points, and the model function. Place a title on each figure & label axes. Compute r' for both the linearized fit and the growth model fit and place it on the plots with the text command.

HW9_3 The following data set represents the growth rate of bacteria k (per d) as a function of oxygen k = Emax c? (C,+ c²) concentration c (mg/L) and can be modeled by the equation 1.5 5.3 0.5 2.5 7.6 c (mg/L) 0.8 4.0 k (/day) 1.1 2.5 8.9 Linearize & solve for the linearized model coefficients using a MATLAB built-in function. Plot the straight line along with the linearized data. Next, determine the coefficients for the original model, and then create a second figure showing the original data points, and the model function. Place a title on each figure & label axes. Compute r' for both the linearized fit and the growth model fit and place it on the plots with the text command.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

The set of letters S consists of 30 As, 6 Bs, 24 Cs, 15 Ds, and 15 Es. The set of letters T consists of 25 As, 20 Bs, 15 Cs, 5 Ds and 35 Es. What is the mutual index of coincidence between sets S and T? Leave your answer as a fraction in lowest terms
Consider the elliptic curve group based on the equation y^2 ≡ x^3 + ax + b mod p where a=1190, b=213, and p=2011. We will use these values as the parameters for a session of Elliptic Curve Diffie-Hellman Key Exchange. We will use P=(2,51) as a subgroup generator. You may want to use mathematical software to help with the computations, such as the Sage Cell Server (SCS). On the SCS you can construct this group as: G=EllipticCurve(GF(2011),[1190,213]) Here is a working example. (Note that the output on SCS is in the form of homogeneous coordinates. If you do not care about the details simply ignore the 3rd coordinate of output.) Alice selects the private key 34 and Bob selects the private key 22. What is A, the public key of Alice? What is B, the public key of Bob? After exchanging public keys, Alice and Bob both derive the same secret elliptic curve point ???. The shared secret will be the x-coordinate of ???. What is it?
Suppose you want to solve the following equality 2a + b + 3c + 4d + 6e = 45 What is the chromosome phenotype? What is the fitness function? What is the fitness value of a, b, c, d, e = (The first five numbers of university ID)? (hint if ID= 437818854 then a=1, b=8, c=8, d=5, e=4)
Suppose you have been given a map of 6 cities connected with each other via different paths. Your job is to visit every city just once covering the minimum distance possible. Solve this problem using Genetic Algorithm. You can start at any point and end at any point. Just make sure that all the cities have been covered. 1. Encode the problem and create an initial population of 3 different chromosomes 2. Choose any one parent from your above solution and identify the following:i. Gene ii. Chromosome 3. Think of an appropriate fitness function to this problem and give proper justification. 4. Use the fitness function to calculate the fitness level of all the chromosomes in your population. Select the fittest 2 chromosomes based on the fitness function. 5. Perform crossover that you have been taught in the class on the selected parents. Now based on the offspring, for this problem do you think that is the best way to perform crossover? If not, explain why. 6. Perform mutation that you…
Given R=ABCDEFGand F = {CF→B, B→C, FB→E, CBE→F, E→AG, FA→B,BG→FE, BA→CG}The following is a minimal cover: A. (CFD, FBD, BED, BAD, BDG) B. CFD→BEAG C. CF→B, FB→E, E→AG, FA→B, BA→G D. CF→B, B→C, FB→E, E→AG, FA→B, BG→F, BA→G
Consider the following 10 data points: X= {(2,0, 1, -3, -2), (0, 2, -3, -3,-2), (1,2,1,3,-2), (-1, 1, 3, 2,-1), (1, 0, 1,-1, 1), (2, 3,-1,1,-2), (-2,3,-3, 3, 2), (-2,-2,2,3,-2), (-2,-3, 1, -2, -3). (-3, 2, 0,-1,-2)}. Compute the unit length principle components of X and choose two of them for PCA, then calculate the projection of each data on these two principal components. You could use python or matlab to obtain eigenvectors and eigenvalues.
Suppose that a manufacturing company builds n different types of robots, sayrobots 1, 2, . . . , n. These robots are made from a common set of m types of materials, saymaterials 1, 2, . . . , m. The company has only a limited supply of materials for each year,the amount of materials 1, 2, . . . , m are limited by the numbers b1, b2, . . . , bm, respectively.Building robot i requires an aij amount from material j. For example, building robot 1requires a11 from material 1, a12 from material 2, etc. Suppose the profit made by sellingrobot i is pi. Write an integer linear program for maximizing the annual profit for thecompany
Q1. Given a 2d grid map of '1's (land) and '0's (water),count the number of islands.An island is surrounded by water and is formed byconnecting adjacent lands horizontally or vertically.You may assume all four edges of the grid are all surrounded by water. Example 1: 11110110101100000000Answer: 1 Example 2: 11000110000010000011Answer: 3""" def num_islands(grid): count = 0 for i in range(len(grid)): for j, col in enumerate(grid[i]): if col == 1: dfs(grid, i, j) count += 1 Please code it.
Please answer the following question in depth with full detail. Suppose that we are given an admissible heuristic function h. Consider the following function: 1-h'(n) = h(n) if n is the initial state s. 2-h'(n) = max{h(n),h'(n')−c(n',n)} where n' is the predecessor node of n. where c(n',n) min_a c(n',a,n). Prove that h' is consistent.
Consider the Omega network and Butterfly network from p nodes in the leftmost column to p nodes in the rightmost column for some p=2^k. The Omega network is defined in Chapter 2 of the text book such that Si is connected to element S j if j=2i for or j=2i+1-p for See Chapter 2 in text book for its definition. The Butterfly network is an interconnection network composed of log p levels (as the omega network). In a Butterfly network, each switching node i at a level l is connected to the identically numbered element at level l + 1 and to a switching node whose number differs from itself only at the lth most significant bit. Therefore, switching node Si is connected to element S j at level l if j = i or j . Prove that for each node Si in the leftmost column and a node Sj in the rightmost column, there is a path from Si to Sj in the Omega network. Prove that for each node Si in the leftmost and a node Sj in the rightmost, there is a path from Si to Sj in the Butterfly network.
Using a pseudo random number generation function (e.g., rand() in C or otherequivalent functions in other languages) that generates uniformly distributed randomnumbers, generate a workload for a system that is composed of 1000 processes. Youcan assume that processes arrive with an expected average arrival rate of 2 processesper second that follows a Poisson Distribution and the service time (i.e., requestedduration on the CPU) for each process follows an Exponential Distribution with anexpected average service time of 1 second. Your outcome would be printing out a listof tuples in the format of <process ID, arrival time, requested service time>.You can assume that process IDs are assigned incrementally when processes arriveand that they start at 1.Based on your actual experiment outcome, also answer the following question: whatare the actual average arrival rate and actual average service time that were generated?
Classify the 1’s, 2’s, 3’s for the zip code data in R. (a) Use the k-nearest neighbor classiﬁcation with k = 1, 3, 5, 7, 15. Report both the training and test errors for each choice. (b) Implement the LDA method and report its training and testing errors. Note: Before carrying out the LDA analysis, consider deleting variable 16 ﬁrst from the data, since it takes constant values and may cause the singularity of the covariance matrix. In general, a constant variable does not have a discriminating power to separate two classes.