Aspect-based Sentiment Analysis of Scientific Reviews

Scientific papers are complex and understanding the usefulness of these papers requires prior knowledge. Peer reviews are comments on a paper provided by designated experts on that field and hold a substantial amount of information, not only for the editors and chairs to make the final decision, but also to judge the potential impact of the paper. In this paper, we propose to use aspect-based sentiment analysis of scientific reviews to be able to extract useful information, which correlates well with the accept/reject decision. While working on a dataset of close to 8k reviews from ICLR, one of the top conferences in the field of machine learning, we use an active learning framework to build a training dataset for aspect prediction, which is further used to obtain the aspects and sentiments for the entire dataset. We show that the distribution of aspect-based sentiments obtained from a review is significantly different for accepted and rejected papers. We use the aspect sentiments from these reviews to make an intriguing observation, certain aspects present in a paper and discussed in the review strongly determine the final recommendation. As a second objective, we quantify the extent of disagreement among the reviewers refereeing a paper. We also investigate the extent of disagreement between the reviewers and the chair and find that the inter-reviewer disagreement may have a link to the disagreement with the chair. One of the most interesting observations from this study is that reviews, where the reviewer score and the aspect sentiments extracted from the review text written by the reviewer are consistent, are also more likely to be concurrent with the chair's decision.Comment: Accepted in JCDL'2

Developing general cultural awareness in a monocultural English as a foreign language context in a Mexican university: a wiki-based critical incident approach

© 2013 Association for Language Learning. This article explores what the ‘intercultural turn’ might mean in the case of teaching English to speakers of other languages (TESOL). The discussion is contextualised in what has been termed the ‘expanding circle’ of English and focuses on an English as a foreign language (EFL) class in a Mexican university, a context where the full implications of a shift from EFL to English as a lingua franca (ELF) have yet to be addressed. We consider how the intercultural turn might be understood in this Mexican context and then present the rationale for, and design of, a technology-based (wiki) extra-curricular pilot project which adopted less of an EFL/cultural and more of an ELF/intercultural approach. We evaluate the evidence from this small-scale project in terms of students\u27 developing general cultural awareness and suggest that this type of project, an example of the intercultural turn, might be more widely applicable in similar ‘expanding circle’ EFL contexts

TCP Dynamic Acknowledgment Delay: Theory and Practice

Daniel R. Dooly and Sally A. Goldman and Stephen D. Scott Dept. of Computer Science Washington University St. Louis, MO 63130 (drd1, sg, sds)@cs.wustl.edu Abstract We study an on-line problem that is motivated by the networking problem of dynamically adjusting delays of acknowledgments in the Transmission Control Protocol (TCP). The theoretical problem we study is the following. There is a sequence of n packet arrival times A = ha1 ; : : : ; ani and a look-ahead coefficient L. The goal is to partition A into k subsequences oe 1 ; oe 2 ; : : : ; oe k (where a subsequence end is defined by an acknowledgment) that minimizes a linear combination of the cost for the number of acknowledgments sent and the cost for the additional latency introduced by delaying acknowledgments. At each arrival, an oracle provides the algorithm with the times of the next L arrivals. First we give an O(n 2 ) dynamic programming algorithm for optimally solving the off-line problem. Then we describe an on-line algorithm that greedily acknowledges exactly when the cost for an acknowledgment is less than the latency cost obtained by not acknowledging. We show that for this algorithm there is a sequence of n packet arrivals for which it is\Omega \Gamma p n \Delta -competitive. Next we present a second on-line algorithm which is a slight modification of the first that we prove is 2-competitive. Let Copt be the cost of the optimal solution and let CA be the cost of the solution produced by algorithm A. We then show that for any on-line algorithm A with any constant look-ahead L, CA 2Copt \Gamma c where c is a factor that can be made arbitrarily small with respect to Copt . Thus, in the worst case, our result for L = 0 is the best possible even for on-line algorithms that can use any ..

Uncovering Innovation Practices and Requirements in Privacy and Cyber Security Organisations: Insights from IPACSO

A pressing challenge facing the cybersecurity and privacy re-search community is transitioning technical R&D into commercial and market-place ready products and services. Responding to the need to develop a better understanding of how Privacy and CyberSecurity (PACS) market needs and overall technology innovation best-practice can be harmonized more effectively the contribution of this paper is centred upon uncovering PACS stakeholders’ innovation practices, requirements, and challenges and in doing so highlighting scope for innovation intervention supports. The research outputs impacts and has implications at various levels, most notably in terms of framing both innovator and firm-level innovation requirements within the PACS domain, which has relevance to academic and policy making audiences also. Additionally, given that the research outputs form a pivotal component of the IPACSO project, they will actively contribute to ongoing debates and objectives around shaping support measures for PACS innovation awareness, competency building and innovation policy support developments in the domain