nils-herrmann/clean_scirepeval huggingface dataset:
Posterior short-segment fixation with or without fusion for thoracolumbar burst fractures. a five to seven-year prospective randomized study.

The impact of fusion as a supplement to short-segment instrumentation for the treatment of thoracolumbar burst fractures is unclear. We conducted a controlled clinical trial to define the effect of fusion on lumbar spine and patient-related functional outcomes.



From 2000 to 2002, seventy-three consecutive patients with a single-level Denis type-B burst fracture involving the thoracolumbar spine and a load-sharing score of <or=6 were managed with posterior pedicle screw instrumentation. The patients were randomly assigned to treatment with posterolateral fusion (fusion group, n = 37) or without posterolateral fusion (nonfusion group, n = 36). The patients were followed for at least five years after surgery and were assessed with regard to clinical and radiographic outcomes. Clinical outcomes were evaluated with use of the Frankel scale, the motor score of the American Spinal Injury Association, a visual analog scale, and the Short Form-36 (SF-36) questionnaire. Radiographic outcomes were assessed on the basis of the local kyphosis angle and loss of kyphosis correction.



No significant difference in radiographic or clinical outcomes was noted between the patients managed with the two techniques. Both operative time and blood loss were significantly less in the nonfusion group compared with the fusion group (p < 0.05). Twenty-five of the thirty-seven patients in the fusion group still had some degree of donor-site pain at the time of the latest examination.



Posterolateral bone-grafting is not necessary when a Denis type-B thoracolumbar burst fracture associated with a load-sharing score of <or=6 is treated with short-segment pedicle screw fixation.
Design and Control of a Four-Wheeled Omnidirectional Mobile Robot with Steerable Omnidirectional Wheels

Omnidirectional mobile robots are capable of arbitrary motion in an arbitrary direction without changing the direction of wheels, because they can perform 3 degree-of-freedom (DOF) motion on a two-dimensional plane. In this research, a new class of omnidirectional mobile robot is proposed. Since it has synchronously steerable omnidirectional wheels, it is called an omnidirectional mobile robot with steerable omnidirectional wheels (OMR-SOW). It has 3 DOFs in motion and one DOF in steering. One steering DOF can function as a continuously variable transmission (CVT). CVT of the OMR-SOW increases the range of velocity ratio from the wheel velocities to robot velocity, which may improve performance of the mobile robot. The OMR-SOW with four omnidirectional wheels has been developed in this research. Kinematics and dynamics of this robot will be analyzed in detail. Various tests have been conducted to demonstrate the validity and feasibility of the proposed mechanism and control algorithm.
A general procedure for the construction of Gorges polygons for multi-phase windings of electrical machines

This paper presents a simple and effective procedure for the determination of the Gorges polygon, suitable for all possible winding configurations in electrical machines. This methodology takes into account the determination of a Winding Distribution Table (WDT), in which all the information about the distribution of the currents along the stator periphery is computed and from which the Görges polygon are easily derived. The proposed method can be applied to both symmetrical and asymmetrical multi-phase windings, including concentrated, fractional, reduced and dead-coil ones. The examples provided in this paper demonstrate the versatility of the proposed method.
Image decomposition via the combination of sparse representations and a variational approach

The separation of image content into semantic parts plays a vital role in applications such as compression, enhancement, restoration, and more. In recent years, several pioneering works suggested such a separation be based on variational formulation and others using independent component analysis and sparsity. This paper presents a novel method for separating images into texture and piecewise smooth (cartoon) parts, exploiting both the variational and the sparsity mechanisms. The method combines the basis pursuit denoising (BPDN) algorithm and the total-variation (TV) regularization scheme. The basic idea presented in this paper is the use of two appropriate dictionaries, one for the representation of textures and the other for the natural scene parts assumed to be piecewise smooth. Both dictionaries are chosen such that they lead to sparse representations over one type of image-content (either texture or piecewise smooth). The use of the BPDN with the two amalgamed dictionaries leads to the desired separation, along with noise removal as a by-product. As the need to choose proper dictionaries is generally hard, a TV regularization is employed to better direct the separation process and reduce ringing artifacts. We present a highly efficient numerical scheme to solve the combined optimization problem posed by our model and to show several experimental results that validate the algorithm's performance.
Supplementary material for the paper : Discriminative Correlation Filter with Channel and Spatial Reliability DCF-CSR

This is the supplementary material for the paper ”Discriminative Correlation Filter with Channel and Spatial Reliability” submitted to the CVPR 2017. Due to spatial constraints, parts not crucial for understanding the DCF-CSR tracker formulation, but helpful for gaining insights, were moved here. 1. Derivation of the augmented Lagrangian minimizer This section provides the complete derivation of the closed-form solutions for the relations (9,10) in the submitted paper . The augmented Lagrangian from Equation (5) in  is L(ĥc,h, l̂) = ‖ĥc diag(f̂)− ĝ‖ + λ 2 ‖hm‖ + (1) [̂l(ĥc − ĥm) + l̂(ĥc − ĥm)] + μ‖ĥc − ĥm‖, with hm = (m h). For the purposes of derivation we will rewrite (1) into a fully vectorized form L(ĥc,h, l̂) = ‖ĥc diag(f̂)− ĝ‖ + λ 2 ‖hm‖+ (2) [̂ l(ĥc − √ DFMh) + l̂(ĥc − √ DFMh) ] + μ‖ĥc − √ DFMh‖, where F denotes D × D orthonormal matrix of Fourier coefficients, such that the Fourier transform is defined as x̂ = F(x) = √ DFx and M = diag(m). For clearer representation we denote the four terms in the summation (2) as L(ĥc,h, l̂) = L1 + L2 + L3 + L4, (3) where L1 = ( ĥc diag(f̂)− ĝ )( ĥc diag(f̂)− ĝ )T , (4)
Issues,Challenges and Tools of Clustering Algorithms

Clustering is an unsupervised technique of Data Mining. It means grouping similar objects together and separating the dissimilar ones. Each object in the data set is assigned a class label in the clustering process using a distance measure. This paper has captured the problems that are faced in real when clustering algorithms are implemented .It also considers the most extensively used tools which are readily available and support functions which ease the programming. Once algorithms have been implemented, they also need to be tested for its validity. There exist several validation indexes for testing the performance and accuracy which have also been discussed here.
A spiral antenna over a high-impedance surface consisting of fan-shaped patch cells

Radiation characteristics of a spiral antenna over a high-impedance surface (HIS) are analyzed. The HIS consists of fan-shaped patch cells. The fan-shaped patches are arranged homogeneously in the circumferential direction but are set non-homogeneously in the radial direction. The analysis is performed using method of moment. Radiation characteristics of a spiral antenna with a perfect electric conductor (PEC) reflector are analyzed. It is reaffirmed that wideband radiation characteristics, including input impedance and axial ratio are deteriorate. Subsequently, Radiation characteristics of a spiral antenna with a fan-shaped HIS reflector are analyzed. It is revealed that input impedance and axial ratio are mitigated by replacing the PEC reflector with the fan-shaped HIS reflector.
On accelerating pair-HMM computations in programmable hardware

This paper explores hardware acceleration to significantly improve the runtime of computing the forward algorithm on Pair-HMM models, a crucial step in analyzing mutations in sequenced genomes. We describe 1) the design and evaluation of a novel accelerator architecture that can efficiently process real sequence data without performing wasteful work; and 2) aggressive memoization techniques that can significantly reduce the number of invocations of, and the amount of data transferred to the accelerator. We describe our demonstration of the design on a Xilinx Virtex 7 FPGA in an IBM Power8 system. Our design achieves a 14.85× higher throughput than an 8-core CPU baseline (that uses SIMD and multi-threading) and a 147.49 × improvement in throughput per unit of energy expended on the NA12878 sample.
Normative data stratified by age and education for two measures of verbal fluency: FAS and animal naming.

Normative data stratified by three levels of age (16-59, 60-79, and 80-95 years) and three levels of education (0-8, 9-12, and 13-21 years) are presented for phonemic verbal fluency (FAS) and categorical verbal fluency (Animal Naming). The normative sample, aged 16 to 95 years, consisted of 1,300 cognitively intact individuals who resided in the community. Years of education ranged from 0 to 21. The total number of words in 1 minute for each of the letters F, A, and S was correlated r =.52 with the number of animal names generated in 1 minute. Regression analyses showed that FAS was more sensitive to the effects of education (18.6% of the variance) than age (11.0% of the variance). The opposite relationship occurred for Animal Naming, where age accounted for 23.4% of the variance and education accounted only for 13.6%. Gender accounted for less than 1% of variance for FAS and Animal Naming. The clinical utility of these norms is discussed.
POSTER: Watch Out Your Smart Watch When Paired

We coin a new term called \textit{data transfusion} as a phenomenon that a user experiences when pairing a wearable device with the host device. A large amount of data stored in the host device (e.g., a smartphone) is forcibly copied to the wearable device (e.g., a smart watch) due to pairing while the wearable device is usually less attended. To the best of knowledge, there is no previous work that manipulates how sensitive data is transfused even without user's consent and how users perceive and behave regarding such a phenomenon for smart watches. We tackle this problem by conducting an experimental study of data extraction from commodity devices, such as in Android Wear, watchOS, and Tizen platforms, and a following survey study with 205 smart watch users, in two folds. The experimental studies have shown that a large amount of sensitive data was transfused, but there was not enough user notification. The survey results have shown that users have lower perception on smart watches for security and privacy than smartphones, but they tend to set the same passcode on both devices when needed. Based on the results, we perform risk assessment and discuss possible mitigation that involves volatile transfusion.
Human Activity Recognition and Pattern Discovery

In principle, activity recognition can be exploited to great societal benefits, especially in real-life, human centric applications such as elder care and healthcare. This article focused on recognizing simple human activities. Recognizing complex activities remains a challenging and active area of research and the nature of human activities poses different challenges. Human activity understanding encompasses activity recognition and activity pattern discovery. The first focuses on accurate detection of human activities based on a predefined activity model. An activity pattern discovery researcher builds a pervasive system first and then analyzes the sensor data to discover activity patterns.
Brain tumor segmentation from MRI data sets using region growing approach

Brain segmentation is an important part of medical image processing. Most commonly, it aims at locating various lesions and pathologies inside the human brain. In this paper, a new brain segmentation algorithm is proposed. The method is seeded region growing approach which was developed to segment the area of the brain affected by a tumor. The proposed algorithm was described. Results of testing the developed method on real MRI data set are presented and discussed.
An Extension on “ Statistical Comparisons of Classifiers over Multiple Data Sets ” for all Pairwise Comparisons

In a recently published paper in JMLR, Demšar (2006) recommends a set of non-parametric statistical tests and procedures which can be safely used for comparing the performance of classifiers over multiple data sets. After studying the paper, we realize that the paper correctly introduces the basic procedures and some of the most advanced ones when comparing a control method. However, it does not deal with some advanced topics in depth. Regarding these topics, we focus on more powerful proposals of statistical procedures for comparing n×n classifiers. Moreover, we illustrate an easy way of obtaining adjusted and comparable p-values in multiple comparison procedures.
An architecture-level cache simulation framework supporting advanced PMA STT-MRAM

With integration density on-chip rocketing up, leakage power dominates the whole power budget of contemporary CMOS technology based memory, especially for SRAM based on-chip cache. To overcome the aggravating “power wall” issue, some emerging memory technologies such as STT-MRAM (Spin transfer torque magnetic RAM), PCRAM (Phase change RAM), and ReRAM(Resistive RAM) are proposed as promising candidates for next generation cache design. Although there are several existing simulation tools available for cache design, such as NVSim and CACTI, they either cannot support the most advanced PMA (Perpendicular magnetic anisotropy) STT-MRAM model or lack the ability for multi-banked large capacity cache simulation. In this paper, we propose an architecture level design framework for cache design from device level up to array structure level, which can support the most advanced PMA STT-MRAM technology. The simulation results are analyzed and compared with those produced by NVSim, which prove the correctness of our framework. The potential benefits of PMA STT-MRAM used as multi-banked L2 and L3 cache are also investigated in the paper. We believe that our framework will be helpful for computer architecture researchers to adopt the PMA STT-MRAM in on-chip cache design.
: Android Deobfuscation via “ Big Code ”

This work presents a new approach for deobfuscating Android APKs based on probabilistic learning of large code bases (termed “Big Code”). The key idea is to learn a probabilistic model over thousands of non-obfuscated Android applications and to use this probabilistic model to deobfuscate new, unseen Android APKs. The concrete focus of the paper is on reversing layout obfuscation, a popular transformation which renames key program elements such as classes, packages and methods, thus making it difficult to understand what the program does. Concretely, the paper: (i) phrases the layout deobfuscation problem of Android APKs as structured prediction in a probabilistic graphical model, (ii) instantiates this model with a rich set of features and constraints that capture the Android setting, ensuring both semantic equivalence and high prediction accuracy, and (iii) shows how to leverage powerful inference and learning algorithms to achieve overall precision and scalability of the probabilistic predictions. We implemented our approach in a tool called DeGuard and used it to: (i) reverse the layout obfuscation performed by the popular ProGuard system on benign, open-source applications, (ii) predict third-party libraries imported by benign APKs (also obfuscated by ProGuard), and (iii) rename obfuscated program elements of Android malware. The experimental results indicate that DeGuard is practically effective: it recovers 79.1% of the program element names obfuscated with ProGuard, it predicts third-party libraries with accuracy of 91.3%, and it reveals string decoders and classes that handle sensitive data in Android malware.
DAISY Filter Flow: A Generalized Discrete Approach to Dense Correspondences

Establishing dense correspondences reliably between a pair of images is an important vision task with many applications. Though significant advance has been made towards estimating dense stereo and optical flow fields for two images adjacent in viewpoint or in time, building reliable dense correspondence fields for two general images still remains largely unsolved. For instance, two given images sharing some content exhibit dramatic photometric and geometric variations, or they depict different 3D scenes of similar scene characteristics. Fundamental challenges to such an image or scene alignment task are often multifold, which render many existing techniques fall short of producing dense correspondences robustly and efficiently. This paper presents a novel approach called DAISY filter flow (DFF) to address this challenging task. Inspired by the recent PatchMatch Filter technique, we leverage and extend a few established methods: DAISY descriptors, filter-based efficient flow inference, and the PatchMatch fast search. Coupling and optimizing these modules seamlessly with image segments as the bridge, the proposed DFF approach enables efficiently performing dense descriptor-based correspondence field estimation in a generalized high-dimensional label space, which is augmented by scales and rotations. Experiments on a variety of challenging scenes show that our DFF approach estimates spatially coherent yet discontinuity-preserving image alignment results both robustly and efficiently.
Automated Screening System for Acute Myelogenous Leukemia Detection in Blood Microscopic Images

Acute myelogenous leukemia (AML) is a subtype of acute leukemia, which is prevalent among adults. The average age of a person with AML is 65 years. The need for automation of leukemia detection arises since current methods involve manual examination of the blood smear as the first step toward diagnosis. This is time-consuming, and its accuracy depends on the operator's ability. In this paper, a simple technique that automatically detects and segments AML in blood smears is presented. The proposed method differs from others in: 1) the simplicity of the developed approach; 2) classification of complete blood smear images as opposed to subimages; and 3) use of these algorithms to segment and detect nucleated cells. Computer simulation involved the following tests: comparing the impact of Hausdorff dimension on the system before and after the influence of local binary pattern, comparing the performance of the proposed algorithms on subimages and whole images, and comparing the results of some of the existing systems with the proposed system. Eighty microscopic blood images were tested, and the proposed framework managed to obtain 98% accuracy for the localization of the lymphoblast cells and to separate it from the subimages and complete images.
Alarm Prediction in LTE Networks

Antenna line alarms are a significant indicator for failing components in LTE base stations. By predicting such alarms it is possible to prepare for system repairs or for system resets in advance, which reduces the maintenance downtime for LTE operators when a hardware failure actually occurs. In this paper we present results from an antenna line alarm prediction method in a real LTE network. The prediction model is based on the behavior of a large set of performance counters (PMs) collected in a timeseries in the LTE base stations. We create the alarm prediction model by using the random forest search method and we reach and accuracy of 67-72% From this, we pinpoint the most influential PMs for predicting different types of alarms and we discuss how to use these PMs in future research.
A Compact 27 GHz Antenna-in-Package (AiP) with RF Transmitter and Passive Phased Antenna Array

In this paper, based on rigid-flex printed circuit board (PCB), a compact solution of Antenna-in-Package (AiP) including RF transmitter and microstrip passive phased antenna array is demonstrated. Apart from the landing of two connectors, the size shrinks down to 35 mm × 32 mm. RF transmitter works at the band of 26.2 GHz to 27.2 GHz, with conversion gain of 13 dB and rejection ratio up to 17.5 dBc. The 1 × 4 microstrip passive phased antenna array integrating 4 × 4 Butler Matrix achieves four scanning angles which are -10°, 30°, -30° and 10° with 20° half power beam width (HPBW), and simulated absolute gain is 13.51 dBi, 12.31 dBi, 12.23 dBi and 13.26 dBi respectively. Minor deviation on scanning angles from simulation data is observed in the testing due to measurement and manufacturing tolerance. However, among operating bandwidth, HPBW, main-to-side lobe ratio and the difference between two scanning angles when port 1, 4 and port 2, 3 are excited respectively are in good agreement with simulation results
Decoding Social Influence and the Wisdom of the Crowd in Financial Trading Network

In this paper, we study roles of social mechanisms in a financial system. Our data come from a novel on-line foreign exchange trading brokerage for individual investors, which also allows investors to form social network ties between each other and copy others' trades. From the dataset, we analyze the dynamics of this connected social influence systems in decision making processes. We discover that generally social trades outperform individual trades, but the social reputation of the top traders is not completely determined by their performance due to social feedback even when users are betting their own money. We also find that social influence plays a significant role in users' trades, especially decisions during periods of uncertainty. We report evidences suggesting that the dynamics of social influence contribute to market overreaction.
Automatic inspection of pavement cracking distress

15. Supplementary Notes Project performed in cooperation with the Texas Department of Transportation and the Federal Highway Administration.  Implementation of Automated Pavement Distress Rating Systems 16.  This paper presents the image-processing algorithm customized for high-speed, real-time inspection of pavement cracking. In the algorithm, a pavement image is divided into grid cells of 8 x 8 pixels, and each cell is classified as a non-crack or crack cell using the grayscale information of the border pixels. Whether a crack cell can be regarded as a basic element (or seed) depends on its contrast to the neighboring cells. A number of crack seeds can be called a crack cluster if they fall on a linear string. A crack cluster corresponds to a dark strip in the original image that may or may not be a section of a real crack. Additional conditions to verify a crack cluster include the requirements in the contrast, width, and length of the strip. If verified crack clusters are oriented in similar directions, they will be joined to become one crack. Because many operations are performed on crack seeds rather than on the original image, crack detection can be executed simultaneously when the frame grabber is forming a new image, which permits a real-time, online pavement survey. The trial test results show good repeatability and accuracy when multiple surveys were conducted in different driving conditions.