O estudo destaca a necessidade crítica de se focar nas capacidades físicas, motoras e técnicas das jogadoras de esgrima, desenvolvendo e testando metodologias de treino modernas, baseadas na ciência, adaptadas às exigências específicas do desporto. O objetivo do estudo foi avaliar a eficácia do treino tridimensional visando melhorar as capacidades motoras e o desempenho técnico dos participantes. Recorrendo a um desenho experimental, o estudo envolveu a formação de grupos experimentais e de controlo. A amostra incluiu 16 esgrimistas da Faculdade Feminina de Educação Física e Ciências do Desporto. Após a exclusão de dois jogadores durante a fase exploratória, os restantes 14 foram divididos igualmente em grupos experimental e de controlo, cada um composto por sete jogadores. A intervenção envolveu três sessões de treino semanais durante dois meses, num total de 24 sessões. Os testes pré e pós-intervenção revelaram que o treino tridimensional melhorou significativamente as capacidades motoras e o desempenho técnico. Palavras-chave: Treino tridimensional, motricidade, esgrima.
Objective(s): To evaluate students’ communication skills and their academic performance; to compare between the students relative to communication skills and their academic performance in the University of Baghdad and to identify the relationship between students’ communication skills, academic performance and their socio-demographic characteristics of age, gender, grade and socioeconomic status. Methodology: A descriptive design, using the evaluation approach, is carried through the present study to evaluate colleges’ students’ communication skills and their academic performance in the University of Baghdad for the period of January 7th 2019 to August 28th 2019. A non-probability, purposive sample, of (80) university students, i
... Show More
(7)
(4)
The current study aims to investigate the effect of strategic knowledge management practices on an excellent performance at the Institution of Industrial Development and Research- the Ministry of Iraqi Industry (IDRMII). The present research is designed according to the descriptive method. To achieve the mentioned research objective, the researchers used the questionnaire as the main data collection tool. The research sample was 150 managers who are working at the top and middle management levels. To analyses the data gathered and reaching the results, several statistical techniques were used within AMOS.V25, SPSS.V21Software, This study reached a set of results, the most important of which is the existence of a positive correlat
... Show More
Some Results on Fuzzy Zariski
Topology on Spec(J.L)
Antimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct. Where the vertex-weights of a vertex under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph , strong face fan graph , strong face prism graph and finally strong face friendship graph .
The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X , ï´ ) be a topological space, and let A ⊆, then A is called semi-preopen set if ⊆∘ . In this paper, we study the properties of semi-preopen sets but by another definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.
Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show More
(1)
Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.
In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise closure topological spaces, fibrewise wake topological spaces, fibrewise strong topological spaces over B. Also, we introduce the concepts of fibrewise w-closed (resp., w-coclosed, w-biclosed) and w-open (resp., w-coopen, w-biopen) topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.