Legal Judgment Prediction is one of the most acclaimed fields for the combined area of NLP, AI, and Law. By legal prediction we mean an intelligent systems capable to predict specific judicial characteristics, such as judicial outcome, a judicial class, predict an specific case. In this research, we have used AI classifiers to predict judicial outcomes in the Brazilian legal system. For this purpose, we developed a text crawler to extract data from the official Brazilian electronic legal systems. These texts formed a dataset of second-degree murder and active corruption cases. We applied different classifiers, such as Support Vector Machines and Neural Networks, to predict judicial outcomes by analyzing textual features from the dataset. Our research showed that Regression Trees, Gated Recurring Units and Hierarchical Attention Networks presented higher metrics for different subsets. As a final goal, we explored the weights of one of the algorithms, the Hierarchical Attention Networks, to find a sample of the most important words used to absolve or convict defendants.

Due to the severity of the social media offensive and hateful comments in Brazil, and the lack of research in Portuguese, this paper provides the first large-scale expert annotated corpus of Brazilian Instagram comments for hate speech and offensive language detection. The HateBR corpus was collected from the comment section of Brazilian politicians' accounts on Instagram and manually annotated by specialists, reaching a high inter-annotator agreement. The corpus consists of 7,000 documents annotated according to three different layers: a binary classification (offensive versus non-offensive comments), offensiveness-level classification (highly, moderately, and slightly offensive), and nine hate speech groups (xenophobia, racism, homophobia, sexism, religious intolerance, partyism, apology for the dictatorship, antisemitism, and fatphobia). We also implemented baseline experiments for offensive language and hate speech detection and compared them with a literature baseline. Results show that the baseline experiments on our corpus outperform the current state-of-the-art for the Portuguese language.

The team does so by providing real time models and batch applications in the realm of risk and financial crime over the whole SumUp life cycle and products. Together with the risk platform squad the risk modelling team builds the necessary platform foundations for scalable and reliable ML model serving and development in SumUp. The platform enables a global approach supported by local specifics. Are you up for the challenge? At SumUp, we are driven to empower small businesses across the globe by de-hassling their lives and helping them to succeed.

It’s an age-old problem in procurement: Corporate buyers lack the time to negotiate fully with all suppliers. Historically this has left untapped value on the table for both buyers and suppliers. To address this challenge, Walmart deployed AI-powered negotiations software with a text-based interface (i.e., a chatbot) to connect with suppliers. So far, the chatbot is negotiating and closing agreements with 68% of suppliers approached, with each side gaining something it values. This article offers four lessons to deliver results from automated procurement negotiations: move quickly to a production pilot, start with indirect spend categories with pre-approved suppliers, decide on acceptable negotiation trade-offs, and scale by extending geographies, categories, and use cases.

Many aerial robotic applications require the ability to land on moving platforms, such as delivery trucks and marine research boats. We present a method to autonomously land an Unmanned Aerial Vehicle on a moving vehicle. A visual servoing controller approaches the ground vehicle using velocity commands calculated directly in image space. The control laws generate velocity commands in all three dimensions, eliminating the need for a separate height controller. The method has shown the ability to approach and land on the moving deck in simulation, indoor and outdoor environments, and compared to the other available methods, it has provided the fastest landing approach. Unlike many existing methods for landing on fast-moving platforms, this method does not rely on additional external setups, such as RTK, motion capture system, ground station, offboard processing, or communication with the vehicle, and it requires only the minimal set of hardware and localization sensors. The videos and source codes are also provided.

Vibration analysis is the process of evaluating the vibration characteristics of a machine or structure, typically with the goal of identifying any problems or abnormalities that may be present. Vibrations are often indicative of the health and performance of a machine or structure and can provide valuable information about the condition of certain components, such as bearings, gears, and motors. By analyzing the characteristics of vibrations, such as frequency, amplitude, and waveform, it is possible to identify potential problems or failures that may occur in the future. The analysis of vibration is often performed in the frequency domain since the pattern of abnormalities in this domain is more obvious than in the time domain. Vibration signals convey more information than others for predictive maintenance, a maintenance technique based on the condition of machines. Other techniques are oil (lubricant) analysis [1], infrared thermography [2], and sound pattern analysis [3-5]. Vibration and lubricant analysis were the most common techniques for predictive maintenance (PdM) [6]. PdM, which is developed in the 1970s, is an advancement of preventive maintenance, a time-based maintenance from the 1950s [7]. Vibration analysis is a key predictive maintenance technique (among others) since it can identify the problem of machines before they become too serious and cause unscheduled downtime [1].

In cost-per-click (CPC) or cost-per-impression (CPM) advertising campaigns, advertisers always run the risk of spending the budget without getting enough conversions. Moreover, the bidding on advertising inventory has few connections with propensity one that can reach to target cost-per-acquisition (tCPA) goals. To address this problem, this paper presents a bid optimization scenario to achieve the desired tCPA goals for advertisers. In particular, we build the optimization engine to make a decision by solving the rigorously formalized constrained optimization problem, which leverages the bid landscape model learned from rich historical auction data using non-parametric learning. The proposed model can naturally recommend the bid that meets the advertisers' expectations by making inference over advertisers' historical auction behaviors, which essentially deals with the data challenges commonly faced by bid landscape modeling: incomplete logs in auctions, and uncertainty due to the variation and fluctuations in advertising bidding behaviors. The bid optimization model outperforms the baseline methods on real-world campaigns, and has been applied into a wide range of scenarios for performance improvement and revenue liftup.

Configurable software systems are employed in many important application domains. Understanding the performance of the systems under all configurations is critical to prevent potential performance issues caused by misconfiguration. However, as the number of configurations can be prohibitively large, it is not possible to measure the system performance under all configurations. Thus, a common approach is to build a prediction model from a limited measurement data to predict the performance of all configurations as scalar values. However, it has been pointed out that there are different sources of uncertainty coming from the data collection or the modeling process, which can make the scalar predictions not certainly accurate. To address this problem, we propose a Bayesian deep learning based method, namely BDLPerf, that can incorporate uncertainty into the prediction model. BDLPerf can provide both scalar predictions for configurations' performance and the corresponding confidence intervals of these scalar predictions. We also develop a novel uncertainty calibration technique to ensure the reliability of the confidence intervals generated by a Bayesian prediction model. Finally, we suggest an efficient hyperparameter tuning technique so as to train the prediction model within a reasonable amount of time whilst achieving high accuracy. Our experimental results on 10 real-world systems show that BDLPerf achieves higher accuracy than existing approaches, in both scalar performance prediction and confidence interval estimation.

Neoplasms (NPs) and neurological diseases and disorders (NDDs) are amongst the major classes of diseases underlying deaths of a disproportionate number of people worldwide. To determine if there exist some distinctive features in the local wiring patterns of protein interactions emerging at the onset of a disease belonging to either of these two classes, we examined 112 and 175 protein interaction networks belonging to NPs and NDDs, respectively. Orbit usage profiles (OUPs) for each of these networks were enumerated by investigating the networks' local topology. 56 non-redundant OUPs (nrOUPs) were derived and used as network features for classification between these two disease classes. Four machine learning classifiers, namely, k-nearest neighbour (KNN), support vector machine (SVM), deep neural network (DNN), random forest (RF) were trained on these data. DNN obtained the greatest average AUPRC (0.988) among these classifiers. DNNs developed on node2vec and the proposed nrOUPs embeddings were compared using 5-fold cross validation on the basis of average values of the six of performance measures, viz., AUPRC, Accuracy, Sensitivity, Specificity, Precision and MCC. It was found that nrOUPs based classifier performed better in all of these six performance measures.

Ranking intuitionistic fuzzy sets with distance based ranking methods requires to calculate the distance between intuitionistic fuzzy set and a reference point which is known to have either maximum (positive ideal solution) or minimum (negative ideal solution) value. These group of approaches assume that as the distance of an intuitionistic fuzzy set to the reference point is decreases, the similarity of intuitionistic fuzzy set with that point increases. This is a misconception because an intuitionistic fuzzy set which has the shortest distance to positive ideal solution does not have to be the furthest from negative ideal solution for all circumstances when the distance function is nonlinear. This paper gives a mathematical proof of why this assumption is not valid for any of the non-linear distance functions and suggests a hypervolume based ranking approach as an alternative to distance based ranking. In addition, the suggested ranking approach is extended as a new multicriteria decision making method, HyperVolume based ASsessment (HVAS). HVAS is applied for multicriteria assessment of Turkey's energy alternatives. Results are compared with three well known distance based multicriteria decision making methods (TOPSIS, VIKOR, and CODAS).