Miracle-dz/UniFAR-FTUs huggingface dataset:
Americans ‘support’ the idea of tuition-free college: an exploration of sentiment and political identity signals otherwise

Abstract In January 2015, President Obama captured headlines in the US by announcing America’s College Promise (ACP), a policy that would reverse four decades of privatisation in higher education by making community colleges ‘tuition-free’. This research explores the conversation that unfolded across the Facebook pages of various media sources. Key phrases associated with sentiments and communication styles are uncovered using a Bag of Words (BoW) technique. Next, guided by political identity theory, the researchers employ logistic regression to explore variable effects (e.g. source, gender, race, age and political leaning) on communicating: (1) Against ACP, (2) in a Civil manner, and (3) Against/Civil/On-Topic. BoW models suggest those against the policy utilise anti-free-ride, privatisation rhetoric, whereas those using uncivil language attack commentators and groups who counter personally-held political beliefs – while also introducing non-sequiturs from other policies (e.g. healthcare and immigration). The combined communication styles unlocked tokens not found in larger sentiments, such as concerns over student loan debt. Logistic regression illustrates that, depending on sentiment or communication style explored, political identities and memberships associated with source and political alignment significantly affected likelihoods of communicating in the conversation. These findings are linked back to political identity theory.
The Replica Management in a Spatial Data Grid

The Barn project, a spatial data grid prototype under development currently, provides a grid environment for applications of the nationwide geological survey data. Within Barn, in order to reduce data access latency, avoid a single point of failure, and increase the performance and load-balance of the system, we have designed and implemented a set of replica management services. These services, based on WSRF, offer users a convenient way to partition a large logical layer into multiple fragments, enable replication and management of the tiled spatial data, maintenance of replica consistency, catalog consistency and replica synchronization. This paper describes the framework and design of the replica management and evaluate its performance under the context of the Barn project. Keywordsgrid GIS, data grid, replica management, Globus Toolkit, WSRF
Schur complement‐based domain decomposition preconditioners with low‐rank corrections

This paper introduces a robust preconditioner for general sparse matrices based on low‐rank approximations of the Schur complement in a Domain Decomposition framework. In this ‘Schur Low Rank’ preconditioning approach, the coefficient matrix is first decoupled by a graph partitioner, and then a low‐rank correction is exploited to compute an approximate inverse of the Schur complement associated with the interface unknowns. The method avoids explicit formation of the Schur complement. We show the feasibility of this strategy for a model problem and conduct a detailed spectral analysis for the relation between the low‐rank correction and the quality of the preconditioner. We first introduce the SLR preconditioner for symmetric positive definite matrices and symmetric indefinite matrices if the interface matrices are symmetric positive definite. Extensions to general symmetric indefinite matrices as well as to nonsymmetric matrices are also discussed. Numerical experiments on general matrices illustrate the robustness and efficiency of the proposed approach. Copyright © 2016 John Wiley & Sons, Ltd.
Victory Sign Biometric for Terrorists Identification

Covering the face and all body parts, sometimes the only evidence to identify a person is their hand geometry, and not the whole hand- only two fingers (the index and the middle fingers) while showing the victory sign, as seen in many terrorists videos. This paper investigates for the first time a new way to identify persons, particularly (terrorists) from their victory sign. We have created a new database in this regard using a mobile phone camera, imaging the victory signs of 50 different persons over two sessions. Simple measurements for the fingers, in addition to the Hu Moments for the areas of the fingers were used to extract the geometric features of the shown part of the hand shown after segmentation. The experimental results using the KNN classifier were encouraging for most of the recorded persons; with about 40% to 93% total identification accuracy, depending on the features, distance metric and K used.
Evaluating the pilot Narnian Virtues Character Education English Curriculum Project: a study among 11- to 13-year-old students

Abstract In order to evaluate the impact of the pilot Narnian Virtues Character Education English Curriculum Project, a pilot sample of 86 year 7 and year 8 students (11 to 13 years of age) completed a battery of tests both before and after participating for six weeks in the programme. The battery of tests comprised 12 Narnian Character Virtue Scales (NCVS) (to assess the degree to which students saw themselves as behaving virtuously), the Knowledge Index of Narnian Character Virtues (KINCV) (to assess knowledge of virtues gained during the programme), and established measures of personality, happiness, self-esteem, empathy, and religious affect (as control variables). Mean scores were significantly higher at the end of the programme on the KINCV, but on none of the 12 NCVSs, and on none of the control variables. These data suggest that the Narnian Virtues Character Education English Curriculum Project was successful in enhancing knowledge of virtues but not in changing self-perceived behaviour. These findings are consistent both with the general educational principle that education informs understanding prior to affecting behaviour and also with the expectations of the project – that improving virtue literacy and understanding of virtues precedes the practice of virtues.
Improved compressed sensing algorithm for sparse-view CT

In presenting this thesis in partial fulfilment of the requirements for a Postgraduate degree from the University of Saskatchewan, I agree that the Libraries of this University may make it freely available for inspection. I further agree that permission for copying of this thesis in any manner, in whole or in part, for scholarly purposes may be granted by the professor or professors who supervised my thesis work or, in their absence, by the Head of the Department or the Dean of the College in which my thesis work was done. It is understood that any copying or publication or use of this thesis or parts thereof for financial gain shall not be allowed without my written permission. It is also understood that due recognition shall be given to me and to the University of Saskatchewan in any scholarly use which may be made of any material in my thesis. ii Acknowledgements I would like to thank my supervisors, Khan Wahid and Paul Babyn, for introducing me to the field of computed tomography, and their valuable academic guidance, financial support and encouragement during the work, and their great attitude. The numerical experiments in this thesis rely on the design of reconstruction algorithms. Dr. Wahid and Dr. Babyn helped me a lot in the design of the experiments. Two years studying under their direction is an invaluable experience that will benefit me throughout my life. I also wish to thank Dr. Cooper and his student, Isaac Pratt, Dr. James, for having shared their works and data. I also want to thank Canadian Light Source for providing the equipment to collect data. It is my fortune to have Professor Anh van Dinh, Francis Bui and Artur Sowa on my thesis committee. I am very grateful for their instructive comments and suggestions. I wish to express my gratitude to my family for their understanding and support. Finally, I want to acknowledge funding supports from my supervisors, Abstract In computed tomography (CT) there are many situations where reconstruction may need to be performed with sparse-view data. In sparse-view CT imaging, strong streak artifacts may appear in conventionally reconstructed images due to the limited sampling rate, compromising image quality. Compressed sensing (CS) algorithm has shown potential to accurately recover images from highly undersampled data. In the past few years, total variation (TV)-base compressed sensing algorithms have been proposed to suppress the streak artifact in CT …
Interoperability in MT Quality Estimation or wrapping useful stuff in various ways

The situation on the interoperability of Natural Language Processing software is outlined through a use-case on Quality Estimation of Machine Translation output. The focus is on the development efforts for the QUALITATIVE tool, so that it integrates a multitude of state-of-the-art external tools into one single Python program, through an interoperable framework. The presentation includes 9 approaches taken to connect 25 external components, developed in various programming languages. The conclusion is that the current landscape lacks important interoperability principles and that developers should be encouraged to equip their programs with some of the standard interaction interfaces.
Characterization and Fabrication of Novel Micromachined Electrode for BSN-Based Vital Signs Monitoring System

A novel micromachined electrode is designed and fabricated for a BSN-based vital signs monitoring system. Both theoretical calculation and ANSYS simulation show that buckling problem will not occur for the proposed microneedles during insertion process. The BSN-based vital signs routine monitoring system, which comprises of wireless mote, analog amplifier circuit board and SpO2 (Saturation of Arterial Oxygen) probe, is able to measure physiological signs in real time and with minimum disturbance on quality of life. The proposed device is easy to wear and convenient to use. Using a dock with ZigBee adapter, a PDA phone can communicate with the mote and then display the ECG/PPG waveforms as well as the important indices of vital signs, such as heart beat rate, SpO2 value and systolic blood pressure.
Representing proof transformations for program optimization

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Representing proof transformations for program optimization Penny Anderson
Factoring Polynomials over Finite Fields using Balance Test

We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao (Gao01) designed a polynomial time algorithm that fails to factor only if the input polynomial satisfies a strong symmetry property, namely square balance. In this paper, we propose an extension of Gao's algorithm that fails only under an even stronger symmetry property. We also show that our property can be used to improve the time complexity of best determinis- tic algorithms on most input polynomials. The property also yields a new randomized polynomial time algorithm.
House Allocation with Existing Tenants 1

In many real-life applications of house allocation problems, whenever an existing tenant wants to move, he needs to give up his current house before getting another one. This practice discourages existing tenants from such attempts and results in loss of potentially large gains from trade. Motivated by this observation, we propose a simple mechanism that is Pareto efficient, individually rational, and strategy-proof. Our approach is constructive and we provide two algorithms, each of which can be used to find the outcome of this mechanism. One additional merit of this mechanism is that it can accommodate any hierarchy of seniorities. Journal of Economic Literature Classification Numbers: C71, C78, D71, DF8. 1999 Academic Press
An algorithm to automate non-unimodular transformations of loop nests

This paper provides a solution to the open problem of automatic rewriting loop nests for non-unimodular transformations. We present an algorithm that rewrites a loop nest under any non-singular (unimodular or non-unimodular) transformation. The algorithm works nicely with unimodular transformations being treated as a special case. The first step of the algorithm calculates the loop bounds using the Fourier-Motzkin elimination method. The second step relies on a method based on the theory of Hermite normal form and lattice and is only needed for non-unimodular transformations. It consists of calculating the loop strides and adjusting the loop bounds derived in the first step so that the "holes" in the image iteration space are skipped. The time complexity of the second step is polynomial, which is the time complexity of calculating the Hermite normal form of an n /spl times/ n matrix, where n is the depth of the loop nest. The adjusted loop bounds are the simplest that can be expected. <<ETX>>
Phenotypic characterization of class CIII malocclusion

ii To Joe and Kyndl iii ACKNOWLEDGMENTS This project would not be possible without the considerable input and support from my thesis committee members, Dr. help with sample collection and also to I must express my sincere gratitude to Dr. opportunity to realize my dream and pursue such a wonderful career. Thank you for dedicating your lives to education; without your guidance, instruction and research contributions, our field would not be where it is today. Finally, I owe everything to my husband, Joe, for his countless hours of encouragement and patience, and to my daughter Kyndl, who has been a part of my education process her entire life. I would not be here without the support from my parents, Frank and Toni Cerka, and my father-and mother-in-law, Janie and Joe Vela.
The psy-disciplines go to school: psychiatric, psychological and psychotherapeutic approaches to inclusion in one UK primary school

ABSTRACT A growing body of research, largely from the global North, and particularly from North America, highlights the increasing psychiatrisation, medicalisation and psychologisation of children and childhood, and suggests that schools and educators play a key role in these processes. This increasing diffusion of psy-expertise within educational spaces signifies a cultural shift that has profound effects on teacher and student subjectivity, and on institutional and professional practices. Educators in many countries are said to be on the ‘front-line’ in identifying mental health issues, recommending treatment pathways, and sometimes helping to administer psychopharmaceuticals. The alacrity with which educators engage in these practices varies internationally, with reported occurrence being much higher in the United States and Canada, compared to the United Kingdom, where there is a lack of research. Drawing upon a case study in a UK primary school, this paper makes an original and timely contribution to research into UK teacher’s perceptions of inclusion in relation to social, emotional and behavioural difficulties and, in particular, attention-deficit hyperactivity disorder, as they navigate the interface of psychology and education. Contrary to some previous research, the educators in this study viewed the distribution of psychopharmaceuticals negatively, and showed a preference for psychotherapeutic approaches to inclusion. This research provides much needed empirical findings to a growing but largely theoretically informed body of research exploring whether, and if so then how, educators are implicated in the mobilisation of psy-expertise within children’s lives.
Appears in the AAAI-98/ICML-98 Workshop on Learning for Text Categorization and the AAAI-98 Workshop on Recommender Systems

Content-based recommender systems suggest documents , items, and services to users based on learning a proole of the user from rated examples containing information about the given items. Text categoriza-tion methods are very useful for this task but generally rely on unstructured text. We have developed a book-recommending system that utilizes semi-structured information about items gathered from the web using simple information extraction techniques. Initial experimental results demonstrate that this approach can produce fairly accurate recommendations.
The DARPA Twitter Bot Challenge

From politicians and nation states to terrorist groups, numerous organizations reportedly conduct explicit campaigns to influence opinions on social media, posing a risk to freedom of expression. Thus, there is a need to identify and eliminate "influence bots"--realistic, automated identities that illicitly shape discussions on sites like Twitter and Facebook--before they get too influential.
Assessing Differences in Athlete-Reported Outcomes Between High and Low-Quality Youth Sport Programs

The purpose of this study was to examine differences in athlete-reported outcomes based on sport program quality. Twenty-four sport programs were observed using the Program Quality Assessment in Youth Sport (PQAYS) observation tool. A two-step cluster analysis based on total PQAYS scores revealed two groups (low quality = 16, high quality = 8). Athletes (N = 324) completed 3 questionnaires related to basic needs support, needs satisfaction, and developmental experiences. Results indicated that athletes in high-quality programs perceived significantly greater opportunities for autonomy, relatedness, and choice, as well as higher perceptions of goal setting and lower negative experiences compared to youth in lower quality programs.
Factors associated with suicidal behaviour among depressed patients in Penang, Malaysia

Introduction This study aims to highlight the factors associated with suicidal behavior among patients with depressive disorders. Material and methods A retrospective (Jan 2002 – Dec 2007) evaluation of medical records was done at the psychiatric clinic at the Penang (Malaysia) Public Hospital. Data was analyzed using Statistical Package for Social Science SPSS version 13®. Chi-square (χ2) test was used to assess the association among variables. Odds ratios were calculated. Multiple logistic regression was applied to identify the predictors for suicidal behavior. Results Of 298 patients, 99 patients reported having thoughts of suicide. Overall, female respondents, particularly Chinese, constituted the majority reporting suicidal thoughts (p = 0.01). Cigarette (p < 0.01) and alcohol use (p < 0.01) were found to be associated with suicidal ideation. Among patients with medical comorbidities, diabetics were at a high risk for suicidal thoughts (odds ratio – OR = 1.05, 95% confidence interval – CI 0.45-2.46). In terms of social problems, marital and relationship difficulties were the main risk factors (OR = 2.03, 95% CI: 1.16-3.58). The significant predictors for suicidal behavior were found to be smoking and alcohol use (adjusted R2 = 0.39, F change = 75.55, p < 0.01). Conclusions Chinese females were found at higher risk of suicidal ideation, as were smokers and alcohol users. The elderly aged 50 and over were also at a higher risk, followed by adolescents and youths aged 15-24 years. Comorbid medical complications and social problems were other factors that may contribute to suicidal ideation among the patients with depressive disorders.
In the point of view security An efficient scheme with random oracle

We present in these papers a scheme, which bypasses the weakness presented in the existed scheme of IBE with random oracle. We propose, a secure scheme which project into Zp contrary to elliptic curve as with Boneh and Franklin. More, our scheme is basing in its study of simulation in the problem 4-EBDHP which is more efficient than q-BDHIP used by Skai Kasarah. We provide the prove of security of our scheme and we show its efficiency by comparison with the scheme declared above. Even if it we have a little cost in complexity, but as in the field cryptography we are more interested to the security, this makes our proposition more efficient.
Online hypergraph coloring with rejection

Abstract In this paper we investigate the online hypergraph coloring problem with rejection, where the algorithm is allowed to reject a vertex instead of coloring it but each vertex has a penalty which has to be paid if it is not colored. The goal is to minimize the sum of the number of the used colors for the accepted vertices and the total penalty paid for the rejected ones. We study the online problem which means that the algorithm receives the vertices of the hypergraph in some order v1, . , vn and it must decide about vi by only looking at the subhypergraph Hi = (Vi, Ei) where Vi = {v1, . , vi} and Ei contains the edges of the hypergraph which are subsets of Vi. We consider two models: in the full edge model only the edges where each vertex is accepted must be well-colored, in the trace model the subsets of the edges formed by the accepted vertices must be well colored as well. We consider proper and conflict free colorings. We present in each cases optimal online algorithms in the sense that they achieve asymptotically the smallest possible competitive ratio.
Formal Semantics and Analysis of BPMN Process Models using Petri Nets

The Business Process Modelling Notation (BPMN) is a standard for capturing business processes in the early phases of systems development. The mix of constructs found in BPMN makes it possible to obtain models with a range of semantic errors. The ability to statically check the semantic correctness of models is thus a desirable feature for modelling tools based on BPMN. However, the static analysis of BPMN models is hindered by ambiguities in the standard speciﬁcation and the complexity of the language. The fact that BPMN integrates constructs from graph-oriented process deﬁnition languages with features for concurrent execution of multiple instances of a subprocess and exception handling, makes it challenging to provide a formal semantics of BPMN. Even more challenging is to deﬁne a semantics that can be used to analyse BPMN models. This paper proposes a formal semantics of BPMN deﬁned in terms of a mapping to Petri nets, for which eﬃcient analysis techniques exist. The proposed mapping has been implemented as a tool that generates code in the Petri Net Markup Language. This formalisation exercise has also led to the identiﬁcation of a number of deﬁciencies in the BPMN standard speciﬁcation.
Ontology-Based Business Plan Classification

The problem of providing small and medium enterprises (SMEs) with good self-assessment tools is becoming more and more urgent every day, not only because of increasing market competition, but also because of new rules for credit granting, as for example the ones referred to as Basel II.One of the critical issues in designing supporting tools is the quality of the knowledge embedded in them. We maintain that a better quality of decisions can be obtained by exploiting not only quantitative information but also qualitative information and expert knowledge. Here we present a system able to classify the quality of innovation plans of SMEs by exploiting both quantitative and qualitative knowledge embedded in ontology. The ontological approach allows representing qualitative knowledge in a very natural way and, as a consequence, we are able to elicit it by means that are natural for SME officers, as for example questionnaires.