nils-herrmann/clean_scirepeval huggingface dataset:
Using Markov decision process in cognitive radio networks towards the optimal reward

The Learning is an indispensable phase in the cognition cycle of cognitive radio network. It corresponds between the executed actions and the estimated rewards. Based on this phase, the agent learns from past experiences to improve his actions in the next interventions. In the literature, there are several methods that treat the artificial learning. Among them, we cite the reinforcement learning that look for the optimal policy, for ensuring the maximum reward.
 The present work exposes an approach, based on a model of reinforcement learning, namely Markov decision process, to maximize the sum of transfer rates of all secondary users. Such conception defines all notions relative to an environment with finite set of states, including: the agent, all states, the allowed actions with a given state, the obtained reward after the execution of an action and the optimal policy. After the implementation, we remark a correlation between the started policy and the optimal policy, and we improve the performances by referring to a previous work.
Adversarial Patch

We present a method to create universal, robust, targeted adversarial image patches in the real world. The patches are universal because they can be used to attack any scene, robust because they work under a wide variety of transformations, and targeted because they can cause a classifier to output any target class. These adversarial patches can be printed, added to any scene, photographed, and presented to image classifiers; even when the patches are small, they cause the classifiers to ignore the other items in the scene and report a chosen target class.
Mobile attachment: emotional attachment towards mobile devices and services

In my thesis I address the topic of mobile attachment. I provide a theoretical framework for mobile attachment together with influencing factors that indicate user's emotional attachment (EA) to mobile devices and services. I investigate how the concept of user experience (UX) and EA are linked together and I outline how user behavior driven experience sampling can be exploited to measure mobile attachment. My research will result in design suggestions how the creation of EA to mobile devices and services can be facilitated.
Enabling agricultural automation to optimize utilization of water, fertilizer and insecticides by implementing Internet of Things (IoT)

With the proliferation of smart devices, Internet can be extended into the physical realm of Internet-of-Things (IoT) by deploying them into a communicating-actuating network. In Ion, sensors and actuators blend seamlessly with the environment; collaborate globally with each other through internet to accomplish a specific task. Wireless Sensor Network (WSN) can be integrated into Ion to meet the challenges of seamless communication between any things (e.g., humans or objects). The potentialities of IoT can be brought to the benefit of society by developing novel applications in transportation and logistics, healthcare, agriculture, smart environment (home, office or plant). This research gives a framework of optimizing resources (water, fertilizers, insecticides and manual labour) in agriculture through the use of IoT. The issues involved in the implementation of applications are also investigated in the paper. This frame work is named as AgriTech.
Multiresolution volume visualization with a texture-based octree

Although 3D texture-based volume rendering guarantees image quality almost interactively, it is difficult to maintain an interactive rate when the technique has to be exploited on large datasets. In this paper, we propose a new texture memory representation and a management policy that substitute the classical one-texel per voxel approach for a hierarchical approach. The hierarchical approach benefits nearly homogeneous regions and regions of lower interest. The proposed algorithm is based on a simple traversal of the octree representation of the volume data. Driven by a user-defined image quality, defined as a combination of data homogeneity and importance, a set of octree nodes (the cut) is selected to be rendered. The degree of accuracy applied for the representation of each one of the nodes of the cut in the texture memory is set independently according to the user-defined parameters. The variable resolution texture model obtained reduces the texture memory size and thus texture swapping, improving rendering speed.
Bidirectional bridgeless PFC with reduced input current distortion and switching loss using gate skipping technique

Bidirectional bridgeless PFC is an advantageous topology for high power application among many bridgeless PFCs due to small EMI filter size and no reverse recovery problem. However due to the large junction capacitance of secondary leg's diodes, the dead angle is shown in the zero-crossing area. Thus, the input current distortion is intensified, and the unnecessary switching loss decreases the efficiency. In this paper, a simple gate skipping technique is implemented to the zero-crossing area of the bidirectional bridgeless PFC. As a result, the unnecessary switching loss of boost switches and the input current distortion are reduced. The improvement of the proposed method is verified by experimental results with the high line input and 800W(400V/2A) output prototype.
Community Detection in Social Networks Based on Influential Nodes

Large-scale social networks emerged rapidly in recent years. Social networks have become complex networks. The structure of social networks is an important research area and has attracted much scientific interest. Community is an important structure in social networks. In this paper, we propose a community detection algorithm based on influential nodes. First, we introduce how to find influential nodes based on random walk. Then we combine the algorithm with order statistics theory to find community structure. We apply our algorithm in three classical data sets and compare to other algorithms. Our community detection algorithm is proved to be effective in the experiments. Our algorithm also has applications in data mining and recommendations.
Switched Beam Antenna Based on RF MEMS SPDT Switch on Quartz Substrate

This letter demonstrates a 20-GHz radio frequency microelectromechanical system (RF MEMS)-based electrically switchable antenna on a quartz substrate. Two quasi-Yagi antenna elements are monolithically integrated with a single-pole double-throw (SPDT) MEMS switch router network on a 21 mm times 8 mm chip. Electrical beam steering between two opposite directions is achieved using capacitive MEMS SPDT switches in the router. Port impedance and radiation patterns are studied numerically and experimentally. Measured results show that the switched beam antenna features a 27% impedance bandwidth (S11 = -10 dB), a gain of 4.6 dBi, and a front-to-back ratio of 14 dB at 20 GHz when the control voltage is applied to one of the switch pairs of the SPDT switch.
Seizure classification in EEG signals utilizing Hilbert-Huang transform

Classification method capable of recognizing abnormal activities of the brain functionality are either brain imaging or brain signal analysis. The abnormal activity of interest in this study is characterized by a disturbance caused by changes in neuronal electrochemical activity that results in abnormal synchronous discharges. The method aims at helping physicians discriminate between healthy and seizure electroencephalographic (EEG) signals.



Discrimination in this work is achieved by analyzing EEG signals obtained from freely accessible databases. MATLAB has been used to implement and test the proposed classification algorithm. The analysis in question presents a classification of normal and ictal activities using a feature relied on Hilbert-Huang Transform. Through this method, information related to the intrinsic functions contained in the EEG signal has been extracted to track the local amplitude and the frequency of the signal. Based on this local information, weighted frequencies are calculated and a comparison between ictal and seizure-free determinant intrinsic functions is then performed. Methods of comparison used are the t-test and the Euclidean clustering.



The t-test results in a P-value < 0.02 and the clustering leads to accurate (94%) and specific (96%) results. The proposed method is also contrasted against the Multivariate Empirical Mode Decomposition that reaches 80% accuracy. Comparison results strengthen the contribution of this paper not only from the accuracy point of view but also with respect to its fast response and ease to use.



An original tool for EEG signal processing giving physicians the possibility to diagnose brain functionality abnormalities is presented in this paper. The proposed system bears the potential of providing several credible benefits such as fast diagnosis, high accuracy, good sensitivity and specificity, time saving and user friendly. Furthermore, the classification of mode mixing can be achieved using the extracted instantaneous information of every IMF, but it would be most likely a hard task if only the average value is used. Extra benefits of this proposed system include low cost, and ease of interface. All of that indicate the usefulness of the tool and its use as an efficient diagnostic tool.
An Overview of LPV Systems

The framework of Linear Parameter Varying (LPV) systems con cer s linear dynamical systems whose state-space representatio ns depend on exogenous non-stationary parameters. Since its introduction by Sham m and Athans in 1988 to model gain scheduling, the LPV paradigm has become a stand ard formalism in systems and controls, with many papers devoted to analysis, controller synthesis, and system identification of LPV models. This chapter review s basic concepts and presents a representative selection of analytical approac hes for LPV systems. 1 Introducing LPV Systems Origins. The framework of Linear Parameter Varying (LPV) systems con cer s linear dynamical systems whose state-space representations d epend on exogenous nonstationary parameters, as in ẋ = A(θ )x+B(θ )u y = C(θ )x, (1) whereu is an input,y is an output, andθ is an exogenous parameter that can be time dependent. The LPV paradigm was introduced in the Ph.D. thesis of Shamma [74] for the analysis of the control design practice of “gain-schedulin g” [4, Chapter 9]. In brief, gain-scheduling is a control design approach that construc t a nonlinear controller for a nonlinear plant by patching together a collection of li near controllers. These linear controllers are blended in real-time (e.g., via swit ching or interpolation) acJeff S. Shamma Georgia Institute of Technology, School of Electrical and C omputer Engineering e-mail: shamma@gatech.edu
Binary coding of speech spectrograms using a deep auto-encoder

This paper reports our recent exploration of the layer-by-layer learning strategy for training a multi-layer generative model of patches of speech spectrograms. The top layer of the generative model learns binary codes that can be used for efficient compression of speech and could also be used for scalable speech recognition or rapid speech content retrieval. Each layer of the generative model is fully connected to the layer below and the weights on these connections are pretrained efficiently by using the contrastive divergence approximation to the log likelihood gradient. After layer-bylayer pre-training we “unroll” the generative model to form a deep auto-encoder, whose parameters are then fine-tuned using back-propagation. To reconstruct the full-length speech spectrogram, individual spectrogram segments predicted by their respective binary codes are combined using an overlapand-add method. Experimental results on speech spectrogram coding demonstrate that the binary codes produce a logspectral distortion that is approximately 2 dB lower than a subband vector quantization technique over the entire frequency range of wide-band speech.
Learning a Part-Based Pedestrian Detector in a Virtual World

Detecting pedestrians with on-board vision systems is of paramount interest for assisting drivers to prevent vehicle-to-pedestrian accidents. The core of a pedestrian detector is its classification module, which aims at deciding if a given image window contains a pedestrian. Given the difficulty of this task, many classifiers have been proposed during the last 15 years. Among them, the so-called (deformable) part-based classifiers, including multiview modeling, are usually top ranked in accuracy. Training such classifiers is not trivial since a proper aspect clustering and spatial part alignment of the pedestrian training samples are crucial for obtaining an accurate classifier. In this paper, we first perform automatic aspect clustering and part alignment by using virtual-world pedestrians, i.e., human annotations are not required. Second, we use a mixture-of-parts approach that allows part sharing among different aspects. Third, these proposals are integrated in a learning framework, which also allows incorporating real-world training data to perform domain adaptation between virtual- and real-world cameras. Overall, the obtained results on four popular on-board data sets show that our proposal clearly outperforms the state-of-the-art deformable part-based detector known as latent support vector machine.
Super resolution: an overview

Super-resolution algorithms produce a single highresolution image from a set of several, low-resolution images of the desired scene. The low-resolution frames are shifted differently with respect to the high resolution frame with subpixel increments. This paper presents first a theoretical overview of super-resolution algorithms. The most important methods, namely, the iterative back-projection, projection onto convex sets, and maximum a posteriori estimation are then compared within the same framework of implementation.
Learning patterns for discovering domain-oriented opinion words

Sentiment analysis is a challenging task that attracted increasing interest during the last years. The availability of online data along with the business interest to keep up with consumer feedback generates a constant demand for online analysis of user-generated content. A key role to this task plays the utilization of domain-specific lexicons of opinion words that enables algorithms to classify short snippets of text into sentiment classes (positive, negative). This process is known as dictionary-based sentiment analysis. The related work tends to solve this lexicon identification problem by either exploiting a corpus and a thesaurus or by manually defining a set of patterns that will extract opinion words. In this work, we propose an unsupervised approach for discovering patterns that will extract domain-specific dictionary. Our approach (DidaxTo) utilizes opinion modifiers, sentiment consistency theories, polarity assignment graphs and pattern similarity metrics. The outcome is compared against lexicons extracted by the state-of-the-art approaches on a sentiment analysis task. Experiments on user reviews coming from a diverse set of products demonstrate the utility of the proposed method. An implementation of the proposed approach in an easy to use application for extracting opinion words from any domain and evaluate their quality is also presented.
Impossibility of Distributed Consensus with One Faulty Process

The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the “Byzantine Generals” problem.
Research on Chinese text classification based on Word2vec

The set of features which the traditional feature selection algorithm of chi-square selected is not complete. This causes the low performance for the final text classification. Therefore, this paper proposes a method. The method utilizes word2vec to generate word vector to improve feature selection algorithm of the chi square. The algorithm applies the word vector generated by word2vec to the process of the traditional feature selection and uses these words to supplement the set of features as appropriate. Ultimately, the set of features obtained by this method has better discriminatory power. Because, the feature words with the better discriminatory power has the strong ability of distinguishing categories as its semantically similar words. On this base, multiple experiments have been carried out in this paper. The experimental results show that the performance of text classification can increase after extension of feature words.
Behavioral-state modulation of inhibition is context-dependent and cell type specific in mouse visual cortex

Cortical responses to sensory stimuli are modulated by behavioral state. In the primary visual cortex (V1), visual responses of pyramidal neurons increase during locomotion. This response gain was suggested to be mediated through inhibitory neurons, resulting in the disinhibition of pyramidal neurons. Using in vivo two-photon calcium imaging in layers 2/3 and 4 in mouse V1, we reveal that locomotion increases the activity of vasoactive intestinal peptide (VIP), somatostatin (SST) and parvalbumin (PV)-positive interneurons during visual stimulation, challenging the disinhibition model. In darkness, while most VIP and PV neurons remained locomotion responsive, SST and excitatory neurons were largely non-responsive. Context-dependent locomotion responses were found in each cell type, with the highest proportion among SST neurons. These findings establish that modulation of neuronal activity by locomotion is context-dependent and contest the generality of a disinhibitory circuit for gain control of sensory responses by behavioral state.
Multiple-Attribute Text Style Transfer

The dominant approach to unsupervised “style transfer” in text is based on the idea of learning a latent representation, which is independent of the attributes specifying its “style”. In this paper, we show that this condition is not necessary and is not always met in practice, even with domain adversarial training that explicitly aims at learning such disentangled representations. We thus propose a new model that controls several factors of variation in textual data where this condition on disentanglement is replaced with a simpler mechanism based on back-translation. Our method allows control over multiple attributes, like gender, sentiment, product type, etc., and a more fine-grained control on the trade-off between content preservation and change of style with a pooling operator in the latent space. Our experiments demonstrate that the fully entangled model produces better generations, even when tested on new and more challenging benchmarks comprising reviews with multiple sentences and multiple attributes.
Automotive Camera Simulation for Testing ADAS and Active Safety Systems by Dick Booisma Supervisors

In recent years the automotive industry has increasingly used virtual camera sensor simulation to test advanced driver assistance systems and active safety systems. These simulations need to be as close to the real world as possible to be representative for real world scenarios. An accurate light representation in the render engine is of paramount importance to the simulation’s realism. Also weather effects have a large impact on the performance of vision based controlling systems. In this thesis we investigate both subjects. We construct a custom color space based on the sensitivity curves of an automotive camera to better approximate the light in a render engine that is only able to process trichromatic color vectors. Our results show however that using single wavelength primaries is not the solution for doing this. Furthermore, we show how water drops on the windscreen can be simulated with both our ray tracer implementation and a direct mapping method. We demonstrate that internal reflections become more important for the end result when the water drops have a large contact angle or when they are at an inclination angle with respect to the lens of the camera. The direct mapping method is not able to simulate these reflections.
Analysis of Twitter Feeds for the Prediction of Stock Market Movement

In this paper, we investigate the relationship between Twitter feed content and stock market movement. Specifically, we wish to see if, and how well, sentiment information extracted from these feeds can be used to predict future shifts in prices. To answer this question, we construct a model, estimate its accuracy, and put it to the test on real market data using a mock portfolio. Our results indicate that the model is successful in generating additional profit.
Semantics and service technologies for the automatic generation of online MCQ tests

Active learning requires that students receive a continuous feedback about their understanding. Multiple-Choice Questions (MCQ) tests have been frequently used to provide students the required feedback and to measure the effectiveness of this learning model. To construct a test is a challenging task, which is time consuming and requires experience. For these reasons, research efforts have been focused on the automatic generation of well-constructed tests. The semantic technologies have played a relevant role in the implementation of these testgeneration systems. Nevertheless, the existing proposals present a set of drawbacks that restrict their applicability to different learning domains and the type of test to be composed. In this paper, we propose a service-oriented and semantic-based system that solves these drawbacks. The system consists of a dynamic strategy of generating candidate distractors (alternatives to the correct answer), a set of heuristics for scoring the distractors' suitability, and a selection of distractors that considers the difficulty level of tests. Besides, the final version of tests is created using the Google Form service, a de-facto standard for elaborating online questionnaires.
Learning Neurosymbolic Generative Models via Program Synthesis

Significant strides have been made toward designing better generative models in recent years. Despite this progress, however, state-of-the-art approaches are still largely unable to capture complex global structure in data. For example, images of buildings typically contain spatial patterns such as windows repeating at regular intervals; stateof-the-art generative methods can’t easily reproduce these structures. We propose to address this problem by incorporating programs representing global structure into the generative model—e.g., a 2D for-loop may represent a configuration of windows. Furthermore, we propose a framework for learning these models by leveraging program synthesis to generate training data. On both synthetic and real-world data, we demonstrate that our approach is substantially better than the state-of-theart at both generating and completing images that contain global structure.
BranchScope: A New Side-Channel Attack on Directional Branch Predictor

We present BranchScope - a new side-channel attack where the attacker infers the direction of an arbitrary conditional branch instruction in a victim program by manipulating the shared directional branch predictor. The directional component of the branch predictor stores the prediction on a given branch (taken or not-taken) and is a different component from the branch target buffer (BTB) attacked by previous work. BranchScope is the first fine-grained attack on the directional branch predictor, expanding our understanding of the side channel vulnerability of the branch prediction unit. Our attack targets complex hybrid branch predictors with unknown organization. We demonstrate how an attacker can force these predictors to switch to a simple 1-level mode to simplify the direction recovery. We carry out BranchScope on several recent Intel CPUs and also demonstrate the attack against an SGX enclave.