When a system design approach is applied to wind turbine blades, manufacturing and structural requirements are included along with aerodynamic considerations in the design optimization. The resulting system-driven design includes several innovative structural features such as flat-back airfoils, a constant thickness carbon spar-cap, and a thin, large diameter root. Subscale blades were manufactured to evaluate the as-built integrated performance. The design resulted in a 22% reduction in mass, but withstood over 300% of its design load during testing. Compressive strains of nearly 0.9% were measured in the carbon spar-cap. The test results from this and an earlier design are compared, as are finite element models of each design. Included in the analysis is a review of the acoustic emission events that were detected through the use of surface mounted microphones.
When measuring the structural dynamic response of test objects, the desired data is sometimes combined with some type of undesired periodic data. This can occur due to N-per-revolution excitation in systems with rotating components or when dither excitation is used. The response due to these (typically unmeasured) periodic excitations causes spikes in system frequency response functions (FRFs) and poor coherence. This paper describes a technique to remove these periodic components from the measured data. The data must be measured as a continuous time history which is initially processed as a single, long record. Given an initial guess for the periodic signal's fundamental frequency, an automated search will identify the actual fundamental frequency to very high accuracy. Then the fundamental and a user-specified number of harmonics are removed from the acquired data to create new time histories. These resulting time histories can then be processed using standard signal processing techniques. An example of this technique will be presented from a test where a vehicle is dithered with a fixed-frequency, sinusoidal force to linearize the behavior of the shock absorbers, while measuring the acceleration responses due to a random force applied elsewhere on the vehicle.
Partitioned global address space (PGAS) programming models have been identified as one of the few viable approaches for dealing with emerging many-core systems. These models tend to generate many small messages, which requires specific support from the network interface hardware to enable efficient execution. In the past, Cray included E-registers on the Cray T3E to support the SHMEM API; however, with the advent of multi-core processors, the balance of computation to communication capabilities has shifted toward computation. This paper explores the message rates that are achievable with multi-core processors and simplified PGAS support on a more conventional network interface. For message rate tests, we find that simple network interface hardware is more than sufficient. We also find that even typical data distributions, such as cyclic or block-cyclic, do not need specialized hardware support. Finally, we assess the impact of such support on the well known RandomAccess benchmark. (c) 2007 ACM.
In this paper, we present an optimal method for calculating turning maneuvers for an unmanned aerial vehicle (UAV) developed for ecological research. The algorithm calculates several possible solutions using vectors represented in complex notation, and selects the shortest turning path given constraints determined by the aircraft. This algorithm considers the UAV's turning capabilities, generating a two-dimensional path that is feasible for the UAV to fly. We generate a test flight path and show that the UAV is capable of following the turn maneuvers.
Parallel adaptive mesh refinement methods potentially lead to realistic modeling of complex three-dimensional physical phenomena. However, they also present significant challenges in data partitioning and load balancing. As the mesh adapts to the solution, the partitioning requirements change. By explicitly considering these dynamic conditions, the scalability for large, realistic simulations could possibly be significantly improved. Our hypothesis is that adaptive partitioning, meaning dynamic and automatic switching of partitioning techniques, based on the current run-time state, can be beneficial for these simulations. However, switching partitioners can be expensive due to differences in the algorithms' native mapping of data onto processors. We suggest forcing a uniform starting point for all included partitioners. We present a penalty-based method for determining whether switching is beneficial. We study the effects on data migration, as well as on overall cost, of using the uniform starting point and the switching-penalties to select the best partitioning algorithm, among a set of graph-based and geometric partitioning algorithms, for each adaptive time-step for four different adaptive scientific applications. The results show that data migration can be significantly reduced and that adaptive partitioning indeed can be effective for unstructured adaptive applications.
17th Annual International Symposium of the International Council on Systems Engineering, INCOSE 2007 - Systems Engineering: Key to Intelligent Enterprises
In this paper, we introduce EXACT, the EXperimental Algorithmics Computational Toolkit. EXACT is a software framework for describing, controlling, and analyzing computer experiments. It provides the experimentalist with convenient software tools to ease and organize the entire experimental process, including the description of factors and levels, the design of experiments, the control of experimental runs, the archiving of results, and analysis of results. As a case study for EXACT, we describe its interaction with FAST, the Sandia Framework for Agile Software Testing. EXACT and FAST now manage the nightly testing of several large software projects at Sandia. We also discuss EXACT's advanced features, which include a driver module that controls complex experiments such as comparisons of parallel algorithms. Copyright 2007 ACM.