Here we study the discrete lot-sizing problem with an initial stock variable and an associated variable upper bound constraint. This problem is of interest in its own right, and is also a natural relaxation of the constant capacity lot-sizing problem with upper bounds and fixed charges on the stock variables. We show that the convex hull of solutions of the discrete lot-sizing problem is obtain...

This study discusses the development and test of a four-size HeightWeight sizing program of partial pressure and exposure suits designed for the Japanese Air Self-Defense Force. The sizing program is based upon an anthropometric survey of over 200 subjects, conducted at five air bases throughout Japan during the spring of 1961. The statistical rationale used in devising the Height-Weight progra...

Deciding on an appropriate population size for a given GA application can often be critical to the algorithm's success. Too small, and the GA can fall victim to sampling error, affecting the efficacy of its search. Too large, and the GA wastes computational resources. Although advice exists for sizing GA populations, much of this advice involves theoretical aspects that are not accessible to th...

This article shows the first results of the adoption of COSMIC Full Function Points as a sizing method replacing function point analysis. The main arguments why COSMIC-FFP was chosen will be explained, the transformation plan will be shown together with the first results of the use of COSMIC-FFP. Next to the management requirement that the new functional sizing method had to be a standard a num...

This paper presents an e cient algorithm for bu ered Steiner tree construction with wire sizing. Given a source and n sinks of a signal net, with given positions and a required arrival time associated with each sink, the algorithm nds a Steiner tree with bu er insertion and wire sizing so that the required arrival time (or timing slack) at the source is maximized. The unique contribution of our...

Here we study the discrete lot-sizing problem with an initial stock variable and an associated variable upper bound constraint. This problem is of interest in its own right, and is also a natural relaxation of the constant capacity lot-sizing problem with upper bounds and fixed charges on the stock variables. We show that the convex hull of solutions of the discrete lot-sizing problem is obtain...

A series of polystyrene-based cationic copolymers (PSCC) were synthesized by copolymerization of styrene and cationic comonomer vinylbenzyl trimethylammonium chloride (VBTMAC). These copolymers can be used as internal paper sizing agents in a broad pH range. The effect of charge density on the PSCC colloid properties was investigated. It was found that at room temperature the PSCC could change ...

This paper derives a population sizing relationship for genetic programming (GP). Following the population-sizing derivation for genetic algorithms in Goldberg, Deb, and Clark (1992), it considers building block decision making as a key facet. The analysis yields a GP-unique relationship because it has to account for bloat and for the fact that GP solutions often use subsolutions multiple times...

We read with great interest the recently published case report by Alsaileek et al. in the European Journal of Echocardiography on laceration of atrial septum during balloon sizing. We had already reported about tear of atrial septum during balloon sizing of atrial septal defect (ASD) in a 20year-old female. Balloon sizing was attempted with Amplatzer sizing balloon (Amplatzer sizing Balloon, AG...

This paper presents a set of interconnect performance estimation models for design planning with consideration of various effective interconnect layout optimization techniques, including optimal wire sizing, simultaneous driver and wire sizing, and simultaneous buffer insertion/sizing and wire sizing. These models are extremely efficient, yet provide high degree of accuracy. They have been test...