SoroushVahidi/scidocs huggingface dataset:
The effect of different types of corrective feedback on ESL student writing
(2005)

Debate about the value of providing corrective feedback on L2 writing has been prominent in recent years as a result of Truscott’s [Truscott, J. (1996). The case against grammar correction in L2 writing classes. Language Learning, 46, 327–369] claim that it is both ineffective and harmful and should therefore be abandoned. A growing body of empirical research is now investigating the agenda proposed by Ferris [Ferris, D.R. (1999). The case for grammar correction in L2 writing classes. A response to Truscott (1996). Journal of Second Language Writing, 8, 1–10, Ferris, D.R. (2004). The ‘‘Grammar Correction’’ debate in L2 writing: Where are we, and where do we go from here? (and what do we do in the meantime. . .?). Journal of Second Language Writing, 13, 49–62.]. Contributing to this research base, the study reported in this article investigated whether the type of feedback (direct, explicit written feedback and student–researcher 5 minute individual conferences; direct, explicit written feedback only; no corrective feedback) given to 53 adult migrant students on three types of error (prepositions, the past simple tense, and the definite article) resulted in improved accuracy in new pieces of writing over a 12 week period. The study found a significant effect for the combination of written and conference feedback on accuracy levels in the use of the past simple tense and the definite article in new pieces of writing but no overall effect on accuracy improvement for feedback types when the three error categories were considered as a single group. Significant variations in accuracy across the four pieces of writing support earlier SLA discoveries that L2 learners, in the process of acquiring new linguistic forms, may perform them with accuracy on one occasion but fail to do so on other similar occasions. # 2005 Elsevier Inc. All rights reserved.
Gut microbes and the brain: paradigm shift in neuroscience.
(2014)

The discovery of the size and complexity of the human microbiome has resulted in an ongoing reevaluation of many concepts of health and disease, including diseases affecting the CNS. A growing body of preclinical literature has demonstrated bidirectional signaling between the brain and the gut microbiome, involving multiple neurocrine and endocrine signaling mechanisms. While psychological and physical stressors can affect the composition and metabolic activity of the gut microbiota, experimental changes to the gut microbiome can affect emotional behavior and related brain systems. These findings have resulted in speculation that alterations in the gut microbiome may play a pathophysiological role in human brain diseases, including autism spectrum disorder, anxiety, depression, and chronic pain. Ongoing large-scale population-based studies of the gut microbiome and brain imaging studies looking at the effect of gut microbiome modulation on brain responses to emotion-related stimuli are seeking to validate these speculations. This article is a summary of emerging topics covered in a symposium and is not meant to be a comprehensive review of the subject.
Running on the bare metal with GeekOS
(2004)

Undergraduate operating systems courses are generally taught using one of two approaches: abstract or concrete. In the abstract approach, students learn the concepts underlying operating systems theory, and perhaps apply them using user-level threads in a host operating system. In the concrete approach, students apply concepts by working on a real operating system kernel. In the purest manifestation of the concrete approach, students implement operating system projects that run on real hardware.GeekOS is an instructional operating system kernel which runs on real hardware. It provides the minimum functionality needed to schedule threads and control essential devices on an x86 PC. On this foundation, we have developed projects in which students build processes, semaphores, a multilevel feedback scheduler, paged virtual memory, a filesystem, and inter-process communication. We use the Bochs emulator for ease of development and debugging. While this approach (tiny kernel run on an emulator) is not new, we believe GeekOS goes further towards the goal of combining realism and simplicity than previous systems have.
The Reorganization of Human Brain Networks Modulated by Driving Mental Fatigue
(2017)

The organization of the brain functional network is associated with mental fatigue, but little is known about the brain network topology that is modulated by the mental fatigue. In this study, we used the graph theory approach to investigate reconfiguration changes in functional networks of different electroencephalography (EEG) bands from 16 subjects performing a simulated driving task. Behavior and brain functional networks were compared between the normal and driving mental fatigue states. The scores of subjective self-reports indicated that 90 min of simulated driving-induced mental fatigue. We observed that coherence was significantly increased in the frontal, central, and temporal brain regions. Furthermore, in the brain network topology metric, significant increases were observed in the clustering coefficient (<italic>Cp</italic>) for beta, alpha, and delta bands and the character path length (<italic> Lp</italic>) for all EEG bands. The normalized measures <inline-formula><tex-math notation="LaTeX"> $\boldsymbol{\gamma}$</tex-math></inline-formula> showed significant increases in beta, alpha, and delta bands, and <inline-formula><tex-math notation="LaTeX">$\boldsymbol{\lambda}$</tex-math></inline-formula> showed similar patterns in beta and theta bands. These results indicate that functional network topology can shift the network topology structure toward a more economic but less efficient configuration, which suggests low wiring costs in functional networks and disruption of the effective interactions between and across cortical regions during mental fatigue states. Graph theory analysis might be a useful tool for further understanding the neural mechanisms of driving mental fatigue.
Automatic Image Annotation using Deep Learning Representations
(2015)

We propose simple and effective models for the image annotation that make use of Convolutional Neural Network (CNN) features extracted from an image and word embedding vectors to represent their associated tags. Our first set of models is based on the Canonical Correlation Analysis (CCA) framework that helps in modeling both views - visual features (CNN feature) and textual features (word embedding vectors) of the data. Results on all three variants of the CCA models, namely linear CCA, kernel CCA and CCA with k-nearest neighbor (CCA-KNN) clustering, are reported. The best results are obtained using CCA-KNN which outperforms previous results on the Corel-5k and the ESP-Game datasets and achieves comparable results on the IAPRTC-12 dataset. In our experiments we evaluate CNN features in the existing models which bring out the advantages of it over dozens of handcrafted features. We also demonstrate that word embedding vectors perform better than binary vectors as a representation of the tags associated with an image. In addition we compare the CCA model to a simple CNN based linear regression model, which allows the CNN layers to be trained using back-propagation.
A round- and computation-efficient three-party authenticated key exchange protocol
(2008)

In three-party authenticated key exchange protocols, each client shares a secret only with a trusted server with assists in generating a session key used for securely sending messages between two communication clients. Compared with two-party authenticated key exchange protocols where each pair of parties must share a secret with each other, a three-party protocol does not cause any key management problem for the parties. In the literature, mainly there exist three issues in three-party authenticated key exchange protocols are discussed that need to be further improved: (1) to reduce latency, communication steps in the protocol should be as parallel as possible; (2) as the existence of a security-sensitive table on the server side may cause the server to become compromised, the table should be removed; (3) resources required for computation should be as few as possible to avoid the protocol to become an efficiency bottleneck. In various applications over networks, a quick response is required especially by light-weight clients in the mobile e-commerce. In this paper, a roundand computation-efficient three-party authenticated key exchange protocol is proposed which fulfils all of the above mentioned requirements. 2007 Elsevier Inc. All rights reserved.
From eye movements to actions: how batsmen hit the ball
(2000)

In cricket, a batsman watches a fast bowler's ball come toward him at a high and unpredictable speed, bouncing off ground of uncertain hardness. Although he views the trajectory for little more than half a second, he can accurately judge where and when the ball will reach him. Batsmen's eye movements monitor the moment when the ball is released, make a predictive saccade to the place where they expect it to hit the ground, wait for it to bounce, and follow its trajectory for 100–200 ms after the bounce. We show how information provided by these fixations may allow precise prediction of the ball's timing and placement. Comparing players with different skill levels, we found that a short latency for the first saccade distinguished good from poor batsmen, and that a cricket player's eye movement strategy contributes to his skill in the game.
Gradient Flow in Recurrent Nets: the Difficulty of Learning Long-Term Dependencies
(2001)

D3EGF(FIH)J KMLONPEGQSRPETN UCV.WYX(Z R.[ V R6\M[ X N@]_^O\`JaNcb V RcQ W d EGKeL(^(QgfhKeLOE?i)^(QSj ETNPfPQkRl[ V R)m"[ X ^(KeLOEG^ npo qarpo m"[ X ^(KeLOEG^tsAu EGNPb V ^ v wyx zlwO{(|(}<~OC}((xp{ay.~A}_~ Cl3#|<Azw#|l6 (|  JpfhL XV EG^O QgJ  ETFOR] ^O\JNPb V RcQ X E)ETR 6EGKeLOETNcKMLOE F ETN V RcQgJp^(^OE ZgZ E i ^(Qkj EGNPfhQSRO E OE2m1Jp^ RcNY E VZ sO! ¡ q.n sCD X KGKa8¢EG^ RPNhE¤£ ¥¦Q ZgZ Es m§J^ RPNO E VZ s( ̈ X  EG©#EKas# V ^ V  V s(H a «a¬3­ ®#|.Y ̄y} xa°OC}l{x  yxlY~3{|  ±2Pz   V J Z J U N V fhKTJp^(Q  ETFOR J\ D vYf3RPEGb ́f V ^(§JpbF X RPETN@D KTQEG^(KTE i ^(QSjpEGNPfhQSR4vμJ\ U¶Z JaNPEG^(K·E jYQ V (Q ̧D V ^ R V m V N3R V aOs#1 o ¡Ga r U QNhE^OoTE1⁄4»,] R VZ vC1⁄2 3⁄4  x ± x  #¿ }À 3t}lC}2P}<~ ¬t[ X NPE^§D KeL(b ́Qg(L X ©yETN ]  DY]_Á JNPfhJÃÂ Z j EToQ V a rpopo2Ä X  V ^(J(sCD Å)QSRPoTEGN ZgV ^( Æ #|{3 ̄|.(C}.C¿Y}p Pzw
Edinburgh's Phrase-based Machine Translation Systems for WMT-14
(2014)

This paper describes the University of Edinburgh’s (UEDIN) phrase-based submissions to the translation and medical translation shared tasks of the 2014 Workshop on Statistical Machine Translation (WMT). We participated in all language pairs. We have improved upon our 2013 system by i) using generalized representations, specifically automatic word clusters for translations out of English, ii) using unsupervised character-based models to translate unknown words in RussianEnglish and Hindi-English pairs, iii) synthesizing Hindi data from closely-related Urdu data, and iv) building huge language on the common crawl corpus.
Extended Bandwidth Instantaneous Current Sharing Scheme for Parallel UPS Systems
(2017)

This paper investigates the suitability of instantaneous average current sharing scheme (IACS) for the parallel operation of three-phase uninterruptible power supply systems. A discrete-time model is developed for the analysis and design of the control loops. Some key issues are discussed based on the model and it is found that there is a compromise between system stability and current sharing performance with the conventional IACS scheme when the lengths of interconnecting cables are not negligible. Subsequently, an improved IACS scheme is proposed that ensures proper current sharing by extending the close-loop bandwidth. Its performance is analytically predicted and subsequently validated by experimental results on a 15-kW laboratory prototype.
AccessMiner: using system-centric models for malware protection
(2010)

Models based on system calls are a popular and common approach to characterize the run-time behavior of programs. For example, system calls are used by intrusion detection systems to detect software exploits. As another example, policies based on system calls are used to sandbox applications or to enforce access control. Given that malware represents a significant security threat for today's computing infrastructure, it is not surprising that system calls were also proposed to distinguish between benign processes and malicious code.
 Most proposed malware detectors that use system calls follows program-centric analysis approach. That is, they build models based on specific behaviors of individual applications. Unfortunately, it is not clear how well these models generalize, especially when exposed to a diverse set of previously-unseen, real-world applications that operate on realistic inputs. This is particularly problematic as most previous work has used only a small set of programs to measure their technique's false positive rate. Moreover, these programs were run for a short time, often by the authors themselves.
 In this paper, we study the diversity of system calls by performing a large-scale collection (compared to previous efforts) of system calls on hosts that run applications for regular users on actual inputs. Our analysis of the data demonstrates that simple malware detectors, such as those based on system call sequences, face significant challenges in such environments. To address the limitations of program-centric approaches, we propose an alternative detection model that characterizes the general interactions between benign programs and the operating system (OS). More precisely, our system-centric approach models the way in which benign programs access OS resources (such as files and registry entries). Our experiments demonstrate that this approach captures well the behavior of benign programs and raises very few (even zero) false positives while being able to detect a significant fraction of today's malware.
How do people solve the "weather prediction" task?: individual variability in strategies for probabilistic category learning.
(2002)

Probabilistic category learning is often assumed to be an incrementally learned cognitive skill, dependent on nondeclarative memory systems. One paradigm in particular, the weather prediction task, has been used in over half a dozen neuropsychological and neuroimaging studies to date. Because of the growing interest in using this task and others like it as behavioral tools for studying the cognitive neuroscience of cognitive skill learning, it becomes especially important to understand how subjects solve this kind of task and whether all subjects learn it in the same way. We present here new experimental and theoretical analyses of the weather prediction task that indicate that there are at least three different strategies that describe how subjects learn this task. (1) An optimal multi-cue strategy, in which they respond to each pattern on the basis of associations of all four cues with each outcome; (2) a one-cue strategy, in which they respond on the basis of presence or absence of a single cue, disregarding all other cues; or (3) a singleton strategy, in which they learn only about the four patterns that have only one cue present and all others absent. This variability in how subjects approach this task may have important implications for interpreting how different brain regions are involved in probabilistic category learning.
RISK FACTORS FOR INJURY TO WOMEN FROM DOMESTIC VIOLENCE
(2000)

A BSTRACT Background Domestic violence is the most common cause of nonfatal injury to women in the United States. To identify risk factors for such injuries, we examined the socioeconomic and behavioral characteristics of women who were victims of domestic violence and the men who injured them. Methods We conducted a case–control study at eight large, university-affiliated emergency departments. The 256 intentionally injured women had acute injuries resulting from a physical assault by a male partner. The 659 controls were women treated for other conditions in the emergency department. Information was collected with a standardized questionnaire; no information was obtained directly from the male partners. Results The 256 intentionally injured women had a total of 434 contusions and abrasions, 89 lacerations, and 41 fractures and dislocations. In a multivariate analysis, the characteristics of the partners that were most closely associated with an increased risk of inflicting injury as a result of domestic violence were alcohol abuse (adjusted relative risk, 3.6; 95 percent confidence interval, 2.2 to 5.9); drug use (adjusted relative risk, 3.5; 95 percent confidence interval, 2.0 to 6.4); intermittent employment (adjusted relative risk, 3.1; 95 percent confidence interval, 1.1 to 8.8); recent unemployment (adjusted relative risk, 2.7; 95 percent confidence interval, 1.2 to 6.5); having less than a high-school education (adjusted relative risk, 2.5; 95 percent confidence interval, 1.4 to 4.4); and being a former husband, estranged husband, or former boyfriend (adjusted relative risk, 3.5; 95 percent confidence interval, 1.5 to 8.3). Conclusions Women at greatest risk for injury from domestic violence include those with male partners who abuse alcohol or use drugs, are unemployed or intermittently employed, have less than a high-school education, and are former husbands, estranged husbands, or former boyfriends of the women. (N Engl J Med 1999;341:1892-8.)
Private and Accurate Data Aggregation against Dishonest Nodes
(2016)

Privacy-preserving data aggregation in ad hoc networks is a challenging problem, considering the distributed communication and control requirement, dynamic network topology, unreliable communication links, etc. The difficulty is exaggerated when there exist dishonest nodes, and how to ensure privacy, accuracy, and robustness against dishonest nodes remains a n open issue. Different from the widely used cryptographic approaches, in this paper, we address this challenging proble m by exploiting the distributed consensus technique. We first pr opose a secure consensus-based data aggregation (SCDA) algorith m that guarantees an accurate sum aggregation while preservi ng the privacy of sensitive data. Then, to mitigate the polluti on from dishonest nodes, we propose an Enhanced SCDA (E-SCDA) algorithm that allows neighbors to detect dishonest nodes, and derive the error bound when there are undetectable dishones t nodes. We prove the convergence of both SCDA and E-SCDA. We also prove that the proposed algorithms are(ǫ, σ)-dataprivacy, and obtain the mathematical relationship betweenǫ and σ. Extensive simulations have shown that the proposed algori thms have high accuracy and low complexity, and they are robust against network dynamics and dishonest nodes.
Predicting student academic performance in an engineering dynamics course: A comparison of four types of predictive mathematical models
(2013)

Predicting student academic performance has long been an important research topic in many academic disciplines. The present study is the first study that develops and compares four types of mathematical models to predict student academic performance in engineering dynamics – a high-enrollment, highimpact, and core course that many engineering undergraduates are required to take. The four types of mathematical models include the multiple linear regression model, the multilayer perception network model, the radial basis function network model, and the support vector machine model. The inputs (i.e., predictor variables) of the models include student’s cumulative GPA, grades earned in four pre-requisite courses (statics, calculus I, calculus II, and physics), and scores on three dynamics mid-term exams (i.e., the exams given to students during the semester and before the final exam). The output of the models is students’ scores on the dynamics final comprehensive exam. A total of 2907 data points were collected from 323 undergraduates in four semesters. Based on the four types of mathematical models and six different combinations of predictor variables, a total of 24 predictive mathematical models were developed from the present study. The analysis reveals that the type of mathematical model has only a slight effect on the average prediction accuracy (APA, which indicates on average how well a model predicts the final exam scores of all students in the dynamics course) and on the percentage of accurate predictions (PAP, which is calculated as the number of accurate predictions divided by the total number of predictions). The combination of predictor variables has only a slight effect on the APA, but a profound effect on the PAP. In general, the support vector machine models have the highest PAP as compared to the other three types of mathematical models. The research findings from the present study imply that if the goal of the instructor is to predict the average academic performance of his/her dynamics class as a whole, the instructor should choose the simplest mathematical model, which is the multiple linear regression model, with student’s cumulative GPA as the only predictor variable. Adding more predictor variables does not help improve the average prediction accuracy of any mathematical model. However, if the goal of the instructor is to predict the academic performance of individual students, the instructor should use the support vector machine model with the first six predictor variables as the inputs of the model, because this particular predictor combination increases the percentage of accurate predictions, and most importantly, allows sufficient time for the instructor to implement subsequent educational interventions to improve student learning. 2012 Elsevier Ltd. All rights reserved.
Elephant herding optimization algorithm for support vector machine parameters tuning
(2017)

Classification is part of various applications and it is an important problem that represents active research topic. Support vector machine is one of the widely used and very powerful classifier. The accuracy of support vector machine highly depends on learning parameters. Optimal parameters can be efficiently determined by using swarm intelligence algorithms. In this paper, we proposed recent elephant herding optimization algorithm for support vector machine parameter tuning. The proposed approach is tested on standard datasets and it was compared to other approaches from literature. The results of computational experiments show that our proposed algorithm outperformed genetic algorithms and grid search considering accuracy of classification.
New generation waveform approaches for 5G and beyond
(2016)

For 5G and beyond cellular communication systems, new waveform development studies have been continuing in the whole world. Solutions for providing high throughput, high data rates, low latency, large number of terminals, supporting multiple antenna systems, and the related problems originated from these issues are playing an important role in the development of 5G and new waveform technologies. OFDM which has many important advantages continues to be included in various standards. However, because of its disadvantages, OFDM will not be sufficient for dynamic spectrum access and cognitive radio applications in new generation communication systems gradually. Additionally, OFDM is not suitable for asynchronous networks and radios which we expect to see commonly in the future. In this study, some potential candidate 5G waveforms are examined and various comparisons are carried out. Besides, assessments about future hybrid solutions are presented.