Miracle-dz/UniFAR-FTUs huggingface dataset:
Using two web-based addiction Stroops to measure the attentional bias in adults with Internet Gaming Disorder

Background and aims People with substance abuse and pathological gamblers show an attentional bias. In a laboratory setting, we found an attentional bias using an addiction Stroop in adults with Internet Gaming Disorder (IGD). We aimed at investigating this effect using two web-based experiments. Methods Study 1: Gamers with IGD, casual gamers, and non-gamers (N = 81, 28.1 ± 7.8 years) completed a web-based addiction Stroop with a fully randomized word order. They saw computer-related and neutral words in four colors and indicated the word color via keypress. Study 2: Gamers with IGD, casual gamers, and non-gamers (N = 87, 23.4 ± 5.1 years) completed a web-based addiction Stroop and a classical Stroop (incongruent color and neutral words), which both had a block design. We expected that in both studies, only the gamers with IGD would react more slowly to computer-related words in the addiction Stroop. All groups were expected to react more slowly to incongruent color words in the classical Stroop. Results In neither study did the gamers with IGD differ in their reaction times to computer-related words compared to neutral words. In Study 2, all groups reacted more slowly to incongruent color words than to neutral words confirming the validity of the online reaction time assessment. Discussion Gamers with IGD did not show a significant attentional bias. IGD may differ from substance abuse and pathological gambling in this respect; alternatively experimenting on the Internet may have introduced error variance that made it harder to detect a bias.
Maize Adaptation to Temperate Climate: Relationship Between Population Structure and Polymorphism in the Dwarf8 Gene

To investigate the genetic basis of maize adaptation to temperate climate, collections of 375 inbred lines and 275 landraces, representative of American and European diversity, were evaluated for flowering time under short- and long-day conditions. The inbred line collection was genotyped for 55 genomewide simple sequence repeat (SSR) markers. Comparison of inbred line population structure with that of landraces, as determined with 24 SSR loci, underlined strong effects of both historical and modern selection on population structure and a clear relationship with geographical origins. The late tropical groups and the early “Northern Flint” group from the northern United States and northern Europe exhibited different flowering times. Both collections were genotyped for a 6-bp insertion/deletion in the Dwarf8 (D8idp) gene, previously reported to be potentially involved in flowering time variation in a 102 American inbred panel. Among-group D8idp differentiation was much higher than that for any SSR marker, suggesting diversifying selection. Correcting for population structure, D8idp was associated with flowering time under long-day conditions, the deletion allele showing an average earlier flowering of 29 degree days for inbreds and 145 degree days for landraces. Additionally, the deletion allele occurred at a high frequency (>80%) in Northern Flint while being almost absent (<5%) in tropical materials. Altogether, these results indicate that Dwarf8 could be involved in maize climatic adaptation through diversifying selection for flowering time.
Family resiliency during resettlement: A comparative study of two Syrian families resettled in an Arctic nation

ABSTRACT The experiences of two refugee families from Syria, both of whom resettled at the same time in an arctic city, are compared to better understand the stressors and challenges that impede resettlement as well as the resilient factors that ease it. Qualitative data was obtained through interviews with the family members (n = 16) and the workers (n = 3) who facilitated their resettlement. Although each family received the same services and aid upon arrival, the families’ abilities to integrate and function varied. Possible factors are discussed. This has implications for agencies that serve refugees and hope to enhance the resilience of the resettling families.
Access control via coalitional power game

This paper considers the problem of access control in the uplink transmission of an OFDMA femtocell network. An underlying noncooperative power game has been devised, based on which a coalition game is formulated by taking a suitable value function. Only two complementary coalitions are allowed to exist in order to reflect the set of transmitters connected to either the macro base station or the femto access point. The transmitters in the same coalition cooperate by operating on non-interfering subchannels, while those in the complementary coalition are assumed to operate so as to cause maximum jamming. The value of a coalition is obtained as the max-min of utility sum of each individual in the given coalition. In the process, we also examine the optimal jamming strategy of the complementary coalition. Finally, we argue that the obtained value function cannot be super-additive. Since the super-additivity property is required for some of the solutions of cooperative game theory, we resort to the Shapley value solution, for which the super-additivity need not hold, to allocate the payoff to each user in a given coalition. Assuming that the transmitters want to be in the coalition that maximizes their payoff, we form a Markov model to obtain the stable coalition structure. We take these stable coalition structures as the required solution of our access control problem.
Transformation and Combination in Data-Driven Dependency Parcing

This thesis deals with automatic syntactic analysis of natural languagetext, also known as parsing. The parsing approach is data-driven, whichmeans that parsers are constructed by means of machine learning, lookingat training data in the form of annotated natural language sentences. The syntactic framework used in the thesis is dependency-based. Robustness is one of the characteristics of the data-driven approaches investigated here.The overall aim of this thesis is to maintain robustness while increasing accuracy.The content of the thesis falls naturally into two tracks, a transformation track and a combination track. The rst type of transformation investigatedis called pseudo-projective, because it enables strictly projective dependency parsers to recover non-projective dependency relations. Informally,a non-projective dependency tree contains crossing binary directed relations, when drawn above the sentence. Experimental results show that pseudo-projective transformations can improve accuracy significantly for a range of languages. The second type of transformation aims to facilitate the processing of specific linguistic constructions such as coordination and verb groups. Experimental results again show a positive effect on parsing accuracy for several languages, often greater than for the pseudo-projective transformations. However, the improvement of the transformations dependson the internal structure of the base parser, which is not the case for thepseudo-projective transformations. The combination track compares various approaches for combining data driven dependency parsers, again as a means of improving accuracy. As different parsers have different strengths and weaknesses, making parsers collaborate in order to nd one single syntactic analysis may result in higher accuracy than any of the syntactic analyzers can produce by itself. The experimental results show that accuracy improves across languages, giventhat appropriate parsers are combined. The thesis ends with an attempt to combine the two tracks, showing that combining parsers with different tree transformations also increases accuracy. Moreover, this experiment indicates that high diversity among a small set of parsers is much more important than a large number of parsers with low diversity.
Neurobeachin regulates transmitter receptor trafficking to synapses

1 Departments of Functional Genomics and Clinical Genetics, Center for Neurogenomics and Cognitive Research, Neuroscience Campus Amsterdam, Vrije Universiteit (VU) and VU Medical Center, 1081 HV Amsterdam, Netherlands 2 Department of Molecular Neurobiology, Max Planck Institute of Experimental Medicine, 37075 Goettingen, Germany 3 Department of Genetics and Medicine, University of Pennsylvania, Perelman School of Medicine, Philadelphia, PA 19104, USA 4 Department of Neuroscience, Uppsala University, 75124 Uppsala, Sweden
Online Learning Algorithms for Dynamic Scheduling Problems

This paper presents game theoretic and reinforcement learning approach to dynamic scheduling. In dynamic scheduling problems all input is not available at the starting of scheduling. Input arrives online at the time of scheduling. So scheduling algorithm should be capable of scheduling the piece of input available till the time and schedule it as the input arrives. We used game theoretic and reinforcement learning approaches for dynamic scheduling. The learning approaches are useful when the scheduling requests repeat themselves for long duration. We developed the mechanism for scheduling in which all process work selfishly to maximize their own reward. Processes use reinforcement learning approach to select the suitable action. Finally the scheduling is performed on the basis of their actions.
Two principles and six techniques for rapid MT development

In this paper we describe a range of techniques used at NMSU CRL for accelerating the development of MT systems. These techniques enable semi-automatic development of a number of components of a multilingual MT system, thereby enabling rapid deployment of MT capabilities in a new language. First, we describe the core multi-engine, multilingual architecture that enables the different techniques to be rapidly integrated to build an MT system. We show how off-the-shelf components were used in this architecture for fast development. Then we illustrate a set of techniques for semi-automatic acquisition of static resources: (a) automatic induction of grammars, (b) corpus-based acquisition of bilingual glossaries, and automatic acquisition of semantic lexicons through (c) lexical rules and (d) reversal of analysis lexicons to generation lexicons. Finally we describe an automatic testing environment that enables rapid validation of automatically acquired resources.
Inter-mode prediction selection algorithm for MPEG-2 to AVS transcoder

In image transformation domain, the energy distribution reflects the image texture feature which contains the orientation relativity among macroblocks. In this paper, a new algorithm aiming at the inter-frame coding for MPEG-2 to AVS transcoder is proposed. Based on the analysis of statistical data, the number of times on intra-coding mode in inter-frame coding is reduced, and then, the P and B frame transcoding time is reduced. At the same time, the image quality only has a little drop. The experiment results show that compared with the cascaded method and other similar algorithms, our proposed algorithm can obtain obvious reduction in transcoding time at the cost of a slight decrease in SNR(Signal Noise Ratio) and a slight increase in bit rate.
A Sequential Decomposition of the Drop in Collective Bargaining Coverage

Abstract Union representation has been in strong decline in most OECD countries with potentially important consequences for wages. What drives this decline? We try to answer this question by developing and implementing a detailed Fairlie decomposition approach. Using linked employer-employee data from the German Structure of Earnings Survey for 2001 and 2006, we document a sharp drop in collective bargaining coverage that amounts to 17 percentage points for males and 20 percentage points for females in West, and 8 and 14 percentage points, respectively, in East Germany. We find that neither changes in the characteristics nor changes in the coefficients associated with the characteristics as a whole provide an explanation for the drop in collective bargaining coverage. The drop in coverage is the result of an unexplained time trend.
Adult judgments of children’s pain and fear during venipuncture: The impact of adult and child sex

ABSTRACT Background Low levels of agreement between caregiver and child reports of acute pain are well documented. Aims This study builds on prior research through exploring factors that may contribute to low caregiver–child concordance. Specifically, the study examined the influence of adult and child sex on adult judgments of children’s pain and fear during venipuncture and examined whether trait parental pain catastrophizing, empathy, and anxiety predicted judgment accuracy. Methods Using a judgment study paradigm, 160 participants (82 women) viewed 20 10-s video clips of children (10 boys, 10 girls) undergoing venipuncture and rated each child’s pain and fear. Adults’ ratings were compared to the children’s own ratings. Adults completed measures of trait parental pain catastrophizing, dispositional empathy, and trait anxiety. Results Adults accurately judged boys’ pain and fear significantly more often than that of girls. Further, adults underestimated and overestimated girls’ pain and overestimated girls’ fear significantly more frequently than that of boys. No effects of adult sex or adult by child sex interactions emerged. Parental pain catastrophizing significantly predicted underestimation of girls’ pain, with adults who engaged in more catastrophizing being less likely to underestimate girls’ pain. The variables did not predict adult judgment of child pain for women and men separately and did not predict adult judgment of child fear when examined by adult sex, child sex, or both combined. Conclusions Child sex influences adult pain and fear judgments, with girls being more vulnerable to inaccurate assessment than boys. Higher levels of parental pain catastrophizing may buffer against adults’ propensities to underestimate girls’ pain.
DEVELOPMENT OF SMART FIREWALL LOAD BALANCING FRAMEWORK FOR MULTIPLE FIREWALLS WITH AN EFFICIENT HEURISTIC FIREWALL RULE SET 1

Firewalls are the devices that we are used to protect data. It might be configured to allow certain devices or applications to access our network. The Firewalls are termed as stateful devices. Traditional firewalls typically need to inspect each packet to ensure that it adheres to the policy that has been configured or not, and then perform the necessary action associated to that particular rule. There are various actions and they are typically allow, deny, or even NAT the packet. Many Personal Computer Operating Systems include software-based Firewalls to protect against threats from the public Internet. Existing Firewall Technologies such as Cisco PIX Firewalls and Checkpoint FireWall-1 provide various software tools that allowing firewalls as Clustered or Grouped and these Configured Firewalls will share their loads. The main objectives of these existing technologies are to improve the Resource Utilization along with performance and Security. But however these techniques fail to achieve higher performance while focusing resource utilization. This is one of the serious issues. To address this problem, our research work is developed and implemented an efficient Adaptive Scheduler, which improves the network performance in terms of Resource Utilization, Delay and Throughput. This work also introduced Firewall Reduction Policy, which reduces firewall rules without compromising Security. From our Experimental results, it is established that this proposed technique reduces the computational cost, which leads to higher performance.
Experimental Comparison of PM-Assisted Synchronous Reluctance Motors

The aim of this paper is to show the results of various experimental tests carried out on synchronous reluctance (REL) motors with different rotor geometries, as proposed in technical literature. The impact of the assistance of ferrite permanent-magnet (PM) inset in the flux barriers is considered: PM-assisted REL motors are compared with synchronous REL motors, highlighting the main benefits of the former solution. The effect of the rotor skewing and of adopting asymmetric geometries of the flux barriers to reduce the torque ripple is investigated by means of several tests. The impact of the lamination is also considered, as far as the overload capability is concerned. In addition to the experimental tests, a finite-element model is adopted to predict the performance of the motors. The predicted results are compared with the experimental ones in a wide operating range, showing a good agreement.
A General Central Limit Theorem for Shape Parameters of $m$-ary Tries and PATRICIA Tries

Tries and PATRICIA tries are fundamental data structures in computer science with numerous applications. In a recent paper, a general framework for obtaining the mean and variance of additive shape parameters of tries and PATRICIA tries under the Bernoulli model was proposed. In this note, we show that a slight modification of this framework yields a central limit theorem for shape parameters, too. This central limit theorem contains many of the previous central limit theorems from the literature and it can be used to prove recent conjectures and derive new results. As an example, we will consider a refinement of the size of tries and PATRICIA tries, namely, the number of nodes of fixed outdegree and obtain (univariate and bivariate) central limit theorems. Moreover, trivariate central limit theorems for size, internal path length and internal Wiener index of tries and PATRICIA tries are derived as well.
Contents Acknowledgements vii Contributors viii

Part I Pioneering Approaches 2 Changing Ideas about Reference 25 Herbert H. Clark and Adrian Bangerter 3 Psycholinguistic Experiments and Linguistic-Pragmatics 50 Raymond W. Gibbs, Jr. 4 On the Automaticity of Pragmatic Processes: a Modular Proposal 72 Sam Glucksberg 5 Reasoning, Judgement and Pragmatics 94 Guy Politzer 6 Exploring Quantifiers: Pragmatics Meets the Psychology of Comprehension 116 A. J. Sanford and Linda M. Moxey
Identifying top Chinese network buzzwords from social media big data set based on time-distribution features

Buzzwords are the main embodiment of Internet culture, which play an important role in public opinion analysis, social focus tracking and language evolution study. At present, questionnaire has been wildly used as a standard method to obtain network buzzwords, which is subjective and costly. In this paper, we will propose a novel algorithm relying on the time-distribution feature of words and a KL-divergence measure to estimate words' popularity so as to figure out buzzwords in a specific period. The time-distribution feature simply states the fact that buzzwords' usage has a sharp increase during a very short period, which is then modeled formally with the KL-divergence measure. Compared with traditional method involving much workforce, the automatic algorithm presented here is clearly more efficient. Moreover, buzzwords identified in this manner will not be affected by individual's subjective opinions, so they can reflect the language usage in practice better. When applying the algorithm to a social media big data set, our experimental results show that the proposed approach can accurately identify buzzwords in a certain period, which is highly coincident with results tagged manually.
Evolutionary Origin of the Mitochondrial Cholesterol Transport Machinery Reveals a Universal Mechanism of Steroid Hormone Biosynthesis in Animals

Steroidogenesis begins with the transport of cholesterol from intracellular stores into mitochondria via a series of protein-protein interactions involving cytosolic and mitochondrial proteins located at both the outer and inner mitochondrial membranes. In adrenal glands and gonads, this process is accelerated by hormones, leading to the production of high levels of steroids that control tissue development and function. A hormone-induced multiprotein complex, the transduceosome, was recently identified, and is composed of cytosolic and outer mitochondrial membrane proteins that control the rate of cholesterol entry into the outer mitochondrial membrane. More recent studies unveiled the steroidogenic metabolon, a bioactive, multimeric protein complex that spans the outer-inner mitochondrial membranes and is responsible for hormone-induced import, segregation, targeting, and metabolism of cholesterol by cytochrome P450 family 11 subfamily A polypeptide 1 (CYP11A1) in the inner mitochondrial membrane. The availability of genome information allowed us to systematically explore the evolutionary origin of the proteins involved in the mitochondrial cholesterol transport machinery (transduceosome, steroidogenic metabolon, and signaling proteins), trace the original archetype, and predict their biological functions by molecular phylogenetic and functional divergence analyses, protein homology modeling and molecular docking. Although most members of these complexes have a history of gene duplication and functional divergence during evolution, phylogenomic analysis revealed that all vertebrates have the same functional complex members, suggesting a common mechanism in the first step of steroidogenesis. An archetype of the complex was found in invertebrates. The data presented herein suggest that the cholesterol transport machinery is responsible for steroidogenesis among all vertebrates and is evolutionarily conserved throughout the entire animal kingdom.
The OGLE-II event sc5_2859 : a Classical Nova outburst?

The OGLE-II event sc5_2859 was previously identified as the third longest microlensing event ever observed. Additional photometric observations from the EROS (Experience de Recherche d'Objets Sombres) survey and spectroscopic observations of the candidate star are used to test the microlensing hypothesis.The combined OGLE and EROS data provide a high quality coverage of the light curve. The colour of the sc5_2859 event is seen to change with time. A spectrum taken in 2003 exhibits a strong Halpha emission line. The additionnal data show that the OGLE-II sc5_2859 event is actually a classical nova outburst.
NWU-EECS-1106 Ranking continuous nearest neighbors for uncertain trajectories : Full and Peer

This article addresses the problem of performing Nearest Neighbor (NN) queries in a Moving Objects Database (MOD) when the trajectories of the objects are uncertain. The answer to an NN query for certain trajectories is time parameterized due to the continuous nature of the motion. However, for uncertain trajectories, even in a single time instant there may be several objects that have a non-zero probability of being a nearest neighbor to a given object. This fact affects the semantics of the answer to an NN query--an effect that is further amplified when the query spans over a time interval. We capture the impact that the uncertainty of the trajectories has on the semantics of the answer to continuous NN queries and we propose a tree structure for representing the answers, along with efficient algorithms to compute them. We also address the issue of performing NN queries when the motion of the objects is restricted to road networks. Finally, we formally define and show how to efficiently execute several variants of continuous NN queries. Our prototype implementation and experiments demonstrate that the proposed algorithms yield significant performance improvements when compared with the corresponding naive