Miracle-dz/UniFAR-FTUs huggingface dataset:
Assessment of physical fitness in children and adolescents

Existing evidence suggests that physical fitness is an excellent indicator of the health of children and adolescents and is a predictor of health in later life. Furthermore, measuring, assessing and monitoring of physical fitness should be considered a public health priority. Currently in the world there are more than fifteen battery (group) tests for the assessment of physical fitness in children and adolescents. Unlike most European countries which are already applying the EUROFIT battery of tests in schools, or the United States where the FITNESSGRAM battery test is being applied, Serbia lacks a clearly specified and well defined strategy for testing physical fitness in children and adolescents. The obvious problem of testing physical fitness in children and adolescents is the focus of this review. The basic idea is to, by showing the most common battery of tests and the circumstances in which they are incurred and being replaced, clarify the concept and importance of testing, select the components that are necessary to test and propose a valid, reliable and objective group of tests for fitness in children and adolescents. The analysis of the most common groups of tests and new scientific evidence has highlighted the importance of evaluation of the components of health-related fitness. ALPHA-FIT battery tests are proposed in physical education, which were incurred as part of the ALPHA project of the European Union (Assessing Levels of Physical Activity and Fitness).
A Study of Changing Trends in Potential Life-Partner Selection

Marriage is an important institution that upholds societys values. Thus an important decision for any adult is to select appropriate life partner. The definition of appropriateness is largely influenced by cultural norms and values. This research was conducted to study trends in potential mate preference characteristics of the Pakistani population. To attain the aforementioned objective, an archival research was conducted. Data was collected from Sunday matrimonial sections of two most widely read newspapers (Daily Jung and Daily Dawn). Entire data was drawn for 3 decades (i.e., 1980 2009). The requirements for to-be bride and to-be grooms were noted. Result showed that in both newspapers, Physical attractiveness in to-be brides was the top sought feature in three decades, whereas for to-be grooms, working or being educated were the most required traits. It shows that most of the requirements remained same, still few changes were noted within the three decades.
Enhancing Search Performance in Unstructured P2P Networks Based on Users' Common Interest

Peer-to-peer (P2P) networks establish loosely coupled application-level overlays on top of the Internet to facilitate efficient sharing of resources. They can be roughly classified as either structured or unstructured networks. Without stringent constraints over the network topology, unstructured P2P networks can be constructed very efficiently and are therefore considered suitable to the Internet environment. However, the random search strategies adopted by these networks usually perform poorly with a large network size. In this paper, we seek to enhance the search performance in unstructured P2P networks through exploiting users' common interest patterns captured within a probability-theoretic framework termed the user interest model (UIM). A search protocol and a routing table updating protocol are further proposed in order to expedite the search process through self organizing the P2P network into a small world. Both theoretical and experimental analyses are conducted and demonstrated the effectiveness and efficiency of our approach.
Image retrieval via connecting words to salient objects

This paper addresses the problem of connecting words to image objects for efficient image retrieval. Our purpose is to bridge the gap between the user's high-level retrieval semantics and the results obtained from objective models using low-level features. The proposed method uses a novel multi-feature-based diffusion framework to obtain a region-based visual image representation. We focus on exploring the results of psychophysical studies, and propose an assignment of low-level visual features to related adjectives and nouns and connect them to objects by using perceptual clustering. We also determine concepts and categories to create semantic relations. Evaluation of 15,000 natural images shows that more accurate modeling of the user's subjective similarity interpretation, and thus higher retrieval accuracy was achieved by using an additional layer of words representing lower level semantics and also by using various searching modes and options supported by dynamically generated index structures.
Introduction to spectral clustering

Spectral clustering methods are based on graph and matrix theories. Their principle is simple: given some data inputs, build similarity matrix, analyse the spectrum of its Laplacian matrix, and often get a perfect clustering from the eigenvectors analysis. This paper presents an introduction to spectral clustering methods and some applications in signal and image segmentation.
Lexicographically Minimum and Maximum Load Linear Programming Problems

In this paper, we introduce the lexicographically minimum load linear programming problem, and we provide a polynomial approach followed by the proof of correctness. This problem has applications in numerous areas where it is desirable to achieve an equitable distribution or sharing of resources. We consider the application of our technique to the problem of lexicographically minimum load in capacitated multicommodity networks and discuss a special nonlinear case, the so-called Kleinrock load function. We next define the lexicographically maximum load linear programming problem and deduce a similar approach. An application in the lexicographically maximum concurrent flow problem is depicted followed by a discussion on the minimum balance problem as a special case of the lexicographically maximum load problem.
Interpolatory Subdivision on Open Quadrilateral Nets with Arbitrary Topology

A simple interpolatory subdivision scheme for quadrilateral nets with arbitrary topology is presented which generates C1 surfaces in the limit. The scheme satisfies important requirements for practical applications in computer graphics and engineering. These requirements include the necessity to generate smooth surfaces with local creases and cusps. The scheme can be applied to open nets in which case it generates boundary curves that allow a C0‐join of several subdivision patches. Due to the local support of the scheme, adaptive refinement strategies can be applied. We present a simple device to preserve the consistency of such adaptively refined nets.
Computing Observed Autonomous System Relationships in the Internet

Autonomous Systems (ASes) in the Internet use BGP to perform interdomain routing. BGP routing policies are mainly determined by the business relationships between neighboring ASes, which can be classified into three types: provider-tocustomer, peer-to-peer, and sibling-to-sibling. ASes usually do not export provider routes and peer routes to providers or peers. It has been proved that if all ASes conform to this common export policy then all AS paths are valley-free. Since AS relationships are not publicly available, several studies have proposed heuristic algorithms for inferring AS relationships using publicly available BGP data. Most of these algorithms rely on the valley-free property of AS paths. However, not all AS paths are valley-free because some ASes do not conform to the common export policy. As a result, inferred AS relationship are inaccurate. Instead of inferring AS relationships, we propose an algorithm for computing observed AS relationships based on transit relationships between ASes that are revealed by BGP data. We analyze the types of mismatches between observed AS relationships and actual AS relationships and show that the mismatches can be used to identify ASes that violate the common export policy.
A TOE Approach to Establish a Green Supply Chain Adoption Decision Model in the Semiconductor Industry

The green supply chain is an innovation that extends traditional sustainability initiatives to environmental activities in the supply chain and aims to minimize a product’s environmental impact throughout its life cycle. The adoption of a green supply chain involves a complex decision-making process characterized by multiple criteria. The goal of the current study is to construct a decision framework by identifying a comprehensive set of consideration factors and their causal relationships. The consideration factors are deliberately drawn from a variety of different, yet related, theories and are grouped into an extensive Technology-Organization -Environment (TOE) framework. In accordance with the Decision Making Trial and Evaluation Laboratory (DEMATEL) method, the decision framework was analyzed for appropriateness through surveys of selected experts in the semiconductor industry. Because the semiconductor industry has a long history of heavy resource usage and has proven an early advocate of green supply chains, results from this study can provide insights to other firms with similar operations and aims. The contributions of this research are twofold. First, its theoretical contribution consists of integrating previously separate strands of different theories into a holistic framework and exploring the causal relationships among decision factors. Second, its practical contribution lies in its establishment of a strategic path that provides firms a set of priorities when adopting green supply chains.
A Comment on the Hadamard Conjecture

Fix n. Let r(n) denote the largest number r for which there is an r × n (1, −1)-matrix H satisfying the matrix equation HH ⊤ = nIr. The Hadamard conjecture states that for n divisible by 4 we have r(n) = n. Let ǫ > 0. In this paper, we show that the Extended Riemann Hypothesis and recent results on the asymptotic existence of Hadamard matrices imply that for n sufficiently large r(n) > 1 2 − ǫ n. 1. OVERVIEW The following theorem was proved in [4]. Theorem 1.1. There is an absolute positive integer c 1 and an integer N such that for all t > N , we have r(4t) ≥ 4 3 t − 2(2t − 3) 2 3 log c1 (2t − 3). Thus for sufficiently large n = 4t, there is about one third of a Hadamard matrix. Standard arguments (described in [4]) show that for all t > 1, there exists a two level, strength two, orthogonal array OA t (r(4t) − 1, 2) with r(4t) − 1 constraints and index t. Therefore Theorem 1.1 leads to lower bounds on the size of several interesting combinatorial objects. These
Electric vehicles and demand response: an economic perspective

This paper presents a preliminary economic study on the feasibility of using electric vehicles (EVs) to provide demand response, carried out as part of the GREEN Grid project. A mathematical model is developed to track the charge cycle of an EV battery, and this in turn provides estimates of the cost associated with battery life degradation under different scenarios. Three case studies are presented in this paper: the first investigates the potential cost saving for the EV owner by confining the charging of an EV battery to the night tariff period; the second investigates the financial gain associated with regulating the charging of an EV battery based on spot prices; and the third investigates the possible economic benefit for the EV owner of participating in the electricity market by buying energy at low prices and selling at high prices. The first case also includes the situation of just a battery being used to store energy during the night to run a household during the day. Results show that it is most economical to charge an EV during the night (Case 1), but that it varies considerably depending on the region in New Zealand. Regulating the charging rate depending on the spot price (Case 2) provides a small benefit. Using the EV to trade energy (Case 3) is, in most cases, uneconomic given the degradation of battery life. The variation of Case 1 also shows that at current battery costs, it is not economic to store energy during the night for use during the day. Given that there will be other costs associated with these activities, such as the charger equipment capable of both importing and exporting energy from the grid, the economics do not appear to favour use of EVs for demand response provision, except for the case of simply adjusting the time of charging to suit the tariff.
Dynamic of active microorganisms inhabiting a bioleaching industrial heap of low‐grade copper sulfide ore monitored by real‐time PCR and oligonucleotide prokaryotic acidophile microarray

The bioleaching of metal sulfide has developed into a very important industrial process and understanding the microbial dynamic is key to advancing commercial bioleaching operations. Here we report the first quantitative description of the dynamic of active communities in an industrial bioleaching heap. Acidithiobacillus ferrooxidans was the most abundant during the first part of the leaching cycle, while the abundance of Leptospirillum ferriphilum and Ferroplasma acidiphilum increased with age of the heap. Acidithiobacillus thiooxidans kept constant throughout the leaching cycle, and Firmicutes group showed a low and a patchy distribution in the heap. The Acidiphilium‐like bacteria reached their highest abundance corresponding to the amount of autotrophs. The active microorganisms in the leaching system were determined using two RNA‐based sensitive techniques. In most cases, the 16S rRNA copy numbers of At. ferrooxidans, L. ferriphilum, At. thiooxidans and F. acidiphilum, was concomitant with the DNA copy numbers, whereas Acidiphilium‐like bacteria and some Firmicutes members did not show a clear correlation between 16S rRNA accumulation and DNA copy numbers. However, the prokaryotic acidophile microarray (PAM) analysis showed active members of Alphaproteobacteria in all samples and of Sulfobacillus genus in older ones. Also, new active groups such as Actinobacteria and Acidobacterium genus were detected by PAM. The results suggest that changes during the leaching cycle in chemical and physical conditions, such as pH and Fe3+/Fe2+ ion rate, are primary factors shaping the microbial dynamic in the heap.
Probability Structure and Return Period of Multiday Monsoon Rainfall

AbstractThe daily monsoon rainfall data recorded at Subang Airport, Malaysia, from 1960 to 2011 is examined in terms of probability structure for the estimation of extreme daily rainfall precipitation during the Northeast (NE) and Southwest (SW) Malaysian monsoons. The discrete autoregressive and moving average [DARMA(1,1)] model is preferable to the first-order Markov chain [DAR(1)] model. The conditional probabilities of t consecutive rainy days are time dependent. Nevertheless, a simple two-parameter gamma distribution appropriately fits the frequency distribution of multiday rainfall amounts. An algorithm is developed by combining the DARMA(1,1) and gamma models to estimate the return period of multiday rainfall. Extensive comparisons showed that the DARMA(1,1)-gamma model gives a reliable estimate of the return period of rainfall for both NE and SW monsoons at Subang Airport. Furthermore, values generated from the models enable the analysis of the frequency distribution of extreme rainfall events.
A comprehensive comparative evaluation of RST-based summarization methods

Motivated by governmental, commercial and academic interests, and due to the growing amount of information, mainly online, automatic text summarization area has experienced an increasing number of researches and products, which led to a countless number of summarization methods. In this paper, we present a comprehensive comparative evaluation of the main automatic text summarization methods based on Rhetorical Structure Theory (RST), claimed to be among the best ones. We compare our results to superficial summarizers, which belong to a paradigm with severe limitations, and to hybrid methods, combining RST and superficial methods. We also test voting systems and machine learning techniques trained on RST features. We run experiments for English and Brazilian Portuguese languages and compare the results obtained by using manually and automatically parsed texts. Our results systematically show that all RST methods have comparable overall performance and that they outperform most of the superficial methods. Machine learning techniques achieved high accuracy in the classification of text segments worth of being in the summary, but were not able to produce more informative summaries than the regular RST methods.
A test of a multidimensional model of job insecurity: The case of Israeli teachers.

Summary The research reported here adopted a multidimensional approach to studying job insecurity, using Israeli teachers as a case in point. Based on two determinants of job insecurity-unionization and kibbutz affiliation-four distinct employment types were identified: unionized city teachers, unionized kibbutz members, unionized kibbutz hirees, and non-unionized personal contract teachers. The a priori job insecurity status of the four employment types matched the subjective reports of these teachers, supporting the external validity of the job insecurity scale used. The study explored the effect of job insecurity on work attitudes. Results indicated that job insecurity had an adverse effect on organizational commitment, perceived performance, perceived organizational support, intention to quit and resistance to change, supporting predictions in related literature. The results of this study have implications on the management of job insecurity in changing environments.
Examining the relationship between trust and control in IT outsourcing relationships

What is the role of control in maintaining trust in outsourcing relationships? Although the literature is quite rich on conceptualizing the relationship between control and trust in inter-organizational relationships, there exist quite sparse quantitative works which help to evaluate the models developed. In this paper, we analyze data from 156 IT outsourcing relationships of German banks in order to get insights into the actual relationships between different modes of control and the level of relational trust in these relationships. Additionally, we examine the role of service quality (measured in terms of reliability and responsiveness) in this context. The results show that trust is positively related with most modes of control, and that there is indicative evidence that control supports trust in high-service quality situations while it leads to a reduction of trust in relationships suffering from bad service quality (cycle of trust vs. distrust).
Pathways of Transferred Youth Offenders into Adulthood

In this article, the authors discuss the preliminary results of a Belgian research on 210 young offenders transferred to Adult Court in 1999, 2000 and 2001. The long-term judicial pathways of these youngsters, now aged between 30 and 40, are explored. Drawing on the criminal records and detention records of the sample, judicial pathways into adulthood are charted. The results show that the greater part of the sample is still involved in the criminal justice system. More than 50 per cent were convicted at some point in the last 3 years, and almost a third of the population is imprisoned. With this quite unfavourable picture of transferred offenders’ future pathways, we hope to reopen the discussion about transfer policies in Belgium.
Influence of Synchronized Domain Visualizations on Program Comprehension

An effective program comprehension is reached when it is possible to view and relate what happens when the program is executed, synchronized with its effects in the real world concepts. This enables the interconnection of program’s meaning at both problem and program domains. To sustain this statement we need (i) to develop a tool which provides and synchronizes views at both domains, and (ii) to perform an experiment to measure the actual impact of this approach. So, in this working session we aim at discussing the benefits of providing synchronized domain visualizations. We also envisage to discuss the preparation and conduction of appropriate experiments that will test that benefits. A case study will be used and the discussion will be supported by experimental material specially prepared for the occasion, but adapted from material already used in previous experiments.
T‐DNA integration into the Arabidopsis genome depends on sequences of pre‐insertion sites

A statistical analysis of 9000 flanking sequence tags characterizing transferred DNA (T‐DNA) transformants in Arabidopsis sheds new light on T‐DNA insertion by illegitimate recombination. T‐DNA integration is favoured in plant DNA regions with an A‐T‐rich content. The formation of a short DNA duplex between the host DNA and the left end of the T‐DNA sets the frame for the recombination. The sequence immediately downstream of the plant A‐T‐rich region is the master element for setting up the DNA duplex, and deletions into the left end of the integrated T‐DNA depend on the location of a complementary sequence on the T‐DNA. Recombination at the right end of the T‐DNA with the host DNA involves another DNA duplex, 2–3 base pairs long, that preferentially includes a G close to the right end of the T‐DNA.
HiLPR: pretty pictures for pretty complicated (parallel) patterns

Users of parallel patterns need to carefully consider many subtle aspects of software design. In particular, implicit relationships with hardware realities coupled with aggressive strategies for optimization are daunting in this domain. This paper proposes a new way to leverage visual cues in HiLPR, a proposed uniform representation for parallel patterns. We show the application of this approach to three design patterns: Sparse Linear Algebra, Pipeline, and Shared Queue. An evaluation of the combination of a pattern's Forces with its Solution within this representation indicates that this approach holds promise in terms of assisting developers in making better-informed decisions about pattern implementation.
Cost Minimization for Provisioning Virtual Servers in Amazon Elastic Compute Cloud

Amazon Elastic Compute Cloud (EC2) provides a cloud computing service by renting out computational resources to customers (i.e., cloud users). The customers can dynamically provision virtual servers (i.e., computing instances) in EC2, and then the customers are charged by Amazon on a pay-per-use basis. EC2 offers three options to provision virtual servers, i.e., on-demand, reservation, and spot options. Each option has different price and yields different benefit to the customers. Spot price (i.e., price of spot option) could be the cheapest, however, the spot price is fluctuated and even more expensive than the prices of on-demand and reservation options due to supply-and-demand of available resources in EC2. Although the reservation and on-demand options have stable prices, their costs are mostly more expensive than that of spot option. The challenge is how the customers efficiently purchase the provisioning options under uncertainty of price and demand. To address this issue, two virtual server provisioning algorithms are proposed to minimize the provisioning cost for long- and short-term planning. Stochastic programming, robust optimization, and sample-average approximation are applied to obtain the optimal solutions of the algorithms. To evaluate the performance of the algorithms, numerical studies are extensively performed. The results show that the algorithms can significantly reduce the total provisioning cost incurred to customers.