Minimum weight

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

On Coset Weight Distributions of the 3-Error-Correcting BCH-Codes

Abstract: We study the coset weight distributions of the 3-error-correcting binary narrow-sense BCH-codes and of their extensions, whose lengths are, respectively, 2m-1 and 2m, m odd. We prove that all weight distributions are known as soon as those of the cosets of minimum weight 4 of the extended code are known. We point out that properties of the cosets which are orphans yield interesting properties on the other cosets. We describe the classes of cosets which are equivalent under the affine permutations. At the end we produce significant numerical results, proving that the number of distinct weight distributions of cosets increases with the length of the codes.

Response Surface Approximations for Fatigue Life Prediction

Abstract: Response surface methodology is used to construct response surface approximations for the fatigue life of structures with complex geometry and/or loading conditions. The smooth nature of the response surface approximations eliminates numerical noise, which is inherent to the numerical analysis procedures used to estimate the fatigue life. Procedures for constructing the required response surface approximations, as well as for implementing the resulting approximations in the design process, are discussed. The durability of a structure is introduced into the design process by including the minimum fatigue life as a constraint in a minimum weight optimization of the structure. The smoothness of the response surface approximations allows the use of a derivative based optimization in the design process. Two example problems, typical of the automotive industry, are evaluated to illustrate the proposed methodology. Both example problems have structures modeled by plate elements and the objective of the optimization problem is to find the optimum thickness distribution for a minimum specified fatigue life. It is shown that the thickness

Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies

Abstract: The minimum weight vertex cover (MWVC) problem is an important combinatorial optimization problem with various real-world applications. Due to its NP hardness, most works on solving MWVC focus on heuristic algorithms that can return a good quality solution in reasonable time. In this work, we propose two dynamic strategies that adjust the behavior of the algorithm during search, which are used to improve a state of the art local search for MWVC named FastWVC, resulting in two local search algorithms called DynWVC1 and DynWVC2. Previous MWVC algorithms are evaluated on graphs with random or hand crafted weights. In this work, we evaluate the algorithms on the vertex weighted graphs that obtained from an important real world problem, the map labeling problem. Experiments show that our algorithm obtains better results than previous algorithms for MWVC and maximum weight independent set (MWIS) on these real world instances. We also test our algorithms on massive graphs studied in previous works, and show significant improvements there.

Subsea control cable

Abstract: A subsea control cable includes an outer sheath and cables, conduits etc. arranged inside the sheath, and also at least one weight element. The weight element includes at least one strength member extending continuously along the entire length of the control cable, to which strength member there is attached a weight element or elements. The weight of the weight element in relation to the diameter of the control cable varies along the length of the control cable, e.g., from a predetermined minimum weight/diameter ratio, where the weight element consists only of the strength element, to a predetermined maximum weight/diameter ratio, where the cross-section of the control cable is filled to the maximum with the weight member.