OpenRaiser/Intern-Atlas huggingface dataset:
Alleviating Vulnerabilities of the Possible Outbreaks of Measles: A Data Trend Analysis and Prediction of Possible Cases
Venue: arXiv cs.CY 2021
Year: 2021

Measles is considered as a highly contagious disease that leads to serious complications around the world. Thus, the paper determined the trend and the five-year forecasted data of the Measles in the Philippines. This study utilized the time series data for trend analysis and data forecasting using the ARIMA model to visualize the measles cases. Figures for the time-series and forecasted results are individually presented with the use of GRETL software. Results showed that there was an increasing pattern of the disease from 2016 to 2019. However, there was a decreasing pattern of its occurrence in the next five years based on the five-year forecast. Nevertheless, with the results of the study, there is still a need to improve the different intervention plans of the authority in alleviating the occurrence of the disease though it yielded a decreasing pattern in the future since it is evident that the figure of the forecasted data is still approximately 15,000 and above.
Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition
Venue: arXiv cs.DC 2021
Year: 2021

This paper revisits two classical distributed problems in anonymous networks, namely spanning tree construction and topology recognition, from the point of view of graph covering theory. For both problems, we characterize necessary and sufficient conditions on the communication graph in terms of directed symmetric coverings. These characterizations answer along-standing open question posed by Yamashita and Kameda [YK96], and shed new light on the connection between coverings and the concepts of views and quotient graphs developed by the same authors. Characterizing conditions in terms of coverings is significant because it connects the field with a vast body of classical literature in graph theory and algebraic topology. In particular, it gives access to powerful tools such as Reidemeister's theorem and Mazurkiewicz's algorithm. Combined together, these tools allow us to present elegant proofs of otherwise intricate results, and their constructive nature makes them effectively usable in the algorithms. This paper also gives us the opportunity to present the field of covering theory in a pedagogical way, with a focus on the two aforementioned tools, whose potential impact goes beyond the specific problems considered in this work.
Dataset on Bi- and Multi-Nucleated Tumor Cells in Canine Cutaneous Mast Cell Tumors
Venue: arXiv cs.CV 2021
Year: 2021

Tumor cells with two nuclei (binucleated cells, BiNC) or more nuclei (multinucleated cells, MuNC) indicate an increased amount of cellular genetic material which is thought to facilitate oncogenesis, tumor progression and treatment resistance. In canine cutaneous mast cell tumors (ccMCT), binucleation and multinucleation are parameters used in cytologic and histologic grading schemes (respectively) which correlate with poor patient outcome. For this study, we created the first open source data-set with 19,983 annotations of BiNC and 1,416 annotations of MuNC in 32 histological whole slide images of ccMCT. Labels were created by a pathologist and an algorithmic-aided labeling approach with expert review of each generated candidate. A state-of-the-art deep learning-based model yielded an $F_1$ score of 0.675 for BiNC and 0.623 for MuNC on 11 test whole slide images. In regions of interest ($2.37 mm^2$) extracted from these test images, 6 pathologists had an object detection performance between 0.270 - 0.526 for BiNC and 0.316 - 0.622 for MuNC, while our model archived an $F_1$ score of 0.667 for BiNC and 0.685 for MuNC. This open dataset can facilitate development of automated image analysis for this task and may thereby help to promote standardization of this facet of histologic tumor prognostication.
Learning Sign-Constrained Support Vector Machines
Venue: arXiv cs.LG 2021
Year: 2021

Domain knowledge is useful to improve the generalization performance of learning machines. Sign constraints are a handy representation to combine domain knowledge with learning machine. In this paper, we consider constraining the signs of the weight coefficients in learning the linear support vector machine, and develop two optimization algorithms for minimizing the empirical risk under the sign constraints. One of the two algorithms is based on the projected gradient method, in which each iteration of the projected gradient method takes $O(nd)$ computational cost and the sublinear convergence of the objective error is guaranteed. The second algorithm is based on the Frank-Wolfe method that also converges sublinearly and possesses a clear termination criterion. We show that each iteration of the Frank-Wolfe also requires $O(nd)$ cost. Furthermore, we derive the explicit expression for the minimal iteration number to ensure an $ε$-accurate solution by analyzing the curvature of the objective function. Finally, we empirically demonstrate that the sign constraints are a promising technique when similarities to the training examples compose the feature vector.
SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation
Venue: arXiv cs.DS 2021
Year: 2021

We develop a general framework to significantly reduce the degree of sum-of-squares proofs by introducing new variables. To illustrate the power of this framework, we use it to speed up previous algorithms based on sum-of-squares for two important estimation problems, clustering and robust moment estimation. The resulting algorithms offer the same statistical guarantees as the previous best algorithms but have significantly faster running times. Roughly speaking, given a sample of $n$ points in dimension $d$, our algorithms can exploit order-$\ell$ moments in time $d^{O(\ell)}\cdot n^{O(1)}$, whereas a naive implementation requires time $(d\cdot n)^{O(\ell)}$. Since for the aforementioned applications, the typical sample size is $d^{Θ(\ell)}$, our framework improves running times from $d^{O(\ell^2)}$ to $d^{O(\ell)}$.
Handling Mobility in Low-Power Wide-Area Network
Venue: arXiv cs.NI 2021
Year: 2021

Despite the proliferation of mobile devices in various wide-area Internet of Things applications (e.g., smart city, smart farming), current Low-Power Wide-Area Networks (LPWANs) are not designed to effectively support mobile nodes. In this paper, we propose to handle mobility in SNOW (Sensor Network Over White spaces), an LPWAN that operates in the TV white spaces. SNOW supports massive concurrent communication between a base station (BS) and numerous low-power nodes through a distributed implementation of OFDM. In SNOW, inter-carrier interference (ICI) is more pronounced under mobility due to its OFDM based design. Geospatial variation of white spaces also raises challenges in both intra- and inter-network mobility as the low-power nodes are not equipped to determine white spaces. To handle mobility impacts on ICI, we propose a dynamic carrier frequency offset estimation and compensation technique which takes into account Doppler shifts without requiring to know the speed of the nodes. We also propose to circumvent the mobility impacts on geospatial variation of white space through a mobility-aware spectrum assignment to nodes. To enable mobility of the nodes across different SNOWs, we propose an efficient handoff management through a fast and energy-efficient BS discovery and quick association with the BS by combining time and frequency domain energy-sensing. Experiments through SNOW deployments in a large metropolitan city and indoors show that our proposed approaches enable mobility across multiple different SNOWs and provide robustness in terms of reliability, latency, and energy consumption under mobility.
Interpersonal distance in VR: reactions of older adults to the presence of a virtual agent
Venue: arXiv cs.HC 2021
Year: 2021

The rapid development of virtual reality technology has increased its availability and, consequently, increased the number of its possible applications. The interest in the new medium has grown due to the entertainment industry (games, VR experiences and movies). The number of freely available training and therapeutic applications is also increasing. Contrary to popular opinion, new technologies are also adopted by older adults. Creating virtual environments tailored to the needs and capabilities of older adults requires intense research on the behaviour of these participants in the most common situations, towards commonly used elements of the virtual environment, in typical sceneries. Comfortable immersion in a virtual environment is key to achieving the impression of presence. Presence is, in turn, necessary to obtain appropriate training, persuasive and therapeutic effects. A virtual agent (a humanoid representation of an algorithm or artificial intelligence) is often an element of the virtual environment interface. Maintaining an appropriate distance to the agent is, therefore, a key parameter for the creator of the VR experience. Older (65+) participants maintain greater distance towards an agent (a young white male) than younger ones (25-35). It may be caused by differences in the level of arousal, but also cultural norms. As a consequence, VR developers are advised to use algorithms that maintain the agent at the appropriate distance, depending on the user's age.
Monocular Depth Estimation for Soft Visuotactile Sensors
Venue: arXiv cs.RO 2021
Year: 2021

Fluid-filled soft visuotactile sensors such as the Soft-bubbles alleviate key challenges for robust manipulation, as they enable reliable grasps along with the ability to obtain high-resolution sensory feedback on contact geometry and forces. Although they are simple in construction, their utility has been limited due to size constraints introduced by enclosed custom IR/depth imaging sensors to directly measure surface deformations. Towards mitigating this limitation, we investigate the application of state-of-the-art monocular depth estimation to infer dense internal (tactile) depth maps directly from the internal single small IR imaging sensor. Through real-world experiments, we show that deep networks typically used for long-range depth estimation (1-100m) can be effectively trained for precise predictions at a much shorter range (1-100mm) inside a mostly textureless deformable fluid-filled sensor. We propose a simple supervised learning process to train an object-agnostic network requiring less than 10 random poses in contact for less than 10 seconds for a small set of diverse objects (mug, wine glass, box, and fingers in our experiments). We show that our approach is sample-efficient, accurate, and generalizes across different objects and sensor configurations unseen at training time. Finally, we discuss the implications of our approach for the design of soft visuotactile sensors and grippers.
What social media told about us in the time of COVID-19: a scoping review
Venue: arXiv cs.SI 2021
Year: 2021

With the onset of COVID-19 pandemic, social media has rapidly become a crucial communication tool for information generation, dissemination, and consumption. In this scoping review, we selected and examined peer-reviewed empirical studies relating to COVID-19 and social media during the first outbreak starting in November 2019 until May 2020. From an analysis of 81 studies, we identified five overarching public health themes concerning the role of online social platforms and COVID-19. These themes focused on: (i) surveying public attitudes, (ii) identifying infodemics, (iii) assessing mental health, (iv) detecting or predicting COVID-19 cases, (v) analyzing government responses to the pandemic, and (vi) evaluating quality of health information in prevention education videos. Furthermore, our review highlights the paucity of studies on the application of machine learning on social media data related to COVID-19 and a lack of studies documenting real-time surveillance developed with social media data on COVID-19. For COVID-19, social media can play a crucial role in disseminating health information as well as tackling infodemics and misinformation.
COVID-19 Tests Gone Rogue: Privacy, Efficacy, Mismanagement and Misunderstandings
Venue: arXiv cs.CY 2021
Year: 2021

COVID-19 testing, the cornerstone for effective screening and identification of COVID-19 cases, remains paramount as an intervention tool to curb the spread of COVID-19 both at local and national levels. However, the speed at which the pandemic struck and the response was rolled out, the widespread impact on healthcare infrastructure, the lack of sufficient preparation within the public health system, and the complexity of the crisis led to utter confusion among test-takers. Invasion of privacy remains a crucial concern. The user experience of test takers remains low. User friction affects user behavior and discourages participation in testing programs. Test efficacy has been overstated. Test results are poorly understood resulting in inappropriate follow-up recommendations. Herein, we review the current landscape of COVID-19 testing, identify four key challenges, and discuss the consequences of the failure to address these challenges. The current infrastructure around testing and information propagation is highly privacy-invasive and does not leverage scalable digital components. In this work, we discuss challenges complicating the existing covid-19 testing ecosystem and highlight the need to improve the testing experience for the user and reduce privacy invasions. Digital tools will play a critical role in resolving these challenges.
Online Multivalid Learning: Means, Moments, and Prediction Intervals
Venue: arXiv cs.LG 2021
Year: 2021

We present a general, efficient technique for providing contextual predictions that are "multivalid" in various senses, against an online sequence of adversarially chosen examples $(x,y)$. This means that the resulting estimates correctly predict various statistics of the labels $y$ not just marginally -- as averaged over the sequence of examples -- but also conditionally on $x \in G$ for any $G$ belonging to an arbitrary intersecting collection of groups $\mathcal{G}$. We provide three instantiations of this framework. The first is mean prediction, which corresponds to an online algorithm satisfying the notion of multicalibration from Hebert-Johnson et al. The second is variance and higher moment prediction, which corresponds to an online algorithm satisfying the notion of mean-conditioned moment multicalibration from Jung et al. Finally, we define a new notion of prediction interval multivalidity, and give an algorithm for finding prediction intervals which satisfy it. Because our algorithms handle adversarially chosen examples, they can equally well be used to predict statistics of the residuals of arbitrary point prediction methods, giving rise to very general techniques for quantifying the uncertainty of predictions of black box algorithms, even in an online adversarial setting. When instantiated for prediction intervals, this solves a similar problem as conformal prediction, but in an adversarial environment and with multivalidity guarantees stronger than simple marginal coverage guarantees.
Designing Actively Secure, Highly Available Industrial Automation Applications
Venue: arXiv cs.CR 2021
Year: 2021

Programmable Logic Controllers (PLCs) execute critical control software that drives Industrial Automation and Control Systems (IACS). PLCs can become easy targets for cyber-adversaries as they are resource-constrained and are usually built using legacy, less-capable security measures. Security attacks can significantly affect system availability, which is an essential requirement for IACS. We propose a method to make PLC applications more security-aware. Based on the well-known IEC 61499 function blocks standard for developing IACS software, our method allows designers to annotate critical parts of an application during design time. On deployment, these parts of the application are automatically secured using appropriate security mechanisms to detect and prevent attacks. We present a summary of availability attacks on distributed IACS applications that can be mitigated by our proposed method. Security mechanisms are achieved using IEC 61499 Service-Interface Function Blocks (SIFBs) embedding Intrusion Detection and Prevention System (IDPS), added to the application at compile time. This method is more amenable to providing active security protection from attacks on previously unknown (zero-day) vulnerabilities. We test our solution on an IEC 61499 application executing on Wago PFC200 PLCs. Experiments show that we can successfully log and prevent attacks at the application level as well as help the application to gracefully degrade into safe mode, subsequently improving availability.
Multi-Stage Residual Hiding for Image-into-Audio Steganography
Venue: arXiv cs.CV 2021
Year: 2021

The widespread application of audio communication technologies has speeded up audio data flowing across the Internet, which made it a popular carrier for covert communication. In this paper, we present a cross-modal steganography method for hiding image content into audio carriers while preserving the perceptual fidelity of the cover audio. In our framework, two multi-stage networks are designed: the first network encodes the decreasing multilevel residual errors inside different audio subsequences with the corresponding stage sub-networks, while the second network decodes the residual errors from the modified carrier with the corresponding stage sub-networks to produce the final revealed results. The multi-stage design of proposed framework not only make the controlling of payload capacity more flexible, but also make hiding easier because of the gradual sparse characteristic of residual errors. Qualitative experiments suggest that modifications to the carrier are unnoticeable by human listeners and that the decoded images are highly intelligible.
3D Convolutional Selective Autoencoder For Instability Detection in Combustion Systems
Venue: arXiv cs.LG 2021
Year: 2021

While analytical solutions of critical (phase) transitions in physical systems are abundant for simple nonlinear systems, such analysis remains intractable for real-life dynamical systems. A key example of such a physical system is thermoacoustic instability in combustion, where prediction or early detection of an onset of instability is a hard technical challenge, which needs to be addressed to build safer and more energy-efficient gas turbine engines powering aerospace and energy industries. The instabilities arising in combustion chambers of engines are mathematically too complex to model. To address this issue in a data-driven manner instead, we propose a novel deep learning architecture called 3D convolutional selective autoencoder (3D-CSAE) to detect the evolution of self-excited oscillations using spatiotemporal data, i.e., hi-speed videos taken from a swirl-stabilized combustor (laboratory surrogate of gas turbine engine combustor). 3D-CSAE consists of filters to learn, in a hierarchical fashion, the complex visual and dynamic features related to combustion instability. We train the 3D-CSAE on frames of videos obtained from a limited set of operating conditions. We select the 3D-CSAE hyper-parameters that are effective for characterizing hierarchical and multiscale instability structure evolution by utilizing the dynamic information available in the video. The proposed model clearly shows performance improvement in detecting the precursors of instability. The machine learning-driven results are verified with physics-based off-line measures. Advanced active control mechanisms can directly leverage the proposed online detection capability of 3D-CSAE to mitigate the adverse effects of combustion instabilities on the engine operating under various stringent requirements and conditions.
Shape Control of Elastic Objects Based on Implicit Sensorimotor Models and Data-Driven Geometric Features
Venue: arXiv cs.RO 2021
Year: 2021

This paper proposes a general approach to design automatic controls to manipulate elastic objects into desired shapes. The object's geometric model is defined as the shape feature based on the specific task to globally describe the deformation. Raw visual feedback data is processed using classic regression methods to identify parameters of data-driven geometric models in real-time. Our proposed method is able to analytically compute a pose-shape Jacobian matrix based on implicit functions. This model is then used to derive a shape servoing controller. To validate the proposed method, we report a detailed experimental study with robotic manipulators deforming an elastic rod.
Connecting The Dots To Combat Collective Fraud
Venue: arXiv cs.CR 2021
Year: 2021

Modern fraudsters write malicious programs to coordinate a group of accounts to commit collective fraud for illegal profits in online platforms. These programs have access to a set of finite resources - a set of IPs, devices, and accounts etc. and sometime manipulate fake accounts to collaboratively attack the target system. Inspired by these observations, we share our experience in building two real-time risk control systems to detect collective fraud. We show that with TigerGraph, a powerful graph database, and its innovative query language - GSQL, data scientists and fraud experts can conveniently implement and deploy an end-to-end risk control system as a graph database application.
Exploring Semi-Supervised Learning for Predicting Listener Backchannels
Venue: arXiv cs.HC 2021
Year: 2021

Developing human-like conversational agents is a prime area in HCI research and subsumes many tasks. Predicting listener backchannels is one such actively-researched task. While many studies have used different approaches for backchannel prediction, they all have depended on manual annotations for a large dataset. This is a bottleneck impacting the scalability of development. To this end, we propose using semi-supervised techniques to automate the process of identifying backchannels, thereby easing the annotation process. To analyze our identification module's feasibility, we compared the backchannel prediction models trained on (a) manually-annotated and (b) semi-supervised labels. Quantitative analysis revealed that the proposed semi-supervised approach could attain 95% of the former's performance. Our user-study findings revealed that almost 60% of the participants found the backchannel responses predicted by the proposed model more natural. Finally, we also analyzed the impact of personality on the type of backchannel signals and validated our findings in the user-study.
Multichannel CRNN for Speaker Counting: an Analysis of Performance
Venue: arXiv cs.SD 2021
Year: 2021

Speaker counting is the task of estimating the number of people that are simultaneously speaking in an audio recording. For several audio processing tasks such as speaker diarization, separation, localization and tracking, knowing the number of speakers at each timestep is a prerequisite, or at least it can be a strong advantage, in addition to enabling a low latency processing. In a previous work, we addressed the speaker counting problem with a multichannel convolutional recurrent neural network which produces an estimation at a short-term frame resolution. In this work, we show that, for a given frame, there is an optimal position in the input sequence for best prediction accuracy. We empirically demonstrate the link between that optimal position, the length of the input sequence and the size of the convolutional filters.