Many dark energy candidates have been proposed to explain the accelerated expansion the universe seems to be currently undertaking. Discriminating between them is likely to be a major issue in the near future, and cluster number counts would be a good tool for this. In this article we study scalar field candidates to dark energy which are coupled to dark matter. We focus on comparing the cluste...

We present an approach for tracking a lecturer during the course of his speech. We use features from multiple cameras and microphones, and process them in a joint particle filter framework. The filter performs sampled projections of 3D location hypotheses and scores them using features from both audio and video. On the video side, the features are based on foreground segmentation, multi-view fa...

We have cloned, sequenced and analyzed transcription of the phage T4 uvsY gene. This gene is transcribed from a single gp MotA-dependent middle promoter to give a major transcript of approximately 930 nucleotides and a minor transcript of approximately 620 nucleotides. All in vivo and in vitro uvsY transcripts show anomalous migration in agarose gels. The uvsY transcript contains an open readin...

O presente estudo tem como tema, os impactos interculturais no desenvolvimento e acesso às escolas dos menores de rua adolescentes que vivem nas ruas estudantes estrangeiros chegam brasileiras. Os objetivos são analisar na educação mostrar a triste realidade em situação rua, verificar quais as principais limitações enfrentam ao chegar escola brasileira. Esse é resultado pesquisa bibliográfica, ...

Abstract In 1974, Erdős posed the following problem. Given an oriented graph H , determine or estimate maximum possible number of -free orientations n -vertex graph. When is a tournament, answer was determined precisely for sufficiently large by Alon and Yuster. general, when underlying undirected contains cycle, one can obtain accurate bounds combining observation Kozma Moran with celebrated r...

In the field of mobile crowd sensing (MCS), traditional client–cloud architecture faces increasing challenges in communication and computation overhead. To address these issues, this paper introduces edge computing into MCS system proposes a two-stage task allocation optimization method under constraint limited resources. The utilizes deep reinforcement learning for selection optimal servers de...