Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 2 de 2
Filtrar
Mais filtros










Base de dados
Intervalo de ano de publicação
1.
Environ Sci Technol ; 45(9): 4173-8, 2011 May 01.
Artigo em Inglês | MEDLINE | ID: mdl-21476497

RESUMO

Anaerobic digestion is widely used in waste activated sludge treatment. In this paper, partial least-squares (PLS) is employed to identify the parameters that are determining the biochemical methane potential (BMP) of waste activated sludge. Moreover, a model is developed for the prediction of the BMP. A strong positive correlation is observed between the BMP and volatile fatty acids and carbohydrate concentrations in the sludge. A somewhat weaker correlation with COD is also present. Soluble organics (sCOD, soluble carbohydrates and soluble proteins) were shown not to influence the BMP in the observed region. This finding could be most-valuable in the context of application of sludge pretreatment methods. The obtained model was able to satisfactory predict the BMP.


Assuntos
Metano/química , Esgotos/química , Eliminação de Resíduos Líquidos/métodos , Análise dos Mínimos Quadrados , Modelos Biológicos
2.
Neural Comput ; 20(2): 523-54, 2008 Feb.
Artigo em Inglês | MEDLINE | ID: mdl-18047412

RESUMO

Various machine learning problems rely on kernel-based methods. The power of these methods resides in the ability to solve highly nonlinear problems by reformulating them in a linear context. The dominant eigenspace of a (normalized) kernel matrix is often required. Unfortunately, the computational requirements of the existing kernel methods are such that the applicability is restricted to relatively small data sets. This letter therefore focuses on a kernel-based method for large data sets. More specifically, a numerically stable tracking algorithm for the dominant eigenspace of a normalized kernel matrix is proposed, which proceeds by an updating (the addition of a new data point) followed by a downdating (the exclusion of an old data point) of the kernel matrix. Testing the algorithm on some representative case studies reveals that a very good approximation of the dominant eigenspace is obtained, while only a minimal amount of operations and memory space per iteration step is required.


Assuntos
Inteligência Artificial , Armazenamento e Recuperação da Informação , Redes Neurais de Computação , Reconhecimento Automatizado de Padrão/métodos , Humanos , Distribuição Normal
SELEÇÃO DE REFERÊNCIAS
DETALHE DA PESQUISA
...