OpenRaiser/Intern-Atlas huggingface dataset:
Drive Safe: Cognitive-Behavioral Mining for Intelligent Transportation Cyber-Physical System
Venue: arXiv cs.HC 2020
Year: 2020

This paper presents a cognitive behavioral-based driver mood repairment platform in intelligent transportation cyber-physical systems (IT-CPS) for road safety. In particular, we propose a driving safety platform for distracted drivers, namely \emph{drive safe}, in IT-CPS. The proposed platform recognizes the distracting activities of the drivers as well as their emotions for mood repair. Further, we develop a prototype of the proposed drive safe platform to establish proof-of-concept (PoC) for the road safety in IT-CPS. In the developed driving safety platform, we employ five AI and statistical-based models to infer a vehicle driver's cognitive-behavioral mining to ensure safe driving during the drive. Especially, capsule network (CN), maximum likelihood (ML), convolutional neural network (CNN), Apriori algorithm, and Bayesian network (BN) are deployed for driver activity recognition, environmental feature extraction, mood recognition, sequential pattern mining, and content recommendation for affective mood repairment of the driver, respectively. Besides, we develop a communication module to interact with the systems in IT-CPS asynchronously. Thus, the developed drive safe PoC can guide the vehicle drivers when they are distracted from driving due to the cognitive-behavioral factors. Finally, we have performed a qualitative evaluation to measure the usability and effectiveness of the developed drive safe platform. We observe that the P-value is 0.0041 (i.e., < 0.05) in the ANOVA test. Moreover, the confidence interval analysis also shows significant gains in prevalence value which is around 0.93 for a 95% confidence level. The aforementioned statistical results indicate high reliability in terms of driver's safety and mental state.
Tearing Down the Memory Wall
Venue: arXiv cs.AR 2020
Year: 2020

We present a vision for the Erudite architecture that redefines the compute and memory abstractions such that memory bandwidth and capacity become first-class citizens along with compute throughput. In this architecture, we envision coupling a high-density, massively parallel memory technology like Flash with programmable near-data accelerators, like the streaming multiprocessors in modern GPUs. Each accelerator has a local pool of storage-class memory that it can access at high throughput by initiating very large numbers of overlapping requests that help to tolerate long access latency. The accelerators can also communicate with each other and remote memory through a high-throughput low-latency interconnect. As a result, systems based on the Erudite architecture scale compute and memory bandwidth at the same rate, tearing down the notorious memory wall that has plagued computer architecture for generations. In this paper, we present the motivation, rationale, design, benefit, and research challenges for Erudite.
IoT service slicing and task offloading for edge computing
Venue: arXiv cs.NI 2020
Year: 2020

With the advancement of IoT technology, various domains such as smart factories, smart cities and smart cars use the IoT to provide value-added services. In addition, technologies such as MEC and network slicing provide another opportunity for the IoT to support more advanced and real-time services that could not have been previously supported. However, the simple integration of such technologies into the IoT does not take full advantage of MEC and network slicing or the reduction of latency and traffic prioritization, respectively. Therefore, there is a strong need for an efficient integration mechanism for IoT platforms to maximize the benefit of using such technologies. In this article, we introduce a novel architectural framework that enables the virtualization of an IoT platform with minimum functions to support specific IoT services and host the instance in an edge node, close to the end-user. As the instance provides its service at the edge node where the MEC node and network slice are located, the traffic for the end-user does not need to traverse back to the cloud. This architecture guarantees not only low latency but also efficient management of IoT services at the edge node. To show the feasibility of the proposed architecture, we conduct an experimental evaluation by comparing the transmission time of both IoT services running on the central cloud and those using sliced IoT functions in the edge gateway. The results show that the proposed architecture provides two times faster transmission time than that from the conventional cloud-based IoT platform.
On the Power Leakage Problem in Millimeter-Wave Massive MIMO with Lens Antenna Arrays
Venue: arXiv cs.IT 2020
Year: 2020

The emerging millimeter-wave (mmWave) massive multiple-input multiple-output (MIMO) with lens antenna arrays, which is also known as "beamspace MIMO", can effectively reduce the required number of power-hungry radio frequency (RF) chains. Therefore, it has been considered as a promising technique for the upcoming 5G communications and beyond. However, most current studies on beamspace MIMO have not taken into account the important power leakage problem in beamspace channels, which possibly leads to a significant degradation in the signal-to-noise ratio (SNR) and the system sum-rate. To this end, we propose a beam aligning precoding method to handle the power leakage problem in this paper. Firstly, a phase shifter network (PSN) structure is proposed, which enables each RF chain in beamspace MIMO to select multiple beams to collect the leakage power. Then, a rotation-based precoding algorithm is designed based on the proposed PSN structure, which aligns the channel gains of the selected beams towards the same direction for maximizing the received SNR at each user. Furthermore, we reveal some system design insights by analyzing the sum-rate and energy efficiency (EE) of the proposed beam aligning precoding method. In simulations, the proposed approach is found to achieve the near-optimal sum-rate performance compared with the ideal case of no power leakage, and obtains a higher EE than the existing schemes with either a linear or planar array.
Strawberry Detection using Mixed Training on Simulated and Real Data
Venue: arXiv cs.CV 2020
Year: 2020

This paper demonstrates how simulated images can be useful for object detection tasks in the agricultural sector, where labeled data can be scarce and costly to collect. We consider training on mixed datasets with real and simulated data for strawberry detection in real images. Our results show that using the real dataset augmented by the simulated dataset resulted in slightly higher accuracy.
A completely annotated whole slide image dataset of canine breast cancer to aid human breast cancer research
Venue: arXiv cs.CV 2020
Year: 2020

Canine mammary carcinoma (CMC) has been used as a model to investigate the pathogenesis of human breast cancer and the same grading scheme is commonly used to assess tumor malignancy in both. One key component of this grading scheme is the density of mitotic figures (MF). Current publicly available datasets on human breast cancer only provide annotations for small subsets of whole slide images (WSIs). We present a novel dataset of 21 WSIs of CMC completely annotated for MF. For this, a pathologist screened all WSIs for potential MF and structures with a similar appearance. A second expert blindly assigned labels, and for non-matching labels, a third expert assigned the final labels. Additionally, we used machine learning to identify previously undetected MF. Finally, we performed representation learning and two-dimensional projection to further increase the consistency of the annotations. Our dataset consists of 13,907 MF and 36,379 hard negatives. We achieved a mean F1-score of 0.791 on the test set and of up to 0.696 on a human breast cancer dataset.
A systematic literature review on machine learning applications for consumer sentiment analysis using online reviews
Venue: arXiv cs.HC 2020
Year: 2020

Consumer sentiment analysis is a recent fad for social media related applications such as healthcare, crime, finance, travel, and academics. Disentangling consumer perception to gain insight into the desired objective and reviews is significant. With the advancement of technology, a massive amount of social web-data increasing in terms of volume, subjectivity, and heterogeneity, becomes challenging to process it manually. Machine learning techniques have been utilized to handle this difficulty in real-life applications. This paper presents the study to find out the usefulness, scope, and applicability of this alliance of Machine Learning techniques for consumer sentiment analysis on online reviews in the domain of hospitality and tourism. We have shown a systematic literature review to compare, analyze, explore, and understand the attempts and direction in a proper way to find research gaps to illustrating the future scope of this pairing. This work is contributing to the extant literature in two ways; firstly, the primary objective is to read and analyze the use of machine learning techniques for consumer sentiment analysis on online reviews in the domain of hospitality and tourism. Secondly, in this work, we presented a systematic approach to identify, collect observational evidence, results from the analysis, and assimilate observations of all related high-quality research to address particular research queries referring to the described research area.
A Strategic Routing Framework and Algorithms for Computing Alternative Paths
Venue: arXiv cs.DS 2020
Year: 2020

Traditional navigation services find the fastest route for a single driver. Though always using the fastest route seems desirable for every individual, selfish behavior can have undesirable effects such as higher energy consumption and avoidable congestion, even leading to higher overall and individual travel times. In contrast, strategic routing aims at optimizing the traffic for all agents regarding a global optimization goal. We introduce a framework to formalize real-world strategic routing scenarios as algorithmic problems and study one of them, which we call Single Alternative Path (SAP), in detail. There, we are given an original route between a single origin--destination pair. The goal is to suggest an alternative route to all agents that optimizes the overall travel time under the assumption that the agents distribute among both routes according to a psychological model, for which we introduce the concept of Pareto-conformity. We show that the SAP problem is NP-complete, even for such models. Nonetheless, assuming Pareto-conformity, we give multiple algorithms for different variants of SAP, using multi-criteria shortest path algorithms as subroutines. Moreover, we prove that several natural models are in fact Pareto-conform. The implementation of our algorithms serves as a proof of concept, showing that SAP can be solved in reasonable time even though the algorithms have exponential running time in the worst case.
An Incentive-Compatible Smart Contract for Decentralized Commerce
Venue: arXiv cs.GT 2020
Year: 2020

We propose a smart contract that allows two mutually distrusting parties to transact any non-digital good or service by deploying a smart contract on a blockchain to act as escrow. The contract settles disputes by letting parties wager that they can convince an arbiter that they were the honest party. We analyse the contract as an extensive-form game and prove that the honest strategy is secure in a strong game-theoretic sense if and only if the arbiter is biased in favor of honest parties. By relaxing the security notion, we can replace the arbiter by a random coin toss. Finally, we show how to generalize the contract to multiparty transactions in a way that amortizes the transaction fees.
An Efficient Algorithm for Finding Sets of Optimal Routes
Venue: arXiv cs.NI 2020
Year: 2020

In several important routing contexts it is required to identify a set of routes, each of which optimizes a different criterion. For instance, in the context of vehicle routing, one route would minimize the total distance traveled, while other routes would also consider the total travel time or the total incurred cost, or combinations thereof. In general, providing such a set of diverse routes is obtained by finding optimal routes with respect to different sets of weights on the network edges. This can be simply achieved by consecutively executing a standard shortest path algorithm. However, in the case of a large number of weight sets, this may require an excessively large number of executions of such an algorithm, thus incurring a prohibitively large running time. We indicate that, quite often, the different edge weights reflect different combinations of some "raw" performance metrics (e.g., delay, cost). In such cases, there is an inherent dependency among the different weights of the same edge. This may well result in some similarity among the shortest routes, each of which being optimal with respect to a specific set of weights. In this study, we aim to exploit such similarity in order to improve the performance of the solution scheme. Specifically, we contemplate edge weights that are obtained through different linear combinations of some (``raw'') edge performance metrics. We establish and validate a novel algorithm that efficiently computes a shortest path for each set of edge weights. We demonstrate that, under reasonable assumptions, the algorithm significantly outperforms the standard approach. Similarly to the standard approach, the algorithm iteratively searches for routes, one per set of edge weights; however, instead of executing each iteration independently, it reduces the average running time by skillfully sharing information among the iterations.
CRNNs for Urban Sound Tagging with spatiotemporal context
Venue: arXiv cs.SD 2020
Year: 2020

This paper describes CRNNs we used to participate in Task 5 of the DCASE 2020 challenge. This task focuses on hierarchical multilabel urban sound tagging with spatiotemporal context. The code is available on our GitHub repository at https://github.com/multitel-ai/urban-sound-tagging.
INSIDE: Steering Spatial Attention with Non-Imaging Information in CNNs
Venue: arXiv cs.CV 2020
Year: 2020

We consider the problem of integrating non-imaging information into segmentation networks to improve performance. Conditioning layers such as FiLM provide the means to selectively amplify or suppress the contribution of different feature maps in a linear fashion. However, spatial dependency is difficult to learn within a convolutional paradigm. In this paper, we propose a mechanism to allow for spatial localisation conditioned on non-imaging information, using a feature-wise attention mechanism comprising a differentiable parametrised function (e.g. Gaussian), prior to applying the feature-wise modulation. We name our method INstance modulation with SpatIal DEpendency (INSIDE). The conditioning information might comprise any factors that relate to spatial or spatio-temporal information such as lesion location, size, and cardiac cycle phase. Our method can be trained end-to-end and does not require additional supervision. We evaluate the method on two datasets: a new CLEVR-Seg dataset where we segment objects based on location, and the ACDC dataset conditioned on cardiac phase and slice location within the volume. Code and the CLEVR-Seg dataset are available at https://github.com/jacenkow/inside.
How To Evaluate Your Dialogue System: Probe Tasks as an Alternative for Token-level Evaluation Metrics
Venue: arXiv cs.CL 2020
Year: 2020

Though generative dialogue modeling is widely seen as a language modeling task, the task demands an agent to have a complex natural language understanding of its input text to carry a meaningful interaction with an user. The automatic metrics used evaluate the quality of the generated text as a proxy to the holistic interaction of the agent. Such metrics were earlier shown to not correlate with the human judgement. In this work, we observe that human evaluation of dialogue agents can be inconclusive due to the lack of sufficient information for appropriate evaluation. The automatic metrics are deterministic yet shallow and human evaluation can be relevant yet inconclusive. To bridge this gap in evaluation, we propose designing a set of probing tasks to evaluate dialogue models. The hand-crafted tasks are aimed at quantitatively evaluating a generative dialogue model's understanding beyond the token-level evaluation on the generated text. The probing tasks are deterministic like automatic metrics and requires human judgement in their designing; benefiting from the best of both worlds. With experiments on probe tasks we observe that, unlike RNN based architectures, transformer model may not be learning to comprehend the input text despite its generated text having higher overlap with the target text.
Implicit Multi-feature Learning for Dynamic Time Series Prediction of the Impact of Institutions
Venue: arXiv cs.SI 2020
Year: 2020

Predicting the impact of research institutions is an important tool for decision makers, such as resource allocation for funding bodies. Despite significant effort of adopting quantitative indicators to measure the impact of research institutions, little is known that how the impact of institutions evolves in time. Previous researches have focused on using the historical relevance scores of different institutions to predict potential future impact for these institutions. In this paper, we explore the factors that can drive the changes of the impact of institutions, finding that the impact of an institution, as measured by the number of the accepted papers of the institution, more is determined by the authors' influence of the institution. Geographic location of institution feature and state GDP can drive the changes of the impact of institutions. Identifying these features allows us to formulate a predictive model that integrates the effects of individual ability, location of institution, and state GDP. The model unveils the underlying factors driving the future impact of institutions, which can be used to accurately predict the future impact of institutions.
Social-Similarity-aware TCP with Collision Avoidance in Ad-hoc Social Networks
Venue: arXiv cs.NI 2020
Year: 2020

Ad-hoc Social Network (ASNET), which explores social connectivity between users of mobile devices, is becoming one of the most important forms of today's internet. In this context, maximum bandwidth utilization of intermediate nodes in resource scarce environments is one of the challenging tasks. Traditional Transport Control Protocol (TCP) uses the round trip time mechanism for sharing bandwidth resources between users. However, it does not explore socially-aware properties between nodes and cannot differentiate effectively between various types of packet losses in wireless networks. In this paper, a socially-aware congestion avoidance protocol, namely TIBIAS, which takes advantage of similarity matching social properties among intermediate nodes, is proposed to improve the resource efficiency of ASNETs. TIBIAS performs efficient data transfer over TCP. During the course of bandwidth resource allocation, it gives high priority for maximally matched interest similarity between different TCP connections on ASNET links. TIBIAS does not require any modification at lower layers or on receiver nodes. Experimental results show that TIBIAS performs better as compared against existing protocols, in terms of link utilization, unnecessary reduction of the congestion window, throughput and retransmission ratio.
Analysis of COVID-19 cases in India through Machine Learning: A Study of Intervention
Venue: arXiv cs.LG 2020
Year: 2020

To combat the coronavirus disease 2019 (COVID-19) pandemic, the world has vaccination, plasma therapy, herd immunity, and epidemiological interventions as few possible options. The COVID-19 vaccine development is underway and it may take a significant amount of time to develop the vaccine and after development, it will take time to vaccinate the entire population, and plasma therapy has some limitations. Herd immunity can be a plausible option to fight COVID-19 for small countries. But for a country with huge population like India, herd immunity is not a plausible option, because to acquire herd immunity approximately 67% of the population has to be recovered from COVID-19 infection, which will put an extra burden on medical system of the country and will result in a huge loss of human life. Thus epidemiological interventions (complete lockdown, partial lockdown, quarantine, isolation, social distancing, etc.) are some suitable strategies in India to slow down the COVID-19 spread until the vaccine development. In this work, we have suggested the SIR model with intervention, which incorporates the epidemiological interventions in the classical SIR model. To model the effect of the interventions, we have introduced \r{ho} as the intervention parameter. \r{ho} is a cumulative quantity which covers all type of intervention. We have also discussed the supervised machine learning approach to estimate the transmission rate (\b{eta}) for the SIR model with intervention from the prevalence of COVID-19 data in India and some states of India. To validate our model, we present a comparison between the actual and model-predicted number of COVID-19 cases. Using our model, we also present predicted numbers of active and recovered COVID-19 cases till Sept 30, 2020, for entire India and some states of India and also estimate the 95% and 99% confidence interval for the predicted cases.
3rd Place Solution to "Google Landmark Retrieval 2020"
Venue: arXiv cs.CV 2020
Year: 2020

Image retrieval is a fundamental problem in computer vision. This paper presents our 3rd place detailed solution to the Google Landmark Retrieval 2020 challenge. We focus on the exploration of data cleaning and models with metric learning. We use a data cleaning strategy based on embedding clustering. Besides, we employ a data augmentation method called Corner-Cutmix, which improves the model's ability to recognize multi-scale and occluded landmark images. We show in detail the ablation experiments and results of our method.
Time-based Handover Skipping in Cellular Networks: Spatially Stochastic Modeling and Analysis
Venue: arXiv cs.NI 2020
Year: 2020

Handover (HO) management has attracted attention of research in the context of wireless cellular communication networks. One crucial problem of HO management is to deal with increasing HOs experienced by a mobile user. To address this problem, HO skipping techniques have been studied in recent years. In this paper, we propose a novel HO skipping scheme, namely, time-based HO skipping. In the proposed scheme, HOs of a user are controlled by a certain fixed period of time, which we call skipping time. The skipping time can be managed as a system parameter, thereby enabling flexible operation of HO skipping. We analyze the transmission performance of the proposed scheme on the basis of a stochastic geometry approach. In the scenario where a user performs the time-based HO skipping, we derive the analytical expressions for two performance metrics: the HO rate and the expected data rate. The analysis results demonstrate that the scenario with the time-based HO skipping outperforms the scenario without HO skipping particularly when the user moves fast. Furthermore, we reveal that there is a unique optimal skipping time maximizing the transmission performance, which we obtain approximately.