1000 resultados para K MESONS
Resumo:
We present a new wrapper feature selection algorithm for human detection. This algorithm is a hybrid featureselection approach combining the benefits of filter and wrapper methods. It allows the selection of an optimalfeature vector that well represents the shapes of the subjects in the images. In detail, the proposed featureselection algorithm adopts the k-fold subsampling and sequential backward elimination approach, while thestandard linear support vector machine (SVM) is used as the classifier for human detection. We apply theproposed algorithm to the publicly accessible INRIA and ETH pedestrian full image datasets with the PASCALVOC evaluation criteria. Compared to other state of the arts algorithms, our feature selection based approachcan improve the detection speed of the SVM classifier by over 50% with up to 2% better detection accuracy.Our algorithm also outperforms the equivalent systems introduced in the deformable part model approach witharound 9% improvement in the detection accuracy
Resumo:
We investigate modules over systematic rings. Such rings are almost graded and have appeared under various names in the literature; they are special cases of the G-systems of Grzeszczuk. We analyse their K-theory in the presence of conditions on the support, and explain how this generalises and unifies calculations of graded and filtered K-theory scattered in the literature. Our treatment makes systematic use of the formalism of idempotent completion and a theory of triangular objects in additive categories, leading to elementary and transparent proofs throughout.
Resumo:
This chapter provides an overview of some of the key findings from a large mixed methods study regarding disabled children in care in Northern Ireland
Resumo:
Muitos dos problemas de otimizao em grafos reduzem-se determinao de um subconjunto de vrtices de cardinalidade mxima que induza um subgrafo k-regular. Uma vez que a determinao da ordem de um subgrafo induzido k-regular de maior ordem , em geral, um problema NP-difcil, so deduzidos novos majorantes, a determinar em tempo polinomial, que em muitos casos constituam boas aproximaes das respetivas solues timas. Introduzem-se majorantes espetrais usando uma abordagem baseada em tcnicas de programao convexa e estabelecem-se condies necessrias e suficientes para que sejam atingidos. Adicionalmente, introduzem-se majorantes baseados no espetro das matrizes de adjacncia, laplaciana e laplaciana sem sinal. ainda apresentado um algoritmo no polinomial para a determinao de umsubconjunto de vrtices de umgrafo que induz umsubgrafo k-regular de ordem mxima para uma classe particular de grafos. Finalmente, faz-se um estudo computacional comparativo com vrios majorantes e apresentam-se algumas concluses.
Resumo:
Disertao de mestrado, Cincias Biomdicas, Departamento de Cincias Biomdicas e Medicina, Universidade do Algarve, 2015
Resumo:
Action for a cleaner tomorrow, a South Carolina environmental curriculum supplement has been developed to teach the children of South Carolina and, ultimately, their parents to think about their daily habits and to make environmentally responsible choices. This curriculum supplement tries to reflect the environmental issues facing the world today with a particular emphasis on South Carolinas concerns and goals. This document deals with grades K-1.
Resumo:
This speech was delivered to by the Governor to give the general assembly information of the condition of the state and give them recommendations to consider measures that the Governor deems necessary or expedient. He provides the information regarding the state debt, taxes, and bonded debt. He describes the financial agent of the state as well as the expenditures of the state government.
Resumo:
This speech was addressed to the people of the Senate and House of Representatives. It was delivered to inform them of the progress over the past year made to place the finances of the state on a firm and healthy basis. He gives a report on all departments and projects funded by the government in the past year.