Efficient aerodynamic shape optimization of transonic wings using a parallel infilling strategy and surrogate models

Surrogate models are used to dramatically improve the design efficiency of numerical aerodynamic shape optimization, where high-fidelity, expensive computational fluid dynamics (CFD) is often employed. Traditionally, in adaptation, only one single sample point is chosen to update the surrogate model during each updating cycle, after the initial surrogate model is built. To enable the selection of multiple new samples at each updating cycle, a few parallel infilling strategies have been developed in recent years, in order to reduce the optimization wall clock time. In this article, an alternative parallel infilling strategy for surrogate-based constrained optimization is presented and demonstrated by the aerodynamic shape optimization of transonic wings. Different from existing methods in which multiple sample points are chosen by a single infill criterion, this article uses a combination of multiple infill criteria, with each criterion choosing a different sample point. Constrained drag minimizations of the ONERA-M6 and DLR-F4 wings are exercised to demonstrate the proposed method, including low-dimensional (6 design variables) and higher-dimensional problems (up to 48 design variables). The results show that, for surrogate-based optimization of transonic wings, the proposed method is more effective than the existing parallel infilling strategies, when the number of initial sample points are in the range from N _v to 8N _v (N _v here denotes the number of design variables). Each case is repeated 50 times to eliminate the effect of randomness in our results.     

Prediction of rank deficiency in partition of unity-based methods with plane triangular or quadrilateral meshes

In the partition of unity (PU)-based methods, the global approximation is built by multiplying a partition of unity by local approximations. Within this framework, high-order approximations are achieved by directly adopting high-order polynomials as local approximations, and therefore nodes along sides or inside elements, which are usually adopted in the conventional finite element methods, are no more required. However, the PU-based approximation constructed in this way may suffer from rank deficiency due to the linear dependence of the global degrees of freedom. In this paper, the origin of the rank deficiency in the PU-based approximation space is first dissected at an element level, and then an approach to predict the rank deficiency for a mesh is proposed together with the principle of the increase of rank deficiency. Finally, examples are investigated to validate the present approach. The current work indicates such a fact that the rank deficiency is an unrelated issue to the nullity of the global matrix. It can be resolved in its own manner.     

Sensitivity analysis and optimization of vehicle–bridge systems based on combined PEM–PIM strategy

This paper presents a new optimization method for coupled vehicle–bridge systems subjected to uneven road surface excitation. The vehicle system is simplified as a multiple rigid-body model and the single-span bridge is modeled as a simply supported Bernoulli–Euler beam. The pseudo-excitation method transforms the random surface roughness into the superposition of a series of deterministic pseudo-harmonic excitations, which enables convenient and accurate computation of first and second order sensitivity information. The precise integration method is used to compute the vertical random vibrations for both the vehicle and the bridge. The sensitivities are used to find the optimal solution, with vehicle ride comfort taken as the objective function. Optimization efficiency and computational accuracy are demonstrated numerically.     

A Faà di Bruno Hopf algebra for a group of Fliess operators with applications to feedback

A Faà di Bruno type Hopf algebra is developed for a group of integral operators known as Fliess operators, where operator composition is the group product. Such operators are normally written in terms of generating series over a noncommutative alphabet. Using a general series expansion for the antipode, an explicit formula for the generating series of the compositional inverse operator is derived. The result is applied to analytic nonlinear feedback systems to produce an explicit formula for the feedback product, that is, the generating series for the Fliess operator representation of the closed-loop system written in terms of the generating series of the Fliess operator component systems. This formula is employed to provide a proof that local convergence is preserved under feedback.     

Evaluation of the effect of a paver’s trolley on productivity, task demands, workload and local discomfort

The objective of this study was to determine the differences in the number of paving stones laid (productivity), task demands, energetic workload, body region discomfort and preference when laying paving stones with or without use of a paver’s trolley (n = 8) in a within-subject controlled study of pavers. The number of paving stones laid and the task demands were measured by means of systematic observations at the workplace. The energetic workload was determined using the percentage of heart rate reserve (%HRR). Body region discomfort was measured using visual analog scales, and the workers’ preference was ascertained via interview. The use of a paver’s trolley had no effect on productivity, %HRR or body region discomfort compared to working without a paver’s trolley. The duration of knee-straining activities did not differ between working with (141 min) and without (146 min) the paver’s trolley. However, six of the eight pavers indicated that, given suitable circumstances, they wanted to use the paver’s trolley.

Relevance to industry

To reduce the chance of work-related low back and knee complaints among pavers, the duration, frequency and intensity of lower back and knee-straining activities should be limited by means of technical measures such as mechanical paving. The paver’s trolley does not appear to reduce knee-straining activities and therefore does not appear useful in reducing the risk of knee complaints and disorders.     

The evitability of software patents

Responding to Kenneth Nichols' article in Computer (“The Age of Software Patents”, April 1999, pp. 25-31), the author disputes the two claims: “software patents are neither inherently good nor bad” and “software patents are here to stay.” The author thinks software patents are not impersonal technology, but rather a part of an intellectual patent system that is a social artifact. Because all social artifacts are fair game for judgments, software patents fall into that category. Not only does the author think it reasonable that an interested party examine the ethics and morality of any branch of the legal system (of which software patents and copyrights are a part), but he feels professionals in relevant areas have a social duty to do so. After exploring several arguments for software patents and copyrights, the author settles on the evitability of software patents, though he points out this does not ensure they will be avoided. However, he thinks there are good arguments for avoiding software patents for other more practical and just forms of monopoly for software     

An Internet-based negotiation server for e-commerce

This paper describes the design and implementation of a replicable, Internet-based negotiation server for conducting bargaining-type negotiations between enterprises involved in e-commerce and e-business. Enterprises can be buyers and sellers of products/services or participants of a complex supply chain engaged in purchasing, planning, and scheduling. Multiple copies of our server can be installed to complement the services of Web servers. Each enterprise can install or select a trusted negotiation server to represent his/her interests. Web-based GUI tools are used during the build-time registration process to specify the requirements, constraints, and rules that represent negotiation policies and strategies, preference scoring of different data conditions, and aggregation methods for deriving a global cost-benefit score for the item(s) under negotiation. The registration information is used by the negotiation servers to automatically conduct bargaining type negotiations on behalf of their clients. In this paper, we present the architecture of our implementation as well as a framework for automated negotiations, and describe a number of communication primitives which are used in the underlying negotiation protocol. A constraint satisfaction processor (CSP) is used to evaluate a negotiation proposal or counterproposal against the registered requirements and constraints of a client company. In case of a constraint violation, an event is posted to trigger the execution of negotiation strategic rules, which either automatically relax the violated constraint, ask for human intervention, invoke an application, or perform other remedial operations. An Event-Trigger-Rule (ETR) server is used to manage events, triggers, and rules. Negotiation strategic rules can be added or modified at run-time. A cost-benefit analysis component is used to perform quantitative analysis of alternatives. The use of negotiation servers to conduct automated negotiation has been demonstrated in the context of an integrated supply chain scenario. Received: 30 October 2000 / Accepted: 12 January 2001 Published online: 2 August 2001     

Evolutionary pattern search algorithms for unconstrained andlinearly constrained optimization

We describe a convergence theory for evolutionary pattern search algorithms (EPSA) on a broad class of unconstrained and linearly constrained problems. EPSA adaptively modify the step size of the mutation operator in response to the success of previous optimization steps. The design of EPSA is inspired by recent analyzes of pattern search methods. Our analysis significantly extends the previous convergence theory for EPSA. Our analysis applies to a broader class of EPSA and it applies to problems that are nonsmooth, have unbounded objective functions, and are linearly constrained. Further, we describe a modest change to the algorithmic framework of EPSA for which a nonprobabilistic convergence theory applies. These analyses are also noteworthy because they are considerably simpler than previous analyses of EPSA