Miracle-dz/UniFAR-FTUs huggingface dataset:
Persian Rhetorical Structure Theory

Over the past years, interest in discourse analysis and discourse parsing has steadily grown, and many discourse-annotated corpora and, as a result, discourse parsers have been built. In this paper, we present a discourse-annotated corpus for the Persian language built in the framework of Rhetorical Structure Theory as well as a discourse parser built upon the DPLP parser, an open-source discourse parser. Our corpus consists of 150 journalistic texts, each text having an average of around 400 words. Corpus texts were annotated using 18 discourse relations and based on the annotation guideline of the English RST Discourse Treebank corpus. Our text-level discourse parser is trained using gold segmentation and is built upon the DPLP discourse parser, which uses a large-margin transition-based approach to solve the problem of discourse parsing. The performance of our discourse parser in span (S), nuclearity (N) and relation (R) detection is around 78%, 64%, 44% respectively, in terms of F1 measure.
Data-driven Model Predictive and Reinforcement Learning-Based Control for Building Energy Management: a Survey

Building energy management has been recognized as one of the core problems in modern power grids with respect to system operation efficiency. However, the building energy management system (BEMS) is now facing more challenges and uncertainties with the increasing penetration of renewable energy and increasing adoption of different types of electrical appliances and equipment. Classical model predictive control (MPC) has shown effective in building energy management, although it suffers from labour-intensive modelling and complex online control optimization. Recently, with the growing accessibility to building control and automation data, data-driven solutions such as data-driven MPC and reinforcement learning (RL)-based methods have attracted more research interest. However, the potential of integrating these two types of methods and how to choose suitable control algorithms have not been well discussed. In this work, we first present a compact review of the recent advances in data-driven MPC and RL-based control methods for building energy management. Furthermore, the main challenges in these approaches and general discussions on the selection of control methods are discussed.
More on verification of probability forecasts for football outcomes: score decompositions, reliability, and discrimination analyses

Forecast of football outcomes in terms of Home Win, Draw and Away Win relies largely on ex ante probability elicitation of these events and ex post verification of them via computation of probability scoring rules (Brier, Ranked Probability, Logarithmic, Zero-One scores). Usually, appraisal of the quality of forecasting procedures is restricted to reporting mean score values. The purpose of this article is to propose additional tools of verification, such as score decompositions into several components of special interest. Graphical and numerical diagnoses of reliability and discrimination and kindred statistical methods are presented using different techniques of binning (fixed thresholds, quantiles, logistic and iso regression). These procedures are illustrated on probability forecasts for the outcomes of the UEFA Champions League (C1) at the end of the group stage based on typical Poisson regression models with reasonably good results in terms of reliability as compared to those obtained from bookmaker odds and whatever the technique used. Links with research in machine learning and different areas of application (meteorology, medicine) are discussed.
Sparse Logistic Tensor Decomposition for Binary Data

Tensor data are increasingly available in many application domains. We develop several tensor decomposition methods for binary tensor data. Different from classical tensor decompositions for continuous-valued data with squared error loss, we formulate logistic tensor decompositions for binary data with a Bernoulli likelihood. To enhance the interpretability of estimated factors and improve their stability further, we propose sparse formulations of logistic tensor decomposition by considering $\ell_{1}$-norm and $\ell_{0}$-norm regularized likelihood. To handle the resulting optimization problems, we develop computational algorithms which combine the strengths of tensor power method and majorization-minimization (MM) algorithm. Through simulation studies, we demonstrate the utility of our methods in analysis of binary tensor data. To illustrate the effectiveness of the proposed methods, we analyze a dataset concerning nations and their political relations and perform co-clustering of estimated factors to find associations between the nations and political relations.
Mixed-Spectrum Signals -- Discrete Approximations and Variance Expressions for Covariance Estimates

The estimation of the covariance function of a stochastic process, or signal, is of integral importance for a multitude of signal processing applications. In this work, we derive closed-form expressions for the variance of covariance estimates for mixed-spectrum signals, i.e., spectra containing both absolutely continuous and singular parts. The results cover both finite-sample and asymptotic regimes, allowing for assessing the exact speed of convergence of estimates to their expectations, as well as their limiting behavior. As is shown, such covariance estimates may converge even for non-ergodic processes. Furthermore, we consider approximating signals with arbitrary spectral densities by sequences of singular spectrum, i.e., sinusoidal, processes, and derive the limiting behavior of covariance estimates as both the sample size and the number of sinusoidal components tend to infinity. We show that the asymptotic regime variance can be described by a time-frequency resolution product, with dramatically different behavior depending on how the sinusoidal approximation is constructed. In a few numerical examples we illustrate the theory and the corresponding implications for direction of arrival estimation.
Majorization effect on entropic functionals: An application to an atom-field interacting system

The majorization effect on some entropic functionals, such as von-Neumann, Shannon, atomic Wehrl and Rényi entropies are investigated of a vee type three-level atom which interacts with a coherent field in a resonant cavity. Moreover, the fidelity, purity and linear entropy are investigated of two quantum systems, which contain photon number distributions (discrete) and Husimi Q function (continuous distribution). A relation between the majorization and localization properties of continuous density functionals is established. The results are compared and verified for continuous and discrete distributions.
Analysis and Control of Autonomous Mobility-on-Demand Systems: A Review

Challenged by urbanization and increasing travel needs, existing transportation systems call for new mobility paradigms. In this article, we present the emerging concept of Autonomous Mobility-on-Demand, whereby centrally orchestrated fleets of autonomous vehicles provide mobility service to customers. We provide a comprehensive review of methods and tools to model and solve problems related to Autonomous Mobility-on-Demand systems. Specifically, we first identify problem settings for their analysis and control, both from the operational and the planning perspective. We then review modeling aspects, including transportation networks, transportation demand, congestion, operational constraints, and interactions with existing infrastructure. Thereafter, we provide a systematic analysis of existing solution methods and performance metrics, highlighting trends and trade-offs. Finally, we present various directions for further research. 1 ar X iv :2 10 6. 14 82 7v 1 [ ee ss . S Y ] 2 8 Ju n 20 21
Privacy-Preserving Image Acquisition Using Trainable Optical Kernel

Preserving privacy is a growing concern in our society where sensors and cameras are ubiquitous. In this work, for the first time, we propose a trainable image acquisition method that removes the sensitive identity revealing information in the optical domain before it reaches the image sensor. The method benefits from a trainable optical convolution kernel which transmits the desired information while filters out the sensitive content. As the sensitive content is suppressed before it reaches the image sensor, it does not enter the digital domain therefore is unretrievable by any sort of privacy attack. This is in contrast with the current digital privacy-preserving methods that are all vulnerable to direct access attack. Also, in contrast with the previous optical privacy-preserving methods that cannot be trained, our method is data-driven and optimized for the specific application at hand. Moreover, there is no additional computation, memory, or power burden on the acquisition system since this processing happens passively in the optical domain and can even be used together and on top of the fully digital privacy-preserving systems. The proposed approach is adaptable to different digital neural networks and content. We demonstrate it for several scenarios such as smile detection as the desired attribute while the gender is filtered out as the sensitive content. We trained the optical kernel in conjunction with two adversarial neural networks where the analysis network tries to detect the desired attribute and the adversarial network tries to detect the sensitive content. We show that this method can reduce 65.1% of sensitive content when it is selected to be the gender and it only loses 7.3% of the desired content. Moreover, we reconstruct the original faces using the deep reconstruction method that confirms the ineffectiveness of reconstruction attacks to obtain the sensitive content.
Biophysicochemical Evaluation of Jatropha curcas L. Collections for Biodiesel Production

Chemical characterization of Jatropha curcas seeds is supposed to be an interesting tool to extend the knowledge on alternative products of this plant, which is of great economic interest. Chemical composition of seed oil reflects the quality of produced biodiesel. The seed oils of 6 jatropha (among 30) biotypes were evaluated for their oil quality parameters: oil content (38–41%), acid value (1.22–13.40 mg/g), free fatty acid (0.06–3.50%), iodine value (115.48–163.37 mg/g), and viscosity (0.6320–0.7431). Significant differences among biotypes were observed in oil yield and biochemical parameters. The variability among the biotypes indicate a good scope of genetic gain through selection.
On a novel training algorithm for sequence-to-sequence predictive recurrent networks

Neural networks mapping sequences to sequences (seq2seq) lead to significant progress in machine translation and speech recognition. Their traditional architecture includes two recurrent networks (RNs) followed by a linear predictor. In this manuscript we perform analysis of a corresponding algorithm and show that the parameters of the RNs of the well trained predictive network are not independent of each other. Their dependence can be used to significantly improve the network effectiveness. The traditional seq2seq algorithms require short term memory of a size proportional to the predicted sequence length. This requirement is quite difficult to implement in a neuroscience context. We present a novel memoryless algorithm for seq2seq predictive networks and compare it to the traditional one in the context of time series prediction. We show that the new algorithm is more robust and makes predictions with higher accuracy than the traditional one.
Explicit Clothing Modeling for an Animatable Full-Body Avatar

scans with templates. In order to improve the photometric correspondence across different frames, texture alignment is then performed through inverse rendering of the clothing geometry and texture predicted by a variational autoencoder. We then train a new two-layer codec avatar with separate modeling of the upper clothing and the inner body layer. To learn the interaction between the body dynamics and clothing states, we use a temporal convolution network to predict the clothing latent code based on a sequence of input skeletal poses. We show photorealistic animation output for three different actors, and demonstrate the advantage of our clothed-body avatars over single-layer avatars in the previous work. We also show the benefit of an explicit clothing model which allows the clothing texture to be edited in the animation output.
Realtime Robust Malicious Traffic Detection via Frequency Domain Analysis

Machine learning (ML) based malicious traffic detection is an emerging security paradigm, particularly for zero-day attack detection, which is complementary to existing rule based detection. However, the existing ML based detection achieves low detection accuracy and low throughput incurred by inefficient traffic features extraction. Thus, they cannot detect attacks in realtime, especially in high throughput networks. Particularly, these detection systems similar to the existing rule based detection can be easily evaded by sophisticated attacks. To this end, we propose Whisper, a realtime ML based malicious traffic detection system that achieves both high accuracy and high throughput by utilizing frequency domain features. It utilizes sequential information represented by the frequency domain features to achieve bounded information loss, which ensures high detection accuracy, and meanwhile constrains the scale of features to achieve high detection throughput. In particular, attackers cannot easily interfere with the frequency domain features and thus Whisper is robust against various evasion attacks. Our experiments with 42 types of attacks demonstrate that, compared with the state-of-the-art systems, Whisper can accurately detect various sophisticated and stealthy attacks, achieving at most 18.36% improvement of AUC, while achieving two orders of magnitude throughput. Even under various evasion attacks, Whisper is still able to maintain around 90% detection accuracy.
On duoidal $\infty$-categories

A duoidal category is a category equipped with two monoidal structures in which one is (op)lax monoidal with respect to the other. In this paper we introduce duoidal ∞-categories which are counterparts of duoidal categories in the setting of ∞-categories. There are three kinds of functors between duoidal ∞-categories, which are called bilax, double lax, and double oplax monoidal functors. We make three formulations of ∞-categories of duoidal ∞-categories according to which functors we take. Furthermore, corresponding to the three kinds of functors, we define bimonoids, double monoids, and double comonoids in duoidal ∞-categories.
Universal quantum circuits for quantum chemistry

Universal gate sets for quantum computing have been known for decades, yet no universal gate set has been proposed for particle-conserving unitaries, which are the operations of interest in quantum chemistry. In this work, we show that controlled single-excitation gates in the form of Givens rotations are universal for particle-conserving unitaries. Single-excitation gates describe an arbitrary U(2) rotation on the two-qubit subspace spanned by the states |01⟩,|10⟩, while leaving other states unchanged – a transformation that is analogous to a single-qubit rotation on a dual-rail qubit. The proof is constructive, so our result also provides an explicit method for compiling arbitrary particle-conserving unitaries. Additionally, we describe a method for using controlled single-excitation gates to prepare an arbitrary state of a fixed number of particles. We derive analytical gradient formulas for Givens rotations as well as decompositions into single-qubit and CNOT gates. Our results offer a unifying framework for quantum computational chemistry where every algorithm is a unique recipe built from the same universal ingredients: Givens rotations.
THE SYMMETRIC KAZDAN–WARNER PROBLEM AND APPLICATIONS

After R. Schoen completed the solution of the Yamabe problem, compact manifolds could be categorized into three classes, depending on whether they admit a metric with positive, non-negative, or only negative scalar curvature. Here we follow Yamabe’s ﬁrst attempt to solve his problem through variational methods and provide an analogous equivalent classiﬁcation for manifolds equipped with actions by non-discrete compact Lie groups. Moreover, we apply the method and the results to: classify total spaces of ﬁber bundles with compact structure groups (concerning scalar curvature), to conclude density results and compare realizable scalar curvature functions between some exotic manifolds and their standard counterpart. We also provide an extended range of prescribed scalar curvature functions of warped products, es-pecially with Calabi–Yau manifolds.
What's in a Scientific Name?

To a good extent, words can be understood as corresponding to patterns or categories that appeared in order to represent concepts and structures that are particularly important or useful in a given time and space. Words are characterized by not being completely general nor specific, in the sense that the same word can be instantiated or related to several different contexts, depending on specific situations. Indeed, the way in which words are instantiated and associated represents a particularly interesting aspect that can substantially help to better understand the context in which they are employed. Scientific words are no exception to that. In the present work, we approach the associations between a set of particularly relevant words in the sense of being not only frequently used in several areas, but also representing concepts that are currently related to some of the main standing challenges in science. More specifically, the study reported here takes into account the words “prediction”, “model”, “optimization”, “complex”, “entropy”, “random”, “deterministic”, “pattern”, and “database”. In order to complement the analysis, we also obtain a network representing the relationship between the adopted areas. Many interesting results were found. First and foremost, several of the words were observed to have markedly distinct associations in different areas. Biology was found to be related to computer science, sharing associations with databases. Furthermore, for most of the cases, the words “complex”, “model”, and “prediction” were observed to have several strong associations.
On the Impact of Device-Level Techniques on Energy-Efficiency of Neural Network Accelerators

Energy-efficiency is a key concern for neural network applications. To alleviate this issue, hardware acceleration using FPGAs or GPUs can provide better energy-efficiency than general-purpose processors. However, further improvement of the energy-efficiency of such accelerators will be extremely beneficial specially to deploy neural network in power-constrained edge computing environments. In this paper, we experimentally explore the potential of device-level energy-efficiency techniques (e.g.,supply voltage underscaling, frequency scaling, and data quantization) for representative off-the-shelf FPGAs compared to GPUs. Frequency scaling in both platforms can improve the power and energy consumption but with performance overhead, e.g.,in GPUs it improves the power consumption and GOPs/J by up to 34% and 28%, respectively. However, leveraging reduced-precision instructions improves power (up to 13%), energy (up to 20%), and performance (up to 7%) simultaneously, with negligible reduction in accuracy of neural network accuracy.
Geometric phase for Dirac Hamiltonian under gravitational fields in the nonrelativistic regime

We show the appearance of geometric phase in a Dirac particle traversing in nonrelativistic limit in a time-independent gravitational field. This turns out to be similar to the one originally described as a geometric phase in magnetic fields. We explore the geometric phase in the Kerr and Schwarzschild geometries, which have significant astrophysical implications. Nevertheless, the work can be extended to any spacetime background including that of time-dependent. In the Kerr background, i.e. around a rotating black hole, geometric phase reveals both the Aharonov–Bohm effect and Pancharatnam–Berry phase. However, in a Schwarzschild geometry, i.e. around a nonrotating black hole, only the latter emerges. We expect that our assertions can be validated in both the strong gravity scenarios, like the spacetime around black holes, and weak gravity environment around Earth.
Nonparametric estimation of continuous DPPs with kernel methods

Determinantal Point Process (DPPs) are statistical models for repulsive point patterns. Both sampling and inference are tractable for DPPs, a rare feature among models with negative dependence that explains their popularity in machine learning and spatial statistics. Parametric and nonparametric inference methods have been proposed in the finite case, i.e. when the point patterns live in a finite ground set. In the continuous case, only parametric methods have been investigated, while nonparametric maximum likelihood for DPPs -- an optimization problem over trace-class operators -- has remained an open question. In this paper, we show that a restricted version of this maximum likelihood (MLE) problem falls within the scope of a recent representer theorem for nonnegative functions in an RKHS. This leads to a finite-dimensional problem, with strong statistical ties to the original MLE. Moreover, we propose, analyze, and demonstrate a fixed point algorithm to solve this finite-dimensional problem. Finally, we also provide a controlled estimate of the correlation kernel of the DPP, thus providing more interpretability.
Feature Importance Guided Attack: A Model Agnostic Adversarial Attack

Research in adversarial learning has primarily focused on homogeneous unstructured datasets, which often map into the problem space naturally. Inverting a feature space attack on heterogeneous datasets into the problem space is much more challenging, particularly the task of finding the perturbation to perform. This work presents a formal search strategy: the `Feature Importance Guided Attack' (FIGA), which finds perturbations in the feature space of heterogeneous tabular datasets to produce evasion attacks. We first demonstrate FIGA in the feature space and then in the problem space. FIGA assumes no prior knowledge of the defending model's learning algorithm and does not require any gradient information. FIGA assumes knowledge of the feature representation and the mean feature values of defending model's dataset. FIGA leverages feature importance rankings by perturbing the most important features of the input in the direction of the target class. While FIGA is conceptually similar to other work which uses feature selection processes (e.g., mimicry attacks), we formalize an attack algorithm with three tunable parameters and investigate the strength of FIGA on tabular datasets. We demonstrate the effectiveness of FIGA by evading phishing detection models trained on four different tabular phishing datasets and one financial dataset with an average success rate of 94%. We extend FIGA to the phishing problem space by limiting the possible perturbations to be valid and feasible in the phishing domain. We generate valid adversarial phishing sites that are visually identical to their unperturbed counterpart and use them to attack six tabular ML models achieving a 13.05% average success rate.