scispace - formally typeset
Search or ask a question
Topic

Minimum weight

About: Minimum weight is a research topic. Over the lifetime, 2002 publications have been published within this topic receiving 28244 citations.


Papers
More filters
Book ChapterDOI
01 Oct 2019
TL;DR: In this article, a new approach to the elliptic curve discrete logarithm problem (ECDLP) was proposed, where the minimum weight codewords for algebraic geometry codes were found via list decoding.
Abstract: We provide a new approach to the elliptic curve discrete logarithm problem (ECDLP). First, we construct Elliptic Codes (EC codes) from the ECDLP. Then we propose an algorithm of finding the minimum weight codewords for algebraic geometry codes, especially for the elliptic code, via list decoding. Finally, with the minimum weight codewords, we show how to solve ECDLP. This work may provide a potential approach to speeding up the computation of ECDLP.

5 citations

Journal ArticleDOI
TL;DR: In this paper, the optimal design of recurve arrays with energy flow in the system is studied. And the authors use a genetic algorithm to find the optimum designs for a relatively complex actuator.
Abstract: In this paper we study the optimal design of recurve arrays. An analytic model of the static response of the recurve actuator with energy flow in the system is derived. Two optimization problems for the recurve array are formulated with material, packaging, and performance constraints. One formulation is based on minimum weight. The second formulation is based on energy efficiency. A genetic algorithm is used to find the optimum designs. Recurve arrays designed for maximum energy conversion efficiency are compared to those designed for minimum weight. Parametric studies are conducted to investigate the effect of the stiffness of the driven structure and the maximum deliverable voltage on the optimized designs. These optimization formulations are effective design tools for a relatively complex actuator.

5 citations

Journal ArticleDOI
TL;DR: An explicit basis of incidence vectors for thep-ary code of the design of points and hyperplanes of the affine geometryAG"m(F"p) for any primepand any integerm>=2 is obtained, which gives a new elementary proof that this code is a generalized Reed-Muller code.

5 citations

Journal ArticleDOI
TL;DR: In this paper, the optimal position of the support point for a radial gate that guarantees the minimum weight satisfying the strength constraint conditions has been identified, where local genetic and hybrid-type genetic algorithms are used as the optimum tools to reduce the computing time and enhance the accuracy.
Abstract: On the basis of a structural analysis of radial gate (i.e. Tainter gate), the current paper focuses on weight minimization according to the location of the arms on a radial gate. In spite of its economical significance, there are hardly any previous studies on the optimum design of radial gate. Accordingly, the present study identifies the optimum position of the support point for a radial gate that guarantees the minimum weight satisfying the strength constraint conditions. This study also identifies the optimum position for 2 or 3 radial arms with a convex cylindrical skin plate relative to a given radius of the skin plate curvature, pivot point, water depth, ice pressure, etc. These optimum designs are then compared with previously constructed radial gates. Local genetic and hybrid-type genetic algorithms are used as the optimum tools to reduce the computing time and enhance the accuracy. The results indicate that the weights of the optimized radial gates are appreciably lower than those of previously constructed gates.

5 citations

Journal ArticleDOI
TL;DR: In this paper, a method for optimal design of large-scale framework structures is presented based on a reanalysis technique in combination with suboptimization for each member group in the structure.
Abstract: A method for optimal design of large-scale framework structures is presented. The approach is based on a reanalysis technique in combination with suboptimization for each member group in the structure. The suboptimization is performed using a nonlinear programming algorithm based on sequential quadratic programming. Given the topology and material quality, the cross-sectional dimensions of wide-flange and hollow-section members are treated as design variables and the minimum weight or cost solution is sought. The structural problem is formulated using the matrix displacement method. Large three-dimensional rigidly jointed frames subjected to multiple loading cases are analyzed. Constraints can be imposed on maximum Von Mises stresses, beam stability, and the fatigue damage at nodal points. The approach is general, robust, and efficient in that it avoids numerous global structural analyses. The practical engineering utility of the method is emphasized. Case studies of an offshore deck module and a platform jacket structure are included. Future work should focus on a refined formulation of the fatigue constraint.

5 citations


Network Information
Related Topics (5)
Upper and lower bounds
56.9K papers, 1.1M citations
76% related
Time complexity
36K papers, 879.5K citations
73% related
Numerical analysis
52.2K papers, 1.2M citations
73% related
Optimization problem
96.4K papers, 2.1M citations
73% related
Polynomial
52.6K papers, 853.1K citations
72% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202321
202239
202153
202051
201966
201858