dataesr/scientific-paragraphs-categorization huggingface dataset:
For the images used, we note that the lowest error in non-occluded areas is obtained by SGFD using a small window size (3 × 3) or (5 × 5). In addition, this error always remains lower compared than the errors given by other functions for a large window. Thus, these curves indicate that SGFD is more accurate than other local cost functions and more robust to window size variation. After evaluating the local function, we evaluated our stereo matching algorithm on the Middlebury dataset. This database is used as a de facto standard for comparing stereo matching methods and ranking them according their performance. We started by using version 2 of this database, denoted MV2; it contains only 4 stereo pairs (Tsukuba, Venus, teddy, cones). Results are provided in Tables  1  and 2. We denote the average errors in non-occluded regions  and the average of absolute errors by Avg non-occ and Avg all respectively, while the average of depth discontinuity errors are denoted Avg disc.
middlebury. edu/stereo/eval). Furthermore, we evaluated our stereo matching algorithm on version 3 of the Middlebury benchmark (MV3). This dataset contains 30 stereo pairs: 15 pairs for training and 15 pairs for testing. The images in this database have resolution up to 750 × 500 and a maximal disparity that can reach 200. Evaluation results for MV3 are shown in Table  3. It presents the percentage of bad pixels in non-occluded regions and in all regions (nonocc, all). The errors are calculated for the two regions using thresholds equal to 2 and 4 (Bad2, Bad4). The average absolute error is denoted Avgerr and indicated in the last column. Table  3  summarizes the evaluation results on the training dataset. The obtained results are detailed in Tables 4 and 5, which respectively show the error for each stereo pair on non occluded and all regions.
Approach In a few years, GPUs have become powerful tools for massively parallel intensive computing. They are currently used for several applications including image processing. These applications exploit classical image processing methods implemented on a GPU, typically using a specific language, CUDA, defined by NVIDIA in 2007. There are many predefined functions and libraries for image processing using CUDA language. As our descriptors are based on the Fourier transform, we can exploit the CUFFT library for fast Fourier transform calculation. Our stereo model relies on CUDA for parallel processing, result visualization, and reduction of data transfer costs between CPU memory and GPU memory. This model contains 4 steps: • Loading input images: transfering the stereo pairs from the CPU to GPU memory (host to device).
We evaluated the performance of the algorithms based on three important metrics: the number of millions of disparity computations performed per second (MDE/s), the number of the frames per second (FPS), and the average percentage of bad pixel errors across all test images. Results using accuracy and runtime metrics are indicated in Table  6 , which provides a comparison between our proposed algorithm and other real-time stereo matching methods. Our implementation achieves 38 frames per second, and is more accurate and faster than DCBGrid  [38] , and RealTimeGPU  [39]  based on adaptive cost aggregation and dynamic programming. ReliabilityDP  [40] , using reliability based dynamic programming, produces less accurate results and is slower than our proposed algorithm. Moreover, our approach gives us almost the same accuracy as that Evaluation of our approach on the Middlebury MV3 database requires the calculation of disparity maps for all stereo pairs.
METHODS A systematic review was performed to retrieve information about the global incidence of T1D among those younger than 14 years of age. The study was carried out according to the PRISMA recommendations. For the analysis, the incidence was organized in the periods: 1975-1999 and 2000-2017. We searched the incidence of T1D in the age-groups 0-4, 5-9 and 10-14. We compared the incidences in countries for which information was available for the two periods. We obtained the GDP from the World Bank. We analysed the relationship between the incidence of T1D with the GDP in countries reporting data at the national level.
MATERIALS AND METHODS In this study, we updated the review on the global T1D incidence published by Diaz-Valencia et al  [10]  with new papers. Once the incidence data were obtained through the systematic review, we conducted an exploratory ecological analysis. Following the procedures mentioned by Morgenstern  [11]  for ecological studies, we analysed the relations of population rates of T1D incidence and the average GDP of these countries, retrieved from the World Bank database. This analysis was divided into two periods (1975-1999 and 2000-2017). We extracted information on the incidence of T1D in children under 14 years from population-based studies conducted in clearly defined geographical areas at the local, regional or national level, published in original articles in English, Spanish or French, following the PRISMA recommendations.
The databases used for the literature search were Medline and Thomson Reuters (Web of Knowledge). Additionally, we explored Google Scholar. This study followed the protocol search deposited in the International Prospective of Systematic Reviews with the Registration Number: CRD42012002369. Figure  1  presents the flow diagram of the bibliographic search. During this systematic review, several procedures were standardized to minimize the possibility of incurring biases in the identification of literature, selection and the interpretation of evidence. To reduce potential biases during the design and execution of the systematic review, a team was created; initially, this team was formed by a senior expert researcher (AJV) and a researcher (PAD). During the update of this systematic review, the team consisted of two researchers (NGL and PAD).
Quality assessment The quality of the included studies was evaluated independently by 2 reviewers (NGL-PAD) using the evaluation criteria proposed by Loney et al  [12]  as an external validation. We also implemented an internal quality assessment. The external validation consisted of eight criteria, (1) Was the target population clearly described? (2) Were cases ascertained either by survey of the entire population or by probability sampling? (3) Was the response rate > 70%? (4) Were the non-responders clearly described? (5) Was the sample representative of the population? (6) Were data collection methods standardized? (7) Were validated diagnostic criteria or approaches used to assess the presence/absence of disease? and (8) Were the estimates of incidence given with confidence intervals? An article's score was obtained by adding up the number of criteria it satisfied.
Every satisfied criterion was given 1 point. There was no cut-off score for rating low-quality studies; we arbitrarily considered 0-4, 5-6 and 7-8 points as high, medium and low risk of bias, respectively. The internal validation was based on 5 criteria. (1) The percentage of completeness between primary and secondary sources of registers. A percentage greater than 90 scored a 1, less than 90 scored a 0. 5 and unavailable information scored a 0; (2) Information source: If the data came from the registration of population-based data, it was assigned a 1; if the data came from medical-based records or population denominators it was assigned a 0. 5; and if the source was non-specified, it scored a 0; (3) Data collection: If the cases were collected prospectively (P) or retrospectively (H) was assigned a 1; and if the information was not available, it scored a 0; (4) Clear criterion for diagnosis scored a 1; And (5) if the study was population-based, it scored a 1.
Data collection Two reviewers (Diaz-Valencia PA and Gomez-Lopera N) extracted and reached agreement on the data from included articles using a standard data collection form. We included in this systematic review the most updated and comprehensive data. In each of the articles analysed, we extracted the following information: (1) Identification of the study: Authors, title, journal, year of publication; (2) Period and country of study: Countries were categorized by region according to the United Nations  [13]  ; (3) Geographical coverage of the study: Nationwide (when the study was conducted across the whole nation) or local (when it was restricted to a region, city or geographically defined population); (4) Incidence rates expressed as new cases per 100000 people (both sexes) per year in the age categories 0-4, 5-9, 10-14, and 0-14.
The rates were retrieved from either tables or graphs. If we found incidence values in the graphics, we extracted them using GraphClick  [14]. This program allows the user to automatically retrieve the original data from the x and y coordinates of images. Efforts were made to obtain the value of incidence of T1D for each country at the national level. When no information was retrieved at the national level, local studies were considered. In the database, we identified the level of coverage as national or local; (5)  The incidence information from two periods was searched: The first was between 1975-1999, and the second was between 2000-2017. We based this separation on a bimodal trend observed in the years of the publications identified in the previous systematic review  [10]  ; And (6) We collected the percentage of completeness/ ascertainment when available.
GPD per capita The GDP per capita was used to carry out an exploratory ecologic analysis of the relationship between the change in the incidence of T1D and the differences in socioeconomic levels during two periods (1975-1999 and 2000-2017). The World Bank database  [15]  was used to extract the information for GDP per capita that indicated the relationship between the total value of all the goods and services generated during a year by the economy of a nation or state and the number of its inhabitants in that year. For each study period, we calculated the average of the values of the T1D incidence. In addition, for homogeneity in our analysis, we only chose countries with data at the national level.
RESULTS This systematic review of the literature presented information available at the global level on the incidence of T1D and retrieved data for 84 countries, representing 43. 3% of the 194 countries of the world. We included 35 additional studies from the previous systematic review  [10]. Among these 35 new papers, we retrieved information for 25 countries; some of them reported data at the national and others at the local level (Figure  1 ). Updated studies were identified by superscript letters (a) in Table  1. It was possible to update the information published by Diaz-Valencia et al  [10]  for 21 countries and obtain data for 4 additional countries: Fiji, Turkey, Rwanda and Republic of China (Taiwan). Of the 84 countries, data were collected at the national level for 44 and the local level for 40.
All known works employed FPGA DSP modules for implementation of modular multipliers. However, in our design, no DSP module is used. We estimated the power consumption of these works with the Xilinx power estimator tool. The power consumption shown in Table  3  is calculated based on the FPGA resources used in each work. These include clock frequency, default average fan-out, and considering 100% toggle rate for the DSP modules. We implemented multipliers using LUT resources only, to provide a baseline comparison. In  [10, 13] , fifteen 17-bit × 17-bit multipliers are used to implement a 255-bit modular multiplier. This implementation requires 345 LUT resources for each multiplier. As a comparison, a 64-bit × 64-bit multiplier needs 4256 LUT and a 127-bit × 127-bit multiplier uses 24335 LUTs on a 7-Series Xilinx FPGA.
, 2013; Voigt et al. , 2014) , and therefore, CopraRNA could potentially predict interactions with nontranscribed sequences. Other mRNAs possess very long 5′UTRs (e. g. , ~570 nt for rpoS in E. coli and ~410 nt for sarA in S. aureus). Thus, part of these 5′UTRs is overlooked. In the same vein, the coding sequence beyond the first 100 nt after the first nucleotide of the start codon and the 3′UTR are not taken into account, and some sRNAs are indeed pairing deep in the coding sequence  (Gutierrez et al. , 2013; Lalaouna, Morissette, Carrier, & Massé, 2015; Papenfort, Sun, Miyakoshi, Vanderpool, & Vogel, 2013). Finally, CopraRNA concentrates on protein-coding mRNAs, that is, noncoding transcripts such as other sRNAs or tRNAs are not yet considered. This should not be neglected since interactions between sRNAs (e.
CopraRNA stands in between, each individual prediction covers only a single sRNA, but it is easy to use CopraRNA as a workflow for multiple sRNAs in parallel. CopraRNA can be also used for genetically intractable organisms. Though, the comparative nature of CopraRNA requires that homologs of the respective sRNA are annotated in the sequence databases. Also the evolutionary distance of the respective genomes should be not too close or too far, with the optimal method to compose the best combination of organisms still being a subject of investigation. Finally, in contrast to experimental methods which involve molecular cloning, bacterial growth (at different conditions), RNA extraction, enrichment and processing steps, library preparation, RNA-seq, and bioinformatic data analysis, CopraRNA only requires the genomic information, is free of charge and the results are available within a few hours of computation time.
, 2009) ) could be indirectly copurified when one of the partners was targeted by the MS2-tagged sRNA. Another aspect needs to be considered when using MAPS. The whole operon transcripts are commonly copurified, while CopraRNA and RIL-seq only focus on the localization of the interaction site. Therefore, several candidates identified by MAPS are part of an operon targeted by RyhB (e. g. , iscRSUA or glyW-cysT-leuZ). In most cases, they should be considered as true targets as RyhB pairing commonly induces the decay of the entire transcript. The only exception is the glyW-cysT-leuZ operon, which is the precursor of the 3′ETS leuZ and is not regulated by RyhB  (Lalaouna, Carrier, et al. , 2015).
The performance of both methods regarding known targets is shown in Figure  2a. We also added the genes, which were identified by the differential proteomic analysis in the reference  (Tomasini et al. , 2017)  (Figure  2b ). The Venn diagram in Figure  2b  shows the overlap of the three datasets. Targets that appeared in more than one dataset are of special interest, as they are more likely true targets. Four targets appear in all three datasets. These are the already known mgrA and ssaA2-3 mRNAs, and the so far not independently verified mRNAs encoding the hemolysin α (hly) and the general stress protein YdaG. Functional enrichment  (Huang, Sherman, & Lempicki, 2009)  revealed that the overlapping target set and also the top 200 individual target sets are highly enriched in genes encoding virulence factors and secreted proteins.
14)). The reason for this low enrichment is certainly due to a poor expression of icaADBC operon in tested conditions, as validated by transcriptomic analysis  (Tomasini et al. , 2017). CopraRNA in turn did not predict ssaA2_2 mRNA due to a straightforward reason. Prior to the combination of predictions from different organisms, CopraRNA needs to identify which mRNAs code for homologous proteins. This is done using the DomClust algorithm  (Uchiyama, 2006). The two proteins SsaA2_2 and SsaA_2 are too similar (76. 7% sequence identity) to be assigned to different clusters. In the following, only ssaA_2 with the best predicted interaction energy of -14. 49 kcal/mol, and not ssaA2_2 (-11. 97 kcal/mol), was.
We appreciate the support by the FRIAS-USIAS program to PR and WRH, by the Federal Ministry of Education and Research (BMBF) program de. NBI-Partner grant 031L0106B and grant RNAPronet 031L0164B to WRH, and ANR [ANR-16-CE11-007-01] to PR. This work has been published under the framework of the labEx NetRNA ANR-10-LABX-0036 and of ANR-17-EURE-0023 (to PR) as part of the investments for the future program from the state managed by the French National Research Agency (ANR). The work was also supported by the European Union's Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 753137-SaRNAReg to DL. JG was supported by the DFG (GE 3159/1-1).
Funding information Deutsche Forschungsgemeinschaft , Grant/ Award Number:  GE 3159/1-1 ;  Federal Ministry of Education and Research , Grant/ Award Number: Partner grant  031L0106B  and grant RNAPronet  031L01 ;  FRIAS-USIAS ;  Agence Nationale de la Recherche , Grant/ Award Number:  ANR-16-CE11-007-01 ,  ANR-10-LABX-0036 , ANR-17-EURE-; EuropEuropean Union's  Horizon 2020 research and innovation programme ,  Grant/ Award Number: Marie Skłodowska-Curie Grant  Agreement No. 753137.
, 2014) , assume by default that these tissues, if present, are thick enough (i. e. , thicker than the 2 mm usually considered as a penetration range depth for beta particles) to provide 100% of the external beta dose rate to the enamel. In order to evaluate to which extent this assumption is correct and how it may impact the external beta dose rate absorbed by the enamel layer, we used DosiVox, a Geant4-based software simulating the interactions of particles within a material for dosimetric purposes  (Martin et al. , 2015a). With this software, it is now possible to model more complex geometries like fossil teeth, and we performed several simulations with an outer tissue thickness varying between 0 and 2 mm. Results are presented and discussed hereafter.
MATERIAL AND METHODS Beta dose rate modelling was carried out with DosiVox program (version 1. 04;  Martin et al. , 2015a) , using version 10. 1p01 of Geant4  (Allison et al. , 2016)  and the beta emitter spectra at secular equilibrium from  Guérin (2011)  and  Martin (2015) , which are based on NuDat online database  (version nov. 2009; Kinsey et al. , 1996)  from the NNDC (Brookhaven National Laboratory, USA). With DosiVox, simulations are performed in a three dimensional (3D) grid divided in a series of voxels whose resolution and size may differ along the three axis (see details in  Martin et al. , 2015a). In our study, sample geometry was approximated to the stratified-sediment case presented in  Martin et al. (2015a) : each component (i. e. , sediment and the various dental tissues) was assumed to be a thin layer with homogeneous and isotropic radionuclide distribution.
Finally, each trustee i computes her public key pk i = g dki with associated decryption key dk i = m j=1 s ji and sends pk i to the server, together with a proof of knowledge pok of dk i. This protocol is depicted in Figure  2. The last consistency checks made by the server are omitted and can be found in  [17]. Voting phase The list BB of accepted ballots, the public board, is public and can be accessed at any time. Of course, BB is initially empty. The voting server also displays the election data, namely: the set of verification keys {vk id1 ,. , vk idn }, the public key of the election pk. The voting server initially does not know the link between a verification key and the corresponding voter. It will memorize this link in a private database log. To vote, a voter simply encrypts her vote yielding a ciphertext c = enc(v, pk, r), produces a proof π = proofv(v, r, enc(v, pk, r), pk, vk) that the vote belongs to the set of valid votes, and signs c, yielding a signature s = sign(c, sk).
If it can be proven that no polynomial-time adversary can guess with a non-negligible advantage in which world he is, then the scheme respects privacy. This definition is meant to capture the fact that, besides the result of the election, no other data should leak information about the votes. Verifiability Again, several notions of verifiability have been proposed in the literature, surveyed for example in  [19]. Intuitively, verifiability ensures that votes are correctly reflected in the result of the election. We distinguish between three types of voters: -Honest voters that follow the voting protocol exactly as expected. In particular, they perform the required checks. In Belenios, honest voters are supposed to check that their ballot is included in the (public) ballot box. -Honest voters that do not check.
Source code and system aspects We have written a full implementation of the Belenios protocol following the specification. The current version is 1. 8 and corresponds to the version 1. 6 of the specification (the versioning numbers are independent). The source code is written in OCaml and is regularly checked and updated if necessary to work with the latest version of OCaml. The few non-OCaml dependencies (wget, zip, openssl) are standard tools easily available, for instance in a Debian Linux distribution. The implementation provides a command-line tool called belenios-tool that allows to perform all the algorithmic steps required in the protocol. It can be compiled separately from the other part which contains a web server allowing the deployment of elections. For this web part, the same back-end is called for the algorithmic operations of the protocol, the http server is the OCaml ocsigen server, and the web application is programmed within the eliom OCaml package.
This use of a consistent framework for the whole code of the platform allows to share several parts of the code between the server (for which the OCaml code is compiled to the native machine language of the host) and the web browser on the client side for which the OCaml code is compiled to Javascript. These Javascript clients depend on the classical libraries jsbn and sjcl for low-level big integer arithmetic and cryptographic functions. The command-line program belenios-tool is available as a Debian package, but the web part is not, due to difficulties with some OCaml dependencies within the Debian distribution. The web interface allows an election administrator to setup a new election, in interaction with the registrar and the decryption trustees. She is responsible in providing the list of e-mail addresses of voters, to which a login/password is sent by the server.
The software deployed is exactly the same as the Belenios package that is freely distributed. The additional features that had to be added are the configuration for the network (a reverse proxy) and the e-mail, some backup mechanism, and monitoring and statistics tools. Although the platform is reasonably monitored for suspicious behaviours, we do not provide a strong hardening, for instance against denial of service, and we do not guarantee 24/7 uptime. Therefore, our online platform does not claim the robustness that one could expect for a high stake election.
The verify-diff command takes as input two snapshots of the public data and checks that the second one is a valid future state of the first one. This includes checking that the size of the ballot box is increasing, and more precisely that if a ballot has disappeared, another one has been cast with the same signature key (i. e. someone can re-vote, but the voting server did not drop ballots). This command is also aware of the credential recovery protocol and will check that if the list of verification keys is modified, everything is consistent with the protocol.
Lower limb locomotion activity is of great interest in the field of human activity recognition. In this work, a triplet semi-Markov model-based method is proposed to recognize the locomotion activities of healthy individuals when lower limbs move periodically. In the proposed algorithm, the gait phases (or leg phases) are introduced into the hidden states, and Gaussian mixture density is introduced to represent the complex conditioned observation density. The introduced sojourn state forms the semi-Markov structure, which naturally replicates the real transition of activity and gait during motion. Then, batch mode and on-line Expectation-Maximization (EM) algorithms are proposed, respectively, for model training and adaptive on-line recognition. The algorithm is tested on two datasets collected from wearable inertial sensors.