nils-herrmann/clean_scirepeval huggingface dataset:
Structure of the tendon connective tissue.

Tendons consist of collagen (mostly type I collagen) and elastin embedded in a proteoglycan-water matrix with collagen accounting for 65-80% and elastin approximately 1-2% of the dry mass of the tendon. These elements are produced by tenoblasts and tenocytes, which are the elongated fibroblasts and fibrocytes that lie between the collagen fibers, and are organized in a complex hierarchical scheme to form the tendon proper. Soluble tropocollagen molecules form cross-links to create insoluble collagen molecules which then aggregate progressively into microfibrils and then into electronmicroscopically clearly visible units, the collagen fibrils. A bunch of collagen fibrils forms a collagen fiber, which is the basic unit of a tendon. A fine sheath of connective tissue called endotenon invests each collagen fiber and binds fibers together. A bunch of collagen fibers forms a primary fiber bundle, and a group of primary fiber bundles forms a secondary fiber bundle. A group of secondary fiber bundles, in turn, forms a tertiary bundle, and the tertiary bundles make up the tendon. The entire tendon is surrounded by a fine connective tissue sheath called epitenon. The three-dimensional ultrastructure of tendon fibers and fiber bundles is complex. Within one collagen fiber, the fibrils are oriented not only longitudinally but also transversely and horizontally. The longitudinal fibers do not run only parallel but also cross each other, forming spirals. Some of the individual fibrils and fibril groups form spiral-type plaits. The basic function of the tendon is to transmit the force created by the muscle to the bone, and, in this way, make joint movement possible. The complex macro- and microstructure of tendons and tendon fibers make this possible. During various phases of movements, the tendons are exposed not only to longitudinal but also to transversal and rotational forces. In addition, they must be prepared to withstand direct contusions and pressures. The above-described three-dimensional internal structure of the fibers forms a buffer medium against forces of various directions, thus preventing damage and disconnection of the fibers.
A comparative study of image classification algorithms for Foraminifera identification

Identifying Foraminifera (or forams for short) is essential for oceanographic and geoscience research as well as petroleum exploration. Currently, this is mostly accomplished using trained human pickers, routinely taking weeks or even months to accomplish the task. In this paper, a foram identification pipeline is proposed to automatic identify forams based on computer vision and machine learning techniques. A microscope based image capturing system is used to collect a labelled image data set. Various popular image classification algorithms are adapted to this specific task and evaluated under various conditions. Finally, the potential of a weighted cross-entropy loss function in adjusting the trade-off between precision and recall is tested. The classification algorithms provide competitive results when compared to human experts labeling of the data set.
Word-Formation in English

published by the press syndicate of the university of cambridge A catalogue record for this book is available from the British Library Library of Congress Cataloguing in Publication data Plag, Ingo. Word-formation in English / Ingo Plag. p. cm. – (Cambridge textbooks in linguistics) Includes bibliographical references (p.) and indexes. Contents Preface page xi Abbreviations and notational conventions xiii Introduction 1 1 Basic concepts 4 1.1 What is a word? 4 1.2 Studying word-formation 9 1.3 Inflection and derivation 14  Further reading 18 Exercises 18 2 Studying complex words 20 2.1 Identifying morphemes 20 2.1.1 The morpheme as the minimal linguistic sign 20 2.1.2 Problems with the morpheme: the mapping of form and meaning 22 2.2 Allomorphy 27 2.3 Establishing word-formation rules 30 2.4 Multiple affixation 38 2.5 Summary 41 Further reading 41 Exercises 41
Engineering and characterization of a superfolder green fluorescent protein

Existing variants of green fluorescent protein (GFP) often misfold when expressed as fusions with other proteins. We have generated a robustly folded version of GFP, called 'superfolder' GFP, that folds well even when fused to poorly folded polypeptides. Compared to 'folding reporter' GFP, a folding-enhanced GFP containing the 'cycle-3' mutations and the 'enhanced GFP' mutations F64L and S65T, superfolder GFP shows improved tolerance of circular permutation, greater resistance to chemical denaturants and improved folding kinetics. The fluorescence of Escherichia coli cells expressing each of eighteen proteins from Pyrobaculum aerophilum as fusions with superfolder GFP was proportional to total protein expression. In contrast, fluorescence of folding reporter GFP fusion proteins was strongly correlated with the productive folding yield of the passenger protein. X-ray crystallographic structural analyses helped explain the enhanced folding of superfolder GFP relative to folding reporter GFP.
Graph-Based Relational Data Visualization

Relational databases are rigid-structured data sources characterized by complex relationships among a set of relations (tables). Making sense of such relationships is a challenging problem because users must consider multiple relations, understand their ensemble of integrity constraints, interpret dozens of attributes, and draw complex SQL queries for each desired data exploration. In this scenario, we introduce a twofold methodology, we use a hierarchical graph representation to efficiently model the database relationships and, on top of it, we designed a visualization technique for rapidly relational exploration. Our results demonstrate that the exploration of databases is deeply simplified as the user is able to visually browse the data with little or no knowledge about its structure, dismissing the need for complex SQL queries. We believe our findings will bring a novel paradigm in what concerns relational data comprehension.
Robust non-local fuzzy c-means algorithm with edge preservation for SAR image segmentation

Fuzzy c-means (FCM) algorithm has been proven effective for image segmentation; nevertheless it is sensitive to different types of noises. Up to now, a series of improved FCM algorithms incorporating spatial information have been developed, which are robust for Gaussian, uniform, and salt and pepper noises. However, limited effort has been placed on tackling the problem of a large amount of intrinsic and undesired multiplicative speckle in synthetic aperture radar (SAR) images. A crucial problem for SAR image segmentation is to guarantee speckle insensitiveness and edge detail preservation simultaneously. To address this problem, a robust and specific non-local FCM algorithm with edge preservation for SAR image segmentation is proposed. In this study, a new image is constructed using the non-local information and rectifying the edge parts, which is robust for speckle without sacrificing edge sharpness. To measure the patch-similarity in non-local method effectively, a novel generalized ratio distance based on SAR multiplicative speckle is defined. To locate and rectify the edge parts, coefficient of variation (CV) based threshold and orientation based statistics methods are designed. At last, this new image is clustered by FCM algorithm. Compared with six improved FCM algorithms and two state-of-the-art segmentation algorithms (spectral clustering and normalized cuts), the proposed algorithm obtains the best performance in terms of region uniformity and boundary localization. & 2012 Elsevier B.V. All rights reserved.
A 97.8% Efficient GaN HEMT Boost Converter With 300-W Output Power at 1 MHz

A 175-to-350 V hard-switched boost converter was constructed using a high-voltage GaN high-electron-mobility transistor grown on SiC substrate. The high speed and low on-resistance of the wide-band-gap device enabled extremely fast switching transients and low losses, resulting in a high conversion efficiency of 97.8% with 300-W output power at 1 MHz. The maximum efficiency was 98.0% at 214-W output power, well exceeding the state of the art of Si-based converters at similar frequencies.
Evolutionary Computation and Convergence to a Pareto Front

Research into solving multiobjective optimization problems (MOP) has as one of its an overall goals that of developing and defining foundations of an Evolutionary Computation (EC)-based MOP theory. In this paper, we introduce relevant MOP concepts, and the notion of Pareto optimality, in particular. Specific notation is defined and theorems are presented ensuring Paretobased Evolutionary Algorithm (EA) implementations are clearly understood. Then, a specific experiment investigating the convergence of an arbitrary EA to a Pareto front is presented. This experiment gives a basis for a theorem showing a specific multiobjective EA statistically converges to the Pareto front. We conclude by using this work to justify further exploration into the theoretical foundations of EC-based MOP solution methods.
A power-efficient 4-2 Adder Compressor topology

The addition is the most used arithmetic operation in Digital Signal Processing (DSP) algorithms, such as filters, transforms and predictions. These algorithms are increasingly present in audio and video processing of battery-powered mobile devices having, therefore, energy constraints. In the context of addition operation, the efficient 4-2 adder compressor is capable to performs four additions simultaneously. This higher order of parallelism reduces the critical path and the internal glitching, thus reducing mainly the dynamic power dissipation. This work proposes two CMOS+ gate-based topologies to further reduce the power, area and delay of the 4-2 adder compressor. The proposed CMOS+ 4-2 adder compressor circuits topologies were implemented with Cadence Virtuoso tool at 45 nm technology and simulated in both electric and layout levels. The results show that a proper choice of gates in 4-2 adder compressor realization can reduce the power, delay and area about 22.41%, 32.45% and 7.4%, respectively, when compared with the literature.
Hardware Trojan Detection by Multiple-Parameter Side-Channel Analysis

Hardware Trojan attack in the form of malicious modification of a design has emerged as a major security threat. Sidechannel analysis has been investigated as an alternative to conventional logic testing to detect the presence of hardware Trojans. However, these techniques suffer from decreased sensitivity toward small Trojans, especially because of the large process variations present in modern nanometer technologies. In this paper, we propose a novel noninvasive, multiple-parameter side-channel analysisbased Trojan detection approach. We use the intrinsic relationship between dynamic current and maximum operating frequency of a circuit to isolate the effect of a Trojan circuit from process noise. We propose a vector generation approach and several design/test techniques to improve the detection sensitivity. Simulation results with two large circuits, a 32-bit integer execution unit (IEU) and a 128-bit advanced encryption standard (AES) cipher, show a detection resolution of 1.12 percent amidst ±20 percent parameter variations. The approach is also validated with experimental results. Finally, the use of a combined side-channel analysis and logic testing approach is shown to provide high overall detection coverage for hardware Trojan circuits of varying types and sizes.
The evolutionary significance of polyploidy

Polyploidy, or the duplication of entire genomes, has been observed in prokaryotic and eukaryotic organisms, and in somatic and germ cells. The consequences of polyploidization are complex and variable, and they differ greatly between systems (clonal or non-clonal) and species, but the process has often been considered to be an evolutionary 'dead end'. Here, we review the accumulating evidence that correlates polyploidization with environmental change or stress, and that has led to an increased recognition of its short-term adaptive potential. In addition, we discuss how, once polyploidy has been established, the unique retention profile of duplicated genes following whole-genome duplication might explain key longer-term evolutionary transitions and a general increase in biological complexity.
Compact Duplexing for a 680-GHz Radar Using a Waveguide Orthomode Transducer

A compact 680-GHz waveguide orthomode transducer (OMT) and circular horn combination has been designed, tested, and characterized in a radar transceiver's duplexer. The duplexing capability is implemented by a hybrid waveguide quasi optical solution, combining a linear polarization OMT and an external grating polarizer. Isolation between the OMT's orthogonal ports' flanges was measured with a vector network analyzer to exceed 33 dB over a >10% bandwidth between 630 and 710 GHz. Calibrated Y-factor measurements using a mixer attached to the OMT ports reveal losses through the transmit and receive paths that sum to an average of 4.7 dB of two-way loss over 660-690 GHz. This is consistent with radar sensitivity measurements comparing the new OMT/horn with a quasi-optical wire grid beam splitter. Moreover, the radar performance assessment validates the OMT as a suitable compact substitute of the wire grid for the JPL's short-range 680-GHz imaging radar.
Identification of Basic Measurable Security Components for a Distributed Messaging System

The lack of appropriate information security solutions in software-intensive systems can have serious consequences for businesses and the stakeholders. Carefully designed security metrics can be used to offer evidence of the security behavior of the system under development or operation. This study investigates holistic development of security metrics for a distributed messaging system based on threat analysis, security requirements, decomposition and use case information. Our approach is thus requirement-centric. The high-level security requirements are expressed in terms of lower-level measurable components applying a decomposition approach.
LEARNING TO SOLVE CIRCUIT-SAT: AN UNSUPERVISED DIFFERENTIABLE APPROACH

Recent efforts to combine Representation Learning with Formal Methods, commonly known as Neuro-Symbolic Methods, have given rise to a new trend of applying rich neural architectures to solve classical combinatorial optimization problems. In this paper, we propose a neural framework that can learn to solve the Circuit Satisfiability problem. Our framework is built upon two fundamental contributions: a rich embedding architecture that encodes the problem structure, and an end-to-end differentiable training procedure that mimics Reinforcement Learning and trains the model directly toward solving the SAT problem. The experimental results show the superior out-of-sample generalization performance of our framework compared to the recently developed NeuroSAT method.
Attention Alignment Multimodal LSTM for Fine-Gained Common Space Learning

We address the problem common space learning approach that maps all related multimodal information into a common space for multimodal data. To establish a fine-grained common space, the aligned relevant local information of different modalities is used to learn a common subspace where the projected fragmented information is further integrated according to intra-modal semantic relationships. Specifically, we propose a novel multimodal LSTM with an attention alignment mechanism, namely attention alignment multimodal LSTM (AAM-LSTM), which mainly includes attentional alignment recurrent network (AA-R) and hierarchical multimodal LSTM (HM-LSTM). Different from the traditional methods which operate on the full modal data directly, the proposed model exploits the inter-modal and intra-modal semantic relationships of local information, to jointly establish a uniform representation of multi-modal data. Specifically, AA-R automatically captures semantic-aligned local information to learn common subspace without the need of supervised labels, then HM-LSTM leverages the potential relationships of these local information to learn a fine-grained common space. The experimental results on Filker30K, Filker8K, and Filker30K entities verify the performance and effectiveness of our model, which compares favorably with the state-of-the-art methods. In particular, the experiment of phrase localization on AA-R with Filker30K entities shows the expected accurate attention alignment. Moreover, from the experiment results of image-sentence retrieval tasks, it can be concluded that the proposed AAM-LSTM outperforms benchmark algorithms by a large margin.
Increase Physical Fitness and Create Health Awareness through Exergames and Gamification - The Role of Individual Factors, Motivation and Acceptance

Demographic change and the aging population push health and welfare system to its limits. Increased physical fitness and increased awareness for health issues will help elderly to live independently for longer and will thereby reduce the costs in the health care system. Exergames seem to be a promising solution for promoting physical fitness. Still, there is little evidence under what conditions Exergames will be accepted and used by elderly. To investigate promoting and hindering factors we conducted a user study with a prototype of an Exergame. We contrasted young vs. elderly players and investigated the role of gamer types, personality factors and technical expertise on the performance within the game and changes in the attitude towards individual health after the game. Surprisingly, performance within the game is not affected by performance motivation but by gamer type. More importantly, a universal positive effect on perceived pain is detected after the Exergame
Efficient Adaptive Nonlinear Filters for Nonlinear Active Noise Control

In this paper, we treat nonlinear active noise control (NANC) with a linear secondary path (LSP) and with a nonlinear secondary path (NSP) in a unified structure by introducing a new virtual secondary path filter concept and using a general function expansion nonlinear filter. We discover that using the filtered-error structure results in greatly reducing the computational complexity of NANC. As a result, we extend the available filtered-error-based algorithms to solve NANC/LSP problems and, furthermore, develop our adjoint filtered-error-based algorithms for NANC/NSP. This family of algorithms is computationally efficient and possesses a simple structure. We also find that the computational complexity of NANC/NSP can be reduced even more using block-oriented nonlinear models, such as the Wiener, Hammerstein, or linear-nonlinear-linear (LNL) models for the NSP. Finally, we use the statistical properties of the virtual secondary path and the robustness of our proposed methods to further reduce the computational complexity and simplify the implementation structure of NANC/NSP when the NSP satisfies certain conditions. Computational complexity and simulation results are given to confirm the efficiency and effectiveness of all of our proposed methods
Independent reinforcement learners in cooperative Markov games: a survey regarding coordination problems

In the framework of fully cooperative multi-agent systems, independent (non-communicative) agents that learn by reinforcement must overcome several difficulties to manage to coordinate. This paper identifies several challenges responsible for the non-coordination of independent agents: Pareto-selection, nonstationarity, stochasticity, alter-exploration and shadowed equilibria. A selection of multi-agent domains is classified according to those challenges: matrix games, Boutilier’s coordination game, predators pursuit domains and a special multi-state game. Moreover the performance of a range of algorithms for independent reinforcement learners is evaluated empirically. Those algorithms are Q-learning variants: decentralized Q-learning, distributed Q-learning, hysteretic Q-learning, recursive FMQ and WoLF PHC. An overview of the learning algorithms’ strengths and weaknesses against each challenge concludes the paper and can serve as a basis for choosing the appropriate algorithm for a new domain. Furthermore, the distilled challenges may assist in the design of new learning algorithms that overcome these problems and achieve higher performance in multi-agent applications.
A complete KALDI recipe for building Arabic speech recognition systems

In this paper we present a recipe and language resources for training and testing Arabic speech recognition systems using the KALDI toolkit. We built a prototype broadcast news system using 200 hours GALE data that is publicly available through LDC. We describe in detail the decisions made in building the system: using the MADA toolkit for text normalization and vowelization; why we use 36 phonemes; how we generate pronunciations; how we build the language model. We report results using state-of-the-art modeling and decoding techniques. The scripts are released through KALDI and resources are made available on QCRI's language resources web portal. This is the first effort to share reproducible sizable training and testing results on MSA system.
Developing an intelligent data discriminating system of anti-money laundering based on SVM

Statistical learning theory (SLT) is introduced to improve the embarrassments of anti-money laundering (AML) intelligence collection. A set of unusual behavior detection algorithm is presented in this paper based on support vector machine (SVM) in order to take the place of traditional predefined-rule suspicious transaction data filtering system. It could efficiently surmount the worst forms of suspicious data analyzing and reporting mechanism among bank branches including enormous data volume, dimensionality disorder with massive variances and feature overload.
A Linear Support Higher-Order Tensor Machine for Classification

There has been growing interest in developing more effective learning machines for tensor classification. At present, most of the existing learning machines, such as support tensor machine (STM), involve nonconvex optimization problems and need to resort to iterative techniques. Obviously, it is very time-consuming and may suffer from local minima. In order to overcome these two shortcomings, in this paper, we present a novel linear support higher-order tensor machine (SHTM) which integrates the merits of linear C-support vector machine (C-SVM) and tensor rank-one decomposition. Theoretically, SHTM is an extension of the linear C-SVM to tensor patterns. When the input patterns are vectors, SHTM degenerates into the standard C-SVM. A set of experiments is conducted on nine second-order face recognition datasets and three third-order gait recognition datasets to illustrate the performance of the proposed SHTM. The statistic test shows that compared with STM and C-SVM with the RBF kernel, SHTM provides significant performance gain in terms of test accuracy and training speed, especially in the case of higher-order tensors.