Miracle-dz/UniFAR-FTUs huggingface dataset:
2016 Ieee International Conference on Big Data (big Data) " What Makes a pro Eating Disorder Hashtag " : Using Hashtags to Identify pro Eating Disorder Tumblr Posts and Twitter Users

—Eating disorders are detrimental to emotional and physical health conditions. The proliferation of content promoting eating disorders (pro-ED) on social media is a concerning trend that has received attention in recent years. On popular social network websites such as Tumblr and Twitter, there exist online pro-ED communities that focus on having eating disorder as a lifestyle choice as opposed to psychiatric illness. In this paper, we used hashtags to develop two well-trained classifiers: one identifies pro-ED Tumbler posts, and the other identifies pro-ED Twitter users. We also compared pro-ED hashtags across these two networks. I. INTRODUCTION Eating disorders are detrimental, prevalent, and have showed an increasing trend over the last decade. An estimated 30 million Americans suffer from eating disorders at sometime in their life [11]. Studies have shown that hospitalizations for eating disorders have increased 24% in 10-year period [13], and the increase could be closely related to the growth of popularity of social networks among adolescents and online pro-ED community [4]. Typically made up of pre-teen and teenage girls, these pro-ED communities serve as platforms for users to share tips for extreme weight loss and photographs of skinny women as aspirational goals for weight [4]. We propose a method to identify and examine pro-ED contents on Tumblr and Twitter, aiming to have a better understanding of online pro-ED communities as well as to help predict potential eating disorders. One advantage of using social websites is that many individuals with eating disorders also suffer from other social or psychological anxieties. It can be difficult for them to form social networks in real life and thus turn to social media, especially Tumblr and Twitter, where pro-ED hashtags are not prohibited. In particular, we develop well-trained classifiers that can identify pro-ED Tumblr posts or pro-ED Twitter users. Identifying pro-ED Tumblr posts can have significant value in terms of understanding the structure and makeup of pro-ED contents, and identifying Twitter users whose tweets contain large amount of pro-ED contents can help predict users with pro-ED potential. Our results showed that the Tumblr classifier achieved a accuracy of 68% and the Twitter classifier achieved
Insensitivity to pain in schizophrenia: An examination of sensory and affective pain processing in an animal model

Baum, and Dr. Perrotti for assisting me in making this a successful and challenging experience. Thank you to Dr. Peng for helping me to obtain the opportunity to observe at the psychiatric unit at JPS Hospital in Fort Worth. Along those lines, thank you also to Dr. Granado at JPS for allowing me to shadow her and for sharing her experiences in working at the psychiatric unit. I also thank Dr. Odegard for his feedback on a grant that included preliminary data for this experiment. I am truly thankful for the shared knowledge, support, and encouragement of these faculty members, not just on this project. I appreciate NeuroDetective for graciously donating the clozapine used in this study. I thank Chris Hagains for comments on ideas that I had regarding my data. Thank you to Megan Uhelski for coding vials so that I could remain blind, and thank you to Diane Dinh, Matt Davis, and AJ Morris for their assistance in data entry. I especially thank my mentor Dr. Fuchs for providing me with continual guidance and support. I am very fortunate to have such an accommodating and invested mentor. Finally, I thank my husband George Davis and my daughter Bethany for their support in helping me complete this experiment.
Scheduling Real-Time Packets with Non-preemptive Regions on Priority-Based NoCs

Network-on-Chip (NoC) is a preferred communication medium for massively parallel platforms. Fixed-priority based scheduling using virtual-channels is one of the promising solutions to support real-time traffic in on-chip networks. Most of the existing NoC implementations which can support fixed-priority based scheduling use a flit-level preemptive scheduling. Under such a mechanism, preemptions can happen between the transmissions of successive flits. In this paper, we present a modified framework where the non-preemptive region of each NoC packet increases from a single flit. Using the proposed approach, the response times of certain packet flows can be reduced, which can thus improve the schedulability of the whole network. As a result, the utilization of NoCs can be improved by admitting more real-time traffic. Schedulability tests regarding the proposed framework are presented along with the proof of the correctness. Moreover, a number of experiments as well as a case study based on an automotive application have been generated, where we can clearly observe the improvement of our solution compared to the original flit-level preemptive NoC.
Working Paper Number 93 September 2001 Tactical Voting and Tactical Non-Voting

Turnout and tactical voting seem to be driven by remarkably similar processes. Using British Election Study data from 1997, both are shown to depend on the strategic situation in the constituency, the relative strength of preference between parties, party campaigning and the levels of political interest, knowledge and trust. Models of tactical voting, and vote choice more generally, may therefore suffer from selectionbias due to differential turnout. This paper presents a model of tactical voting which seeks to account for turnout as a selection mechanism. However, the main conclusions regarding the processes driving tactical voting are unchanged. I am very grateful to John Curtice, Padraig Dixon, David Firth, Vanessa Gash, Frank Gerhard and David Myatt for their comments on this work, and also to the CREST team for collecting the data.
An accurate four-quadrant nonlinear dynamical model for marine thrusters: theory and experimental validation

This paper reports two specific improvements in the finite-dimensional nonlinear dynamical modeling of marine thrusters. Previously reported four-quadrant models have employed thin airfoil theory considering only axial fluid flow and using sinusoidal lift/drag curves. First, we present a thruster model incorporating the effects of rotational fluid velocity and inertia on thruster response. Second, we report a novel method for experimentally determining nonsinusoidal lift/drag curves. The model parameters are identified using experimental thruster data (force, torque, and fluid velocity). The models are evaluated by comparing experimental performance data with numerical model simulations. The data indicates that thruster models incorporating both reported enhancements provide superior accuracy in both transient and steady-state responses.
Investigation of age-related decline of microfibril-associated glycoprotein-1 in human skin through immunohistochemistry study

During aging, the reduction of elastic and collagen fibers in dermis can lead to skin atrophy, fragility, and aged appearance, such as increased facial wrinkling and sagging. Microfibril-associated glycoprotein-1 (MAGP-1) is an extracellular matrix protein critical for elastic fiber assembly. It integrates and stabilizes the microfibril and elastin matrix network that helps the skin to endure mechanical stretch and recoil. However, the observation of MAGP-1 during skin aging and its function in the dermis has not been established. To better understand age-related changes in the dermis, we investigated MAGP-1 during skin aging and photoaging, using a combination of in vitro and in vivo studies. Gene expression by microarray was performed using human skin biopsies from young and aged female donors. In addition, immunofluorescence analysis on the MAGP-1 protein was performed in dermal fibroblast cultures and in human skin biopsies. Specific antibodies against MAGP-1 and fibrillin-1 were used to examine protein expression and extracellular matrix structure in the dermis via biopsies from donors of multiple age groups. A reduction of the MAGP-1 gene and protein levels were observed in human skin with increasing age and photoexposure, indicating a loss of the functional MAGP-1 fiber network and a lack of structural support in the dermis. Loss of MAGP-1 around the hair follicle/pore areas was also observed, suggesting a possible correlation between MAGP-1 loss and enlarged pores in aged skin. Our findings demonstrate that a critical “pre-elasticity” component, MAGP-1, declines with aging and photoaging. Such changes may contribute to age-related loss of dermal integrity and perifollicular structural support, which may lead to skin fragility, sagging, and enlarged pores.
Examining the portrayal of Homophobic and Non Homophobic Aggression in print media through an Integrated Grounded Behavioural Linguistic Inquiry (IGBLI) approach

Purpose The role of the media in supporting an understanding of the social world is well documented. The representation of homosexuals in the media can therefore impact on homophobia within society. The purpose of this paper is to examine how homosexuals are portrayed in the media generally, before examining and comparing newspaper reports of homosexual aggression with heterosexual aggression. Design/methodology/approach Utilising a new and innovative research methodology, an integrated grounded behavioural linguistic inquiry (IGBLI) approach, four daily newspapers in circulation within the USA, Canada, the UK and Australia are examined. Findings While there are similarities in the way print media report on these aggressive incidents, the differences which emerge from the findings are of interest which require further, more in-depth study. Practical implications To extend the methodology of IGBLI to other forms of media content in order to further validate the approach. To reduce the differences between LGBTI news reports and heterosexual news reports. To hold the media to account for the ways in which they express their content. To encourage users of the media, in particular print media, to be critical of what they read. Originality/value Typically, analysis of media utilises the research method of content analysis. This paper adopts a new and innovative research method, an IGBLI approach, which incorporates a behavioural assessment in the form of a SORC.
A Lexicon for Underspeciied Semantic Tagging

The paper defends the notion that semantic tagging should be viewed as more than disambiguation between senses. Instead, semantic tagging should be a rst step in the interpretation process by assigning each lexical item a representation of all of its systematically related senses, from which further semantic processing steps can derive discourse dependent interpretations. This leads to a new type of semantic lexicon (CoreLex) that supports underspeciied semantic tagging through a design based on systematic polysemous classes and a class-based acquisition of lexical knowledge for speciic domains. 1 Underspeciied semantic tagging Semantic tagging has mostly been considered as nothing more than disambiguation to be performed along the same lines as part-of-speech tagging: given n lexical items each with m senses apply linguistic heuristics and/or statistical measures to pick the most likely sense for each lexical item (see eg: (Yarowsky, 1992) (Stevenson and Wilks, 1997)). I do not believe this to be the right approach because it blurs the distinction between`related' (systematic polysemy) andùnrelated' senses (homonymy : bank-bank). Although homonyms need to be tagged with a disambiguated sense, this is not necessarily so in the case of systematic polysemy. There are two reasons for this that I will discuss brieey here. First, the problem of multiple reference. Consider this example from the brown corpus: A long book heavily weighted with military technicalities] NP , in this edition it is neither so long nor so technical as it was originally. The discourse marker (it) refers back to an NP that expresses more than one interpretation at the same time. The head of the NP (book) has a number of systematically related senses that are being expressed simultaneously. The meaning of book in this sentence cannot be disambiguated between the number of interpretations that are implied: the informa-tional content of the book (military technicalities), its physical appearance (heavily weighted) and the events that are involved in its construction and use (long). The example illustrates the fact that disambigua-tion between related senses is not always possible, which leads to the further question if a discrete distinction between such senses is desirable at all. A number of researchers have answered this question negatively (see eg: (Pustejovsky, 1995) (Killgarii, 1992)). Consider these examples from brown: (1) fast run-up (of the stock) (2) fast action (by the city government) (3) fast footwork (by Washington) (4) fast weight gaining (5) fast condition (of the track) (6) fast response …
The aspherical Cavicchioli–Hegenbarth–Repovš generalized Fibonacci groups

Abstract The Cavicchioli–Hegenbarth–Repovš generalized Fibonacci groups are defined by the presentations Gn (m, k) = 〈x 1, … , xn | xixi+m = xi+k (1 ⩽ i ⩽ n)〉. These cyclically presented groups generalize Conway's Fibonacci groups and the Sieradski groups. Building on a theorem of Bardakov and Vesnin we classify the aspherical presentations Gn (m, k). We determine when Gn (m, k) has infinite abelianization and provide sufficient conditions for Gn (m, k) to be perfect. We conjecture that these are also necessary conditions. Combined with our asphericity theorem, a proof of this conjecture would imply a classification of the finite Cavicchioli–Hegenbarth–Repovš groups.
Decentralized Robust H&#8734;Output Feedback Control for Value Bounded Uncertain Large-scale Interconnected Systems

For large-scale interconnected systems with value bounded uncertainties existing in the state, control and interconnected matrices, the design of a decentralized robust Hinfin output feedback controller is investigated. Based on the bounded real lemma sufficient conditions for the existence of a decentralized robust Hinfin controller are obtained in terms of a set of matrix inequalities. According to Schur complement, a homotopy iterative linear matrix inequality method is put forward to construct a decentralized robust Hinfin controller by fixing different variables. The controller obtained enables the closed-loop large-scale systems robust stable and satisfies the given Hinfin performance. At last a numerical example is given to illustrate the effectiveness of the offered method
Properties of an augmented Lagrangian for design optimization

We consider the task of design optimization, where the constraint is a state equation that can only be solved by a typically rather slowly converging fixed point solver. This process can be augmented by a corresponding adjoint solver, and based on the resulting approximate reduced derivatives, also an optimization iteration that updates the design variables simultaneously. To coordinate the three iterative processes, we use an exact penalty function of a doubly augmented Lagrangian type that should be consistently reduced. Some numerical experiments on a variant of the Bratu problem are presented.
Ece901 : Mobile Communications Empirical Study of Tcp Vegas over Wireless with Link Layer Recovery

TCP Vegas has been receiving much attention recently due to its superior performance over TCP Reno in wireline networks. However, no study has been conducted on how TCP Vegas will perform over wireless networks where TCP performs poorly. In this study, we compare the link utilization of single TCP Vegas and TCP Reno connection over wireless link with Link Layer Recovery mechanism. We show that TCP Vegas connection achieve higher link utilization in most cases. In addition, some interesting issues of using TCP over Rayleigh fading channel will be discussed.
An Exploratory Analysis of Semantic Network Complexity for Data Modeling Performance

Database modeling performance varies across different constructs. For example, it is usually easier to model a binary relationship than a ternary relationship. Based upon the empirical performance data, ternary relationships are thought to be more complex than binary ones. This paper investigates the relationship between user modeling performance and the complexity of the data model constructs. A complexity estimate is proposed that measures complexity based on three different aspects: component, coordinative and coupling complexity. The aggregation of the three provides the total complexity estimate. Two semantic network variations that users might use are suggested, and their complexity values compared against known user performance. Regression results show reasonable R square values. This analysis suggests that using semantic networks could be a practical way to estimate modeling complexity and user performance. Future research can consider more refined variations of the semantic network, to account for training, experience, and different data models.
LEXICAL STRUCTURE AND SYNTACTIC PROJECTION 1 ON LEXICAL STRUCTURE AND SYNTACTIC PROJECTION

Donald Davidson’s classic argument that action sentences involve an event place in their argument structure receives important evidence from the overt syntax of Chinese genitive agent constructions, possessive object constructions, and sentences with expressions of event quantification that apparently occupy the syntactic position of objectual modifiers. These constructions present syntax-semantic mismatches that are resolved by an analysis according to which the main predicate has moved from its D-Structure position into the position of an abstract higher “light verb”. This analysis contributes to the literature on the nature of the “event place” with the claim that the event place is the internal argument of the light verb, rather than a temporal or spatial adjunct of the main predicate. This analysis can be extended to other predicate types along with recent neoDavidsonian hypotheses. The paper also examines a number of mismatches between objectual quantification in the syntax and event quantification in the semantics that cannot be accommodated under this analysis, but notes that those cases exhibit a high degree of lexical idiosyncrasy and rightly belong to the realm of lexical semantics.
A Feeder-Carrier-Based Internet User Accountability Service

This paper presents IDnet mesh, a general-purpose user identity architecture for the Internet, which provides a sc lable commonidentity validation service to the public. This common service can enable diversified new Internet services as well as new features for existing ones. It builds upon a novel feeder-carrier identity architecture which increases resilience to rising provider-initiated surveillance att empts. It offers a regular approach to connect a user’s online identity with the user’s real identity and meanwhile fully preserves the user’s privacy on the public Internet. Our system adopts a practical trust model such that it yields high system evolvability towards global deployment; it requires no change to the current Internet infrastructure and protocol s, and therefore is completely incrementally deployable. We use a Linux-based implementation of IDnet mesh algorithm and protocols at a cluster of servers in Emulab to perform benchmarks for the core algorithm and to test the functional integrity of the protocol implementation. We pe rform extensive evaluation of IDnet mesh’s scalability, sec urity, efficiency, and reliability. Finally, we assess the ov erhead induced by our system in the cases of Email and Web services and demonstrate that IDnet mesh can be scalably integrated with these services.
Computer-aided construction of concurrent systems

Virtually all chips today, from high-end to embedded, are being built with multiple processor cores and the number of cores per chip is increasing. To effectively exploit these changes in technology, all future software will have to be concurrent. This poses tremendous challenge for programmers as building correct and efficient concurrent programs is known to be a very difficult problem. In this paper, we briefly survey some of the most recent techniques we have developed for assisting the programmer in automatically building safe and efficient concurrent systems. Our approach takes as input a concurrent program and a specification that the output program should satisfy. It then automatically infers correct and efficient synchronization which is implemented in the final output program. Using our techniques, we have automatically inferred the usage of a range of classic concurrency constructs such as atomic sections, Hoare's conditional critical regions and memory fences in weak memory models.
A Fast SIFT Feature Matching Algorithm for Image Registration

In this paper, a novel fast SIFT (Scale Invariant Feature Transform) feature matching algorithm for image registration is presented. Firstly, for fast SIFT feature matching, we propose a method to optimize the priority k-d tree search algorithm by choosing a proper number of leaf nodes examined (denoted as Emax) in a single k-d tree. In order to get the relationships among the number of SIFT features, Emax and the precisions achieved by the priority k-d tree search algorithm in a single k-d tree, the properties of a single k-d tree and that of the priority k-d tree search algorithm are combined. Referring to these relationships, a proper value of Emax can be selected to achieve an approximate precision in fast time. And then, in image registration, in order to improve matching precision, we have designed the bidirectional priority k-d tree search algorithm in this paper. I. e. the priority k-d tree search algorithm is used twice.
Have a chat with clustine, conversational engine to query large tables

Thanks the recent advances of AI and the stellar popularity of messaging apps (e.g., WhatsApp), chatbots are no longer bound to customer support services and computer museums. Indeed, they provide a mighty, lightweight and accessible way to provide services over the Internet. In this paper, we introduce Clustine, a chatbot to help users query large tables through short messages. The main idea is to combine cluster analysis and text generation to compress query results, describe them with natural language and make recommendations. We present the architecture of our system, demonstrate it with two use cases, and present early validation experiments with 12 real datasets to show that its promises are reachable.