928 resultados para Code Reuse


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Reclamation and reuse of wastewater require the use of tools that minimize risks to health and natural ecosystems. There are various types of such tools, among which HACCP (hazardanalysis and critical control points) and barrier systems are gainingimportance. The research reported here aims to determine andevaluate the most efficient combinations of different treatmentsystems—barriers—for the reclamation of secondary effluentsfrom urban sewage treatment plants, and for obtaining water ofsufficient quality for reuse in accordance with existing legislation,in which water disinfection has become one of the keys tocompliance. Several conventional and non-conventional reclamationtechnologies are evaluated. The results lead us to recommendtreatment lines for the different reclaimed water uses established inthe Spanish legislation.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This report gives an overview, background and progress on the implementation of the Veterans Counseling Program established pursuant to Iowa Code 35.12, as enacted by 2007 Iowa Acts, House FIle 817.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Partint d'un projecte anterior anomenat Code, els objectius d'aquest projecte són: integrar l'aplicació en una eina de software, incorporar les noves versions de les llibreries GWT i Java, i escabilitzar l'aplicació a través de la tecnologia cloud computing concretament amb la infraestructura de Google App Engine

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper highlights the role of non-functional information when reusing from a component library. We describe a method for selecting appropriate implementations of Ada packages taking non-functional constraints into account; these constraints model the context of reuse. Constraints take the form of queries using an interface description language called NoFun, which is also used to state non-functional information in Ada packages; query results are trees of implementations, following the import relationships between components. We define two different situations when reusing components, depending whether we take the library being searched as closed or extendible. The resulting tree of implementations can be manipulated by the user to solve ambiguities, to state default behaviours, and by the like. As part of the proposal, we face the problem of computing from code the non-functional information that determines the selection process.