Search

Objective The purpose of this study was to develop a natural language processing (NLP) pipeline to identify incidental thyroid nodules (ITNs) meeting criteria for sonographic follow-up and to assess both adherence rates to white paper recommendations and downstream outcomes related to these incidental findings. Methods 21583 non-contrast chest CT reports from 2017 and 2018 were retrospectively evaluated to identify reports which included either an explicit recommendation for thyroid ultrasound, a description of a nodule ≥ 1.5 cm, or description of a nodule with suspicious features. Reports from 2018 were used to train an NLP algorithm called fastText for automated identification of such reports. Algorithm performance was then evaluated on the 2017 reports. Next, any patient from 2017 with a report meeting criteria for ultrasound follow-up was further evaluated with manual chart review to determine follow-up adherence rates and nodule-related outcomes. Results NLP identified reports with ITNs meeting criteria for sonographic follow-up with an accuracy of 96.5% (95% CI 96.2-96.7) and sensitivity of 92.1% (95% CI 89.8-94.3). In 10006 chest CTs from 2017, ITN follow-up ultrasound was indicated according to white paper criteria in 81 patients (0.8%), explicitly recommended in 46.9% (38/81) of patients, and obtained in less than half of patients in which it was appropriately recommended (17/35, 48.6%). Discussion NLP accurately identified chest CT reports meeting criteria for ITN ultrasound follow-up. Radiologist adherence to white paper guidelines and subsequent referrer adherence to radiologist recommendations showed room for improvement.

The accuracy of a predictive system is critical for predictive maintenance and to support the right decisions at the right times. Statistical models, such as ARIMA and SARIMA, are unable to describe the stochastic nature of the data. Neural networks, such as long short-term memory (LSTM) and the gated recurrent unit (GRU), are good predictors for univariate and multivariate data. The present paper describes a case study where the performances of long short-term memory and gated recurrent units are compared, based on different hyperparameters. In general, gated recurrent units exhibit better performance, based on a case study on pulp paper presses. The final result demonstrates that, to maximize the equipment availability, gated recurrent units, as demonstrated in the paper, are the best options.

Due to the increasing use of the Internet and other online resources, there is tremendous growth in the data of text documents. It is not possible to manage this huge data manually. This has led to the growth of fields like text mining and text summarization. This paper presents a title prediction model for research papers using Recursive Recurrent Neural Network (Recursive RNN) and evaluates its performance by comparing it with sequence-to-sequence models. Research papers published between 2018 and 2020 were obtained from a standard repository, viz. Kaggle, to train the title prediction model. The performance of different versions of Recursive RNN and Seq2Seq was evaluated in terms of training and hold-out loss. The experimental results show that Recursive RNN models perform significantly better than the other models.

The clinical importance of blood group (BG) antigens is related to their ability to induce immune antibodies that can cause hemolysis. Yet, ABO and D (Rh) are still considered to be the key antigens for healthy blood transfusion and secondary antigens are the next priority. Serological typing is the most widely used typing method. Rapid and accurate blood grouping plays an important role in some clinical conditions, rather than conventional techniques. Hence, developing a simple and economical model for rapid blood grouping would facilitate these tests. In recent decades, paper-based microfluidics such as μPADs has gained much interest in wide application areas such as point-of-care diagnostic. In this study, we evaluated μPADs that are performed for blood grouping and its recent progress. A comprehensive literature search was performed using databases including PUBMED, SCOPUS, Web of Science and Google Scholar. Keywords were blood grouping or typing, paper analytical device, rapid test, etc. After investigation of search results, 16 papers from 2010 to 2020 were included. Further information in detail was classified in Table 1. Generally, two principles for blood typing μPADs are introduced. The lateral chromatographic flow method and the vertical flow-through method that detects BG in a visual-based manner. To detect results with acceptable clarity many factors and challenges like paper, blood sample, buffer, Ab and RBC interaction and also μPADs stability need to be considered, which are discussed. In conclusion, the simplicity, stability, cheapness, portability and biocompatibility of μPADs for blood grouping confirming its utility and also they have the capability to robust, universal blood-grouping platform. Table 1 Summary of blood grouping tests using paper-based analytical devices Antigens Type of diagnosis Validation method Sample No Accuracy Action time Paper type Stability Sample dilution Buffer Ref A, B, Rh Forward volunteers records 5 - - Whatman No. 4 - 1/2 PBS* (Khan et al. 2010) A, B, Rh Forward gel assay test and conventional slide test 100 100% 1 min Whatman No. 4 and Kleeenex paper towel 7 Days in 4 °C 1/1 NSS (Al-Tamimi et al. 2012) A, B, Rh Forward gel card assay 99 100% 20 Sec + Washing Kleeenex paper towel - 1/1 NSS (Li et al. 2012) A, B, Rh Forward - - - - Kleeenex paper towel - 45/100 PSS (Li et al. 2013) A, B, Rh Forward gel card assay 98 100% 1.5 min Kleeenex paper towel - 85/100 PBS (Guan et al. 2014b) C, E, c, e, K, Jka, Jkb, M, N, S, P1, and Lea Forward gel card assay 266 100% - Kleeenex paper towel - 1/1 NSS (Li et al. 2014b) A, B, Rh Forward and Reverse conventional slide test 96 ≈ 91% 10 min Whatman No. 1 21 Days in 4 °C 1/2 NSS (Noiphung et al. 2015) C, c, E, e, K, k, Fya, Fyb, Jka, Jkb, M, N, S and s, P1, Lea and Leb Forward - 478 - - Kleeenex paper towel - 1/1 NSS, PBS (Then et al. 2015) A, B Forward and Reverse conventional slide test 76 100% 5-8 min Whatman No. 4 38 Days in 4 °C 1/4, 1/1 NSS (Songjaroen and Laiwattanapaisal 2016) D, K Forward volunteers records 210 - 7.5 min Kleenex paper towel - 1/1 NSS (Yeow et al. 2016) A, B, c, e, D, C, E, M, N, S, s, P1, Jka, Jkb, Lea, Leb, Fya, and Fyb Forward and Reverse gel card assay 3550 ≈100% 30 s Fiber glass and cotton linter 180 Days in 25 °C 45/100, 1/1 PBS (Zhang et al. 2017) A, B Forward conventional slide test 598 100% 3 min Whatman No. 113 14 Day in 4 °C 1/1 NSS (Songjaroen et al. 2018) A, B, Rh Forward conventional slide test - - 30 Sec + Washing Unrefined sisal paper - 1/2 NSS (Casals-Terré et al. 2019) A, B, Rh Forward - - - - Whatman No.1 - 1/1 NSS (Ansari et al. 2020) ABORh Forward and Reverse conventional slide test - 100% Unrefined Eucalyptus papers - 1/2 NSS, PBS (Casals-Terré et al. 2020) A, B, Rh Forward - - - 30 Sec + Washing Whatman No. 4 modified with chitosan ≥ 100 days in 25 °C 1/1 NSS (Parween et al. 2020)

International audience; This paper focuses on the problem of the hierarchical multi‐label classification of research papers, which is the task of assigning the set of relevant labels for a paper from a hierarchy, using reduced amounts of labelled training data. Specifically, we study leveraging unlabelled data, which are usually plentiful and easy to collect, in addition to the few available labelled ones in a semi‐supervised learning framework for achieving better performance results. Thus, in this paper, we propose a semi‐supervised approach for the hierarchical multi‐label classification task of research papers based on the well‐known Co‐training algorithm, which exploit content and bibliographic coupling information as two distinct papers' views. In our approach, two hierarchical multi‐label classifiers, are learnt on different views of the labelled data, and iteratively select their most confident unlabelled samples, which are further added to the labelled set. The success of our suggested Co‐training‐based approach lies in two main components. The first is the use of two suggested selection criteria (i.e., Maximum Agreement and Labels Cardinality Consistency) that enforce selecting confident unlabelled samples. The second is the appliance of an oversampling method that rebalances the labels distribution of the initial labelled set, which reduces the reinforcement of the label imbalance issue during the Co‐training learning. The proposed approach is evaluated using a collection of scientific papers extracted from the ACM digital library. Performed experiments show the effectiveness of our approach with regards to several baseline methods.

Performance/security trade-off is widely noticed in CFI research, however, we observe that not every CFI scheme is subject to the trade-off. Motivated by the key observation, we ask three questions: ➊ does trade-off really exist in different CFI schemes? ➋ if trade-off do exist, how do previous works comply with it? ➌ how can it inspire future research? Although the three questions probably cannot be directly answered, they are inspiring. We find that a deeper understanding of the nature of the trade-off will help answer the three questions. Accordingly, we proposed theGPTconjecture to pinpoint the trade-off in designing CFI schemes, which says that at most two out of three properties (fine granularity, acceptable performance, and preventive protection) could be achieved.

Headline generation is a challenging subtask of abstractive text summarization, which its output should be a summary, shorter than one sentence. It would be precious to develop a dataset for the evaluation of abstractive summarization methods on this task in the Persian language. There are several datasets for headline generation in Persian, most of which are not large enough to be used by more sophisticated methods of text summarization, such as deep learning models. Moreover, all of these datasets are focused on daily news and there is no dataset for summarizing scientific Persian papers. In this article, we present “ElmNet,” a headline generation dataset of about 400,000 abstract/headline pairs of scientific papers, gathered from six major publishers for scientific articles in Persian. We, moreover, evaluate the performance of the most important deep learning-based headline generation methods, on the proposed dataset. The results prove the comparability of the performance of the state-of-the-art methods on this task, to their results on the existing English datasets.

Text summarization is one problem in natural language processing that generates a brief version of the original document. This research took attention for some researchers in this last decade and growing fast, including Indonesia language. This paper aims to recap summarization text research especially in Indonesia language. As usual, this paper discusses two summarization approaches, extractive and abstractive. In fact, the number of research of extractive is more than abstractive. This paper investigates some methods such as Statistical Based Approach, Graph Based Approach, Machine Learning Approach, Fuzzy Logic Approach, Algebraic Approach, and Hybrid Approach. This paper shows some methods details and summarize the results. Keywords— Text summarization, extractive summary, abstractive summary, natural language processing

Many Indonesian spelling errors occur in research papers published to the public, closely related to academics in all institutions such as research institutions, government, schools, and universities. The spelling errors usually writing punctuation, writing letters, writing words, writing words originating from foreign or regional languages (uptake words), using affixed words, and writing ineffective sentences. The mistakes made by the academics then become a cycle in the academic environment. They usually provide guidance for writing an undergraduate thesis, thesis, dissertations to students, or the other forms of documents and scientific papers. Therefore, the research proposed the application to facilitate all authors of scientific papers in producing quality scientific works based on the General Guidelines for Indonesian Spelling published by the Agency for Development and Language Development. The application is named KEBI 1.0 Checker (Indonesian Spelling Error 1.0 Checker), a web-based application with a built-in algorithm to detect and correct Indonesian Spelling in scientific papers. The experiment result shows that the application has given the best accuracy performance to correct the non-standard words, and typographical errors reached 100% and 55,52%, respectively. The application also has been detected 209 meaningless words. The application processing time is relatively low, the average time needed to correct non-standard words is 0.016 seconds, and typo words are 14.58 seconds. KEBI 1.0 Checker is helpful for the end-user in academics but needs to improve the vocabulary of the large corpus in various fields of science for correcting typo words.

This study explored the relationship between syntactic complexity and rhetorical functions and the relationship between syntactic complexity and level of move/step realization in learner-generated research paper introductions. We created a corpus of 79 introductions written by undergraduate L2 students at intermediate to high-intermediate levels. We annotated the introductions for moves and steps, measured their syntactic complexity at the global, clausal, and phrasal levels, and rated their level of move/step realization across four levels (no, low, intermediate, and high). We conducted one-way MANOVA, one-way ANOVA, Pearson correlation, and stepwise multiple linear regression analyses. We found sentences realizing Reviewing items of previous research function to be significantly longer than other steps in Move1 and to contain significantly more clausal and phrasal complexity features. Sentences performing Claiming centrality function also demonstrated significantly more phrasal complexity features as measured by complex nominals per clause. We also found a higher level of phrasal complexity in introductions with a higher level of move/step realization, which can be attributed to introductions including Step1 and Step3, rather than containing all steps. Our findings imply that there is value in developing explicit instructions on how to use complex structures in performing rhetorical steps in research paper introductions. © 2021 Elsevier Ltd

Formulaic expressions, such as 'in this paper we propose', are helpful for authors of scholarly papers because they convey communicative functions; in the above, it is showing the aim of this paper'. Thus, resources of formulaic expressions, such as a dictionary, that could be looked up easily would be useful. However, forms of formulaic expressions can often vary to a great extent. For example, 'in this paper we propose', 'in this study we propose' and 'in this paper we propose a new method to' are all regarded as formulaic expressions. Such a diversity of spans and forms causes problems in both extraction and evaluation of formulaic expressions. In this paper, we propose a new approach that is robust to variation of spans and forms of formulaic expressions. Our approach regards a sentence as consisting of a formulaic part and non-formulaic part. Then, instead of trying to extract formulaic expressions from a whole corpus, by extracting them from each sentence, different forms can be dealt with at once. Based on this formulation, to avoid the diversity problem, we propose evaluating extraction methods by how much they convey specific communicative functions rather than by comparing extracted expressions to an existing lexicon. We also propose a new extraction method that utilises named entities and dependency structures to remove the non-formulaic part from a sentence. Experimental results show that the proposed extraction method achieved the best performance compared to other existing methods., 21 pages, 11 figures

Heart disease has been one of the ruling causes for death for quite some time now. About 31% of all deaths every year in the world take place as a result of cardiovascular diseases [1]. A majority of the patients remain uninformed of their symptoms until quite late while others find it difficult to minimise the effects of risk factors that cause heart diseases. Machine Learning Algorithms have been quite efficacious in producing results with a high level of correctness thereby preventing the onset of heart diseases in many patients and reducing the impact in the ones that are already affected by such diseases. It has helped medical researchers and doctors all over the world in recognising patterns in the patients resulting in early detections of heart diseases.

The development of microfluidic devices for point-of-care (POC) testing has been widely applied for food quality control, environmental monitoring, and clinical diagnoses. Regarding the latter, microfluidic paper-based analytical devices (µPADs) have a great potential in developing portable and disposable platforms for fast disease-relevant biomarker detection in remote areas. In this work, k-nearest neighbors (k-NN) classifiers were applied to demonstrate the reliability of using chemical data obtained from µPADs for diagnosis of diseases like diabetes mellitus and hyperuricemia. Predictors based on glucose, lactate, and uric acid biomarkers were evaluated to reach this goal. Healthy adults were differentiated from the diagnosed patients with a perfect success rate. Metabolic disorders were suitably predicted with 95.0% overall accuracy. This model also showed sensitivities and specificities in the ranges 75–100% and 93–100%, respectively, indicating that the classification protocol is robust. The k-NN modeling proved the potential of the µPADs to be applied in telemedicine for reliable off-site diagnoses.

This companion paper is to support the replication of paper "Campus3D: A Photogrammetry Point Cloud Benchmark for Outdoor Scene Hierarchical Understanding", which was presented at ACM Multimedia 2020. The supported paper's main purpose was to provide a photogrammetry point cloud-based dataset with hierarchical multilabels to facilitate the area of 3D deep learning. Based on this provided dataset and source code, in this work, we build a complete package to reimplement the proposed methods and experiments (i.e., the hierarchical learning framework and the benchmarks of the hierarchical semantic segmentation task). Specifically, this paper contains the technical details of the package, including file structure, dataset preparation, installation package, and the conduction of the experiment. We also present the replicated experiment results and indicate our contributions to the original implementation.

In this paper we reproduce experimental results presented in our earlier work titled "Describing Subjective Experiment Consistency by $p$-Value P-P Plot" that was presented in the course of the 28th ACM International Conference on Multimedia. The paper aims at verifying the soundness of our prior results and helping others understand our software framework. We present artifacts that help reproduce tables, figures and all the data derived from raw subjective responses that were included in our earlier work. Using the artifacts we show that our results are reproducible. We invite everyone to use our software framework for subjective responses analyses going beyond reproducibility efforts., Comment: Please refer to the original publication: https://dl.acm.org/doi/10.1145/3474085.3477935 Related paper: https://dl.acm.org/doi/abs/10.1145/3394171.3413749 or arXiv:2009.13372

In this project our goal is to build a tweet sentimental analysis in which user can search and analyse thousands of tweets in one go. For backend we will use python and Django web framework and for front end we are going to use HTML, Css and bootstrap. It will help to analyse any hashtag and companies about their product feedback reviews. This project contains only the one user side. It is like a tweets search analyser. The design of this project is pretty simple so that the user won’t find any difficulties while working on it.

Due to the increasing size of s (s), their design and optimization phases (i.e., ) grow increasingly complex. At design time, a large design space needs to be explored to find an implementation that fulfills all specifications and then optimizes metrics like energy, area, delay, reliability, etc. At run time, a large configuration space needs to be searched to find the best set of parameters (e.g., voltage/frequency) to further optimize the system. Both spaces are infeasible for exhaustive search typically leading to heuristic optimization algorithms that find some trade-off between design quality and computational overhead. ML can build powerful models that have successfully been employed in related domains. In this survey, we categorize how () may be used and is used for design-time and run-time optimization and exploration strategies of s. A meta-study of published techniques unveils areas in that are well-explored and underexplored with, as well as trends in the employed algorithms. We present a comprehensive categorization and summary of the state of the art on for. Finally, we summarize remaining challenges and promising open research directions.

This chapter focuses on cost control by analyzing the intelligent control system of waste paper deinking production line, and finally designs a solution. In the aspect of control index, machine learning has designed a solution that pays less attention to the benefit of a single control loop and focuses on maximizing the overall benefit of the production line. In the aspect of control demand, according to the complexity of waste paper deinking production line, a distributed control solution is designed Finally, according to the dynamic fuzziness in machine learning system, the basic concept of dynamic fuzzy machine learning is constructed by using dynamic fuzzy set The dynamic fuzzy machine learning model is described and the related learning algorithm is given. Finally, a simulation example is given, and satisfactory results are obtained by comparing with the elastic BP algorithm RPROP of neural network.

This companion paper supports the replication of the fashion trend forecasting experiments with the KERN (Knowledge Enhanced Recurrent Network) method that we presented in the ICMR 2020. We provide an artifact that allows the replication of the experiments using a Python implementation. The artifact is easy to deploy with simple installation, training and evaluation. We reproduce the experiments conducted in the original paper and obtain similar performance as previously reported. The replication results of the experiments support the main claims in the original paper.

The entire scientific and academic community has been mobilized to gain a better understanding of the COVID-19 disease and its impact on humanity. Most research related to COVID-19 needs to analyze large amounts of data in very little time. This urgency has made Big Data Analysis, and related questions around the privacy and security of the data, an extremely important part of research in the COVID-19 era. The White House OSTP has, for example, released a large dataset of papers related to COVID research from which the research community can extract knowledge and information. We show an example system with a machine learning-based knowledge extractor which draws out key medical information from COVID-19 related academic research papers. We represent this knowledge in a Knowledge Graph that uses the Unified Medical Language System (UMLS). However, publicly available studies rely on dataset that might have sensitive data. Extracting information from academic papers can potentially leak sensitive data, and protecting the security and privacy of this data is equally important. In this paper, we address the key challenges around the privacy and security of such information extraction and analysis systems. Policy regulations like HIPAA have updated the guidelines to access data, specifically, data related to COVID-19, securely. In the US, healthcare providers must also comply with the Office of Civil Rights (OCR) rules to protect data integrity in matters like plasma donation, media access to health care data, telehealth communications, etc. Privacy policies are typically short and unstructured HTML or PDF documents. We have created a framework to extract relevant knowledge from the health centers’ policy documents and also represent these as a knowledge graph. Our framework helps to understand the extent to which individual provider policies comply with regulations and define access control policies that enforce the regulation rules on data in the knowledge graph extracted from COVID-related papers. Along with being compliant, privacy policies must also be transparent and easily understood by the clients. We analyze the relative readability of healthcare privacy policies and discuss the impact. In this paper, we develop a framework for access control decisions that uses policy compliance information to securely retrieve COVID data. We show how policy compliance information can be used to restrict access to COVID-19 data and information extracted from research papers.

Blind natural video quality assessment (BVQA), also known as no-reference video quality assessment, is a highly active research topic. In our recent contribution titled "Blind Natural Video Quality Prediction via Statistical Temporal Features and Deep Spatial Features" published in ACM Multimedia 2020, we proposed a two-level video quality model employing statistical temporal features and spatial features extracted by a deep convolutional neural network (CNN) for this purpose. At the time of publishing, the proposed model (CNN-TLVQM) achieved state-of-the-art results in BVQA. In this paper, we describe the process of reproducing the published results by using CNN-TLVQM on two publicly available natural video quality datasets.

Our eventual goal regarding this study is to support students with developing paper-writing skill. In order to achieve this goal, we have been trying to find characteristic features of good papers through analyzing educational and other kinds of data. We take conference papers as target data and suppose full/regular papers are good because they are chosen as reviewers evaluate them more valuable to be presented in the conference than other papers. In our series of study, we have been surveying the differences of full and short papers. In this paper, we aim to investigate further differences of them by taking different analysis method. We have been using the numbers of occurrences of each word in full/short papers as the data for analysis. In this paper we use the numbers of full/short papers that contain the word instead of the total numbers of occurrences of words. We define a new index of a word which shows how likely it is used in full or short papers. We discuss its effectiveness by applying it to an experiment of distinguishing full and short papers.

Paper-based analytical devices (PADs) employing colorimetric detection and smartphone images have gained wider acceptance in a variety of measurement applications. The PADs are primarily meant to be used in field settings where assay and imaging conditions greatly vary resulting in less accurate results. Recently, machine learning (ML) assisted models have been used in image analysis. We evaluated a combinations of four ML models - logistic regression, support vector machine, random forest, and artificial neural network, and three image color spaces - RGB, HSV, and LAB for their ability to accurately predict analyte concentrations. We used images of PADs taken at varying lighting conditions, with different cameras, and users for food color and enzyme inhibition assays to create training and test datasets. Prediction accuracy was higher for food color than enzyme inhibition assays in most of the ML model and colorspace combinations. All models better predicted coarse level classification than fine grained concentration labels. ML models using sample color along with a reference color increased the models’ ability in predicting the result in which the reference color may have partially factored out the variation in ambient assay and imaging conditions. The best concentration label prediction accuracy obtained for food color was 0.966 when using ANN model and LAB colorspace. The accuracy for enzyme inhibition assay was 0.908 when using SVM model and LAB colorspace. Appropriate model and colorspace combinations can be useful to analyze large numbers of samples on PADs as a powerful low-cost quick field-testing tool.

In this paper, we propose a data augmentation framework for Optical Character Recognition (OCR). The proposed framework is able to synthesize new viewing angles and illumination scenarios, effectively enriching any available OCR dataset. Its modular structure allows to be modified to match individual user requirements. The framework enables to comfortably scale the enlargement factor of the available dataset. Furthermore, the proposed method is not restricted to single frame OCR but can also be applied to video OCR. We demonstrate the performance of our framework by augmenting a 15% subset of the common Brno Mobile OCR dataset. Our proposed framework is capable of leveraging the performance of OCR applications especially for small datasets. Applying the proposed method, improvements of up to 2.79 percentage points in terms of Character Error Rate (CER), and up to 7.88 percentage points in terms of Word Error Rate (WER) are achieved on the subset. Especially the recognition of challenging text lines can be improved. The CER may be decreased by up to 14.92 percentage points and the WER by up to 18.19 percentage points for this class. Moreover, we are able to achieve smaller error rates when training on the 15% subset augmented with the proposed method than on the original nonaugmented full dataset.

Automatically detecting the positions of key-points (e.g., facial key-points or finger key-points) in an image is an essential problem in many applications, such as driver's gaze detection and drowsiness detection in automated driving systems. With the recent advances of Deep Neural Networks (DNNs), Key-Points detection DNNs (KP-DNNs) have been increasingly employed for that purpose. Nevertheless, KP-DNN testing and validation have remained a challenging problem because KP-DNNs predict many independent key-points at the same time -- where each individual key-point may be critical in the targeted application -- and images can vary a great deal according to many factors. In this paper, we present an approach to automatically generate test data for KP-DNNs using many-objective search. In our experiments, focused on facial key-points detection DNNs developed for an industrial automotive application, we show that our approach can generate test suites to severely mispredict, on average, more than 93% of all key-points. In comparison, random search-based test data generation can only severely mispredict 41% of them. Many of these mispredictions, however, are not avoidable and should not therefore be considered failures. We also empirically compare state-of-the-art, many-objective search algorithms and their variants, tailored for test suite generation. Furthermore, we investigate and demonstrate how to learn specific conditions, based on image characteristics (e.g., head posture and skin color), that lead to severe mispredictions. Such conditions serve as a basis for risk analysis or DNN retraining., to appear in ISSTA 2021

Function-as-a-Service (FaaS) has raised a growing interest in how to "tame" serverless to enable domain-specific use cases such as data-intensive applications and machine learning (ML), to name a few. Recently, several systems have been implemented for training ML models. Certainly, these research articles are significant steps in the correct direction. However, they do not completely answer the nagging question of when serverless ML training can be more cost-effective compared to traditional "serverful" computing. To help in this task, we propose MLLess, a FaaS-based ML training prototype built atop IBM Cloud Functions. To boost cost-efficiency, MLLess implements two key optimizations: a significance filter and a scale-in auto-tuner, and leverages them to specialize model training to the FaaS model. Our results certify that MLLess can be 15X faster than serverful ML systems [24] at a lower cost for ML models (such as sparse logistic regression and matrix factorization) that exhibit fast convergence.

Over 100 fatalities and more than 8000 injuries are reported on average every day in the US caused by motor vehicle accidents. In order to provide drivers a safer travel plan, we present a machine learning powered risk profiler for road segments using geo-spatial data. We built an end-to-end pipeline to extract static road features from map data and combined them with other data such as weather and traffic patterns. Our approach proposes novel methods for data pre-processing and feature engineering using statistical and clustering methods. Our model achieves significant performance improvement for risk prediction using hyper-parameter optimization (HPO) and the open source AutoGluon library to optimize the ML model. Finally, an enduser visualization interface is developed in the form of interactive maps. The results indicate 31% improvement in model performance compared to baseline when model is applied to a new geo location. We tested this approach on six major cities in the US. The findings of this research will provide users a tool to quantitatively assess accident risk at road segment level.

Attention to the environment and its problems has undergone unprecedented growth in recent years [...]

Due to the increasingly growing demand for user identification on cell phones, PCs, laptops, and so on, face anti-spoofing has risen to significance and is an active research area in academia and industry. The detection of the real face then recognize it present an important challenge regarding the techniques that can be used to spoof any recognition system like masks, printed photos. This paper we present an anti-spoofing face method to solve the real-world scenario that learns the target domain classifier based on samples used for training in a particular source domain. Specifically, with the conventional regression CNN, the Spatial/Channel-wise Attention Modules were introduced. Two modules, namely the Spatial-wise Attention Module and the Channel-wise Attention Module, were used at spatial and channel levels to improve local features and ignore the irrelevant features. Extensive experiments on current collections with benchmarks datasets verifies that the recommended solution will significantly benefit from the two modules and better generalization capability by providing significantly improved results in anti-spoofing.

Drowsiness can be dangerous when performing tasks that require constant attention, such as driving a vehicle. Sleepiness is correlated with a variety of physiological variables, such as eye closing, head movements, pulse rate, eye twitch rate, etc. Also, the yawn can be considered as an accurate indicator of drowsiness and fatigue. Yawning detection is very important for the safety purpose of drivers as it will let the driver know if he/she is getting drowsy. Driving at that moment may not be safe. Several automatic yawning detection techniques have been developed for driver's drowsiness monitoring system. Nevertheless, correctly detecting the yawning of the driver and predicting exhaustion in real-time situations is still a crucial challenge. In this paper, we will be reviewing various existing machine learning approaches for driver's yawning detection. In previous approaches, various classical machine learning algorithms such as viola-Jones, contour activation algorithm and SVM have been used for yawning detection, but these approaches failed to predict yawning in realtime situations. Using Deep learning techniques, we can make a real-time yawn detection system with high accuracy. We find that some precious Deep learning algorithms like CNN, RNN, LSTM, Bi-LSTM can detect the patterns with high accuracy. After the comparison of various algorithms and techniques, we find that with the help of Deep learning algorithms the yawning can be detected in real time with high accuracy.

Human recogntion technologies are gaining significant research attention, where the model can be trained to be more precise to recognize the poses performed by objects. Activity identification is a kind of problem, which needs more research consideration and improvement. There is also an increasing need to detect different poses of objects. To tackle the issue, different sensors like Gyroscope and Accelerometer are required to classify the data in the form of images using machine learning algorithms like SVM and CNN. These approaches help us in implementing real-time applicaions such as health monitoring, tracking sports activity and security. The paper also discusses about its benefits, limitations and prominent approach for human activity recognition.

In order to automate the task of correcting handwritten subjective answers, we envision a system that reads such answers and grades them. In this project, we have created a mobile application to achieve this task. We have used the RAKE algorithm to extract key-phrases, which are then embedded using Word2vec model and compared using Word Mover's Distance. Our created model achieved almost human like evaluation accuracy. We have also provided accessibility features to the users with the aim of making this application a one-stop solution to automatic evaluation of handwritten subjective answers.

Sentiment analysis and opinion mining have developed significantly throughout the last decades. This study aims to assess, amongst many other aspects, people's feelings, opinions, and emotions of someone or something. This review's principal objective is to automatically assess the direction of the review and contrast this with the evaluation made by the reviewers. This will allow scientists to categorize and evaluate reviews cross-sectionally and encourage a scientific article's overall evaluation more critically. An EM-VC ensemble approach has been proposed for analyzing the reviews. This approach uses POS to achieve a syntactic sentence structure. With dictionaries, this syntactic structure enables the semantic orientation of the analysis via the scoring algorithm to be determined. To test the proposed approach's efficiency and performance about the baseline method, some tests have been performed using typical performance metrics like precision, accuracy, F1-score, and recall. The findings reveal that improvements are achieved in binary classification, ternary classification, & five-point classification compared to the existing HS-SVM method. Still, it provides a slight improvement in accuracy in the context of multiclass classification compared to others.

Bacteria identification has predominantly been conducted using specific bioreceptors such as antibodies or nucleic acid sequences. This approach may be inappropriate for environmental monitoring when the user does not know the target bacterial species and for screening complex water samples with many unknown bacterial species. In this work, we investigate the supervised machine learning of the bacteria-particle aggregation pattern induced by the peptide sets identified from the biofilm-bacteria interface. Each peptide is covalently conjugated to polystyrene particles and loaded together with bacterial suspensions onto paper microfluidic chips. Each peptide interacts with bacterial species to a different extent, leading to varying sizes of particle aggregation. This aggregation changes the surface tension and viscosity of the liquid flowing through the paper pores, altering the flow velocity at different extents. A smartphone camera captures this flow velocity without being affected by ambient and environmental conditions, towards a low-cost, rapid, and field-ready assay. A collection of such flow velocity data generates a unique fingerprinting profile for each bacterial species. Support vector machine is utilized to classify the species. At optimized conditions, the training model can predict the species at 93.3% accuracy out of five bacteria: Escherichia coli, Staphylococcus aureus, Salmonella Typhimurium, Enterococcus faecium, and Pseudomonas aeruginosa. Flow rates are monitored for less than 6 s and the sample-to-answer assay time is less than 10 min. The demonstrated method can open a new way of analyzing complex biological and environmental samples in a biomimetic manner with machine learning classification.

This study focuses on a recently introduced type of indicator measuring disruptiveness in science. Disruptive research diverges from current lines of research by opening up new lines. In the current study, we included the initially proposed indicator of this new type (Funk & Owen-Smith, 2017; Wu, Wang, & Evans, 2019) and several variants with DI1: DI5, DI1n, DI5n, and DEP. Since indicators should measure what they propose to measure, we investigated the convergent validity of the indicators. We used a list of milestone papers, selected and published by editors of Physical Review Letters, and investigated whether this human (experts)-based list is related to values of the several disruption indicators variants and – if so – which variants show the highest correlation with expert judgements. We used bivariate statistics, multiple regression models, and (coarsened) exact matching (CEM) to investigate the convergent validity of the indicators. The results show that the indicators correlate differently with the milestone paper assignments by the editors. It is not the initially proposed disruption index that performed best (DI1), but the variant DI5 which has been introduced by Bornmann, Devarakonda, Tekles, and Chacko (2020a). In the CEM analysis of this study, the DEP variant – introduced by Bu, Waltman, and Huang (in press) – also showed favorable results.

Background: The performance outcome model in qualitative technique analysis can determine the mechanical interactions between a performance outcome and the factors that yield such results in sports techniques. Very little attention has been received for badminton forehand shots for such model work, considering the significance of this technical skill as fundamental to play badminton and as important offensive shots. Objective: This study proposes a performance outcome model that associates performance criteria and relevant mechanical variables in the badminton forehand shot technique. Methods: Literature review provided the basis of model development. The Literature research in this paper was conducted in the following databases; PubMed, ScienceDirect, Google Scholar Medline, Pedro, and Cinahl. An additional search (including relevant grey literature) was also done on the internet through ResearchGate. Relevant literature research related to the keywords such as biomechanics of badminton, badminton forehand shot, biomechanical analysis, badminton performance, racquet sports, performance indicators, technique analysis and technique models were included and reviewed. Results: The results managed to present a synthesis of the literature review and provided constructive discussions as a basis to propose a performance outcome model that illustrates mechanical interactions that contribute to badminton forehand and shot technique performance. Conclusions: This model manages to find mechanical relationships and allows for a better grasp of understanding the association between performance criteria and mechanics in the badminton forehand shot technique, which is bases on the kinetic chain principle through the body segmental coordination.

Machine learning methods are being successfully applied in various domains of human activity, including optics. Can they become a universal instrument capable of improving user aspect of photonic devices? Is their application a necessary element of such improvement? Answers to fundamental questions arising from application of machine learning methods in ultrashort-pulsed lasers are discussed. Future prospects and current fundamental limitations of such methods are analysed.

Motion information has been widely exploited for group activity recognition in sports video. However, in order to model and extract the various motion information between the adjacent frames, existing algorithms only use the coarse video‐level labels as supervision cues. This may lead to the ambiguity of extracted features and the omission of changing rules of motion patterns that are also important sports video recognition. In this paper, a latent label mining strategy for group activity recognition in basketball videos is proposed. The authors' novel strategy allows them to obtain the latent labels set for marking different frames in an unsupervised way, and build the frame‐level and video‐level representations with two separate levels of supervision signal. Firstly, the latent labels of motion patterns are digged using the unsupervised hierarchical clustering technique. The generated latent labels are then taken as the frame‐level supervision signal to train a deep CNN for the frame‐level features extraction. Lastly, the frame‐level features are fed into an LSTM network to build the spatio‐temporal representation for group activity recognition. Experimental results on the public NCAA dataset demonstrate that the proposed algorithm achieves state‐of‐the‐art performance.

Texts are not monolithic entities but rather coherent collections of micro illocutionary acts which help to convey a unitary message of content and purpose. Identifying such text segments is challenging because they require a fine-grained level of analysis even within a single sentence. At the same time, accessing them facilitates the analysis of the communicative functions of a text as well as the identification of relevant information. We propose an empirical framework for modelling micro illocutionary acts at clause level, that we call content types, grounded on linguistic theories of text types, in particular on the framework proposed by Werlich in 1976. We make available a newly annotated corpus of 279 documents (for a total of more than 180,000 tokens) belonging to different genres and temporal periods, based on a dedicated annotation scheme. We obtain an average Cohen’s kappa of 0.89 at token level. We achieve an average F1 score of 74.99% on the automatic classification of content types using a bi-LSTM model. Similar results are obtained on contemporary and historical documents, while performances on genres are more varied. This work promotes a discourse-oriented approach to information extraction and cross-fertilisation across disciplines through a computationally-aided linguistic analysis.

Motivation Drug repositioning is an attractive alternative to de novo drug discovery due to reduced time and costs to bring drugs to market. Computational repositioning methods, particularly non-black-box methods that can account for and predict a drug’s mechanism, may provide great benefit for directing future development. By tuning both data and algorithm to utilize relationships important to drug mechanisms, a computational repositioning algorithm can be trained to both predict and explain mechanistically novel indications. Results In this work, we examined the 123 curated drug mechanism paths found in the drug mechanism database (DrugMechDB) and after identifying the most important relationships, we integrated 18 data sources to produce a heterogeneous knowledge graph, MechRepoNet, capable of capturing the information in these paths. We applied the Rephetio repurposing algorithm to MechRepoNet using only a subset of relationships known to be mechanistic in nature and found adequate predictive ability on an evaluation set with AUROC value of 0.83. The resulting repurposing model allowed us to prioritize paths in our knowledge graph to produce a predicted treatment mechanism. We found that DrugMechDB paths, when present in the network were rated highly among predicted mechanisms. We then demonstrated MechRepoNet’s ability to use mechanistic insight to identify a drug’s mechanistic target, with a mean reciprocal rank of 0.525 on a test set of known drug–target interactions. Finally, we walked through repurposing examples of the anti-cancer drug imatinib for use in the treatment of asthma, and metolazone for use in the treatment of osteoporosis, to demonstrate this method’s utility in providing mechanistic insight into repurposing predictions it provides. Availability and implementation The Python code to reproduce the entirety of this analysis is available at: https://github.com/SuLab/MechRepoNet (archived at https://doi.org/10.5281/zenodo.6456335). Supplementary information Supplementary data are available at Bioinformatics online.

Real-time execution of machine learning (ML) pipelines on radiology images is difficult due to limited computing resources in clinical environments, whereas running them in research clusters requires efficient data transfer capabilities. We developed Niffler, an open-source Digital Imaging and Communications in Medicine (DICOM) framework that enables ML and processing pipelines in research clusters by efficiently retrieving images from the hospitals’ PACS and extracting the metadata from the images. We deployed Niffler at our institution (Emory Healthcare, the largest healthcare network in the state of Georgia) and retrieved data from 715 scanners spanning 12 sites, up to 350 GB/day continuously in real-time as a DICOM data stream over the past 2 years. We also used Niffler to retrieve images bulk on-demand based on user-provided filters to facilitate several research projects. This paper presents the architecture and three such use cases of Niffler. First, we executed an IVC filter detection and segmentation pipeline on abdominal radiographs in real-time, which was able to classify 989 test images with an accuracy of 96.0%. Second, we applied the Niffler Metadata Extractor to understand the operational efficiency of individual MRI systems based on calculated metrics. We benchmarked the accuracy of the calculated exam time windows by comparing Niffler against the Clinical Data Warehouse (CDW). Niffler accurately identified the scanners’ examination timeframes and idling times, whereas CDW falsely depicted several exam overlaps due to human errors. Third, with metadata extracted from the images by Niffler, we identified scanners with misconfigured time and reconfigured five scanners. Our evaluations highlight how Niffler enables real-time ML and processing pipelines in a research cluster.

Picture fuzzy set is an efficient tool for dealing with uncertainty and vagueness, particularly in situations that require assimilation of more dimensions of linguistic assessment such as human voting, feature selection, etc. The correlation coefficient of picture fuzzy sets is a tool to determine the association of two picture fuzzy sets. It has several applications in various disciplines like science, engineering, and management. The prominent applications include decision-making, pattern recognition, clustering analysis, medical diagnosis, etc. In this paper, we introduce a new correlation coefficient for picture fuzzy sets with the justification of its advantages. This correlation coefficient is better than the existing correlation coefficients and other such measures in the picture fuzzy theory because it considers the picture fuzzy set as a whole and also expresses the nature (positive or negative) as well as the extent of association between two PFSs. By performing some comparative analysis based on the computation of correlation degree and linguistic hedges, we establish the effectiveness of the suggested correlation measure over some available correlation measures in a picture fuzzy environment. Further, in the context of pattern recognition, we examine the performance of the proposed correlation measure over some existing picture fuzzy correlation measures. Finally, we apply the suggested picture fuzzy correlation coefficient to a decision-making problem involving the selection of an appropriate COVID-19 mask.

The novel coronavirus infection (COVID-19) first appeared in Wuhan, China, in December 2019. COVID-19 declared as a global pandemic by the WHO was the most rapidly spreading disease all across the world. India, the second most populated nation in the world, is still fighting it, when coronavirus reached the stage where community transmission takes place at an exponential rate. Therefore, it is crucial to examine the future trends of COVID-19 in India and anticipate how it will affect economic and social growth in a short run. In this paper, a new deep learning framework using CNN and stacked Bi-GRU has been developed for predicting and analyzing the COVID-19 cases in India. The proposed model can predict the next 30 days' new positive cases, new death cases, recovery rate and containment and health index values with high accuracy. The proposed method is compared against Gaussian process regression (GPR) model on COVID-19 datasets. The experimental result shows that the proposed framework is highly reliable for COVID-19 prediction over the GPR model.

Motivation A phylogenetic network is a powerful model to represent entangled evolutionary histories with both divergent (speciation) and convergent (e.g. hybridization, reassortment, recombination) evolution. The standard approach to inference of hybridization networks is to (i) reconstruct rooted gene trees and (ii) leverage gene tree discordance for network inference. Recently, we introduced a method called RF-Net for accurate inference of virus reassortment and hybridization networks from input gene trees in the presence of errors commonly found in phylogenetic trees. While RF-Net demonstrated the ability to accurately infer networks with up to four reticulations from erroneous input gene trees, its application was limited by the number of reticulations it could handle in a reasonable amount of time. This limitation is particularly restrictive in the inference of the evolutionary history of segmented RNA viruses such as influenza A virus (IAV), where reassortment is one of the major mechanisms shaping the evolution of these pathogens. Results Here, we expand the functionality of RF-Net that makes it significantly more applicable in practice. Crucially, we introduce a fast extension to RF-Net, called Fast-RF-Net, that can handle large numbers of reticulations without sacrificing accuracy. In addition, we develop automatic stopping criteria to select the appropriate number of reticulations heuristically and implement a feature for RF-Net to output error-corrected input gene trees. We then conduct a comprehensive study of the original method and its novel extensions and confirm their efficacy in practice using extensive simulation and empirical IAV evolutionary analyses. Availability and implementation RF-Net 2 is available at https://github.com/flu-crew/rf-net-2. Supplementary information Supplementary data are available at Bioinformatics online.