Miracle-dz/UniFAR-FTUs huggingface dataset:
An Automatic Inequality Prover and Instance Optimal Identity Testing

We consider the problem of verifying the identity of a distribution: Given the description of a distribution over a discrete support p = (p<sub>1</sub>, p<sub>2</sub>, . , p<sub>n</sub>), how many samples (independent draws) must one obtain from an unknown distribution, q, to distinguish, with high probability, the case that p = q from the case that the total variation distance (L<sub>1</sub> distance) ||p - q||1≥ ϵ? We resolve this question, up to constant factors, on an instance by instance basis: there exist universal constants c, c' and a function f(p, ϵ) on distributions and error parameters, such that our tester distinguishes p = q from ||p-q||1≥ ϵ using f(p, ϵ) samples with success probability > 2/3, but no tester can distinguish p = q from ||p - q||1≥ c · ϵ when given c' · f(p, ϵ) samples. The function f(p, ϵ) is upperbounded by a multiple of ||p||2/3/ϵ<sup>2</sup>, but is more complicated, and is significantly smaller in some cases when p has many small domain elements, or a single large one. This result significantly generalizes and tightens previous results: since distributions of support at most n have L<sub>2/3</sub> norm bounded by √n, this result immediately shows that for such distributions, O(√n/ϵ<sup>2</sup>) samples suffice, tightening the previous bound of O(√npolylog/n<sup>4</sup>) for this class of distributions, and matching the (tight) known results for the case that p is the uniform distribution over support n. The analysis of our very simple testing algorithm involves several hairy inequalities. To facilitate this analysis, we give a complete characterization of a general class of inequalities- generalizing Cauchy-Schwarz, Holder's inequality, and the monotonicity of L<sub>p</sub> norms. Specifically, we characterize the set of sequences (a)<sub>i</sub> = a<sub>1</sub>, . , ar, (b)i = b<sub>1</sub>, . , br, (c)i = c<sub>1</sub>, . , cr, for which it holds that for all finite sequences of positive numbers (x)<sub>j</sub> = x<sub>1</sub>,. and (y)<sub>j</sub> = y<sub>1</sub>,. ,Π<sub>i=1</sub><sup>r</sup> (Σ<sub>j</sub>x<sup>a</sup><sub>j</sub><sup>i</sup><sub>y</sub><sub>i</sub><sup>b</sup><sup>i</sup>)<sup>ci</sup>≥1. For example, the standard Cauchy-Schwarz inequality corresponds to the sequences a = (1, 0, 1/2), b = (0,1, 1/2), c = (1/2 , 1/2 , -1). Our characterization is of a non-traditional nature in that it uses linear programming to compute a derivation that may otherwise have to be sought throu.gh trial and error, by hand. We do not believe such a characterization has appeared in the literature, and hope its computational nature will be useful to others, and facilitate analyses like the one here.
QCD vacuum structure in strong magnetic fields

We study the response of the QCD vacuum to strong magnetic fields, using a potential model for the quark-antiquark interaction. We find that production of spin-polarized $u\ifmmode \bar{u}\else \={u}\fi{}$ pairs is energetically favorable for fields $Bg{B}_{\mathrm{crit}}\ensuremath{\sim}10 {\mathrm{GeV}}^{2}. $ We contrast the resulting $u\ifmmode \bar{u}\else \={u}\fi{}$ condensate with the quark condensate which is present at zero magnetic field, and we estimate the corresponding magnetization as a function of B.
Efficient discovery of conserved patterns using a pattern graph

MOTIVATION We have previously reported an algorithm for discovering patterns conserved in sets of related unaligned protein sequences. The algorithm was implemented in a program called Pratt. Pratt allows the user to define a class of patterns (e.g. the degree of ambiguity allowed and the length and number of gaps), and is then guaranteed to find the conserved patterns in this class scoring highest according to a defined fitness measure. In many cases, this version of Pratt was very efficient, but in other cases it was too time consuming to be applied. Hence, a more efficient algorithm was needed. RESULTS In this paper, we describe a new and improved searching strategy that has two main advantages over the old strategy. First, it allows for easier integration with programs for multiple sequence alignment and data base search. Secondly, it makes it possible to use branch-and-bound search, and heuristics, to speed up the search. The new search strategy has been implemented in a new version of the Pratt program.
Resolving Spatial Variation And Allowing Spectator Participation In Multiplayer VR

Multiplayer virtual reality (VR) games introduce the problem of variations in the physical size and shape of each user's space for mapping into a shared virtual space. We propose an asymmetric approach to solve the spatial variation problem, by allowing people to choose roles based on the size of their space. We demonstrate this concept through the implementation of a virtual snowball fight where players can choose from multiple roles, namely the shooter, the target, or an onlooker depending on whether the game is played remotely or together in one large space. In the co-located version, the target stands behind an actuated cardboard fort that responds to events in VR, providing non-VR spectators a way to participate in the experience. During preliminary deployment, users showed extremely positive reactions and the spectators were thrilled.
Is functional programming better for modularity?

In 1989 John Hughes published an influential position paper entitled Why Functional Programming Matters. The article extolls the virtues of lazy functional programming by developing several examples: the Newton-Rhapson squares root method, numerical differentiation and integration, and an alpha-beta minimax search. A main conclusion of that work is that higher-order functions and lazy evaluation significantly contribute to modularity. We have found that recent articles from 2010 to 2014 cite Hughes' work as seminal work supporting that functional programming is, in general, good for modularity. We believe this reflects an unstated hypothesis in part of the research community: functional programming is inherently better at modularity than other paradigms such as typical procedural and object-oriented programming. To the best of our knowledge there are no (large-scale) empirical evaluations of this characteristic. We discuss the influence of Why Functional Programming Matters on current beliefs regarding the advantages of functional programming, the recent citations that intrigues us, and provide a small experiment on the GHC Haskell compiler, suggesting the existence of modularity issues in it.
Ciclamilast Ameliorates Adjuvant-Induced Arthritis in a Rat Model

We assessed the effect of a novel and selective phosphodiesterase 4 (PDE4) inhibitor, ciclamilast, on chronic inflammation in adjuvant-induced arthritis (AIA), a rat model of rheumatoid arthritis (RA), and acute inflammation in the rat and mouse model of carrageenan-induced paw edema and peritonitis. Our results showed that daily oral administration of ciclamilast at 1, 3, and 10 mg/kg dose-dependently inhibited the increase in hind paw volume of rats with AIA. The inhibition of paw edema was associated with inhibition of both the production of cytokines such as TNF-α, IL-1β, and IL-6 and cell infiltration assessed in subcutaneous paw tissue. Moreover, there was significantly less tissue destruction in the ciclamilast-treated rats compared to the vehicle-treated rats, as assessed by radiographic analysis and histopathological evaluation. In the two acute inflammation models, ciclamilast inhibited carrageenan-induced paw edema in rats and inflammatory cell migration into the peritoneal cavity in mice in a dose-dependent manner. These results not only suggest that ciclamilast, as a disease-modifying antirheumatic drug (DMARD), can attenuate RA but also provide proof of principle that a PDE4 inhibitor may be useful for the treatment of arthritis.
WebAnno: A Flexible, Web-based and Visually Supported System for Distributed Annotations

We present WebAnno, a general purpose web-based annotation tool for a wide range of linguistic annotations. WebAnno offers annotation project management, freely configurable tagsets and the management of users in different roles. WebAnno uses modern web technology for visualizing and editing annotations in a web browser. It supports arbitrarily large documents, pluggable import/export filters, the curation of annotations across various users, and an interface to farming out annotations to a crowdsourcing platform. Currently WebAnno allows part-ofspeech, named entity, dependency parsing and co-reference chain annotations. The architecture design allows adding additional modes of visualization and editing, when new kinds of annotations are to be supported.
Beta-HPV 5 and 8 E6 Promote p300 Degradation by Blocking AKT/p300 Association

The E6 oncoprotein from high-risk genus alpha human papillomaviruses (α-HPVs), such as HPV 16, has been well characterized with respect to the host-cell proteins it interacts with and corresponding signaling pathways that are disrupted due to these interactions. Less is known regarding the interacting partners of E6 from the genus beta papillomaviruses (β-HPVs); however, it is generally thought that β-HPV E6 proteins do not interact with many of the proteins known to bind to α-HPV E6. Here we identify p300 as a protein that interacts directly with E6 from both α- and β-HPV types. Importantly, this association appears much stronger with β-HPV types 5 and 8-E6 than with α-HPV type 16-E6 or β-HPV type 38-E6. We demonstrate that the enhanced association between 5/8-E6 and p300 leads to p300 degradation in a proteasomal-dependent but E6AP-independent manner. Rather, 5/8-E6 inhibit the association of AKT with p300, an event necessary to ensure p300 stability within the cell. Finally, we demonstrate that the decreased p300 protein levels concomitantly affect downstream signaling events, such as the expression of differentiation markers K1, K10 and Involucrin. Together, these results demonstrate a unique way in which β-HPV E6 proteins are able to affect host-cell signaling in a manner distinct from that of the α-HPVs.
GpH: An Architecture-independent Functional Language

In principle, pure functional languages promise straightforward architecture-independent parallelism. We investigate the validity of this claim in the context of our highly-portable implementation of an implicitly-parallel functional language: the GUM implementation of Glasgow Parallel Haskell (GpH). We discuss architecture independence at two levels: lowlevel (i.e. the implementation) and high-level (i.e. the programmer). Low-level architecture independence is achieved by chosing a message-passing model for GUM, and implementing it using portable C and a widely-supported message-passing library like PVM. In fact GUM is largely independent of the message-passing library, and has been adapted to use MPI and the CM-5 CMMD libraries as well as PVM. As a result, GUM is easily ported, and is currently available on seven platforms including shared-memory machines, distributed-memory machines, and networks of workstations. We provide indicative measurements of how e cient and e ective our architecture-independent runtime system is across a range of architectures. The GpH programming model provides higher-level architecture independence. The parallelism in GpH is mainly implicit, and hence relatively small parts of the program need to be changed for a new architecture. The coordination that is required is expressed with a new high-level construct, evaluation strategies. Evaluation strategies provide a clean separation between algorithm and coordination, easing the task of changing either facet to suit new parallel environments. Moreover, GpH programs can systematically be developed for multiple target architectures, using a suite of simulation, pro ling and visualisation tools. Much of the development is architecture-independent but, once a particular target architecture has been selected, the tools are parameterised to support tuning for that architecture. We demonstrate the systematic development of two real programs to the point of achieving good speedups on four architectures. Index terms Parallel Functional Programming, Architecture-independence Note to referees. The measurements on the seven architectures reported here are very recent, and we hope to analyse them more thoroughly for the nal submission. We also hope to include more measurements, in particular of the Naira compiler on other architectures and parfact on a new AP3000 port.
Crowdsourcing for relevance evaluation

Relevance evaluation is an essential part of the development and maintenance of information retrieval systems. Yet traditional evaluation approaches have several limitations; in particular, conducting new editorial evaluations of a search system can be very expensive. We describe a new approach to evaluation called TERC, based on the crowdsourcing paradigm, in which many online users, drawn from a large community, each performs a small evaluation task.
Performance evaluation of routing protocols for multimedia transmission over mobile ad hoc networks

Mobile ad hoc networks (MANETs) are becoming more essential to wireless communications due to growing popularity of mobile devices. The integration of mobile ad hoc devices inside vehicles has led to another type of networks, called Vehicular Ad hoc Networks (VANETs) which are also becoming important. These networks require specialized routing protocols due to their ad hoc nature. The performance of these protocols has been tested for the case of general traffic but not in respect with to multimedia traffic and especially video transmission. In this paper we conduct a number of simulations in order to evaluate the performance of three of the most popular routing protocols for MANETs and VANETs, namely AODV, DSR and OLSR, for different number of simultaneous video transmissions. We use the packet delivery ratio, the end-to-end delay, the packet delay variation (jitter) and the routing overhead as evaluation metrics. The results indicate that the DSR protocol outperforms AODV and OLSR in terms of end-to-end delay and packet delay variation and seems to be the most efficient routing protocol when multimedia traffic and especially video traffic is considered.
Omani Norms for the Arabic Picture Vocabulary Test (APVT) for Schoolchildren at the Elementary Levels.

The Arabic Picture Vocabulary Test (APVT) was derived from the Peabody Picture Vocabulary Test in order to provide an estimate of a student's acquired verbal ability in Arabic (Modern Standard Arabic) through his or her aural vocabulary. It is an individually administered norm-referenced power test for students aged 5 to 9 plus years. Each item consists of a page of pictures together with a spoken word. The test was expected to be appropriate for the evaluation of Omani children as a measure of verbal ability. Because a pilot study involving 150 Omani students was encouraging, st:ndardization studies were undertaken in 1993 with a representative sample of 1,600 Omani students in grades K through 4. Norms development then began with a careful check of the individual test records. Deviation-type norms and developmental-type norms were derived. Adequate reliability was found, and the concurrent validity of the test for this sample was supported. Cross-validation studies will be ongoing to establish construct validity and enable academic predictions. (Contains 5 tables and 61 references.) (SLD) * Reproductions supplied by EDRS are the best that can be made from the original document. * * U S DEPARTMENT OF EDUCATION OEN. e ol Eau, atronar Research and Impiovement EDUC TIONAL RESOURCES INFORMATION CE N TER (ERIC) Nts document has been reprod144K) as ,ece.veo Irom the person or organtzation ongmahng . 1 t" Mnor changes have been Made to ornotove reproduchon ovet,tz Po.ntS 01 ',I've Or 04. "Ons staled tn INS 00Cu. "-tent do ^01 necessanly represent ofItctal OE Ell Dos.t,on om pohcy *PERMISSION TO REPRODUCE THIS MATERIAL HAS BEEN GRANTED BY To THE EDUCATIOriAL HE',OupcEs INFORMA C.E141ER. TPF. OMANI NORMS FOR THE ARABIC PICTURE VOCABULARY TEST (APVT) FOR SCHOOLCHILDREN AT THE ELEMENTARY LEVELS Salma B. Khammash Sultan Qaboos University Paper presented at the American Educational Research Association Annual Meeting, AERA/SIG International Studies San Francisco, April 22, 1995. RPQr11 Of-1DV A I/ A TT A UT 1 OMANI NORMS FOR THE ARABIC PICTURE VOCABULARY TEST (APVT) FOR SCHOOLCHILDREN AT THE ELEMENTARY ELEVES
Evaluation of the Field Tests of Flexibility of the Lower Extremity: Reliability and the Concurrent and Factorial Validity

Bozic, PR, Pazin, N, Berjan, BB, Planic, NM, and Cuk, ID. Evaluation of the field tests of flexibility of the lower extremity: Reliability, and the concurrent and factorial validity. J Strength Cond Res 24(9): 2523-2531, 2010-The purpose of this study was to evaluate the standard field tests of flexibility of the lower extremity through their (a) intratrial and test-retest reliability, (b) concurrent validity with respect to a high-precision 3D system for kinematic recording, and (c) factorial validity. Physically active men (n = 84) were tested over 2 separate sessions by means of standard simple devices (kinanthropometry, ruler, and protractor) on the following flexibility tests: leg raise in a supine position, hip abduction test, single-legged knee bend (SLKB), sideward leg splits (SdLS), sit and reach (SR), sideways leg splits, and lengthwise leg splits. Additionally, 17 participants were simultaneously tested by means of a laboratory 3D kinematic analysis system. Most of the tests demonstrated high intratrial and test-retest reliability and concurrent validity. The exceptions were SLKB and SR tests that revealed not only a somewhat lower reliability but also a lower concurrent validity. For estimation of factorial validity, we applied a principal component analysis of the intercorrelations among the evaluated flexibility tests that revealed a single extracted principal component. Strong mutual relationships among them also suggest that very few of them, if not a single one, should be applied within the standard batteries of physical performance tests. We particularly recommend using SdLS over the most frequently used SR not only because of its relatively high reliability and validity but also because of its postural properties. Finally, we conclude that most of the standard field tests of flexibility of the lower extremity based on using inexpensive field equipment could be both reliable and valid and, therefore, justified for use in routine testing.
Canonical Source Reconstruction for MEG

We describe a simple and efficient solution to the problem of reconstructing electromagnetic sources into a canonical or standard anatomical space. Its simplicity rests upon incorporating subject-specific anatomy into the forward model in a way that eschews the need for cortical surface extraction. The forward model starts with a canonical cortical mesh, defined in a standard stereotactic space. The mesh is warped, in a nonlinear fashion, to match the subject's anatomy. This warping is the inverse of the transformation derived from spatial normalization of the subject's structural MRI image, using fully automated procedures that have been established for other imaging modalities. Electromagnetic lead fields are computed using the warped mesh, in conjunction with a spherical head model (which does not rely on individual anatomy). The ensuing forward model is inverted using an empirical Bayesian scheme that we have described previously in several publications. Critically, because anatomical information enters the forward model, there is no need to spatially normalize the reconstructed source activity. In other words, each source, comprising the mesh, has a predetermined and unique anatomical attribution within standard stereotactic space. This enables the pooling of data from multiple subjects and the reporting of results in stereotactic coordinates. Furthermore, it allows the graceful fusion of fMRI and MEG data within the same anatomical framework.
General-purpose localization of textured image regions

In computer vision and image processing, we often perform different processing on 'objects' than on 'texture'. In order to do this, we must have a way of localizing textured regions of an image. For this purpose, we suggest a working definition of texture: Texture is a substance that is more compactly represented by its statistics than by specifying the configuration of its parts. Texture, by this definition, is stuff that seems to belong to the local statistics. Outliers, on the other hand, seem to deviate from the local statistics, and tend to draw our attention, or 'pop out'. This definition suggests that to find texture we first extract certain basic features and compute their local statistics. Then we compute a measure of saliency, or degree to which each portion of the image seems to be an outlier to the local feature distribution, and label as texture the regions with low saliency. We present a method, based upon this idea, for labeling points in natural scenes as belonging to texture regions. This method is based upon recent psychophysics results on processing of texture and popout.
Digital games as experiment stimulus

Digital games offer rich media content and engaging action, accessible individually or in groups collaborating or competing against each other. This makes them promising for use as stimulus in research settings. This paper examines the advantages and challenges of using games in experimental research with particular focus on strict stimulus control through the following four areas: (1) matching and regulating task type, (2) data segmentation and event coding, (3) compatibility between participants and (4) planning and conducting data collection. This contribution provides a breakdown of the steps necessary for using a digital game in experimental studies, along with a checklist for researchers illustrating variables that potentially affect the reliability and validity of experiments. We also offer a practical study example. Ideally, the identification of the methodological and practical considerations of employing games in empirical research
Spatial-Resolution Enhancement of SMOS Data: A Deconvolution-Based Approach

A deconvolution-based model has been developed in an attempt to improve the spatial resolution of future soil moisture and ocean salinity (SMOS) data. This paper is devoted to the analysis and evaluation of different algorithms using brightness temperature images obtained from an upgraded version of the SMOS end-to-end performance simulator. Particular emphasis is made on the use of least-square-derived Lagrangian methods on the Fourier and wavelet domains. The possibility of adding suitable auxiliary information in the reconstruction process has also been addressed. Results indicate that, with these techniques, it is feasible to enhance the spatial resolution of SMOS observations by a factor of 1.75 while preserving the radiometric sensitivity simultaneously.
Digital Divide, Social Divide, Paradigmatic Divide

The digital divide is nothing else than the reflection of the social divide in the digital world. The use of ICT for human development does offer opportunities to reduce the social divide for individual beings or communities; yet there exists a series of obstacles to overcome. The very existence of an infrastructure for connectivity is only the first obstacle, although it often receives an exclusive focus, due to the lack of an holistic approach which gives an essential part to digital and information literacy. Telecommunications, hardware and software are predictable prerequisites; however, the true pillars of human-focused information societies are education, ethics, and participation, interacting together as a systemic process. As long as decision makers are not ready to consider these evidences, and keep on favoring a mere technological vision, we will suffer from the most dangerous divide in terms of impact: the paradigmatic divide. Any resemblance to characters, projects, or policies in real life is quite intentional.