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
Proceedings ArticleDOI
03 Jun 1996
TL;DR: This work presents a novel and effective approach through the application of interval arithmetic to the multilayer perceptron that allows one to compute strict bounds of the output error of the network and find robust solutions respect to weight inaccuracies.
Abstract: We address in this work the problem of weight inaccuracies in digital and analog feedforward networks. Both kind of implementations suffer from this problem due to physical limits of the particular technology. This work presents a novel and effective approach through the application of interval arithmetic to the multilayer perceptron. Results show that our method allows one to (1) compute strict bounds of the output error of the network, (2) find robust solutions respect to weight inaccuracies and (3) compute the minimum weight precision required to obtain the desired performance of the network.

6 citations

Journal ArticleDOI
TL;DR: In this paper, the authors used the transmission theory of uniform shielding to generate data for use in the design of an optimum shield for a given set of constraints (a prescribed shielding level, minimum weight shield, etc.).
Abstract: Shielding equations developed in a research program were used to generate data for use in the design of an optimum shield for a given set of constraints (a prescribed shielding level, minimum weight shield, etc.). Analysis consisted chiefly of computer processing of the modified equations. To reduce computer time, only symmetrical laminated shielding material was considered. Maximum shielding attenuation with respect to overall shield weight was considered for two cases, using the transmission theory of uniform shielding: 1) the lightest shield for a specified level of attenuation, and 2) the shield providing maximum attenuation within specified constraints of shield weight.

6 citations

Journal ArticleDOI
01 Mar 1977
TL;DR: In this paper, an automated procedure to generate and appraise cost differing layouts for a stiffened, open or closed steel box girder with composite concrete deck is described, based on the merrison interim design rules, CP 117 and BS 153.
Abstract: The practicality of optimization applied to a complex structural design problem is examined using the steel box girder bridge as a case for study. An automated procedure to generate and appraise cost differing layouts for a stiffened, open or closed steel box girder with composite concrete deck is described. Appraisal is based on the merrison interim design rules, CP 117 and BS 153. For comparison, the cost per metre of span is derived from a standard fabricated segment length of 10 M, using a breakdown of operation times with ascribed team plus plant rates and separate costing of material. A direct search technique with external penalty function is used to locate global optima. The procedure is applied to a numerical example in which minimum weight and minimum cost solutions are compared and the effects of changes in span and material grade are noted. It is concluded that the development of meaningful, special purpose, optimization routines for complex structures is possible and can be fruitful in technical and commercial terms provided the aim is to supplement rather than supplant engineering judgement. (A) /TRRL/

6 citations

Journal ArticleDOI
TL;DR: An algorithm for the generation of all partitions of a graph G with positive edge weights into k mincuts is presented, an enumeration procedure based on the cactus representation of the mincuts of G.

6 citations

Proceedings ArticleDOI
22 Nov 2010
TL;DR: This paper proposes a frequent sequential traversal pattern mining with weights constraint, which produces a few but important sequential traverse patterns in session databases with a low minimum support, by adjusting a weight range of pages and sequence.
Abstract: Data mining is the task of discovering interesting patterns from large amounts of data. There are many data mining tasks, such as classification, clustering, association rule mining, and sequential pattern mining. Many frequent sequential traversal pattern mining algorithms have been developed which mine the set of frequent subsequences traversal pattern satisfying a minimum support constraint in a session database. However, previous frequent sequential traversal pattern mining algorithms give equal weightage to sequential traversal patterns while the pages in sequential traversal patterns have different importance and have different weightage. Another main problem in most of the frequent sequential traversal pattern mining algorithms is that they produce a large number of sequential traversal patterns when a minimum support is lowered and they do not provide alternative ways to adjust the number of sequential traversal patterns other than increasing the minimum support. In this paper, we propose a frequent sequential traversal pattern mining with weights constraint. Our main approach is to add the weight constraints into the sequential traversal pattern while maintaining the downward closure property. A weight range is defined to maintain the downward closure property and pages are given different weights and traversal sequences assign a minimum and maximum weight. In scanning a session database, a maximum and minimum weight in the session database is used to prune infrequent sequential traversal subsequence by doing downward closure property can be maintained. Our method produces a few but important sequential traversal patterns in session databases with a low minimum support, by adjusting a weight range of pages and sequence.

6 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