Computer-aided Design Algorithms Research Articles

Системный анализ методов расчета систем электроснабжения карьеров

To optimize decisions on the choice of power supply options and obtain the greatest technical and economic efficiency in computer-aided design, it is necessary to improve the methodological base, develop economic and mathematical models of the most important and labor-intensive problems and algorithms for solving them using modern computer technology. In this work, a block diagram of an algorithm for computeraided design of power supply systems for quarries has been developed. The scheme provides the ability to calculate electrical loads taking into account the features of technology and mechanization of mining operations, select the number and power of transformer substations, calculate quarry distribution systems, compare options for power supply schemes taking into account changes in electrical loads and the dynamics of mining operations.

Learning to self-fold at a bifurcation.

Disordered mechanical systems can deform along a network of pathways that branch and recombine at special configurations called bifurcation points. Multiple pathways are accessible from these bifurcation points; consequently, computer-aided design algorithms have been sought to achieve a specific structure of pathways at bifurcations by rationally designing the geometry and material properties of these systems. Here, we explore an alternative physical training framework in which the topology of folding pathways in a disordered sheet is changed in a desired manner due to changes in crease stiffnesses induced by prior folding. We study the quality and robustness of such training for different "learning rules," that is, different quantitative ways in which local strain changes the local folding stiffness. We experimentally demonstrate these ideas using sheets with epoxy-filled creases whose stiffnesses change due to folding before the epoxy sets. Our work shows how specific forms of plasticity in materials enable them to learn nonlinear behaviors through their prior deformation history in a robust manner.

Retracted: The Computer-Aided Design Algorithm of Dyeing and Weaving Graphics from the Perspective of Public Art.

[This retracts the article DOI: 10.1155/2022/2604302.].

The Computer-Aided Design Algorithm of Dyeing and Weaving Graphics from the Perspective of Public Art.

With the acceleration of economic development, people put forward higher requirements for clothing style. In this context, the application of traditional patterns has good artistic effects, can show a unique style, and can also express the artistic beauty of clothing through deformation, color distribution, and other forms, and occupies a relatively large position in the design process of dyeing and weaving art. Aiming at the problem of inaccurate extraction of image information from known visual scenes in the original art-aided design, resulting in unclear output images, this paper proposes a computer-aided design algorithm for dyeing and weaving graphics in the field of public art by color segmentation of the known visual scene images according to the set threshold, morphological processing of the segmented images, reducing noise and fractures affecting the acquired connected areas, and formulating extraction rules to screen candidate areas. Furthermore, dense sampling form is used to extract more scale invariant feature transform (SIFT) target features in the candidate area, match the feature points, integrate the coordinate system of known image information into a unified coordinate system, output the design image, and complete the auxiliary design of dyeing and weaving graphics. The results of simulation experiments show that the computer-aided design algorithm of dyeing and weaving graphics in the public art field is more accurate than the original method in extracting information from known images, which helps to solve the problem of clear output dyeing and weaving images, and improves the quality of dyeing and weaving images.

Engineering working operations based on parameters of product manufacturability using a computer-aided design algorithm

The study aimed to develop an algorithm for computer-aided design (CAD) of working operations. A processing route for machining components was developed based on the criteria of production manufacturability, industrial data and a digital model of the product. The process of machining a workpiece was analysed using a method of theoretical separation. The machining process of a frame workpiece was used as a model. The identified formal parameters formed a basis for developing a CAD algorithm and a model of manufacturing route associated with the mechanical processing of a work-piece applying a condition-action rule, as well as mathematical logic. The research afforded a scheme for selecting process operations, given the manufacturability parameters of a product design. The concept of CAD algorithm was developed to design a production process of engineering products with given manufacturability parameters, including industrial data. The principle of forming a route and selecting a machining process was proposed. Several criteria of production manufacturability (labour intensity, consumption of materials, production costs) were selected to evaluate mechanical processing. A CAD algorithm for designing technological operations considering the parameters of manufacturability was developed. The algorithm was tested by manufacturing a frame workpiece. The developed algorithm can be used for reducing labour costs and development time, at the same time as improving the quality of production processes. The formalisation of process design is a crucial stage in digitalisation and automation of all production processes.

Elastic Tactile Sensor Skin on Double-Curved Surfaces for Robots and Wearables

Tactile perception is an important modality for dexterous manipulation, but faces unique challenges in that the sensor has to wrap around the system. Biological skin solves these problems extremely well. Not only can it detect contacts, but it also grows on complex three-dimensional shapes, stretches with underlying soft tissue and around joints, and leaves enough space inside for other organs. Previous artificial sensors could only achieve different subsets of these features. We present a novel tactile sensor skin which is completely made from elastic silicone rubber and can stretch to multiple times its original length without damage. It can be produced in three-dimensional double-curved shapes, is thin enough to accommodate other robot components or human body parts, and it can measure forces and locations of multiple simultaneous contacts. We develop production methods and material formulations, algorithms for computer-aided design, compact readout electronics using small, low-power FPGAs, firmware, and software.

VTR 8

Developing Field-programmable Gate Array (FPGA) architectures is challenging due to the competing requirements of various application domains and changing manufacturing process technology. This is compounded by the difficulty of fairly evaluating FPGA architectural choices, which requires sophisticated high-quality Computer Aided Design (CAD) tools to target each potential architecture. This article describes version 8.0 of the open source Verilog to Routing (VTR) project, which provides such a design flow. VTR 8 expands the scope of FPGA architectures that can be modelled, allowing VTR to target and model many details of both commercial and proposed FPGA architectures. The VTR design flow also serves as a baseline for evaluating new CAD algorithms. It is therefore important, for both CAD algorithm comparisons and the validity of architectural conclusions, that VTR produce high-quality circuit implementations. VTR 8 significantly improves optimization quality (reductions of 15% minimum routable channel width, 41% wirelength, and 12% critical path delay), run-time (5.3× faster) and memory footprint (3.3× lower). Finally, we demonstrate VTR is run-time and memory footprint efficient, while producing circuit implementations of reasonable quality compared to highly-tuned architecture-specific industrial tools—showing that architecture generality, good implementation quality, and run-time efficiency are not mutually exclusive goals.

Algorithm for computer-aided design of single-line diagrams of 35-220 kV switchgear with one working busbar system using “ORU CAD”

Designing distribution systems for substations and power plants is a complex process that requires qualification, attention, knowledge of regulatory and technical documentation and takes a lot of time to perform the same type of work. In addition, an integral part of the preparation and delivery of any project is the development of project documentation, including an explanatory note to the project, specifications and, of course, drawings with single-line diagrams, plans, layout schemes, etc. The paper proposes an algorithm for automated design of single-line circuits of open switchgear 35-220 kV with bus bars, implemented in the original software “ORU CAD”. The study was carried out with the financial support of the Russian Foundation for Basic Research in the framework of the research project No. 18-37-00115.

A Novel High Speed Simulated Annealing Algorithm for Non-Slicing VLSI Floorplanning using B*-Tree Representation

Objective: To optimise area, interconnecting wirelength and dead space of very large scale integration non-slicing floorplan with high computation speed using evolutionary algorithm intelligently. Methods/Statistical Analysis: Floorplanning is one of the most important steps in physical design automation in very large scale integration (VLSI) and to solve the problem of VLSI floorplanning is an art. Parameters like chip performance, sizing of modules in a chip, yield and reliability of chip are determined using VLSI floorplanning. The Simulated algorithm and B*-tree structure have been implemented in C++ language and compiled in GCC compiler of Ubuntu14.04. Findings: Parameters like chip performance, sizing of modules in a chip, yield and reliability of chip are determined using VLSI floorplanning. Many computer-aided design algorithms are developed for the NP-hard problems like VLSI floorplanning. A simulated annealing (SA) algorithm for the hard module and non-slicing VLSI floorplanning problem is presented. The SA uses a new acquisitive method to construct an initial B*-tree and a new process to explore the search space. Application/Improvements: The SA has been implemented and experimental result with optimisation of area, dead space, wirelength and best timing constraints have been tested on Microelectronic Center of North Carolina (MCNC) benchmarks.

A Customizable Framework for Application Implementation onto 3-D FPGAs

Integrating more functionality in a smaller form factor with higher performance and lower-power consumption is pushing semiconductor technology scaling to its limits. 3-D chip stacking is touted as the silver bullet technology that can keep Moore’s momentum and fuel the next wave of consumer electronic products. Additionally, the complexity of digital designs imposes that computer-aided design algorithms are getting harder and slower. This paper introduces a framework for application implementation onto 3-D reconfigurable architectures. In contrast to existing approaches, the proposed solution is customizable according to constraints posed by the application and the target 3-D device in order to improve performance metrics. Experimental results highlight the effectiveness of our framework, as we achieve average enhancements in terms of maximum operation frequency and power consumption by 35% and 47%, respectively, as compared to state-of-the-art algorithms.

Основы проектирования реконструкции малоценных насаждений при лесоустройстве

The basic objectives and principles of the design for reconstruction of different categories of subsidiary crops during forest management are considered. An algorithm for computer-aided design based on a systematic approach that allows eliminating subjectivity of engineer-taxator when making design decisions is suggested. This algorithm can reliably establish the area and structure of the fund of subsidiary crops, as well as to forecast changes in the area by categories of forest land, categories of subsidiary crops and forest forming species by years and by the end of the revision period.

Генетический алгоритм проектирования основных переходов в САПР технологических процессов ковки валов

The application of the statements from the theory of developing genetic algorithms to solve the problems of computer-aided design of forging preparatory transitions demonstrates that the suggested approach seems reasonable for solving problems in CAPP of shaft press-forging, which are difficult to formalize. The paper describes developed genetic algorithm for computer-aided design of shaft press-forging main transitions. The standard procedure of the main forging transitions is exemplified by rotor-type shaft forging. The authors discuss the algorithm of forming the geometry of the steps on blanks in each transition; introduce a concept of relatively displaced volume as a value that correlates with the duration of forging. On the basis of this concept, the condition for the forging process termination in each transition is formalized. The genetic algorithm for computer-aided design of main transitions of shaft press-forging is developed on the principles of the theory of probability and mathematical statistics. The algorithm has the properties of self-improvement and auto-adjustment to manufacturing conditions. Thus, it simplifyes CAPP system user work and creates preconditions for a successful replication of the shaft press-forging system at various enterprises.

COMPUTER STRUCTURAL-PARAMETRIC GEOMETRIC MODELS AS A TOOL FOR DESIGN-TECHNOLOGIC OPTIMIZATION OF AIRPLANE

The current stage of technical progress is characterized by the extensive use of computer information technology in the creation of various industrial products. Therefore, the development and introduction of new effective methods, techniques and algorithms for computer-aided design are relevant today.It is known that the system consisting of the optimal elements itself is not necessarily the same. Therefore, complex optimization is very important for the designed technical objects.Geometric models have a special place in integrating for computational models of technical objects because significant number of output characteristics substantially depend on geometrical parameters.The applications of structural-parametric geometric modeling methodology for design-technologic optimization of technical products are analyzed in this article. Variant engineering design was shown on the example of spar of airplane wing. Basic techniques of proposed method were presented. The emphasis was placed on their universal and invariant character for different objects and processes.Prospects for further development of this scientific field studies on the spread of its practical application to optimal designing of different industrial products were considered.The main advantages of the analyzed computer-integrated engineering and process design of industrial products based on the use of structural-parametric geometric models is the universality and invariance of the proposed techniques for different objects and processes.Featured approach provides a flexible and productive implementation of complex optimization of industrial products. This direction of creation of technical products requires further intensive research for its successful practical realization.

Refactoring of Timing Graphs and Its Use in Capturing Topological Correlation in SSTA

Reconvergent paths in circuits have been a nuisance in various computer-aided design (CAD) algorithms, but no elegant solution to deal with them has been found yet. In statistical static timing analysis (SSTA), they cause difficulty in capturing topological correlation. This paper presents a technique that in arbitrary block-based SSTA reduces the error caused by ignoring topological correlation. We interpret a timing graph as an algebraic expression made up of addition and maximum operators. We define the division operation on the expression and propose algorithms that modify factors in the expression without expansion. As a result, the algorithms produce an expression to derive the latest arrival time with better accuracy in SSTA. Existing techniques handling reconvergent fanouts usually use dependency lists, requiring quadratic space complexity. Instead, the proposed technique has linear space complexity by using a new directed acyclic graph search algorithm. Our results show that it outperforms an existing technique in speed and memory usage with comparable accuracy. More important, the proposed technique is not limited to SSTA and is potentially applicable to various issues due to reconvergent paths in timing-related CAD algorithms.

Industry-wide energy saving by complex separation networks

Different column configurations in a distillation network can achieve the same ultimate products, with different amounts of energy to do so. Only recently, methods have been discovered for the systematic generation and evaluation of all possible complex column configurations for the separation of multi-component mixtures. However, there is a lack of robust methods for the globally optimal design of complex column sequences. This presentation reviews recent advances to tackle the challenges of synthesizing complex column networks with computer-aided design algorithms. An automatic procedure to generate optimal column sequences based on a thermodynamic problem transformation called temperature collocation is discussed and its current capabilities and limitations illustrations with the help of two realistic case studies.

An Automated Meta-Level Control Framework for Optimizing the Quality–Time Tradeoff of VLSI Algorithms

We address the problem of optimizing the quality-time tradeoff of very large scale integration (VLSI) computer-aided design (CAD) algorithms working under various constrained environments. We present a unified meta-reasoning framework to automatically control the progress of iteratively improving CAD algorithms. The control framework uses profile knowledge about the quality-time relation of the algorithms used and generates a combined strategy for time allocation and parameter control that optimizes the expected tradeoff. We present specific formulations for handling single and multiple problems (both dependent and independent) under various constraints. We use the proposed strategies for adjusting the control parameters of standard simulated annealing and genetic algorithm based techniques used in VLSI optimization along with an appropriate time allocation suited for different constraint specifications. Application on several classical problems in the VLSI domain shows that significant improvement in quality-time tradeoff can be achieved.

A novel expression for effective radius in calculating the resonant frequency of circular microstrip patch antennas

AbstractThis letter presents a novel effective radius expression for determining the resonant frequency of circular microstrip patch antennas. The effective patch radius expression is constructed by using differential evolution algorithm and is valid for both electrically thin and thick circular microstrip antennas (MSAs). It is well suited to be used in the development of fast computer aided design algorithms. Numerical results obtained for the resonant frequencies of circular MSAs are in good agreement with the experimental results reported by several scientists. © 2007 Wiley Periodicals, Inc. Microwave Opt Technol Lett 49: 2395–2398, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.22767

Power-Efficient RAM Mapping Algorithms for FPGA Embedded Memory Blocks

Contemporary field-programmable gate array (FPGA) design requires a spectrum of available physical resources. As FPGA logic capacity has grown, locally accessed FPGA embedded memory blocks have increased in importance. When targeting FPGAs, application designers often specify high-level memory functions, which exhibit a range of sizes and control structures. These logical memories must be mapped to FPGA embedded memory resources such that physical design objectives are met. In this paper, a set of power-efficient logical-to-physical RAM mapping algorithms is described, which converts user-defined memory specifications to on-chip FPGA memory block resources. These algorithms minimize RAM dynamic power by evaluating a range of possible embedded memory block mappings and selecting the most power-efficient choice. Our automated approach has been validated with both simulation of power dissipation and measurements of power dissipation on FPGA hardware. A comparison of measured power reductions to values determined via simulation confirms the accuracy of our simulation approach. Our power-aware RAM mapping algorithms have been integrated into a commercial FPGA compiler and tested with 34 large FPGA benchmarks. Through experimentation, we show that, on average, embedded memory dynamic power can be reduced by 26% and overall core dynamic power can be reduced by 6% with a minimal loss (1%) in design performance. In addition, it is shown that the availability of multiple embedded memory block sizes in an FPGA reduces embedded memory dynamic power by an additional 9.6% by giving more choices to the computer-aided design algorithms

CAD of Left-handed Transmission Line Bandpass Filters

Owing to the negative and nonlinear nature of phase constant (fl) versus frequency, left-handed transmission lines (LH-TLs) can present higher values of fl as compared to right- handed ones. As such, left-handed (LH) structures are promising in terms of size minimization of microwave circuits. In this paper, a simulation study leading to computer aided design (CAD) of LH-TL bandpass fllters is presented. Motivated by a recent work, in which, a bandpass fllter is realized by coupling several LH units, we propose a new structure consisting of a single unit with composite right/left-handed (CRLH) characteristics. The structure ofiers several advantages over traditional fllters, e.g., compact dimensions and low loss. A new CAD algorithm for automated fllter design, which can be valuable to designers, is demonstrated through an example.

On the interaction between power-aware computer-aided design algorithms for field-programmable gate arrays

On the interaction between power-aware computer-aided design algorithms for field-programmable gate arrays