OpenRaiser/Intern-Atlas huggingface dataset:
An Improved Dilated Convolutional Network for Herd Counting in Crowded Scenes
Venue: arXiv cs.CV 2020
Year: 2020

Crowd management technologies that leverage computer vision are widespread in contemporary times. There exists many security-related applications of these methods, including, but not limited to: following the flow of an array of people and monitoring large gatherings. In this paper, we propose an accurate monitoring system composed of two concatenated convolutional deep learning architectures. The first part called Front-end, is responsible for converting bi-dimensional signals and delivering high-level features. The second part, called the Back-end, is a dilated Convolutional Neural Network (CNN) used to replace pooling layers. It is responsible for enlarging the receptive field of the whole network and converting the descriptors provided by the first network to a saliency map that will be utilized to estimate the number of people in highly congested images. We also propose to utilize a genetic algorithm in order to find an optimized dilation rate configuration in the back-end. The proposed model is shown to converge 30\% faster than state-of-the-art approaches. It is also shown that it achieves 20\% lower Mean Absolute Error (MAE) when applied to the Shanghai data~set.
Why a computer program is a functional whole
Venue: arXiv cs.CY 2020
Year: 2020

Sharing, downloading, and reusing software is common-place, some of which is carried out legally with open source software. When it is not legal, it is unclear just how many copyright infringements and trade secret violations have taken place: does an infringement count for the artefact as a whole or perhaps for each file of the program? To answer this question, it must first be established whether a program should be considered as an integral whole, a collection, or a mere set of distinct files, and why. We argue that a program is a functional whole, availing of, and combining, arguments from mereology, granularity, modularity, unity, and function to substantiate the claim. The argumentation and answer contributes to the ontology of software artefacts, may assist industry in litigation cases, and demonstrates that the notion of unifying relation is operationalisable. Indirectly, it provides support for continued modular design of artefacts following established engineering practices.
mHealth Strategy to Fight Tuberculosis in Bangladesh
Venue: arXiv cs.CY 2020
Year: 2020

Bangladesh is one of the high TB burden countries in the world and TB is still a major public health problem in the country. To eradicate TB in Bangladesh and to ensure proper monitoring and better health care service, digital interventions may play a pivotal role. Over the years Bangladesh Government has been actively working to hold a control over TB with the help of donors, local and international NGOs. For sustainability there has been a need to develop mHealth strategy for Bangladesh to align with the Digital Bangladesh Vision 2021.
Machine Learning in Population and Public Health
Venue: arXiv cs.CY 2020
Year: 2020

Research in population and public health focuses on the mechanisms between different cultural, social, and environmental factors and their effect on the health, of not just individuals, but communities as a whole. We present here a very brief introduction into research in these fields, as well as connections to existing machine learning work to help activate the machine learning community on such topics and highlight specific opportunities where machine learning, public and population health may synergize to better achieve health equity.
AP-Loss for Accurate One-Stage Object Detection
Venue: arXiv cs.CV 2020
Year: 2020

One-stage object detectors are trained by optimizing classification-loss and localization-loss simultaneously, with the former suffering much from extreme foreground-background class imbalance issue due to the large number of anchors. This paper alleviates this issue by proposing a novel framework to replace the classification task in one-stage detectors with a ranking task, and adopting the Average-Precision loss (AP-loss) for the ranking problem. Due to its non-differentiability and non-convexity, the AP-loss cannot be optimized directly. For this purpose, we develop a novel optimization algorithm, which seamlessly combines the error-driven update scheme in perceptron learning and backpropagation algorithm in deep networks. We provide in-depth analyses on the good convergence property and computational complexity of the proposed algorithm, both theoretically and empirically. Experimental results demonstrate notable improvement in addressing the imbalance issue in object detection over existing AP-based optimization algorithms. An improved state-of-the-art performance is achieved in one-stage detectors based on AP-loss over detectors using classification-losses on various standard benchmarks. The proposed framework is also highly versatile in accommodating different network architectures. Code is available at https://github.com/cccorn/AP-loss .
New CAP Reduction Mechanisms for IEEE 802.15.4 DSME to Support Fluctuating Traffic in IoT Systems
Venue: arXiv cs.NI 2020
Year: 2020

In 2015, the IEEE 802.15.4 standard was expanded by the Deterministic and Synchronous Multi-Channel Extension (DSME) to increase reliability, scalability and energy-efficiency in industrial applications. The extension offers a TDMA/FDMA-based channel access, where time is divided into two alternating phases, a contention access period (CAP) and a contention free period (CFP). During the CAP, transmission slots can be allocated offering an exclusive access to the shared medium during the CFP. The fraction $τ$ of CFP's time slots in a dataframe is a critical value, because it directly influences agility and throughput. A high throughput demands that the CFP is much longer than the CAP, i.e., a high value of the fraction $τ$, because application data is only sent during the CFP. High agility is given if the expected waiting time to send a CAP message is short and that the length of the CAPs are sufficiently long to accommodate necessary (de)allocations of GTSs, i.e., a low value of the fraction $τ$. Once DSME is configured according to the needs of an application, the fraction $τ$ can only assume one of two values and cannot be changed at run-time. In this paper, we propose two extensions of DSME that allow to adopt $τ$ to the current traffic pattern. We show theoretically and through simulations that the proposed extensions provide a high degree of responsiveness to traffic fluctuations while keeping the throughput high.
Progressing Towards Responsible AI
Venue: arXiv cs.CY 2020
Year: 2020

The field of Artificial Intelligence (AI) and, in particular, the Machine Learning area, counts on a wide range of performance metrics and benchmark data sets to assess the problem-solving effectiveness of its solutions. However, the appearance of research centres, projects or institutions addressing AI solutions from a multidisciplinary and multi-stakeholder perspective suggests a new approach to assessment comprising ethical guidelines, reports or tools and frameworks to help both academia and business to move towards a responsible conceptualisation of AI. They all highlight the relevance of three key aspects: (i) enhancing cooperation among the different stakeholders involved in the design, deployment and use of AI; (ii) promoting multidisciplinary dialogue, including different domains of expertise in this process; and (iii) fostering public engagement to maximise a trusted relation with new technologies and practitioners. In this paper, we introduce the Observatory on Society and Artificial Intelligence (OSAI), an initiative grew out of the project AI4EU aimed at stimulating reflection on a broad spectrum of issues of AI (ethical, legal, social, economic and cultural). In particular, we describe our work in progress around OSAI and suggest how this and similar initiatives can promote a wider appraisal of progress in AI. This will give us the opportunity to present our vision and our modus operandi to enhance the implementation of these three fundamental dimensions.
An Ontological AI-and-Law Framework for the Autonomous Levels of AI Legal Reasoning
Venue: arXiv cs.CY 2020
Year: 2020

A framework is proposed that seeks to identify and establish a set of robust autonomous levels articulating the realm of Artificial Intelligence and Legal Reasoning (AILR). Doing so provides a sound and parsimonious basis for being able to assess progress in the application of AI to the law, and can be utilized by scholars in academic pursuits of AI legal reasoning, along with being used by law practitioners and legal professionals in gauging how advances in AI are aiding the practice of law and the realization of aspirational versus achieved results. A set of seven levels of autonomy for AI and Legal Reasoning are meticulously proffered and mindfully discussed.
Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture
Venue: arXiv cs.DS 2020
Year: 2020

A famous conjecture of Tuza states that the minimum number of edges needed to cover all the triangles in a graph is at most twice the maximum number of edge-disjoint triangles. This conjecture was couched in a broader setting by Aharoni and Zerbib who proposed a hypergraph version of this conjecture, and also studied its implied fractional versions. We establish the fractional version of the Aharoni-Zerbib conjecture up to lower order terms. Specifically, we give a factor $t/2+ O(\sqrt{t \log t})$ approximation based on LP rounding for an algorithmic version of the hypergraph Turán problem (AHTP). The objective in AHTP is to pick the smallest collection of $(t-1)$-sized subsets of vertices of an input $t$-uniform hypergraph such that every hyperedge contains one of these subsets. Aharoni and Zerbib also posed whether Tuza's conjecture and its hypergraph versions could follow from non-trivial duality gaps between vertex covers and matchings on hypergraphs that exclude certain sub-hypergraphs, for instance, a "tent" structure that cannot occur in the incidence of triangles and edges. We give a strong negative answer to this question, by exhibiting tent-free hypergraphs, and indeed $\mathcal{F}$-free hypergraphs for any finite family $\mathcal{F}$ of excluded sub-hypergraphs, whose vertex covers must include almost all the vertices. The algorithmic questions arising in the above study can be phrased as instances of vertex cover on simple hypergraphs, whose hyperedges can pairwise share at most one vertex. We prove that the trivial factor $t$ approximation for vertex cover is hard to improve for simple $t$-uniform hypergraphs. However, for set cover on simple $n$-vertex hypergraphs, the greedy algorithm achieves a factor $(\ln n)/2$, better than the optimal $\ln n$ factor for general hypergraphs.
Binarised Regression with Instance-Varying Costs: Evaluation using Impact Curves
Venue: arXiv cs.LG 2020
Year: 2020

Many evaluation methods exist, each for a particular prediction task, and there are a number of prediction tasks commonly performed including classification and regression. In binarised regression, binary decisions are generated from a learned regression model (or real-valued dependent variable), which is useful when the division between instances that should be predicted positive or negative depends on the utility. For example, in mining, the boundary between a valuable rock and a waste rock depends on the market price of various metals, which varies with time. This paper proposes impact curves to evaluate binarised regression with instance-varying costs, where some instances are much worse to be classified as positive (or negative) than other instances; e.g., it is much worse to throw away a high-grade gold rock than a medium-grade copper-ore rock, even if the mine wishes to keep both because both are profitable. We show how to construct an impact curve for a variety of domains, including examples from healthcare, mining, and entertainment. Impact curves optimize binary decisions across all utilities of the chosen utility function, identify the conditions where one model may be favoured over another, and quantitatively assess improvement between competing models.
Predicting Individual Treatment Effects of Large-scale Team Competitions in a Ride-sharing Economy
Venue: arXiv cs.CY 2020
Year: 2020

Millions of drivers worldwide have enjoyed financial benefits and work schedule flexibility through a ride-sharing economy, but meanwhile they have suffered from the lack of a sense of identity and career achievement. Equipped with social identity and contest theories, financially incentivized team competitions have been an effective instrument to increase drivers' productivity, job satisfaction, and retention, and to improve revenue over cost for ride-sharing platforms. While these competitions are overall effective, the decisive factors behind the treatment effects and how they affect the outcomes of individual drivers have been largely mysterious. In this study, we analyze data collected from more than 500 large-scale team competitions organized by a leading ride-sharing platform, building machine learning models to predict individual treatment effects. Through a careful investigation of features and predictors, we are able to reduce out-sample prediction error by more than 24%. Through interpreting the best-performing models, we discover many novel and actionable insights regarding how to optimize the design and the execution of team competitions on ride-sharing platforms. A simulated analysis demonstrates that by simply changing a few contest design options, the average treatment effect of a real competition is expected to increase by as much as 26%. Our procedure and findings shed light on how to analyze and optimize large-scale online field experiments in general.
On Digital Currency and the Transfer of World Wealth and Technology Centers
Venue: arXiv cs.CY 2020
Year: 2020

The emergence and transfer of wealth promote the evolution of civilizations. Through the pursuit of the form of wealth valued by the members of society, the self-assertiveness demands of a society can be met and thus stimulate creativity. As means of overdrawing the future, sovereign currency and bonds have gradually become modern forms of wealth and have strongly promoted scientific and technological progress and social development. However, due to the unequal distribution of wealth, the sustainability of sovereign currency and bonds is not certain. The world has been changing rapidly since the outbreak of COVID-19, and new forms of wealth need to be constructed as an extension of the Self of the masses, among which digital currency may be an effective carrier of value. China is on an upward trajectory, and the complex and volatile global environment can provide an opportunity for China to focus on developing aspects of its science and technology, optimize its system of governance and strengthen its internal driving force.
Improving Emergency Response during Hurricane Season using Computer Vision
Venue: arXiv cs.CV 2020
Year: 2020

We have developed a framework for crisis response and management that incorporates the latest technologies in computer vision (CV), inland flood prediction, damage assessment and data visualization. The framework uses data collected before, during, and after the crisis to enable rapid and informed decision making during all phases of disaster response. Our computer-vision model analyzes spaceborne and airborne imagery to detect relevant features during and after a natural disaster and creates metadata that is transformed into actionable information through web-accessible mapping tools. In particular, we have designed an ensemble of models to identify features including water, roads, buildings, and vegetation from the imagery. We have investigated techniques to bootstrap and reduce dependency on large data annotation efforts by adding use of open source labels including OpenStreetMaps and adding complementary data sources including Height Above Nearest Drainage (HAND) as a side channel to the network's input to encourage it to learn other features orthogonal to visual characteristics. Modeling efforts include modification of connected U-Nets for (1) semantic segmentation, (2) flood line detection, and (3) for damage assessment. In particular for the case of damage assessment, we added a second encoder to U-Net so that it could learn pre-event and post-event image features simultaneously. Through this method, the network is able to learn the difference between the pre- and post-disaster images, and therefore more effectively classify the level of damage. We have validated our approaches using publicly available data from the National Oceanic and Atmospheric Administration (NOAA)'s Remote Sensing Division, which displays the city and street-level details as mosaic tile images as well as data released as part of the Xview2 challenge.
Zero Shot Domain Generalization
Venue: arXiv cs.CV 2020
Year: 2020

Standard supervised learning setting assumes that training data and test data come from the same distribution (domain). Domain generalization (DG) methods try to learn a model that when trained on data from multiple domains, would generalize to a new unseen domain. We extend DG to an even more challenging setting, where the label space of the unseen domain could also change. We introduce this problem as Zero-Shot Domain Generalization (to the best of our knowledge, the first such effort), where the model generalizes across new domains and also across new classes in those domains. We propose a simple strategy which effectively exploits semantic information of classes, to adapt existing DG methods to meet the demands of Zero-Shot Domain Generalization. We evaluate the proposed methods on CIFAR-10, CIFAR-100, F-MNIST and PACS datasets, establishing a strong baseline to foster interest in this new research direction.
Effects of Internship on Fresh Graduates: A case study on IIT, DU students
Venue: arXiv cs.CY 2020
Year: 2020

The aim of any curriculum is to produce industry ready students. The effectiveness of curricular activities, thus, can be measured by the performances of fresh graduates at their job sectors. To evaluate the Software Engineering (SE) syllabus, Institute of Information Technology (IIT), University of Dhaka, has taken an initiative, under the project IQAC, HEQEP, where a survey based study has been performed. The uniqueness of this SE syllabus is having a six month long internship semester inside the curriculum. Considering all the other courses and activities as traditional, the outcome of the study can fairly be considered as the effect of the Internship program. The result shows that the students having internship experiences, performed above the level of expectation from the industries.
Learning to Actively Reduce Memory Requirements for Robot Control Tasks
Venue: arXiv cs.RO 2020
Year: 2020

Robots equipped with rich sensing modalities (e.g., RGB-D cameras) performing long-horizon tasks motivate the need for policies that are highly memory-efficient. State-of-the-art approaches for controlling robots often use memory representations that are excessively rich for the task or rely on hand-crafted tricks for memory efficiency. Instead, this work provides a general approach for jointly synthesizing memory representations and policies; the resulting policies actively seek to reduce memory requirements. Specifically, we present a reinforcement learning framework that leverages an implementation of the group LASSO regularization to synthesize policies that employ low-dimensional and task-centric memory representations. We demonstrate the efficacy of our approach with simulated examples including navigation in discrete and continuous spaces as well as vision-based indoor navigation set in a photo-realistic simulator. The results on these examples indicate that our method is capable of finding policies that rely only on low-dimensional memory representations, improving generalization, and actively reducing memory requirements.
On the Latency of IEEE 802.11ax WLANs with Parameterized Spatial Reuse
Venue: arXiv cs.NI 2020
Year: 2020

In this article, we evaluate the performance of the parameterized spatial reuse (PSR) framework of IEEE 802.11ax, mainly focusing on its impact on transmission latency. Based on detailed standard-compliant system-level simulations, we provide a realistic analysis of the effects of PSR considering different scenario densities, traffic loads, and access points (APs) antenna capabilities to quantify its performance gains under various scenarios. Our results show that, in medium-density scenarios, PSR can offer up to a 3.8x reduction in the 5% worst-case latencies for delay-sensitive stations with respect to an 802.11ax system without PSR. Moreover, our study demonstrates that, for low-latency communications, providing the network with PSR capabilities may be an appealing alternative to the deployment of more costly multi-antenna APs.
CheckDP: An Automated and Integrated Approach for Proving Differential Privacy or Finding Precise Counterexamples
Venue: arXiv cs.PL 2020
Year: 2020

We propose CheckDP, the first automated and integrated approach for proving or disproving claims that a mechanism is differentially private. CheckDP can find counterexamples for mechanisms with subtle bugs for which prior counterexample generators have failed. Furthermore, it was able to \emph{automatically} generate proofs for correct mechanisms for which no formal verification was reported before. CheckDP is built on static program analysis, allowing it to be more efficient and more precise in catching infrequent events than existing counterexample generators (which run mechanisms hundreds of thousands of times to estimate their output distribution). Moreover, its sound approach also allows automatic verification of correct mechanisms. When evaluated on standard benchmarks and newer privacy mechanisms, CheckDP generates proofs (for correct mechanisms) and counterexamples (for incorrect mechanisms) within 70 seconds without any false positives or false negatives.
Wireless Powered Mobile Edge Computing: Offloading Or Local Computation?
Venue: arXiv cs.IT 2020
Year: 2020

Mobile-edge computing (MEC) and wireless power transfer are technologies that can assist in the implementation of next generation wireless networks, which will deploy a large number of computational and energy limited devices. In this letter, we consider a point-to-point MEC system, where the device harvests energy from the access point's (AP's) transmitted signal to power the offloading and/or the local computation of a task. By taking into account the non-linearities of energy harvesting, we provide analytical expressions for the probability of successful computation and for the average number of successfully computed bits. Our results show that a hybrid scheme of partial offloading and local computation is not always efficient. In particular, the decision to offload and/or compute locally, depends on the system's parameters such as the distance to the AP and the number of bits that need to be computed.