18 Pages

Chapter5

Course: ETD 06152000, Fall 2009
School: Virginia Tech
Rating:
 
 
 
 
 

Word Count: 4607

Document Preview

5 CHAPTER FORECASTING TRAVEL TIME WITH NEURAL NETWORKS 5.1 - Introduction The estimation and predication of link travel times in a road traffic network are critical for many intelligent transportation system (ITS) applications such as route guidance system (RGS), advanced traveler information systems (ATISs) and freeway traffic management systems. The common objective of these systems is to provide information...

Register Now

Unformatted Document Excerpt

Coursehero >> Virginia >> Virginia Tech >> ETD 06152000

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
5 CHAPTER FORECASTING TRAVEL TIME WITH NEURAL NETWORKS 5.1 - Introduction The estimation and predication of link travel times in a road traffic network are critical for many intelligent transportation system (ITS) applications such as route guidance system (RGS), advanced traveler information systems (ATISs) and freeway traffic management systems. The common objective of these systems is to provide information necessary to help individual drivers identify optimal routes based on real-time information on current traffic conditions. To identify these optimal routes, the selection algorithms should base their link travel times on when the driver actually arrives at a given link rather than the current link travel time. This would be particularly important for trips where the travel time is relatively long (e.g., greater than 30 minutes) and where it is unlikely that the current travel time will remain stable. In reality, most drivers base their routes on the estimated travel time when they arrive at a particular link; the ATIS projects also should have the same capabilities. The current travel time information can obtain from a number of sources including loop detectors, prove vehicles, AVI system and GPS system etc. This chapter examines how the AVI Tag data gathered in San Antonio can be used to predict link travel times for the near future. The focus of this study is on examining artificial neural networks (ANNs) for forecasting multiple-periods link travel times. ANN models were these modals have the ability to take into account spatial and temporal travel time information simultaneously (Park, 1999). For example, it might be expected that travel time information on the link for proceeding times could be used to predict what will happen in the near future. Additionally, an increase in congestion on an upstream link may be a useful indicator of an increase in travel time in the near future on the target link. The data used as input are actual link travel time from San Antonio, Texas, collected as part of the automatic vehicle identification (AVI) system of Texas TransGuide system. 5.2 Literature Review: Previous Traffic Prediction Efforts 46 "The short-term forecasting of traffic conditions has had an active but somewhat unsatisfying research history"(Davis and Nihan, 1991). In the past years, transportation engineers have tended to focus on short-term traffic flow prediction that is used in surface control systems, such as the Urban Traffic control System (UTSC). With the advent of route guidance system (RGSs), the prediction of short-term link travel times has become increasingly important. In order for RGSs to be successful, the calculated route should be based on anticipatory link travel time information which forecasted from the historical or current travel time information. Most of the link travel time research has focused on link travel time estimation rather than on link travel time forecasting, and the input data from loop detectors, probe vehicles, and simulation programs. There have been a limited number of freeway traffic prediction applications. The approaches used for traffic prediction are largely dictated by the fact that traffic conditions are time dependent and often follow fairly well-defined patterns. Previous traffic prediction efforts can be classified as historical, data-base algorithms; time-series and Kalman filtering models; simulation models and neural network models. 5.2.1 Historical, Data-Based Algorithms The Basic premise behind historical, data-based algorithms is that traffic patterns are cyclical. In other words, a knowledge of typical traffic conditions on Monday at 9:00 a.m. will allow one to predict the conditions on any particular Monday at 9:00 a.m. AUTOGUIDE, an ATIS demonstration project in London, simply uses a historical traffic data base to predict travel times on the basis of time of day. Such an algorithm is attractive in that it requires no real-time data. The UTCS traffic control system utilizes predictions of traffic conditions in an attempt to control signals in a proactive manner. In general, UTCS relies on historical data as support for predictions. A weakness of this method is that UTSC is difficult to apply to a new setting since it requires an extensive set of historical data. An enhancement of UTCS (UTCS-2) uses "current traffic measures to correct for the traffic deviation from the average historical"(Stephanedes, 1981). Recently, The new generation UTCS does not utilize historical data; it predicts conditions on the basis of current measurements only. 47 LISB, which is a European traveler information experiment, uses a simple methodology to predict future traffic condition. LISB used both historical data and real-time data. A projection ratio of the "historical travel time on a specific link to the current travel time as reported by equipped vehicles" is used to predict travel times on the link for future intervals. A major weakness of this methodology is that it implicitly assumes that the projection ration will remain constant (Kaysi, 1993). Hoffman and Janko(1988) developed a link travel-time estimation and prediction method that has been used in the ALI_SCOUT system in Berlin, which is a centralized RGS that the best route is identified by a central computer and then sent to the vehicles through roadside beacons located at major intersections. In their approach the link travel time is predicted by scaling the historical travel time on the basis of current detected link travel time. The method for travel time forecasting assumes that the ratio of the current travel time to the mean travel time from the historical data remains unchanged over the future time period. This ratio is called the Deviation coefficient (ij.k) and is shown in Equation (5.1): __ ij.k = Where tt ij .k ttij .k (5.1) ij.k= deviation coefficient on link ( i,j ) for time period k __ tt ij .k = historical profile (mean travel time) on link ( i,j ) for the time period k ttij .k = current travel time on link ( i,j ) for time period k If there is no current travel time available, then ij.k is set to 1. The predicted travel time on link ( i,j ) at a future time interval m, tt * ij .m , is calculated using Equation (5.2): __ tt ij .m tt * ij .m = ij .k (5.2) Where 48 tt * ij.m = predicted travel time on link ( i,j ) for time period m __ tt ij .m = historical profile (mean travel time) on link ( i,j ) for time period m Koutsopoulos and Xu(1991) presented an approach based on information-discounting theory as an attempt to improve on Hoffman's approach. In the ADVANCE project, two types of link travel time profiles were used. The first type is a historical profile and is used for route calculation when the road traffic is assumed to be operating under stable and historical conditions. The second type is a real-time profile and is used by the Traffic Information Center (TIC) to estimate the link travel time when the real-time link travel time deviates significantly from the historical value. Based on Equation (5.2), the future link travel time can be forecasted, and the differences between the predicted link travel time and the historical link travel time are sent to each equipped vehicle for the route calculation. 5.2.2 Time-Series and Kalman Filtering Models The basis idea of time-Series analysis techniques are to forecast the condition X(t+d), given X(t), X(t-d), X(t-2d), and so on while d is the prediction time interval. There have been a number of techniques developed in the field of statistics to model time series. Transportation researchers have applied many of these time series analysis techniques to traffic prediction. The Box and Jenkins technique is a widely used approach to specifying a variety of time-series models. It has been shown to yield accurate forecasting results in a number of application areas. The most developed Box and Jenkins techniques is the auto-regressive integrated moving average (ARIMA) method. Van Arem et al. used a linear input input-output ARIMA model to forecast freeway travel time using travel time from inductive loop detectors. In 1993, Anderson et al. examined these ARIMA techniques to predict the link travel times based on the approaching traffic flow. They used the travel time observations of the last 11 vehicles and the traffic flow in the preceding minute to predict the one-time-step-ahead (5 minutes) link travel time. Takahashi used the filtering model to forecast travel time based on the travel time from AVI and the time-occupancy rate obtained from vehicle detectors. However, these studies are limited with respect to RGS in that they are concerned only with one-time-period-ahead 49 prediction. The comparison study of filtering model with neural network model made by Park also supports this assessment. 5.2.3 Simulation Models Simulation models provide predictive capability because they demonstrate how the system is likely to react to varying conditions and control strategies. Given the importance of predictive capabilities in ATMS, it is nature to consider the application of simulation in a real-time environment: " An effective on-line simulation model would enable the ATMS control center to project promptly future traffic patterns considering any previously implemented strategies in a real-time operating environment"(Junchaya, 1992). Unfortunately, at this time, the real-time application of traffic simulation is not feasible because existing mode/algorithm constructs can not support real time application. A need exists for new approaches to the simulation of transportation system. The recent research effort in parallel computing attempted to develop an architecture for a parallel traffic simulation application. However, the effort is still in preliminary stage and the wide-scale deployment of parallel traffic simulation appears to be far from realization. 5.2.4 Neural Network Models Over the past several years, both in research and in practical applications, neural networks have proven to be a very powerful method of mathematical modeling. In particular, neural networks are well suited for pattern recognition, offer efficient execution, and model nonlinear relationships effectively. Clearly, neural networks are well worth exploring as a tool for the short-term prediction of traffic. Neural networks may be defined as "an information processing technology inspired by studies of the brain and nervous system"(Klimasauskas, 1991). This inspiration obviously led to the use of the word neural. However, neural networks in no way attempt to produce biological clones; rather, they are simply models with a rigorous mathematical basis. Although neural networks are typically associated with the field of artificial intelligence, they function as a sophisticated from of regression. The use of neural networks has been proven successful in a number of applications for the following reasons: 50 1. Neural networks can perform highly nonlinear mappings between input and output spaces; 2. The parallel structure of neural networks lends them to implementation on parallel computers, which offers the potential for extremely fast processing; and 3. The neural network approach is nonparametric; therefore, one need not make any assumptions about the functional from of the underlying distribution of the data. These characteristics have attracted the attention of transportation researchers. In the past decade, a large number of research projects have been done with neural network technology in the area of incident detection; incident delay; signal control system; short-term traffic flow prediction and freeway travel time forecasting. The ANN approach proposed by Wei and Schonfeld has been shown fairly economic and accurate for predicting system total travel time of multiple periods. Through serveral designed experiments, it is confirmable that the training time and prediction error are critical factors associated with the ANN approach(Wei, 1996). Lapedes and Farber reported that simple neural networks can outperform conventional methods. Sharda and Patil concluded from their work on 75 different time series that the simple neural network could forecast about as well as the Box-Jenkins forecasting technique. Tang et al. in their comparative study of the performance of ANNs and conventional statistical techniques concluded that for short-term memory series, ANNs appear to be superior to the Box-Jenkins model. Kalaputapu and Demetsky investigated the application of artificial neural network for developing bus schedule behavior models. The results from this case study indicate the suitability of the schedule behavior modeling methodology using ANNs. Ritchie and Ruey investigated the capability of Multilayer, feed-forward neural networks (MLF) to recognize spatial and temporal traffic patterns using data simulated with INTRAS. The author showed that MLF outperformed the California 8, McMaster, and Minnesota algorithms. Using real life data, Dia and Rose applied the MLF to freeway incident detection and showed improvement in performance over the existing ARRB-VicRoads models. Sherif and Haithan 51 applied the Fuzzy ART neural networks to incident detection on freeways. The Fuzzy ART model produced better performance compared to California algorithms 7 and 8. Florio and Mussone applied a neural network model to simultaneously predict three traffic variables: density, flow, and speed on freeways at instant t + d (d=10 minutes), which was referred as one-time-step-ahead prediction by Park and Laurence. Park developed a neural network model for forecasting arterial travel times for one time step ahead (d=3 minutes). The average link travel time forecasting errors from these two neural network applications were found to be 15.0 and 6.4%, respectively. Some studies have applied neural network models for link travel time estimation rather than for link travel time forecasting. Hua and Faghri applied neural network models to estimate that link travel time using the traffic flow of the target link. Nelson and Palacharla employed a counterpropagation neural network model to classify the traffic flow patterns on neighboring links and to estimate the link travel time of the target link. However, they did not provide quantitative results. Both studies were based on traffic-related data using simulation models such as NETSIM and INTRAS. Brain Smith and Demetsky examined a backpropagation neural network for predicting shortterm traffic conditions in real time. The results showed that such neural network prediction models hold considerable potential for use in real time ITS applications. 5.3 Data Source and Preliminary Analysis The proposed neural network models in this study were tested on travel time collected by the TransGuide AVI system in San Antonio. The 53 AVI antenna sites provide coverage of a total of 94 links in San Antonio. In the mean time, travel times for each link are updated five every minutes by a rolling average algorithm to provide the travel time information to travelers. The rolling average algorithm calculates link travel times by matching unique tag reads recorded by the AVI readers at the start and at the end of defined AVI links. The origin AVI data file recorded the site ID, vehicle ID, record time of the day and date (Table 5.1). For each link, the 52 algorithm sums and averages the travel times of the trips completed by AVI-equipped vehicles during five-minute time windows. It then reports the resulting averaged travel times. Trips are filtered so that excessively high travel times are eliminated prior to calculating any link travel time average. This filtering step effectively eliminates vehicles which have exited and re-entered the link, or which have taken an indirect route to proceed between link-bounding readers. Such an instance might arise on AVI-equipped freeways if a vehicle passes an AVI reader, and then proceeds to the nearest freeway exit to purchase gasoline or food, prior to arriving at the next AVI reader site. If the vehicle were to then return to the freeway and traverse the remainder of the AVI link, its time would be significantly higher than vehicles that did not exit the freeway. Such a travel time would inappropriately inflate the rolling average value calculated for the fiveminute window during which that vehicle finished traversing the AVI link. Similar scenarios can be easily visualized on arterials for travelers who are shopping or eating at restaurants located between AVI readers. Site # Tag ID # (encrypted for privacy) Time of Day Date 16 HEa4HwS9NdsqBoK37VstAEq6WYN437.o2 00:01.8 6/17/98 40 q1o8yL1zYZ67JI/Gansl6YznMtIcX06bY 00:06.1 6/17/98 29 9AJBA5t.e4IfchfxE/8VNMq6WYN437.o2 00:18.5 6/17/98 4 HBPOTnSC5wMpBYSxuK4PBMe8.A/UDe2/. 00:26.6 6/17/98 24 8Bv4JnG0VFsd5ixpKGRa4sZnMtIcX06bY 00:31.6 6/17/98 47 HEa4HwS9NdsJSB1t85Dy2wq6WYN437.o2 00:40.8 6/17/98 29 1o9fGHXn/MMVp3DhAlfHbkq6WYN437.o2 01:04.0 6/17/98 52 iKaH0W9PT.o.IrhgDjoM5gZnMtIcX06By 00:48.5 6/17/98 Table 5.1 - AVI Tag Data In the previous study of San Antonio AVI system, John Reily found that the aggregated travel times, which were obtained using a Visual Basic program which processes AVI tag read archives to calculate average link travel time, was closely correlated to test vehicle's freeway and arterial link travel times (GPS data). The following Figure 5.1 and Figure 5.2 illustrate how the test vehicle's travel times compared to aggregate travel time of 2, 5 and 15 minutes for link AVI site 43-44 on I-35 North and 45-44 on I-35 South on June 11, 1998. Figure 5.1 shows a moderate level of congestion during both morning and evening peak hours while Figure 5.2 shows significant AM Peak congestion. 53 Figure 5.1 Individual Test Vehicle's Travel Time vs. 2-, 5-, & 15-min Averages ( AVI Site 43 44 On I-35 North) Figure 5.2 Individual Test Vehicle's Travel Time vs. 2-, 5-, & 15-min Averages (AVI Site 45 44 On I-35 South) 54 The AVI study by John Reily also suggested that 5-min aggregate travel time were perferable to 2-min and 15 min averages in achieving the most accurate link travel time estimation according to Root Mean Square Error (RMSE) method analysis (Figure 5.3) and correlation analysis. Figure 5.3 Percent Root Mean Square Error vs. Level of Aggregation Equation 5.3 describes the correlation coefficient between two random variables X and Y: XY = cov( X ,Y ) E [( X - x )( Y - y )] = (var X )(var Y ) (var X )(var Y ) (5.3) Base on this equation, the freeway GPS/aggregate AVI correlation coefficients was calculated in 4 links (Site 42 43, 43 44, 44 45, 45 44, 44 43, 43 42) and shown by Table 5.2. Correlation Coefficients By Link Link 42 43 43 44 44 45 45 44 44 43 43 42 2-Min AVG vs. GPS 0.8918 0.9770 0.9409 0.9995 0.8962 0.9904 5-Min AVG vs. GPS 0.9917 0.9807 0.9389 0.9992 0.5734 0.9908 15-Min AVG vs. GPS 0.9871 0.9550 0.9254 0.9982 0.8121 0.9921 Table 5.2 Freeway GPS/Aggregate AVI Correlation Coefficients by Link 55 The correlation analysis generally revealed that single-vehicle link travel times show a high correlation to aggregate link travel times of 2-, 5-, 15-min aggregation levels, among which the 5-min aggregation level is the best. These result supports the use of the 5-minute rolling average algorithm currently used by TransGuide system to calculate travel time on AVI links. Hence 5-min aggregate travel time on I-35 south between AVI site 47 and 45; 45 and 44; 44 and 43; 43 and 42 (Figure 5.4) will be used to forecast the freeway link travel time in next time interval as input data. Figure 5.4 The Location of AVI Site 42,43,44 and 45 (Source: http://www.mapquest.com) 5.4 Neural Network Model Design A fully connected multilayer feedforward neural network combined with a backpropagation algorithm was selected for forecasting link travel times in this study. The backpropagation algorithm is an extension of the least mean square (LMS) algorithm and was developed for training multilayer neural networks with the objective of minimizing the errors between the actual and desired output. A detailed discussion was introduced in chapter 2. The backpropagation algorithm neural network was coded in Matlab and run on a 133-Mhz Pentium desktop computer. 5.4.1 Input/output Design AVI site Link 45 to 44 was chosen as a target link because it experiences significant AM Peak congestion. The input variables of a neural network model should be chosen based on a 56 preliminary analysis or by empirically comparing the results from different models having different input variables. Since the impact of the increase in volume and travel time on neighboring links may effect the travel time in study link, this study will also design the models to test it and thus use the neighboring link (link 43-44 and 45-47) travel time as input data. From the point of view of traffic-flow theory, when a forward-moving shock wave exists, a backwardmoving shock wave occurs some time later, and vice versa (May.A.D, 1990). Two neural network models were designed and tested in this study, and the principal differences among them were the type and input variables. Neural network model 1 (NNM1) used the preceding travel time data of link 44-45 as input without considering neighboring links' travel time patterns. Neural network model 2 (NNM2) used the travel time data of study link and two immediate upstream and down stream links as input. Both models forecasted the link travel time 5 steps ahead. Figure 5.5 illustrates the input-output structure of NNM1. From past experiences, NNM1 performed best when travel time data from seven preceding time periods were employed for input. It was also found that NNM2 performed best when travel time data from five preceding time periods were used for input. The designs of data input-output were summarized in Table 5.3. Input Layer K(i-6) K(i-5) K(i-4) K(i-3) K(i-2) K(i-1) K(i) Hidden Layer output Layer K(i+1) K(i+2) K(i+3) K(i+4) K(i+5) Figure 5.5 Input-output Structure of Neural Network Model 1 (NNM1) 57 Model Number NNM1 NNM2 Input Link 4544 4745,4544,4443 Number of Input Data K(i-6), K(i-5),...,k K(i-4), K(i-3),...,k Input Data 7 15 Output K(i+1), ..., K(i+5) of Link 4544 K(i+1), ..., K(i+5) of Link 4544 Table 5.3 Input-output Designs for the Proposed Neural Network Models 5.4.2 Structural Design of Models It is commonly accepted that multilayer feedforward neural networks can be used approximate almost any function if there are enough neurons in the hidden layers. The appropriate number of hidden neurons and layers of neural network depends on the pattern and complexity of the approximated function and the transfer function of the layers. According to previous study in travel flow prediction and preliminary analysis, one hidden layer was proven to perform well and used here. The best number of hidden neurons for NNM1 and NNM2 were found as 4 and 5, respectively. 5.4.3 Neural Network Training The travel time data of link 4544 on whole June, 11,1998, a typical weekday, was used as the data for training and testing the proposed neural networks. The forecasted travel time data K(i+1), K(i+2), K(i+3), K(i+4), K(i+5) was obtained from neural networks as output. The Table 5.4 illustrated that how the training works. I1, I2, I3, I4, I5, I6 and I7 are the input data for each training, while O1, O2, O3, O4 and O5 are the output for each training. X i is the observed travel time recorded by AVI system. Yi is the forecasted travel time. The subscript i means the i-th time intervals (5- min averages). The forecasted travel time in (i+8)-th time interval Yi in the column O1 (shadowed in red) was compared with observed travel time in (i+8)-th time interval X i+8 obtained from AVI system in the column I7 (shadowed in green) to perform the performance analysis. The result will be better if more observed travel time information would be available. For some time intervals, the travel time...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Virginia Tech - ETD - 06282004
Thesis submitted byAnna Maria Barbourto the Faculty of The Virginia Polytechnic Institute and State University in partial fulfillment of the requirements for the degree ofMasters of ArchitectureApprovedPaul F. Emmons, PhDJaan HoltMarco Fr
LSU - TRB - 82
HIGHWAY INTERCHANGES: CONSTRUCTION SCHEDULE AND TRAFFIC PLANNING VISUALIZATIONKatherine A. Liapi, Ph.D. (Assistant Professor, University of Texas at Austin, Austin, Texas, Center for Transportation Research, USA)Nabeel Kwaja, MS, PE. (Center for T
Virginia Tech - ETD - 07012000
References Allen, K., et al. (1988). Conducting a follow-up study of special education programs. (Council of Administrators of Special Education). Washington, DC: Office of Special Education and Rehabilitative Services. Bandy, I. (1985). Ready or not
Virginia Tech - ETD - 11092003
Appendix C Data and Figures from the Mathematical Model289C.1Coefficients from Model 4Ropes Am Blue - Precycled Am Blue - New Am II - Precycled Am II - Newa0 -0.554 -0.889 -0.806 -0.841Coefficients from the Follow-Up Tests a1 a2 a3 a4 0.2
Virginia Tech - ETD - 05012004
CHAPTER THREEMethodology Methodological Approach Chapter Three delineates methodological procedures utilized in this study. It includes a description of the research design, a review of the research questions, target population and participant sele
LSU - ETD - 07022007
RESISTANT STARCH DOES NOT REDUCE BODY FAT IN RATS FED A HIGH FAT DIETA Thesis Submitted to the Graduate Faculty of the Louisiana State University and Agricultural and Mechanical College in partial fulfillment of the requirements for the degree of M
LSU - ETD - 06272007
REDUCING FALSE ALARMS IN SEARCHES FOR GRAVITATIONAL WAVES FROM COALESCING BINARY SYSTEMSA Thesis Submitted to the Graduate Faculty of the Louisiana State University and Agricultural and Mechanical College in partial fulfillment of the requirements
LSU - ETD - 07052007
EVALUATION OF SELECTED IMMUNE RESPONSE TO HAEMONCHUS CONTORTUS IN GULF COAST NATIVE COMPARED TO SUFFOLK LAMBSA DissertationSubmitted to the Graduate Faculty of Louisiana State University and Agriculture and Mechanical College in partial fulfillme
LSU - TRB - 82
TRB 2003 Paper 03-3135Pedestrian Safety through a Raised Median and Redesigned IntersectionsMichael KingMichael R. King, Architect Traffic Calmer 126 Second Street, Brooklyn, NY 11231-4826 718.625.4121 miking@trafficcalmer.comABSTRACT This pap
LSU - ETD - 05302008
THE ROLE OF ATTENTIONAL FOCUS IN EVENT-BASED PROSPECTIVE MEMORYA Dissertation Submitted to the Graduate Faculty of the Louisiana State University and Agricultural and Mechanical College in partial fulfillment of the requirements for the degree of D
LSU - ETD - 01222008
SWAMP ECOLOGY IN A DYNAMIC COASTAL LANDSCAPE: AN INVESTIGATION THROUGH FIELD STUDY AND SIMULATION MODELINGA Dissertation Submitted to the Graduate Faculty of the Louisiana State University and Agricultural and Mechanical College in partial fulfillm
Virginia Tech - ETD - 02262003
CHAPTER 6 FIELD LOAD TESTS AT THE ROUTE 351 BRIDGE 6.1 INTRODUCTION This chapter summarizes the results and findings of field load tests carried out at the Route 351 Bridge project in Hampton, Virginia. The test pile program described herein involved
Virginia Tech - ETD - 051899
MSC/PATRAN Version 6.0 12-Apr-99 13:03:07 FRINGE: Static, Step2,TotalTime=2.: Stress, Components At SECTION_POINT_1 (VON-MISES) -ABAQUS DEFORMATION: Static, Step2,TotalTime=2.: Deformation, Displacements -ABAQUS21.55 20.19 18.84152 151 149 1501
Virginia Tech - ETD - 051899
MSC/PATRAN Version 6.0 12-Apr-99 11:24:20 FRINGE: Static, Step2,TotalTime=2.: Stress, Components At SECTION_POINT_1 (VON-MISES) -ABAQUS DEFORMATION: Static, Step2,TotalTime=2.: Deformation, Displacements -ABAQUS7.757 7.264 6.770149150151152
Virginia Tech - ETD - 051899
MSC/PATRAN Version 6.0 12-Apr-99 12:57:26 FRINGE: Default, Step2,TotalTime=2.: Stress, Components At SECTION_POINT_1 (VON-MISES) -ABAQUS DEFORMATION: Default, Step2,TotalTime=2.: Deformation, Displacements -ABAQUS2.522 2.41414915015115215
Virginia Tech - ETD - 051899
MSC/PATRAN Version 6.0 12-Apr-99 14:04:40 FRINGE: Default, Step2,TotalTime=2.: Stress, Components At SECTION_POINT_1 (VON-MISES) -ABAQUS DEFORMATION: Default, Step2,TotalTime=2.: Deformation, Displacements -ABAQUS10.34 9.669 9.003151 149 150152
Virginia Tech - ETD - 051899
MSC/PATRAN Version 6.0 12-Apr-99 13:00:10 FRINGE: Default, Step2,TotalTime=2.: Stress, Components At SECTION_POINT_1 (VON-MISES) -ABAQUS DEFORMATION: Default, Step2,TotalTime=2.: Deformation, Displacements -ABAQUS19.51 18.28 17.04152 151 149 150
Virginia Tech - ETD - 051899
142143 144 145146147148 149 151 150YZX
Virginia Tech - ETD - 051899
MSC/PATRAN Version 6.0 14-Apr-99 09:56:53 FRINGE: Default, Step2,TotalTime=2.: Stress, Components At SECTION_POINT_1 (VON-MISES) -ABAQUS DEFORMATION: Default, Step2,TotalTime=2.: Deformation, Displacements -ABAQUS.2694 .2575149150151152.2
Virginia Tech - RP - 25
Intern Impressions1What are your overall impressions of your internship experience?I enjoyed the experience a lot. It was great to work at a different institution and learn about it. I also enjoyed meeting other professionals in the field and al
LSU - WUFLAW - 629836
# Date Created: Tue Sep 19 20:51:35 UTC 2006# Creation Script: ./create-OFCL# Usage: ./create-OFCL /home2/as/Season/current/Archive/LDM/ATCF/Subsetted /home2/as/Season/current/Archive/LDM/ATCF/Subsetted/AL/2006/08/OFCL/20060919T1200# PID: 1916920
LSU - WUFLAW - 630804
# Date Created: Fri Sep 22 13:08:35 UTC 2006# Creation Script: ./create-OFCL# Usage: ./create-OFCL /home2/as/Season/current/Archive/LDM/ATCF/Subsetted /home2/as/Season/current/Archive/LDM/ATCF/Subsetted/AL/2006/08/GFDL/20060922T0600# PID: 1640020
LSU - WUFLAW - 629807
# Date Created: Tue Sep 19 19:22:59 UTC 2006# Creation Script: ./create-OFCL# Usage: ./create-OFCL /home2/as/Season/current/Archive/LDM/ATCF/Subsetted /home2/as/Season/current/Archive/LDM/ATCF/Subsetted/AL/2006/08/OFCL/20060919T1200# PID: 3205920
LSU - WUFLAW - 630621
# Date Created: Fri Sep 22 01:07:39 UTC 2006# Creation Script: ./create-OFCL# Usage: ./create-OFCL /home2/as/Season/current/Archive/LDM/ATCF/Subsetted /home2/as/Season/current/Archive/LDM/ATCF/Subsetted/AL/2006/08/GFDL/20060921T1800# PID: 2589520
LSU - WUFLAW - 630896
# Date Created: Fri Sep 22 19:08:39 UTC 2006# Creation Script: ./create-OFCL# Usage: ./create-OFCL /home2/as/Season/current/Archive/LDM/ATCF/Subsetted /home2/as/Season/current/Archive/LDM/ATCF/Subsetted/AL/2006/08/GFDL/20060922T1200# PID: 1350200
LSU - WUFLAW - 3
# Date Created: Thu Sep 28 07:02:04 UTC 2006# Creation Script: ./create-OFCL# Usage: ./create-OFCL /home2/as/Season/current/Archive/LDM/ATCF/Subsetted /home2/as/Season/current/Archive/LDM/ATCF/Subsetted/AL/2006/09/GFDL/20060928T0000# PID: 2473420
LSU - WUFLAW - 632923
# Date Created: Thu Sep 28 07:02:04 UTC 2006# Creation Script: ./create-OFCL# Usage: ./create-OFCL /home2/as/Season/current/Archive/LDM/ATCF/Subsetted /home2/as/Season/current/Archive/LDM/ATCF/Subsetted/AL/2006/09/GFDL/20060928T0000# PID: 2473420
LSU - WUFLAW - 633342
# Date Created: Fri Sep 29 19:17:22 UTC 2006# Creation Script: ./create-OFCL# Usage: ./create-OFCL /home2/as/Season/current/Archive/LDM/ATCF/Subsetted /home2/as/Season/current/Archive/LDM/ATCF/Subsetted/AL/2006/09/GFDL/20060929T1200# PID: 2953120
LSU - WUFLAW - 628128
# Date Created: Sat Sep 16 19:03:14 UTC 2006# Creation Script: ./create-OFCL# Usage: ./create-OFCL /home2/as/Season/current/Archive/LDM/ATCF/Subsetted /home2/as/Season/current/Archive/LDM/ATCF/Subsetted/AL/2006/07/GFDL/20060916T1200# PID: 1406420
LSU - WUFLAW - 6
# Date Created: Fri Jan 12 23:11:28 UTC 2007# Creation Script: ./create-GFDL# Usage: ./create-GFDL /home2/as/Season/current/Archive/LDM/ATCF/Subsetted /home2/as/Season/current/Archive/LDM/ATCF/Subsetted/AL/2006/03/GFDL/20060721T0000# PID: 3118320
LSU - WUFLAW - 638509
# Date Created: Fri Jan 12 23:11:28 UTC 2007# Creation Script: ./create-GFDL# Usage: ./create-GFDL /home2/as/Season/current/Archive/LDM/ATCF/Subsetted /home2/as/Season/current/Archive/LDM/ATCF/Subsetted/AL/2006/03/GFDL/20060721T0000# PID: 3118320