bluuebunny/crossref_metadata_2025_split huggingface dataset:
Configuration Tree Solver: A Technology for Automated Design and Configuration
Authors: Kott Alexander , Agin Gerald , Fawcett Dave 
Published: April 2021

Abstract
Configuration is a process of generating a definitive description of a product or an order that satisfies a set of specified requirements and known constraints. Knowledge-based technology is an enabling factor in automation of configuration tasks found in the business operation. In this paper, we describe a configuration technique that is well suited for configuring “decomposable” artifacts with reasonably well defined structure and constraints. This technique may be classified as a member of a general class of decompositional approaches to configuration. The domain knowledge is structured as a general model of the artifact, an and-or hierarchy of the artifact’s elements, features, and characteristics. The model includes constraints and local specialists which are attached to the elements of the and-or-tree. Given the specific configuration requirements, the problem solving engine searches for a solution, a subtree, that satisfies the requirements and the applicable constraints. We describe an application of this approach that performs configuration and design of an automotive component.
QUINT: A Problem-Solving Strategy for Mechanical System Conceptual Design: Part II — Analysis, Evaluation, and Example
Authors: Qun Wang , Haibin Yang , Ji Zhou , Jun Yu 
Published: April 2021

Abstract
In part I, the characteristics of mechanical system conceptual design, the main idea of of QUINT and how to realize the first-stage, second-stage and third-stage reasoning were discussed. The part II will continue to study the last two stages of QUINT strategy, and give an example.
A Sequential Linearization Approach for Solving Mixed-Discrete Nonlinear Design Optimization Problems
Authors: Loh Han Tong , Papalambros Panos Y. 
Published: April 2021

Abstract
Design optimization models often contain variables that must take only discrete values, such as standard sizes. Nonlinear optimization problems with a mixture of discrete and continuous variables are very difficult, and existing algorithms are either computationally intensive or applicable to models with special structure. A new approach for solving nonlinear mixed-discrete problems with no particular structure is presented here, motivated by its efficiency for models with extensive monotonicities of the problem’s objective and constraint functions with respect to the design variables. It involves solving a sequence of mixed-discrete linear approximations of the original nonlinear model. In this article, a review of previous approaches is followed by description of the resulting algorithm, its convergence properties and limitations. Several illustrative examples are given. A sequel article presents a detailed algorithmic implementation and extensive computational results.
A Parallel Dual Projection Algorithm for Solving Positive Definite Quadratic Programming Problems
Authors: Wang Yugang , Sandgren Eric 
Published: April 2021

Abstract
Two parallel algorithms, a dual projection algorithm and a hybrid dual projection algorithm, are proposed for solving positive definite quadratic programming problems. In each iteration of the algorithms, the search point is always a local optimum point on the current active constraint basis for both adding and dropping constraint operations. The advantage of this strategy is that the computation is stable and all operations maintain parallel properties. Only a pseudo-inverse matrix must be updated instead of two matrices in Goldfarb’s dual algorithm in a basis change. Both computational and space complexities are reduced by about half. When the search point reaches a vertex in the dual space, a pivot operation is employed to update the basis in the hybrid dual projection algorithm in place of the addition and deletion operations in the dual projection algorithm. This reduces the computational complexity by half in future iterations. Some suggestions are presented to further enhance the computational speed of the algorithm. Numerical results are presented based on randomly generated test problems. Comparison with other methods demonstrates that the new algorithm is efficient and stable and points to the possibility of implementation on a parallel computer.
Constrained Variable Metric Method With Feasible Directions
Authors: Jianhua Wang , Ji Zhou , Jun Yu 
Published: April 2021

Abstract
This paper proposes a new feasible direction algorithm based on the constrained variable metric method of Powell in order to handle the design optimization problmes which demand that all iterative points are feasible. The algorithm retains many advantages of the constrained variable metric method, makes use of the properties of the solutions of quadratic programming problems and information of iterative points to define feasible directions, and uses the monotonicity analysis to establish the linesearch strategy which is especially suitable for feasible direction algorithms and a simple and efficient method for finding feasible initial points. The numerical results presented in the paper demonstrate that its rate of convergence is faster than those of Powell’s method and another feasible direction algorithm of Herskovits and its iterative procedure avoids Maratos effect.
Cluster Analysis for the Cognitive Selection of Nonlinear Programming Algorithms
Authors: Ma Jin-xian , Xie Shi-huai , Chen Yong 
Published: April 2021

Abstract
In recent years, cluster analysis has played an increasingly important role in statistical pattern recognition. Hoeltzel and Chieng have shown an example on cognitive selection of nonlinear programming algorithms in a mechanical design expert system. In this paper, an improved dynamic clustering of 3000 samples came from a comparative performance evaluation of six typical nonlinear programming softwares with randomly generated test problems has been made. Explanations resulting from the cluster analysis have been used to build rules to form the knowledge base of an optimization expert system.
A New Conjugate Direction Algorithm for Unconstrained Function Minimization
Authors: Li Bailin , Chen Yong 
Published: April 2021

Abstract
Based on the properties of conjugate vectors, a new algorithm for unconstrained function minimization is developed. The algorithm belongs to the direct search method and is a conjugate direction-type method with the property of quadratic termination. Comparing with some convensional direct search methods including the modified Powell method, the number of one dimensional search is greatly reduced. In addition, the algorithm presented in this paper is simple in calculating and easy in coding, and it has the capability of accelerating along the ridges.
The method presented is compared with two direct search methods including the modified Powell method on many test problems. Numerical results show the robustness and efficiency of the new algorithm.
Monotonicity Analysis of Taguchi’s Robust Circuit Design Problem
Authors: Wilde Douglass J. 
Published: April 2021

Abstract
A recent article showed how to formulate Taguchi’s robust circuit design problem rigorously as an optimization problem. A necessary condition for optimality was found to be that the control range be centered about the target value. This generates a constraint on the two design variables which cannot be solved for either variable. The present article shows that by approximating this unsolvable constraint with a simpler constraint that is solvable, one variable can be eliminated and the problem reduced to an unconstrained one in a single variable. Since this reduced objective turns out to be monotonic in the remaining design variable, its optimum value must be at the limit of its range. The corresponding optimum value of the other variable is then determined exactly from the true, not approximate, constraint. Since no model construction, experimentation, statistical analysis or numerical iteration is needed, this procedure is recommended whenever the input-output relation is known to be a monotonic algebraic function.
Flexible-Body Dynamics Modelling With a Reduced-Order Model
Authors: Yae K. Harold , Inman Daniel J. 
Published: April 2021

Abstract
In the dynamics modeling of a flexible body, finite element analysis employs Guyan’s reduction that removes some of the “insignificant” physical coordinates, thus producing a dynamic model that has smaller mass and stiffness matrices. Despite such reduction, the resultant model is still too large for flexible-body dynamic analysis. That warrants further reduction as is frequently used in control design by approximating a large dynamical system with a fewer number of state variables. When the reduced model is being assembled with other bodies in a multi-body mechanism, a problem, however, arises because a model usually undergoes, before being reduced, some form of coordinate transformations that do not preserve the physical meanings of the states. To correct such a problem, we developed a method that expresses a reduced model in terms of a subset of the original states.
The proposed method starts with a dynamic model that is originated and reduced in finite element analysis. Then the model is converted to the state space form, and reduced again by the internal balancing method. At this stage, being in the balanced coordinate system, the states in the reduced model have no apparent resemblance to those of the original model. Through another coordinate transformation that is developed in this paper, however, this reduced model is expressed by a subset of the original states. Then finally the model can be represented by the states assigned to the degrees of freedom of the selected nodal points.
Nonholonomic Constrain Models for Recursive Dynamic Analysis
Authors: Wang J. Y. , Wu J. K. 
Published: April 2021

Abstract
This paper presents mathematic formulations of nonholonomic constrain models, such as differential kinematic constraints, that can be used in dynamic analysis based on recursive formulations. Rolling and rotating between a pair of bodies are considered in the formulation. These mathematic models include state vector notations, cut differential kinematic constraints, and the right-hand side of constraint acceleration equations using joint coordinates. In addition, the paper describes the factors that need to be considered in selecting cut-joints in spanning tree analysis, that is needed for the recursive formulation. The weighting factors of certain nonholonomic constraints are suggested. In addition to current dynamic formulations, this study provides a systematic method to formulate the dynamic analysis for the mechanical systems with nonholonomic constraints. The results of applying this new formulation to several well-known examples are presented.
Optimal Blank Nesting Using Simulated Annealing
Authors: Jain P. , Fenyes P. , Richter R. 
Published: April 2021

Abstract
Since the cost of high volume stamped parts is largely dependent on material usage, scrap minimization is a primary goal of the design process. Although many factors influence the scrap rate for a given stamping, one of the most critical is the actual nesting, or positioning, of the part blanks onto the metal strip or sheet stock. Blank nesting is often done by hand, resulting in inefficient nestings with high scrap rates. Greater material efficiency can be achieved by automating this process. We have developed an automated system based on mathematical programming techniques which optimizes blank nestings for continuous strip stamping processes. We formulate the problem by first describing the geometry of the part or parts to be nested for stamping and specifying an initial layout. We use a novel integer grid technique to efficiently and accurately compute the overlap between parts and then apply simulated annealing, a probabilistic global optimization technique, to determine a new part layout with zero overlap and minimal scrap. Using representative part configurations, we present several examples illustrating the efficient nestings produced using this method.
Development of a User Interface for a Design Sensitivity Analysis and Optimization Workstation
Authors: Godse Mohan , Koch Peter , Santos Jose L. T. 
Published: April 2021

Abstract
An object-oriented user interface for a Structural Design Sensitivity Analysis and Optimization Workstation (SDSOW) is presented. The menu-driven interactive system features an object-oriented engineering spreadsheet as a mechanism to visualize, manipulate, modify, and search for the data generated during the interactive design process. A UNIX based windowing system and object-oriented programming techniques have been used to implement the user interface. Specialized engineering spreadsheets have been derived from a general spreadsheet to support specific design activities. The system can be easily extended to include new design activities by specializing the general spreadsheet to the new design tasks. Since the user interface runs under X-window system, it can be ported to several hardware platforms with minimum efforts.
Design Optimization of Machine Structures Based on Multiphase Structural Modeling of Ideal, Intermediate, and Detailed Models
Authors: Yoshimura Masataka 
Published: April 2021

Abstract
This paper proposes a design optimization method consisting of the multiphase structural modeling of ideal, intermediate, and detailed models for machine structures. In this method, the ideal characteristics are first obtained for a specific ideal model. Then, the detailed designs are determined so that the characteristics in the detailed model are as close to the ideal characteristics as possible. For easily and surely obtaining the final detailed designs, an intermediate model is introduced between the ideal model and the detailed model. This method not only effectively generates optimum detailed designs of machine structures but also brings about an easy realization of the optimum characteristics in practical manufactured machine products. The proposed method is applied to a machine-tool structural model for demonstrating the effectiveness of the method.
A Hamiltonian Equation of Motion for Realtime Vehicle Simulation
Authors: Bae D. S. , Won Y. S. 
Published: April 2021

Abstract
A relative coordinate formulation of the Hamiltonian equation of motion is derived for realtime vehicle simulation. The Baumgarte stabilization method [1] is adopted to solve the Differential-Algebraic Equations (DAE) of motion. The stability theory of multi-step integration methods is used to determine the stabilization constant. The equations of motion are first derived in Cartesian space and are reduced to relative coordinate space using the velocity transformation method [2]. Partial derivative of the kinetic energy with respect to the relative coordinate is obtained from equivalence of the Lagrangian and the Newton-Euler formulations. Parallel processing of the formulation is also discussed. Realtime simulation of a passenger vehicle is carried out to demonstrate the efficiency of the new formulation.
Real-Time Dynamic Simulation of a Robot With Rotor Dynamics
Authors: Chuang Li-Ping , Kim Sung-Soo 
Published: April 2021

Abstract
Rotor dynamics are important for robots that are driven by motors and high gear ratio transmission systems. New generic recursive dynamic formulations of robotic systems with motor rotor effects are presented, where motors can be mounted on inboard or outboard bodies of the actuated joints. An organized form of the system dynamics equations is obtained through adoption of a state vector representation in equation derivation. The influence of rotors on the overall system dynamics are identified. Parallelism of the derived dynamics formulations is then exploited and a real-time parallel computational algorithm is proposed. A seven degree-of-freedom telerobot is used to illustrate rotor dynamics effects in the computational model. A computational speed that is faster than real-time simulation is demonstrated.
Dynamic Analysis of Mechanical Systems With Time-Varying Topologies: Part 1 — Dynamic Model and Stability Analysis
Authors: Wang Yu 
Published: April 2021

Abstract
A model is developed for analyzing mechanical systems with a pair of bodies with topological changes in their kinematic constraints. It is built upon the concept of Poincaré map rather than following the traditional methods of differential equations. The model provides a set of well-defined and naturally-discrete equations of motion and is capable of giving physical insights of dynamic characteristics of deadbeat convergence of multiple collisions and periodic or chaotic responses. The development of dynamic model and a local stability analysis are presented in Part 1, and the global analysis and numerical simulation are discussed in Part 2.
Design Sensitivity Analysis and Optimization of Nonlinear Structural Systems With Critical Loads
Authors: Park Jong Sang , Choi Kyung K. 
Published: April 2021

Abstract
A continuum formulation for design sensitivity analysis of critical loads is developed for nonlinear structural systems that are subjected to conservative loading. Both geometric and material nonlinear effects are considered. Sizing design variables such as cross-sectional areas of beam or truss design components and thicknesses of plate or membrane design components, together with their shape design variables, are treated. A continuum approach is used to obtain design sensitivity expressions in integral form. For shape design sensitivity analysis, the material derivative concept and domain method are used to find variations of the critical load due to variations in shape of the physical domain. The total Lagrangian formulation for incremental equilibrium equation and one-point linearized eigenvalue problems are utilized. A numerical method is presented to evaluate continuum design sensitivity expressions using analysis results of established finite element codes. It is found that no adjoint system is necessary for design sensitivity analysis of the critical load. Numerical results show the proposed method for design sensitivity of critical loads is accurate for both sizing and shape design variables. A numerical procedure for optimal design of nonlinear structural systems is presented, using the proposed continuum design sensitivity analysis method. An optimal design problem with a stability constraint is solved.
Two-Level Structural Optimization Method for Multi-Processor Environment
Authors: Hsiung Ching-Kuo , El-Sayed Mohamed E. M. 
Published: April 2021

Abstract
In this paper a two-level structural optimization approach is presented. At the first level, the objective of the optimization problem is to minimize the total weight of the whole structure subject to the global constraints. At the second level, the optimization problem is divided into several subproblems, each subproblem represents a substructure. The objective of each subproblem is to minimize the weight of the assigned substructure subject to its local constraints. To assure that the final solution will not violate the global constraints, the optimum values of the design variables from the first level are used to update the lower bounds on these variables at the second level. Two numerical examples are included to demonstrate the approach and its application in a multi-processor environment.
Differentiation of Mass and Stiffness Matrices for High Order Sensitivity Calculations in Finite Element-Based Equilibrium Problems
Authors: Bernard J. E. , Kwon S. K. , Wilson J. A. 
Published: April 2021

Abstract
Extension of sensitivity methods to include higher order terms depends on the ability to compute higher order derivatives of the mass and stiffness matrices. This paper presents a method based on the use of cubic polynomials to fit mass and stiffness matrices across a range of interest of the design variable.
The method is illustrated through an example which uses Padé approximants to expand the solution to a statics problem. The design variable is the thickness of one part of a plate with fixed boundaries. The solution gives a very good approximation over five fold change in the value of the design variable.
A New Method for 3-D Contact Problems of Four-Row Tapered Roller Bearing Using Finite Element Analysis
Authors: Zhang Qigui , Yu Jun , Li Yuanke , Zhao Caiyan 
Published: April 2021

Abstract
The most glaring problems in reality in the field of finite element analysis of tapered roller bearings are long calculation time and great error due to neglect of axial force. The static condensation method and solving technique are introduced in this paper to reduce the calculation time and raise the calculation precision. Due to the effects of axial force, the contact boundary becomes more complicated. Up to now, the paper dealing with axial force is rarely seen. This paper mainly studies four-row tapered steel mill bearing under reality loaded condition with finite element analysis and computation method. The contact load-distribution given by finite element calculation is in agreement with photo-elastic experiment. This paper also supplies a fast and effective numerical method for finite element analysis of many other types of bearings.
Eigenvalues for Moderately Damped Linear Systems Determined by Eigensensitivity Analysis
Authors: Reiss Robert , Qian Bo , Aung Win 
Published: April 2021

Abstract
A new method is presented to determine approximate closed-form solutions for the complex-valued frequencies of moderately damped linearly elastic structures. The approach is equally applicable to finite degree of freedom systems and distributed parameter systems. The damping operator is split into two components, the first of which uncouples the quadratic eigenvalue equation, and the eigenvalues are expressed as a power series in the second component of the damping operator. Specific numerical examples include both finite degree of freedom and distributed parameter systems. It is shown that for moderate damping, that is, when the second component of the damping operator is small, but not negligible, the series solution truncated after quadratic terms provides an excellent approximation to the true eigenvalues.
Design Sensitivity Analysis and Optimization of Vibrating Beams With Variable Support Locations
Authors: Hou J. W. , Chuang C. H. 
Published: April 2021

Abstract
The method of material derivatives is employed in this paper to derive analytical equations to calculate eigenvalue sensitivity coefficients of a continuous beam with respect to support variables. A finite element scheme is then implemented to numerically validate these sensitivity equations. Finally, design optimization of a vibrating beam subjected to frequency constraints is investigated. Results suggest that a small amount of adjustment in support locations and stiffnesses can greatly improve the quality of the design.
Minimum Sensitivity Design of Planar Kinematic Systems
Authors: Patil Umesh R. , Krishnaswami Prakash 
Published: April 2021

Abstract
In designing a kinematic system, it is desirable to ensure that the performance of the system is relatively insensitive to small changes in the nominal design, since this will result in a more robust system that can be manufactured economically with looser tolerances. A general method for minimizing the sensitivity of such systems is developed in this paper. The approach is based on the idea of converting the minimum sensitivity design problem into a nonlinear programming problem which is then solved using an exterior penalty function method. The constrained multi-element formulation is used for kinematic analysis and sensitivity analysis is performed using a direct differentation technique. The resulting algorithm is general enough to handle any planar kinematic system. The proposed method has been implemented in a computer program which has been tested on some sample problems. The results provide convincing proof of the power and feasibility of this method.