Miracle-dz/UniFAR-FTUs huggingface dataset:
Building a corpus of Italian Web forums: standard encoding issues and linguistic features

This paper describes the creation of a reference corpus of nearly 1200 Web forum posts in Italian. The corpus was created evaluating and customizing a previous proposal for Xml standard encoding; a revised version of the relevant DTD is now proposed as reference for the structural features of Web forum posts and a set of correspondences, with little loss of information, is given for the TEI P5 encoding system. Preliminary results about syntactic features of the language of the posts are also included to sample the linguistic variability of this textual genre. 1 Overview Web forums are, arguably, the most popular interactive textual genre on the web. Current Eurostat surveys show that up to 50% of the citizens of some states of the European Union have posted at least a Web message in the year preceding the interview: this posting is undoubtedly often a forum posting. However, few studies (such as Light and Rogers 1999) have dealt with the linguistic or textual features of the forums or even with more basic facts such as their diffusion. Moreover, there is widespread variety even in the name of the genre. Describing Web forums, secondary literature calls them message boards, discussion boards, discussion groups, conversations, chatgroups, newsgroups and so on (as for classification issues for Web texts, see also Rehm et al. 2008). This variation also seems to push towards the grouping in the literature of many textual genres we find scarcely related from every point of view: Usenet newsgroups of the 1990s lack many of the features now common in Web forum interfaces, and so on. Typical of this attitude are syntheses such as Crystal (2006, pp. 134-177) where a single chapter devoted to “The language of chatgroups” describes both “asynchronous” and “synchronous groups”, with a few lines of specification. In this paper we will instead deal with a very specific textual genre: asyn
Mapping and coding design for channel coded physical-layer network coding

Although BICM can significantly improves the BER performance by iteration processing between the demapping and the decoding in a traditional receiver, its design and performance in PNC system has fewer studied. This paper investigates a bit interleaved coded modulation (BICM) scheme in a Gaussian two-way relay channel operated with physical layer network coding (PNC). In particular, we first present an iterative demapping and decoding framework specially designed for PNC. After that, we compare different constellation mapping schemes in this framework, with the convergence analysis by using the EXIT chart. It is found that the anti-Gray mapping outperforms the Gray mapping, which is the best mapping in the traditional decoding schemes. Finally, the numerical simulation shows the better performance of our framework and verifies the mapping design.
On Adjoints and Singular Value Functions for Nonlinear Systems

The adjoint can be easily described by a state-space realization if the operator �(s) has a finite dimensional state-space realization. In this paper we study the nonlinear extension of such adjoint operators, and apply the results to Hankel theory. Nonlinear adjoint operators can be found in the mathematics literature, e.g. [1], and they are expected to play a similar role in the nonlinear systems theory. So called nonlinear Hilbert adjoint operators are introduced in [5, 11] as a special class of nonlinear adjoint operators. The existence of such operators in an input-output sense was shown in [6], but their state-space realizations are only preliminary available in [4], where the main interest is the Hilbert adjoint extension with an emphasis on the use of port-controlled Hamiltonian system methods. Here, we consider these adjoint operators from a variational point of view and provide a formal justification for the use
Prediction and trace compression of data access addresses through nested loop recognition

This paper describes an algorithm that takes a trace (i.e., a sequence of numbers or vectors of numbers) as input, and from that produces a sequence of loop nests that, when run, produces exactly the original sequence. The input format is suitable for any kind of program execution trace, and the output conforms to standard models of loop nests. The first, most obvious, use of such an algorithm is for program behavior modeling for any measured quantity (memory accesses, number of cache misses, etc.). Finding loops amounts to detecting periodic behavior and provides an explanatory model. The second application is trace compression, i.e., storing the loop nests instead of the original trace. Decompression consists of running the loops, which is easy and fast. A third application is value prediction. Since the algorithm forms loops while reading input, it is able to extrapolate the loop under construction to predict further incoming values. Throughout the paper, we provide examples that explain our algorithms. Moreover, we evaluate trace compression and value prediction on a subset of the SPEC2000 benchmarks.
Fast integer compression using SIMD instructions

We study algorithms for efficient compression and decompression of a sequence of integers on modern hardware. Our focus is on universal codes in which the codeword length is a monotonically non-decreasing function of the uncompressed integer value; such codes are widely used for compressing "small integers". In contrast to traditional integer compression, our algorithms make use of the SIMD capabilities of modern processors by encoding multiple integer values at once. More specifically, we provide SIMD versions of both null suppression and Elias gamma encoding. Our experiments show that these versions provide a speedup from 1.5x up to 6.7x for decompression, while maintaining a similar compression performance.
Does herding behavior affect analysts’ earnings forecasts? A Study of French Listed Firms

This paper examines factors that seem to influence analysts’ forecasts accuracy over the period 1996-2000. We aim to identify superior analysts in terms of forecasting accuracy. First, our analyses show that more accurate analysts are not more experienced nor have a fewer number of firms followed. However more accurate analysts work for larger brokerage houses, issue shorter forecast horizon. Furthermore, analysts who distort their own information and tend to herd provide biased forecasts. Then, we investigate whether analyst experience and /or brokerage’s size attenuate the positive association between herding behaviour and forecast errors. We predict that more experienced and employed by larger brokerages have less incentives to herd. We find a negative and significant association between herding-related-errors and analysts’ experience, but we fail to find evidence of the reduction in the association between herding and forecasts errors as brokerage size increases.
Tools for the Quantitative Analysis of Sedimentation Boundaries Detected by Fluorescence Optical Analytical Ultracentrifugation

Fluorescence optical detection in sedimentation velocity analytical ultracentrifugation allows the study of macromolecules at nanomolar concentrations and below. This has significant promise, for example, for the study of systems of high-affinity protein interactions. Here we describe adaptations of the direct boundary modeling analysis approach implemented in the software SEDFIT that were developed to accommodate unique characteristics of the confocal fluorescence detection system. These include spatial gradients of signal intensity due to scanner movements out of the plane of rotation, temporal intensity drifts due to instability of the laser and fluorophores, and masking of the finite excitation and detection cone by the sample holder. In an extensive series of experiments with enhanced green fluorescent protein ranging from low nanomolar to low micromolar concentrations, we show that the experimental data provide sufficient information to determine the parameters required for first-order approximation of the impact of these effects on the recorded data. Systematic deviations of fluorescence optical sedimentation velocity data analyzed using conventional sedimentation models developed for absorbance and interference optics are largely removed after these adaptations, resulting in excellent fits that highlight the high precision of fluorescence sedimentation velocity data, thus allowing a more detailed quantitative interpretation of the signal boundaries that is otherwise not possible for this system.
Speech parameter generation from HMM using dynamic features

This paper proposes an algorithm for speech parameter generation from HMMs which include the dynamic features. The performance of speech recognition based on HMMs has been improved by introducing the dynamic features of speech. Thus we surmise that, if there is a method for speech parameter generation from HMMs which include the dynamic features, it will be useful for speech synthesis by rule. It is shown that the parameter generation from HMMs using the dynamic features results in searching for the optimum state sequence and solving a set of linear equations for each possible state sequence. We derive a fast algorithm for the solution by the analogy of the RLS algorithm for adaptive filtering. We also show the effect of incorporating the dynamic features by an example of speech parameter generation.
(E)-4-{[2-(2-Furylcarbonyl)hydrazinylidene]methyl}-2-methoxyphenyl acetate

The molecule of the title Schiff base compound, C15H14N2O5, was obtained from a condensation reaction of 4-acetoxy-3-methoxybenzaldehyde and 2-furylcarbonylhydrazide. In the molecule, the furyl ring makes a dihedral angle of 14.63 (10)° with the benzene ring. In the crystal, intermolecular N—H⋯O hydrogen bonds link the molecules into chains along the b axis. Futhermore, weak C—H⋯O interactions connect the chains, forming corrugated layers parallel to (001). The dihedral angle between the rings is 14.63 (10)°.
Value Creation in Multi-Level Networks: A Development of Business Model Theory

Currently, business model theory does not describe how the phenomenon of value co-creation is affected by interactions that span organisational levels in the network. Such interactions include the sharing of customer data and logistical information in addition to exchanges of products and services for cash payment. This paper seeks to develop business model theory to include the business models of networks by incorporating concepts from the value creation systems literature. A theoretical framework is developed to examine how value is exchanged between stakeholders in a network. A value perspective enables the theorisation of what motivates the stakeholders as well as what capabilities they may provide to the network. This framework is use to analyse a multi-level careers guidance network in the UK, to check the sustainability of its network business model. The contribution of this paper is an addition to the literature on network business models, using concepts from the Value Creation Systems literature, and a method for assessing the sustainability of network business models. An analysis of the value-flows between network stakeholders can show how choices of grain, extent and criteria affect the mutual satisfaction of the network’s stakeholders, and hence the sustainability of the network.
Semi-supervised Data Clustering with Coupled Non-negative Matrix Factorization : Sub-category Discovery of Noun Phrases in NELL ’ s Knowledge Base

The standard non-negative matrix factorization (NMF) is a popular method to obtain low-rank approximation of a non-negative matrix, which is also powerful for clustering and classification in machine learning. In NMF each data sample is represented by a vector of features of the same dimension. In practice, we often have good side information for a subset of data samples. These side information might be binary vectors that indicate human provided class labels, or generic vectors in a different feature space. In this paper we propose the coupled non-negative matrix factorization (CNMF) method to automatically incorporate the side information of a subset of data. In CNMF, the matrix for data samples with or without side information in the original feature space and the matrix for data samples with side information in the new feature space are coupled together and iteratively optimized. Because of different qualities of the side information, a trade-off parameter is introduced to determine the importance of the side information, and we give a cross validation method to choose its value. The time complexity of the CNMF method could be several times bigger than the original NMF method, but still in the same order. As an example of implementing the CNMF method, we look into the knowledge base of the CMU Never-Ending Language Learning (NELL) project and find sub-categories of noun phrases.
Simultaneous Avoidance Of Large Squares And Fractional Powers In Infinite Binary Words

In 1976, Dekking showed that there exists an infinite binary word that contains neither squares yy with |y|≥4 nor cubes xxx. We show that 'cube' can be replaced by any fractional power > 5/2. We also consider the analogous problem where '4' is replaced by any integer. This results in an interesting and subtle hierarchy.
Integrating knowledge extracted from biomedical literature : normalization and evidence statements for interactions

This paper reports our approach to three specific tasks of the BioCreAtIvE II challenge: protein interaction sentences (PPI-ISS), protein interaction pairs (PPI-IPS) and gene normalization (GN). Our approach to software engineering and implementation decisions was based on addressing first and foremost the core problem of integrating knowledge extracted from the literature: thus, we saw PPI-ISS as pairing statements of certain characteristics with core facts extracted elsewhere in the document and GN as mapping extracted entities to some standard names. This allows us to focus on generic solutions that can then be gradually refined to solving specific problems. In this same spirit, we developed a text-extraction XML format, a query language for the extraction of information constructs from a parse tree, a prototype extraction system, and a prototype web-based generic evaluation system that were then adapted to BioCreAtIvE. Our approach to the three tasks as well as analysis of results and a brief description of the related technologies developed are included in this report.
Folded standardized time series area variance estimators for simulation

We estimate the variance parameter of a stationary simulation-generated process using "folded" versions of standardized time series area estimators. We formulate improved variance estimators based on the combination of multiple folding levels as well as the use of batching. The improved estimators preserve the asymptotic bias properties of their predecessors but have substantially lower variance. A Monte Carlo example demonstrates the efficacy of the new methodology.
Molecularly Imprinted Nanofiber Film for Sensitive Sensing 2,4,6-Tribromophenol

The determination of brominated flame retardants is of great importance, but remains a challenge. Particularly, universal and facile approaches are limited. Here we report a new general approach, combining molecular imprinting and electrospinning, for the efficient and facile imprinting sensor of 2,4,6-tribromophenol (TBP), which was used as a “novel” brominated flame retardant. With TBP as the template molecular, β-cyclodextrin (β-CD) as the functional monomer, and poly-vinylbutyral (PVB) as the electro-spinning matrix, the nanofiber film was deposited on the glassy carbon electrode (GCE) via electrospinning technique directly. The β-CD-PVB/GCE sensor system exhibited excellent TBP sensing performances, such as a low detection limit (6.29 × 10−10 mol·L−1) at room temperature, selective recognition to TBP/phenol/4-methyl-phenol, and good regeneration performance. The approach of fabricating a molecular imprinting nanofiber sensor may shed new light in the detection of other phenolic pollutants.
High antiviral activity of NS5A inhibitor ABT‐530 with paritaprevir/ritonavir and ribavirin against hepatitis C virus genotype 3 infection

ABT‐530 is a next‐generation hepatitis C virus (HCV) NS5A inhibitor with potent pangenotypic antiviral activity in vitro. Paritaprevir is an NS3/4A protease inhibitor codosed with ritonavir that displays in vitro activity against HCV genotypes 1–4 and 6.
Event-Driven Mobile Computing with Objects

We motivate why event-driven approaches are suitable to address the challenges of mobile and ubiquitous computing. In particular, we describe the beneficial properties of event-based communication in so-called mobile ad hoc networks. However, because contemporary programming languages feature no built-in support for event-driven programming, programmers are often forced to integrate event-driven concepts with a different programming paradigm. In particular, we study the difficulties in combining events with the object-oriented paradigm. We argue that these difficulties form the basis of what we call the objectevent impedance mismatch. We highlight the various issues at the software engineering level and propose to resolve this mismatch by introducing a novel object-oriented programming language that supports event-driven abstractions from the ground up.
LinearDragger: a Linear Selector for One-finger Target Acquisition

Touch input is increasingly popular nowadays, especially for mobile devices such as smartphones and tablet computers. However, the human finger has considerably large fingertip size and finger input is imprecise. As such, acquiring small targets on a touch screen is still a challenging task. In this paper, we present the LinearDragger, a new and integrated one-finger target acquisition technique for small and clustered targets. The proposed method has three advantages. First, it allows users to select targets in dense clustered groups easily with a single touch-drag-release operation. Second, it maps the 2D selection problem into a more precise 1D selection problem, which is independent of the target distribution. Third, it avoids finger occlusion and does not create visual distraction. As a result, it is particularly suitable for applications with dense targets and rich visual elements. Results of our controlled experiments show that when selecting small targets, LinearDragger takes about 70% and 30% less selection time than target acquisition without using any techniques and with the state-of-the-art target acquisition technique that involves a single touch operation, respectively, while maintaining a reasonable error rate.
The Relationship of Physical Activity, Eating Behaviors, and Hunger Control to Weight Loss and Quality of Life in Gastric Banding Patients

THE RELATIONSHIP OF EATING BEHAVIORS, HUNGER CONTROL AND PHYSICAL ACTIVITY TO WEIGHT LOSS AND QUALITY OF LIFE IN GASTRIC BANDING PATIENTS By: Nancy Gott Baugh, RN A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy at Virginia Commonwealth University. Virginia Commonwealth University, 2011 Director: Nancy L. McCain, RN, DSN, FAAN Nursing Alumni Endowed Professor School of Nursing Gastric banding as a weight loss surgery has increased in popularity in the United States since its approval by the Food and Drug Administration in 2001. Successful weight loss after weight loss surgery is most frequently defined as greater than 50% of excess weight loss (EWL). Systematic reviews show that the band is widely effective in achieving successful weight loss in most patients; however, individual studies show more inconsistent outcomes. Weight loss outcomes after gastric banding surgery at Virginia Commonwealth Health System were less than 50% EWL at 1 and 2 years. A retrospective, descriptive study sought to answer the following questions: (a) what is the relationship between physical activity, eating behaviors and hunger control on weight loss and quality of life after gastric banding surgery, and (b) does successful weight loss at 1 year predict successful weight loss at 2 years? Weight loss outcomes at 34.6% at 1 year and 39.7% at 2 years, were less than the established success rate of greater than 50% EWL. However, most patients lost some weight and demonstrated a significant improvement in most domains of health-related quality of life. Participation in physical activity increased between preoperative baseline to year 1 but decreased by 2 years. There was a significant relationship between participation in greater than 150 minutes per week of moderate or vigorous physical activity and adequate weight loss (p = 0.025) and participation in health enhancing physical activities and adequate weight loss (p < 0.05). There was no statistically significant relationship noted between eating behaviors and the percentage of EWL at 1 or 2 years. There was a significant relationship between degree of hunger reported by patients and successful weight loss at 1 year (p < 0.05). In addition, 1-year weight loss is a significant predictor for 2-year weight loss. Based on the findings of this study, it is recommended that gastric banding patients participate in at least 150 minutes per week of moderate to vigorous physical activity. Moreover, an increased focus on early reduction of hunger in the banding patient by development of band adjustment protocols may enhance weight
Optimal cloning and singlet monogamy.

The inability to produce two perfect copies of an unknown state is inherently linked with the inability to produce maximal entanglement between multiple spins. Despite this, there is no quantitative link between how much entanglement can be generated between spins, and how well an unknown state can be cloned. This situation is remedied by giving a set of sufficient conditions such that a Completely Positive map can be optimally implemented as a teleportation operation into a standard, reference, state. The case of arbitrary 1-->N asymmetric cloning of d-dimensional spins can then be solved exactly, yielding the concept of "singlet monogamy. " The utility of this relation is demonstrated by calculating properties of Heisenberg systems, and contrasting them with the results from standard monogamy arguments.
A real-time GPU implementation of the SIFT algorithm for large-scale video analysis tasks

The SIFT algorithm is one of the most popular feature extraction methods and therefore widely used in all sort of video analysis tasks like instance search and duplicate/ near-duplicate detection. We present an efficient GPU implementation of the SIFT descriptor extraction algorithm using CUDA. The major steps of the algorithm are presented and for each step we describe how to efficiently parallelize it massively, how to take advantage of the unique capabilities of the GPU like shared memory / texture memory and how to avoid or minimize common GPU performance pitfalls. We compare the GPU implementation with the reference CPU implementation in terms of runtime and quality and achieve a speedup factor of approximately 3 - 5 for SD and 5 - 6 for Full HD video with respect to a multi-threaded CPU implementation, allowing us to run the SIFT descriptor extraction algorithm in real-time on SD video. Furthermore, quality tests show that the GPU implementation gives the same quality as the reference CPU implementation from the HessSIFT library. We further describe the benefits of GPU-accelerated SIFT descriptor calculation for video analysis applications such as near-duplicate video detection.