Critical Thinking:
Designing aircraft seats
When designing seats for aircraft, we want to have sufficient room so that passengers are comfortable and safe, but we don’t want too much room, because fewer seats could be installed and profits would drop. It has been estimated that removing one row of seats would cost around $8 million over the life of an aircraft.
Figure 6-22(a) shows an important human consideration: The buttock-to-knee length. The accompanying table includes relevant buttock- to-knee length parameters obtained from studies of large numbers of people. Figure 6-22(b) shows a traditional aircraft seat, and Figure 6-22(c) shows the new SkyRider seat design by the Italian company Aviointeriors. The SkyRider seat is dramatically different from traditional aircraft seats. The seats are like saddles, and they are higher so that passenger legs slant downward with weight on the legs. The most dramatic difference is that SkyRider seats have much less legroom. The distance of 23 in. shown in Figure 6-22(c) is a distance of 30 in. to 32 in. for most current economy seats. As of this writing, the SkyRider seats have not yet been approved by the Federal Aviation Administration, but approval would allow a new class of seating with very low fares.
When designing aircraft seats, we must make some hard choices. If we are to accommodate everyone in the population, we will have a sitting distance that is so costly in terms of reduced seating that it might not be economically feasible. Some questions we must address are: (1) What percentage of the population are we willing to exclude? (2) How much extra room do we want to provide for passenger comfort and safety?
Figure 6-22 Distances Used In the Design of Aircraft Seats
5. Seat pitch is defined to be the distance between the same point on two successive seats. In addition to buttock-to-knee length, what other important factor affects the choice of seat pitch?
Want to see the full answer?
Check out a sample textbook solutionChapter 6 Solutions
Elementary Statistics with MyStatLab Access Code [With CDROM]
- solve the question based on hw 1, 1.41arrow_forwardT1.4: Let ẞ(G) be the minimum size of a vertex cover, a(G) be the maximum size of an independent set and m(G) = |E(G)|. (i) Prove that if G is triangle free (no induced K3) then m(G) ≤ a(G)B(G). Hints - The neighborhood of a vertex in a triangle free graph must be independent; all edges have at least one end in a vertex cover. (ii) Show that all graphs of order n ≥ 3 and size m> [n2/4] contain a triangle. Hints - you may need to use either elementary calculus or the arithmetic-geometric mean inequality.arrow_forwardWe consider the one-period model studied in class as an example. Namely, we assumethat the current stock price is S0 = 10. At time T, the stock has either moved up toSt = 12 (with probability p = 0.6) or down towards St = 8 (with probability 1−p = 0.4).We consider a call option on this stock with maturity T and strike price K = 10. Theinterest rate on the money market is zero.As in class, we assume that you, as a customer, are willing to buy the call option on100 shares of stock for $120. The investor, who sold you the option, can adopt one of thefollowing strategies: Strategy 1: (seen in class) Buy 50 shares of stock and borrow $380. Strategy 2: Buy 55 shares of stock and borrow $430. Strategy 3: Buy 60 shares of stock and borrow $480. Strategy 4: Buy 40 shares of stock and borrow $280.(a) For each of strategies 2-4, describe the value of the investor’s portfolio at time 0,and at time T for each possible movement of the stock.(b) For each of strategies 2-4, does the investor have…arrow_forward
- Negate the following compound statement using De Morgans's laws.arrow_forwardNegate the following compound statement using De Morgans's laws.arrow_forwardQuestion 6: Negate the following compound statements, using De Morgan's laws. A) If Alberta was under water entirely then there should be no fossil of mammals.arrow_forward
- Negate the following compound statement using De Morgans's laws.arrow_forwardCharacterize (with proof) all connected graphs that contain no even cycles in terms oftheir blocks.arrow_forwardLet G be a connected graph that does not have P4 or C3 as an induced subgraph (i.e.,G is P4, C3 free). Prove that G is a complete bipartite grapharrow_forward
- Trigonometry (MindTap Course List)TrigonometryISBN:9781305652224Author:Charles P. McKeague, Mark D. TurnerPublisher:Cengage LearningAlgebra and Trigonometry (MindTap Course List)AlgebraISBN:9781305071742Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage Learning
- Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALMathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,