8,795 research outputs found

    Measuring Fake News Acumen Using a News Media Literacy Instrument

    Get PDF
    News media literacy education is gaining increased attention in the age of fake news and post-truth America. However, as with any pedagogical goal, it is important to be able to evaluate the success of the delivery. In a survey built on existing news literacy frameworks (Maksl et al., 2015), 1476 students at a large Canadian polytechnic answered questions about their own news literacy, fake news acumen, and news consumption habits. Analysis of the data suggests that conscientious fake-news attitudes and behaviors are correlated with an existing news media literacy scale, providing a method of evaluating the success of fake news education efforts

    Fast algorithm for detecting community structure in networks

    Full text link
    It has been found that many networks display community structure -- groups of vertices within which connections are dense but between which they are sparser -- and highly sensitive computer algorithms have in recent years been developed for detecting such structure. These algorithms however are computationally demanding, which limits their application to small networks. Here we describe a new algorithm which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically thousands of times faster than previous algorithms. We give several example applications, including one to a collaboration network of more than 50000 physicists.Comment: 5 pages, 4 figure

    Exposing errors related to weak memory in GPU applications

    Get PDF
    © 2016 ACM.We present the systematic design of a testing environment that uses stressing and fuzzing to reveal errors in GPU applications that arise due to weak memory effects. We evaluate our approach on seven GPUS spanning three NVIDIA architectures, across ten CUDA applications that use fine-grained concurrency. Our results show that applications that rarely or never exhibit errors related to weak memory when executed natively can readily exhibit these errors when executed in our testing environment. Our testing environment also provides a means to help identify the root causes of such errors, and automatically suggests how to insert fences that harden an application against weak memory bugs. To understand the cost of GPU fences, we benchmark applications with fences provided by the hardening strategy as well as a more conservative, sound fencing strategy

    Finding community structure in very large networks

    Full text link
    The discovery and analysis of community structure in networks is a topic of considerable recent interest within the physics community, but most methods proposed so far are unsuitable for very large networks because of their computational cost. Here we present a hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O(m d log n) where d is the depth of the dendrogram describing the community structure. Many real-world networks are sparse and hierarchical, with m ~ n and d ~ log n, in which case our algorithm runs in essentially linear time, O(n log^2 n). As an example of the application of this algorithm we use it to analyze a network of items for sale on the web-site of a large online retailer, items in the network being linked if they are frequently purchased by the same buyer. The network has more than 400,000 vertices and 2 million edges. We show that our algorithm can extract meaningful communities from this network, revealing large-scale patterns present in the purchasing habits of customers

    Telerobotics: A simulation facility for university research

    Get PDF
    An experimental telerobotics (TR) simulation suitable for studying human operator (H.O.) performance is described. Simple manipulator pick-and-place and tracking tasks allowed quantitative comparison of a number of calligraphic display viewing conditions. A number of control modes could be compared in this TR simulation, including displacement, rate and acceleratory control using position and force joysticks. A homeomorphic controller turned out to be no better than joysticks; the adaptive properties of the H.O. can apparently permit quite good control over a variety of controller configurations and control modes. Training by optimal control example seemed helpful in preliminary experiments. An introduced communication delay was found to produce decrease in performance. In considerable part, this difficulty could be compensated for by preview control information. That neurological control of normal human movement contains a data period of 0.2 second may relate to this robustness of H.O. control to delay. The Ames-Berkeley enhanced perspective display was utilized in conjunction with an experimental helmet mounted display system (HMD) that provided stereoscopic enhanced views

    Differential neuroproteomic and systems biology analysis of spinal cord injury

    Get PDF
    Acute spinal cord injury (SCI) is a devastating condition with many consequences and no known effective treatment. Although it is quite easy to diagnose traumatic SCI, the assessment of injury severity and projection of disease progression or recovery are often challenging, as no consensus biomarkers have been clearly identified. Here rats were subjected to experimental moderate or severe thoracic SCI. At 24h and 7d postinjury, spinal cord segment caudal to injury center versus sham samples was harvested and subjected to differential proteomic analysis. Cationic/anionic-exchange chromatography, followed by 1D polyacrylamide gel electrophoresis, was used to reduce protein complexity. A reverse phase liquid chromatography-tandem mass spectrometry proteomic platform was then utilized to identify proteome changes associated with SCI. Twenty-two and 22 proteins were up-regulated at 24 h and 7 day after SCI, respectively; whereas 19 and 16 proteins are down-regulated at 24 h and 7 day after SCI, respectively, when compared with sham control. A subset of 12 proteins were identified as candidate SCI biomarkers - TF (Transferrin), FASN (Fatty acid synthase), NME1 (Nucleoside diphosphate kinase 1), STMN1 (Stathmin 1), EEF2 (Eukaryotic translation elongation factor 2), CTSD (Cathepsin D), ANXA1 (Annexin A1), ANXA2 (Annexin A2), PGM1 (Phosphoglucomutase 1), PEA15 (Phosphoprotein enriched in astrocytes 15), GOT2 (Glutamic-oxaloacetic transaminase 2), and TPI-1 (Triosephosphate isomerase 1), data are available via ProteomeXchange with identifier PXD003473. In addition, Transferrin, Cathepsin D, and TPI-1 and PEA15 were further verified in rat spinal cord tissue and/or CSF samples after SCI and in human CSF samples from moderate/severe SCI patients. Lastly, a systems biology approach was utilized to determine the critical biochemical pathways and interactome in the pathogenesis of SCI. Thus, SCI candidate biomarkers identified can be used to correlate with disease progression or to identify potential SCI therapeutic targets

    Laser-induced fluorescence studies of HfF+ produced by autoionization

    Get PDF
    Autoionization of Rydberg states of HfF, prepared using the optical-optical double resonance (OODR) technique, holds promise to create HfF+ in a particular Zeeman level of a rovibronic state for an electron electric dipole moment (eEDM) search. We characterize a vibronic band of Rydberg HfF at 54 cm-1 above the lowest ionization threshold and directly probe the state of the ions formed from this vibronic band by performing laser-induced fluorescence (LIF) on the ions. The Rydberg HfF molecules show a propensity to decay into only a few ion rotational states of a given parity and are found to preserve their orientation qualitatively upon autoionization. We show empirically that we can create 30% of the total ion yield in a particular |J+,M+> state and present a simplified model describing autoionization from a given Rydberg state that assumes no angular dynamics.Comment: 8 pages, 5 figure
    corecore