nils-herrmann/clean_scirepeval huggingface dataset:
Voice conversion using deep neural networks with speaker-independent pre-training

In this study, we trained a deep autoencoder to build compact representations of short-term spectra of multiple speakers. Using this compact representation as mapping features, we then trained an artificial neural network to predict target voice features from source voice features. Finally, we constructed a deep neural network from the trained deep autoencoder and artificial neural network weights, which were then fine-tuned using back-propagation. We compared the proposed method to existing methods using Gaussian mixture models and frame-selection. We evaluated the methods objectively, and also conducted perceptual experiments to measure both the conversion accuracy and speech quality of selected systems. The results showed that, for 70 training sentences, frame-selection performed best, regarding both accuracy and quality. When using only two training sentences, the pre-trained deep neural network performed best, regarding both accuracy and quality.
Buyer search and price dispersion: a laboratory study

We study markets with costly buyer search in which sellers simultaneously post prices. Buyers costlessly observe one or (with probability 1 q) two of the posted prices, and can accept one or pay to search again. The experiment varies q, the search cost, and the number of buyers. Equilibrium theory predicts a unified very low (high) price for q=0 (q=1) and predicts specific distributions of dispersed prices for q=1/3 and 2/3. Actual prices conform closely to the predictions in some treatments. Buyers’ reservation prices are biased away from the extremes, however, and sellers’ prices have positive autocorrelation and cross-sectional correlation. r 2003 Elsevier Science (USA). All rights reserved.
WiStep: Device-free Step Counting with WiFi Signals

Inspired by the emerging WiFi-based applications, in this paper, we leverage ubiquitous WiFi signals and propose a device-free step counting system, called WiStep. Based on the multipath propagation model, when a person is walking, her torso and limbs move at different speeds, which modulates wireless signals to the propagation paths with different lengths and thus introduces different frequency components into the received Channel State Information (CSI). To count walking steps, we first utilize time-frequency analysis techniques to segment and recognize the walking movement, and then dynamically select the sensitive subcarriers with largest amplitude variances from multiple CSI streams. Wavelet decomposition is applied to extract the detail coefficients corresponding to the frequencies induced by feet or legs, and compress the data so as to improve computing speed. Short-time energy of the coefficients is then calculated as the metric for step counting. Finally, we combine the results derived from the selected subcarriers to produce a reliable step count estimation. In contrast to counting steps based on the torso frequency analysis, WiStep can count the steps of in-place walking even when the person's torso speed is null. We implement WiStep on commodity WiFi devices in two different indoor scenarios, and various influence factors are taken into consideration when evaluating the performance of WiStep. The experimental results demonstrate that WiStep can realize overall step counting accuracies of 90.2% and 87.59% respectively in these two scenarios, and it is resilient to the change of scenarios.
The Emergence of Edge Computing

Industry investment and research interest in edge computing, in which computing and storage nodes are placed at the Internet's edge in close proximity to mobile devices or sensors, have grown dramatically in recent years. This emerging technology promises to deliver highly responsive cloud services for mobile computing, scalability and privacy-policy enforcement for the Internet of Things, and the ability to mask transient cloud outages. The web extra at www.youtube.com/playlist?list=PLmrZVvFtthdP3fwHPy_4d61oDvQY_RBgS includes a five-video playlist demonstrating proof-of-concept implementations for three tasks: assembling 2D Lego models, freehand sketching, and playing Ping-Pong.
A High-Voltage Solid-State Switch Based on Series Connection of IGBTs for PEF Applications

Pulsed electric field (PEF) technology is a promising nonthermal processing techniques that can be utilized to inactivate microorganisms in liquid food with high-voltage PEF. Herein, a high-voltage solid-state switch consisting of 64 insulated gate bipolar transistors (IGBTs) connected in series was designed and developed for the PEF treatment. Regarding the unbalanced sharing of voltage in series-connected IGBTs, the resistor–capacitor–diode snubber circuit was specifically used and investigated in terms of model of parameters. Furthermore, using gate drivers and optic fiber, the driving circuit and protection circuit were designed and validated. A 50-kV isolation level power supply was built in order to provide 16 independent IGBT stacks with 24 V of power each. The results show that the developed switch works adequately a delay time of 380 ns with 35.8-kV voltage and 44.8-A current capacity. Moreover, the response time of the short-circuit protection is acceptable as well with a reaction time of under  $7~\mu \text{s}$ . In conclusion, the switch designed for PEF treatment of liquid food performs within set parameters and is ready for pilot-scale processing capability.
Forensic Analysis of WhatsApp on Android Smartphones

ii Acknowledgements The research and writing of this thesis has been one of the most significant academic challenges I ever had to face. Without the support and guidance of the following people, this study would not have been completed. It is to them that I owe my deepest gratitude. I would sincerely like to thank my advisor, Dr. Golden G. Richard III for giving me an opportunity to conduct this thesis research under his excellent guidance. His exceptional knowledge, wisdom and understanding have inspired and motivated me. My professors, Dr. Shengru Tu and Dr. Adlai DePano for being on my thesis committee and mentoring me during my Master's degree in Computer Science at University of New Orleans. I am thankful to my friend Thomas Sires, for initiating my interest in Linux, making sure I keep it up and help me solve technical issues. I appreciate the help from Aisha Ali-Gombe, Joe Sylve and Andrew Case who are on our Information Assurance group, for their contributions in the Information Assurance field and answering my questions. Finally, I would like to thank my Parents and each member in my family and friends for their unconditional love and support. I specially want to thank my husband Mr. Naveen Singh, who has been my core source of strength through every phase of this effort and constantly encouraged me to do my best. His systematic approach and kind feedback towards my thesis has helped me improve. Words cannot express how grateful I am to you. My heartfelt gratitude to my precious daughter Navya Singh, who was born during my Master's program and has spent many days without my complete attention. With her never give up attitude she has taught me perseverance to work around a problem until I succeed. Thank you for all your love my little girl, it kept me going.  Android forensics has evolved over time offering significant opportunities and exciting challenges. On one hand, being an open source platform Android is giving developers the freedom to contribute to the rapid growth of the Android market whereas on the other hand Android users may not be aware of the security and privacy implications of installing these applications on their phones. Users may assume that a password-locked device protects their personal information, but applications may retain private information on devices, in ways that users might not anticipate. In this thesis we will be …
Optimal Joint Power and Subcarrier Allocation for Full-Duplex Multicarrier Non-Orthogonal Multiple Access Systems

In this paper, we investigate resource allocation algorithm design for multicarrier non-orthogonal multiple access (MC-NOMA) systems employing a full-duplex (FD) base station for serving multiple half-duplex (HD) downlink and uplink users simultaneously. The proposed algorithm is obtained from the solution of a non-convex optimization problem for the maximization of the weighted sum system throughput. We apply monotonic optimization to develop an optimal joint power and subcarrier allocation policy. The optimal resource allocation policy serves as a system performance benchmark due to its high computational complexity. Furthermore, a suboptimal iterative scheme based on successive convex approximation is proposed to strike a balance between computational complexity and optimality. Our simulation results reveal that the proposed suboptimal algorithm achieves a close-to-optimal performance. In addition, FD MC-NOMA systems employing the proposed resource allocation algorithms provide a substantial system throughput improvement compared with conventional HD multicarrier orthogonal multiple access (MC-OMA) systems and other baseline schemes. In addition, our results unveil that FD MC-NOMA systems enable a fairer resource allocation compared with traditional HD MC-OMA systems.
Travel time estimation of a path using sparse trajectories

In this paper, we propose a citywide and real-time model for estimating the travel time of any path (represented as a sequence of connected road segments) in real time in a city, based on the GPS trajectories of vehicles received in current time slots and over a period of history as well as map data sources. Though this is a strategically important task in many traffic monitoring and routing systems, the problem has not been well solved yet given the following three challenges. The first is the data sparsity problem, i.e., many road segments may not be traveled by any GPS-equipped vehicles in present time slot. In most cases, we cannot find a trajectory exactly traversing a query path either. Second, for the fragment of a path with trajectories, they are multiple ways of using (or combining) the trajectories to estimate the corresponding travel time. Finding an optimal combination is a challenging problem, subject to a tradeoff between the length of a path and the number of trajectories traversing the path (i.e., support). Third, we need to instantly answer users' queries which may occur in any part of a given city. This calls for an efficient, scalable and effective solution that can enable a citywide and real-time travel time estimation. To address these challenges, we model different drivers' travel times on different road segments in different time slots with a three dimension tensor. Combined with geospatial, temporal and historical contexts learned from trajectories and map data, we fill in the tensor's missing values through a context-aware tensor decomposition approach. We then devise and prove an object function to model the aforementioned tradeoff, with which we find the most optimal concatenation of trajectories for an estimate through a dynamic programming solution. In addition, we propose using frequent trajectory patterns (mined from historical trajectories) to scale down the candidates of concatenation and a suffix-tree-based index to manage the trajectories received in the present time slot. We evaluate our method based on extensive experiments, using GPS trajectories generated by more than 32,000 taxis over a period of two months. The results demonstrate the effectiveness, efficiency and scalability of our method beyond baseline approaches.
Discrete wavelet transform-based time series analysis and mining

Time series are recorded values of an interesting phenomenon such as stock prices, household incomes, or patient heart rates over a period of time. Time series data mining focuses on discovering interesting patterns in such data. This article introduces a wavelet-based time series data analysis to interested readers. It provides a systematic survey of various analysis techniques that use discrete wavelet transformation (DWT) in time series data mining, and outlines the benefits of this approach demonstrated by previous studies performed on diverse application domains, including image classification, multimedia retrieval, and computer network anomaly detection.
Defects of the nose, lip, and cheek: rebuilding the composite defect.

The face can be divided into regions (units) with characteristic skin quality, border outline, and three-dimensional contour. A defect may lie entirely within a single major unit or encompass several adjacent units, creating unique problems for repair. Composite defects overlap two or more facial units. Nasal defects often extend into the adjacent lip and cheek. The simplest solution may appear to be to simply "fill the hole"--just replace the missing bulk. Poor contour, incorrect dimension, malposition, asymmetry, poor blending into adjacent normal tissues, and a patch-like repair often follow.



The following principles of regional unit repair were applied to guide these complex reconstructions: (1) reconstruct units, not defects; (2) alter the wound in site, size, shape, and depth; (3) consider using separate grafts and flaps for each unit and subunit, if appropriate; (4) use "like" tissue for "like" tissue; (5) restore a stable platform; (6) build in stages; (7) use distant tissue for "invisible" needs and local skin for resurfacing; and (8) disregard old scars.



Clinical cases of increasing composite complexity were repaired with local, regional, and distant tissues. Excellent aesthetics and function were obtained.



Careful visual analysis of the normal face and the defect can direct the choice, timing, and technique of facial repair. Regional unit principles provide a coordinated approach to the vision, planning, and fabrication of these difficult wounds. The entire repair should be intellectually planned, designed step by step, and laid out in a series of coordinated steps, with general principles applied to successfully repair composite defects of the nose, lip, and cheek.
Flipping bits in memory without accessing them: An experimental study of DRAM disturbance errors

Memory isolation is a key property of a reliable and secure computing system--an access to one memory address should not have unintended side effects on data stored in other addresses. However, as DRAM process technology scales down to smaller dimensions, it becomes more difficult to prevent DRAM cells from electrically interacting with each other. In this paper, we expose the vulnerability of commodity DRAM chips to disturbance errors. By reading from the same address in DRAM, we show that it is possible to corrupt data in nearby addresses. More specifically, activating the same row in DRAM corrupts data in nearby rows. We demonstrate this phenomenon on Intel and AMD systems using a malicious program that generates many DRAM accesses. We induce errors in most DRAM modules (110 out of 129) from three major DRAM manufacturers. From this we conclude that many deployed systems are likely to be at risk. We identify the root cause of disturbance errors as the repeated toggling of a DRAM row's wordline, which stresses inter-cell coupling effects that accelerate charge leakage from nearby rows. We provide an extensive characterization study of disturbance errors and their behavior using an FPGA-based testing platform. Among our key findings, we show that (i) it takes as few as 139K accesses to induce an error and (ii) up to one in every 1.7K cells is susceptible to errors. After examining various potential ways of addressing the problem, we propose a low-overhead solution to prevent the errors
Avoiding pathologies in very deep networks

Choosing appropriate architectures and regularization strategies of deep networks is crucial to good predictive performance. To shed light on this problem, we analyze the analogous problem of constructing useful priors on compositions of functions. Specifically, we study the deep Gaussian process, a type of infinitely-wide, deep neural network. We show that in standard architectures, the representational capacity of the network tends to capture fewer degrees of freedom as the number of layers increases, retaining only a single degree of freedom in the limit. We propose an alternate network architecture which does not suffer from this pathology. We also examine deep covariance functions, obtained by composing infinitely many feature transforms. Lastly, we characterize the class of models obtained by performing dropout on Gaussian processes.
Relationships between body roundness with body fat and visceral adipose tissue emerging from a new geometrical model

To develop a new geometrical index that combines height, waist circumference (WC), and hip circumference (HC) and relate this index to total and visceral body fat.



Subject data were pooled from three databases that contained demographic, anthropometric, dual energy X-ray absorptiometry (DXA) measured fat mass, and magnetic resonance imaging measured visceral adipose tissue (VAT) volume. Two elliptical models of the human body were developed. Body roundness was calculated from the model using a well-established constant arising from the theory. Regression models based on eccentricity and other variables were used to predict %body fat and %VAT.



A body roundness index (BRI) was derived to quantify the individual body shape in a height-independent manner. Body roundness slightly improved predictions of %body fat and %VAT compared to the traditional metrics of body mass index (BMI), WC, or HC. On this basis, healthy body roundness ranges were established. An automated graphical program simulating study results was placed at http://www.pbrc.edu/bodyroundness.



BRI, a new shape measure, is a predictor of %body fat and %VAT and can be applied as a visual tool for health status evaluations.
Planning Fitness Training Sessions Using the Bat Algorithm

Over fairly recent years the concept of an artificial sport trainer has been proposed in literature. This concept is based on computational intelligence algorithms. In this paper, we try to extend the artificial sports trainer by planning fitness training sessions that are suitable for athletes, especially during idle seasons when no competition takes place (e.g., winter). The bat algorithm was used for planning fitness training sessions and results showed promise for the proposed solution. Future directions for development are also outlined in the paper.
{31 () Unifying Instance-based and Rule-based Induction Pedro Domingos

Several well-developed approaches to inductive learning now exist, but each has speci c limitations that are hard to overcome. Multi-strategy learning attempts to tackle this problem by combining multiple methods in one algorithm. This article describes a uni cation of two widely-used empirical approaches: rule induction and instance-based learning. In the new algorithm, instances are treated as maximally speci c rules, and classi cation is performed using a best-match strategy. Rules are learned by gradually generalizing instances until no improvement in apparent accuracy is obtained. Theoretical analysis shows this approach to be e cient. It is implemented in the RISE 3.1 system. In an extensive empirical study, RISE consistently achieves higher accuracies than state-of-the-art representatives of both its parent approaches (PEBLS and CN2), as well as a decision tree learner (C4.5). Lesion studies show that each of RISE's components is essential to this performance. Most signi cantly, in 14 of the 30 domains studied, RISE is more accurate than the best of PEBLS and CN2, showing that a signi cant synergy can be obtained by combining multiple empirical methods.
Architecture, the Backbone of Robotic Systems

Architectures form the backbone of complete robotic systems. The right choice of architecture can go a long way in facilitating the specification, implementation and validation of robotic systems. Conversely, of course, the wrong choice can make one's life miserable. We present some of the needs of robotic systems, describe some general classes of robot architectures, and discuss how different architectural styles can help in addressing those needs. The paper, like the field itself, is somewhat preliminary, yet it is hoped that it will provide guidance for those who use, or develop, robot architectures.
Three-phase power flow controller based on hybrid transformer with matrix converter

This paper deals with a three-phase hybrid transformer combined with matrix converter, which is used as a power flow controller in the power system. The main difference in the proposed solution in comparison to a conventional UPFC is the lack of DC energy storage in the power electronic converter. The main aim of this paper is to analyze the basic properties of the presented solution in a two-source system and to consider the possibility of bidirectional power flow control. The paper presents an operational description, theoretical simulation and experimental analysis of the proposed solution with the Space Vector Modulation of the matrix converter in an open feedback loop.
Multi-Graph Learning with Positive and Unlabeled Bags

In this paper, we formulate a new multi-graph learning task with only positive and unlabeled bags, where labels are only available for bags but not for individual graphs inside the bag. This problem setting raises significant challenges because bag-of-graph setting does not have features to directly represent graph data, and no negative bags exits for deriving discriminative classification models. To solve the challenge, we propose a puMGL learning framework which relies on two iteratively combined processes for multigraph learning: (1) deriving features to represent graphs for learning; and (2) deriving discriminative models with only positive and unlabeled graph bags. For the former, we derive a subgraph scoring criterion to select a set of informative subgraphs to convert each graph into a feature space. To handle unlabeled bags, we assign a weight value to each bag and use the adjusted weight values to select most promising unlabeled bags as negative bags. A margin graph pool (MGP), which contains some representative graphs from positive bags and identified negative bags, is used for selecting subgraphs and training graph classifiers. The iterative subgraph scoring, bag weight updating, and MGP based graph classification forms a closed loop to find optimal subgraphs and most suitable unlabeled bags for multi-graph learning. Experiments and comparisons on real-world multigraph data demonstrate the algorithm performance.
Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams

Ordered Binary-Decision Diagrams (OBDDs) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satisfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as graph algorithms on OBDD data structures. Using OBDDs, a wide variety of problems can be solved through symbolic analysis. First, the possible variations in system parameters and operating conditions are encoded with Boolean variables. Then the system is evaluated for all variations by a sequence of OBDD operations. Researchers have thus solved a number of problems in digital-system design, finite-state system analysis, artificial intelligence, and mathematical logic. This paper describes the OBDD data structure and surveys a number of applications that have been solved by OBDD-based symbolic analysis.