Miracle-dz/UniFAR-FTUs huggingface dataset:
A Experiência Turística e o Turismo de Experiência: um estudo sobre as dimensões da experiência memorável

This article presents a discussion based on theories of Anthropology, Marketing and Tourism, in particular regarding the issue of experience anthropology and economy, in order to analyze the dimensions of experience, defined by Pine II and Gilmore (1999) and Oh, Fiore and Jeoung (2007), which allowed us to understand the experience of tourists who visited Gramado (RS) in the years 2010 and 2011.To achieve the proposed objective, a descriptive exploratory research was conducted enabling the selection, using quantitative methods, of a set of tourists from Sao Paulo (Capital) that had been in Gramado (RS) between the years 2010 and 2011, to which a qualitative research was applied. As main findings it was identified that the dimensions aesthetic, hospitality and entertainment were rated as most important for the formation of a memorable experience, and new dimensions emerged from in-depth interviews with the selected tourists.
Comparison of four ActiGraph accelerometers during walking and running.

UNLABELLED Currently, researchers can use the ActiGraph 7164 or one of three different versions of the ActiGraph GT1M to objectively measure physical activity. PURPOSE To determine whether differences exist between activity counts from the ActiGraph 7164 and the three versions of the GT1M at given walking and running speeds. METHODS Ten male participants (23.6 +/- 2.7 yr) completed treadmill walking and running at 10 different speeds (3-min stages) while wearing the ActiGraph 7164 and the latest GT1M (GT1M-V3) or the GT1M version one (GT1M-V1) and the GT1M version two (GT1M-V2). Participants walked at 3, 5, and 7 km x h(-1) followed by running at 8, 10, 12, 14, 16, 18, and 20 km x h(-1). The accelerometers were worn on an elastic belt around the waist over the left and right sides of the hip. Testing was performed on different days using a counterbalanced within-subjects design to account for potential differences attributable to accelerometer placement. At each speed, a one-way repeated-measures ANOVA was used to examine differences between activity counts in counts per minute (cpm). Post hoc pairwise comparisons with Bonferroni adjustments were used where appropriate. RESULTS There were no significant differences between activity counts at any given walking or running speed (P < 0.05). At all running speeds, activity counts from the ActiGraph 7164 and GT1M-V2 displayed the lowest and highest values, respectively. Output from all accelerometers peaked at 14 km x h(-1) (mean range = 8974 +/- 677 to 9412 +/- 982 cpm) and then gradually declined at higher speeds. The mean difference score at peak output between the ActiGraph 7164 and GT1M-V2 was 439 +/- 565 cpm. CONCLUSIONS There were no statistically significant differences between outputs from all the accelerometers, indicating that researchers can select any of the four ActiGraph accelerometers in doing research.
Variational Exemplar-Based Image Colorization

In this paper, we address the problem of recovering a color image from a grayscale one. The input color data comes from a source image considered as a reference image. Reconstructing the missing color of a grayscale pixel is here viewed as the problem of automatically selecting the best color among a set of color candidates while simultaneously ensuring the local spatial coherency of the reconstructed color information. To solve this problem, we propose a variational approach where a specific energy is designed to model the color selection and the spatial constraint problems simultaneously. The contributions of this paper are twofold. First, we introduce a variational formulation modeling the color selection problem under spatial constraints and propose a minimization scheme, which computes a local minima of the defined nonconvex energy. Second, we combine different patch-based features and distances in order to construct a consistent set of possible color candidates. This set is used as input data and our energy minimization automatically selects the best color to transfer for each pixel of the grayscale image. Finally, the experiments illustrate the potentiality of our simple methodology and show that our results are very competitive with respect to the state-of-the-art methods.
New record of Crocidura zarudnyi from Zabol, Iran

The Zarudny’s rock shrew, Crocidura zarudnyi Ognev, 1928, is found in very few localities in Afghanistan, Pakistan and Iran. Therefore, a record of the occurrence of additional populations of this species is very interesting. During surveys in Zabol (Iran), we caught three adult males of Crocidura sp. Based on external, dental and cranial measurements as well as genetic analyses, the individuals were identified as C. zarudnyi, which represents the first record of this species in this area. Kirstukas Crocidura zarudnyi Ognev, 1928 aptinkamas labai nedaugelyje Afganistano, Pakistano ir Irano vietovių, todėl naujos radimvietės yra svarbios rūsies paplitimo įvertinimui. Tyrimų Zabole (Iranas) metu sugauti trys suauge Crocidura sp. patinėliai, kurie pagal isorinius, dantų ir kaukolės matmenis bei genetinės analizės rezultatus buvo identifikuoti kaip C. zarudnyi. Tai nauja rūsies radimvietė Zabole.
The participation of methionine and cysteine in the formation of bonds resistant to the action of proteolytic enzymes in heated casein

1. The influence of temperature, moisture content and the presence of glucose on the level of available methionine and cysteine in casein was studied. 2. Differences between total and available methionine and cysteine contents of heated casein (90° for 24 h) were determined by an in vitro method. The maximum losses in total and available methionine content were 22 and 51% respectively. The losses in total and available cysteine content were 24 and 100% respectively. 3. The results indicated that for heated casein the release of amino acids by proteolytic enzymes was less complete than for native casein. 4. The results of rat growth assays suggested that diets containing oxidized casein are less well utilized by rats than those containing native casein. The decrease in body-weight of rats receiving the diets containing oxidized casein could be counteracted by the addition of methionine and 20 g unoxidized casein/kg diet. 5. There was a lower level of some available amino acids (determined after enzymic hydrolysis using pancreatopeptidase E (EC 3.4.4.7), leucine aminopeptidase (EC 3.4.1.1) and prolidase (EC 3.4.3.7)), including those essential for the rat, in oxidized casein as compared with native casein. 6. Cysteic acid, in oxidized casein, probably makes impossible the utilization of the amino acids in its neighbourhood. 7. From the differences in the available amino acid contents of the native, oxidized and heated casein it was concluded that the oxidation of casein causes the formation of complexes in the polypeptide chain, resistant to enzymic hydrolysis, but to a much lesser extent than does heating.
Antibiotic resistance in Lactobacillus reuteri and Lactobacillus plantarum

Lactic acid bacteria (LAB) may act as reservoirs of antibiotic resistance genes that can be transferred via the food chain or within the gastrointestinal tract to pathogenic bacteria. This thesis provides data required for assessing the potential risk of using antibiotic resistant strains of the LAB species Lactobacillus reuteri and Lactobacillus plantarum as food processing aids or probiotics. Knowledge of the distributions of antibiotic minimum inhibitory concentrations (MICs) for a species is needed when using a phenotypic method to differentiate strains with acquired resistance from susceptible strains or strains with intrinsic resistance. Controlled and standardised conditions are required for antibiotic susceptibility testing of LAB, as demonstrated here during evaluation of the Etest and broth microdilution MIC determination methods used. Inoculum size and incubation time were varied during broth microdilution testing of the susceptibilities of 35 LAB strains to six antibiotics. An increase in either parameter resulted in elevated MICs for all species. Antibiotic susceptibility profiles were determined for 56 L. reuteri and 121 L. plantarum strains that differed by source and spatial and temporal origin. MIC data obtained with the Etest and the broth microdilution methods corresponded well with each other. All L. plantarum strains were susceptible to ampicillin, gentamicin, erythromycin and clindamycin, and intrinsically resistant to streptomycin. Acquired resistance to tetracycline was associated with plasmid-bound tet(M). Lactobacillus reuteri strains had acquired resistance to tetracycline (n=28), ampicillin (n=14), erythromycin/clindamycin (n=6) and chloramphenicol (n=1). This resistance was attributed to mutational pbp genes for ampicillin and to added tet(W), erm and cat(TC) genes for the antibiotics inhibiting protein synthesis. Genetic relatedness was observed among L. reuteri strains with high MICs for both ampicillin and tetracycline and among strains with high MICs for both erythromycin and clindamycin. The majority of the antibiotic resistant L. reuteri strains carried the resistance genes on plasmids. Traits of putative transfer machineries adjacent to both plasmid- and chromosome-located resistance genes were demonstrated. Lactobacillus reuteri as a donor of resistance genes in the human gut was investigated by studying the transferability of the tetracycline resistance gene tet(W) to faecal enterococci, bifidobacteria and lactobacilli. No gene transfer was demonstrated under the conditions tested.
Register allocation and instruction scheduling in Unison

This paper describes Unison, a simple, flexible, and potentially optimal software tool that performs register allocation and instruction scheduling in integration using combinatorial optimization. The tool can be used as an alternative or as a complement to traditional approaches, which are fast but complex and suboptimal. Unison is most suitable whenever high-quality code is required and longer compilation times can be tolerated (such as in embedded systems or library releases), or the targeted processors are so irregular that traditional compilers fail to generate satisfactory code.
RR-13-281 A P 2 P Based Usage Control Enforcement Scheme Resilient to Re-injection Attacks March 2013

Existing privacy controls based on access control techniques do not prevent massive dissemination of private data by malevolent acquaintances of social network, unauthorized duplication of files or personal messages, or persistence of some files in third-party operated storage beyond their deletion by their owners. We suggest a usage control enforcement scheme that allows users to gain control over their data during its entire lifetime and the way it is disseminated in outsourced distributed data storage. The scheme is based on a peer-to-peer architecture whereby a different set of peers is randomly selected for data assignment. Usage control is achieved based on the assumption that at least t out of any set of n peers will not behave maliciously. Such a system would still suffer from re-injection attacks whereby attackers can gain ownership of data and the usage policy thereof by simply re-storing data after slight modification of the content. In order to cope with re-injection attacks the scheme relies on a similarity detection mechanism based on special hash functions. The robustness of the scheme has been evaluated in an experimental setting using a variety of re-injection attacks.
LEAP : A Virtual Platform Architecture for FPGAs

FPGAs are known to be very effective at accelerating certain classes of algorithms. A variety of FPGA platforms are available today, but because of the absence of a standardized platform architecture, each platform comes in the form of a board with a diverse set of devices and communication endpoints. Therefore, FPGA programmers typically have to spend significant effort in building interfaces to devices and adapting their applications to work with the semantics of these devices. Further, an FPGA board by itself is in many cases incapable running full real-world applications – software support is required. Working out communication protocols between the FPGA and software is another unnecessary time sink for programmers who would rather focus on the high-level functionalities of their applications. Finally, there is little support for building and allocating flexible memory hierarchies on FPGA platforms. All of these problems are further exacerbated by the fact that switching FPGA platforms usually requires the programmer to re-do a significant portion of this work. These are all non-issues for software programmers who live in a world of block and character devices, hardware-managed memory hierarchies with rich memory management libraries, and a plethora of portable communication protocols. We attempt to bridge this gap between platform support for software and FPGA application development by proposing LEAP Virtual Platforms. LEAP (Logic-based Environment for Application Programming) provides an FPGA application with a consistent set of useful services and device abstractions, a memory hierarchy and a flexible communication protocol across a range of FPGA physical platforms. Tying these functionalities together is a modular development and build infrastructure. In this paper we describe the services provided by LEAP and explain how they are implemented using a multi-layered stack of abstractions.
Learning Generative Models with the Up-Propagation Algorithm

Up-propagation is an algorithm for inverting and learning neural network generative models. Sensory input is processed by inverting a model that generates patterns from hidden variables using top-down connections. The inversion process is iterative, utilizing a negative feedback loop that depends on an error signal propagated by bottom-up connections. The error signal is also used to learn the generative model from examples. The algorithm is benchmarked against principal component analysis in experiments on images of handwritten digits.
The changing nature of volunteering and the cross-border mobility: where does learning come from?

This paper revisits the more conventional approaches of volunteering, by looking into the experiences of young people involved in long-term cross-border volunteering in Romania. Drawing on qualitative interviews with European Voluntary Service volunteers, the paper examines how this experience is intersecting their learning trajectories. The research argues that volunteering is more complex than previously assumed and calls for a way to overcome the inertia that positions it as inherently altruistic. It argues that hosting organisations and young people may hold different expectations and notions of volunteering. Whilst organisations seem to understand volunteering as a ‘gift of time’, for young people volunteering is rationally driven and instrumental for learning. The paper argues that cross-border volunteering has a silent educational potential that remains underutilised and grounded in an established rhetoric of learning as inherent when volunteering. Ultimately, the article calls for organisations to be proactive in enhancing their educational potential and to embrace deliberate strategies that support volunteers learning.
Sparse online topic models

Topic models have shown great promise in discovering latent semantic structures from complex data corpora, ranging from text documents and web news articles to images, videos, and even biological data. In order to deal with massive data collections and dynamic text streams, probabilistic online topic models such as online latent Dirichlet allocation (OLDA) have recently been developed. However, due to normalization constraints, OLDA can be ineffective in controlling the sparsity of discovered representations, a desirable property for learning interpretable semantic patterns, especially when the total number of topics is large. In contrast, sparse topical coding (STC) has been successfully introduced as a non-probabilistic topic model for effectively discovering sparse latent patterns by using sparsity-inducing regularization. But, unfortunately STC cannot scale to very large datasets or deal with online text streams, partly due to its batch learning procedure. In this paper, we present a sparse online topic model, which directly controls the sparsity of latent semantic patterns by imposing sparsity-inducing regularization and learns the topical dictionary by an online algorithm. The online algorithm is efficient and guaranteed to converge. Extensive empirical results of the sparse online topic model as well as its collapsed and supervised extensions on a large-scale Wikipedia dataset and the medium-sized 20Newsgroups dataset demonstrate appealing performance.
Multiple Emotion Tagging for Multimedia Data by Exploiting High-Order Dependencies Among Emotions

In this paper, a novel approach of multiple emotional multimedia tagging is proposed, which explicitly models the higher-order relations among emotions. First, multimedia features are extracted from the multimedia data. Second, a traditional multi-label classifier is used to obtain the measurements of the multi-emotion labels. Then, we propose a three-layer restricted Boltzmann machine (TRBM) model to capture the higher-order relations among emotion labels, as well as the relations between labels and measurements . Finally , the TRBM model is used to infer the samples' multi- emotion labels by combining the emotion measurements with the dependencies among multi- emotions . Experimental results on four databases demonstrate that our method is more effective than both feature -driven methods and current model-based methods, which capture the pairwise relations among labels by the Bayesian network (BN). Furthermore , the comparison of BN models and the proposed TRBM model verifies that the patterns captured by the latent units of TRBM contain not only all the dependencies captured by the BN but also many other dependencies that the BN cannot capture.
Academic, social, and general self-concepts of behavioral subgroups of learning disabled children.

This study assessed perceived competence in 60 children, aged 8 to 13 years, who were classified into 4 carefully matched groups: (a) non-learning-disabled (non-LD), non-behavior-disordered, (b) LD, non-behavior-disordered, (c) LD with externalizing symptoms, and (d) LD with externalizing and internalizing symptoms
360-Degree Video Head Movement Dataset

While Virtual Reality applications are increasingly attracting the attention of developers and business analysts, the behaviour of users watching 360-degree (i.e. omnidirectional) videos has not been thoroughly studied yet. This paper introduces a dataset of head movements of users watching 360-degree videos on a Head-Mounted Display (HMD). The dataset includes data collected from 59 users watching five 70 s-long 360-degree videos on the Razer OSVR HDK2 HMD. The selected videos span a wide range of 360-degree content for which different viewer's involvement, thus navigation patterns, could be expected. We describe the open-source software developed to produce the dataset and present the test material and viewing conditions considered during the data acquisition. Finally, we show some examples of statistics that can be extracted from the collected data, for a content-dependent analysis of users' navigation patterns. The source code of the software used to collect the data has been made publicly available, together with the entire dataset, to enable the community to extend the dataset.
Parametric robust inferences for correlated ordinal data

The aim of this article is to provide asymptotically valid likelihood inferences about regression parameters for correlated ordinal response variables. The legitimacy of this novel approach requires no knowledge of the underlying joint distributions so long as their second moments exist. The efficacy of the proposed parametric approach is demonstrated via simulations and the analyses of two real data sets. Copyright © 2008 John Wiley & Sons, Ltd.
The Hungarian version of Listening Span task

Tanulmanyunkban egy olyan neuropszichologiai merőeljarast mutatunk be, amely alkalmas a munkamemoria eletkori valtozasainak vizsgalatara es patologiainak differencialt felterkepezesere. Ez a hallasi mondatterjedelem (Listening Span) teszt, amely az egyik legtobbet hasznalt munkamemoriat merő eljaras az angolszasz nyelvteruleten. Kutatocsoportunk elkeszitette a teszt magyar nyelvű valtozatat, ezzel bővitve a magyar nyelven rendelkezesre allo munkamemoriat merő tesztbatteriat. A hallasi mondatterjedelem teszt legnagyobb előnyei, hogy elődeinel szelesebb celcsoportokban alkalmazhato, peldaul olvasni nem vagy nehezen tudo populacioknal is, valamint az olvasni tudo celcsoportoknal is objektivebb kepet tud adni az emlekezeti kapacitasrol, kikuszobolve az olvasasi kepessegekben mutatkozo egyeni kulonbsegeket. Emellett hasznos segedeszkoz lehet tanulasi nehezsegek azonositasaban es a neuropszichologiai diagnosztikaban. Tanulmanyunkban kozze tesszuk a teljes hallasi mondatterjedelem tesztet es a hozza tartozo norm.
Two-Year Follow-up of Girls Adopted from China: Continuity and Change in Behavioural Adjustment.

BACKGROUND To determine the developmental course of behavioural adjustment in 842 girls adopted from China. METHOD Longitudinal data were collected with the Child Behaviour Checklist (CBCL/1.5-5 or CBCL/6-18) from the same parent with a two-year interval. In data analysis, the entire sample was first treated as a whole, then was divided into three age cohorts, including (1) children who were in preschool ages in both phases (Preschool Cohort) (n = 417, Mage = 2.5 years in Phase I), (2) children who crossed from preschool ages over to school ages (Transition Cohort) (n = 174, Mage = 4.8 years in Phase I), and (3) children who were in school ages in both phases (School-age Cohort) (n = 251, Mage = 8.5 years in Phase I). RESULTS The data revealed a strong behavioural continuity (rs = .57-.75) from Phase I to Phase II. The whole sample experienced a significant increase in both average score and rate of suboptimal adjustment on the CBCL Internalising and Total Problem scale. For children with suboptimal adjustment in Phase I, the odds for them to remain in suboptimal range in Phase II were very high. Repeated measures ANOVA revealed that the three cohorts changed differently over 2 years.
A Study in Function Optimization with the Breeder Genetic Algorithm

Optimization is concerned with the nding of global optima (hence the name) of problems that can be cast in the form of a function of several variables and constraints thereof. Among the searching methods, Evolutionary Algorithms have been shown to be adaptable and general tools that have often outperformed traditional ad hoc methods. The Breeder Genetic Algorithm (BGA) combines a direct representation with a nice conceptual simplicity. This work contains a general description of the algorithm and a detailed study on a collection of function optimization tasks. The results show that the BGA is a powerful and reliable searching algorithm. The main discussion concerns the choice of genetic operators and their parameters, among which the family of Extended Intermediate Recombination (EIR) is shown to stand out. In addition, a simple method to dynamically adjust the operator is outlined and found to greatly improve on the already excellent overall performance of the algorithm.