nils-herrmann/clean_scirepeval huggingface dataset:
Applying Reinforcement Learning to Blackjack Using Q-Learning

Blackjack is a popular card game played in many casinos. The objective of the game is to win money by obtaining a point total higher than the dealer’s without exceeding 21. Determining an optimal blackjack strategy proves to be a difficult challenge due to the stochastic nature of the game. This presents an interesting opportunity for machine learning algorithms. Supervised learning techniques may provide a viable solution, but do not take advantage of the inherent reward structure of the game. Reinforcement learning algorithms generally perform well in stochastic environments, and could utilize blackjack's reward structure. This paper explores reinforcement learning as a means of approximating an optimal blackjack strategy using the Q-learning algorithm.
Toward autonomous mapping and exploration for mobile robots through deep supervised learning

We consider an autonomous mapping and exploration problem in which a range-sensing mobile robot is guided by an information-based controller through an a priori unknown environment, choosing to collect its next measurement at the location estimated to yield the maximum information gain within its current field of view. We propose a novel and time-efficient approach to predict the most informative sensing action using a deep neural network. After training the deep neural network on a series of thousands of randomly-generated “dungeon maps”, the predicted optimal sensing action can be computed in constant time, with prospects for appealing scalability in the testing phase to higher dimensional systems. We evaluated the performance of deep neural networks on the autonomous exploration of two-dimensional workspaces, comparing several different neural networks that were selected due to their success in recent ImageNet challenges. Our computational results demonstrate that the proposed method provides high efficiency as well as accuracy in selecting informative sensing actions that support autonomous mobile robot exploration.
Periodic Leaky-Wave Antenna Array With Horizontally Polarized Omnidirectional Pattern

A novel periodic leaky-wave antenna for broadside radiation with horizontally polarized omnidirectional pattern is proposed, designed and demonstrated experimentally. The objective is to achieve a horizontally polarized omnidirectional antenna array with highly directive beam. The proposed structure is based on combining the rotating electric field method and a leaky-wave antenna design. By properly designing a unit cell with a pair of crossed dipoles spaced at a distance approximately equal to λg/4 at the center frequency, not only omnidirectional radiation pattern with horizontal polarization is obtained by crossed dipoles fed in phase quadrature, but also the open-stopband effect exhibited at broadside scan is significantly reduced. The analysis and design of this structure are performed on the basis of a simple equivalent network model. A finite structure formed by 16-unit cell (32-element) for broadside beam is developed at the 2.4 GHz band, which offers a horizontally polarized omnidirectional radiation pattern with enhanced gain of 9.9-10.6 dBi and measured radiation efficiency of 90% for the covering bands.
Analysis of mushroom-like electromagnetic band gap structure using suspended transmission line technique

In this report, an analysis of a mushroom EBG (mEBG) structure using method of suspended transmission line has been discussed. This structure consists of nine elements of metallic patch grounded with metal. The parametric studies are patch width, substrate thickness, relative permittivity, gap width between adjacent patch and the size of via radius. These studies involve the bandstop and bandpass characteristic of the electromagnetic bad gap structure. The result shows that the bandstop frequency of mEBG structure is affected when varying each of the parameters. This is due to the changes of the equivalent LC network of the mushroom-like EBG structures. By increasing the value of the patch width and relative permittivity, the operating frequency and bandwidth will decay due to the increment of the total capacitance value. Varying the gap between adjacent patches does not give significant effect to the band gap frequency because it only changes the value of fringe capacitor, which is very small compared to the overall capacitances. Increasing the size of via radius will increase the frequency band gap and bandwidth due to the reduction of total capacitance. Lastly, increasing the substrate thickness will reduce the operating frequency however increase the bandwidth. This is because the value of inductor increases more than the increment of the total capacitance.
An affective computational model for machine consciousness

In the past, several models of consciousness have become popular and have led to the development of models for machine consciousness with varying degrees of success and challenges for simulation and implementations. Moreover, affective computing attributes that involve emotions, behavior and personality have not been the focus of models of consciousness as they lacked motivation for deployment in software applications and robots. The affective attributes are important factors for the future of machine consciousness with the rise of technologies that can assist humans. Personality and affection hence can give an additional flavor for the computational model of consciousness in humanoid robotics. Recent advances in areas of machine learning with a focus on deep learning can further help in developing aspects of machine consciousness in areas that can better replicate human sensory perceptions such as speech recognition and vision. With such advancements, one encounters further challenges in developing models that can synchronize different aspects of affective computing. In this paper, we review some existing models of consciousnesses and present an affective computational model that would enable the human touch and feel for robotic systems.
Your Chi-Square Test is Statistically Significant : Now What ?

Applied researchers have employed chi-square tests for more than one hundred years. This paper addresses the question of how one should follow a statistically significant chi-square test result in order to determine the source of that result. Four approaches were evaluated: calculating residuals, comparing cells, ransacking, and partitioning. Data from two recent journal articles were used to illustrate these approaches. A call is made for greater consideration of foundational techniques such as the chi-square tests.
Learning user profiles for personalized information dissemination

Personalized information systems represent the recent e ort of delivering information to users more e ectively in the modern electronic age. This paper illustrates how a supervised Adaptive Resonance Theory (ART) system, known as fuzzy ARAM, can be used to learn user proles for personalized information dissemination. ARAM learning is on-line, fast, and incremental. Acquisition of new knowledge does not require re-training on previously learned cases. ARAM integrates both user-de ned and system-learned knowledge in a single framework. Therefore inconsistency between the two knowledge sources will not arise. ARAM has been used to develop a personalized news system known as PIN. Preliminary experiments have veri ed that PIN is able to provide personalized news by adapting to user's interests in an on-line manner and generalizing to new information on-they.
Learning A Task-Specific Deep Architecture For Clustering

While sparse coding-based clustering methods have shown to be successful, their bottlenecks in both efficiency and scalability limit the practical usage. In recent years, deep learning has been proved to be a highly effective, efficient and scalable feature learning tool. In this paper, we propose to emulate the sparse coding-based clustering pipeline in the context of deep learning, leading to a carefully crafted deep model benefiting from both. A feed-forward network structure, named TAGnet, is constructed based on a graphregularized sparse coding algorithm. It is then trained with taskspecific loss functions from end to end. We discover that connecting deep learning to sparse coding benefits not only the model performance, but also its initialization and interpretation. Moreover, by introducing auxiliary clustering tasks to the intermediate feature hierarchy, we formulate DTAGnet and obtain a further performance boost. Extensive experiments demonstrate that the proposed model gains remarkable margins over several state-of-the-art methods.
Secure Communications with D 2 D Cooperation

Device to Device (D2D) communication provides a promising technique for 5G wireless networks, supporting higher data rates. Security of data transmission over wireless clouds could put constraints on devices; whether to cooperate or not. Therefore, our aim is to provide analytical framework for the security at the physical layer and to define the constraints embodied with cooperation in wireless clouds . In this paper, two legitimate transmitters Alice and John cooperate to increase the reliable transmission rate received by their common legitimate receiver Bob, where one eavesdropper, Eve exists. We propose a distributed algorithm that allows the devices to select whether to cooperate or not and to adapt their optimal power allocation based on the cooperation framework selected. Moreover, we define distance constraints to enforce the benefits of cooperat ion between devices in a wireless cloud.
Saliency Unified: A Deep Architecture for simultaneous Eye Fixation Prediction and Salient Object Segmentation

Human eye fixations often correlate with locations of salient objects in the scene. However, only a handful of approaches have attempted to simultaneously address the related aspects of eye fixations and object saliency. In this work, we propose a deep convolutional neural network (CNN) capable of predicting eye fixations and segmenting salient objects in a unified framework. We design the initial network layers, shared between both the tasks, such that they capture the object level semantics and the global contextual aspects of saliency, while the deeper layers of the network address task specific aspects. In addition, our network captures saliency at multiple scales via inception-style convolution blocks. Our network shows a significant improvement over the current state-of-the-art for both eye fixation prediction and salient object segmentation across a number of challenging datasets.
Enhanced ARP: preventing ARP poisoning-based man-in-the-middle attacks

In this letter, an enhanced version of Address Resolution Protocol (ARP) is proposed to prevent ARP poisoning-based Man-in-the-Middle (MITM) attacks. The proposed mechanism is based on the following concept. When a node knows the correct Media Access Control (MAC) address for a given IP address, if it retains the IP/MAC address mapping while that machine is alive, then MITM attack is impossible for that IP address. In order to prevent MITM attacks even for a new IP address, a voting-based resolution mechanism is proposed. The proposed scheme is backward compatible with existing ARP and incrementally deployable.
Clinical spinal instability and low back pain.

Clinical instability is an important cause of low back pain. Although there is some controversy concerning its definition, it is most widely believed that the loss of normal pattern of spinal motion causes pain and/or neurologic dysfunction. The stabilizing system of the spine may be divided into three subsystems: (1) the spinal column; (2) the spinal muscles; and (3) the neural control unit. A large number of biomechanical studies of the spinal column have provided insight into the role of the various components of the spinal column in providing spinal stability. The neutral zone was found to be a more sensitive parameter than the range of motion in documenting the effects of mechanical destabilization of the spine caused by injury and restabilization of the spine by osteophyle formation, fusion or muscle stabilization. Clinical studies indicate that the application of an external fixator to the painful segment of the spine can significantly reduce the pain. Results of an in vitro simulation of the study found that it was most probably the decrease in the neutral zone, which was responsible for pain reduction. A hypothesis relating the neutral zone to pain has been presented. The spinal muscles provide significant stability to the spine as shown by both in vitro experiments and mathematical models. Concerning the role of neuromuscular control system, increased body sway has been found in patients with low back pain, indicating a less efficient muscle control system with decreased ability to provide the needed spinal stability.
FORWARD AND INVERSE KINEMATICS STUDY OF INDUSTRIAL ROBOTS TAKING INTO ACCOUNT CONSTRUCTIVE AND FUNCTIONAL PARAMETER ' S MODELING

Forward and inverse kinematic studies of industrial robots (IR) have been developed and presented in a large number of papers. However, eve n g neral mathematic formalization is usually almost correct, (basically following up general Har tenberg Denavit (H-D) conventions and associated homogenous transformation matrix), only few papers presents kinematic models ready to be directly implemented on a real scale industrial robot or as well able to evaluate kinematics behavior of a real scale IR specific model. That is usually due to som e inconsistencies in modeling, the most frequently of these referring on: the incomplete formalization of the full set of constructive and functional parame ters (that mandatory need to be considered in case of a specific real IR's model), avoidance of considering IR's specific design features, (as joint dimensions a d links dimensions are) leading to wrongly locat ing the reference frames used for expressing homogenous coordinate transformations, as well as missing of the validation procedures able to check the correct itude of the mathematical models, previously to its implementing in a real scale IR's controller. That is why present paper shows first a completely new approach for IR's forward an inverse kinematics, in terms of IR's analytical modeling by taking into account the full set of IR's constructive and funct ional parameters of two different IR's models. Then , for both direct and inverse mathematical models complet e symbolic formalization and full set of solutions for forward and inverse kinematics are presented for bo th IR types. In order to study mathematical models applicability on the real scale IR, two specific IR models were studied: an ABB serial-link open chain kinematics IR and a Fanuc serial-link closed chain ki ematics IR. Numerical results were verified by cross validation using both analytically calculatio ns results and by mean of a constrained 3D CAD mode l used to geometrically verify the results. The param etric form of the model elaborated in PTC Mathcad 1 4 allows a quick reconfiguration for other robot's mo dels having similar configurations. Results can be also used for solving dynamics, path planning and contro l p blems in case of real scale IR.
Differentiating optic disc edema from optic nerve head drusen on optical coherence tomography.

To assess optical coherence tomography in differentiating optic disc edema (ODE) due to papilledema and other optic neuropathies from optic nerve head drusen (ONHD).



Optical coherence tomographic images from 60 subjects (20 with ODE, 20 with ONHD, and 20 control subjects) were assessed qualitatively and quantitatively. Qualitative criteria for ODE included an elevated optic nerve head with smooth internal contour and subretinal hyporeflective space (SHYPS) with recumbent "lazy V" pattern. Optic nerve head drusen displayed a "lumpy-bumpy" internal optic nerve contour and a rapid decline in SHYPS thickness. Quantitative comparisons included retinal nerve fiber layer and SHYPS thickness.



Optical coherence tomography differentiated ODE from ONHD qualitatively (sensitivity, 63%; specificity, 63%) and quantitatively (sensitivity, 80%; specificity, 90%). Respective differences in mean retinal nerve fiber layer thickness between ODE and ONHD were significant (P < .002) superiorly (206.8 vs 121.7 microm), nasally (176.3 vs 78.6 microm), inferiorly (247.2 vs 153.8 microm), and temporally (180.0 vs 85.5 microm). Respective differences in mean SHYPS thickness between ODE and ONHD were significant (P < .001) at radii of 0.75 mm (512.1 vs 274.4 microm), 1.5 mm (291.4 vs 103.0 microm), and 2.0 mm (145.5 vs 60.7 microm).



Optical coherence tomography can differentiate ODE from ONHD, particularly when the nasal retinal nerve fiber layer and SHYPS thickness at the 2.0-mm radius are greater than 86 microm and 127 microm, respectively.
Markov logic networks

We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects in the domain, it specifies a ground Markov network containing one feature for each possible grounding of a first-order formula in the KB, with the corresponding weight. Inference in MLNs is performed by MCMC over the minimal subset of the ground network required for answering the query. Weights are efficiently learned from relational databases by iteratively optimizing a pseudo-likelihood measure. Optionally, additional clauses are learned using inductive logic programming techniques. Experiments with a real-world database and knowledge base in a university domain illustrate the promise of this approach.
Variable Computation in Recurrent Neural Networks

Recurrent neural networks (RNNs) have been used extensively and with increasing success to model various types of sequential data. Much of this progress has been achieved through devising recurrent units and architectures with the flexibility to capture complex statistics in the data, such as long range dependency or localized attention phenomena. However, while many sequential data (such as video, speech or language) can have highly variable information flow, most recurrent models still consume input features at a constant rate and perform a constant number of computations per time step, which can be detrimental to both speed and model capacity. In this paper, we explore a modification to existing recurrent units which allows them to learn to vary the amount of computation they perform at each step, without prior knowledge of the sequence’s time structure. We show experimentally that not only do our models require fewer operations, they also lead to better performance overall on evaluation tasks.
Fast-classifying, high-accuracy spiking deep networks through weight and threshold balancing

Deep neural networks such as Convolutional Networks (ConvNets) and Deep Belief Networks (DBNs) represent the state-of-the-art for many machine learning and computer vision classification problems. To overcome the large computational cost of deep networks, spiking deep networks have recently been proposed, given the specialized hardware now available for spiking neural networks (SNNs). However, this has come at the cost of performance losses due to the conversion from analog neural networks (ANNs) without a notion of time, to sparsely firing, event-driven SNNs. Here we analyze the effects of converting deep ANNs into SNNs with respect to the choice of parameters for spiking neurons such as firing rates and thresholds. We present a set of optimization techniques to minimize performance loss in the conversion process for ConvNets and fully connected deep networks. These techniques yield networks that outperform all previous SNNs on the MNIST database to date, and many networks here are close to maximum performance after only 20 ms of simulated time. The techniques include using rectified linear units (ReLUs) with zero bias during training, and using a new weight normalization method to help regulate firing rates. Our method for converting an ANN into an SNN enables low-latency classification with high accuracies already after the first output spike, and compared with previous SNN approaches it yields improved performance without increased training time. The presented analysis and optimization techniques boost the value of spiking deep networks as an attractive framework for neuromorphic computing platforms aimed at fast and efficient pattern recognition.
Unsupervised Lesion Detection in Brain CT using Bayesian Convolutional Autoencoders

Normally, lesions are detected using supervised learning techniques that require labelled training data. We explore the use of Bayesian autoencoders to learn the variability of healthy tissue and detect lesions as unlikely events under the normative model. As a proof-of-concept, we test our method on registered 2D midaxial slices from CT imaging data. Our results indicate that our method achieves best performance in detecting lesions caused by bleeding compared to baselines.
Generalized 3 D Object Representation using Bayesian Eigenobjects

Current methods for representing 3D objects for robotic interaction have significant limitations. They do not allow knowledge transfer from previously encountered objects to similar but novel objects, they construct large object databases that do not scale and are expensive to query, or they require hand tuned object models. We propose the use of Variational Bayesian Principal Component Analysis (VBPCA) directly on 3D object representations to create compact low-dimensional probabilistic models for classes of 3D objects. We show that these learned Bayesian Eigenobjects (BEOs) are well suited to important and practical robotic tasks including the classification and pose estimation of novel objects. Furthermore, we show that this approach can complete partially observed novel objects, allowing for the classification and pose estimation of novel occluded query objects.
Reactions to discrimination, stigmatization, ostracism, and other forms of interpersonal rejection: a multimotive model.

This article describes a new model that provides a framework for understanding people's reactions to threats to social acceptance and belonging as they occur in the context of diverse phenomena such as rejection, discrimination, ostracism, betrayal, and stigmatization. People's immediate reactions are quite similar across different forms of rejection in terms of negative affect and lowered self-esteem. However, following these immediate responses, people's reactions are influenced by construals of the rejection experience that predict 3 distinct motives for prosocial, antisocial, and socially avoidant behavioral responses. The authors describe the relational, contextual, and dispositional factors that affect which motives determine people's reactions to a rejection experience and the ways in which these 3 motives may work at cross-purposes. The multimotive model accounts for the myriad ways in which responses to rejection unfold over time and offers a basis for the next generation of research on interpersonal rejection.
An Adaptive Version of the Boost by Majority Algorithm

We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorithm with the adaptivity of AdaBoost. The method used for making boost-by-majority adaptive is to consider the limit in which each of the boosting iterations makes an infinitesimally small contribution to the process as a whole. This limit can be modeled using the differential equations that govern Brownian motion. The new boosting algorithm, named BrownBoost, is based on finding solutions to these differential equations. The paper describes two methods for finding approximate solutions to the differential equations. The first is a method that results in a provably polynomial time algorithm. The second method, based on the Newton-Raphson minimization procedure, is much more efficient in practice but is not known to be polynomial.