SoroushVahidi/scidocs huggingface dataset:
Optimizing long short-term memory recurrent neural networks using ant colony optimization to predict turbine engine vibration
(2018)

This article expands on research that has been done to develop a recurrent neural network (RNN) capable of predicting aircraft engine vibrations using long short-term memory (LSTM) neurons. LSTM RNNs can provide a more generalizable and robust method for prediction over analytical calculations of engine vibration, as analytical calculations must be solved iteratively based on specific empirical engine parameters, making this approach ungeneralizable across multiple engines. In initial work, multiple LSTM RNN architectures were proposed, evaluated and compared. This research improves the performance of the most effective LSTM network design proposed in the previous work by using a promising neuroevolution method based on ant colony optimization (ACO) to develop and enhance the LSTM cell structure of the network. A parallelized version of the ACO neuroevolution algorithm has been developed and the evolved LSTM RNNs were compared to the previously used fixed topology. The evolved networks were trained on a large database of flight data records obtained from an airline containing flights that suffered from excessive vibration. Results were obtained using MPI (Message Passing Interface) on a high performance computing (HPC) cluster, evolving 1000 different LSTM cell structures using 168 cores over 4 days. The new evolved LSTM cells showed an improvement of 1.35%, reducing prediction error from 5.51% to 4.17% when predicting excessive engine vibrations 10 seconds in the future, while at the same time dramatically reducing the number of weights from 21,170 to 11,810.
Innovations in the Field of Child Abuse and Neglect Prevention : A Review of the Literature
(2012)

ii Acknowledgments I would like to thank all of the experts I interviewed during the process of writing this paper. Their deep understanding of the history and visions for the future of child maltreatment prevention provided a strong foundation for this work and guided the direction and structure of the project overall. I am grateful for how generous they were with their time and wisdom. The names and affiliations of all the professionals that participated in an interview are listed in Appendix A. Additionally, I would like to thank my mentor, Dr. Deborah Daro. She is a creative and sophisticated thinker, an eloquent and articulate writer, and a passionate and inspiring leader moving child abuse and neglect prevention efforts forward. Lastly, I would like to thank Anne Clary and Matthew Brenner for lending their editing expertise, and the greater Chapin Hall community for their support. Trend #2: Social context and culture can protect the developing child and strengthen parental capacity in important ways that can buffer against individual and contextual risk factors.. Trend #6: Implementation science offers program managers effective research frameworks to monitor and strengthen the service delivery process and to improve the odds of replicating model programs with fidelity and quality.. Trend #7: Maximizing population-level change requires new understanding of how to construct and sustain effective state systems, local community collaboration, and robust community-based Trend #8: New technologies offer important, cost-effective opportunities for advancing our reach into new populations and supporting direct service providers.. 1 Introduction Child maltreatment prevention policy and practice have been driven by a continuous stream of innovation generated by researchers, advocates, and practitioners working across disciplines to improve child safety and well-being. Settlement homes were established in the late 19 th century, social work was professionalized in the early 20 th century, child abuse injuries were identified and findings published by pediatric radiologist John Caffey and pediatrician Henry Kempe in the 1960s, and the federal government passed the Child Abuse Prevention and Treatment Act of 1972. Progress in the field has always been determined by the diligence of thought leaders in a multitude of professions and the collaboration of diverse and unlikely partners (Myers, 2011, p. 1166). Today, the nation faces an excruciating economic climate, and many parents find it hard to meet their children's most basic needs. Simultaneously, political pressure is mounting to cut social services and reduce government spending, and, as a …
Gaps as characters in sequence-based phylogenetic analyses.
(2000)

In the analysis of sequence-based data matrices, the use of different methods of treating gaps has been demonstrated to influence the resulting phylogenetic hypotheses (e.g., Eernisse and Kluge, 1993; Vogler and DeSalle, 1994; Simons and May den, 1997). Despite this influence, a well-justified, uniformly applied method of treating gaps is lacking in sequence-based phylogenetic studies. Treatment of gaps varies widely from secondarily mapping gaps onto the tree inferred from base characters to treating all gaps as separate characters or character states (Gonzalez, 1996). This diversity of approaches demonstrates the need for a comprehensive discussion of indel (insertion or deletion) coding and a robust method with which to incorporate gap characters into tree searches. We use the term "indel coding" instead of "gap coding" because the term "gap coding" has already been applied to coding quantitative characters (Mickevich and Johnson, 1976; Archie, 1985). Although "indel coding" undesirably refers to processes that are not observed (insertions and deletions) instead of patterns that are observed (gaps), the term is unambiguous and does not co-opt established terminology. The purpose of this paper is to discuss the implications of each of the methods of treating gaps in phylogenetic analyses, to allow workers to make informed choices among them. We suggest that gaps should be coded as characters in phylogenetic analyses, and we propose two indel-coding methods. We discuss four main points: (1) the logical independence of alignment and tree search; (2) why gaps are properly coded as characters; (3) how gaps should be coded as characters; and (4) problems with a priori weighting of gap characters during tree search. LOGICAL INDEPENDENCE
Depth Estimation From a Light Field Image Pair With a Generative Model
(2019)

In this paper, we propose a novel method to estimate the disparity maps from a light field image pair captured by a pair of light field cameras. Our method integrates two types of critical depth cues, which are separately inferred from the epipolar plane images and binocular stereo vision into a global solution. At the same time, in order to produce highly accurate disparity maps, we adopt a generative model, which can estimate a light field image only with the central subaperture view and corresponding hypothesized disparity map. The objective function of our method is formulated to minimize two energy terms/differences. One is the difference between the two types of previously extracted disparity maps and the target disparity maps, directly optimized in the gray-scale disparity space. The other indicates the difference between the estimated light field images and the input light field images, optimized in the RGB color space. Comprehensive experiments conducted on real and virtual scene light field image pairs demonstrate the effectiveness of our method.
Ezetimibe - a new approach in hypercholesterolemia management.
(2012)

Suchy et al. [10] discuss the benefits of ezetimibe beyond lipid-lowering as well as its effects on atherosclerosis. Some comments may be of interest. Reducing low density lipoprotein cholesterol (LDL-C) is the main indication for ezetimibe [2, 7, 8]. This drug is useful in patients who cannot achieve LDL-C goals on statins or those who are statin intolerant [2, 4, 7, 8]. Meta-analyses suggested that adding ezetimibe decreases LDL-C levels more than statin monotherapy, after doubling the dose of a statin or selecting a more potent statin [2, 7, 8]. It was also suggested that ezetimibe can increase LDL particle size, especially in patients with high triglyceride levels [3, 11]. Ezetimibe may exert other beneficial actions which may or may not be related to its hypolipidemic capacity (e.g., for non-alcoholic fatty liver disease and renoprotection) [6]. Ezetimibe monotherapy reduced the plasma mass and activity of lipoprotein-associated phospholipase A2 (Lp-PLA2), which is considered risk predictor of cardiovascular (CV) events [9]. Furthermore, ezetimibe may lower the levels of oxidative stress markers [5]. In the end, the most important issue is reducing vascular events. In this context, the Study of Heart and Renal Protection (SHARP) [1] reported that the combination of ezetimibe with simvastatin was associated with reduced risk of CV events compared with placebo after 4.9 years in patients (n = 9,270) who are pre-dialysis or on dialysis. The clinical relevance of these points and those addressed by Suchy et al. [10] requires to be established by future studies.
Model Predictive Control for Distributed Microgrid Battery Energy Storage Systems
(2018)

This brief proposes a new convex model predictive control (MPC) strategy for dynamic optimal power flow between battery energy storage (ES) systems distributed in an ac microgrid. The proposed control strategy uses a new problem formulation, based on a linear <inline-formula> <tex-math notation="LaTeX">$d$ </tex-math></inline-formula>–<inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula> reference frame voltage-current model and linearized power flow approximations. This allows the optimal power flows to be solved as a convex optimization problem, for which fast and robust solvers exist. The proposed method does not assume that real and reactive power flows are decoupled, allowing line losses, voltage constraints, and converter current constraints to be addressed. In addition, nonlinear variations in the charge and discharge efficiencies of lithium ion batteries are analyzed and included in the control strategy. Real-time digital simulations were carried out for an islanded microgrid based on the IEEE 13 bus prototypical feeder, with distributed battery ES systems and intermittent photovoltaic generation. It is shown that the proposed control strategy approaches the performance of a strategy based on nonconvex optimization, while reducing the required computation time by a factor of 1000, making it suitable for a real-time MPC implementation.
A Slacker Coherence Protocol for Pull-based Monitoring of On-line Data Sources �
(2003)

An increasing number of online applications operate on data from disparate, and often wide-spread, data sources. This paper studies the design of a system for the automated monitoring of on-line data sources. In this system a number of ad-hoc data warehouses, which maintain client-specified views, are interposed between clients and data sources. We present a model of coherence, referred to here as slacker coherence, to address the freshness problem in the context of pull-based protocols. We experimentally examine various techniques for estimating update rates and polling adaptively. We also look at the impact on the coherence model performance of the request scheduling algorithm at the source.
Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application
(1990)

In their 1971 paper on the Traveling Salesman Problem and Minimum Spanning Trees, Held and Karp showed that finding an optimally weighted 1-tree is equivalent to solving a linear program for the Traveling Salesman Problem (TSP) with only node-degree constraints and subtour elimination constraints. In this paper we show that the Held-Karp 1-trees have a certain monotonicity property: given a particular instance of the symmetric TSP with triangle inequality, the cost of the minimum weighted 1-tree is monotonic with respect to the set of nodes included. As a consequence, we obtain an alternate proof of a result of Wolsey and show that linear programs with node-degree and subtour elimination constraints must have a cost at least 23OPT , where OPT is the cost of the optimum solution to the TSP instance. The traveling salesman problem is one of the most notorious in the field of combinatorial optimization, and one of the most well-studied [7]. Currently, the most successful approach to finding optimal solutions to large-scale problems is based on formulating the problem as a linear program and finding explicit partial descriptions of this linear polytope [5], [8]. The most natural constraints are derived from an integer linear programming formulation that uses nodedegree constraints and subtour elimination constraints. We focus our attention on symmetric instances of the TSP that obey the triangle inequality. Let V = {1, 2, . . . , n} denote the set of nodes. For any distinct i and j, assign a cost cij such that cij = cji, and for any k distinct from i and j, cij ≤ cik + ckj . Then the Subtour LP on this instance is B = min ∑ 1≤i<j≤n cijxij subject to: ∑ j>i xij + ∑ j<i xji = 2, i = 1, 2, . . . , n, ∑ i∈S,j∈S,i<j xij ≤ |S|− 1, for any proper subsetS ⊂ V, 0 ≤ xij ≤ 1, 1 ≤ i < j ≤ n. (1) ∗This research was supported in part by Air Force Contract AFOSR-86-0078 and by the National Science Foundation under a Presidential Young Investigator Award CCR-8996272 with matching support from IBM, Sun, and UPS.
A question answering system based on VerbNet frames
(2008)

The precision of the answer is now essential for a question answering system, because of the large amount of free texts on the Internet. Attempting to achieve a high precision, we propose a question answering system supported by case grammar theory and based on VerbNet frames. It extracts the syntactic, thematic and semantic information from the question to filter out unmatched sentences in semantic level and to extract answer chunk (a phrase or a word that can answer the question) from the answer sentence. VerbNet is applied in our system to detect the verb frames in question and candidate sentences, so that the syntactic and thematic information as well as semantic information can be therefore obtained. Our question answering system works well especially for answering factoid questions. The experiments show that our approach is able to filter out semantically unmatched sentences effectively and therefore rank the correct answer (s) higher in the result list.
A comparative study of arbitration algorithms for the Alpha 21364 pipelined router
(2002)

Interconnection networks usually consist of a fabric of interconnected routers, which receive packets arriving at their input ports and forward them to appropriate output ports. Unfortunately, network packets moving through these routers are often delayed due to conflicting demand for resources, such as output ports or buffer space. Hence, routers typically employ arbiters that resolve conflicting resource demands to maximize the number of matches between packets waiting at input ports and free output ports. Efficient design and implementation of the algorithm running on these arbiters is critical to maximize network performance.This paper proposes a new arbitration algorithm called SPAA (Simple Pipelined Arbitration Algorithm), which is implemented in the Alpha 21364 processor's on-chip router pipeline. Simulation results show that SPAA significantly outperforms two earlier well-known arbitration algorithms: PIM (Parallel Iterative Matching) and WFA (Wave-Front Arbiter) implemented in the SGI Spider switch. SPAA outperforms PIM and WFA because SPAA exhibits matching capabilities similar to PIM and WFA under realistic conditions when many output ports are busy, incurs fewer clock cycles to perform the arbitration, and can be pipelined effectively. Additionally, we propose a new prioritization policy called the Rotary Rule, which prevents the network's adverse performance degradation from saturation at high network loads by prioritizing packets already in the network over new packets generated by caches or memory.
Combinatory Categorial Grammar
(2007)

Combinatory Categorial Grammar (CCG) is a radically lexicalized theory of grammar in which all language-specific information, including the linear order of heads, arguments, and adjuncts, is specified in the lexicon, from which it is projected onto sentences by language-independent universal typedependent combinatory rules of low “slightly non-context-free” expressive power, applying to strictly adjacent phonologically-realised categories. Syntactic and phonological derivation are isomorphic, and are synchronously coupled with semantic composition in a purely type-dependent rule-to-rule relation.
Real-Time Visibility-Based Fusion of Depth Maps
(2007)

We present a viewpoint-based approach for the quick fusion of multiple stereo depth maps. Our method selects depth estimates for each pixel that minimize violations of visibility constraints and thus remove errors and inconsistencies from the depth maps to produce a consistent surface. We advocate a two-stage process in which the first stage generates potentially noisy, overlapping depth maps from a set of calibrated images and the second stage fuses these depth maps to obtain an integrated surface with higher accuracy, suppressed noise, and reduced redundancy. We show that by dividing the processing into two stages we are able to achieve a very high throughput because we are able to use a computationally cheap stereo algorithm and because this architecture is amenable to hardware-accelerated (GPU) implementations. A rigorous formulation based on the notion of stability of a depth estimate is presented first. It aims to determine the validity of a depth estimate by rendering multiple depth maps into the reference view as well as rendering the reference depth map into the other views in order to detect occlusions and free- space violations. We also present an approximate alternative formulation that selects and validates only one hypothesis based on confidence. Both formulations enable us to perform video-based reconstruction at up to 25 frames per second. We show results on the multi-view stereo evaluation benchmark datasets and several outdoors video sequences. Extensive quantitative analysis is performed using an accurately surveyed model of a real building as ground truth.
Deep spatial autoencoders for visuomotor learning
(2016)

Reinforcement learning provides a powerful and flexible framework for automated acquisition of robotic motion skills. However, applying reinforcement learning requires a sufficiently detailed representation of the state, including the configuration of task-relevant objects. We present an approach that automates state-space construction by learning a state representation directly from camera images. Our method uses a deep spatial autoencoder to acquire a set of feature points that describe the environment for the current task, such as the positions of objects, and then learns a motion skill with these feature points using an efficient reinforcement learning method based on local linear models. The resulting controller reacts continuously to the learned feature points, allowing the robot to dynamically manipulate objects in the world with closed-loop control. We demonstrate our method with a PR2 robot on tasks that include pushing a free-standing toy block, picking up a bag of rice using a spatula, and hanging a loop of rope on a hook at various positions. In each task, our method automatically learns to track task-relevant objects and manipulate their configuration with the robot's arm.
Constructivism and Computer-Mediated Communication in Distance Education
(1995)

The fields of learning theory and instructional design are in the midst of a scientific revolution in which their objectivist philosophical foundations are being replaced by a constructivist epistemology. This article describes the assumptions of a constructivist epistemology, contrasts them with objectivist assumptions, and then describes instructional systems that can support constructive learning at a distance Limitations of Distance Learning Technologies In an effort to supplement or replace live face-to-face instruction, technologicany mediated distance learning has more often than not merely replicated the ineffective methods that limit learning in face-to-face classrooms (Turoff 1995). Too often, potentially interactive technologies are used to present one-way lectures to students in remote locations. However, we believe that the most valuable activity in a classroom of any kind is the opportunity for students to work and interact together and to build and become part of a community of scholars and practitioners (Selfe and Eilola 1989; Bates 1990; Seaton 1993; Nalley 1995). A good learning experience is one in which a student can "master new knowledge and skills, criticany examine assumptions and beliefs, and engage in an invigorating, collaborative quest for wisdom and personal, holistic development" (Eastmond and Ziegahn 1995, 59). Technology used in distance education should facilitate these "good learning experiences" in an "extended classroom model" rather than broadcast teacher-centered lectures and demonstrations (Burge and Roberts 1993). A significant impediment to this goal is the fact that many teachers and instructional designers come to distance education from traditional backgrounds, bringing with them assumptions about teaching and learning that are not theory-based and do not translate well to technologicany mediated instruction (Schieman, Taere, and McLaren 1992).
Blockchain Based Access Control
(2017)

Access Control systems are used in computer security to regulate the access to critical or valuable resources. The rights of subjects to access such resources are typically expressed through access control policies, which are evaluated at access request time against the current access context. This paper proposes a new approach based on blockchain technology to publish the policies expressing the right to access a resource and to allow the distributed transfer of such right among users. In our proposed protocol the policies and the rights exchanges are publicly visible on the blockchain, consequently any user can know at any time the policy paired with a resource and the subjects who currently have the rights to access the resource. This solution allows distributed auditability, preventing a party from fraudulently denying the rights granted by an enforceable policy. We also show a possible working implementation based on XACML policies, deployed on the Bitcoin blockchain.
Internet of vehicles: From intelligent grid to autonomous cars and vehicular clouds
(2014)

Traditionally, the vehicle has been the extension of the man's ambulatory system, docile to the driver's commands. Recent advances in communications, controls and embedded systems have changed this model, paving the way to the Intelligent Vehicle Grid. The car is now a formidable sensor platform, absorbing information from the environment (and from other cars) and feeding it to drivers and infrastructure to assist in safe navigation, pollution control and traffic management. The next step in this evolution is just around the corner: the Internet of Autonomous Vehicles. Pioneered by the Google car, the Internet of Vehicles will be a distributed transport fabric capable to make its own decisions about driving customers to their destinations. Like other important instantiations of the Internet of Things (e.g., the smart building), the Internet of Vehicles will have communications, storage, intelligence, and learning capabilities to anticipate the customers' intentions. The concept that will help transition to the Internet of Vehicles is the Vehicular Cloud, the equivalent of Internet cloud for vehicles, providing all the services required by the autonomous vehicles. In this article, we discuss the evolution from Intelligent Vehicle Grid to Autonomous, Internet-connected Vehicles, and Vehicular Cloud.