The aim of this study is to analyze the effect of quality of opposition and game period, considered independently and interactively, on team performance in offensive sequences ending in a shot on goal by a Portuguese professional association football team. A total of 155 offensive sequences were sampled from ten matches involving a team from the Portuguese Premier League during the 2009-2010 se...

The present study aimed to analyze the interaction and main effects of deliberate practice experience and small-sided game format (3 vs. 3 and 6 vs. 6 plus goalkeepers) on the offensive performance of young soccer players. Twenty-eight U-15 male players were divided into 2 groups according to their deliberate practice experience in soccer (i.e., years of experience in federation soccer): Non-Ex...

The question of abusing the opportunity of participatory online journalism through the use of offensive speech has generally been neglected in scholarly research. This study tries to fill this research gap by uncovering the characteristics of offensive speech in comments under online news items as well as journalists’ and editors’ opinions on offensive speech. A textual analysis of comments con...

Let G = (V , E) be a simple graph. For a nonempty set X ⊂ V , and a vertex v ∈ V , δX (v) denotes the number of neighbors v has in X . A nonempty set S ⊂ V is an offensive r-alliance in G if δS(v) ≥ δS̄(v)+ r,∀v ∈ ∂(S), where ∂(S) denotes the boundary of S. An offensive ralliance S is called global if it forms a dominating set. The global offensive r-alliance number of G, denoted by γ o r (G), i...

A global offensive alliance in a graph G = (V,E) is a subset S of V such that for every vertex v not in S at least half of the vertices in the closed neighborhood of v are in S. We give an upper bound on the global offensive alliance number of a graph in terms of its degree sequence. We also study global offensive alliances of random graphs.

A global offensive alliance in a graph G = (V,E) is a subset S of V such that for every vertex v not in S at least half of the vertices in the closed neighborhood of v are in S. We give an upper bound on the global offensive alliance number of a graph in terms of its degree sequence. We also study global offensive alliances of random graphs.

An increasing number of freely accessible adult content websites arose recently, displaying a wide variety of different offensive images and videos. Since many users do not want to be confronted with such material, automatic tools to detect and filter these images and videos are needed. Additionally, tools are required to protect children from accessing offensive websites. This thesis presents ...

Possession time in football has been widely discussed in research but few studies have analyzed the importance of the field area in which possession occurs. The objective of this study was to identify the existence of significant differences in the field zone of ball possession between successful and unsuccessful teams and to acknowledge if the match status modulates the possession model. To th...