Sexism in online video games: The role of conformity to masculine norms and social dominance orientation

Sexism toward women in online video game environments has become a pervasive and divisive issue in the gaming community. In this study, we sought to determine what personality traits, demographic variables, and levels of game play predicted sexist attitudes towards women who play video games. Male and female participants (N = 301) who were players of networked video games were invited to participate in an anonymous online survey. Social dominance orientation and conformity to some types of masculine norms (desire for power over women and the need for heterosexual self-presentation) predicted higher scores on the Video Game Sexism Scale (i.e., greater sexist beliefs about women and gaming). Implications for the social gaming environment and female gamers are discussed.     

The Problematic and Risky Internet Use Screening Scale (PRIUSS) for adolescents and young adults: Scale development and refinement

Problematic Internet Use (PIU) is a growing health concern among adolescents and young adults. The purpose of this mixed-methods study was to develop and refine a theoretically-grounded and psychometrically-validated assessment instrument for PIU specifically tailored to adolescents and young adults. An item pool was developed using concept mapping and a review of the literature, and administered to 714 students from two universities between 18 and 25 years of age. Exploratory and confirmatory factor analyses were used in a development subsample (n = 500) to construct the scale. A cross-validation sample (n = 214) was used to confirm the scale’s reliability. The Problematic and Risky Internet Use Screening Scale (PRIUSS) is an 18-item scale with three subscales: Social Impairment, Emotional Impairment, and Risky/Impulsive Internet Use. Based on its strong theoretical foundation and promising psychometric performance, the PRIUSS may be a valuable tool for screening and prevention efforts in this population.     

Problematic Internet use in British adolescents: An exploration of the addictive symptomatology

Research into online addictions has increased substantially over the last decade, particularly amongst youth. This study adapted the Problematic Internet Entertainment Use Scale for Adolescents [PIEUSA] for use with a British population. The adapted scale was used to (i) validate the instrument for English-speaking adolescent samples, (ii) estimate the prevalence of adolescent online problem users and describe their profile, and (iii) assess the accuracy of the scale’s classification of symptomatology. A survey was administered to 1097 adolescents aged between 11 and 18 years. The results indicated that (i) reliability of the adapted scale was excellent; factor validity showed unidimensionality, and construct validity was adequate. The findings also indicated that (ii) prevalence of online problem users was 5.2% and that they were more likely to younger males that engaged in online gaming for more than two hours most days. The majority of online problem users displayed negative addictive symptoms, especially ‘loss of control’ and ‘conflict’. The adapted scale showed (iii) very good sensitivity, specificity, and classification accuracy, and was able to clearly differentiate between problem and non-problem users. The results suggest certain differences between adolescent and adult online problem users based in the predominance of slightly different psychological components.     

Risk factors associated with online game addiction: A hierarchical model

Online gaming addiction has been increasingly recognized as a mental disorder. However, the predictive factors that lead to online gaming addiction are not well established. The aim of this study was to identify factors that may influence the development of online gaming addiction. A total of 263 patients with problematic online gaming addiction (255 males (97%) and 8 females (3%), age: mean = 20.4 ± 5.8 years) and153 healthy comparison subjects (118 males (77%) and 35 females (23%), age: 21.2 ± 5.5 years, range) were recruited for participation in the current study. Hierarchical logistic regression analyses among each set of variables were conducted. Individual factors (sex and age), cognitive factors (IQ and perseverative errors), psychopathological conditions (ADHD, depression, anxiety, and impulsivity), and social interaction factors (family environment, social anxiety, and self-esteem) were evaluated in a stepwise fashion. All four factors were associated with online gaming addiction, with psychopathological conditions being the strongest risk factors for the addiction. Individual factors, psychological factors, and social interactions were associated with the development of pure online gaming addiction. As before, psychological factors (attention, mood, anxiety and impulsivity) were the strongest risk factors for online gaming addiction in patients with pure online gaming addiction. Psychopathologies, including ADHD and depression, were the strongest factors associated with the development of online gaming addiction in individuals.     

On reliability of the folded hypercubes

In this paper, we explore the 2-extra connectivity and 2-extra-edge-connectivity of the folded hypercube FQ_n. We show that κ₂(FQ_n) = 3n − 2 for n ⩾ 8; and λ₂(FQ_n) = 3n − 1 for n ⩾ 5. That is, for n ⩾ 8 (resp. n ⩾ 5), at least 3n − 2 vertices (resp. 3n − 1 edges) of FQ_n are removed to get a disconnected graph that contains no isolated vertices (resp. edges). When the folded hypercube is used to model the topological structure of a large-scale parallel processing system, these results can provide more accurate measurements for reliability and fault tolerance of the system.     

Curves of Genus 2 with (N,N) Decomposable Jacobians

Let C be a curve of genus 2 and ψ₁: C  −  → E ₁  a map of degree n, from C to an elliptic curveE₁ , both curves defined over C. This map induces a degree n map φ₁:P¹  −  → P ¹  which we call a Frey–Kani covering. We determine all possible ramifications for φ₁. If ψ₁:C  −  → E ₁  is maximal then there exists a maximal map ψ₂: C  −  → E ₂  , of degree n, to some elliptic curveE₂ such that there is an isogeny of degree n²from the JacobianJ_C to E₁ × E₂. We say thatJ_C is (n, n)-decomposable. If the degree n is odd the pair (ψ₂, E₂) is canonically determined. For n =  3, 5, and 7, we give arithmetic examples of curves whose Jacobians are (n, n)-decomposable.     

Highly fault-tolerant cycle embeddings of hypercubes

The hypercube Q_n is one of the most popular networks. In this paper, we first prove that the n-dimensional hypercube is 2n − 5 conditional fault-bipancyclic. That is, an injured hypercube with up to 2n − 5 faulty links has a cycle of length l for every even 4 ⩽ l ⩽ 2ⁿ when each node of the hypercube is incident with at least two healthy links. In addition, if a certain node is incident with less than two healthy links, we show that an injured hypercube contains cycles of all even lengths except hamiltonian cycles with up to 2n − 3 faulty links. Furthermore, the above two results are optimal. In conclusion, we find cycles of all possible lengths in injured hypercubes with up to 2n − 5 faulty links under all possible fault distributions.     

The development and validation of the cyber dating abuse questionnaire among young couples

Cyber dating abuse is a growing phenomenon that has awakened little empirical interest. This study had two objectives: (1) to analyze the psychometric properties of the Cyber Dating Abuse Questionnaire (CDAQ), which is an instrument developed to comprehensively measure this phenomenon; and (2) to conduct an initial analysis of the prevalence and frequency of this type of abuse. The sample consisted of 788 young people between 18 and 30 years of age (77.3% women, mean age = 22.72 years, SD = 4.9). First, exploratory and confirmatory factor analyzes revealed a structure composed of two factors for the scales of victimization and for perpetration: direct aggression (an aggressive act with a deliberate intention to hurt the partner/ex-partner, such as insults or threats) and monitoring/control (the use of electronic means to control the partner/ex-partner; for example, the use of personal passwords). Second, the analysis of the relationship between cyber dating abuse and other variables, such as offline physical and psychological violence and cyberbullying, provided additional evidence for the construct validity of the instrument. Third, the reliability analysis (Cronbach’s alpha) revealed an adequate internal consistency for the scale. Finally, the prevalence of direct aggression was higher than 10%, and the prevalence of control was greater than 70%, which indicate that both types of cyber abuse seem to be common behaviors among young couples. Finally, the contribution of the present study to previous empirical research and future research is discussed.     

Coarse-Grained Parallel Geometric Search

We present a parallel algorithm for solving thenext element search problemon a set of line segments, using a BSP-like model referred to as thecoarse grained multicomputer(CGM). The algorithm requiresO(1) communication rounds (h-relations withh=O(n/p)),O((n/p) log n) local computation, andO((n/p) log p) memory per processor, assumingn/p⩾p. Our result implies solutions to the point location, trapezoidal decomposition, and polygon triangulation problems. A simplified version for axis-parallel segments requires onlyO(n/p) memory per processor, and we discuss an implementation of this version. As in a previous paper by Develliers and Fabri (Int. J. Comput. Geom. Appl.6(1996), 487–506), our algorithm is based on a distributed implementation of segment trees which are of sizeO(n log n). This paper improves onop. cit.in several ways: (1) It studies the more general next element search problem which also solves, e.g., planar point location. (2) The algorithms require onlyO((n/p) log n) local computation instead ofO(log p*(n/p) log n). (3) The algorithms require onlyO((n/p) log p) local memory instead ofO((n/p) log n).     

Well-being and problematic Facebook use

Social networking sites are getting more widespread online communication forms all over the world. Especially adolescents and emerging adults use these sites to make connection, and share something. Although, Facebook is one of the most popular sites, research is still in nascent phase on the excessive use of Facebook. Hence, it is fundamental to determine potential predictors of overuse of Facebook. The present study investigated the relationship between well-being and problematic Facebook use. Participants were 311 university students [179_(58%) female, 132_(42%) male, M_age = 20.86 years, SD = 1.61] who completed the questionnaire packet including the Bergen Facebook Addiction Scale (Andreassen, Torsheim, Brunborg, & Pallesen, 2012), the Satisfaction with Life Scale (Diener, Emmons, Larsen, & Griffin, 1985), the Subjective Vitality Scale (Ryan & Frederick, 1997), the Flourishing Scale (Diener et al., 2010), and the Subjective Happiness Scale (Lyubomirsky & Lepper, 1999). A stepwise regression analyses was used with four independent variables (life satisfaction, subjective vitality, flourishing, and subjective happiness) to explain variance in problematic Facebook use. The results showed that life satisfaction, subjective vitality, flourishing, and subjective happiness were significant negative predictors of problematic Facebook use. The significance and limitations of the results are discussed.     

Sex role stereotyping is hard to kill: A field experiment measuring social responses to user characteristics and behavior in an online multiplayer first-person shooter game

Sex role stereotyping by players in first-person shooter games and other online gaming environments may encourage a social environment that marginalizes and alienates female players. Consistent with the social identity model of deindividuation effects (SIDE), the anonymity of online games may engender endorsement of group-consistent attitudes and amplification of social stereotyping, such as the adherence to gender norms predicted by expectations states theory. A 2 × 3 × 2 virtual field experiment (N = 520) in an online first-person shooter video game examined effects of a confederate players’ sex, communication style, and skill on players’ compliance with subsequent online friend requests. We found support for the hypothesis that, in general, women would gain more compliance with friend requests than men. We also found support for the hypothesis that women making positive utterances would gain more compliance with friend requests than women making negative utterances, whereas men making negative utterances would gain more compliance with friend requests than men making positive utterances. The hypothesis that player skill (i.e., game scores) would predict compliance with friend requests was not supported. Implications for male and female game players and computer-mediated communication in online gaming environments are discussed.     

Internet use and verbal aggression: The moderating role of parents and peers

This research investigated the influence of parent–adolescent communication quality, as perceived by the adolescents, on the relationship between adolescents’ Internet use and verbal aggression. Adolescents (N = 363, age range 10–16, M_T1 = 12.84, SD = 1.93) were examined twice with a six-month delay. Controlling for social support in general terms, moderated regression analyses showed that Internet-related communication quality with parents determined whether Internet use is associated with an increase or a decrease in adolescents’ verbal aggression scores over time. A three way interaction indicated that high Internet-related communication quality with peers can have disadvantageous effects if the communication quality with parents is low. Implications on resources and risk factors related to the effects of Internet use are discussed.     

Hybrid real-coded genetic algorithm for data partitioning in multi-round load distribution and scheduling in heterogeneous systems

Data partitioning and scheduling is one the important issues in minimizing the processing time for parallel and distributed computing system. We consider a single-level tree architecture of the system and the case of affine communication model, for a general m processor system with n rounds of load distribution. For this case, there exists an optimal activation order, optimal number of processors m* (m * ≤ m), and optimal rounds of load distribution n* (n * ≤ n), such that the processing time of the entire processing load is a minimum. This is a difficult optimization problem because for a given activation order, we have to first identify the processors that are participating (in the computation process) in every round of load distribution and then obtain the load fractions assigned to them, and the processing time. Hence, in this paper, we propose a real-coded genetic algorithm (RCGA) to solve the optimal activation order, optimal number of processors m* (m * ≤ m), and optimal rounds of load distribution n* (n * ≤ n), such that the processing time of the entire processing load is a minimum. RCGA employs a modified crossover and mutation operators such that the operators always produce a valid solution. Also, we propose different population initialization schemes to improve the convergence. Finally, we present a comparative study with simple real-coded genetic algorithm and particle swarm optimization to highlight the advantage of the proposed algorithm. The results clearly indicate the effectiveness of the proposed real-coded genetic algorithm.     

Evolution of structure,stability, and nonlinear optical properties of the heterodinuclear CNLin (n = 1–10) clusters

The lowest-energy structures and stabilities of the heterodinuclear clusters, CNLi_n (n = 1–10) and relevant CNLi_n⁺ (n = 1–10) cations, are studied using the density functional theory with the 6-311 + G(3df) basis set. The CNLi₆ and CNLi₅⁺ clusters are the first three-dimensional ones in the CNLi_n^0/+ series, respectively, and the CN group always caps the Li_n^0/+ moiety in the CNLi_n^0/+ (n = 1–9) configurations. The CN triple bond is found to be completely cleaved in the CNLi₁₀^0/+ clusters where the C and N atoms are bridged by two Li atoms. The CNLi_n (n = 2–10) clusters are hyperlithiated molecules with delocalized valence electrons and consequently possess low VIP values of 3.780–5.674 eV. Especially, the CNLi₈ and CNLi₁₀ molecules exhibit lower VIPs than that of Cs atom and can be regarded as heterobinuclear superalkali species. Furthermore, these two superalkali clusters show extraordinarily large first hyperpolarizabilities of 19,423 and 42,658 au, respectively. For the CNLi_n⁺ cationic species, the evolution of the energetic and electronic properties with the cluster size shows a special stability for CNLi₂⁺.     

Conditional fault-tolerant hamiltonicity of star graphs

The star graph possesses many nice topological properties. In this study, we show that for any n-dimensional star graph (n ⩾ 4) with ⩽2n − 7 edge faults in which each node is incident to at least two non-faulty edges, there exists a fault-free Hamiltonian cycle. Compared with the corresponding study in hypercube, our method is rather succinct. Additionally, we also show the probability that an n dimensional star graph with arbitrary 2n − 7 faulty edges at most is Hamiltonian is very close to one.     

Conditional diagnosability of hypercubes under the comparison diagnosis model

Processor fault diagnosis plays an important role in multiprocessor systems for reliable computing, and the diagnosability of many well-known networks has been explored. Lai et al. proposed a novel measure of diagnosability, called conditional diagnosability, by adding an additional condition that any faulty set cannot contain all the neighbors of any vertex in a system. We make a contribution to the evaluation of diagnosability for hypercube networks under the comparison model and prove that the conditional diagnosability of n-dimensional Hypercube Q_n is 3(n ? 2) + 1 for n ? 5. The conditional diagnosability of Q_n is about three times larger than the classical diagnosability of Q_n.     

Generalized Strong Pseudoprime Tests and Applications

We describe probabilistic primality tests applicable to integers whose prime factors are all congruent to 1 mod r where r is a positive integer;r =  2 is the Miller–Rabin test. We show that if ν rounds of our test do not find n ≠  =  (r +  1)²composite, then n is prime with probability of error less than (2 r) ^− ν. Applications are given, first to provide a probabilistic primality test applicable to all integers, and second, to give a test for values of cyclotomic polynomials.     

Fast Constructive Recognition of a Black Box Group Isomorphic toSnorAnusing Goldbach’s Conjecture

The well-known Goldbach Conjecture (GC) states that any sufficiently large even number can be represented as a sum of two odd primes. Although not yet demonstrated, it has been checked for integers up to 10¹⁴. Using two stronger versions of the conjecture, we offer a simple and fast method for recognition of a gray box group G known to be isomorphic to S_n(or A_n) with knownn ≥  20, i.e. for construction1of an isomorphism from G toS_n (or A_n). Correctness and rigorous worst case complexity estimates rely heavily on the conjectures, and yield times of O([ρ + ν + μ ] n log²n) or O([ ρ + ν + μ ] n logn / loglog n) depending on which of the stronger versions of the GC is assumed to hold. Here,ρ is the complexity of generating a uniform random element of G, ν is the complexity of finding the order of a group element in G, and μ is the time necessary for group multiplication in G. Rigorous lower bound and probabilistic approach to the time complexity of the algorithm are discussed in the Appendix.     

On the influence of the number of algorithms,problems, and independent runs in the comparison of evolutionary algorithms

When conducting a comparison between multiple algorithms on multiple optimisation problems it is expected that the number of algorithms, problems and even the number of independent runs will affect the final conclusions. Our question in this research was to what extent do these three factors affect the conclusions of standard Null Hypothesis Significance Testing (NHST) and the conclusions of our novel method for comparison and ranking the Chess Rating System for Evolutionary Algorithms (CRS4EAs). An extensive experiment was conducted and the results were gathered and saved of k = 16 algorithms on N = 40 optimisation problems over n = 100 runs. These results were then analysed in a way that shows how these three values affect the final results, how they affect ranking and which values provide unreliable results. The influence of the number of algorithms was examined for values k = {4, 8, 12, 16}, number of problems for values N = {5, 10, 20, 40}, and number of independent runs for values n = {10, 30, 50, 100}. We were also interested in the comparison between both methods – NHST's Friedman test with post-hoc Nemenyi test and CRS4EAs – to see if one of them has advantages over the other. Whilst the conclusions after analysing the values of k were pretty similar, this research showed that the wrong value of N can give unreliable results when analysing with the Friedman test. The Friedman test does not detect any or detects only a small number of significant differences for small values of N and the CRS4EAs does not have a problem with that. We have also shown that CRS4EAs is an appropriate method when only a small number of independent runs n are available.     

Composing Power Series Over a Finite Ring in Essentially Linear Time

Fix a finite commutative ringR. Letuandvbe power series overR, withv(0) = 0. This paper presents an algorithm that computes the firstnterms of the compositionu(v), given the firstnterms ofuandv, inn^1 + o(1)ring operations. The algorithm is very fast in practice whenRhas small characteristic.