Miracle-dz/UniFAR-FTUs huggingface dataset:
Prevalence and predicting factors for anxiety in thai women with abnormal cervical cytology undergoing colposcopy.

AIM To compare prevalence of anxiety in women with abnormal cervical cytology (Pap) undergoing colposcopy to that of women attending the outpatient clinic for check-up and to examine predicting factors. MATERIALS AND METHODS In this cross-sectional analytical study, 100 women with abnormal cervical cytology (abnormal Pap group) and 100 women who attended our outpatient clinic for check-up (control group) were recruited from June 2013 to January 2014. The Hospital Anxiety and Depression Scale (HADS) was employed to determine anxiety in the participants with the score of ≥ 11 suggestive of clinically significant anxiety. The prevalence of anxiety and the mean HADS scores for anxiety were compared between the groups. For those with abnormal Pap, association between clinical factors and anxiety was assessed. A p-value of < 0.05 was considered significant. RESULTS Median age was different between the groups, 44.0 years in the abnormal Pap group and 50.0 years in the control group (p=0.01). The proportion of participants who had more than one sexual partner was higher in the abnormal Pap group, 39.2% vs. 24.7% (p=0.03) and the prevalence of anxiety was significantly higher 14/100 (14.0%) vs. 3/100 (3.0%) (p < 0.01). The prevalence of depression was comparable between the groups. The mean HADS scores for anxiety and depression subscales were significantly higher in the abnormal Pap group, 6.6 vs. 4.8 (P < 0.01) and 3.9 vs. 3.1 (p=0.05), respectively. For the abnormal Pap group, no definite association between clinical factors and anxiety was demonstrated. CONCLUSIONS The prevalence of anxiety in women with abnormal Pap awaiting colposcopy was significantly higher than that of normal controls. Special attention including thorough counselling, with use of information leaflets and psychological support, should be directed to these women.
Streaming Surface Reconstruction Using Wavelets

We present a streaming method for reconstructing surfaces from large data sets generated by a laser range scanner using wavelets. Wavelets provide a localized, multiresolution representation of functions and this makes them ideal candidates for streaming surface reconstruction algorithms. We show how wavelets can be used to reconstruct the indicator function of a shape from a cloud of points with associated normals. Our method proceeds in several steps. We first compute a low‐resolution approximation of the indicator function using an octree followed by a second pass that incrementally adds fine resolution details. The indicator function is then smoothed using a modified octree convolution step and contoured to produce the final surface. Due to the local, multiresolution nature of wavelets, our approach results in an algorithm over 10 times faster than previous methods and can process extremely large data sets in the order of several hundred million points in only an hour.
Diffusion of e-procurement in the public sector - revisiting centralization versus decentralization debates as a twist in the tale

Several governments are in the process of implementing e-procurement. In the process they face several challenges. The diffusion of e-procurement in the Danish public sector is researched using case study research methodology to study the challenges faced. The results of the study are applied in this paper for explaining some of the challenges faced using the legacy centralization versus decentralization debates regarding computing and organization; which forms the tale. These debates in no doubt help in kick starting the research on the diffusion of e-procurement in the public sector. However, the phenomenon under study is complex and unique in several respects that the debates alone are inadequate for fully explaining the challenges. The paper presents a question as the twist in the tale answering which helps in understanding the nature of challenges much better. The question is “To what extent is government a single organization? ”
x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors

Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code, for concurrent data structures, operating system kernels, synchronization libraries, compilers, and so on. However, concurrent programming, which is always challenging, is made much more so by two problems. First, real multiprocessors typically do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, they have relaxed memory models, varying in subtle ways between processor families, in which different hardware threads may have only loosely consistent views of a shared memory. Second, the public vendor architectures, supposedly specifying what programmers can rely on, are often in ambiguous informal prose (a particularly poor medium for loose specifications), leading to widespread confusion. In this paper we focus on x86 processors. We review several recent Intel and AMD specifications, showing that all contain serious ambiguities, some are arguably too weak to program above, and some are simply unsound with respect to actual hardware. We present a new x86-TSO programmer's model that, to the best of our knowledge, suffers from none of these problems. It is mathematically precise (rigorously defined in HOL4) but can be presented as an intuitive abstract machine which should be widely accessible to working programmers. We illustrate how this can be used to reason about the correctness of a Linux spinlock implementation and describe a general theory of data-race freedom for x86-TSO. This should put x86 multiprocessor system building on a more solid foundation; it should also provide a basis for future work on verification of such systems.
Explicit and Implicit Reinforcement Learning Across the Psychosis Spectrum

Motivational and hedonic impairments are core features of a variety of types of psychopathology. An important aspect of motivational function is reinforcement learning (RL), including implicit (i.e., outside of conscious awareness) and explicit (i.e., including explicit representations about potential reward associations) learning, as well as both positive reinforcement (learning about actions that lead to reward) and punishment (learning to avoid actions that lead to loss). Here we present data from paradigms designed to assess both positive and negative components of both implicit and explicit RL, examine performance on each of these tasks among individuals with schizophrenia, schizoaffective disorder, and bipolar disorder with psychosis, and examine their relative relationships to specific symptom domains transdiagnostically. None of the diagnostic groups differed significantly from controls on the implicit RL tasks in either bias toward a rewarded response or bias away from a punished response. However, on the explicit RL task, both the individuals with schizophrenia and schizoaffective disorder performed significantly worse than controls, but the individuals with bipolar did not. Worse performance on the explicit RL task, but not the implicit RL task, was related to worse motivation and pleasure symptoms across all diagnostic categories. Performance on explicit RL, but not implicit RL, was related to working memory, which accounted for some of the diagnostic group differences. However, working memory did not account for the relationship of explicit RL to motivation and pleasure symptoms. These findings suggest transdiagnostic relationships across the spectrum of psychotic disorders between motivation and pleasure impairments and explicit RL.
Investigations into the Roll Pass Design of Channel Section Beams in Conventional Rolling

:هلاقم هصلاخ This paper presents a three dimensional analysis for hot rolling of channel section beams by the finite element method using ABAQUS/Explicit. A complete production line containing ۱۳ passes for forming the section including break-down, intermediate and finishing sequences are modeled, and the exit section of each pass is imported as the entering material for the next pass. The geometry and dimensions of the exit cross section of each stand, separation force, roll torque and the power consumptions in each pass are calculated. The output geometry and work power predicted by the numerical solution were verified by the practical information of Zobahan–Esfahan Company.
Cohort Profile Cohort Profile : The Barwon Infant Study

Cohort Profile: The Barwon Infant Study Peter Vuillermin,* Richard Saffery, Katrina J Allen, John B Carlin, Mimi LK Tang, Sarath Ranganathan, David Burgner, Terry Dwyer, Fiona Collier, Kim Jachno, Peter Sly, Christos Symeonides, Kathleen McCloskey, John Molloy, Michael Forrester and Anne-Louise Ponsonby Barwon Health, Geelong, VIC, Australia, Murdoch Childrens Research Institute, Parkville, VIC, Australia, Deakin University, Geelong, VIC, Australia, University of Melbourne, Parkville, VIC, Australia, Royal Children’s Hospital, Parkville, VIC, Australia, Department of Paediatrics, Monash University, Clayton, VIC, Australia, Murdoch Childrens Research Institute, Royal Children’s Hospital, Melbourne, Victoria, Australia, The George Institute for Global Health, Oxford, United Kingdom and University of Queensland, Queensland Children’s Medical Research Institute, Brisbane, QLD, Australia
Efficient sequential atpg for functional rtl circuits

We present an efficient register-transfer level automatic test pattern generation (ATPG) algorithm. First, our ATPG generates a series of sequential justification and propagation paths for each RTL primitive via a deterministic branch-and-bound search process, called a test environment. Then the precomputed test vectors for the RTL primitives are plugged into the generated test environments to form gate-level test vectors. We augmenta 9-valuedalgebra to efficiently represent the justification and propagation objectives at the RT Level. Our ATPG automatically extracts any finite state machine (FSM) from the circuit, constructs the state transition graph (STG), and uses high-level information to guide the search process. We propose newstatic methodsto identifyembeddedcounterstructures, and we use implication-based techniques and static learning to find the FSM traversal sequences sufficient to control the counters. Finally, a simulation-based RTL extension is added to augment the deterministic test set in a few cases when there is additional room for the improvement in fault coverage. Experimental results show that our new deterministic RTL techniques achieve several orders of magnitude reduction of test generation time without compromising fault coverage when compared to gatelevel ATPG tools. Our ATPG also outperforms a recently reported simulation-based high-level ATPG tool in terms of both fault coverage and CPU time.
Computing a View Frustum to Maximize an Object's Image Area

Abstract This paper presents a method to compute a view frustum for a threedimensional object viewed from a given viewpoint, such that the object is completely enclosed in the frustum and the object's image area is also near-maximal in the given two-dimensional rectangular viewing region. This optimization can be used to improve the resolution of shadow and texture maps for projective texture mapping. Instead of doing the optimization in three-dimensional space to find a good view frustum, our method uses a two-dimensional approach. The basic idea of our approach is as follows. First, from the given viewpoint, a conveniently computed view frustum is used to project the three-dimensional vertices of the object to their corresponding two-dimensional image points. A tight two-dimensional bounding quadrilateral is then computed to enclose these two-dimensional image points. Next, considering the project ive warp between the bounding quadrilateral and the rectangular viewing region, our method applies a technique of camera calibration to compute a new view frustum that generates an image that covers the viewing region as much as possible.
Structural Insight into the Clostridium difficile Ethanolamine Utilisation Microcompartment

Bacterial microcompartments form a protective proteinaceous barrier around metabolic enzymes that process unstable or toxic chemical intermediates. The genome of the virulent, multidrug-resistant Clostridium difficile 630 strain contains an operon, eut, encoding a bacterial microcompartment with genes for the breakdown of ethanolamine and its utilisation as a source of reduced nitrogen and carbon. The C. difficile eut operon displays regulatory genetic elements and protein encoding regions in common with homologous loci found in the genomes of other bacteria, including the enteric pathogens Salmonella enterica and Enterococcus faecalis. The crystal structures of two microcompartment shell proteins, CD1908 and CD1918, and an uncharacterised protein with potential enzymatic activity, CD1925, were determined by X-ray crystallography. CD1908 and CD1918 display the same protein fold, though the order of secondary structure elements is permuted in CD1908 and this protein displays an N-terminal β-strand extension. These proteins form hexamers with molecules related by crystallographic and non-crystallographic symmetry. The structure of CD1925 has a cupin β-barrel fold and a putative active site that is distinct from the metal-ion dependent catalytic cupins. Thin-section transmission electron microscopy of Escherichia coli over-expressing eut proteins indicates that CD1918 is capable of self-association into arrays, suggesting an organisational role for CD1918 in the formation of this microcompartment. The work presented provides the basis for further study of the architecture and function of the C. difficile eut microcompartment, its role in metabolism and the wider consequences of intestinal colonisation and virulence in this pathogen.
VDTest: An Automated Framework to Support Testing for Virtual Devices

The use of virtual devices in place of physical hardware is increasing in activities such as design, testing and debugging. Yet virtual devices are simply software applications, and like all software they are prone to faults. A full system simulator (FSS), is a class of virtual machine that includes a large set of virtual devices – enough to run the full target software stack. Defects in an FSS virtual device may have cascading effects as the incorrect behavior can be propagated forward to many different platforms as well as to guest programs. In this work we present VDTest, a novel framework for testing virtual devices within an FSS. VDTest begins by generat- ing a test specification obtained through static analysis. It then employs a two-phase testing approach to test virtual components both individually and in combination. It lever- ages a differential oracle strategy, taking advantage of the existence of a physical or golden device to eliminate the need for manually generating test oracles. In an empirical study using both open source and commercial FSSs, we found 64 faults, 83% more than random testing.
Distributed prefetching scheme for random seek support in peer-to-peer streaming applications

Through analysis of large volume of user behavior logs during playing multimedia streaming, we extract a user viewing pattern. The pattern indicates that random seek is a pervasive phenomenon, contrary to the common assumptions that users would watch a video session sequentially and passively in most works on peer-to-peer streaming. We propose to use efficient prefetching to facilitate the random seek functionality. Because of the statistical nature of the user viewing pattern and the ignorance of the users to the content, we argue that the pattern should be used as a guidance to the random seek. Based on the pattern, we set up an analogy between the optimization problem of minimizing the seeking distance and the optimal scalar quantization problem. We then propose an optimal prefetching scheduling algorithm based on the optimal scalar quantization theory. We further propose a hierarchical prefetching scheme to carry out the prefetching more effectively. Real user viewing logs are used to drive the simulations which demonstrate that the proposed prefetching scheduling algorithm and the hierarchical prefetching scheme can improve the seeking performance significantly.
Action Dominates Valence in Anticipatory Representations in the Human Striatum and Dopaminergic Midbrain

The acquisition of reward and the avoidance of punishment could logically be contingent on either emitting or withholding particular actions. However, the separate pathways in the striatum for go and no-go appear to violate this independence, instead coupling affect and effect. Respect for this interdependence has biased many studies of reward and punishment, so potential action–outcome valence interactions during anticipatory phases remain unexplored. In a functional magnetic resonance imaging study with healthy human volunteers, we manipulated subjects' requirement to emit or withhold an action independent from subsequent receipt of reward or avoidance of punishment. During anticipation, in the striatum and a lateral region within the substantia nigra/ventral tegmental area (SN/VTA), action representations dominated over valence representations. Moreover, we did not observe any representation associated with different state values through accumulation of outcomes, challenging a conventional and dominant association between these areas and state value representations. In contrast, a more medial sector of the SN/VTA responded preferentially to valence, with opposite signs depending on whether action was anticipated to be emitted or withheld. This dominant influence of action requires an enriched notion of opponency between reward and punishment.
Body Image Perception in Mexican University Athletes VS Non-Athletes

The objective of this study consisted in determining the differences and similarities among Mexican University students who practice a sport on a regular basis with those who do not do, concerning their body image perception to their actual, ideal, social and body size dissatisfaction. A total sample of 304 male University students, aged 18-29 years participated in this study; 146 of them practice a sport and participate regularly in a tournament or competition. A quantitative approach with a descriptive and transversal survey design was used. All the participants completed the Contour Drawing Rating Scale adapted and computerized by [1]. The results of the one-way multivariate analysis of variance, followed by the one-way univariate analyses of variance, show that university students who don’t participate in a regular sport are the ones who show thicker models for their present, ideal and social figure, in addition to demonstrating higher body size dissatisfaction. Further research should reply these findings in larger samples.
Reactivation of a Dormant Representation of an Auditory Stimulus Feature

Research with the mismatch negativity component of event-related potentials has uncovered a system that detects change in the acoustic environment on an automatic basis. The system is considered to compare incoming stimuli to representations of the past and to emit an MMN if change is detected. Previous investigations have shown that the relevant memory of the past can become dormant and then be reactivated by a reminder stimulus. It is unclear, however, whether what is reactivated is an holistic representation of stimuli or separate representations of features of stimuli. The present study provides data that supports the latter possibility but leaves open the former one.
Clustering dialects automatically: A mutual information approach

Dialects can be categorized in many ways. Using external features, dialects may be grouped by geographic location (e.g. Irish English), ethnic identity (e.g. AAVE), or social networks (e.g. Liberian Settler English) of their speakers. Or, using internal features, dialects may be grouped by shared features of pronunciation, vocabulary, or grammar. We explore quantitative approaches to see how similarly dialects cluster by these different methods. We describe a method of clustering dialects according to patterns of shared phonological features. While previous linguistic research has generally considered such phonological features as independent of each other, we examine their statistical co-variation. That is, we look at the degree to which variation in one feature predicts variation in each other feature, or Mutual Information (MI). As an example, we look at the degree to which we can predict whether a dialect will exhibit the cot/caught merger based on knowledge of whether they vocalize /r/ in the word barn. Within phonological theory, these variables are independent of each other, but they do exhibit statistical dependence. To test our method, we explore a data set consisting of 168 binary features describing the pronunciation of vowels and consonants of English speakers from 35 countries and regions. This is a subset of the data collected for the Handbook of Varieties of English (Schneider et al. 2005). These dialects are grouped according to patterns of shared features. The results of this method of categorizing dialect varieties by binary pronunciation features are compared to traditional groupings based on external features. In many ways, the clusters produced by this method are similar. We also compare differences in clustering outcomes determined by phonological vs. morphosyntactic features, as well as differences that depend on the method of clustering. 1
On the Feasibility of Codebook-Based Beamforming in Millimeter Wave Systems With Multiple Antenna Arrays

The use of the millimeter (mm) wave spectrum for next generation (5G) mobile communication has gained significant attention recently. The small carrier wavelengths at mmwave frequencies enable synthesis of compact antenna arrays, providing beamforming gains that compensate the increased propagation losses. In this work, we investigate the feasibility of employing multiple antenna arrays (at the transmitter and/or receiver) to obtain diversity/multiplexing gains in mmwave systems, where each of the arrays is capable of beamforming independently. Considering a codebook-based beamforming system (the set of possible beamforming directions is fixed a priori, e.g., to facilitate limited feedback), we observe that the complexity of jointly optimizing the beamforming directions across the multiple arrays is highly prohibitive, even for very reasonable system parameters. To overcome this bottleneck, we develop reduced complexity algorithms for optimizing the choice of beamforming directions, premised on the sparse multipath structure of the mmwave channel. Specifically, we reduce the cardinality of the joint beamforming search space, by restricting attention to a small set of dominant candidate directions. To obtain the set of dominant directions, we develop two complementary approaches: 1) based on computation of a novel spatial power metric; a detailed analysis of this metric shows that, in the limit of large antenna arrays, the selected candidate directions approach the channel's dominant angles of arrival and departure, and 2) precise estimation of the channel's (long-term) dominant angles of arrival, exploiting the correlations of the signals received across the different receiver subarrays. Our methods enable a drastic reduction of the optimization search space (a factor of 100 reduction), while delivering close to optimal performance, thereby indicating the potential feasibility of achieving diversity and multiplexing gains in mmwave systems.