Miracle-dz/UniFAR-FTUs huggingface dataset:
Aprendizagem social no jogo Equilíbrio Geométrico (PNAIC): por uma analítica existencial do movimento

Esta pesquisa investigou o processo de aprendizagem social, atraves dos modos de comunicacao corporal dos alunos do Ensino Fundamental I de uma escola publica, no momento do jogo Equilibrio Geometrico do Pacto Nacional pela Alfabetizacao na Idade Certa - PNAIC. Tendo como questao-problema: Quais as contribuicoes dos modos de comunicacao corporais presentes na pratica do jogo do PNAIC contribuem para o desenvolvimento da aprendizagem social, e como elas ocorrem? O estudo objetivou analisar a aprendizagem social pelos modos de comunicacao corporais presentes na situacao do jogo. E uma pesquisa descritiva e analitica, de natureza qualitativa, caracterizada como estudo de caso. O estudo se desenvolveu com a colaboracao de 24 criancas com idades entre sete e oito anos do 3o ano do Ensino Fundamental I, da Escola Estadual Gilberto Rola, situada na zona rural da cidade de Mossoro - Rio Grande do Norte. Foram utilizados como instrumentos de coleta de dados a observacao participante, o diario de campo, o protocolo de observacao e o grupo dialogal. O jogo Equilibrio Geometrico foi implementado na rotina escolar em quatro aulas, conduzidas pela professora alfabetizadora, acompanhada pela professora pesquisadora. Os dados coletados na observacao participante e no diario de campo foram analisados pela Analitica Existencial do Movimento (Gomes-da-Silva, 2012; 2011; 2001) e pela Teoria Social Cognitiva (BANDURA, 1986, 1977, 2008). Os dados obtidos no grupo dialogal foram investigados pela Analise de conteudo (BARDIN, 2011). O estudo aponta que a modelacao social desenvolvida no jogo Equilibrio Geometrico foi impulsionada pelo modo de comunicacao corporal “primordial de anteposicao”, por ter um carater de acao competitiva, imediata e criativa. O modo como as criancas se movimentam e uma forma de comunicacao impulsionadora do processo de modelacao dos comportamentos e, consequentemente, da aprendizagem social. Concluimos que, no jogo ‘Equilibrio Geometrico’, as aprendizagens partem diretamente das interacoes entre os jogadores. Nesse processo de comunicacao, promovem-se a criatividade e a competitividade entre os sujeitos, reverberando novas praticas interativas significativas.
SEMIPARAMETRICALLY EFFICIENT RANK-BASED INFERENCE FOR SHAPE I. OPTIMAL RANK-BASED TESTS FOR SPHERICITY

We propose a class of rank-based procedures for testing that the shape matrix V of an elliptical distribution (with unspecified center of symmetry, scale and radial density) has some fixed value V 0 ; this includes, for V 0 = I k , the problem of testing for sphericity as an important particular case. The proposed tests are invariant under translations, monotone radial transformations, rotations and reflections with respect to the estimated center of symmetry. They are valid without any moment assumption. For adequately chosen scores, they are locally asymptotically maximin (in the Le Cam sense) at given radial densities. They are strictly distribution-free when the center of symmetry is specified, and asymptotically so when it must be estimated. The multivariate ranks used throughout are those of the distances-in the metric associated with the null value V 0 of the shape matrix-between the observations and the (estimated) center of the distribution. Local powers (against elliptical alternatives) and asymptotic relative efficiencies (AREs) are derived with respect to the adjusted Mauchly test (a modified version of the Gaussian likelihood ratio procedure proposed by Muirhead and Waternaux [Biometrika 67 (1980) 31-43]) or, equivalently, with respect to (an extension of) the test for sphericity introduced by John [Biometrika 59 (1972) 169-173]. For Gaussian scores, these AREs are uniformly larger than one, irrespective of the actual radial density. Necessary and/or sufficient conditions for consistency under nonlocal, possibly nonelliptical alternatives are given. Finite sample performance is investigated via a Monte Carlo study.
Cache-Conscious Memory Management

Dynamic memory allocation must solve the re-allocation problem: where to place a new object. Current techniques of malloc and GC are designed with cache locality in mind. However, it is unclear how to cleanly separate the locality effect in these techniques. This paper outlines a locality theory for dynamic memory allocation. It presents a new metric called the reallocation distance, a way to compute the ideal locality, a linear-time al-gorithm to measure actual locality, and suggestions for using the theory in improving the design of memory allocators.
Web attack detection using entropy-based analysis

Web attacks are increases both magnitude and complexity. In this paper, we try to use the Shannon entropy analysis to detect these attacks. Our approach examines web access logging text using the principle that web attacking scripts usually have more sophisticated request patterns than legitimate ones. Risk level of attacking incidents are indicated by the average (AVG) and standard deviation (SD) of each entropy period, i.e., Alpha and Beta lines which are equal to AVG-SD and AVG-2*SD, respectively. They represent boundaries in detection scheme. As the result, our technique is not only used as high accurate procedure to investigate web request anomaly behaviors, but also useful to prune huge application access log files and focus on potential intrusive events. The experiments show that our proposed process can detect anomaly requests in web application system with proper effectiveness and low false alarm rate.
Relative maps and tautological classes

The moduli space of stable relative maps to the projective line combines features of stable maps and admissible covers. We prove all standard Gromov-Witten classes on these moduli spaces of stable relative maps have tautological push-forwards to the moduli space of curves. In particular, the fundamental classes of all moduli spaces of admissible covers push-forward to tautological classes. Consequences for the tautological rings of the moduli spaces of curves include methods for generating new relations, uniform derivations of the socle and vanishing statements of the Gorenstein conjectures for the complete, compact type, and rational tail cases, tautological boundary terms for Ionel's, Looijenga's, and Getzler's vanishings, and applications to Gromov-Witten theory.
Data Integration for Recommendation Systems

The quality of large-scale recommendation systems has been insufficient in terms of the accuracy of prediction. One of the major reasons is caused by the sparsity of the samples, usually represented by vectors of userspsila ratings on a set of items. Combining information other than userspsila ratings can provide the learning model complementary views of the data and, thus, a more accurate prediction. In this paper, we propose efficient methods for finding the best combination weights among single kernels. The weight parameters are optimized by aligning the combination kernel to ideal kernels. We solve the kernel alignment problem by linear programming techniques.
A multilayer neural network for image demosaicking

The recent revival of interest in artificial neural networks has been fueled by their successful applications in various image processing and computer vision tasks. In this work, we make use of the rotational invariance of the natural image patch distribution and propose a 4 × 4 patch based multilayer neural network for image demosaicking. We show that it does surprisingly well compared to state-of-the-art approaches requiring much larger neighborhoods. An online demo can be found at http://dev.ipol. im/~yiqing/ipol_demo/neuaick/.
Latent Class Analysis of Complex Sample Survey Data

High fruit and vegetable intake is associated with decreased cancer risk. However, dietary recall data from national surveys suggest that, on any given day, intake falls below the recommended minima of three daily servings of vegetables and two daily servings of fruit. There is no single widely accepted measure of “usual” intake. One approach is to regard the distribution of intake as a mixture of “regular” (relatively frequent) and “nonregular” (relatively infrequent) consumers, using an indicator of whether an individual consumed the food of interest on the recall day. We use a new approach to summarizing dietary data, latent class analysis (LCA), to estimate “usual” intake of vegetables. The data consist of four 24-hour dietary recalls from the 1985 Continuing Survey of Intakes by Individuals collected from 1,028 women. Traditional LCA based on simple random sampling was extended to complex survey data by introducing sample weights into the latent class estimation algorithm and by accounting for the complex sample design through the use of jackknife standard errors. A two-class model showed that 18%% do not regularly consume vegetables, compared to an unweighted estimate of 33%%. Simulations showed that ignoring sample weights resulted in biased parameter estimates and that jackknife variances were slightly conservative but provided satisfactory confidence interval coverage. Using a survey-wide estimate of the design effect for variance estimation is not accurate for LCA. The methods proposed in this article are readily implemented for the analysis of complex sample survey data.
Signal processing schemes for Doppler global velocimetry

Two schemes for processing signals obtained from the Doppler global velocimeter are described. The analog approach is a simple, real-time method for obtaining an RS-170 video signal containing the normalized intensity image. Pseudocolors are added using a monochromatic frame grabber producing a standard NTSC video signal that can be monitored and/or recorded. The digital approach is more complicated, but maintains the full resolution of the acquisition cameras with the ability to correct the signal image for pixel sensitivity variations band to remove background light. Prototype circuits for each scheme are described, and example results from the investigation of the vortical flow field above a 75 degrees delta wing are presented. <<ETX>>
Saliency Detection With Spaces of Background-Based Distribution

In this letter, an effective image saliency detection method is proposed by constructing some novel spaces to model the background and redefine the distance of the salient patches away from the background. Concretely, given the backgroundness prior, eigendecomposition is utilized to create four spaces of background-based distribution (SBD) to model the background, in which a more appropriate metric (Mahalanobis distance) is quoted to delicately measure the saliency of every image patch away from the background. After that, a coarse saliency map is obtained by integrating the four adjusted Mahalanobis distance maps, each of which is formed by the distances between all the patches and background in the corresponding SBD. To be more discriminative, the coarse saliency map is further enhanced into the posterior probability map within Bayesian perspective. Finally, the final saliency map is generated by properly refining the posterior probability map with geodesic distance. Experimental results on two usual datasets show that the proposed method is effective compared with the state-of-the-art algorithms.
Interneuron Cell Loss in the Human Cerebral Cortex in Huntington’s Disease

Any use you make of these documents or images must be for research or private study purposes only, and you may not make them available to any other person. Authors control the copyright of their thesis. You will recognise the author's right to be identified as the author of this thesis, and due acknowledgement will be made to the author where appropriate. You will obtain the author's permission before publishing any material from their thesis.
Probabilistic Models for Common Spatial Patterns: Parameter-Expanded EM and Variational Bayes

Common spatial patterns (CSP) is a popular feature extraction method for discriminating between positive andnegative classes in electroencephalography (EEG) data.Two probabilistic models for CSP were recently developed: probabilistic CSP (PCSP), which is trained by expectation maximization (EM), and variational BayesianCSP (VBCSP) which is learned by variational approx-imation. Parameter expansion methods use auxiliaryparameters to speed up the convergence of EM or thedeterministic approximation of the target distributionin variational inference. In this paper, we describethe development of parameter-expanded algorithms forPCSP and VBCSP, leading to PCSP-PX and VBCSP-PX, whose convergence speed-up and high performanceare emphasized. The convergence speed-up in PCSP-PX and VBCSP-PX is a direct consequence of parame-ter expansion methods. The contribution of this study is the performance improvement in the case of CSP,which is a novel development. Numerical experimentson the BCI competition datasets, III IV a and IV 2ademonstrate the high performance and fast convergenceof PCSP-PX and VBCSP-PX, as compared to PCSP andVBCSP.
Shape Identification and Classification in Echolocation

This paper introduces a new approach to shape perception in wave imaging. It aims at proposing an efficient shape identification and classification algorithm in echolocation. This approach is based on first extracting geometric features from the reflected waves and then matching them with precomputed ones associated with a dictionary of targets. The construction of such frequency-dependent shape descriptors is based on some important properties of scattering coefficients and new invariants. Stability and resolution of the proposed identification algorithm with respect to measurement noise and limited-view aspect are analytically and numerically quantified.
Evolutionary Quasi-Random Search for Hand Articulations Tracking

We present a new method for tracking the 3D position, global orientation and full articulation of human hands. Following recent advances in model-based, hypothesize-and-test methods, the high-dimensional parameter space of hand configurations is explored with a novel evolutionary optimization technique specifically tailored to the problem. The proposed method capitalizes on the fact that samples from quasi-random sequences such as the Sobol have low discrepancy and exhibit a more uniform coverage of the sampled space compared to random samples obtained from the uniform distribution. The method has been tested for the problems of tracking the articulation of a single hand (27D parameter space) and two hands (54D space). Extensive experiments have been carried out with synthetic and real data, in comparison with state of the art methods. The quantitative evaluation shows that for cases of limited computational resources, the new approach achieves a speed-up of four (single hand tracking) and eight (two hands tracking) without compromising tracking accuracy. Interestingly, the proposed method is preferable compared to the state of the art either in the case of limited computational resources or in the case of more complex (i.e., higher dimensional) problems, thus improving the applicability of the method in a number of application domains.
Applying site information to information retrieval from the Web

In recent years, several information retrieval methods using information about Web-links have been developed, such as HITS and trawling. In order to analyze Web-links dividing into links inside each Web site (local-links) and links between Web sites (global-links)for information retrieval, a proper model of the Web site is required. In existing research, a Web server is used as a model of the Web site. This idea works relatively well when a Web site corresponds to a server, as is the case for public Web sites, but works poorly when multiple Web sites correspond to a server, as is the case for private Web sites on rental Web servers. We propose a new model of the Web site, "directory-based site", to handle typical private sites, and a method to identify them using information about the URL and Web-links. We verify the method can approximately identify, at a rate of 66% of over 110,000 servers, whether each server has multiple directory-based sites or not, and extract over 500,000 directory-based sites and 4 million global-links by computational experiments using jp-domain URLs and Web-link data contains over 23 million URLs and 100 million Web-links, collected from July to August 2000, by Toyoda and Kitsuregawa. We also propose a new framework of Web-link based information retrieval that uses directory-based sites and global-links instead of Web pages and whole Web-links respectively, and examine the effectiveness of our framework by comparing a result of trawling on our framework to one on the existing framework.
A cognitive perspective on developer comprehension of software design documentation

Software design documentation is an important aid for communication during software development and maintenance. Nevertheless, little empirical evidence exists regarding the use of software documentation, and effective software design representation in particular. In an experimental setting, we used documentation from industry in which aspects of a software design were modeled in both a (UML) diagram and text. We recorded and analysed how participants used these media to answer various design-related questions and collected additional information in various questionnaires. By having participants think aloud, we set out to understand the underlying cognitive processes of developer design comprehension by applying the grounded theory method. We validated the results with concepts from the cognitive theory of multimedia learning. Results show a positive correlation between developer certainty and correctness of answers, whereas the opposite was not found. Also, self-rated experience and self-rated skill coincide with higher levels of certainty. We found that participants rated information based on perceived importance and that their "common sense" plays a significant role. Surprisingly, more than 60 percent of the answers were based on the consultation of a single medium. These results clearly ask for further investigation. We propose corresponding future work.
Toward a Novel Application of CIDOC CRM to Underwater Archaeological Surveys

With the advance of Web technologies, the number of "academic" videos available on the Web (e.g., online lectures, web seminars, conference presentations, or tutorial videos) has increased explosively. A fundamental task of managing such videos is to classify them into relevant subjects. For this task, most of current content providers rely on keywords to perform the classification, while active techniques for automatic video classification focus on utilizing multi-modal features. However, in our settings, we argue that both approaches are not sufficient to solve the problem effectively. Keywords based method is very limited in terms of accuracy, while features based one lacks semantics to represent academic subjects. Toward this problem, in this paper, we propose to transform the video subject classification problem into the text categorization problem by exploiting the extracted transcripts of videos. Using both real and synthesized data, (1) we extensively study the validity of the proposed idea, (2) we analyze the performance of different text categorization methods, and (3) we study the impact of various factors of transcripts such as quality and length towards academic video classification problem.
A performance study of software and hardware data prefetching schemes

Prefetching, i.e., exploiting the overlap of processor computations with data accesses, is one of several approaches for tolerating memory latencies. Prefetching can be either hardware-based or software-directed or a combination of both. Hardware-based prefetching, requiring some support unit connected to the cache, can dynamically handle prefetches at run-time without compiler intervention. Software-directed approaches rely on compiler technology to insert explicit prefetch instructions. Mowry et al.'s software scheme (1991,1992) and the authors' hardware approach (1991) are two representative schemes. In this paper, the authors evaluate approximations to these two schemes in the context of a shared-memory multiprocessor environment. Their qualitative comparisons indicate that both schemes are able to reduce cache misses in the domain of linear array references. When complex data access patterns are considered, the software approach has compile-time information to perform sophisticated prefetching whereas the hardware scheme has the advantage of manipulating dynamic information. The performance results from an instruction-level simulation of four benchmarks confirm these observations. Simulations show that the hardware scheme introduces more memory traffic into the network and that the software scheme introduces a non-negligible instruction execution overhead. An approach combining software and hardware schemes is proposed; it shows promise in reducing the memory latency with least overhead. <<ETX>>
TCP Offload Is a Dumb Idea Whose Time Has Come

Network interface implementors have repeatedly attempted to offload TCP processing from the host CPU. These efforts met with little success, because they were based on faulty premises. TCP offload per se is neither of much overall benefit nor free from significant costs and risks. But TCP offload in the service of very specific goals might actually be useful. In the context of the replacement of storage-specific interconnect via commoditized network hardware, TCP offload (and more generally, offloading the transport protocol) appropriately solves an important problem.
Responses to Cell Loss Become Restricted as the Supporting Cells in Mammalian Vestibular Organs Grow Thick Junctional Actin Bands That Develop High Stability

Sensory hair cell (HC) loss is a major cause of permanent hearing and balance impairments for humans and other mammals. Yet, fish, amphibians, reptiles, and birds readily replace HCs and recover from such sensory deficits. It is unknown what prevents replacement in mammals, but cell replacement capacity declines contemporaneously with massive postnatal thickening of F-actin bands at the junctions between vestibular supporting cells (SCs). In non-mammals, SCs can give rise to regenerated HCs, and the bands remain thin even in adults. Here we investigated the stability of the F-actin bands between SCs in ears from chickens and mice and Madin-Darby canine kidney cells. Pharmacological experiments and fluorescence recovery after photobleaching (FRAP) of SC junctions in utricles from mice that express a γ-actin–GFP fusion protein showed that the thickening F-actin bands develop increased resistance to depolymerization and exceptional stability that parallels a sharp decline in the cell replacement capacity of the maturing mammalian ear. The FRAP recovery rate and the mobile fraction of γ-actin–GFP both decreased as the bands thickened with age and became highly stabilized. In utricles from neonatal mice, time-lapse recordings in the vicinity of dying HCs showed that numerous SCs change shape and organize multicellular actin purse strings that reseal the epithelium. In contrast, adult SCs appeared resistant to deformation, with resealing responses limited to just a few neighboring SCs that did not form purse strings. The exceptional stability of the uniquely thick F-actin bands at the junctions of mature SCs may play an important role in restricting dynamic repair responses in mammalian vestibular epithelia.