Abstract
The present study intended to assess flexibility of adolescents of both sexes, involving several body regions and articular groups; to compare males with females, to establish, by factor analyses, inter-tests correlations, in order to obtain explanations of the result in original variables and, to verify which principal components, by reduction of the number of correlated variables, are susceptible to better explain variability. The sample is constituted by 52 subjects (28 females and 24 males), aged between 15 and 18 years. Flexibility assessment battery was formed by eight tests: sit and reach (SA), v-sit and reach (V-SA), stand and reach (FTFP), trunk lift (ET), arm-trunk lift (ETB), side bending (FLT-D e FLTE), shoulder stretch (AMAC-D e AMAC-E) and, bend and reach (AAA). The main results showed, in general, a balance in both sexes as far as the ability to perform wide movements is concerned. There is a strong association: 1) among similar technical characteristic tests, which seems there is no need for cumulative use among these tests, and 2) among those tests that have direct effects on laterality, AMAC-D/AMAC-E (except males) and FLT-D/FLT-E. The AAA test did not correlate with any of the performed tests, particularly in males. Factor analyses of principal components (CP) showed the existence of three components in the female group, with eigenvalues higher than 1, explaining 83,2% of total variance, while in the male group four components were necessary to explain 88,8% of total variability. The tests that were more strongly correlated with each one of principal components were: 1) for males: SA, FTFP, V-SA (CP1), FLT-D, FLT-E (CP2), AMAC-D, AAA (CP3), and ETB, ET (CP4); 2) for females: AAA, FLT-E, AMAC-D, AMAC-E, FTFP (CP1), V-SA, SA, FTFP (CP2), and ETB, ET (CP3).

Abstract
Typically, search engines are low precision in response to a query, retrieving lots of useless web pages, and missing some other important ones. In this paper, we study the problem of the hierarchical clustering of web pages search results. In particular, we propose an architecture called FUSE [1], a meta-search engine that automatically builds clusters of related web pages embodying one meaning of the query. These clusters are then hierarchically organized and labeled with a phrase representing the key concept of the cluster and the corresponding web documents. The system which is a web-based interface (soon available at wise.di.ubi.pt), introduces some interesting new ideas, such as the pre-selection of the retrieved web pages, the capacity to statistically detect phrases within documents and the representation of documents based on their most relevant key concepts by using web content mining techniques. The final step of the system is supported by a graph-based overlapping clustering algorithm which groups the selected documents into a hierarchy of clusters.

Abstract

Abstract
In this paper, we present a hybrid genetic algorithm for a version of the early/tardy scheduling problem in which no unforced idle time may be inserted in a sequence. The chromosome representation of the problem is based on random keys. The genetic algorithm is used to establish the order in which the jobs are initially scheduled, and a local search procedure is subsequently applied to detect possible improvements. The approach is tested on a set of randomly generated problems and compared with existing efficient heuristic procedures based on dispatch rules and local search. The computational results show that this new approach, although requiring slightly longer computational times, is better than the previous algorithms in terms of solution quality.

Abstract
In this paper, we present dominance conditions for the single machine weighted earliness scheduling problem with no idle time. We also propose an algorithm that can be used to improve upper bounds for the weighted earliness criterion and lower bounds for an earliness/tardiness problem. The computational tests show that the algorithm is superior to an initial heuristic schedule and an existing adjacency condition.

Abstract
In this paper, we analyse the effect of using appropriate tie breaking criteria in dispatch rules. We consider four different dispatch procedures, and for each of these heuristics we compare two versions that differ only in the way ties are broken. The first version breaks ties randomly, while the second uses a criterion that incorporates problem-specific knowledge. The computational results show that using adequate tie breaking criteria improves the performance of the dispatch heuristics. The magnitude of the improvement is different for the four heuristics, and also depends on the characteristics of each specific instance. The use of problem-related knowledge for breaking ties should therefore be given some consideration in the implementation of dispatch rules.