Miracle-dz/UniFAR-FTUs huggingface dataset:
High Intensity Interval Training in Handcycling: The Effects of a 7 Week Training Intervention in Able-bodied Men

Introduction: In lower body endurance training, quantities of both moderate intensity continuous training (MICT) and high intensity interval training (HIIT) can lead to an improved physiological capacity and performance. Limited research is available regarding the endurance and muscular capacity of the upper body, and how training contributes to improvements in performance capacity is still unknown. The aim of the current study was to evaluate the effects of HIIT and MICT on the physiological capacity and handcycling performance of able-bodied men in a well-controlled laboratory setting. Methods: Twenty four recreationally active men (22 ± 2 years; 1.84 ± 0.04 m; 79 ± 10 kg) were matched on incremental handcycling pre-test performance (peakPO) and then randomly assigned to HIIT, MICT, or a non-training control group (CON, 3 × n = 8). Participants in HIIT completed 14 interval training sessions, performing 4 × 4 min intervals at 85% heart rate reserve (%HRR), and seven continuous training sessions at 55 %HRR (every 2nd training session of the week). Participants in MICT performed 21 training sessions of 30 min at 55 %HRR. After the intervention, changes in peak oxygen uptake (peakVO2) and peak power output (peakPO) were compared within and between HIIT, MICT and CON. Results: The average external training load per training session did not differ between MICT and HIIT (p = 0.713). Improvements after HIIT in peakVO2 (22.2 ± 8.1%) and peakPO (47.1 ± 20.7%) were significantly larger compared with MICT and CON (p < 0.001). Improvements after MICT in peakVO2 (10.7 ± 12.9%) and peakPO (32.2 ± 8.1%) were higher compared to CON (p < 0.001). Higher improvement after HIIT occurred despite training 22% less time than MICT. No significant changes were found in CON. Discussion: As in lower body endurance sports, HIIT proved to be very effective in improving the physiological and performance capacity of upper body exercise. Whilst physiological capacity in both training groups improved significantly compared with CON, the present study shows that peakVO2 and peakPO improved more after HIIT than after MICT in able-bodied men. It is advised to include HIIT into training regimes of recreational and competitive handcyclists to improve the upper body endurance capacity.
Household Food Insecurity and Its Association with Nutritional Status of Children 6–59 Months of Age in East Badawacho District, South Ethiopia

Background. Ethiopia has one of the highest child malnutrition rates in the world. Food insecurity is one of the determinant factors of malnutrition in developing countries; however its role remains unclear. Objective. To assess household food insecurity and its association with the nutritional status of children 6–59 months of age in East Badawacho District, South Ethiopia. Methods. A community based cross-sectional study was conducted from February 20 to 30, 2014 on a sample of 508 mother/child pairs of 6–59-month-old children. Sample households with eligible children were selected using systematic random sampling technique. Both bivariate and multivariate analysis were used to identify factors associated with nutritional status of children. P value of <0.05 was considered as statistically significant. Result. The prevalence of household food insecurity was 75.8%. The prevalence rates of stunting, underweight, and wasting among children were 45.6%, 26.3%, and 14.6%, respectively. Household food insecurity was significantly associated with underweight (AOR = 3.82; CI = 1.78–8.19) and stunting (AOR = 6.7; CI = 3.71–12.1) but not with wasting. Conclusion and Recommendation. Household food insecurity and the prevalence rates of stunting, underweight, and wasting, among children 6 to 59 months, were high. Intervention programs should focus on improving household food insecurity and nutritional status of children.
Progress-Linked Finance : a study of the feasibility and practicality of a proposed WASH financing approach

This report assesses the feasibility of a financing model, Progress-Linked Finance (PLF), designed to incentivise and support water, sanitation and hygiene (WASH) service providers to meet the needs of poor urban residents in a financially sustainable manner. Under the PLF model, international financing institutions (potentially including multilaterals, bilaterals, and foundations) would enter into commitment agreements with urban WASH service providers, notably utilities and municipalities. In very simple terms, PLF can be summarised as an agreement of the following type: " If the service provider can demonstrate 3 years from now that they have met conditions A, B and C in relation to financial viability and pro-poor commitment and capacity, the financing institution will provide a grant or loan of amount X for WASH scale-up ". In reality, agreements would likely be more complex, for example entailing a series of agreements involving a number of financing institutions. Central to the model is positive incentivisation coupled with rigorous verification that conditions have been met. On the basis of desk analysis and wide-ranging interviews with urban WASH financing experts, this initial assessment finds that the PLF concept is broadly feasible. We explore different variants of PLF, and suggest various ways in which the concept might be put into practice.
A Survey on Machine Learning Techniques to Extract Chemical Names from Text Documents

The chemical name extraction has a great importance in the biomedical field. Named Entity Recognition is the subtask of information extraction that is used to identify named entities in the given data. There are various dictionary-based, rule-based and machine learning approaches available for Named Entity Recognition. Rule based techniques include hand written rules. In this paper an extensive survey of machine learning models such as Hidden Markov Model (HMM), Support Vector Machine (SVM), Conditional Random Fields (CRFs) etc. that are used to develop NER systems is carried out. Keywords— Chemical name extraction, Named Entity, Hidden markov model, Conditional random fields, Feature functions, Support vector machine.
Proof of an Intersection Theorem via Graph Homomorphisms

Let $0 \leq p \leq 1/2 $ and let $\{0,1\}^n$ be endowed with the product measure $\mu_p$ defined by $\mu_p(x)=p^{|x|}(1-p)^{n-|x|}$, where $|x|=\sum x_i$. Let $I \subseteq \{0,1\}^n$ be an intersecting family, i.e. for every $x, y \in I$ there exists a coordinate $1 \leq i \leq n$ such that $x_i=y_i=1$. Then $\mu_p(I) \leq p.$ Our proof uses measure preserving homomorphisms between graphs.
Fully distributed three-tier active software replication

Keeping strongly consistent the state of the replicas of a software service deployed across a distributed system prone to crashes and with highly unstable message transfer delays (e.g., the Internet), is a real practical challenge. The solution to this problem is subject to the FLP impossibility result, and thus there is a need for "long enough" periods of synchrony with time bounds on process speeds and message transfer delays to ensure deterministic termination of any run of agreement protocols executed by replicas. This behavior can be abstracted by a partially synchronous computational model. In this setting, before reaching a period of synchrony, the underlying network can arbitrarily delay messages and these delays can be perceived as false failures by some timeout-based failure detection mechanism leading to unexpected service unavailability. This paper proposes a fully distributed solution for active software replication based on a three-tier software architecture well-suited to such a difficult setting. The formal correctness of the solution is proved by assuming the middle-tier runs in a partially synchronous distributed system. This architecture separates the ordering of the requests coming from clients, executed by the middle-tier, from their actual execution, done by replicas, i.e., the end-tier. In this way, clients can show up in any part of the distributed system and replica placement is simplified, since only the middle-tier has to be deployed on a well-behaving part of the distributed system that frequently respects synchrony bounds. This deployment permits a rapid timeout tuning reducing thus unexpected service unavailability
Emotional competence, behavioural patterning, and executive functions

ABSTRACT The importance of social-emotional competence, executive functioning, and behavioural recognition of patterns by young children is receiving increased attention from researchers, schools, parents, and teachers due to the beneficial outcomes of children who have skills in each. This paper presents studies of the correlations between these variables in the fall and again in the spring of a preschool year, and culminates in a time-lagged comparison of the relationships between these skills during one preschool year. The most clear-cut findings were (1) that there is a successive, but not simultaneous, relation between emotional development and behavioural patterning, and (2) that the ability to inhibit natural responses is a forerunner to emotional development.
Design and expression of a retro doublet of cecropin with enhanced activity

Novel doublet molecules of cecropin A from Drosophila melanogaster were designed and constructed combining the regular (CECdir) with the inverted (CECret) coding sequence of the standard CEC A1 gene resulting in the following configurations: CECdir-CECret and CECretCECdir. These two recombinant molecules were generated using a three-primer driven PCR reaction yielding composite single functional aminoacidic molecules with the coding sequences of CECdir linked in frame with the coding sequence of CECret and vice versa. In order to obtain these constructions, a retropeptide DNA-coding sequence was chemically synthesized to match the expected polarity of the newly generated CECret sequence. Both doublet antimicrobial peptides (drAMPs) were cloned in the T7 promoter
Synconset Waves and Chains: Spiking Onsets in Synchronous Populations Predict and Are Predicted by Network Structure

Synfire waves are propagating spike packets in synfire chains, which are feedforward chains embedded in random networks. Although synfire waves have proved to be effective quantification for network activity with clear relations to network structure, their utilities are largely limited to feedforward networks with low background activity. To overcome these shortcomings, we describe a novel generalisation of synfire waves, and define ‘synconset wave’ as a cascade of first spikes within a synchronisation event. Synconset waves would occur in ‘synconset chains’, which are feedforward chains embedded in possibly heavily recurrent networks with heavy background activity. We probed the utility of synconset waves using simulation of single compartment neuron network models with biophysically realistic conductances, and demonstrated that the spread of synconset waves directly follows from the network connectivity matrix and is modulated by top-down inputs and the resultant oscillations. Such synconset profiles lend intuitive insights into network organisation in terms of connection probabilities between various network regions rather than an adjacency matrix. To test this intuition, we develop a Bayesian likelihood function that quantifies the probability that an observed synfire wave was caused by a given network. Further, we demonstrate it's utility in the inverse problem of identifying the network that caused a given synfire wave. This method was effective even in highly subsampled networks where only a small subset of neurons were accessible, thus showing it's utility in experimental estimation of connectomes in real neuronal-networks. Together, we propose synconset chains/waves as an effective framework for understanding the impact of network structure on function, and as a step towards developing physiology-driven network identification methods. Finally, as synconset chains extend the utilities of synfire chains to arbitrary networks, we suggest utilities of our framework to several aspects of network physiology including cell assemblies, population codes, and oscillatory synchrony.
Optimal Weak-Lensing Skewness Measurements

Weak-lensing measurements are starting to provide statistical maps of the distribution of matter in the universe that are increasingly precise and complementary to cosmic microwave background maps. The most common measurement is the correlation in alignments of background galaxies, which can be used to infer the variance of the projected surface density of matter. This measurement of the fluctuations is insensitive to the total mass content and is analogous to using waves on the ocean to measure its depths. However, when the depth is shallow, as happens near a beach, waves become skewed. Similarly, a measurement of skewness in the projected matter distribution directly measures the total matter content of the universe. While skewness has already been convincingly detected, its constraint on cosmology is still weak. We address optimal analyses for the Canada-France-Hawaii Telescope Legacy Survey in the presence of noise. We show that a compensated Gaussian filter with a width of 2. ′5 optimizes the cosmological constraint, yielding ΔΩm/Ωm ~ 10%. This is significantly better than other filters that have been considered in the literature. This can be further improved with tomography and other sophisticated analyses.
Method of Complex Event Processing over XML Streams

This paper describes a query processing engine for multiple continuous XML data streams with correlated data as a notification mechanism for navigating data exploration. Stream processing, including formal models for stream filtering, union, activation, decomposition, and partition, is formulated in algebraic expressions. In addition, a query language, called QLMXS, over XML streams for complex event processing is described. QLMXS supports all functions of the algebraic expressions in a SQL-like form. QLMXS queries are converted into a visibly pushdown automaton (VPA) that analyzes complex event data from the XML streams. The VPA engine concurrently processes multiple XML data on multiple levels; therefore, it is very important to tune the performance of the engine. Four optimization methods are proposed to improve performance by utilizing VPA and XML features: VPA-state reduction, VPA unification, delayed evaluation, and elimination of unnecessary XML processing. Experimental results demonstrate that VPA unification increases the processing speed of the VPA engine 1.6 times, and the overall processing speed is increased 2.6 times.
Factorization methods for projective structure and motion

This paper describes a family of factorization-based algorithms that recover 3D projective structure and motion from multiple uncalibrated perspective images of 3D points and lines. They can be viewed as generalizations of the Tomasi-Kanade algorithm from affine to fully perspective cameras, and from points to lines. They make no restrictive assumptions about scene or camera geometry, and unlike most existing reconstruction methods they do not rely on 'privileged' points or images. All of the available image data is used, and each feature in each image is treated uniformly. The key to projective factorization is the recovery of a consistent set of projective depths (scale factors) for the image points: this is done using fundamental matrices and epipoles estimated from the image data. We compare the performance of the new techniques with several existing ones, and also describe an approximate factorization method that gives similar results to SVD-based factorization, but runs much more quickly for large problems.
A dyadic floating-point mutation operator of EC

The performance of evolutionary computation (EC) is determined by many parameters among which the mutation operator plays an important role especially for floating-point EC. However, the traditional mutation operation can't effectively keep EC from trapping in local extremum. In order to improve the efficiency of EC, a novel dyadic mutation operator is presented in this paper. Then we take genetic algorithm (GA) as an example to introduce the novel mutation operator in detail. The experimental results based on function optimization show that the improved mutation operator can effectively prevent premature convergence.
Building Response Capacity through Cross-boundary Information Sharing:

Abstract Governments around the world are increasingly turning to information sharing and integration to help solve problems in a wide range of programs and policy areas. These complex interorganizational efforts face not only the technical challenges of many information technology initiatives, but also the difficulties derived from interacting among multiple and diverse organizations. Trust has been identified as one the most important organizational factors for cross-boundary information sharing and integration. However, more research is needed regarding the determinants of trust building in this multi-organizational contexts. This paper highlights the relevant role of trust in cross-boundary information sharing initiatives and provides evidence about three of its most important determinants. Introduction Governments around the world are increasingly turning to information sharing as a lead strategy for developing response capacity for problems in a wide range of programs and policy areas. As information sharing is pursued the complexity of this strategy is becoming clear. Developing cross-boundary information sharing to support government response capacities requires change, in some cases, significant changes in organizational and technological processes. These changes are influenced by specific types of social interaction, which take the form of group decision-making, learning, understanding, trust building, and conflict resolution, among others [1-4]. New research examining the nature of these social interactions and the influence of these interactions on information sharing as a response strategy is called for. Trust building, in particular, is an important social process for developing cross-boundary information sharing among organizations and individuals. Previous research has shown the importance of trust and trust building for cross-boundary information sharing initiatives. Much of this work has focused on the specific risks to trust in an information sharing context. These risks include losing control over highly valued organizational information and knowledge, the possibility that information disclosed is misused against the interest of the organization or individual who made the disclosure, the potential imbalance of the knowledge exchange itself, and the transaction costs and uncertainty associated with the interdependence that may result from cross-boundary information sharing [5]. Little attention, however, has been paid to the determinants of trust in this complex context. This paper expands our current understanding of these determinants and provides a grounded theory of how trust is built in multi-organizational settings. A comparative analysis of four case studies is used to examine this question.
RESEARCH NETWORKS AS INFRASTRUCTURE FOR KNOWLEDGE DIFFUSION IN EUROPEAN REGIONS

This paper concentrates on the role of research network infrastructure in fostering the dissemination of innovation-related knowledge. It examines the structure of collaborative networks and of knowledge transfer between research, innovation and deployment activities in the field of information and communication technology for the European Union as a whole and for several European regions. Research networks complement diffusion networks by providing additional links and by increasing the number of the organisations involved in sharing and exchanging knowledge. Two types of actors are key players in these networks: hubs and gatekeepers. Hubs maintain the bulk of ties in the networks also helping the smaller and more isolated members remain connected. Gatekeepers bridge research and diffusion networks. Such organisations naturally offer greater policy leverage in establishing a European knowledge infrastructure. Moreover, strengthened inter-network connectivity among research and diffusion activities (deployment) would raise the effectiveness of European research in terms of accelerating innovation.
International Conference on Intelligent and Advanced Systems 2007 Design and Synthesis of Akam: a Risc Asynchronous Microprocessor

Asynchronous microprocessors are more flexible to adapt to physical parameters, and have lower power consumption than synchronous microprocessors. In this paper we will introduce the design of an asynchronous microprocessor (V8-uRISC) and explore its design process compared to synchronous design. The processor is synthesized by Persia, an automatic tool for synthesizing asynchronous circuits. We have performed full functional test at various levels of design and synthesis. Our results show that an area overhead is expected for the asynchronous design as the cost for lower power and more robustness.
Codes with unequal locality

In many practical settings, there is a need to design distributed storage codes with certain locality constraints. For a code C, its i-th symbol is said to have locality r if it can be recovered by accessing some other r symbols of C. Locally repairable codes (LRCs) are the family of codes such that every symbol has small locality. In this paper, we focus on LRCs with unequal symbol locality, wherein different symbols of the code have different locality values. First, we consider a class of codes with unequal information locality, i.e., systematic codes with unequal locality constraints imposed only on the information symbols. For this class of codes, we compute a tight upper bound on the minimum distance as a function of locality constraints. We demonstrate that the construction of Pyramid codes by Huang et al. can be adapted to design optimal codes with unequal information locality that achieve the minimum distance bound. Next, we consider codes with unequal all-symbol locality, i.e., codes in which the locality constraints are imposed on all symbols. We establish an upper bound on the minimum distance as a function of number of symbols of each locality value. We show that the construction based on rank-metric codes by Silberstein et al. can be adapted to obtain optimal codes with unequal all-symbol locality. Finally, we introduce the concept of locality requirement of a code, which can be viewed as a recoverability requirement on symbols. Information locality requirement of a code essentially specifies the minimum number of information symbols of each locality value that must be present in the code. For a given locality requirement, we present a greedy algorithm to construct codes that have maximum minimum distance among all codes that satisfy the locality requirement.