Miracle-dz/UniFAR-FTUs huggingface dataset:
Supplementation of Cassava and Durian Hull Fermented Yeast (Saccharomyces cerevisiae) on Rumen Fermentation and Average Daily Gain in Crossbred Native Cattle

Ten, two-years old of crossbred native cattle weighing about at 250±20 kg were randomly divided into two groups according to receive two groups of supplemental dietary treatments by receiving YFCP1 + YFCP2 (T1) and YFCRR + YFDH (T2). The cows were offered the treatment diets at 2%BW and rice straw was fed ad li bitum. Means were compared using pair t-test. All animals were kept in individual pens and received free access to water. The results have revealed that supplementation of dietary treatment on feed intake was non-significantly different, while average daily gain (ADG) and rumen microorganisms especially bacteria and fungi zoospores were significant different and cattle in heifer fed YFCRR + YFDH (T2) treatments and received YFCP1 + YFCP2 (T1) (646.4 and 533.2 g/d). In addition, the ruminal pH, ammonia-nitrogen and blood urea nitrogen concentration were non-significantly different. Supplementation of T2 could improve population of bacteria and fungal zoospore higher than those fed T1, but decreased populations of Holotrich and Entodiniomorph protozoa in rumen. The results indicate that supplementation of yeast fermented cassava and durian hull as supplement diets with rice straw as roughage source could improve ruminal fermentation efficiency, average daily gain in crossbred native cattle.
A Survey of Distributed Denial of Service Attacks and Defenses

A distributed denial-of-service (DDoS) attack is an attack wherein multiple compromised computer systems flood the bandwidth and/or resources of a target, such as a server, website or other network resource, and cause a denial of service for users of the targeted resource. The flood of incoming messages, connection requests or malformed packets to the target system forces it to slow down or even crash and shut down, thereby denying service to legitimate users or systems. This paper presents a literature review of DDoS attacks and the common defense mechanisms available. It also presents a literature review of the defenses for low-rate DDoS attacks that have not been handled effectively hitherto.
Machine Learning approach for Credit Scoring

In this work we build a stack of machine learning models aimed at composing a state-of-the-art credit rating and default prediction system, obtaining excellent out-of-sample performances. Our approach is an excursion through the most recent ML / AI concepts, starting from natural language processes (NLP) applied to economic sectors' (textual) descriptions using embedding and autoencoders (AE), going through the classification of defaultable firms on the base of a wide range of economic features using gradient boosting machines (GBM) and calibrating their probabilities paying due attention to the treatment of unbalanced samples. Finally we assign credit ratings through genetic algorithms (differential evolution, DE). Model interpretability is achieved by implementing recent techniques such as SHAP and LIME, which explain predictions locally in features' space.
Reed at SemEval-2020 Task 9: Fine-Tuning and Bag-of-Words Approaches to Code-Mixed Sentiment Analysis

We explore the task of sentiment analysis on Hinglish (code-mixed Hindi-English) tweets as participants of Task 9 of the SemEval-2020 competition, known as the SentiMix task. We had two main approaches: 1) applying transfer learning by fine-tuning pre-trained BERT models and 2) training feedforward neural networks on bag-of-words representations. During the evaluation phase of the competition, we obtained an F-score of 71.3% with our best model, which placed 4th out of 62 entries in the official system rankings.
Processing Quantum Signals Carried by Electrical Currents

Recent developments in the coherent manipulation of electrons in ballistic conductors include the generation of time-periodic electrical currents involving one to few electronic excitations per period. However, using individual electrons as carrier of quantum information for flying qubit computation or quantum metrology applications calls for a general method to unravel the single-particle excitations embedded in a quantum electrical current and how quantum information is encoded within it. Here, we propose a general signal processing algorithm to extract the elementary single-particle states, called electronic atoms of signal, present in any periodic quantum electrical current. These excitations and their mutual quantum coherence describe the excess single-electron coherence in the same way musical notes and score describe a sound signal emitted by a music instrument. This method, which is the first step towards the development of signal processing of quantum electrical currents is illustrated by assessing the quality of experimentally relevant single electron sources. The example of randomized quantum electrical currents obtained by regularly clocked but randomly injected unit charge Lorentzian voltage pulses enables us to discuss how interplay of the coherence of the applied voltage and of the Pauli principle alter the quantum coherence between the emitted single particle excitations.
Guiding CNNs towards Relevant Concepts by Multi-task and Adversarial Learning

The opaqueness of deep learning limits its deployment in critical application scenarios such as cancer grading in medical images. In this paper, a framework for guiding CNN training is built on top of successful existing techniques of hard parameter sharing, with the main goal of explicitly introducing expert knowledge in the training objectives. The learning process is guided by identifying concepts that are relevant or misleading for the task. Relevant concepts are encouraged to appear in the representation through multi-task learning. Undesired and misleading concepts are discouraged by a gradient reversal operation. In this way, a shift in the deep representations can be corrected to match the clinicians' assumptions. The application on breast lymph nodes histopathology data from the Camelyon challenge shows a significant increase in the generalization performance on unseen patients (from 0.839 to 0.864 average AUC, $\text{p-value} = 0,0002$) when the internal representations are controlled by prior knowledge regarding the acquisition center and visual features of the tissue. The code will be shared for reproducibility on our GitHub repository.
Neuromorphic computing for content-based image retrieval

Neuromorphic computing mimics the neural activity of the brain through emulating spiking neural networks. In numerous machine learning tasks, neuromorphic chips are expected to provide superior solutions in terms of cost and power efficiency. Here, we explore the application of Loihi, a neuromorphic computing chip developed by Intel, for the computer vision task of image retrieval. We evaluated the functionalities and the performance metrics that are critical in content-based visual search and recommender systems using deep-learning embeddings. Our results show that the neuromorphic solution is about 2.5 times more energy-efficient compared with an ARM Cortex-A72 CPU and 12.5 times more energy-efficient compared with NVIDIA T4 GPU for inference by a lightweight convolutional neural network when batch size is 1 while maintaining the same level of matching accuracy. The study validates the potential of neuromorphic computing in low-power image retrieval, as a complementary paradigm to the existing von Neumann architectures.
Status and community-based conservation of marine turtles in the northern Querimbas Islands (Mozambique)

Abstract Situated in the northernmost part of Mozambique, the northern Querimbas Islands support some of the most diverse and pristine coral reefs in the Western Indian Ocean. The community-based turtle conservation programme that we developed on Vamizi Island has facilitated the identification and protection of a key nesting site for the green marine turtle Chelonia mydas in Mozambique, with a mean of 122 nests per year. The area is also used by nesting female and immature hawksbill turtles Eretmochelys imbricata. Nesting activity of green turtles was observed all year round, with a peak in the summer (February–March). Incubation periods of this species showed seasonal fluctuations inversely correlated with air temperature. Hatching success was high (87%) when nests were not lost through tidal overwash and erosion, which affected nearly 40% of all nests in 2007. Using satellite tracking of four green turtles nesting on Vamizi we identified foraging grounds in marine protected areas in Kenya, Tanzania and north-west Madagascar. Migratory routes of two individuals along the East African coast were generally neritic and all passed through the waters of multiple nations and as many as six marine conservation areas, emphasizing the importance of regional cooperation. Awareness programmes were also conducted with resource users, and the development of a community-based management system triggered the creation of a marine sanctuary by the local community.
Comparative Analysis of N-gram Text Representation on Igbo Text Document Similarity

The improvement in Information Technology has encouraged the use of Igbo in the creation of text such as resources and news articles online. Text similarity is of great importance in any text-based applications. This paper presents a comparative analysis of n-gram text representation on Igbo text document similarity. It adopted Euclidean similarity measure to determine the similarities between Igbo text documents represented with two word-based n-gram text representation (unigram and bigram) models. The evaluation of the similarity measure is based on the adopted text representation models. The model is designed with Object-Oriented Methodology and implemented with Python programming language with tools from Natural Language Toolkits (NLTK). The result shows that unigram represented text has highest distance values whereas bigram has the lowest corresponding distance values. The lower the distance value, the more similar the two documents and better the quality of the model when used for a task that requires similarity measure. The similarity of two documents increases as the distance value moves down to zero (0). Ideally, the result analyzed revealed that Igbo text document similarity measured on bigram represented text gives accurate similarity result. This will give better, effective and accurate result when used for tasks such as text classification, clustering and ranking on Igbo text.
Graph Signal Processing and Deep Learning: Convolution, Pooling, and Topology

Deep learning, particularly convolutional neural networks (CNNs), has yielded rapid, significant improvements in computer vision and related domains. But conventional deep learning architectures perform poorly when data have an underlying graph structure, as in social, biological, and many other domains. This article explores 1) how graph signal processing (GSP) can be used to extend CNN components to graphs to improve model performance and 2) how to design the graph CNN architecture based on the topology or structure of the data graph.
Central Object Segmentation by Deep Learning to Continuously Monitor Fruit Growth through RGB Images

Monitoring fruit growth is useful when estimating final yields in advance and predicting optimum harvest times. However, observing fruit all day at the farm via RGB images is not an easy task because the light conditions are constantly changing. In this paper, we present CROP (Central Roundish Object Painter). The method involves image segmentation by deep learning, and the architecture of the neural network is a deeper version of U-Net. CROP identifies different types of central roundish fruit in an RGB image in varied light conditions, and creates a corresponding mask. Counting the mask pixels gives the relative two-dimensional size of the fruit, and in this way, time-series images may provide a non-contact means of automatically monitoring fruit growth. Although our measurement unit is different from the traditional one (length), we believe that shape identification potentially provides more information. Interestingly, CROP can have a more general use, working even for some other roundish objects. For this reason, we hope that CROP and our methodology yield big data to promote scientific advancements in horticultural science and other fields.
Impact of Working Capital Management on Profitability: A Case Study of FMCG Sector in India

Working capital management is considered to play a vital role in financial management decision as it affects both liquidity and profitability of the firm. The aim of this paper is to analyse the different components of cash conversion cycle (CCC) and its impact on the profitability of the firm in terms of return on assets (ROA). The three variables of cash conversion cycle (CCC) considered in the study are inventory conversion period (ICP), receivables collection period (RCP) and creditors payment period (CPP). The data has been analyzed with the help of panel data regression, fixed effect LSDV model and Hausman test. The result revealed that there has been a significant impact of inventory conversion period on the profitability of the firms for the period under study which demonstrates that the firms efficiency is directly related to the proper management of working capital.
The World as a Neural Network

We discuss a possibility that the entire universe on its most fundamental level is a neural network. We identify two different types of dynamical degrees of freedom: “trainable” variables (e.g., bias vector or weight matrix) and “hidden” variables (e.g., state vector of neurons). We first consider stochastic evolution of the trainable variables to argue that near equilibrium their dynamics is well approximated by Madelung equations (with free energy representing the phase) and further away from the equilibrium by Hamilton–Jacobi equations (with free energy representing the Hamilton’s principal function). This shows that the trainable variables can indeed exhibit classical and quantum behaviors with the state vector of neurons representing the hidden variables. We then study stochastic evolution of the hidden variables by considering D non-interacting subsystems with average state vectors, x¯1, …, x¯D and an overall average state vector x¯0. In the limit when the weight matrix is a permutation matrix, the dynamics of x¯μ can be described in terms of relativistic strings in an emergent D+1 dimensional Minkowski space-time. If the subsystems are minimally interacting, with interactions that are described by a metric tensor, and then the emergent space-time becomes curved. We argue that the entropy production in such a system is a local function of the metric tensor which should be determined by the symmetries of the Onsager tensor. It turns out that a very simple and highly symmetric Onsager tensor leads to the entropy production described by the Einstein–Hilbert term. This shows that the learning dynamics of a neural network can indeed exhibit approximate behaviors that were described by both quantum mechanics and general relativity. We also discuss a possibility that the two descriptions are holographic duals of each other.
Cache-Oblivious Priority Queues with Decrease-Key and Applications to Graph Algorithms.

We present priority queues in the cache-oblivious external memory model with block size $B$ and main memory size $M$ that support on $N$ elements, operation \textsc{UPDATE} (combination of \textsc{INSERT} and \textsc{DECREASEKEY}) in $O \left(\frac{1}{B}\log_{\frac{\lambda}{B}} \frac{N}{B}\right)$ amortized I/Os and operations \textsc{EXTRACT-MIN} and \textsc{DELETE} in $O \left(\lceil \frac{\lambda^{\varepsilon}}{B} \log_{\frac{\lambda}{B}} \frac{N}{B} \rceil \log_{\frac{\lambda}{B}} \frac{N}{B}\right)$ amortized I/Os, using $O \left(\frac{N}{B}\log_{\frac{\lambda}{B}} \frac{N}{B}\right)$ blocks, for a user-defined parameter $\lambda \in [2, N ]$ and any real $\varepsilon \in (0,1)$. Our result improves upon previous I/O-efficient cache-oblivious and cache-aware priority queues [Chowdhury and Ramachandran, TALG 2018], [Brodal et al., SWAT 2004], [Kumar and Schwabe, SPDP 1996], [Arge et al., SICOMP 2007], [Fadel et al., TCS 1999]. We also present buffered repository trees that support on a multi-set of $N$ elements, operation \textsc{INSERT} in $O \left(\frac{1}{B}\log_{\frac{\lambda}{B}} \frac{N}{B}\right)$ I/Os and operation \textsc{EXTRACT} on $K$ extracted elements in $O \left(\frac{\lambda^{\varepsilon}}{B} \log_{\frac{\lambda}{B}} \frac{N}{B} + \frac{K}{B}\right)$ amortized I/Os, using $O \left(\frac{N}{B}\right)$ blocks, improving previous cache-aware and cache-oblivious results [Arge et al., SICOMP '07], [Buchsbaum et al., SODA '00]. In the cache-oblivious model, for $\lambda = O \left(E/V\right)$, we achieve $O \left(\frac{E}{B}\log_{\frac{E}{V B}} \frac{E}{B}\right)$ I/Os for single-source shortest paths, depth-first search and breadth-first search algorithms on massive directed dense graphs $(V,E)$. Our algorithms are I/O-optimal for $E/V = \Omega (M)$ (and in the cache-aware setting for $\lambda = O(M)$).
TREND: Transferability-Based Robust ENsemble Design

Deep learning models hold state-of-the-art performance in many fields, but their vulnerability to adversarial examples poses a threat to their ubiquitous deployment in practical settings. Additionally, adversarial inputs generated on one classifier have been shown to transfer to other classifiers trained on similar data, which makes the attacks possible even if model parameters are not revealed to the adversary. This property of transferability has not yet been systematically studied, leading to a gap in our understanding of robustness of neural networks to adversarial inputs. In this work, we study the effect of network architecture, optimizer, input, weight, and activation quantization on transferability of adversarial samples. We also study the transferability of different attacks. Our experiments reveal that transferability is significantly hampered by input quantization and architectural mismatch between source and target, and the choice of optimizer turns out to be critical. We observe that transferability is architecture-dependent for both weight and activation quantized models. To quantify transferability, we use simple metric and demonstrate the utility of the metric in designing a methodology to build ensembles with improved adversarial robustness. When attacking ensembles we observe that “gradient domination” by a single ensemble member model hampers existing attacks. To combat this we propose a new state-of-the-art ensemble attack. We compare the proposed attack with existing attack techniques to show its effectiveness. Finally, we show that an ensemble consisting of carefully chosen diverse networks achieves better adversarial robustness than would otherwise be possible with a single network. The source code for this work has been made available at https://github.com/purdue-nrl/TREND.
Learning to Play Two-Player Perfect-Information Games without Knowledge

In this paper, several techniques for learning game state evaluation functions by reinforcement are proposed. The first is a generalization of tree bootstrapping (tree learning): it is adapted to the context of reinforcement learning without knowledge based on non-linear functions. With this technique, no information is lost during the reinforcement learning process. The second is a modification of minimax with unbounded depth extending the best sequences of actions to the terminal states. This modified search is intended to be used during the learning process. The third is to replace the classic gain of a game (+1 / -1) with a reinforcement heuristic. We study particular reinforcement heuristics such as: quick wins and slow defeats ; scoring ; mobility or presence. The four is another variant of unbounded minimax, which plays the safest action instead of playing the best action. This modified search is intended to be used after the learning process. The five is a new action selection distribution. The conducted experiments suggest that these techniques improve the level of play. Finally, we apply these different techniques to design program-players to the game of Hex (size 11 and 13) surpassing the level of Mohex 2.0 with reinforcement learning from self-play without knowledge. At Hex size 11 (without swap), the program-player reaches the level of Mohex 3HNN.
Moored observations of turbulent mixing events in deep Lake Garda, Italy

Deep water circulation and mixing processes in deep lakes are largely unknown, although they are responsible for the transport of matter, nutrients and pollutants. Such a lack of knowledge cannot be reliably provided by numerical hydrodynamic modelling studies because detailed observations are typically not available to validate them. To overcome some of these deficiencies, a dedicated yearlong mooring comprising 100 high-resolution temperature sensors and a single current meter were located in the deeper half of the 344 m deepest point of the subalpine Lake Garda (Italy). The observations show peaks and calms of turbulent exchange, besides ubiquitous internal wave activity. In late winter, northerly winds activate episodic deep convective overturning, the dense water being subsequently advected along the lake-floor. Besides deep convection, such winds also set-up seiches and inertial waves that are associated with about 100 times larger turbulence dissipation rates than that by semidiurnal internal wave breaking observed in summer. In the lower 60 m above the lake-floor however, the average turbulence dissipation rate is approximately constant in value year-around, being about 10 times larger than open-ocean values, except during deep convection episodes.
Explanation of Reinforcement Learning Model in Dynamic Multi-Agent System

Recently, there has been increasing interest in transparency and interpretability in Deep Reinforcement Learning (DRL) systems. Verbal explanations, as the most natural way of communication in our daily life, deserve more attention, since they allow users to gain a better understanding of the system which ultimately could lead to a high level of trust and smooth collaboration. This paper reports a novel work in generating verbal explanations for DRL behaviors agent. A rule-based model is designed to construct explanations using a series of rules which are predefined with prior knowledge. A learning model is then proposed to expand the implicit logic of generating verbal explanation to general situations by employing rule-based explanations as training data. The learning model is shown to have better flexibility and generalizability than the static rule-based model. The performance of both models is evaluated quantitatively through objective metrics. The results show that verbal explanation generated by both models improve subjective satisfaction of users towards the interpretability of DRL systems. Additionally, seven variants of the learning model are designed to illustrate the contribution of input channels, attention mechanism, and proposed encoder in improving the quality of verbal explanation.