Miracle-dz/UniFAR-FTUs huggingface dataset:
Collateral Support: Involving Parents and Schools in Treatment for Youth Anxiety

ABSTRACT Cognitive behavioral therapy (CBT) is an empirically supported and well-established treatment for youth anxiety disorders. CBT therapists often involve parents and school staff in treatment to promote the generalization of therapeutic gains across settings. To facilitate therapist communication with those who provide collateral support, we discuss both general guidelines and specific examples of how parents and teachers can best support anxious youth by acting as coping models, labeling and validating anxious feelings, rewarding brave behavior, and reducing accommodations. We provide answers to questions commonly asked by parents (e.g., “How should I respond ‘in the moment’ when my child is anxious? ”) and by school personnel (e.g., “What is a useful role for a school in child treatment”). Handouts summarizing main concepts for parents and schools are provided.
Cross-evaluation of metrics to estimate the significance of creative works

Significance Whether it is Hollywood movies or research papers, identifying works of great significance is imperative in a modern society overflowing with information. Through analysis of a network constructed from citations between films as referenced in the Internet Movie Database, we obtain several automated metrics for significance. We find that the best automated method can identify significant films, represented by selection to the US National Film Registry, at least as well as the aggregate rating of many experts and far better than the rating of a single expert. We hypothesize that these results may hold for other creative works. In a world overflowing with creative works, it is useful to be able to filter out the unimportant works so that the significant ones can be identified and thereby absorbed. An automated method could provide an objective approach for evaluating the significance of works on a universal scale. However, there have been few attempts at creating such a measure, and there are few “ground truths” for validating the effectiveness of potential metrics for significance. For movies, the US Library of Congress’s National Film Registry (NFR) contains American films that are “culturally, historically, or aesthetically significant” as chosen through a careful evaluation and deliberation process. By analyzing a network of citations between 15,425 United States-produced films procured from the Internet Movie Database (IMDb), we obtain several automated metrics for significance. The best of these metrics is able to indicate a film’s presence in the NFR at least as well or better than metrics based on aggregated expert opinions or large population surveys. Importantly, automated metrics can easily be applied to older films for which no other rating may be available. Our results may have implications for the evaluation of other creative works such as scientific research.
A Purely Homomorphic Characterization of Recursively Enumerable Sets

Charactenzattons of recurs~vely enumerable sets as mappings of equality and mtmmal sets are given An equality (minimal) set is the set of all (minmaal) solutions of an instance of the Post correspondence problem where the solutions are viewed as stnngs The mar result ~s that every recurstvely enumerable set can be expressed (effecUvely) as a homomorphlc image of a minimal set. From the algebraic pomt of view this seems to be the simplest characterization of recurslvely enumerable languages A corollary of the mare result ts the solution of an open problem formulated by A Salomaa A purely homomorphlc characterization of regular sets is denved How such a characterization can be obtained for various ttrne and space complexRy classes for languages ts outhned In several recent proofs of decidabdRy results (e.g, [2, 3]) it turned out to be of crucial importance to efffectively check whether two homomorphisms ha, h2 on a free monoid ~*, generated by an alphabet Z, are equal on a certain subset of Z*, or alternatively, to find the language of all w ~ ~* for which hffw) = hz(w). Such languages were explicRly introduced as equality sets in [5] and further studied. We introduce here another group of languages called minimal sets which are defined as mimma of equality sets using the terminology of [4], i.e. a minimal set ~s a subset of an equality set L containing all strings which have no proper prefix from L These sets were also implicitly considered in [5], where ~t was noted that each equality set is a star language (star event in the sense of [1]) and where it was also shown that each minimal set is the minimal star root of an equality set. Alternatively we can say that an equality set is the set of all solutions of an instance of the Post correspondence problem; a minimal set is the set of all its mimmal solutions. Here we consider an instance with hsts A, B of length n over alphabet Z as homomorphisms A, B from (1, 2 . n}* to ~*, and its solution as a string over { 1 . n}. Each equahty set also contains e, the empty string. We are looking for characterizations of all recurswely enumerable languages by map-pings of mimmal or equahty sets. Our mare result is that every recursively enumerable language can be expressed as a homomorphic image of a …
Edinburgh Research Explorer Approximating the Termination Value of One-Counter MDPs and Stochastic Games

One-counter MDPs (OC-MDPs) and one-counter simple stochastic games (OC-SSGs) are 1-player, and 2-player turn-based zero-sum, stochastic games played on the transition graph of classic one-counter automata (equivalently, pushdown automata with a 1-letter stack alphabet). A key objective for the analysis and veriﬁcation of these games is the termination objective, where the players aim to maximize (minimize, respectively) the probability of hitting counter value 0, starting at a given control state and given counter value. Recently, we studied qualitative decision problems (“is the optimal termination value equal to 1? ”) for OC-MDPs (and OC-SSGs) and showed them to be decidable in polynomial time (in NP ∩ coNP, respectively). However, quantitative decision and approximation problems (“is the optimal termination value at least p ”, or “approximate the termination value within ε ”) are far more challeng-ing. This is so in part because optimal strategies may not exist, and because even when they do exist they can have a highly non-trivial structure. It thus remained open even whether any of these quantitative termination problems are computable. In this paper we show that all quantitative approximation problems for the ter-1 mination value for OC-MDPs and OC-SSGs are computable. Speciﬁcally, given a OC-SSG, and given ε > 0, we can compute a value v that approximates the value of the OC-SSG termination game within additive error ε , and furthermore we can compute ε -optimal strategies for both players in the game. A key ingredient in our proofs is a subtle martingale, derived from solving certain linear programs that we can associate with a maximizing OC-MDP. An application of Azuma’s inequality on these martingales yields a computable bound for the “wealth” at which a “rich person’s strategy” becomes ε -optimal for OC-MDPs.
On a Fractional Nirenberg Problem, Part II: Existence of Solutions

This paper is a continuation of our earlier work “[T. Jin, Y.Y. Li and J. Xiong, On a fractional Nirenberg problem, part I: blow up analysis and compactness of solutions, to appear in J. Eur. Math. Soc. ]”, where compactness results were given on a fractional Nirenberg problem. We prove two existence results stated there. We also obtain a fractional Aubin inequality.
Crowdsourcing-Based Disaster Management Using Fog Computing in Internet of Things Paradigm

In internet of things (IoT) paradigm, crowdsourcing is the process of obtaining and analyzing information or input to a particular task or project generated by a number of sources such as sensors, mobile devices, vehicles and human. Cloud computing is widely used for the services such as analyzing crowdsourced data and application implementation over the IoT. Nowadays, every country and human are prone to natural and artificial disasters. Early detection about disasters such as earthquakes, fire, storms, and floods can save thousands of people's life and effective preventive measure can be taken for the public safety. All the crowdsourced data which are providing the information of a certain geographic region are analyzed in a cloud platform. But, by the time the crowdsourced data makes its way to the cloud for analysis, the opportunity to act on it might be gone. Moreover, thousands of people's life will be lost. Therefore, fog computing is the new and efficient way to analyze such critical crowdsourced IoT data of disasters. In this paper, in order to detect and take necessary steps for public safety during a disaster, we propose a crowdsourcing-based disaster management using fog computing (CDMFC) model in IoT. Further, we also proposed a data offloading mechanism for our CDMFC model to send disaster-related IoT data to the fog even if a direct link to the fog is not available. Our proposed CDMFC model and its data offloading mechanism can detect real-time disasters and disseminate early information for public safety as compared to the conventional cloud computing based disaster management models.
Web Sentiment Analysis for Scoring Positive or Negative Words using Tweeter Data

people are free to say their opinions on anything using various social networking sites like Twitter, Facebook, Discussion forums, and blogs. Particularly Microblogging and text messaging have emerged and become dominated tool over the web. Twitter messages (tweets) is often used to share opinions and sentiments about the surrounding world. The availability of social content generated on sites such as Twitter creates new opportunities to study public opinion about the entity. This analysis we took twitter data for sentiment classification. The Sentiment analysis is done on a per-Tweet basis. The words in each Tweet are compared with those in other Tweets that have been previously labeled as "positive", or "negative". After looking at these words, the algorithm then judges whether the text in the Tweet is positive or negative based on the likelihood for each possibility. The overall objective of this paper is to determine the sentiment of the text, whether it is positive or negative, which is extended to strength of polarity also this approach is used to obtain the significant features and to analyzing the overall sentiment for each object by computing the weighted average for all the sentiments in the textual data.
Exploiting the Layout Engine to Assess Diagram Completions

A practicable approach to diagram completion is to first compute model completions on the abstract syntax level. These can be translated to corresponding diagram changes by the layout engine afterwards. Normally, several different model completions are possible though. One way to deal with this issue is to let the user choose among them explicitly, which is already helpful. However, such a choice step is a quite time-consuming interruption of the editing process. We argue that users often are mainly interested in completions that preserve their original diagram as far as possible. This criterion cannot be checked on the abstract syntax level though. In fact, minimal model changes might still result in enormous changes of the original diagram. Therefore, we suggest to use the layout engine in advance for assessing all possible model completions with respect to the diagram changes they eventually cause.
Reducing the Cost of Protection against Soft Errors using Profile-Based Analysis

The negative impact of the aggressive scaling of technology nodes on the sensitivity of CMOS devices to soft errors has been well studied in the past. Technology scaling makes processors more susceptible to transient faults. Errors caused by high-energy particle strikes in processors can result in unexpected behavior and incorrect results. With the smaller and cheaper CMOS devices pervasive in mainstream computing, it is necessary to protect these devices against soft errors; an increasing rate of faults makes the need to protect the critical application running on commodity processors against soft errors more important than ever. The existing methods of protecting against such faults generally have high area or performance overheads and so are used only in mission-critical domains. In order to protect against the soft errors caused by high energy particle strikes, the detection of these errors is necessary so that recovery can be triggered. In this work, a profile-based software-only application analysis and transformation solution to detect soft-errors is presented. The goal is to develop a low cost solution which can be deployed for off-the-shelf commodity processors. The solution works by intelligently duplicating instructions which are likely to affect the program output, and comparing results between original and duplicated instructions. The intelligence of our solution is provided by the use of control flow, memory dependence, and value profiling to understand and exploit the commoncase behavior of applications. Our solution is able to achieve 92% fault coverage with a 20% instruction overhead. This represents a 41% lower performance overhead than the best prior approaches with approximately the same fault coverage. General Terms Transient Fault Reliability, Soft Errors, Profile-based Compiler Analysis, Fault Injection
Programmed Protection of Foreign DNA from Restriction Allows Pathogenicity Island Exchange during Pneumococcal Transformation

In bacteria, transformation and restriction-modification (R-M) systems play potentially antagonistic roles. While the former, proposed as a form of sexuality, relies on internalized foreign DNA to create genetic diversity, the latter degrade foreign DNA to protect from bacteriophage attack. The human pathogen Streptococcus pneumoniae is transformable and possesses either of two R-M systems, DpnI and DpnII, which respectively restrict methylated or unmethylated double-stranded (ds) DNA. S. pneumoniae DpnII strains possess DpnM, which methylates dsDNA to protect it from DpnII restriction, and a second methylase, DpnA, which is induced during competence for genetic transformation and is unusual in that it methylates single-stranded (ss) DNA. DpnA was tentatively ascribed the role of protecting internalized plasmids from DpnII restriction, but this seems unlikely in light of recent results establishing that pneumococcal transformation was not evolved to favor plasmid exchange. Here we validate an alternative hypothesis, showing that DpnA plays a crucial role in the protection of internalized foreign DNA, enabling exchange of pathogenicity islands and more generally of variable regions between pneumococcal isolates. We show that transformation of a 21.7 kb heterologous region is reduced by more than 4 logs in dpnA mutant cells and provide evidence that the specific induction of dpnA during competence is critical for full protection. We suggest that the integration of a restrictase/ssDNA-methylase couplet into the competence regulon maintains protection from bacteriophage attack whilst simultaneously enabling exchange of pathogenicicy islands. This protective role of DpnA is likely to be of particular importance for pneumococcal virulence by allowing free variation of capsule serotype in DpnII strains via integration of DpnI capsule loci, contributing to the documented escape of pneumococci from capsule-based vaccines. Generally, this finding is the first evidence for a mechanism that actively promotes genetic diversity of S. pneumoniae through programmed protection and incorporation of foreign DNA.
Violent Scene Detection Using a Super Descriptor Tensor Decomposition

This article presents a new method for violent scene detection using super descriptor tensor decomposition. Multi-modal local features comprising auditory and visual features are extracted from Mel-frequency cepstral coefficients (including first and second order derivatives) and refined dense trajectories. There is usually a large number of dense trajectories extracted from a video sequence; some of these trajectories are unnecessary and can affect the accuracy. We propose to refine the dense trajectories by selecting only discriminative trajectories in the region of interest. Visual descriptors consisting of oriented gradient and motion boundary histograms are computed along the refined dense trajectories. In traditional bag-of-visual-words techniques, the feature descriptors are concatenated to form a single large feature vector for classification. This destroys the spatio-temporal interactions among features extracted from multi-modal data. To address this problem, a super descriptor tensor decomposition is proposed. The extracted feature descriptors are first encoded using super descriptor vector method. Then the encoded features are arranged as tensors so as to retain the spatio-temporal structure of the features. To obtain a compact set of features for classification, the TUCKER-3 decomposition is applied to the super descriptor tensors, followed by feature selection using Fisher feature ranking. The obtained features are fed to a support vector machine classifier. Experimental evaluation is performed on violence detection benchmark dataset, MediaEval VSD2014. The proposed method outperforms most of the state-of-the-art methods, achieving MAP2014 scores of 60.2% and 67.8% on two subsets of the dataset.
Optimal tests for rare variant effects in sequencing association studies.

With development of massively parallel sequencing technologies, there is a substantial need for developing powerful rare variant association tests. Common approaches include burden and non-burden tests. Burden tests assume all rare variants in the target region have effects on the phenotype in the same direction and of similar magnitude. The recently proposed sequence kernel association test (SKAT) (Wu, M. C. , and others, 2011. Rare-variant association testing for sequencing data with the SKAT. The American Journal of Human Genetics 89, 82-93], an extension of the C-alpha test (Neale, B. M. , and others, 2011. Testing for an unusual distribution of rare variants. PLoS Genetics 7, 161-165], provides a robust test that is particularly powerful in the presence of protective and deleterious variants and null variants, but is less powerful than burden tests when a large number of variants in a region are causal and in the same direction. As the underlying biological mechanisms are unknown in practice and vary from one gene to another across the genome, it is of substantial practical interest to develop a test that is optimal for both scenarios. In this paper, we propose a class of tests that include burden tests and SKAT as special cases, and derive an optimal test within this class that maximizes power. We show that this optimal test outperforms burden tests and SKAT in a wide range of scenarios. The results are illustrated using simulation studies and triglyceride data from the Dallas Heart Study. In addition, we have derived sample size/power calculation formula for SKAT with a new family of kernels to facilitate designing new sequence association studies.
Elevated Calcium Acutely Regulates Dynamic Interactions of NHERF2 and NHE3 Proteins in Opossum Kidney (OK) Cell Microvilli*

Background: Na/H exchanger 3 is fixed to the BB cytoskeleton but is regulated by changes in trafficking. Results: Elevated Ca2+ rapidly decreases BB NHE3 amount/activity and transiently decreases NHE3 association with NHERF2 and increases NHE3 BB mobility. Conclusion: There is coordinated regulation of trafficking and NHE3 BB cytoskeletal association. Significance: A newly recognized aspect of signal transduction in epithelial cells is dynamic/transient changes in BB transporter-cytoskeleton association. The brush border (BB) Na+/H+ exchanger NHE3 is rapidly activated or inhibited by changes in trafficking, which mimics renal and intestinal physiology. However, there is a paradox in that NHE3 has limited mobility in the BB due to its binding to the multi-PDZ domain containing the NHERF family. To allow increased endocytosis, as occurs with elevated intracellular Ca2+, we hypothesized that NHE3 had to be, at least transiently, released from the BB cytoskeleton. Because NHERF1 and -2 are localized at the BB, where they bind NHE3 as well as the cytoskeleton, we tested whether either or both might dynamically interact with NHE3 as part of Ca2+ signaling. We employed FRET to study close association of NHE3 and these NHERFs and fluorescence recovery after photobleaching to monitor NHE3 mobility in the apical domain in polarized opossum kidney cells. Under basal conditions, NHERF2 and NHE3 exhibited robust FRET signaling. Within 1 min of A23187 (0.5 μm) exposure, the NHERF2-NHE3 FRET signal was abolished, and BB NHE3 mobility was transiently increased. The dynamics in FRET signal and NHE3 mobility correlated well with a change in co-precipitation of NHE3 and NHERF2 but not NHERF1. We conclude the following. 1) Under basal conditions, NHE3 closely associates with NHERF2 in opossum kidney cell microvilli. 2) Within 1 min of elevated Ca2+, the close association of NHE3-NHERF2 is abolished but is re-established in ∼60 min. 3) The change in NHE3-NHERF2 association is accompanied by an increased BB mobile fraction of NHE3, which contributes to inhibition of NHE3 transport activity via increased endocytosis.
Vertical Migration and Motility Responses in Three Marine Phytoplankton Species Exposed to Solar Radiation †

Diurnal vertical migration in the water column and the impact of solar radiation on motility were investigated in three marine phytoplankton species: Tetraselmis suecica, Dunaliella salina and Gymnodinium chlorophorum. Cells were exposed to solar radiation either in ultraviolet radiation (UVR, 280–400 nm) transparent Plexiglas tubes (45 cm length, 10 cm diameter) or in quartz tubes under three radiation treatments: PAB (280–700 nm), PA (320–700 nm) and P (400–700 nm). The three species displayed different behavior after exposure to solar radiation. Tetraselmis suecica was insensitive to UVR and under high solar radiation levels, cells accumulated preferentially near the surface. Exposure experiments did not indicate any significant changes in swimming speed nor in the percentage of motile cells after 5 h of exposure. On the other hand, D. salina was sensitive to UV‐B displaying a significant decrease in swimming speed and percentage of motile cells after 2–3 h of exposure. Moreover, D. salina cells migrated deep in the water column when irradiance was high. The response of G. chlorophorum was in between that of the other two species tested, with a slight (but significant) decrease in swimming speed and percentage of motile cells in all radiation treatments after 5 h of exposure. While G. chlorophorum cells were more or less homogenously distributed in the water column, a slight (but significant) avoidance response to high radiation was observed at local noon, with cells migrating deep in the water column. Our data clearly indicate that these sub‐lethal effects of solar radiation are species‐specific and they might have important implications for the aquatic ecosystem.