nils-herrmann/clean_scirepeval huggingface dataset:
Algorithmic Bias in Autonomous Systems

Algorithms play a key role in the functioning of autonomous systems, and so concerns have periodically been raised about the possibility of algorithmic bias. However, debates in this area have been hampered by different meanings and uses of the term, “bias.” It is sometimes used as a purely descriptive term, sometimes as a pejorative term, and such variations can promote confusion and hamper discussions about when and how to respond to algorithmic bias. In this paper, we first provide a taxonomy of different types and sources of algorithmic bias, with a focus on their different impacts on the proper functioning of autonomous systems. We then use this taxonomy to distinguish between algorithmic biases that are neutral or unobjectionable, and those that are problematic in some way and require a response. In some cases, there are technological or algorithmic adjustments that developers can use to compensate for problematic bias. In other cases, however, responses require adjustments by the agent, whether human or autonomous system, who uses the results of the algorithm. There is no “one size fits all” solution to algorithmic bias.
Unsupervised Domain Adaptation for 3D Keypoint Prediction from a Single Depth Scan

In this paper, we introduce a novel unsupervised domain adaptation technique for the task of 3D keypoint prediction from a single depth scan/image. Our key idea is to utilize the fact that predictions from different views of the same or similar objects should be consistent with each other. Such view consistency provides effective regularization for keypoint prediction on unlabeled instances. In addition, we introduce a geometric alignment term to regularize predictions in the target domain. The resulting loss function can be effectively optimized via alternating minimization. We demonstrate the effectiveness of our approach on real datasets and present experimental results showing that our approach is superior to state-of-the-art generalpurpose domain adaptation techniques.
Two-Stream 3-D convNet Fusion for Action Recognition in Videos With Arbitrary Size and Length

3-D convolutional neural networks (3-D-convNets) have been very recently proposed for action recognition in videos, and promising results are achieved. However, existing 3-D-convNets has two “artificial” requirements that may reduce the quality of video analysis: 1) It requires a fixed-sized (e.g., 112  $\times$ 112) input video; and 2) most of the 3-D-convNets require a fixed-length input (i.e., video shots with fixed number of frames). To tackle these issues, we propose an end-to-end pipeline named Two-stream 3-D-convNet Fusion, which can recognize human actions in videos of arbitrary size and length using multiple features. Specifically, we decompose a video into spatial and temporal shots. By taking a sequence of shots as input, each stream is implemented using a spatial temporal pyramid pooling (STPP) convNet with a long short-term memory (LSTM) or CNN-E model, softmax scores of which are combined by a late fusion. We devise the STPP convNet to extract equal-dimensional descriptions for each variable-size shot, and we adopt the LSTM/CNN-E model to learn a global description for the input video using these time-varying descriptions. With these advantages, our method should improve all 3-D CNN-based video analysis methods. We empirically evaluate our method for action recognition in videos and the experimental results show that our method outperforms the state-of-the-art methods (both 2-D and 3-D based) on three standard benchmark datasets (UCF101, HMDB51 and ACT datasets).
Selecting Valuable Stock Using Genetic Algorithm

In this study, we utilize the genetic algorithm (GA) to select high quality stocks with investment value. Given the fundamental financial and price information of stocks trading, we attempt to use GA to identify stocks that are likely to outperform the market by having excess returns. To evaluate the efficiency of the GA for stock selection, the return of equally weighted portfolio formed by the stocks selected by GA is used as evaluation criterion. Experiment results reveal that the proposed GA for stock selection provides a very flexible and useful tool to assist the investors in selecting valuable stocks.
Light at the End of the Tunnel: High-Speed LiDAR-Based Train Localization in Challenging Underground Environments

In this paper, we present an infrastructure-free mapping and localization framework for rail vehicles using only a lidar sensor. Our method is designed to handle the pathological environment found in modern underground tunnels: narrow, parallel, and relatively smooth concrete walls with very little infrastructure to break up the empty spaces in the tunnel. By using an RQE-based, point-cloud alignment approach, we are able to implement a sliding-window algorithm, used for both mapping and localization. We demonstrate the proposed method with datasets gathered on a subway train travelling at high speeds (up to 70 km/h) in an underground tunnel for a total of 20 km across 6 runs. Our method is capable of mapping the tunnel with less than 0.6% error over the total length of the generated map. It is capable of continuously localizing, relative to the generated map, to within 10 cm in stations and at crossovers, and 1.8 m in pathological sections of tunnel. This method improves rail-based localization in a tunnel, which can be used to increase capacity on existing railways and for automated trains.
Improving optical character recognition through efficient multiple system alignment

Individual optical character recognition (OCR) engines vary in the types of errors they commit in recognizing text, particularly poor quality text. By aligning the output of multiple OCR engines and taking advantage of the differences between them, the error rate based on the aligned lattice of recognized words is significantly lower than the individual OCR word error rates. This lattice error rate constitutes a lower bound among aligned alternatives from the OCR output. Results from a collection of poor quality mid-twentieth century typewritten documents demonstrate an average reduction of 55.0% in the error rate of the lattice of alternatives and a realized word error rate (WER) reduction of 35.8% in a dictionary-based selection process. As an important precursor, an innovative admissible heuristic for the A* algorithm is developed, which results in a significant reduction in state space exploration to identify all optimal alignments of the OCR text output, a necessary step toward the construction of the word hypothesis lattice. On average 0.0079% of the state space is explored to identify all optimal alignments of the documents.
Norepinephrine transporter occupancy by antidepressant in human brain using positron emission tomography with (S,S)-[18F]FMeNER-D2

Central norepinephrine transporter (NET) is one of the main targets of antidepressants. Although the measurement of NET occupancy has been attempted in humans, the outcomes have been inconclusive. In this study, the occupancy of NET by different doses of an antidepressant, nortriptyline, was measured using positron emission tomography (PET) with (S,S)-[18F]FMeNER-D2. PET scans using (S,S)-[18F]FMeNER-D2 were performed on six healthy men before and after oral administration of a single oral dose of nortriptyline (10–75 mg). After a bolus i.v. injection of (S,S)-[18F]FMeNER-D2, dynamic scanning was performed for 0–90 min, followed by scanning for 120–180 min. The ratio of the thalamus-to-caudate areas under the curve (120–180 min) minus 1 was used as the binding potential (BPND) for NET. NET occupancy was calculated as the percentage reduction of BPND. Venous blood samples were taken to measure the concentrations of nortriptyline just before injection of the tracer and at 180 min after the injection. Mean NET occupancies by nortriptyline were 16.4% at 10 mg, 33.2% at 25 mg, and 41.1% at 75 mg. The mean plasma concentration of nortriptyline was less than the lower limit of detection at 10 mg, 23.7 ng/mL at 25 mg, and 50.5 ng/mL at 75 mg. Estimated ED50 was 76.8 mg of administration dose and 59.8 ng/mL of plasma concentration. NET occupancy by nortriptyline corresponding to the administration dose of 10–75 mg or plasma concentration was observed from 16% to 41%.
Automatic fusion and classification using random forests and features extracted with deep learning

Fusion of different sensor modalities has proven very effective in numerous remote sensing applications. However, in order to benefit from fusion, advanced feature extraction mechanisms that rely on domain expertise are typically required. In this paper we present an automated feature extraction scheme based on deep learning. The feature extraction is unsupervised and hierarchical. Furthermore, computational efficiency (often a challenge for deep learning methods) is a primary goal in order to make certain that the method can be applied in large remote sensing datasets. Promising classification results show the applicability of the approach for both reducing the gap between naive feature extraction and methods relying on domain expertise, as well as further improving the performance of the latter in two challenging datasets.
Optimal Charging in Wireless Rechargeable Sensor Networks

Recent years have witnessed several new promising technologies to power wireless sensor networks, which motivate some key topics to be revisited. By integrating sensing and computation capabilities to the traditional radio-frequency identification (RFID) tags, the Wireless Identification and Sensing Platform (WISP) is an open-source platform acting as a pioneering experimental platform of wireless rechargeable sensor networks. Different from traditional tags, an RFID-based wireless rechargeable sensor node needs to charge its onboard energy storage above a threshold to power its sensing, computation, and communication components. Consequently, such charging delay imposes a unique design challenge for deploying wireless rechargeable sensor networks. In this paper, we tackle this problem by planning the optimal movement strategy of the mobile RFID reader, such that the time to charge all nodes in the network above their energy threshold is minimized. We first propose an optimal solution using the linear programming (LP) method. To further reduce the computational complexity, we then introduce a heuristic solution with a provable approximation ratio of (1 + θ)/(1 - ε) by discretizing the charging power on a 2-D space. Through extensive evaluations, we demonstrate that our design outperforms the set-cover-based design by an average of 24.7%, whereas the computational complexity is O((N/ε)2). Finally, we consider two practical issues in system implementation and provide guidelines for parameter setting.
Research Commentary: Desperately Seeking the "IT" in IT Research - A Call to Theorizing the IT Artifact

The field of information systems is premised on the centrality of information technology in everyday socio-economic life. Yet, drawing on a review of the full set of articles published in Information Systems Research (ISR) over the past ten years, we argue that the field has not deeply engaged its core subject matter—the information technology (IT) artifact. Instead, we find that IS researchers tend to give central theoretical significance to the context (within which some usually unspecified technology is seen to operate), the discrete processing capabilities of the artifact (as separable from its context or use), or the dependent variable (that which is posited to be affected or changed as technology is developed, implemented, and used). The IT artifact itself tends to disappear from view, be taken for granted, or is presumed to be unproblematic once it is built and installed. After discussing the implications of our findings, we propose a research direction for the IS field that begins to take technology as seriously as its effects, context, and capabilities. In particular, we propose that IS researchers begin to theorize specifically about IT artifacts, and then incorporate these theories explicitly into their studies. We believe that such a research direction is critical if IS research is to make a significant contribution to the understanding of a world increasingly suffused with ubiquitous, interdependent, and emergent information technologies.
Towards Multilevel Human Body Modeling and Tracking in 3 D : Investigation in Laplacian Eigenspace ( LE ) Based Initialization and Kinematically Constrained Gaussian Mixture Modeling ( KC-GMM )

Vision-based automatic human body pose estimation has many potential applications and it is also a challenging task. Together, these two factors have made vision-based human body pose estimation an attractive research area with closely related research areas including body pose, hand pose, and head pose estimation. Up to now, these research works however only deal with each task of estimating body pose, hand pose or head pose separately. In this paper, we bring out the issue of multilevel human body pose estimation and focus on model based methods for articulated human body pose estimation using volumetric data (voxel data). Important steps in this kind of methods will be described and several recent techniques will be analyzed and compared. Based on this analysis, we propose a fairly general method combining the discovered properties of LE transformation in [23] and KC-GMM method  for automatic initialization and tracking of both body model and hand model using voxel data. We also propose a framework for human body pose estimation at multilevel (i.e. body pose, hand pose, head pose) in an integrated way. The proposed method and framework will be presented along with experimental support and other possible avenues for future work in the area will be discussed.
Effect of flexible spine on stability of a passive quadruped robot: Experimental results

In rapid quadruped animals, the flexibility of spine is obviously observable while running. In this paper, we introduce a 3D passive dynamic quadruped robot, Fanari, that is capable to gallop down a slope without any external energy. We study the effect of spine flexibility on improvement of stability, adaptability and achievement of rapid leg locomotion. So a flexible spine that is capable to bend both outward and downward, a flexible spine that is only capable to bend outward and a rigid spine are designed and tested on the robot. Based on the case studies, we discuss about the challenges and the roles of spine stiffness on the gallop action. A simulation model is also made in order to corroborate the experimental results of the robot. It is concluded that the robot with the spine that is flexible in both outward and downward directions, has the most stability, adaptability and fastest velocity in its gallop action.
Diode-clamped multilevel converters: a practicable way to balance DC-link voltages

The converter topologies identified as diode-clamped multilevel (DCM) or, equivalently, as multipoint clamped (MPC), are rarely used in industrial applications, owing to some serious drawbacks involving mainly the stacked bank of capacitors that constitutes their multilevel dc link. The balance of the capacitor voltages is not possible in all operating conditions when the MPC converter possesses a passive front end. On the other hand, in ac/dc/ac power conversion, the back-to-back connection of a multilevel rectifier with a multilevel inverter allows the balance of the dc-link capacitor voltages and, at the same time, it offers the power-factor-correction capability at the mains ac input. An effective balancing strategy suitable for MPC conversion systems with any number of dc-link capacitors is presented here. The strategy has been carefully studied to optimize the converter efficiency. The simulation results related to a high-power conversion system (up to 10 MW) characterized by four intermediate dc-link capacitors are shown.
Mechatronic Implementation of a Force Optimal Underconstrained Planar Cable Robot

This paper presents a mechatronic implementation for experimentally validating an approach toward optimal force generation for a planar underconstrained cable robot that is designed to operate on the vertical face of overhead roadway signs. The cables that actuate the robot extend over a set of rotatable pulley arms mounted at the top corners of the sign. The redundant degrees of freedom due to the pulley arms allow for improved force generation ability of the robot at all desired locations on the sign. Redundancy is resolved by optimizing the anisotropic force generated in a desired direction. The mechatronic implementation is performed using a novel smartphone-based architecture for imaging, kinematics, I/O, optimization, and control. The implementation hardware and software are detailed, and experimental results are presented, which validate the theory.
Review on Non-Volatile Memory with High-k Dielectrics: Flash for Generation Beyond 32 nm

Flash memory is the most widely used non-volatile memory device nowadays. In order to keep up with the demand for increased memory capacities, flash memory has been continuously scaled to smaller and smaller dimensions. The main benefits of down-scaling cell size and increasing integration are that they enable lower manufacturing cost as well as higher performance. Charge trapping memory is regarded as one of the most promising flash memory technologies as further down-scaling continues. In addition, more and more exploration is investigated with high-k dielectrics implemented in the charge trapping memory. The paper reviews the advanced research status concerning charge trapping memory with high-k dielectrics for the performance improvement. Application of high-k dielectric as charge trapping layer, blocking layer, and tunneling layer is comprehensively discussed accordingly.
Neural Graph Machines: Learning Neural Networks Using Graphs

Label propagation is a powerful and flexible semi-supervised learning technique on graphs. Neural networks, on the other hand, have proven track records in many supervised learning tasks. In this work, we propose a training framework with a graph-regularised objective, namely Neural Graph Machines, that can combine the power of neural networks and label propagation. This work generalises previous literature on graphaugmented training of neural networks, enabling it to be applied to multiple neural architectures (Feed-forward NNs, CNNs and LSTM RNNs) and a wide range of graphs. The new objective allows the neural networks to harness both labeled and unlabeled data by: (a) allowing the network to train using labeled data as in the supervised setting, (b) biasing the network to learn similar hidden representations for neighboring nodes on a graph, in the same vein as label propagation. Such architectures with the proposed objective can be trained efficiently using stochastic gradient descent and scaled to large graphs, with a runtime that is linear in the number of edges. The proposed joint training approach convincingly outperforms many existing methods on a wide range of tasks (multi-label classification on social graphs, news categorization, document classification and semantic intent classification), with multiple forms of graph inputs (including graphs with and without node-level features) and using different types of neural networks. Work done during an internship at Google.
Three-dimensional synthetic blood vessel generation using stochastic L-systems

Segmentation of blood vessels from magnetic resonance angiography (MRA) or computed tomography angiography (CTA) images is a complex process that usually takes a lot of computational resources. Also, most vascular segmentation and detection algorithms do not work properly due to the wide architectural variability of the blood vessels. Thus, the construction of convincing synthetic vascular trees makes it possible to validate new segmentation methodologies. In this work, an extension to the traditional Lindenmayer system (L-system) that generates synthetic 3D blood vessels by adding stochastic rules and parameters to the grammar is proposed. Towards this aim, we implement a parser and a generator of L-systems whose grammars simulate natural features of real vessels such as the bifurcation angle, average length and diameter, as well as vascular anomalies, such as aneurysms and stenoses. The resulting expressions are then used to create synthetic vessel images that mimic MRA and CTA images. In addition, this methodology allows for vessel growth to be limited by arbitrary 3D surfaces, and the vessel intensity profile can be tailored to match real angiographic intensities.
Competence-based Curriculum Learning for Neural Machine Translation

Current state-of-the-art NMT systems use large neural networks that are not only slow to train, but also often require many heuristics and optimization tricks, such as specialized learning rate schedules and large batch sizes. This is undesirable as it requires extensive hyperparameter tuning. In this paper, we propose a curriculum learning framework for NMT that reduces training time, reduces the need for specialized heuristics or large batch sizes, and results in overall better performance. Our framework consists of a principled way of deciding which training samples are shown to the model at different times during training, based on the estimated difficulty of a sample and the current competence of the model. Filtering training samples in this manner prevents the model from getting stuck in bad local optima, making it converge faster and reach a better solution than the common approach of uniformly sampling training examples. Furthermore, the proposed method can be easily applied to existing NMT models by simply modifying their input data pipelines. We show that our framework can help improve the training time and the performance of both recurrent neural network models and Transformers, achieving up to a 70% decrease in training time, while at the same time obtaining accuracy improvements of up to 2.2 BLEU.
Rough Set Based Feature Selection for Web Usage Mining

Web usage mining exploits data mining techniques to discover valuable information from navigation behavior of World Wide Web (WWW) users. The required information is captured by Web servers and stored in Web usage data logs. The first phase of Web usage mining is the pre processing phase. In the preprocessing phase, first, relevant information is filtered from the logs. Data preprocessing is a critical step in Web usage mining. The results of data preprocessing is relevant to the next steps, such as transaction identification, path analysis, association rule mining, sequential pattern mining, and so forth. Feature selection is a preprocessing step in data mining, and it is very effective in reducing dimensions, reducing the irrelevant data, increasing the learning accuracy and improving comprehensiveness. This paper proposes a novel approach for feature selection based on rough set theory for Web usage mining.