On a Two-Dimensional Problem in the End-Block Design of Post-Tensioned Prestressed Concrete Beams

Abstract is not available.

Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences

In this paper, we consider the bi-criteria single machine scheduling problem of n jobs with a learning effect. The two objectives considered are the total completion time (TC) and total absolute differences in completion times (TADC). The objective is to find a sequence that performs well with respect to both the objectives: the total completion time and the total absolute differences in completion times. In an earlier study, a method of solving bi-criteria transportation problem is presented. In this paper, we use the methodology of solvin bi-criteria transportation problem, to our bi-criteria single machine scheduling problem with a learning effect, and obtain the set of optimal sequences,. Numerical examples are presented for illustrating the applicability and ease of understanding.

Firing characteristics of a simple coaxial triggeredva cuum gap

The firing and delay characteristics of a simple coaxial type of triggered vacuum gap (TVG) are described and compared with the planar type. The designs are new and differ from those reported earlier. By analogy with gaseous breakdown the statistical and formative time lags have been determined.

An elementary approach to gap theorems

Using elementary comparison geometry, we prove: Let (M, g) be a simply-connected complete Riemannian manifold of dimension >= 3. Suppose that the sectional curvature K satisfies -1-s(r) <= K <= -1, where r denotes distance to a fixed point in M. If lim(r ->infinity) e(2r) s(r) = 0, then (M, g) has to be isometric to H-n.The same proof also yields that if K satisfies -s(r) <= K <= 0 where lim(r ->infinity) r(2) s(r) = 0, then (M, g) is isometric to R-n, a result due to Greene and Wu.Our second result is a local one: Let (M, g) be any Riemannian manifold. For a E R, if K < a on a geodesic ball Bp (R) in M and K = a on partial derivative B-p (R), then K = a on B-p (R).

Application of Mathematical Programming to the Plywood Design and Manufacturing Problem

Plywood manufacture includes two fundamental stages. The first is to peel or separate logs into veneer sheets of different thicknesses. The second is to assemble veneer sheets into finished plywood products. At the first stage a decision must be made as to the number of different veneer thicknesses to be peeled and what these thicknesses should be. At the second stage, choices must be made as to how these veneers will be assembled into final products to meet certain constraints while minimizing wood loss. These decisions present a fundamental management dilemma. Costs of peeling, drying, storage, handling, etc. can be reduced by decreasing the number of veneer thicknesses peeled. However, a reduced set of thickness options may make it infeasible to produce the variety of products demanded by the market or increase wood loss by requiring less efficient selection of thicknesses for assembly. In this paper the joint problem of veneer choice and plywood construction is formulated as a nonlinear integer programming problem. A relatively simple optimal solution procedure is developed that exploits special problem structure. This procedure is examined on data from a British Columbia plywood mill. Restricted to the existing set of veneer thicknesses and plywood designs used by that mill, the procedure generated a solution that reduced wood loss by 79 percent, thereby increasing net revenue by 6.86 percent. Additional experiments were performed that examined the consequences of changing the number of veneer thicknesses used. Extensions are discussed that permit the consideration of more than one wood species.

Supersymmetric Solution Of Gauge Hierarchy Problem

Some recent developments with respect to the resolution of the gauge hierarchy problem in grand unified theories by supersymmetry are presented. A general argument is developed to show how global supersymmetry maintains the stability of the different mass-scales under perturbative effects.

A Branch and Bound Algorithm for a Transportation Type Problem with Piecewise Linear Convex Objective Function

A branch and bound type algorithm is presented in this paper to the problem of finding a transportation schedule which minimises the total transportation cost, where the transportation cost over each route is assumed to be a piecewice linear continuous convex function with increasing slopes. The algorithm is an extension of the work done by Balachandran and Perry, in which the transportation cost over each route is assumed to beapiecewise linear discontinuous function with decreasing slopes. A numerical example is solved illustrating the algorithm.

Delay time of a vacuum gap triggered by an exploding wire

The experimental results of delay time of a vacuum gap triggered by an exploding wire plasma have been reported. It consists of explosion delay time and propagation delay time. The explosion delay time has been found to be dependent on the parameters of the exploding wire and the exploding wire circuit and is independent of vacuum gap configuration. The propagation delay time depends on the properties of the exploding wire plasma and vacuum gap parameters such as the number of injection slots, gap spacing, gap polarity, etc. In the absence of prebreakdown current in the vacuum gap, the breakdown can be initiated only after the plasma completely bridges the gap spacing. Under this specific condition, it has been shown that the delay time data can be used to calculate the plasma velocity.

On the Transform Method of Solution of an External Crack Problem

The breakdown of the usual method of Fourier transforms in the problem of an external line crack in a thin infinite elastic plate is discovered and the correct solution of this problem is derived using the concept of a generalised Fourier transform of a type discussed first by Golecki [1] in connection with Flamant's problem.

Self-excited triggered vacuum gap

The self-triggering action of the TVG under DC conditions using the same power source as the main circuit is described. Because of the low impedance of the power source compared with the thyratron pulse generator, the TVG can be triggered with voltages as low as 85 V. It is found that circuit conditions influence the minimum stable arc currents that can be sustained.

On the bottleneck linear programming problem

In this paper, the results on primal methods for Bottleneck Linear Programming (BLP) problem are briefly surveyed, the primal method is presented and the degenerate case related to Bottleneck Transportation Problem (BTP) is explicitly considered. The algorithm is based on the idea of using auxiliary coefficients as is done by Garfinkel and Rao [6]. The modification presented for the BTP rectifies the defect in Hammer's method in the case of degenerate basic feasible solution. Illustrative numerical examples are also given.

Two-Impurity Kondo Problem

The two-impurity Kondo problem is studied by use of perturbative scaling techniques. The physics is determined by the interplay between the Ruderman-Kittel-Kasuya-Yosida (RKKY) interaction between the two impurity spins and the Kondo effect. In particular, for a strong ferromagnetic RKKY interaction the susceptibility exhibits three structures as the temperature is lowered, corresponding to the ferromagnetic locking together of the two impurity spins followed by a two-stage freezing out of their local moments by the conduction electrons due to the Kondo effect.

A time minimising transportation problem with quality dependent time

The usual assumption made in time minimising transportation problem is that the time for transporting a positive amount in a route is independent of the actual amount transported in that route. In this paper we make a more general and natural assumption that the time depends on the actual amount transported. We assume that the time function for each route is an increasing piecewise constant function. Four algorithms - (1) a threshold algorithm, (2) an upper bounding technique, (3) a primal dual approach, and (4) a branch and bound algorithm - are presented to solve the given problem. A method is also given to compute the minimum bottle-neck shipment corresponding to the optimal time. A numerical example is solved illustrating the algorithms presented in this paper.