Computational design in architecture:Defining parametric,generative,and algorithmic design

Computation-based approaches in design have emerged in the last decades and rapidly became popular among architects and other designers.Design professionals and researchers adopted different terminologies to address these approaches.However,some terms are used ambiguously and inconsistently,and different terms are commonly used to express the same concept.This paper discusses computational design(CD)and proposes an improved and sound taxonomy for a set of key CD terms,namely,parametric,generative,and algorithmic design,based on an extensive literature review from which different definitions by various authors were collected,analyzed,and compared.

Parametrising historical Chinese courtyard-dwellings:An algorithmic design framework for the digital representation of Siheyuan iterations based on traditional design principles

Many Beijing Siheyuan,a type of Chinese vernacular housing with significant cultural value,have been lost in recent years.Preserving the few remaining has become a necessity,but many contemporary architects lack an understanding of their design principles.Based on a historical analysis deriving from Fengshui theory,the Gongchens Zuofa Zeli ancient construction manual,and craftsmen's experience,this paper describes a parametric algorithm capable of producing Siheyuan variants within a 4D CAD environment which by transforming the original design principles into an algorithm contributes to an understanding of Siheyuan typology and their preservation.This algorithm was implemented in a virtual scripting environment to generate accurate virtual counterparts of historical orextant Siheyuan houses revealing the tacit computational rules underlying traditional Chinese architecture.

Digital representation methods:The case of algorithmic design

Architectural representation encompasses the means used to describe architectural entities.This discipline has long been under constant change due to architects’everpresent desire for innovation.Algorithmic design(AD)is currently making its way into the plethora of representation methods that integrate the architect’s day-to-day work tools.However,it provides its fair share of controversy and hardship as it goes.This paper assesses whether AD is suitable as a representation method for architectural design by making a systematic analysis of this medium as a contemporary representation method.Specifically,we investigate(1)its birth and evolution as a means of representation,(2)the characteristics that make it simultaneously appealing and off-putting to the architectural community,(3)the influence of technological evolution and education on its proliferation,and(4)its capacity to represent design problems in comparison to the currently predominant means of digital architectural representation,that is,computer-aided drafting and building information modeling.

Design Considerations for an Underactuated Robotic Finger Mechanism

A design approach is presented in this paper for underactuation in robotic finger mechanisms. The characters of underactuated finger mechanisms are introduced as based on linkage and spring systems. The feature of self-adaptive enveloping grasp by underactuated finger mechanisms is discussed with feasible in grasping unknown objects. The design problem of robotic fingers is analyzed by looking at many aspects for an optimal functionality. Design problems and requirements for underactuated mechanisms are formulated as related to human-like robotic fingers. In particular, characteristics of finger mechanisms are analyzed and optimality criteria are summarized with the aim to formulate a general design algorithm. A general multi-objective optimization design approach is applied as based on a suitable optimization problem by using suitable expressions of optimality criteria. An example is illustrated as an improvement of finger mechanism in Laboratory of Robotics and Mechatronics （LARM） Hand. Results of design outputs and grasp simulations are reported with the aim to show the practical feasibility of the proposed concepts and computations.

Real-time Design Constraints in Implementing Active Vibration Control Algorithms

Although computer architectures incorporate fast processing hardware resources, high performance real-time implementation of a complex control algorithm requires an efficient design and software coding of the algorithm so as to exploit special features of the hardware and avoid associated architecture shortcomings. This paper presents an investigation into the analysis and design mechanisms that will lead to reduction in the execution time in implementing real-time control algorithms. The proposed mechanisms are exemplified by means of one algorithm, which demonstrates their applicability to real-time applications. An active vibration control （AVC） algorithm for a flexible beam system simulated using the finite difference （FD） method is considered to demonstrate the effectiveness of the proposed methods. A comparative performance evaluation of the proposed design mechanisms is presented and discussed through a set of experiments.

MODELING, VALIDATION AND OPTIMAL DESIGN OF THE CLAMPING FORCE CONTROL VALVE USED IN CONTINUOUSLY VARIABLE TRANSMISSION

Associated dynamic performance of the clamping force control valve used in continuously variable transmission （CVT） is optimized. Firstly, the structure and working principle of the valve are analyzed, and then a dynamic model is set up by means of mechanism analysis. For the purpose of checking the validity of the modeling method, a prototype workpiece of the valve is manufactured for comparison test, and its simulation result follows the experimental result quite well. An associated performance index is founded considering the response time, overshoot and saving energy, and five structural parameters are selected to adjust for deriving the optimal associated performance index. The optimization problem is solved by the genetic algorithm （GA） with necessary constraints. Finally, the properties of the optimized valve are compared with those of the prototype workpiece, and the results prove that the dynamic performance indexes of the optimized valve are much better than those of the prototype workpiece.

Optimized Design for the Plow of a Submarine Plowing Trencher

The plow of the submarine plowing trencher is one of the main functional mechanisms, and its optimization is very important. The design parameters play a very significant role in determining the requirements of the towing force of a vessel. A multi-objective genetic algorithm based on analytical models of the plow surface has been examined and applied in efforts to obtain optimal design of the plow. For a specific soil condition, the draft force and moldboard surface area which are the key parameters in the working process of the plow are optimized by finding the corresponding optimal values of the plow blade penetration angle and two surface angles of the main cutting blade of the plow. Parameters such as the moldboard side angle of deviation, moldboard lift angle, angular variation of the tangent line, and the spanning length are also analyzed with respect to the force of the moldboard surface along soil flow direction. Results show that the optimized plow has an improved plow performance. The draft forces of the main cutting blade and the moldboard are 10.6% and 7%, respectively, less than the original design. The standard deviation of Gaussian curvature of moldboard is lowered by 64.5%, which implies that the smoothness of the optimized moldboard surface is much greater than the original.

Analysis method and algorithm design of biological sequence problem based on generalized k-mer vector

K-mer can be used for the description of biological sequences and k-mer distribution is a tool for solving sequences analysis problems in bioinformatics.We can use k-mer vector as a representation method of the k-mer distribution of the biological sequence.Problems,such as similarity calculations or sequence assembly,can be described in the k-mer vector space.It helps us to identify new features of an old sequence-based problem in bioinformatics and develop new algorithms using the concepts and methods from linear space theory.In this study,we defined the k-mer vector space for the generalized biological sequences.The meaning of corresponding vector operations is explained in the biological context.We presented the vector/matrix form of several widely seen sequence-based problems,including read quantification,sequence assembly,and pattern detection problem.Its advantages and disadvantages are discussed.Also,we implement a tool for the sequence assembly problem based on the concepts of k-mer vector methods.It shows the practicability and convenience of this algorithm design strategy.

Selection diagram of design algorithms for neutron-focusing supermirrors

The neutron supermirror is an important neutron optical device that can significantly improve the efficiency of neutron transport in neutron guides and has been widely used in research neutron sources.Three types of algorithms,including approximately ten algorithms,have been developed for designing high-efficiency supermirror structures.In addition to its applications in neutron guides,in recent years,the use of neutron supermirrors in neutronfocusing mirrors has been proposed to advance the development of neutron scattering and neutron imaging instruments,especially those at compact neutron sources.In this new application scenario,the performance of supermirrors strongly affects the instrument performance;therefore,a careful evaluation of the design algorithms is needed.In this study,we examine two issues:the effect of nonuniform film thickness distribution on a curved substrate and the effect of the specific neutron intensity distribution on the performance of neutron supermirrors designed using existing algorithms.The effect of film thickness nonuniformity is found to be relatively insignificant,whereas the effect of the neutron intensity distribution over Q(where Q is the magnitude of the scattering vector of incident neutrons)is considerable.Selection diagrams that show the best design algorithm under different conditions are obtained from these results.When the intensity distribution is not considered,empirical algorithms can obtain the highest average reflectivity,whereas discrete algorithms perform best when the intensity distribution is taken into account.The reasons for the differences in performance between algorithms are also discussed.These findings provide a reference for selecting design algorithms for supermirrors for use in neutron optical devices with unique geometries and can be very helpful for improving the performance of focusing supermirror-based instruments.

COMPUTER-AIDED DESIGN OF ADAPTIVE PULSED ARC WELDING OF ROOT WELDS BY MELTING ELECTRODE

The purpose of computer-aided design of new adaptive pulsed arc technologies of welding is: to de- sign optimum algorithms of pulsed control over main energy parameters of welding.It permits:to in- crease welding productivity, to stabilize the welding regime, to control weld formation,taking into ac- count its spatial position, to proveal specie strength of the welded and coatings. Computer- aided design reduces the time of development of new pulsed arc technology:provides the optimization of technological referes according to the operating conditions of welded joints,the prediction of the ser- vice life of the welds.The developed methodology of computer-aided design of advanced technologies, models, original software, adaptive algorithms of pulsed control, and spend equipment permits to regulate penetration,the weld shape, the sizes of heat - affected zone; to predict sired properties and quality of welded joints.

Genetic Algorithm for Injection Mould Design and Moulding

Obtaining the optimal values of the parameters for th e design of a required mould and the operation of the moulding process are diffi cult, this is due to the complexity of product geometry and the variation of pla stic material properties. The typical parameters for the mould design and mouldi ng process are melt flow length, injection pressure, holding pressure, back pres sure, injection speed, melt temperature, mould temperature, clamping force, inje ction time, holding time and cooling time. This paper discusses the difficulties of using the current computer aided optimization methods to acquire the values of the parameters. A method that is based on the concept of genetic algorithm is proposed to overcome the difficulties. The proposed method describes in details on how to attain the optimal values of the parameters form a given product geom etry.

Design optimization of transonic compressor stage using CFD and response surface model

In order to shorten the design period, the paper describes a new optimization strategy for computationally expensive design optimization of turbomachinery, combined with design of experiment (DOE), response surface models (RSM), genetic algorithm (GA) and a 3-D Navier-Stokes solver(Numeca Fine). Data points for response evaluations were selected by improved distributed hypercube sampling (IHS) and the 3-D Navier-Stokes analysis was carried out at these sample points. The quadratic response surface model was used to approximate the relationships between the design variables and flow parameters. To maximize the adiabatic efficiency, the genetic algorithm was applied to the response surface model to perform global optimization to achieve the optimum design of NASA Stage 35. An optimum leading edge line was found, which produced a new 3-D rotor blade combined with sweep and lean, and a new stator one with skew. It is concluded that the proposed strategy can provide a reliable method for design optimization of turbomachinery blades at reasonable computing cost.

Design of Process Centrifugal Compressor： an Adapted Algorithm

Considering the essential and influential role of centrifugal compressors in a wide range of industries makes most of engineers research and study on design and optimization of centrifugal compressors. Centrifugal compressors are the key to part ofoil, gas and petrochemical industries as well as gas pipeline transports. Since complete 3D design of the compressor consumes a considerable amount of time, most of active companies in the field, are profoundly interested in obtaining a design outline before taking any further steps in designing the entire machine. In this paper, a numerical algorithm, named ACDA （adapted compressor design algorithm） for fast and accurate preliminary design of centrifugal compressor is presented. The design procedure is obtained under real gas behavior, using an appropriate equation of state. Starting from impeller inlet, the procedure is continued on by resulting in numerical calculation for other sections including impeller exit, volute and exit diffuser. Clearly, in any step suitable correction factors are employed in order to conclude in precise numerical results. Finally, the achieved design result is compared with available reference data.

Satellite constellation design with genetic algorithms based on system performance

Satellite constellation design for space optical systems is essentially a multiple-objective optimization problem. In this work, to tackle this challenge, we first categorize the performance metrics of the space optical system by taking into account the system tasks（i.e., target detection and tracking）. We then propose a new non-dominated sorting genetic algorithm（NSGA） to maximize the system surveillance performance. Pareto optimal sets are employed to deal with the conflicts due to the presence of multiple cost functions. Simulation results verify the validity and the improved performance of the proposed technique over benchmark methods.

Fast and scalable routing protocols for data center networks

Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.

Algorithms for automatic measurement of SIS-type hysteretic underdamped Josephson junction’s parameters by current-voltage characteristics

Some electrical parameters of the SIS-type hysteretic underdamped Josephson junction(JJ)can be measured by its current-voltage characteristics(IVCs).Currents and voltages at JJ are commensurate with the intrinsic noise level of measuring instruments.This leads to the need for multiple measurements with subsequent statistical processing.In this paper,the digital algorithms are proposed for the automatic measurement of the JJ parameters by IVC.These algorithms make it possible to implement multiple measurements and check these JJ parameters in an automatic mode with the required accuracy.The complete sufficient statistics are used to minimize the root-mean-square error of parameter measurement.A sequence of current pulses with slow rising and falling edges is used to drive JJ,and synchronous current and voltage readings at JJ are used to realize measurement algorithms.The algorithm performance is estimated through computer simulations.The significant advantage of the proposed algorithms is the independence from current source noise and intrinsic noise of current and voltage meters,as well as the simple implementation in automatic digital measuring systems.The proposed algorithms can be used to control JJ parameters during mass production of superconducting integrated circuits,which will improve the production efficiency and product quality.

Revealing connectivity in residential Architecture: An algorithmic approach to extracting adjacency matrices from floor plans

In today's world, various approaches and parameters exist for designing a plan and determining its spatial, placement. Hence, various modes for identifying crucial locations can be explored when an architectural plan is designed in different dimensions. While designing all these modes takes considerable time, there are numerous potential applications for artificial intelligence (AI) in this domain. This study aims to compute and use an adjacency matrix to generate architectural residential plans. Additionally, it develops a plan generation algorithm in Rhinoceros software, utilizing the Grasshopper plugin to create a dataset of architectural plans. In the following step, the data was entered into a neural network to identify the architectural plan's type, furniture, icons, and use of spaces, which was achieved using YOLOv4, EfficientDet, YOLOv5, DetectoRS, and RetinaNet. The algorithm's execution, testing, and training were conducted using Darknet and PyTorch. The research dataset comprises 12,000 plans, with 70% employed in the training phase and 30% in the testing phase. The network was appropriately trained practically and precisely in relation to an average precision (AP) resulting of 91.50%. After detecting the types of space use, the main research algorithm has been designed and coded, which includes determining the adjacency matrix of architectural plan spaces in seven stages. All research processes were conducted in Python, including dataset preparation, network object detection, and adjacency matrix algorithm design. Finally, the adjacency matrix is given to the input of the proposed plan generator network, which consequently, based on the resulting adjacency, obtains different placement modes for spaces and furniture.

Multi-swingby optimization of mission to Saturn using global optimization algorithms

Based on the trajectory design of a mission to Saturn, this paper discusses four different trajectories in various swingby cases. We assume a single impulse to be applied in each case when the spacecraft approaches a celestial body. Some optimal trajectories ofEJS, EMS, EVEJS and EVVEJS flying sequences are obtained using five global optimization algorithms： DE, PSO, DP, the hybrid algorithm PSODE and another hybrid algorithm, DPDE. DE is proved to be supe- rior to other non-hybrid algorithms in the trajectory optimi- zation problem. The hybrid algorithm of PSO and DE can improve the optimization performance of DE, which is vali- dated by the mission to Saturn with given swingby sequences. Finally, the optimization results of four different swingby sequences are compared with those of the ACT of ESA.

MODIFIED GENETIC ALGORITHM APPLIED TO SOLVE PRODUCT FAMILY OPTIMIZATION PROBLEM

The product family design problem solved by evolutionary algorithms is discussed. A successful product family design method should achieve an optimal tradeoff among a set of competing objectives, which involves maximizing commonality across the family of products and optimizing the performances of each product in the family. A 2-level chromosome structured genetic algorithm （2LCGA） is proposed to solve this class of problems and its performance is analyzed in comparing its results with those obtained with other methods. By interpreting the chromosome as a 2-level linear structure, the variable commonality genetic algorithm （GA） is constructed to vary the amount of platform commonality and automatically searches across varying levels of commonality for the platform while trying to resolve the tradeoff between commonality and individual product performance within the product family during optimization process. By incorporating a commonality assessing index to the problem formulation, the 2LCGA optimize the product platform and its corresponding family of products in a single stage, which can yield improvements in the overall performance of the product family compared with two-stage approaches （the first stage involves determining the best settings for the platform variables and values of unique variables are found for each product in the second stage）. The scope of the algorithm is also expanded by introducing a classification mechanism to allow mul- tiple platforms to be considered during product family optimization, offering opportunities for superior overall design by more efficacious tradeoffs between commonality and performance. The effectiveness of 2LCGA is demonstrated through the design of a family of universal electric motors and comparison against previous results.

Study on Health Monitoring Systems Based on Correction Mode

Current health monitoring systems often do not concern about the needs of the elderly,leading to inaccurate health status monitoring and delayed treatment for emergency health conditions.Similarly,they do not consider the variable factors affecting each patient,resulting in discrepancies between the measured values and real health status.To solve the problems,we propose a new health monitoring system with physiological parameter measurement,correction,and feedback.The study collects clinical samples of the elderly to formulate regression equations and statistical models for analyzing the relationship between gender,age,measurement time,and physical signs.After multiple adjustments to measurements of physical signs,the correction algorithm compares the data with a standard value.The process significantly reduces the risk of misjudgment while matching users’health status more accurately.The application case of this paper proves the validity of the method for measuring and correcting heart rate results in the elderly and presents a specific correction procedure.Additionally,the correction algorithm provides a scientific basis for eliminating or modifying other influencing factors in future health monitoring studies.