This paper presents efficient implementations of several algorithms for solving the minimum-cost network flow problem. Various practical heuristics and other important implementation aspects are also discussed. A novel result of this work is the application of Goldberg’s recent partial augment-relabel method in the cost-scaling algorithm. The presented implementations are available as part of t...

The reliability of the radio frequency (RF) windows on the Low Energy Demonstration Accelerator (LEDA) is critical to the success of the Accelerator Production of Tritium Program (APT). On the APT accelerator there will be over 1000 windows, each passing on the order of 250 kW of CW RF power. This power level is well above power levels historically used in RF windows. Based on the high-power RF...

Estimating the Domain of Attraction (DA) of equilibrium points is a problem of fundamental importance in systems engineering. Several approaches have been developed for computing the Largest Estimate of the DA (LEDA) corresponding to a Lyapunov function in the case of polynomial systems. In the case of non-polynomial systems, the computation of the LEDA is still an open problem. In this paper, ...

Intresset för praktiknära skolforskning är idag stort. Aktionsforskning en populär form samarbete mellan forskare och lärare där handledning centralt. Syftet med denna studie att problematisera handledarroller i aktionsforskningsprojekt. Som teoretisk grund ligger den amerikanska utbildningsfilosofen Nel Noddings omsorgsetik. Deltagarna studien tre som alla har erfarenheter av leda aktionsforsk...

Mathilde Godard*, Pierre Koning and Maarten Lindeboom *Mathilde Godard is CNRS researcher at Université Paris-Dauphine, PSL Research University, CNRS, LEDa (mathilde.godard{at}cnrs.fr). economics professor the Vrije Universiteit Amsterdam, IZA TI. Universiteit, IZA, TI, Centre for Health Economics Monash University.

LEDA is a library of efficient data types and algorithms. At present, its strength is graph algorithms and the data structures related to them. The computational geometry part is evolving. The main features of the library are 1) a clear separation of specification and implementation 2) parameterized data types 3) a comfortable data type graph, and 4) its ease of use.

The Institut fHr deutsche Sprache recently has begun setting up a LExicographical DAta Base for German (LEDA). This data base is designed to improve efficiency in the collection, analysis, ordering and description of language material by facilitating access to textual samples within corpora and to word articles, within machine readable dictionaries and by providing a frame to store results of l...