Concept explainers
Gliding mammals Many species of small mammals (such as flying squirrels and marsupial gliders) have the ability to walk and glide. Recent research suggests that these animals choose the most energy-efficient means of travel. According to one empirical model, the energy required for a glider with body mass m to walk a horizontal distance D is 8.46 Dm2/3 (where m is measured in grams, D is measured in meters, and energy is measured in microliters of oxygen consumed in respiration). The energy cost of climbing to a height D tan θ and gliding a distance D at an angle θ below the horizontal is modeled by 1.36 m D tan θ (where θ = 0 represents horizontal flight and θ > 45° represents controlled falling). Therefore, the function
gives the energy difference per horizontal meter traveled between walking and gliding: If S > 0 for given values of m and θ, then it is more costly to walk than glide.
- a. For what glide angles is it more efficient for a 200-gram animal to glide rather that walk?
- b. Find the threshold function θ = g(m) that gives the curve along which walking and gliding are equally efficient. Is it an increasing or decreasing function of body mass?
- c. To make gliding more efficient than walking, do larger gliders have a larger or smaller selection of glide angles than smaller gliders?
- d. Let θ = 25°, (a typical glide angle). Graph S as a function of m, for 0 ≤ m ≤ 3000. For what values of m is gliding more efficient?
- e. For θ = 25°, what value of m (call it m*) maximizes S?
- f. Does m*, as defined in part (e), increase or decrease with increasing θ? That is, as a glider reduces its glide angle, does its optimal size become larger or smaller?
- g. Assuming Dumbo is a gliding elephant whose weight is 1 metric ton (106 g), what glide angle would Dumbo use to be more efficient at gliding than walking?
(Source: Energetic savings and the body size distribution of gliding mammals, R. Dial, Evolutionary Ecology Research 5, 2003)
Want to see the full answer?
Check out a sample textbook solutionChapter 4 Solutions
Calculus: Early Transcendentals (3rd Edition)
Additional Math Textbook Solutions
Introductory Statistics
Thinking Mathematically (6th Edition)
A Problem Solving Approach To Mathematics For Elementary School Teachers (13th Edition)
A First Course in Probability (10th Edition)
Elementary Statistics (13th Edition)
Basic Business Statistics, Student Value Edition
- How to develop a C program that receives the message sent by the provided program and displays the name and email included in the message on the screen?Here is the code of the program that sends the message for reference: typedef struct { long tipo; struct { char nome[50]; char email[40]; } dados;} MsgStruct; int main() { int msg_id, status; msg_id = msgget(1000, 0600 | IPC_CREAT); exit_on_error(msg_id, "Creation/Connection"); MsgStruct msg; msg.tipo = 5; strcpy(msg.dados.nome, "Pedro Silva"); strcpy(msg.dados.email, "pedro@sapo.pt"); status = msgsnd(msg_id, &msg, sizeof(msg.dados), 0); exit_on_error(status, "Send"); printf("Message sent!\n");}arrow_forward9. Let L₁=L(ab*aa), L₂=L(a*bba*). Find a regular expression for (L₁ UL2)*L2. 10. Show that the language is not regular. L= {a":n≥1} 11. Show a derivation tree for the string aabbbb with the grammar S→ABλ, A→aB, B→Sb. Give a verbal description of the language generated by this grammar.arrow_forward14. Show that the language L= {wna (w) < Nь (w) < Nc (w)} is not context free.arrow_forward
- 7. What language is accepted by the following generalized transition graph? a+b a+b* a a+b+c a+b 8. Construct a right-linear grammar for the language L ((aaab*ab)*).arrow_forward5. Find an nfa with three states that accepts the language L = {a^ : n≥1} U {b³a* : m≥0, k≥0}. 6. Find a regular expression for L = {vwv: v, wЄ {a, b}*, |v|≤4}.arrow_forward15. The below figure (sequence of moves) shows several stages of the process for a simple initial configuration. 90 a a 90 b a 90 91 b b b b Represent the action of the Turing machine (a) move from one configuration to another, and also (b) represent in the form of arbitrary number of moves.arrow_forward
- 12. Eliminate useless productions from Sa aA BC, AaBλ, B→ Aa, C CCD, D→ ddd Cd. Also, eliminate all unit-productions from the grammar. 13. Construct an npda that accepts the language L = {a"b":n≥0,n‡m}.arrow_forwardYou are given a rope of length n meters and scissors that can cut the rope into any two pieces. For simplification, only consider cutting the rope at an integer position by the meter metric. Each cut has a cost associated with it, c(m), which is the cost of cutting the rope at position m. (You can call c(m) at any time to return the cost value.) The goal is to cut the rope into k smaller pieces, minimizing the total cost of cutting. B Provide the pseudo-code of your dynamic programming algorithm f(n,k) that will return the minimum cost of cutting the rope of length n into k pieces. Briefly explain your algorithm. What is the benefit of using dynamic programming for this problem? What are the key principles of dynamic programming used in your algorithm?arrow_forwardDetermine whether each of the problems below is NP-Complete or P A. 3-SAT B. Traveling Salesman Problem C. Minimum Spanning Tree D. Checking if a positive integer is prime or not. E. Given a set of linear inequalities with integer variables, finding a set of values for the variables that satisfies all inequalities and maximizes or minimizes a given linear objective function.arrow_forward
- 1. Based on our lecture on NP-Complete, can an NP-Complete problem not have a polynomial-time algorithm? Explain your answer. 2. Prove the conjecture that if any problem in NP is not polynomial-time solvable, then no NP-Complete problem is polynomial-time solvable. (You can't use Theorem 1 and 2 directly) 3. After you complete your proof in b), discuss how this conjecture can be used to solve the problem of whether P=NP.arrow_forwardBased on our lectures and the BELLMAN-FORD algorithm below, answer the following questions. BELLMAN-FORD (G, w, s) 1 INITIALIZE-SINGLE-SOURCE (G, s) 2 for i = 1 to |G. VI - 1 3 4 5 6 7 8 for each edge (u, v) = G.E RELAX(u, v, w) for each edge (u, v) = G.E if v.d> u.d+w(u, v) return FALSE return TRUE 1. What does the algorithm return? 2. Analyze the complexity of the algorithm.arrow_forward(Short-answer) b. Continue from the previous question. Suppose part of the data you extracted from the data warehouse is the following. Identify the missing values you think exist in the dataset. Use Column letter and Row number to refer to each missing value in the dataset. Please write down how you want to address each particular missing value (you can group them if they receive same treatment). For imputation, you do not need to calculate the exact imputed values but just describe what kind of value you want to use to impute.arrow_forward
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology PtrSystems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage LearningPrinciples of Information Systems (MindTap Course...Computer ScienceISBN:9781305971776Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning