OpenRaiser/Intern-Atlas huggingface dataset:
Structure-based Computer Without Using Transistors
Venue: arXiv cs.ET 2020
Year: 2020

The commercialization of transistors capable of both switching and amplification in 1960 resulted in the development of second-generation computers, which resulted in the miniaturization and lightening, while accelerating the reduction and development of production costs. However, the self-resistance and the resistance used in conjunction with semiconductors, which are the basic principles of computers, generate a lot of heat, which results in semiconductor obsolescence, and limits the computation speed (Clock rate). In implementing logic operation, this paper proposes the concept of Structure-based Computer which can implement NOT gate made of semiconductor transistor only by Structure-based twist of cable without resistance. In Structure-based computer, the theory of 'inverse signal pair' of digital signals was introduced so that it could operate in a different way than semiconductor-based transistors. In this paper, we propose a new hardware called Structure-based computer that can solve various problems in semiconductor computers only with the wiring structure of the conductor itself, not with the silicon-based semiconductor. A USB-type Structure-based computer prototype has been built, and a logical cloning method using CPU Clock is proposed to avoid the risk of current being reversed by cloning logical values. Furthermore, we propose a deep-priority exploration-based simulation method that can easily implement and test complex Structure-based computer circuits. Furthermore, this paper suggests a mechanism to implement optical computers currently under development and research based on structures rather than devices.
Proceedings of Symposium on Data Mining Applications 2014
Venue: arXiv cs.DB 2020
Year: 2020

The Symposium on Data Mining and Applications (SDMA 2014) is aimed to gather researchers and application developers from a wide range of data mining related areas such as statistics, computational intelligence, pattern recognition, databases, Big Data Mining and visualization. SDMA is organized by MEGDAM to advance the state of the art in data mining research field and its various real world applications. The symposium will provide opportunities for technical collaboration among data mining and machine learning researchers around the Saudi Arabia, GCC countries and Middle-East region. Acceptance will be based primarily on originality, significance and quality of contribution.
On Constraint Definability in Tractable Probabilistic Models
Venue: arXiv cs.LG 2020
Year: 2020

Incorporating constraints is a major concern in probabilistic machine learning. A wide variety of problems require predictions to be integrated with reasoning about constraints, from modelling routes on maps to approving loan predictions. In the former, we may require the prediction model to respect the presence of physical paths between the nodes on the map, and in the latter, we may require that the prediction model respect fairness constraints that ensure that outcomes are not subject to bias. Broadly speaking, constraints may be probabilistic, logical or causal, but the overarching challenge is to determine if and how a model can be learnt that handles all the declared constraints. To the best of our knowledge, this is largely an open problem. In this paper, we consider a mathematical inquiry on how the learning of tractable probabilistic models, such as sum-product networks, is possible while incorporating constraints.
Visuohaptic augmented feedback for enhancing motor skills acquisition
Venue: arXiv cs.HC 2020
Year: 2020

Serious games are accepted as an effective approach to deliver augmented feedback in motor (re-) learning processes. The multi-modal nature of the conventional computer games (e.g. audiovisual representation) plus the ability to interact via haptic-enabled inputs provides a more immersive experience. Thus, particular disciplines such as medical education in which frequent hands on rehearsals play a key role in learning core motor skills (e.g. physical palpations) may benefit from this technique. Challenges such as the impracticality of verbalising palpation experience by tutors and ethical considerations may prevent the medical students from correctly learning core palpation skills. This work presents a new data glove, built from off-the-shelf components which captures pressure sensitivity designed to provide feedback for palpation tasks. In this work the data glove is used to control a serious game adapted from the infinite runner genre to improve motor skill acquisition. A comparative evaluation on usability and effectiveness of the method using multimodal visualisations, as part of a larger study to enhance pressure sensitivity, is presented. Thirty participants divided into a game-playing group (n = 15) and a control group (n = 15) were invited to perform a simple palpation task. The game-playing group significantly outperformed the control group in which abstract visualisation of force was provided to the users in a blind-folded transfer test. The game-based training approach was positively described by the game-playing group as enjoyable and engaging.
Asymptotic regime analysis of NOMA uplink networks under QoS delay Constraints
Venue: arXiv cs.IT 2020
Year: 2020

In the fifth generation and beyond (B5G) technologies, delay constrains emerge as a topic of particular interest for ultra reliable low latency communications (e.g., enhanced reality, haptic communications). In this report, we study the performance of a two user uplink non orthogonal multiple access (NOMA) network under quality of service (QoS) delay constraints, captured through each user delay exponents in their effective capacity (EC). We propose novel closed form expressions for the EC of the NOMA users and validate them through Monte Carlo simulations. Interestingly, our study shows that in the high signal to noise ratio (SNR) region, the strong NOMA user has a limited EC no matter how large the transmit SNR is, under the same delay constraint as the weak user. We show that for the weak user OMA achieves higher EC than NOMA at small values of the transmit SNR and that NOMA become more beneficial at high values of the transmit SNR. For the strong user, we show that NOMA achieves a higher EC than OMA at small values of the transmit SNR and that at high values of the transmit SNR OMA becomes more beneficial. By introducing user pairing when more than two NOMA users are present, we show that NOMA with user pairing outperforms OMA in term of the total link layer EC. Finally, we find the set of pairs which gives the highest total link-layer in the uplink for NOMA with multiple user-pairs.
In-situ learning harnessing intrinsic resistive memory variability through Markov Chain Monte Carlo Sampling
Venue: arXiv cs.ET 2020
Year: 2020

Resistive memory technologies promise to be a key component in unlocking the next generation of intelligent in-memory computing systems that can act and learn locally at the edge. However, current approaches to in-memory machine learning focus often on the implementation of models and algorithms which cannot be reconciled with the true, physical properties of resistive memory. Consequently, these properties, in particular cycle-to-cycle conductance variability, are considered as non-idealities that require mitigation. Here by contrast, we embrace these properties by selecting a more appropriate machine learning model and algorithm. We implement a Markov Chain Monte Carlo sampling algorithm within a fabricated array of 16,384 devices, configured as a Bayesian machine learning model. The algorithm is realised in-situ, by exploiting the devices as random variables from the perspective of their cycle-to-cycle conductance variability. We train experimentally the memory array to perform an illustrative supervised learning task as well as a malignant breast tissue recognition task, achieving an accuracy of 96.3%. Then, using a behavioural model of resistive memory calibrated on array level measurements, we apply the same approach to the Cartpole reinforcement learning task. In all cases our proposed approach outperformed software-based neural network models realised using an equivalent number of memory elements. This result lays a foundation for a new path in-memory machine learning, compatible with the true properties of resistive memory technologies, that can bring localised learning capabilities to intelligent edge computing systems.
Optimal Beamforming for MISO Communications via Intelligent Reflecting Surfaces
Venue: arXiv cs.IT 2020
Year: 2020

Wireless communications via intelligent reflecting surfaces (IRSs) has received considerable attention from both academia and industry. In particular, IRSs are able to create favorable wireless propagation environments with typically low-cost passive devices. While various IRS-aided wireless communication systems have been investigated in the literature, thus far, the optimal design of such systems is not well understood. In this paper, IRS-assisted single-user multiple-input single-output (MISO) communication is investigated. To maximize the spectral efficiency, a branch-and-bound (BnB) algorithm is proposed to obtain globally optimal solutions for both the active and passive beamformers at the access point (AP) and the IRS, respectively. Simulation results confirm the effectiveness of deploying IRSs in wireless systems. Furthermore, by taking the proposed optimal BnB algorithm as the performance benchmark, the optimality of existing design algorithms is investigated.
Scalable and Customizable Benchmark Problems for Many-Objective Optimization
Venue: arXiv cs.NE 2020
Year: 2020

Solving many-objective problems (MaOPs) is still a significant challenge in the multi-objective optimization (MOO) field. One way to measure algorithm performance is through the use of benchmark functions (also called test functions or test suites), which are artificial problems with a well-defined mathematical formulation, known solutions and a variety of features and difficulties. In this paper we propose a parameterized generator of scalable and customizable benchmark problems for MaOPs. It is able to generate problems that reproduce features present in other benchmarks and also problems with some new features. We propose here the concept of generative benchmarking, in which one can generate an infinite number of MOO problems, by varying parameters that control specific features that the problem should have: scalability in the number of variables and objectives, bias, deceptiveness, multimodality, robust and non-robust solutions, shape of the Pareto front, and constraints. The proposed Generalized Position-Distance (GPD) tunable benchmark generator uses the position-distance paradigm, a basic approach to building test functions, used in other benchmarks such as Deb, Thiele, Laumanns and Zitzler (DTLZ), Walking Fish Group (WFG) and others. It includes scalable problems in any number of variables and objectives and it presents Pareto fronts with different characteristics. The resulting functions are easy to understand and visualize, easy to implement, fast to compute and their Pareto optimal solutions are known.
Diva: A Declarative and Reactive Language for In-Situ Visualization
Venue: arXiv cs.PL 2020
Year: 2020

The use of adaptive workflow management for in situ visualization and analysis has been a growing trend in large-scale scientific simulations. However, coordinating adaptive workflows with traditional procedural programming languages can be difficult because system flow is determined by unpredictable scientific phenomena, which often appear in an unknown order and can evade event handling. This makes the implementation of adaptive workflows tedious and error-prone. Recently, reactive and declarative programming paradigms have been recognized as well-suited solutions to similar problems in other domains. However, there is a dearth of research on adapting these approaches to in situ visualization and analysis. With this paper, we present a language design and runtime system for developing adaptive systems through a declarative and reactive programming paradigm. We illustrate how an adaptive workflow programming system is implemented using our approach and demonstrate it with a use case from a combustion simulation.
Optimally selecting the top $k$ values from $X+Y$ with layer-ordered heaps
Venue: arXiv cs.DS 2020
Year: 2020

Selection and sorting the Cartesian sum, $X+Y$, are classic and important problems. Here, a new algorithm is presented, which generates the top $k$ values of the form $X_i+Y_j$. The algorithm relies only on median-of-medians and is simple to implement. Furthermore, it uses data structures contiguous in memory, and is fast in practice. The presented algorithm is demonstrated to be theoretically optimal.
Rank and Kernel of $\mathbb{F}_p$-Additive Generalised Hadamard Codes
Venue: arXiv cs.IT 2020
Year: 2020

A subset of a vector space $\mathbb{F}_q^n$ is $K$-additive if it is a linear space over the subfield $K\subseteq \mathbb{F}_q$. Let $q=p^e$, $p$ prime, and $e>1$. Bounds on the rank and dimension of the kernel of generalised Hadamard (GH) codes which are $\mathbb{F}_p$-additive are established. For specific ranks and dimensions of the kernel within these bounds, $\mathbb{F}_p$-additive GH codes are constructed. Moreover, for the case $e=2$, it is shown that the given bounds are tight and it is possible to construct an $\mathbb{F}_p$-additive GH code for all allowable ranks and dimensions of the kernel between these bounds. Finally, we also prove that these codes are self-orthogonal with respect to the trace Hermitian inner product, and generate pure quantum codes.
UAV Autonomous Localization using Macro-Features Matching with a CAD Model
Venue: arXiv cs.CV 2020
Year: 2020

Research in the field of autonomous Unmanned Aerial Vehicles (UAVs) has significantly advanced in recent years, mainly due to their relevance in a large variety of commercial, industrial, and military applications. However, UAV navigation in GPS-denied environments continues to be a challenging problem that has been tackled in recent research through sensor-based approaches. This paper presents a novel offline, portable, real-time in-door UAV localization technique that relies on macro-feature detection and matching. The proposed system leverages the support of machine learning, traditional computer vision techniques, and pre-existing knowledge of the environment. The main contribution of this work is the real-time creation of a macro-feature description vector from the UAV captured images which are simultaneously matched with an offline pre-existing vector from a Computer-Aided Design (CAD) model. This results in a quick UAV localization within the CAD model. The effectiveness and accuracy of the proposed system were evaluated through simulations and experimental prototype implementation. Final results reveal the algorithm's low computational burden as well as its ease of deployment in GPS-denied environments.
ParkingSticker: A Real-World Object Detection Dataset
Venue: arXiv cs.CV 2020
Year: 2020

We present a new and challenging object detection dataset, ParkingSticker, which mimics the type of data available in industry problems more closely than popular existing datasets like PASCAL VOC. ParkingSticker contains 1,871 images that come from a security camera's video footage. The objective is to identify parking stickers on cars approaching a gate that the security camera faces. Bounding boxes are drawn around parking stickers in the images. The parking stickers are much smaller on average than the objects in other popular object detection datasets; this makes ParkingSticker a challenging test for object detection methods. This dataset also very realistically represents the data available in many industry problems where a customer presents a few video frames and asks for a solution to a very difficult problem. Performance of various object detection pipelines using a YOLOv2 architecture are presented and indicate that identifying the parking stickers in ParkingSticker is challenging yet feasible. We believe that this dataset will challenge researchers to solve a real-world problem with real-world constraints such as non-ideal camera positioning and small object-size-to-image-size ratios.
StackEmo-Towards Enhancing User Experience by Augmenting Stack Overflow with Emojis
Venue: arXiv cs.SE 2020
Year: 2020

With the increase in acceptance of open source platforms for knowledge sharing, Question and Answer (Q\&A) websites such as Stack Overflow have become increasingly popular in the programming domain. Many novice programmers visit Stack Overflow for reasons that include posing questions, finding answers for issues they come across in the process of programming. Practitioners voluntarily answer questions on Stack Overflow based on their experience or prior knowledge. Most of these answers are also accompanied by comments from users of Stack Overflow. Questions, answers and comments on Stack Overflow also include sentiments of users, which when analysed and presented could motivate users in reading and contributing to the posts. However, the sentiment of these posts is not being depicted in the current Stack Overflow platform. There is extensive research on analysing sentiments on social networking platforms such as twitter. Representing sentiment of a post might motivate users to follow or answer certain posts. While there exist several tools that augment or annotate Stack Overflow platform for developers, we are not aware of tools that deal with sentiment of the posts. In this paper, we propose StackEmo as a Google Chrome plugin to augment comments on Stack Overflow with emojis, based on the sentiment of the comments posted, with the aim to provide users with visual cues that could motivate the users to review and contribute to available comments. We evaluated StackEmo through an in-user likert scale based survey with 30 university students. The results of the survey provided us insights on improving StackEmo, with 83% participants having recommended the plugin to their peers.
On the Convergence of Stochastic Gradient Descent with Low-Rank Projections for Convex Low-Rank Matrix Problems
Venue: arXiv cs.LG 2020
Year: 2020

We revisit the use of Stochastic Gradient Descent (SGD) for solving convex optimization problems that serve as highly popular convex relaxations for many important low-rank matrix recovery problems such as \textit{matrix completion}, \textit{phase retrieval}, and more. The computational limitation of applying SGD to solving these relaxations in large-scale is the need to compute a potentially high-rank singular value decomposition (SVD) on each iteration in order to enforce the low-rank-promoting constraint. We begin by considering a simple and natural sufficient condition so that these relaxations indeed admit low-rank solutions. This condition is also necessary for a certain notion of low-rank-robustness to hold. Our main result shows that under this condition which involves the eigenvalues of the gradient vector at optimal points, SGD with mini-batches, when initialized with a "warm-start" point, produces iterates that are low-rank with high probability, and hence only a low-rank SVD computation is required on each iteration. This suggests that SGD may indeed be practically applicable to solving large-scale convex relaxations of low-rank matrix recovery problems. Our theoretical results are accompanied with supporting preliminary empirical evidence. As a side benefit, our analysis is quite simple and short.
Augmenting Visual Question Answering with Semantic Frame Information in a Multitask Learning Approach
Venue: arXiv cs.AI 2020
Year: 2020

Visual Question Answering (VQA) concerns providing answers to Natural Language questions about images. Several deep neural network approaches have been proposed to model the task in an end-to-end fashion. Whereas the task is grounded in visual processing, if the question focuses on events described by verbs, the language understanding component becomes crucial. Our hypothesis is that models should be aware of verb semantics, as expressed via semantic role labels, argument types, and/or frame elements. Unfortunately, no VQA dataset exists that includes verb semantic information. Our first contribution is a new VQA dataset (imSituVQA) that we built by taking advantage of the imSitu annotations. The imSitu dataset consists of images manually labeled with semantic frame elements, mostly taken from FrameNet. Second, we propose a multitask CNN-LSTM VQA model that learns to classify the answers as well as the semantic frame elements. Our experiments show that semantic frame element classification helps the VQA system avoid inconsistent responses and improves performance.
Local intrinsic dimensionality estimators based on concentration of measure
Venue: arXiv cs.LG 2020
Year: 2020

Intrinsic dimensionality (ID) is one of the most fundamental characteristics of multi-dimensional data point clouds. Knowing ID is crucial to choose the appropriate machine learning approach as well as to understand its behavior and validate it. ID can be computed globally for the whole data point distribution, or computed locally in different regions of the data space. In this paper, we introduce new local estimators of ID based on linear separability of multi-dimensional data point clouds, which is one of the manifestations of concentration of measure. We empirically study the properties of these estimators and compare them with other recently introduced ID estimators exploiting various effects of measure concentration. Observed differences between estimators can be used to anticipate their behaviour in practical applications.
Statistical stability indices for LIME: obtaining reliable explanations for Machine Learning models
Venue: arXiv cs.LG 2020
Year: 2020

Nowadays we are witnessing a transformation of the business processes towards a more computation driven approach. The ever increasing usage of Machine Learning techniques is the clearest example of such trend. This sort of revolution is often providing advantages, such as an increase in prediction accuracy and a reduced time to obtain the results. However, these methods present a major drawback: it is very difficult to understand on what grounds the algorithm took the decision. To address this issue we consider the LIME method. We give a general background on LIME then, we focus on the stability issue: employing the method repeated times, under the same conditions, may yield to different explanations. Two complementary indices are proposed, to measure LIME stability. It is important for the practitioner to be aware of the issue, as well as to have a tool for spotting it. Stability guarantees LIME explanations to be reliable, therefore a stability assessment, made through the proposed indices, is crucial. As a case study, we apply both Machine Learning and classical statistical techniques to Credit Risk data. We test LIME on the Machine Learning algorithm and check its stability. Eventually, we examine the goodness of the explanations returned.