2,993 results on '"Minimum weight"'
Search Results
2. Substructuring-based dimension-reduction approach for efficient design optimization of high-rise buildings.
- Author
-
Rafiee, Amin
- Subjects
- *
SKYSCRAPERS , *TALL buildings , *STRUCTURAL design , *PROBLEM solving , *STEEL framing - Abstract
Economic and safe structural design of high-rise buildings is a high-dimensional optimization problem. Finding the globally optimal solution is challenging, and analysis, design and optimization are very time consuming. This article proposes a new approach, where the search space dimension is reduced through substructuring. The high-dimensional high-rise building optimization problem is converted to a set of low-rise building optimization subproblems of lower dimensions. The subproblems are iteratively solved instead of the original problem. The substructures are analysed and optimally designed, one after another, until convergence, taking into account the effects of other parts of the building to maintain the building's integrity. Thus, the analysis of a high-rise building is accomplished by analysing a set of low-rise building substructures. Concurrently, the high-dimensional optimization problem is solved through some low-dimensional subproblems. Therefore, building analysis, design and optimization are conducted simultaneously. To demonstrate the efficiency and robustness of the approach, examples from the literature aresolved. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
3. On the minimum weights of quaternary Hermitian LCD codes
- Author
-
Araya, Makoto and Harada, Masaaki
- Published
- 2024
- Full Text
- View/download PDF
4. Design Optimization of Braces for Three-Legged Minimum Jacket Offshore Structure
- Author
-
Dhaneswara, I. Putu Dipa, Prastianto, Rudi Walujo, Rosyid, Daniel Muhammad, Cavas-Martínez, Francisco, Series Editor, Chaari, Fakher, Series Editor, di Mare, Francesca, Series Editor, Gherardini, Francesco, Series Editor, Haddar, Mohamed, Series Editor, Ivanov, Vitalii, Series Editor, Kwon, Young W., Series Editor, Trojanowska, Justyna, Series Editor, Tolj, Ivan, editor, Reddy, M. V., editor, and Syaifudin, Achmad, editor
- Published
- 2023
- Full Text
- View/download PDF
5. Application of Self-Adaptive Population Rao Algorithms to Optimization of Steel Grillage Structures.
- Author
-
GRZYWIŃSKI, Maksym, DEDE, Tayfun, and ATMACA, Barbaros
- Subjects
STEEL analysis ,COMPUTER programming ,FINITE element method ,INDUSTRIAL efficiency - Abstract
The self-adaptive population Rao algorithms (SAP-Rao) are employed in this study to produce the optimal designs for steel grillage structures. The size variables in the optimization problem consist of the cross-sectional area of the discrete W-shapes of these beams. The LRFD-AISC design code was used to optimize the constrained size of this kind of structure. The solved problem's primary goal is to determine the grillage structure's minimum weight. As constraints, it is decided to use the maximum stress ratio and the maximum displacement at the inner point of the steel grillage structure. The finite element method (FEM) was employed to compute the moment and shear force of each member, as well as the joint displacement. A computer program for the study and design of grillage structures, as well as the optimization technique for SAP-Rao, was created in MATLAB. The outcomes of this study are compared to earlier efforts on grillage structures. The findings demonstrate that the optimal design of grillage structures can be successfully accomplished using the SAP-Rao method described in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
6. A NOTE ON SMALL WEIGHT CODEWORDS OF PROJECTIVE GEOMETRIC CODES AND ON THE SMALLEST SETS OF EVEN TYPE.
- Author
-
ADRIAENSEN, SAM
- Subjects
- *
K-spaces , *PROJECTIVE geometry , *CODING theory , *LINEAR codes - Abstract
In this paper, we study the codes Ck(n, q) arising from the incidence of points and k-spaces in PG(n, q) over the field Fp, with q = ph, p prime. We classify all codewords of minimum weight of the dual code Ck(n, q)⊥ in case q ∊ {4,8}. This is equivalent to classifying the smallest sets of even type in PG(n, q) for q ∊{4,8}. We also provide shorter proofs for some already known results, namely, of the best known lower bound on the minimum weight of Ck(n, q)\bot for general values of q, and of the classification of all codewords of Cn-1(n, q) of weight up to 2qn-1. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
7. Predictive value of characteristics of resected parathyroid glands for persistent secondary hyperparathyroidism during parathyroidectomy
- Author
-
Yaoyu Huang, Jing Wang, Ming Zeng, Huiting Wan, Ningning Wang, and Guang Yang
- Subjects
Secondary hyperparathyroidism ,Parathyroidectomy ,Minimum weight ,Persistent secondary hyperparathyroidism ,Surgery ,RD1-811 - Abstract
Abstract Background Parathyroidectomy (PTX), an effective treatment for refractory secondary hyperparathyroidism (SHPT) in chronic kidney disease (CKD) patients, still has a high persistent rate. This study aimed to analyze the predictive value of characteristics of resected parathyroid glands for postoperative persistent SHPT. Methods The clinical data of patients with persistent SHPT and successful PTX controls who had or underwent total parathyroidectomy with forearm autotransplantation (TPTX + AT) was retrospectively collected. The characteristics including the number, minimum weight, maximum weight and total weight of resected parathyroid glands from each patient were recorded. Characteristics and cutoff value of resected parathyroid glands for the prediction of persistent SHPT were analyzed. Results A total of 227 patients (62 persistent SHPT patients and 165 successful PTX controls) were enrolled in the study. Forty-one (66%) persistent SHPT cases related to supernumerary parathyroid and the remaining 21 (34%) cases related to residual undetected parathyroid. In addition, ectopic parathyroid was found in 8 patients (13%) before PTX. The average number of resected glands in the persistent SHPT group and successful PTX group was 3.53 ± 0.72 and 3.93 ± 0.25 respectively (p
- Published
- 2023
- Full Text
- View/download PDF
8. Embedded antipodal planes and the minimum weight of the dual code of points and lines in projective planes of order p2.
- Author
-
De Boeck, Maarten and Van de Voorde, Geertrui
- Subjects
PROJECTIVE planes ,ARGUMENT - Abstract
The minimum weight of the code generated by the incidence matrix of points versus lines in a projective plane has been known for over 50 years. Surprisingly, finding the minimum weight of the dual code of projective planes of non-prime order is still an open problem, even in the Desarguesian case. In this paper, we focus on the case of projective planes of order p 2 , where p is prime, and we link the existence of small weight code words in the dual code to the existence of embedded subplanes and antipodal planes. In the Desarguesian case, we can exclude such code words by showing a more general result that no antipodal plane of order at least 3 can be embedded in a Desarguesian projective plane. Furthermore, we use combinatorial arguments to rule out the existence of code words in the dual code of points and lines of an arbitrary projective plane of order p 2 , p prime, of weight at most 2 p 2 - 2 p + 4 using more than two symbols. In particular, this leads to the result that the dual code of the Desarguesian projective plane PG (2 , p 2) , p ≥ 5 , has minimum weight at least 2 p 2 - 2 p + 5 . [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
9. Predictive value of characteristics of resected parathyroid glands for persistent secondary hyperparathyroidism during parathyroidectomy.
- Author
-
Huang, Yaoyu, Wang, Jing, Zeng, Ming, Wan, Huiting, Wang, Ningning, and Yang, Guang
- Subjects
PARATHYROID glands ,PARATHYROIDECTOMY ,HYPERPARATHYROIDISM ,CHRONIC kidney failure ,REFERENCE values - Abstract
Background: Parathyroidectomy (PTX), an effective treatment for refractory secondary hyperparathyroidism (SHPT) in chronic kidney disease (CKD) patients, still has a high persistent rate. This study aimed to analyze the predictive value of characteristics of resected parathyroid glands for postoperative persistent SHPT. Methods: The clinical data of patients with persistent SHPT and successful PTX controls who had or underwent total parathyroidectomy with forearm autotransplantation (TPTX + AT) was retrospectively collected. The characteristics including the number, minimum weight, maximum weight and total weight of resected parathyroid glands from each patient were recorded. Characteristics and cutoff value of resected parathyroid glands for the prediction of persistent SHPT were analyzed. Results: A total of 227 patients (62 persistent SHPT patients and 165 successful PTX controls) were enrolled in the study. Forty-one (66%) persistent SHPT cases related to supernumerary parathyroid and the remaining 21 (34%) cases related to residual undetected parathyroid. In addition, ectopic parathyroid was found in 8 patients (13%) before PTX. The average number of resected glands in the persistent SHPT group and successful PTX group was 3.53 ± 0.72 and 3.93 ± 0.25 respectively (p < 0.001). There was significance in the number of patients with different resected parathyroid glands between two groups (p < 0.001). When the resected gland number was 4, minimum weight of the parathyroid was noted to be heavier in the persistent SHPT group than that in the successful PTX group (0.52 ± 0.31 g vs. 0.38 ± 0.19 g, p < 0.001). For persistent SHPT prediction, cutoff value of minimum weight was 0.535 g, with sensitivity of 46% and specificity of 82% (AUC = 0.611; p = 0.029). Conclusions: Major reason for the persistent SHPT is the existence of supernumerary parathyroid glands or resection of less than 4 glands. When 4 glands were resected, a minimum total parathyroid gland weight heavier than 0.535 g implied the potential presence of a missed supernumerary parathyroid gland, which also contributed to the persistent SHPT. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
10. Optimal Design of Composite Shelled Sandwich Structures with a Honeycomb Filler
- Author
-
Kondratiev, Andrii, Potapov, Olexander, Tsaritsynskyi, Anton, Nabokina, Tetyana, Cavas-Martínez, Francisco, Series Editor, Chaari, Fakher, Series Editor, Gherardini, Francesco, Series Editor, Haddar, Mohamed, Series Editor, Ivanov, Vitalii, Series Editor, Kwon, Young W., Series Editor, Trojanowska, Justyna, Series Editor, di Mare, Francesca, Series Editor, Pavlenko, Ivan, editor, Zajac, Jozef, editor, and Peraković, Dragan, editor
- Published
- 2021
- Full Text
- View/download PDF
11. Modified Convolutional Interleavers for Parallel Concatenated Block Codes.
- Abstract
The letter presents a modification on the block-wise operation of convolutional interleavers for the Parallel Concatenated Block (PCB) codes. Interleaving is conducted so that every block of the interleaved data includes one bit of a message block. This leads to determining the minimum weight of PCB codes from messages with weight 1. Due to the insertion of some stuff bits in the permutation process, multiplicities of the minimum weight of the PCB’s constituent code is less than that obtained from the previously proposed interleavers. This improves the performance of code in its error floor region. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
12. The Covering Radius of the Reed–Muller Code RM (m – 4, m) in RM (m – 3, m).
- Author
-
Dougherty, Randall, Mauldin, R. Daniel, and Tiefenbruck, Mark
- Subjects
- *
REED-Muller codes , *POLYNOMIALS - Abstract
We present methods for computing the distance from a Boolean polynomial on $m$ variables of degree $m-3$ (i.e., a member of the Reed–Muller code $RM(m-3, m)$) to the space of lower-degree polynomials ($RM(m-4, m)$). The methods give verifiable certificates for both the lower and upper bounds on this distance. By applying these methods to representative lists of polynomials, we show that the covering radius of $RM(4,8)$ in $RM(5,8)$ is 26 and the covering radius of $RM(5,9)$ in $RM(6,9)$ is between 28 and 32 inclusive, and we get improved lower bounds for higher $m$. We also apply our methods to various polynomials in the literature, thereby improving the known bounds on the distance from 2-resilient polynomials to $RM(m-4, m)$. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
13. Designer Systems of Systems: A Rational Integrated Approach of System Engineering to Tailored Aerodynamics, Aeroelasticity, Aero-viscoelasticity, Stability, Control, Geometry, Materials, Structures, Propulsion, Performance, Sizing, Weight, Cost
- Author
-
Hilton, Harry H., D’Urso, Steven J., Wiener, Noe, Kahlen, Franz-Josef, editor, Flumerfelt, Shannon, editor, and Alves, Anabela, editor
- Published
- 2017
- Full Text
- View/download PDF
14. Theoretical and Numerical Analysis of an Aluminum Foam Sandwich Structure.
- Author
-
Al-Fatlawi, Alaa, Jármai, Károly, and Kovács, György
- Subjects
ALUMINUM foam ,ALUMINUM analysis ,NUMERICAL analysis ,FIBROUS composites ,FINITE element method ,COMPOSITE structures ,LAMINATED glass ,STIFFNESS (Engineering) - Abstract
The aim of the research was to develop a new lightweight sandwich structure, which can be used for elements of air containers. The structure consists of aluminum foam core with fiber reinforced composite face-sheets. Nine different laminated glass or/and carbon fiber reinforced plastic face-sheet combinations were investigated. Finite element analysis of the sandwich structures was introduced. Single-objective optimization of the new sandwich structure was achieved for minimal weight. Five design constraints were considered: stiffness of the structure, face-sheet failure, core shear, face-sheet wrinkling, size constraints for design variables. The elaborated composite structure results significant weight savings due to low density. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
15. Design optimization and sensitivity analysis of simply supported prestressed concrete girders: A two dimensional non-linear paradigm
- Author
-
A.H. Irhouma, M.J. Allan, A.I. Mousa, N.A. Dahman, and W.K. Saadideen
- Subjects
Environmental Engineering ,Linear programming ,020209 energy ,General Chemical Engineering ,0211 other engineering and technologies ,Minimum weight ,02 engineering and technology ,Catalysis ,Nonlinear programming ,law.invention ,Prestressed concrete ,law ,Girder ,021105 building & construction ,0202 electrical engineering, electronic engineering, information engineering ,Sensitivity (control systems) ,Electrical and Electronic Engineering ,Civil and Structural Engineering ,Mathematics ,business.industry ,Mechanical Engineering ,Linear elasticity ,General Engineering ,Structural engineering ,Nonlinear system ,business - Abstract
This paper presents a practical optimum design solution of prismatic simply supported prestressed concrete girders that are subjected to uniformly distributed static loads. While assuming linear elastic behaviour and employing working stresses method, the optimum values of two design variables, namely the cross-sectional dimensions and the prestressing force, are formulated as a nonlinear optimization model. Optimum values of the design variables are computed to satisfy either a minimum weight or a minimum cost objective function. To solve the nonlinear programming models, a program named Non-Linear Programming Prestressed Concrete Optimizer (NLPRECO) was coded in MATLAB® programming environment. Some illustrative design problems were solved using NLPRECO and their results are demonstrated herein. Sensitivity analysis of the optimized design variables, to variations in design parameters, was also investigated and the results are presented. Results show substantial improvement over the regular un-optimized solutions and moderate improvement over a linear programming optimization solutions.
- Published
- 2023
16. Boneless yield of carcass of feedlot-finished young Bos indicus L. bulls
- Author
-
Raul Dirceu-Pazdiora, Flávio Dutra-de Resende, Marcelo Henrique de Faria, Gustavo Rezende-Siqueira, Ricardo Linhares-Sampaio, Geraldo Benedito de Souza-Almeida, and Bruna Rafaela Caetano-Nunes-Pazdiora
- Subjects
Animal products ,cattle ,meat ,prime cuts ,Nellore breed ,diet ,minimum weight ,optigen®. ,Agriculture - Abstract
The aim of this study was to evaluate the boneless yield of the carcass of 64 feedlot-finished young Nellore bulls fed diets containing coated or uncoated urea and slaughtered at five body weights (350, 455, 485, 555, and 580 kg). A completely randomized design with a 5 × 2 factorial arrangement was used. No significant effect was detected for the interaction between slaughter weight and diet; therefore, the variables were analyzed separately, compared by polynomial contrasts and the F test, respectively. The absolute weights of the primal cuts from the fore- and hind-quarter increased linearly as the slaughter weight of the animals increased. Increasing slaughter weights elevated the percentage of rump cap in the pistola hindquarter as well as its yield. The percentages of the rump cap and rump skirt increased linearly, whereas those of knuckle, tenderloin, flank steak, rump, and outside flat decreased and the sum of prime cuts had a quadratic effect in relation to the weight of the right 1/2 carcass. Increasing slaughter weights led to a higher percentage of fat from the trimming of the hindquarter cuts relative to the weight of the 1/2 carcass. The weight of meat cuts was similar between the groups of animals fed coated and uncoated urea. Higher slaughter weights generate heavier meat cuts but lower percentages of primal cuts from the pistola hindquarter relative to the carcass weight.
- Published
- 2018
- Full Text
- View/download PDF
17. DESIGN AND STUDY OF DRIVE SWIVEL JOINTS FOR HYDRAULIC MANIPULATION SYSTEMS OF MOBILE TRANSPORT-TECHNOLOGICAL MACHINES
- Author
-
Lagerev A.V. and Lagerev I.A.
- Subjects
manipulation system ,hydraulic crane ,mobile machine ,drive swivel joint ,optimum design ,goal function ,minimum weight ,the system limitations ,Engineering (General). Civil engineering (General) ,TA1-2040 ,Chemistry ,QD1-999 - Abstract
The paper presents the design and principle of operation of a new type of articulated connection of adjacent links of manipulation systems of mobile transport and technological machines – the drive swivel joints to provide a rotary rela-tive movement of the links. Their design allows to combine the function of ensuring the continuity of the kinematic chain and the function of providing rotary movement adjacent units and without the use of additional external devices. The design of the device is protected by a patent of the Russian Federation. Drive swivel joints are an alternative to tra-ditional designs of articulated joints with external power hydraulic drives. Developed a mathematical optimization model. The model is based on the minimization of the mass of the drive swivel joints when you complete the necessary design, installation, operating and strength constraints. Based on this mathematical model the proposed method of com-puter-aided design of the drive swivel joints, which is implemented in a computer program. A study was conducted of the influence of the main technical characteristics and magnitude of the operational load at the optimal weight and the optimal constructive dimensions of the drive swivel joints. It is shown that at equal freight-altitude characteristics of mobile crane-manipulator the drive swivel joint allows you to exclude a number of operational shortcomings of the tra-ditional swivel: 1) development over time of the additional dynamic load of metal due to the increased clearances in connection; 2) lowering the volume of the working area of the crane due to the presence of external power of hydraulic drives; 3) the appearance of cracks due to fatigue failure of the elements of the attachment point of the hydraulic drives to the links of manipulation system. It is possible that the transfer of the hydraulic system for lower operating pressure, which increases the efficiency of the crane and the efficiency of the hydraulic drive as a whole, as well as reduction in operating maintenance costs.
- Published
- 2018
- Full Text
- View/download PDF
18. Material Weight and Constructability Optimization of Multifunction Earthquake Resilient Structures.
- Author
-
Sedighi, Siavash, Grigorian, Mark, Targhi, Marzieh Ansari, and Targhi, Razieh Ansari
- Subjects
SUSTAINABLE architecture ,STRUCTURAL optimization ,EARTHQUAKE resistant design ,STRUCTURAL engineering ,EARTHQUAKE engineering ,EARTHQUAKES - Abstract
Optimization of sustainable seismic design (SSD) of building structures has been one of the most challenging and ongoing research subjects in the earthquake and structural engineering worldwide during the past ten years. The purpose of the current research article is to supplement recently developed concepts of sustainable seismic design of building structures through the limitation of damage, repairability, purpose-specific detailing, form optimization, material, and construction optimization, and development of practical technologies to achieve cost-efficient construction and post-earthquake realignment and repairs (PERR). Earthquake resisting moment frames of minimum-weight have been introduced as essential parts of SSD. Global stiffness reduction (GSR) and restoring force adjustment (RFA) concepts have been introduced to facilitate post-earthquake realignment and repairs. The rocking core-moment frame (RCMF) is the key part of the archetype in combination with other structural systems. SSD is a concept that requires a thorough appreciation of the mechanics of structural optimization, sequential failures, recentering, and earthquake-induced P-delta and residual effects. Article results show utilizing the proposed archetype can provide sustainability as well as weight and construction optimization. The archetype components are one of the conventional structural systems with no significant change in the construction procedure. Several cases have been discussed in detail to illustrate the applications of the proposed concepts. [ABSTRACT FROM AUTHOR]
- Published
- 2020
19. Optimal Triangulation
- Author
-
Tan, Tiow-Seng and Kao, Ming-Yang, editor
- Published
- 2016
- Full Text
- View/download PDF
20. A Digital Twin Framework for Mechanical Testing Powered By Machine Learning
- Author
-
Söyleyici, C., Ünver, H.Ö., Bakır, M., Kahya, M., Söyleyici, C., Ünver, H.Ö., Bakır, M., and Kahya, M.
- Abstract
ASME 2022 International Mechanical Engineering Congress and Exposition, IMECE 2022 -- 30 October 2022 through 3 November 2022 -- 186577, The aviation industry demands innovation in new materials and processes which can demonstrate high performance with minimum weight. Strength-to-weight ratio (STR) is the key metric that drives the value justification in this demand stream. However, aviation's test and certification procedures are time-consuming, expensive, and heavily regulated. This study proposes a Digital Twin (DT) framework to address the time and high costs of mechanical testing procedures in the aviation industry. The proposed DT utilizes new Machine Learning (ML) techniques such as Transfer Learning (TL). Hence, a proof-of-concept study using TL in the Aluminum material group has been demonstrated. The promising results revealed that it was possible to reduce the test load of new material to 40% without any significant error. Copyright © 2022 by ASME., The authors are thankful for the valuable advice of Assoc.Prof. Ersin Bahceci throughout this study.
- Published
- 2023
21. Embedded antipodal planes and the minimum weight of the dual code of points and lines in projective planes of order $$p^2$$
- Author
-
Maarten De Boeck and Geertrui Van de Voorde
- Subjects
Projective plane ,(Dual) code of projective plane ,Mathematics and Statistics ,Applied Mathematics ,FOS: Mathematics ,Mathematics - Combinatorics ,Antipodal plane ,Combinatorics (math.CO) ,Minimum weight ,51E22 (Primary) 51A45, 94B05 (Secondary) ,Computer Science Applications - Abstract
The minimum weight of the code generated by the incidence matrix of points versus lines in a projective plane has been known for over 50 years. Surprisingly, finding the minimum weight of the dual code of projective planes of non-prime order is still an open problem, even in the Desarguesian case. In this paper, we focus on the case of projective planes of order $$p^2$$ p 2 , where p is prime, and we link the existence of small weight code words in the dual code to the existence of embedded subplanes and antipodal planes. In the Desarguesian case, we can exclude such code words by showing a more general result that no antipodal plane of order at least 3 can be embedded in a Desarguesian projective plane. Furthermore, we use combinatorial arguments to rule out the existence of code words in the dual code of points and lines of an arbitrary projective plane of order $$p^2$$ p 2 , p prime, of weight at most $$2p^2-2p+4$$ 2 p 2 - 2 p + 4 using more than two symbols. In particular, this leads to the result that the dual code of the Desarguesian projective plane $${{\,\textrm{PG}\,}}(2,p^2)$$ PG ( 2 , p 2 ) , $$p\ge 5$$ p ≥ 5 , has minimum weight at least $$2p^2-2p+5$$ 2 p 2 - 2 p + 5 .
- Published
- 2022
22. Perfect Italian domination in graphs: Complexity and algorithms
- Author
-
Jia-Bao Liu, S. Banerjee, and Dinabandhu Pradhan
- Subjects
Vertex (graph theory) ,Chordal graph ,Simple (abstract algebra) ,Applied Mathematics ,Block (permutation group theory) ,Discrete Mathematics and Combinatorics ,Minimum weight ,Function (mathematics) ,Hardness of approximation ,Algorithm ,Time complexity ,Mathematics - Abstract
An Italian dominating function on a simple undirected graph G is a function f : V ( G ) ⟶ { 0 , 1 , 2 } satisfying the condition that for each vertex v with f ( v ) = 0 , ∑ u ∈ N G ( v ) f ( u ) ≥ 2 . An Italian dominating function f on G is called a perfect Italian dominating function on G if for each vertex v with f ( v ) = 0 , ∑ u ∈ N G ( v ) f ( u ) = 2 . The weight of a function f on a graph G , denoted by w ( f ) , is the sum ∑ v ∈ V ( G ) f ( v ) . For a simple undirected graph G , Min-PIDF is the problem of finding the minimum weight of a perfect Italian dominating function on G . First, we discuss the complexity difference between Min-PIDF and the problem of finding the minimum weight of an Italian dominating function. We then establish the NP -completeness of the decision version of Min-PIDF in chordal graphs and investigate the hardness of approximation of Min-PIDF in general graphs. Finally, we present linear time algorithms for computing the minimum weight of a perfect Italian dominating function in block graphs and series-parallel graphs.
- Published
- 2022
23. An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm
- Author
-
Lisoněk, Petr, Trummer, Layla, Fonseca, Irene, Series editor, Pinto, Alberto Adrego, Series editor, Pinto, Raquel, editor, Rocha Malonek, Paula, editor, and Vettori, Paolo, editor
- Published
- 2015
- Full Text
- View/download PDF
24. Approximation Algorithms for k-Connected Graph Factors
- Author
-
Manthey, Bodo, Waanders, Marten, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Sanità, Laura, editor, and Skutella, Martin, editor
- Published
- 2015
- Full Text
- View/download PDF
25. Hingeless arm for space robotics actuated through shape memory alloys.
- Author
-
Biasutti T, Rigamonti D, Casciaro E, Grande AM, and Bettini P
- Subjects
- Alloys chemistry, Biomimetics, Shape Memory Alloys, Robotics methods
- Abstract
Operating outside the spacecraft via remotely controlled structures is an important opportunity in different space applications. The research in this area is focused on designing robots that are sufficiently flexible to allow inspection in locations where access is difficult or impossible for astronauts, while minimizing weight and bulk. The purpose of the research is to design a borescope for space applications with no hinges or other mechanisms, exploiting biomimetic design concepts. This is pursued by giving to the borescope a backbone exoskeleton provided by a continuous structure made of fibre reinforced composite material and using NiTi wires as tendons, taking advantage of their low weight and dimensions, which allow them to be embedded between the composite layers during the lamination process. After a study of the state of the art of flexible structures, concentrated in the medical and robotic fields, the research work unfolded in two phases. In the first design phase, several composite layup solutions were considered and analysed using finite element models, leading to the definition of the borescope geometrical parameters and to an initial estimate of the displacements that can be achieved. In the second experimental phase, seven prototypes were produced and tested, with one or more wires, to validate the design and to search for a configuration that can be actuated in different directions. The borescope prototypes resulted flexible enough to achieve an extended degree of bending and at the same time sufficiently rigid to allow complete rearm of the NiTi wires. The numerical and experimental study led to the definition of the design parameters, the number of wires, and the manufacturing technique to integrate NiTi actuators., (Creative Commons Attribution license.)
- Published
- 2023
- Full Text
- View/download PDF
26. Some optimal entanglement-assisted quantum codes constructed from quaternary Hermitian linear complementary dual codes.
- Author
-
Harada, Masaaki
- Subjects
- *
CIPHERS - Abstract
We establish the existence of optimal entanglement-assisted quantum [ [ n , k , d ; n − k ] ] 2 codes for (n , k , d) = (1 4 , 6 , 7) , (1 5 , 7 , 7) , (1 7 , 6 , 9) , (1 7 , 7 , 8) , (1 9 , 7 , 9) and (2 0 , 7 , 1 0). These codes are obtained from quaternary Hermitian linear complementary dual codes. We also give some observations on the largest minimum weights. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
27. One-error correcting [5, 2] ternary codes.
- Author
-
Hossain, Md. Zahangir, Dey, Partha Pratim, and Asifuzzaman, M.
- Subjects
- *
LINEAR codes , *CIPHERS , *MATHEMATICAL equivalence - Abstract
In this paper, using equivalence, we classify the error correcting linear codes of length 5 and dimension 2 over GF(3). We are able to show that these codes can be partitioned into 3 mutually disjoint equivalence classes. In the final section, we compute the weight distributions of the of the codes belonging to various distinct classes. We did similar investigations for [5,2] codes over GF(4) in [1]. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
28. Multi-stage guided stochastic search for optimization and standardization of free-form steel double-layer grids
- Author
-
Saman Aminbakhsh, Saeid Kazemzadeh Azad, and Samer S.S. Shaban
- Subjects
Mathematical optimization ,Standardization ,Computer science ,Pareto principle ,Minimum weight ,Building and Construction ,Grid ,Multi-objective optimization ,Set (abstract data type) ,Section (archaeology) ,Search algorithm ,Architecture ,Safety, Risk, Reliability and Quality ,Civil and Structural Engineering - Abstract
There has been a growing interest in the use of free-form structures with irregularly curved yet aesthetically pleasing configurations in the recent decades. Although design optimization of regular steel grids has been well addressed in the literature of structural optimization, still limited work has been devoted to optimum design of real-size free-form grid structures. On the one hand, a main obstacle when dealing with real-size free-form steel grids is the excessive computational effort associated with contemporary evolutionary optimization algorithms. On the other hand, it is generally perceived that the obtained final designs using conventional optimization algorithms may not necessarily be favored in practice if certain provisions are not stipulated by the algorithm to preclude an abundance of distinct steel section sizes in the final design. Hence, instead of offering a single optimum or near optimum design, it would be more desirable to provide the designer or decision maker with a Pareto front set of non-dominated design alternatives taking into account both the minimum weight as well as the assortment of available steel section sizes in the final design. Accordingly, in this paper, a computationally efficient multi-stage guided stochastic search algorithm is proposed for optimization and standardization of real-size free-form steel double-layer grids. A gradual design-oriented section elimination approach is followed where in the first optimization stage, a complete set of commercially available steel sections is introduced to the algorithm and in the succeeding stages, the size of section list is reduced by eliminating the redundant sizes. Two variants of the algorithm are employed to demonstrate the usefulness of the proposed technique in challenging test examples of free-form steel double-layer grids, and the obtained Pareto fronts are plotted to illustrate the trade-off between minimum weight and assortment of steel section sizes in the final design.
- Published
- 2021
29. Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
- Author
-
Matthew D. Williamson, K. Subramani, and Piotr J. Wojciechowski
- Subjects
Applied Mathematics ,0211 other engineering and technologies ,Minimum weight ,021107 urban & regional planning ,0102 computer and information sciences ,02 engineering and technology ,Binary logarithm ,01 natural sciences ,Tree (graph theory) ,Polynomial-time approximation scheme ,Randomized algorithm ,Constraint (information theory) ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,010201 computation theory & mathematics ,Discrete Mathematics and Combinatorics ,Algorithm ,Time complexity ,Variable (mathematics) ,Mathematics - Abstract
In this paper, we propose several algorithms for determining an optimal length tree-like refutation of linear feasibility in systems of Unit Two Variable Per Inequality (UTVPI) constraints. Given an infeasible UTVPI constraint system (UCS), a refutation certifies its infeasibility. The problem of finding refutations in a UCS finds applications in domains such as program verification and operations research. In general, there exist several types of refutations of feasibility in constraint systems. In this paper, we focus on a specific type of refutation called a tree-like refutation. Tree-like refutations are complete, in the sense that if a system of linear constraints is infeasible, then it must have a tree-like refutation. Associated with a refutation is its length, which equals the total number of constraints (accounting for the reuse of constraints) that are used to establish the infeasibility of the corresponding linear constraint system. Our goal in this paper is to find an optimal length tree-like refutation (OTLR) of an infeasible UCS. We describe two deterministic algorithms that find an OTLR of a UCS. If m is the number of constraints, n is the number of variables in the system, and k is the length of an OTLR, then our two algorithms run in O ( n 3 ⋅ log k ) time and O ( m ⋅ n ⋅ k ) time respectively. We also propose a true-biased, randomized algorithm for this problem. This algorithm runs in O ( m ⋅ n ⋅ log n ) time, and returns the length of an OTLR with probability ( 1 − 1 e ) . We extend our work to weighted UTVPI constraint systems (WUCS), where a positive weight is associated with each UTVPI constraint. The weight of a tree-like refutation is defined as the sum of the weights of the constraints used by the refutation. The problem of finding a minimum weight refutation in a WUCS is called the weighted optimal length tree-like refutation (WOTLR) problem and is known to be NP-hard. We propose a pseudo-polynomial time algorithm for the WOTLR problem and convert it into a fully polynomial time approximation scheme (FPTAS).
- Published
- 2021
30. Impact of Current Density and Cooling on the Weight Balance of Electrical Propulsion Drives for Aviation
- Author
-
Jan Hoffmann, Wolf-Rüdiger Canders, and Markus Henke
- Subjects
electrical aviation drives ,lightweight machine design ,high current density design ,direct slot cooling ,minimum weight ,polysiloxan cooling fluids ,Technology - Abstract
Through applying an exemplary design study, the dependencies between current density, temperatures, and weight in an electrical drive system for a small range aircraft with conventional electrical fan or propeller drives are evaluated. This study applies a combined numerical (Finite Element Method FEM) and analytical approach to the machine design, calculation of temperatures, and cooling system design (cooler, pumps, piping). A design scenario was defined using start and climb flight in a warm tropical surrounding as the worst load case. The design has to move between two fixed temperature limits: The maximum allowable temperature in the machine insulation and the ambient temperature. The implemented method facilitates a comparatively fast-medium depth design of the drive system. The derived results show, in fact, a minimum of weight at a certain current density, which is one of the key interests for the designers of the electrical machine. The main influences on this minimum are the temperature drops in the machine, the heat transfer to the cooling fluid, the heat transfer to the cooler wall, and the remaining heat rejection to the ambient. Method and results are transferable to other types of airplanes with different ratings.
- Published
- 2020
- Full Text
- View/download PDF
31. Minimum Connected Sensor Cover and Maximum-Lifetime Coverage in Wireless Sensor Networks
- Author
-
Wu, Lidong, Wu, Weili, Xing, Kai, Pardalos, Panos M., Maslov, Eugene, Du, Ding-Zhu, Sorokin, Alexey, editor, and Pardalos, Panos M., editor
- Published
- 2013
- Full Text
- View/download PDF
32. Single Approximation for Biobjective Max TSP
- Author
-
Bazgan, Cristina, Gourvès, Laurent, Monnot, Jérôme, Pascual, Fanny, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Solis-Oba, Roberto, editor, and Persiano, Giuseppe, editor
- Published
- 2012
- Full Text
- View/download PDF
33. Spanning Trees and Arborescences
- Author
-
Korte, Bernhard, Vygen, Jens, Korte, Bernhard, and Vygen, Jens
- Published
- 2012
- Full Text
- View/download PDF
34. b -Matchings and T -Joins
- Author
-
Korte, Bernhard, Vygen, Jens, Korte, Bernhard, and Vygen, Jens
- Published
- 2012
- Full Text
- View/download PDF
35. Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs
- Author
-
Naoki Katoh, Yuya Higashikawa, and Yuki Kobayashi
- Subjects
Laman graphs ,Point set ,Minimum weight ,Edge crossings ,Edge (geometry) ,Upper and lower bounds ,Geometric graphs ,Combinatorics ,Plane graphs ,Sparse and tight graphs ,Scheme (mathematics) ,Laman graph ,Euclidean geometry ,Crossing number (graph theory) ,Mathematics - Abstract
We investigate the total number of edge crossings (i.e., the crossing number) of the Euclidean minimum weight Laman graph \(\mathsf {MLG}(P)\) on a planar point set P. Bereg et al. (2016) showed that the upper and lower bounds for the crossing number of \(\mathsf {MLG}(P)\) are \(6|P|-9\) and \(|P|-3\), respectively. In this paper, we improve these upper and lower bounds given by Bereg et al. (2016) to \(2.5|P|-5\) and \((1.25-\varepsilon )|P|\) for any \(\varepsilon > 0\), respectively. Especially, for improving the upper bound, we introduce a novel counting scheme based on some geometric observations.
- Published
- 2021
36. The biclique partitioning polytope
- Author
-
Luiz Satoru Ochi, Teobaldo Bulhões, Lucídio dos Anjos Formiga Cabral, Fábio Protti, Rian G. S. Pinheiro, and Gilberto Farias de Sousa Filho
- Subjects
Convex hull ,Mathematics::Combinatorics ,Applied Mathematics ,Minimum weight ,Polytope ,Computer Science::Computational Complexity ,Complete bipartite graph ,Combinatorics ,Computer Science::Discrete Mathematics ,Bipartite graph ,Discrete Mathematics and Combinatorics ,Graph (abstract data type) ,Order (group theory) ,Computer Science::Data Structures and Algorithms ,Mathematics ,Incidence (geometry) - Abstract
Given a bipartite graph G = ( V 1 , V 2 , E ) , a biclique of G is a complete bipartite subgraph of G , and a biclique partitioning of G is a set A ⊆ E such that the bipartite graph G ′ = ( V 1 , V 2 , A ) is a vertex-disjoint union of bicliques. The biclique partitioning problem (BPP) consists of, given a complete bipartite graph G = ( V 1 , V 2 , E ) with edge weights w e ∈ R for all e ∈ E (thus, negative weights are allowed), finding a biclique partitioning A ⊆ E of minimum weight. The bicluster editing problem (BEP) is a variant of the BPP and consists of editing a minimum number of edges of an input bipartite graph G in order to transform its edge set into a biclique partitioning. Editing an edge consists of either adding it to the graph or deleting it from the graph. In addition to the BPP and the BEP, other problems in the literature aim at finding biclique partitionings, and this motivates the study of the biclique partitioning polytope P n m of the complete bipartite graph K n m (i.e., P n m is the convex hull of the incidence vectors of the biclique partitionings of K n m ). In this paper we develop such a polyhedral study and show that ladder, bellows, and grid inequalities induce facets of P n m . Our computational results show that these inequalities are very effective in solving the BEP. In particular, they are able to improve the value of the relaxed solution by up to 20%.
- Published
- 2021
37. Design Optimization of Composite Lay-up Sequence and Orientation to Achieve Minimum Weight for Racing Seat
- Author
-
Pranali Yogesh Kajale and Blue Eyes Intelligence Engineering and Sciences Publication(BEIESP)
- Subjects
Materials science ,Composite Racing Seat, Weight Optimization, FEA, Cross-ply, Angle-ply, Puck's failure criteria ,business.industry ,2277-3878 ,Composite number ,General Engineering ,Minimum weight ,Cross ply ,Structural engineering ,Orientation (graph theory) ,Finite element method ,Management of Technology and Innovation ,100.1/ijrte.C64530910321 ,business ,Sequence (medicine) - Abstract
Composites have proved their usefulness in the automotive industry during recent years. Many automobile companies use them in different parts to reduce weight without hampering strength. In a composite material, Lay-up sequence and orientation highly affects the properties of the laminate. Therefore, it is important to perform design optimization on a component to achieve high strength in minimum weight. This paper deals with the optimization of lay-up for composite Racing Seat using finite element analysis. Different lay-up sequences for laminates including, cross-ply [0/90]n, angle-ply [±α]n, and [0/90/±α]n are analysed. The lay-up sequence, orientation and ply number are optimized using composite material carbon fibre/Epoxy. Driver’s ergonomics and impact sustainability are considered constraints for weight optimization. Driver’s ergonomics were based on 95th percentile male and 5th percentile female rule. Force analysis is performed on the seat according to SFI 39.2 to evaluate the strength requirement. Finite element analysis of composite racing seat is performed via commercial finite element code ANSYS and using the capabilities of ANSYS Composite PrepPost (ACP) to form desired composite lay-up. A finite element code is based on classical lamination theory; including Puck’s failure criterion for first-ply failure. The seat is divided into three portions with a different number of layers considering the values and specific nature of acting forces; which resulted in different thicknesses in different regions. The optimization results show that for all the angles of Angle-ply laminate considered, Angle-ply laminates with an angle of 45⁰ provides a more optimum design. The minimum weight obtained is 10.15 kg.
- Published
- 2021
38. Optimal binary LCD codes
- Author
-
Stefka Bouyuklieva and Stefka Bouyuklieva
- Subjects
FOS: Computer and information sciences ,Discrete mathematics ,Liquid-crystal display ,business.industry ,Information Theory (cs.IT) ,Computer Science - Information Theory ,Applied Mathematics ,Dimension (graph theory) ,94B05 \and 94B65 ,ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ,Binary number ,Minimum weight ,Cryptography ,Optimal binary linear codes ,Computer Science Applications ,Dual (category theory) ,law.invention ,law ,Computer data storage ,FOS: Mathematics ,LCD codes ,Mathematics - Combinatorics ,Combinatorics (math.CO) ,business ,Mathematics - Abstract
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. These codes were first introduced by Massey in 1964. Nowadays, LCD codes are extensively studied in the literature and widely applied in data storage, cryptography, etc. In this paper, we prove some properties of binary LCD codes using their shortened and punctured codes. We also present some inequalities for the largest minimum weight $d_{LCD}(n,k)$ of binary LCD [n,k] codes for given length n and dimension k. Furthermore, we give two tables with the values of $d_{LCD}(n,k)$ for $k\le 32$ and $n\le 40$, and two tables with classification results., 19 pages
- Published
- 2021
39. Partitioning a graph into balanced connected classes: Formulations, separation and experiments
- Author
-
Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus J. Ota, and Yoshiko Wakabayashi
- Subjects
Discrete mathematics ,050210 logistics & transportation ,021103 operations research ,Information Systems and Management ,General Computer Science ,Linear programming ,05 social sciences ,0211 other engineering and technologies ,Partition problem ,Minimum weight ,Approximation algorithm ,TEORIA DOS GRAFOS ,02 engineering and technology ,Management Science and Operations Research ,Industrial and Manufacturing Engineering ,Modeling and Simulation ,0502 economics and business ,Relaxation (approximation) ,Branch and cut ,Integer programming ,Time complexity ,Mathematics - Abstract
This work addresses the balanced connected k -partition problem ( BCP k ), which is formally defined as follows. Given a connected graph G = ( V , E ) with nonnegative weights on the vertices, find a partition { V i } i = 1 k of V such that each class V i induces a connected subgraph of G , and the weight of a class with the minimum weight is as large as possible. This problem, known to be NP -hard, has been largely investigated under different approaches and perspectives: exact algorithms, approximation algorithms for some values of k or special classes of graphs, and inapproximability results. On the practical side, BCP k is used to model many applications arising in image processing, cluster analysis, operating systems and robotics. We propose three linear programming formulations for BCP k . The first one contains only binary variables and a potentially large number of constraints that can be separated in polynomial time in the corresponding linear relaxation. We introduce new valid inequalities and design polynomial-time separation algorithms for them. The other two formulations are based on flows and have a polynomial number of constraints and variables. Our computational experiments show that the exact algorithms based on the proposed formulations outperform the other exact approaches presented in the literature.
- Published
- 2021
40. Boneless yield of carcass of feedlot-finished young Bos indicus L. bulls.
- Author
-
Dirceu-Pazdiora, Raul, Dutra-de Resende, Flávio, de Faria, Marcelo Henrique, Rezende-Siqueira, Gustavo, Linhares-Sampaio, Ricardo, de Souza-Almeida, Geraldo Benedito, and Caetano-Nunes-Pazdiora, Bruna Rafaela
- Subjects
- *
ANIMAL carcasses , *BULLS , *SLAUGHTERING , *LIVESTOCK carcasses , *MEAT quality - Abstract
The aim of this study was to evaluate the boneless yield of the carcass of 64 feedlot-finished young Nellore bulls fed diets containing coated or uncoated urea and slaughtered at five body weights (350, 455, 485, 555, and 580 kg). A completely randomized design with a 5 × 2 factorial arrangement was used. No significant effect was detected for the interaction between slaughter weight and diet; therefore, the variables were analyzed separately, compared by polynomial contrasts and the F test, respectively. The absolute weights of the primal cuts from the fore- and hind-quarter increased linearly as the slaughter weight of the animals increased. Increasing slaughter weights elevated the percentage of rump cap in the pistola hindquarter as well as its yield. The percentages of the rump cap and rump skirt increased linearly, whereas those of knuckle, tenderloin, flank steak, rump, and outside flat decreased and the sum of prime cuts had a quadratic effect in relation to the weight of the right 1/2 carcass. Increasing slaughter weights led to a higher percentage of fat from the trimming of the hindquarter cuts relative to the weight of the 1/2 carcass. The weight of meat cuts was similar between the groups of animals fed coated and uncoated urea. Higher slaughter weights generate heavier meat cuts but lower percentages of primal cuts from the pistola hindquarter relative to the carcass weight. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
41. Application of an Efficient Gradient-Based Optimization Strategy for Aircraft Wing Structures.
- Author
-
Dababneh, Odeh, Kipouros, Timoleon, and Whidborne, James F.
- Subjects
AIRPLANE wings ,STRUCTURAL optimization ,LINEAR programming ,FINITE element method ,MATHEMATICAL programming - Abstract
In this paper, a practical optimization framework and enhanced strategy within an industrial setting are proposed for solving large-scale structural optimization problems in aerospace. The goal is to eliminate the difficulties associated with optimization problems, which are mostly nonlinear with numerous mixed continuous-discrete design variables. Particular emphasis is placed on generating good initial starting points for the search process and in finding a feasible optimum solution or improving the chances of finding a better optimum solution when traditional techniques and methods have failed. The efficiency and reliability of the proposed strategy were demonstrated through the weight optimization of different metallic and composite laminated wingbox structures. The results show the effectiveness of the proposed procedures in finding an optimized solution for high-dimensional search space cases with a given level of accuracy and reasonable computational resources and user efforts. Conclusions are also inferred with regards to the sensitivity of the optimization results obtained with respect to the choice of different starting values for the design variables, as well as different optimization algorithms in the optimization process. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
42. Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
- Author
-
Kowalik, Łukasz, Mucha, Marcin, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Dehne, Frank, editor, Gavrilova, Marina, editor, Sack, Jörg-Rüdiger, editor, and Tóth, Csaba D., editor
- Published
- 2009
- Full Text
- View/download PDF
43. Reoptimization of Weighted Graph and Covering Problems
- Author
-
Bilò, Davide, Widmayer, Peter, Zych, Anna, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Bampis, Evripidis, editor, and Skutella, Martin, editor
- Published
- 2009
- Full Text
- View/download PDF
44. Reliability-based design optimization and uncertainty quantification for optimal conditions of composite structures with non-linear behavior.
- Author
-
Conceição António, Carlos and Hoffbauer, Luísa Natália
- Subjects
- *
CONCRETE beams , *MECHANICAL buckling , *GENETIC algorithms , *SENSITIVITY analysis , *ELASTIC modulus , *STANDARDS - Abstract
An approach to reliability-based design (RBDO) of beam reinforced composite structures with non-linear geometric behavior is proposed. A unified approach following both buckling and first-ply failure (FPF) is used to verify the integrity of beam reinforced shallow shell laminated structures. A new RBDO methodology using a genetic algorithm and a hierarchical decomposition searches the global most probable failure point (MPP). For the reliability analysis, the random parameters are the mechanical properties of laminates. Simultaneously the optimal design based on weight minimization under prescribed reliability and buckling constraints is searched through this hierarchical genetic algorithm (HGA). The design variables are the ply angle, the ply thickness, the height and the width of the cross sections of the stiffeners. Numerical results show the capabilities of the proposed approach using the MPP search inner loop integrated in a HGA scheme. Based on a sensitivity methodology the uncertainty for the optimal solution obtained from HGA is analyzed. In the neighborhood of critical buckling values of the structural response the asymptotic behavior of uncertainty propagation is observed. The influence of uncertainties from random parameters and design variables are studied on critical load factor and critical displacement. The variability of these structural response functions are measured by their coefficients of variation and Sobol indices. The most important influences for uncertainty propagation are obtained from ply angle of shell laminates and from longitudinal elastic modulus group. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
45. Reducing shear-lag in thin-walled composite I-beam wing spars
- Author
-
Visnjic, Goran, Nožak, Dejan, Kosel, Franc, and Kosel, Tadej
- Published
- 2014
- Full Text
- View/download PDF
46. Reliability-based analysis and design of steel frames with different supports
- Author
-
Aderinlewo, Olufikayo and Ayodele Alade, Gabriel
- Published
- 2014
- Full Text
- View/download PDF
47. Multidisciplinary Design of Flexible Aircraft
- Author
-
Baluch, Haroon Awais, van Tooren, Michel, Curran, Richard, editor, Chou, Shuo-Yan, editor, and Trappey, Amy, editor
- Published
- 2008
- Full Text
- View/download PDF
48. Spanning Trees and Arborescences
- Author
-
Graham, R. L., editor, Korte, B., editor, Lovász, L., editor, Wigderson, A., editor, Ziegler, G. M., editor, Korte, Bernhard, and Vygen, Jens
- Published
- 2008
- Full Text
- View/download PDF
49. b-Matchings and T-Joins
- Author
-
Graham, R. L., editor, Korte, B., editor, Lovász, L., editor, Wigderson, A., editor, Ziegler, G. M., editor, Korte, Bernhard, and Vygen, Jens
- Published
- 2008
- Full Text
- View/download PDF
50. Free Lattices
- Published
- 2008
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.