Schedule Update ID Task Name 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 1 Initial Project Review 1.1 Review General Air Foil Theory 1.2 Preliminary Senior Design Coordinator Meetings 1.3 Examine Existing RC Planes 1.4 Review Competition Requirements 1.4.1 Select Competition Class 1.4.2 Review Selected Class Requirements 1.5 Establish Requirements Matrix 2 Research & Development 2.1 Wings 2.1.1 Review Existing Wing Designs 2.1.2 Select Basic Wing Layout 2.1.3 Theoretical Design of Wing 2.1.4 Computer Aided Wing Analysis 2.1.5 Physical Modeling Stereo-Lithography Session 2.2 Propeller 2.2.1 Existing Technology Review 2.2.2 Theoretical Propeller Design 2.2.3 Computer Aided Propeller Analysis 2.2.4 Physical Modeling 2.3 Fuselage 2.3.1 Aerodynamic Review 2.3.2 Theoretical Fuselage Design 2.3.3 Computer Aided Fuselage Design 2.3.4 Physical Modeling 3 Testing 3.1 Combine Wing, Propeller, Fuselage Models 3.2 Wind Tunnel Testing 3.3 Analyze Results 4 Reporting 4.1 Written 4.1.1 Project Proposal Written Project Proposal Due 4.1.2 Semester Report Written Semester Report 4.2 Oral 4.2.1 Project Proposal Oral Project Proposal 4.2.2 Semester Report Oral Final Report Duration August 2004 Start September 2004 October 2004 November 2004 December 2004 28 31 3 6 9 12 15 18 21 24 27 30 3 6 9 12 15 18 21 24 27 30 2 5 8 11 14 17 20 23 26 29 2 5 8 11 14 17 14 days? Tue 8/31/04 3 days? Tue 8/31/04 2 days? Tue 9/7/04 5 days? Tue 8/31/04 6 days? Tue 9/14/04 3 days? Tue 9/14/04 3 days? Tue 9/21/04 1 day Tue 9/28/04 23 days? Tue 10/5/04 23 days? Tue 10/5/04 2 days? Tue 10/5/04 3 days? Tue 10/12/04 6 days? Tue 10/19/04 6 days? Tue 11/2/04 5 days? Tue 11/16/04 0 days Tue 11/16/04 11.25 days? Tue 10/5/04 2.25 days? Tue 10/5/04 3 days? Tue 10/12/04 3 days Tue 10/19/04 3 days Tue 10/26/04 11 days? Tue 11/2/04 2 days? Tue 11/2/04 4 days? Thu 11/4/04 3 days? Tue 11/16/04 2 days? Tue 11/23/04 3 days? Tue 11/30/04 1 day Tue 11/30/04 1 day? Wed 12/1/04 1 day Thu 12/2/04 30.75 days? Tue 9/28/04 30 days? Tue 9/28/04 1 day? Tue 9/28/04 0 days Thu 9/30/04 13 days? Tue 10/5/04 0 days Tue 12/7/04 29.75 days? Wed 9/29/04 2 days? Wed 9/29/04 0 days Tue 10/5/04 9.75 days? Thu 10/28/04 0 days Wed 11/3/04
View full slide show




Progress Schedule Performance Index Project Proposals Background Research Tech nical Paper (Abstract/Intro) Tech nical Paper (Background) Tech nical Paper (Current Work) Tech nical Paper (Design Analysis) Tech nical Paper (Final Correlations) Design Proposals Design (Detail Spec Drawings Pro-E) Design (Data Computations) Design Software Analysis Machining (Casing) Machining (Turbine) Machining (Final Assembly) Testing (Initial) Testing (Modifications) Testing (Final) Project Status Report/Demonstration Final Presentation Overall Av erage = 102.68 % (21 days/21 days) * 100 = 100% (21 days/28 days) * 100 = 75% (14 days/14 days) * 100 = 100% (14 days/28 days) * 100 = 75% (14 days/21 days) * 100 = 67% (14 days/7 days) * 100 = 200% (42 days/42 days) * 100 = 100% (28 days/28 days) * 100 = 100% (28 days/28 days) * 100 = 100% (28 days/28 days) * 100 = 100% (14 days/21 days) * 100 = 67% (7 days/7 days) * 100 = 100% (14 days/14 days) * 100 = 100% (14 days/7 days) * 100 = 200% (7 days/7 days) * 100 = 100% (14 days/14 days)* 100 = 100% (14 days/21 days)* 100 = 67% (14 days/14 days)* 100 = 100% (7 days/7 days) * 100 = 100%
View full slide show




We can form multi-hop relationships from RoloDex cards. AC confident if most of the fF related to every aA, are also related to every cC. F is the Focus Entity and “most” means at least a MinimumConfidence ratio. TD (P=k) CT DT (P=k) CD A confident DThk rule means: 1 0 0 1 0 1 1 … 1 0 0 3 1 … 9 1 0 0 0 … 0 0 1 3 0 0 0 T Is there a high payoff research area here? 1 1 1 … 9 1 0 0 1 … 7 0 0 0 0 0 0 0 1 0 D A confident DPhk rule means: C 1 DP 1 0 0 (T=k) 0 1 1 A D DT (P=h) … 3 T C 1 TP 1 0 0 (D=k) 0 1 1 0 … 3 0 1 … 7 0 0 0 0 0 0 0 1 0 P 1 … 7 Market Basket RoloDex w different Cust-Item card for each day 1 … 0 0 0 … 3 0 0 0 9 0 0 1 1 1 … 3 A I 0 0 0 0 1 1 1 … 0 0 3 … 0 0 0 9 0 1 0 0 1 1 1 … 0 0 9 1 … 3 1 0 0 0 … 0 0 1 9 0 0 0 D A T TD (P=h) 0 0 1 … 3 0 0 0 0 0 0 0 1 0 C Conf Buy12 rule: Custs who Buy A on Day=1, Buy B on Day=2 w hi prob Buys (Day=1) 7 … … … 2 2 2 1 1 1 Pos Term 1 D 2 D 3 1 … 9 1 2 Pos 3 T … 7 1 … 7 1 0 0 1 … 9 0 0 0 0 0 0 0 1 0 … 7 T A high fraction of the Terms, tT in Doc=h which occur at every Pos, p A, also occur at every Pos, pC in Doc=k Is this a high payoff research area? AP PT (D=h) Buys (Day=4) EI DC 1 0 0 1 0 0 0 0 1 1 … 0 1 1 … 0 0 1 1 0 0 3 1 0 0 3 0 0 0 1 … 9 1 … 9 1 0 0 0 … 0 0 1 3 0 0 0 0 0 0 0 0 0 0 1 0 Buys day=3 Protein-Protein Interaction RoloDex (different card for each interaction in some pathway) … 9 1 0 0 0 … 0 0 1 3 0 0 0 Gene Gene Interaction=k I I Buys (Day=2) Conf Buy123 pathway: Most custs who Buy A Day=1 Buy B Day=2. Most of those custs Buy all of D on Day=3 1 9 P A confident PThk rule means: C 1 PT 1 0 0 (D=k) 0 1 1 D 1 AI Buys day=1 … Term=h in every Pos, pA, also have Term=k in every Pos. pC. 0 I 2 Confident TDhk rule means a high fraction of the Documents, dD having in Position=h, every Term, t A, also have in Position=k, every Term, t C. Again, A,C must be singletons. Hi payoff? It suggests in 1-hop ARM: Conf TD rules: hi fraction of Docs, dD having every term t A also have every term t C. Again, A,C must be singletons. Is there a high payoff research area here? 0 C 1 P Conf PDhk rule: A high fraction of the Documents, dD having C 1 PD 1 0 0 (T=k) 0 1 1 1 7 1 Buys (Day=2) 0 1 0 Buys (Day=2) B I 1 1 9 “Buys” pathways? Cust Buys (Day=k) Item 0 Conf TPhk: Hi fraction of pP in Doc=h holding AP PD (T=h) every t A, also hold every t C in Doc=k This only makes sense for A ,C singleton Terms. Also it seems like P would have to be singleton? AT TP (D=h) 1 Hi fraction of Positions, pP which hold Term=h for every doc A, hold Term=k in Pos=p for every doc C AD DP (T=h) … 9 P 0 A high fraction of the terms, tT in Position=h of every doc A, are also in Position=k of every doc C. 1 DTPe k=1..3 PTCd DTPe k=1..9 PDCd DTPe k=1..7 TDRolodexCd 1 … 3 A I 1 0 0 1 0 1 1 … 1 0 0 3 1 … 9 0 0 0 0 0 0 0 1 0 C C Buys (Day=3) Buys (Day=1) Conf Buy1234 pathway: Some customers Buys all of A on Day=1, then most of those customers will Buy all of B on Day=2, then most of those customers will Buy all of D on Day=3 And most of those customers Buy all of E Day=4
View full slide show