OpenRaiser/Intern-Atlas huggingface dataset:
Transdisciplinary AI Observatory -- Retrospective Analyses and Future-Oriented Contradistinctions
Venue: arXiv cs.CY 2020
Year: 2020

In the last years, AI safety gained international recognition in the light of heterogeneous safety-critical and ethical issues that risk overshadowing the broad beneficial impacts of AI. In this context, the implementation of AI observatory endeavors represents one key research direction. This paper motivates the need for an inherently transdisciplinary AI observatory approach integrating diverse retrospective and counterfactual views. We delineate aims and limitations while providing hands-on-advice utilizing concrete practical examples. Distinguishing between unintentionally and intentionally triggered AI risks with diverse socio-psycho-technological impacts, we exemplify a retrospective descriptive analysis followed by a retrospective counterfactual risk analysis. Building on these AI observatory tools, we present near-term transdisciplinary guidelines for AI safety. As further contribution, we discuss differentiated and tailored long-term directions through the lens of two disparate modern AI safety paradigms. For simplicity, we refer to these two different paradigms with the terms artificial stupidity (AS) and eternal creativity (EC) respectively. While both AS and EC acknowledge the need for a hybrid cognitive-affective approach to AI safety and overlap with regard to many short-term considerations, they differ fundamentally in the nature of multiple envisaged long-term solution patterns. By compiling relevant underlying contradistinctions, we aim to provide future-oriented incentives for constructive dialectics in practical and theoretical AI safety research.
An Event-Driven Framework for Business Awareness Management
Venue: arXiv cs.OH 2020
Year: 2020

Modern organizations need real-time awareness about the current business conditions and the various events that occur from multiple and heterogeneous environments and influence their business operations. Moreover, based on real-time awareness they need a mechanism that allows them to respond quickly to the changing business conditions, in order to either avoid problematic situations or exploit opportunities that may arise in their business environment. In this paper we present BEAM, an event-driven framework that enables awareness about the situations happening in business environments and increases organizations responsiveness to them. We illustrate how BEAM increases the awareness of managers about the running business processes, as well as their flexibility by presenting a practical application of the framework in the transportation and logistics domain.
Computational Complexity of Three Central Problems in Itemset Mining
Venue: arXiv cs.DB 2020
Year: 2020

Itemset mining is one of the most studied tasks in knowledge discovery. In this paper we analyze the computational complexity of three central itemset mining problems. We prove that mining confident rules with a given item in the head is NP-hard. We prove that mining high utility itemsets is NP-hard. We finally prove that mining maximal or closed itemsets is coNP-hard as soon as the users can specify constraints on the kind of itemsets they are interested in.
Linear Regression Evaluation of Search Engine Automatic Search Performance Based on Hadoop and R
Venue: arXiv cs.IR 2020
Year: 2020

The automatic search performance of search engines has become an essential part of measuring the difference in user experience. An efficient automatic search system can significantly improve the performance of search engines and increase user traffic. Hadoop has strong data integration and analysis capabilities, while R has excellent statistical capabilities in linear regression. This article will propose a linear regression based on Hadoop and R to quantify the efficiency of the automatic retrieval system. We use R's functional properties to transform the user's search results upon linear correlations. In this way, the final output results have multiple display forms instead of web page preview interfaces. This article provides feasible solutions to the drawbacks of current search engine algorithms lacking once or twice search accuracies and multiple types of search results. We can conduct personalized regression analysis for user's needs with public datasets and optimize resources integration for most relevant information.
Understanding Attention: In Minds and Machines
Venue: arXiv cs.AI 2020
Year: 2020

Attention is a complex and broad concept, studied across multiple disciplines spanning artificial intelligence, cognitive science, psychology, neuroscience, and related fields. Although many of the ideas regarding attention do not significantly overlap among these fields, there is a common theme of adaptive control of limited resources. In this work, we review the concept and variants of attention in artificial neural networks (ANNs). We also discuss the origin of attention from the neuroscience point of view parallel to that of ANNs. Instead of having seemingly disconnected dialogues between varied disciplines, we suggest grounding the ideas on common conceptual frameworks for a systematic analysis of attention and towards possible unification of ideas in AI and Neuroscience.
Massive MIMO with Dense Arrays and 1-bit Data Converters
Venue: arXiv cs.IT 2020
Year: 2020

We consider wireless communication systems with compact planar arrays having densely spaced antenna elements in conjunction with one-bit analog-to-digital and digital-to-analog converters (ADCs/DACs). We provide closed-form expressions for the achievable rates with simple linear processing techniques for the uplink as well as the downlink scenarios while taking into account the effects of antenna mutual coupling. In the downlink case, we introduce the concept of non-radiating dithering to combat correlations of the quantization errors. Under higher antenna element density, we show that the performance of the quantized system can be made close to the ideal performance regardless of the operating signal-to-noise ratio.
Playing Text-Based Games with Common Sense
Venue: arXiv cs.AI 2020
Year: 2020

Text based games are simulations in which an agent interacts with the world purely through natural language. They typically consist of a number of puzzles interspersed with interactions with common everyday objects and locations. Deep reinforcement learning agents can learn to solve these puzzles. However, the everyday interactions with the environment, while trivial for human players, present as additional puzzles to agents. We explore two techniques for incorporating commonsense knowledge into agents. Inferring possibly hidden aspects of the world state with either a commonsense inference model COMET, or a language model BERT. Biasing an agents exploration according to common patterns recognized by a language model. We test our technique in the 9to05 game, which is an extreme version of a text based game that requires numerous interactions with common, everyday objects in common, everyday scenarios. We conclude that agents that augment their beliefs about the world state with commonsense inferences are more robust to observational errors and omissions of common elements from text descriptions.
Modeling Voters in Multi-Winner Approval Voting
Venue: arXiv cs.GT 2020
Year: 2020

In many real world situations, collective decisions are made using voting and, in scenarios such as committee or board elections, employing voting rules that return multiple winners. In multi-winner approval voting (AV), an agent submits a ballot consisting of approvals for as many candidates as they wish, and winners are chosen by tallying up the votes and choosing the top-$k$ candidates receiving the most approvals. In many scenarios, an agent may manipulate the ballot they submit in order to achieve a better outcome by voting in a way that does not reflect their true preferences. In complex and uncertain situations, agents may use heuristics instead of incurring the additional effort required to compute the manipulation which most favors them. In this paper, we examine voting behavior in single-winner and multi-winner approval voting scenarios with varying degrees of uncertainty using behavioral data obtained from Mechanical Turk. We find that people generally manipulate their vote to obtain a better outcome, but often do not identify the optimal manipulation. There are a number of predictive models of agent behavior in the COMSOC and psychology literature that are based on cognitively plausible heuristic strategies. We show that the existing approaches do not adequately model real-world data. We propose a novel model that takes into account the size of the winning set and human cognitive constraints, and demonstrate that this model is more effective at capturing real-world behaviors in multi-winner approval voting scenarios.
Hybrid Chaotic Method for Medical Images Ciphering
Venue: arXiv cs.CR 2020
Year: 2020

Healthcare is an essential application of e-services, where for diagnostic testing, medical imaging acquiring, processing, analysis, storage, and protection are used. Image ciphering during storage and transmission over the networks used has seen implemented using many types of ciphering algorithms for security purpose. Current cyphering algorithms are classified into two types: traditional classical cryptography using standard algorithms (DES, AES, IDEA, RC5, RSA, ...) and chaos cryptography using continuous (Chau, Rossler, Lorenz, ...) or discreet (Logistics, Henon, ...) algorithms. The traditional algorithms have struggled to combat image data as compared to regular textual data. Whereas, the chaotic algorithms are more efficient for image ciphering. The Significance characteristics of chaos are its extreme sensitivity to initial conditions and algorithm parameters. In this paper, medical image security based on hybrid/mixed chaotic algorithms is proposed. The proposed method is implemented using MATLAB. Where the image of the Retina of the Eye to detect Blood Vessels is ciphered. The Pseudo-Random Numbers Generators (PRNGs) from the different chaotic algorithms are implemented, and their statistical properties are evaluated using the National Institute of Standards and Technology NIST and other statistical test-suits. Then, these algorithms are used to secure the data, where the statistical properties of the cipher-text are also tested. We propose two PRNGs to increase the complexity of the PRNGs and to allow many of the NIST statistical tests to be passed: one based on two-hybrid mixed chaotic logistic maps and one based on two-hybrid mixed chaotic Henon maps, where each chaotic algorithm runs side-by-side and starts with random initial conditions and parameters (encryption keys). The resulting hybrid PRNGs passed many of the NIST statistical test suits.
One-bit feedback is sufficient for upper confidence bound policies
Venue: arXiv cs.LG 2020
Year: 2020

We consider a variant of the traditional multi-armed bandit problem in which each arm is only able to provide one-bit feedback during each pull based on its past history of rewards. Our main result is the following: given an upper confidence bound policy which uses full-reward feedback, there exists a coding scheme for generating one-bit feedback, and a corresponding decoding scheme and arm selection policy, such that the ratio of the regret achieved by our policy and the regret of the full-reward feedback policy asymptotically approaches one.
Discovering Underground Maps from Fashion
Venue: arXiv cs.CV 2020
Year: 2020

The fashion sense -- meaning the clothing styles people wear -- in a geographical region can reveal information about that region. For example, it can reflect the kind of activities people do there, or the type of crowds that frequently visit the region (e.g., tourist hot spot, student neighborhood, business center). We propose a method to automatically create underground neighborhood maps of cities by analyzing how people dress. Using publicly available images from across a city, our method finds neighborhoods with a similar fashion sense and segments the map without supervision. For 37 cities worldwide, we show promising results in creating good underground maps, as evaluated using experiments with human judges and underground map benchmarks derived from non-image data. Our approach further allows detecting distinct neighborhoods (what is the most unique region of LA?) and answering analogy questions between cities (what is the "Downtown LA" of Bogota?).
A Refined Study of the Complexity of Binary Networked Public Goods Games
Venue: arXiv cs.GT 2020
Year: 2020

We study the complexity of several combinatorial problems in the model of binary networked public goods games. In this game, players are represented by vertices in a network, and the action of each player can be either investing or not investing in a public good. The payoff of each player is determined by the number of neighbors who invest and her own action. We study the complexity of computing action profiles that are Nash equilibrium, and those that provide the maximum utilitarian or egalitarian social welfare. We show that these problems are generally NP-hard but become polynomial-time solvable when the given network is restricted to some special domains, including networks with a constant bounded treewidth, and those whose critical clique graphs are forests.
Cirrus: A Long-range Bi-pattern LiDAR Dataset
Venue: arXiv cs.CV 2020
Year: 2020

In this paper, we introduce Cirrus, a new long-range bi-pattern LiDAR public dataset for autonomous driving tasks such as 3D object detection, critical to highway driving and timely decision making. Our platform is equipped with a high-resolution video camera and a pair of LiDAR sensors with a 250-meter effective range, which is significantly longer than existing public datasets. We record paired point clouds simultaneously using both Gaussian and uniform scanning patterns. Point density varies significantly across such a long range, and different scanning patterns further diversify object representation in LiDAR. In Cirrus, eight categories of objects are exhaustively annotated in the LiDAR point clouds for the entire effective range. To illustrate the kind of studies supported by this new dataset, we introduce LiDAR model adaptation across different ranges, scanning patterns, and sensor devices. Promising results show the great potential of this new dataset to the robotics and computer vision communities.
Neurosymbolic AI for Situated Language Understanding
Venue: arXiv cs.AI 2020
Year: 2020

In recent years, data-intensive AI, particularly the domain of natural language processing and understanding, has seen significant progress driven by the advent of large datasets and deep neural networks that have sidelined more classic AI approaches to the field. These systems can apparently demonstrate sophisticated linguistic understanding or generation capabilities, but often fail to transfer their skills to situations they have not encountered before. We argue that computational situated grounding provides a solution to some of these learning challenges by creating situational representations that both serve as a formal model of the salient phenomena, and contain rich amounts of exploitable, task-appropriate data for training new, flexible computational models. Our model reincorporates some ideas of classic AI into a framework of neurosymbolic intelligence, using multimodal contextual modeling of interactive situations, events, and object properties. We discuss how situated grounding provides diverse data and multiple levels of modeling for a variety of AI learning challenges, including learning how to interact with object affordances, learning semantics for novel structures and configurations, and transferring such learned knowledge to new objects and situations.
r-Gathering Problems on Spiders:Hardness, FPT Algorithms, and PTASes
Venue: arXiv cs.DS 2020
Year: 2020

We consider the min-max $r$-gathering problem described as follows: We are given a set of users and facilities in a metric space. We open some of the facilities and assign each user to an opened facility such that each facility has at least $r$ users. The goal is to minimize the maximum distance between the users and the assigned facility. We also consider the min-max $r$-gather clustering problem, which is a special case of the $r$-gathering problem in which the facilities are located everywhere. In this paper, we study the tractability and the hardness when the underlying metric space is a spider, which answers the open question posed by Ahmed et al. [WALCOM'19]. First, we show that the problems are NP-hard even if the underlying space is a spider. Then, we propose FPT algorithms parameterized by the degree $d$ of the center. This improves the previous algorithms because they are parameterized by both $r$ and $d$. Finally, we propose PTASes to the problems. These are best possible because there are no FPTASes unless P=NP.
Materials In Paintings (MIP): An interdisciplinary dataset for perception, art history, and computer vision
Venue: arXiv cs.HC 2020
Year: 2020

A painter is free to modify how components of a natural scene are depicted, which can lead to a perceptually convincing image of the distal world. This signals a major difference between photos and paintings: paintings are explicitly created for human perception. Studying these painterly depictions could be beneficial to a multidisciplinary audience. In this paper, we capture and explore the painterly depictions of materials to enable the study of depiction and perception of materials through the artists' eye. We annotated a dataset of 19k paintings with 200k+ bounding boxes from which polygon segments were automatically extracted. Each bounding box was assigned a coarse label (e.g., fabric) and a fine-grained label (e.g., velvety, silky). We demonstrate the cross-disciplinary utility of our dataset by presenting novel findings across art history, human perception, and computer vision. Our experiments include analyzing the distribution of materials depicted in paintings, showing how painters create convincing depictions using a stylized approach, and demonstrating how paintings can be used to build more robust computer vision models. We conclude that our dataset of painterly material depictions is a rich source for gaining insights into the depiction and perception of materials across multiple disciplines. The MIP dataset is freely accessible at https://materialsinpaintings.tudelft.nl
ProMask: Probability Mask for Skeleton Detection
Venue: arXiv cs.CV 2020
Year: 2020

Detecting object skeletons in natural images presents challenging, due to varied object scales, the complexity of backgrounds and various noises. The skeleton is a highly compressing shape representation, which can bring some essential advantages but cause the difficulties of detection. This skeleton line occupies a rare proportion of an image and is overly sensitive to spatial position. Inspired by these issues, we propose the ProMask, which is a novel skeleton detection model. The ProMask includes the probability mask and vector router. The skeleton probability mask representation explicitly encodes skeletons with segmentation signals, which can provide more supervised information to learn and pay more attention to ground-truth skeleton pixels. Moreover, the vector router module possesses two sets of orthogonal basis vectors in a two-dimensional space, which can dynamically adjust the predicted skeleton position. We evaluate our method on the well-known skeleton datasets, realizing the better performance than state-of-the-art approaches. Especially, ProMask significantly outperforms the competitive DeepFlux by 6.2% on the challenging SYM-PASCAL dataset. We consider that our proposed skeleton probability mask could serve as a solid baseline for future skeleton detection, since it is very effective and it requires about 10 lines of code.
Two-Timescale Resource Allocation for Cooperative D2D Communication: A Matching Game Approach
Venue: arXiv cs.IT 2020
Year: 2020

In this paper, we consider a cooperative device-todevice (D2D) communication system, where the D2D transmitters (DTs) act as relays to assist the densified cellular network users (CUs) for transmission quality of service (QoS) improvement. The proposed system achieves a win-win situation, i.e. improving the spectrum efficiency of the CUs that cannot meet their rate requirement while providing spectrum access for D2D pairs. Unlike previous works, to reduce the overhead, we design a novel two-timescale resource allocation scheme, in which the pairing between CUs and D2D pairs is decided at a long timescale and transmission time for CU and D2D pair is determined at a short timescale. Specifically, to characterize the long-term payoff of each potential CU-D2D pair, we investigate the optimal cooperation policy to decide the transmission time based on the instantaneous channel state information (CSI). We prove that the optimal policy is a threshold policy which can be achieved via binary search. Since CUs and D2D pairs are self-interested, they are paired only when they agree to cooperate mutually. Therefore, to study the cooperation behaviors of CUs and D2D pairs, we formulate the pairing problem as a matching game, based on the long-term payoff achieved by the optimal cooperation policy of each possible pairing. Furthermore, unlike most previous matching models in D2D networks, we allow transfer between CUs and D2D pairs to improve the performance. To solve the pairing problem, a distributed algorithm is proposed, which converges to an ε-stable matching. We show that there is a tradeoff between the optimality and the computational complexity of the algorithm. We also analyze the algorithm in terms of the robustness to the unilateral deviation of D2D pairs. Finally, the simulation results verify the efficiency of the proposed matching algorithm.
Conceptualizing and Realizing A Smart City Model for Bangladesh
Venue: arXiv cs.CY 2020
Year: 2020

The outbreak of the novel Corona Virus in 2019, named COVID-19, causes the ongoing global pandemic. This pandemic has a devastating socio-economic impact across the globe. On the other hand, due to the pre-pandemic aggressive urbanization with the steep population growth, modern cities also facing substantial challenges. Hence, usage of technology is anticipated to be the precondition for adaptive, resilient, and sustainable development, where, a smart city is defined as the accumulated advanced ideas of information and technology aiming to ensure a decent quality of life for the inhabitants. Considering the current growth rate of 1.9 percent, the projected population of Bangladesh will exceed 180 million in 2026. It is also speculated that Dhaka being the capital will be populated with 14 million inhabitants. Moreover, Dhaka has already been labeled as the most densely populated city in the world. Thus, concerned authorities are facing enormous challenges to provide and ensure fundamental services to the in-habitants. Therefore, this has become the need of the hour to conceptualize an information and communication technology-driven smart city for Bangladesh. A smart city may contain numerous components; however, the proposed framework identifies seven components and services for smart cities in Bangladesh. These are healthcare, education, transportation, public safety, real estate, utilities, and city administration. Discussions on these components are carried out in this paper.