Miracle-dz/UniFAR-FTUs huggingface dataset:
The Impact of Sexual Abuse and How Children Cope: Different Perspectives from Caretakers and Children

Child sexual abuse is a complicated stressor with a broad range of associated symptoms. It has been suggested that the coping techniques children utilize may act as a mediating variable in the relationship between child sexual abuse and subsequent difficulties. Until recently, child sexual abuse sequelae were assessed in a piecemeal fashion, with individual tests for each symptom domain and reporter. However, recent developments in the area of trauma assessment have provided researchers with complementary caretakerand self-report measures to assess a broad range of trauma-related symptoms (i.e., the Trauma Symptom Checklist for Young Children [TSCYC] and the Trauma Symptom Checklist for Children [TSCC], respectively). This project utilized the intake assessment data from children who were beginning psychotherapy services subsequent to sexual abuse. The TSCYC is a relatively new measure, therefore, Study 1 evaluated its internal consistency (N=308), the correlation between the caretakerand self-report measures (N=135), and the convergent validity of the TSCYC with other caretaker-report measures of children’s symptoms (N=135). The results indicated that the TSCYC has good internal consistency and convergent validity. The inter-correlation of the TSCYC and TSCC is quite low and consistent with other studies attempting to understand multi-informant assessment processes. Children and their caretakers describe very different pictures when asked about the children’s difficulties. Study 2 (N=98) then evaluated the relationship between children’s coping style as assessed by the KIDCOPE and trauma-related symptoms as reported by the children themselves and their caretakers. Overall, more external coping behaviors were associated with an increase in caretaker-reported symptoms, but internal coping was associated with Schacht, Megan, 2006, UMSL, p. 3 more self-reported symptoms among children between the ages of eight and twelve years. The implications of these findings and future directions for research are discussed. Schacht, Megan, 2006, UMSL, p. 4 Table of
Observer with Single Vector Observations ⋆

This paper proposes a globally exponentially stable (GES) observer for attitude estimation based on a single time-varying reference vector, in inertial coordinates, and corresponding vector, in body-fixed coordinates, in addition to angular velocity readings. The proposed solution is computationally efficient and, in spite of the fact that the observer does not evolve on the Special Orthogonal Group SO(3), an explicit solution on SO(3) is also provided, whose error is shown to converge exponentially fast to zero for all initial conditions. The distinct roles of the inertial and the corresponding body-fixed vectors on the observability of the system are also examined and simulation results are shown that illustrate the performance of the proposed attitude observer in the presence of low-grade sensor specifications.
SybilRes: A Sybil-resilient Flow-Based Decentralized Reputation Mechanism

Due to the possibility of cheap identity creation, decentralized online reputation mechanisms are susceptible to sybil attacks. Barter Cast is a reputation mechanism used in the Internet-deployed Tribler file-sharing client. In this paper we study the opportunities for sybil attacks in Barter Cast and we devise a method for making Barter Cast sybil resilient, which is incorporated in a protocol called Sybil Res. Like in Barter Cast, in Sybil Res each peer maintains a local subjective weighted directed graph reflecting data transfer actions in Tribler, from which it computes the reputations of other peers using a flow based algorithm taking the edge weights as flows. In Sybil Res, after an upload action, the uploading peer discounts the weights of the edges on the paths from the down loader to itself. As a consequence, due to the way reputations are computed, the reputation of a peer performing a sybil attack decreases fast. To mitigate the negative impact of edge weight discounting on the reputations of honest peers, after a download action, the downloading peer increases the weights of the edges on the paths from the up loader to itself. We demonstrate that Sybil Res is effective in practice by means of trace-driven simulations using data collected from the Tribler network. The results show that Sybil Res effectively marginalizes attackers while having a minimal effect on the reputations of honest peers.
Motion Dense Sampling for Video Classification

In this paper, we propose the motion dense sampling (MDS) for video classification, which detects very informative interest points from video frames. MDS has two advantages compared to other existing methods. The first advantage is that MDS detects only interest points which belong to foreground regions of all regions of a video frame. Also it can detect the constant number of points even when the size of foreground region in an image drastically changes. The Second one is that MDS enable to describe scale invariable features by computing sampling scale for each frame based on the size of foreground regions. Thus, our method detects much more informative interest points from videos than other methods. Experimental results show a significant improvement over existing methods on YouTube dataset. Our method achieves 86.8% accuracy for video classification by using only one descriptor.
Hitting times computation for theoretically studying peer-to-peer distributed systems

Summary form only given. Random walks based algorithms give efficient solutions to many distributed problems. The hitting time, i.e. the average time for the walk starting at a given vertex to first hit another given vertex is one of the main quantity used in the analysis of such algorithms. The growing use of peer-to-peer systems leads to a high bandwidth consumption and random walks are currently investigated as a solution to improve peer-to-peer systems efficiency. Such systems are often modeled by weighted graphs. We show how hitting times can be used in peer-to-peer distributed systems to compare the efficiency of deterministic and random-walks based procedures. An expression of the hitting times on a weighted graph in terms of effective resistances is established. Then, an efficient method to compute all the hitting times on a graph is presented. This method is illustrated by a detailed example.
Comparison of mutagenesis by O6-methyl- and O6-ethylguanine and O4-methylthymine in Escherichia coli using double-stranded and gapped plasmids.

To compare mutagenesis by O6-methylguanine (m6G), O4-methylthymine (m4T) and O6-ethylguanine (e6G), and assess their genotoxicity in Escherichia coli, double-stranded and gapped plasmids were constructed containing a single m6G, e6G or m4T in the initiation codon (ATG) of a lacZ' gene. Modified base induced mutations were scored by the loss of lacZ' activity on X-gal-containing media resulting in formation of white or sectored (mutant) rather than blue (non-mutant) colonies. Genotoxicity experiments with gapped plasmids containing the modified bases indicated that m4T produced a greater number of bacterial colonies than m6G or e6G. m4T was more mutagenic (45% mutant colonies) than m6G (6%) or e6G (11%) in repair competent (w.t.) E. coli when incorporated in double-stranded plasmids. In gapped plasmids, m4T produced 99% mutant colonies (as was observed previously for e6G) in both w.t. E. coli or E. coli deficient in both O6-alkylguanine-DNA alkyltransferases as well as methylation-directed mismatch repair (ada(-)-ogt(-)-mutS[-]). m6G in gapped plasmids produced 62% mutant colonies in w.t. E. coli, but this percentage increased to 94% in the ada(-)-ogt(-)-mutS(-) strain. In double-stranded plasmids both m4T and m6G produced very similar distributions of mutant and non-mutant colonies in the ada(-)-ogt(-)-mutS(-) strain. These observations led to the conclusion that differences in the mutagenicity of m6G and m4T in w.t. E. coli were a result of preferential repair of m6G compared to m4T by alkyltransferase and mismatch repair mechanisms, and did not reflect differences in their respective coding efficiency or their inherent obstructiveness to DNA synthesis as was observed with e6G. The combination of alkyltransferase and mismatch repair was concluded to be primarily responsible for the apparent genotoxicity of m6G compared to m4T in double-stranded plasmids.
Instruction set emulation for rapid prototyping of SoCs

In this paper the application of Instruction Set Emulation (ISE) for rapid prototyping of SoCs is presented. The emulation works in a way that both the software and the hardware behaviour of the emulated processor core is reproduced cycle accurately. This requires the use of hardware and software components. The hardware component consists of a board containing a VLIW processor and FPGAs. The software component is an instruction set simulator of the core running on the VLIW processor. The FPGAs are used for emulating the SoC bus of this processor core. This way the simulation of an instruction set of a processor core has been extended to a real emulation of this core that can be used for rapid prototyping.
Distributed under Creative Commons Cc-by 4.0 the Modified Thomas Test Is Not a Valid Measure of Hip Extension Unless Pelvic Tilt Is Controlled

The modified Thomas test was developed to assess the presence of hip flexion contracture and to measure hip extensibility. Despite its widespread use, to the authors' knowledge, its criterion reference validity has not yet been investigated. The purpose of this study was to assess the criterion reference validity of the modified Thomas test for measuring peak hip extension angle and hip extension deficits, as defined by the hip not being able to extend to 0º, or neutral. Twenty-nine healthy college students (age = 22.00 ± 3.80 years; height = 1.71 ± 0.09 m; body mass = 70.00 ± 15.60 kg) were recruited for this study. Bland–Altman plots revealed poor validity for the modified Thomas test's ability to measure hip extension, which could not be explained by differences in hip flexion ability alone. The modified Thomas test displayed a sensitivity of 31.82% (95% CI [13.86–54.87]) and a specificity of 57.14% (95% CI [18.41–90.10]) for testing hip extension deficits. It appears, however, that by controlling pelvic tilt, much of this variance can be accounted for (r = 0.98). When pelvic tilt is not controlled, the modified Thomas test displays poor criterion reference validity and, as per previous studies, poor reliability. However, when pelvic tilt is controlled, the modified Thomas test appears to be a valid test for evaluating peak hip extension angle.
An XML-based Approach to Handling Tables in Documents

We explore application of XML technology for handling tables in legacy semistructured documents. Specifically, we analyze annotating heterogeneous documents containing tables to obtain a formalized XML Master document that improves traceability (hence easing verification and update) and enables manipulation using XSLT stylesheets. This approach is useful when table instances far outnumber distinct table types because the effort required to annotate a table instance is relatively less compared to formalizing table processing that respects table’s semantics. This work is also relevant for authoring new documents with tables that should be accessible to both humans and machines.
Tools and techniques for formalising structural proof theory

Tools and Techniques for Formalising Structural Proof Theory Peter Chapman Whilst results from Structural Proof Theory can be couched in many formalisms, it is the sequent calculus which is the most amenable of the formalisms to metamathematical treatment. Constructive syntactic proofs are filled with bureaucratic details; rarely are all cases of a proof completed in the literature. Two intermediate results can be used to drastically reduce the amount of effort needed in proofs of Cut admissibility: Weakening and Invertibility. Indeed, whereas there are proofs of Cut admissibility which do not use Invertibility, Weakening is almost always necessary. Use of these results simply shifts the bureaucracy, however; Weakening and Invertibility, whilst more easy to prove, are still not trivial. We give a framework under which sequent calculi can be codified and analysed, which then allows us to prove various results: for a calculus to admit Weakening and for a rule to be invertible in a calculus. For the latter, even though many calculi are investigated, the general condition is simple and easily verified. The results have been applied to G3ip, G3cp, G3s, G3-LC and G4ip. Invertibility is important in another respect; that of proof-search. Should all rules in a calculus be invertible, then terminating root-first proof search gives a decision procedure for formulae without the need for back-tracking. To this end, we present some results about the manipulation of rule sets. It is shown that the transformations do not affect the expressiveness of the calculus, yet may render more rules invertible. These results can guide the design of efficient calculi. When using interactive proof assistants, every case of a proof, however complex, must be addressed and proved before one can declare the result formalised. To do this in a humanreadable way adds a further layer of complexity; most proof assistants give output which is only legible to a skilled user of that proof assistant. We give human-readable formalisations of Cut admissibility for G3cp and G3ip, Contraction admissibility for G4ip and Craig’s Interpolation Theorem for G3i using the Isar vernacular of Isabelle. We also formalise the new invertibility results, in part using the package for reasoning about first-order languages, Nominal Isabelle. Examples are given showing the effectiveness of the formalisation. The formal proof of invertibility using the new methods is drastically shorter than the traditional, direct method.
An Improved Method for Image Edge Detection Based on GM(1,1) Model

The GM(1,1) model usually uses the first component of the first order accumulated generating operation(AGO) sequence X(1) as the initial condition to model in the research and application of image edge detection. This model has the disadvantage of being unable to completely utilize the latest information. Also it can’t detect out all edge points because it detects the image only on two directions of horizontal and vertical. So in this paper, an improved GM(1,1) model is proposed for edge detection. It uses the last component of sequence X(1) as the initial condition of GM(1,1) model and predicts the pixel value on eight directions. Then the predicted image is subtracted by the original image to find out the position points with hopping grey values, which are edge points. Experimental results show that this algorithm can effectively detect out a complete image edge.
Improving lookahead in parallel discrete event simulations of large-scale applications using compiler analysis

This paper addresses the issue of efficient and accurate performance prediction of large-scale message-passing applications on high performance architectures using simulation. Such simulators are often based on parallel discrete event simulation, typically using the conservative protocol to synchronize the simulation threads. The paper considers how a compiler can be used to automatically extract information about the lookahead present in the application and how this can be used to improve the performance of the null protocol used for synchronization. These techniques are implemented in the MPI-Sim simulator and dHPF compiler which had previous been extended to work together for optimizing the simulation of local computational components of an application. The results show that the availability of lookahead ranging improves the runtime of the simulator by factors ranging front 9% up to two orders of magnitude, with 30-60% improvements being typical for the real-world codes. The experiments also show that these improvements are directly correlated with reductions by the number of null messages required by the simulations.
Multiple-cue illumination estimation in textured scenes

In this paper, we present a method that integrates cues from shading, shadow and specular reflections for estimating directional illumination in a textured scene. Texture poses a problem for lighting estimation, since texture edges can be mistaken for changes in illumination condition, and unknown variations in albedo make reflectance model fitting impractical. Unlike previous works which all assume known or uniform reflectance, our method can deal with the effects of textures by capitalizing on physical consistencies that exist among the lighting cues. Since scene textures do not exhibit such coherence, we use this property to minimize the influence of texture on illumination direction estimation. For the recovered light source directions, a technique for estimating their intensities in the presence of texture is also proposed.
Mimic Behavior in Home Waste-Waters Management

We present results of a household-level survey on behaviors regarding refuses in the home waste-waters network. Interpreting survey results in a panel-data logit results show that most socio-economic and public good-related respondent's characteristics do not play a significant role in explaining choices to discard in the home waste-waters network. The only significant regressor, apart from the nature of the refuse itself, is, by far, the belief that the respondent has about her neighbors' and relatives' discarding behavior. We use Dong's endogeneity test [7] to show that that regressor is not endogenous. We argue that these results may be used by policymakers to reduce undesirable refuses in the home waste-waters network by means of properly designed nudges.
The Bispectral Index Declines During Neuromuscular Block in Fully Awake Persons

Bispectral index (BIS) is an electroencephalographic variable promoted for measuring depth of anesthesia. Electromyographic activity influences surface electroencephalography and the calculation of BIS. In this study, we sought to determine the effect of spontaneous electromyographic activity on BIS. BIS was monitored in three volunteers by using an Aspect A-1000 monitor. The experiment was repeated in one volunteer. Electromyographic activity was recorded. Alcuronium and succinylcholine were administered. No other drugs were used. In parallel with spontaneous electromyographic activity of the facial muscles, BIS decreased in response to muscle relaxation to a minimum value of 33 and, in the repeated measurement, to a minimum value of 9 when total neuromuscular block was achieved. In two volunteers, no total block was achieved. BIS decreased to a minimal value of 64 and 57, respectively. In turn, recovery of BIS coincided with the reappearance of spontaneous electromyographic activity. During the entire experiment, the volunteers had full consciousness. BIS, assessed by software Version 3.31, correlates with spontaneous electromyographic activity of the facial muscles. BIS failed to detect awareness in completely paralyzed subjects. Thus, in paralyzed patients, BIS monitoring may not reliably indicate a decline in sedation and imminent awareness.
Meta-Knowledge Annotation at the Event Level: Comparison between Abstracts and Full Papers

Biomedical literature contains rich information about events of biological relevance. Event corpora, containing classified, structured representations of important facts and findings contained within text, provide an important resource for the training of domain-specific information extraction (IE) systems. Such corpora pay little attention to the interpretation of events, e.g., whether an event describes a fact or an analysis of results, whether there is any speculation surrounding the event, etc. These types of information are collectively referred to as meta-knowledge. As previous work, an annotation scheme to enrich event corpora with meta-knowledge was designed to facilitate the training of more sophisticated IE systems, and was applied to the complete GENIA Event corpus of biomedical abstracts. In this paper, we describe a case study in which four full papers annotated with GENIA events have been manually enriched with meta-knowledge annotation. We analyse the annotation results, and compare them with the previously annotated abstracts.
A reliable key authentication schema for secure multicast communications

The paper analyzes the Logical Key Hierarchy (LKH) secure multicast protocol focusing on the reliability of the re-keying authentication process. We show that the key management in the LKH model is subject to some attacks. In particular, these attacks can be performed by entities external to the multicast group, as well as from internal users of the multicast group. The spectrum of these attacks is spread from the denial of service (DoS) to the session hijack that is the attacker is able to have legitimate users to commit on a session key that is provided by the attacker. The contributions of this paper are: (1) the definition of the threats the LKH key management is subject to; and (2) a reliable key authentication scheme that solves the weaknesses previously identified. This objective is achieved without resorting to public key signatures.
Policy Change and Learning in the RBC Model

What is the impact of surprise and anticipated policy changes when agents form expectations using adaptive learning rather than rational expectations? We examine this issue using the standard stochastic real business cycle model with lump-sum taxes. Agents combine knowledge about future policy with econometric forecasts of future wages and interest rates. Dynamics under learning can have large impact effects and a gradual hump-shaped response, and tend to be prominently characterized by oscillations not present under rational expectations. These fluctuations reflect periods of excessive optimism or pessimism, followed by subsequent corrections.
Developing cyber foraging applications for portable devices

This paper presents the Locusts Cyber foraging framework. Cyber foraging is the opportunistic use of computing resources available in the nearby environment, and using such resources thus fall into the category of distributed computing. Furthermore, for the resources to be used efficiently, parallel computing techniques must also be employed. Distributed and parallel computing are two concepts that are both notoriously known for being very hard for developers to grasp. Because of this one might think that techniques such as Cyber foraging would have a hard time surviving outside of research environments. In this paper a framework is presented that has special focus on making Cyber foraging accessible for all developers.