نتایج جستجو برای: independent character in short
تعداد نتایج: 17070373 فیلتر نتایج به سال:
Abstract The present studies were aimed at developing the Hungarian version of Short Dark Triad questionnaire (SD3-HU). internal structure translated was examined with confirmatory factor analysis and exploratory structural equation modeling. Then construct concurrent validity tested. obtained results based on a total seven independent samples ( N TOTAL = 2161). While SD3-HU showed inconsistenc...
One of the central issues currently being discussed in world education is character education. Character experiencing disorientation, fading Pancasila values, and shifting life values as a result globalization. This means that needs to be instilled from an early age, especially elementary schools, one which independent The aims this study are analyze implementation strengthening through "market...
abstract cooperative learning refers to small groups of learners working together as a team to solve a problem, complete a task, or accomplish a common goal. in a cooperative environment one’s success is directly related to the success of other members because the focus on the individual shifts towards the group. to test the effectiveness of the method, using jigsaw technique, a study was cond...
abounovas is of unique character who has always stimulates old and new critics to battle against each other as far as each person makes a character for him based on their understanding and special orientation instead of discovering his true character. to recognize his real character ,however, his biography must be reread and to have a correct and real conclusion we have to refer to reliable ...
Iterated hash functions process strings recursively, one character at a time. At each iteration, they compute a new hash value from the preceding hash value and the next character. We prove that iterated hashing can be pairwise independent, but never 3wise independent. We show that it can be almost universal over strings much longer than the number of hash values; we bound the maximal string le...
We presented our system for PAN 2016 Author Clustering task. Our software used simple character n-grams to represent the document collection. We then ran K-Means clustering optimized using the Silhouette Coefficient. Our system yields competitive results and required only a short runtime. Character n-grams can capture a wide range of information, making them effective for authorship attribution...
in this paper we describe how the degrees of the irreducible characters of the affine subgroups of the classical groups under consideration can be found inductively. in [4] gow obtained certain character degrees for all of the affine subgroups of the classical groups. we apply the method of fischer to the above groups and, in addition to the character degrees given in [4], we obtain some new ch...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید