OpenRaiser/Intern-Atlas huggingface dataset:
Simulating Raga Notes with a Markov Chain of Order 1-2
Venue: arXiv cs.SD 2018
Year: 2018

Semi Natural Algorithmic composition (SNCA) is the technique of using algorithms to create music note sequences in computer with the understanding that how to render them would be decided by the composer. In our approach we are proposing an SNCA2 algorithm (extension of SNCA algorithm) with an illustrative example in Raga Bageshree. For this, Transition probability matrix (tpm) was created for the note sequences of Raga Bageshree, then first order Markov chain (using SNCA) and second order Markov chain (using SNCA2) simulations were performed for generating arbitrary sequences of notes of Raga Bageshree. The choice between first and second order Markov model, is best left to the composer who has to decide how to render these music notes sequences. We have confirmed that Markov chain of order of three and above are not promising, as the tpm of these become sparse matrices.
On Robot Revolution and Taxation
Venue: arXiv cs.CY 2018
Year: 2018

Advances in artificial intelligence are resulting in the rapid automation of the work force. The tools that are used to automate are called robots. Bill Gates proposed that in order to deal with the problem of the loss of jobs and reduction of the tax revenue we ought to tax the robots. The problem with taxing the robots is that it is not easy to know what a robot is. This article studies the definition of a robot and the implication of advances in robotics on taxation. It is evident from this article that it is a difficult task to establish what a robot is and what is not a robot. It concludes that taxing robots is the same as increasing corporate tax.
3D Conceptual Design Using Deep Learning
Venue: arXiv cs.CV 2018
Year: 2018

This article proposes a data-driven methodology to achieve a fast design support, in order to generate or develop novel designs covering multiple object categories. This methodology implements two state-of-the-art Variational Autoencoder dealing with 3D model data. Our methodology constructs a self-defined loss function. The loss function, containing the outputs of certain layers in the autoencoder, obtains combination of different latent features from different 3D model categories. Additionally, this article provide detail explanation to utilize the Princeton ModelNet40 database, a comprehensive clean collection of 3D CAD models for objects. After convert the original 3D mesh file to voxel and point cloud data type, we enable to feed our autoencoder with data of the same size of dimension. The novelty of this work is to leverage the power of deep learning methods as an efficient latent feature extractor to explore unknown designing areas. Through this project, we expect the output can show a clear and smooth interpretation of model from different categories to develop a fast design support to generate novel shapes. This final report will explore 1) the theoretical ideas, 2) the progresses to implement Variantional Autoencoder to attain implicit features from input shapes, 3) the results of output shapes during training in selected domains of both 3D voxel data and 3D point cloud data, and 4) our conclusion and future work to achieve the more outstanding goal.
A Multi-task Framework for Skin Lesion Detection and Segmentation
Venue: arXiv cs.CV 2018
Year: 2018

Early detection and segmentation of skin lesions is crucial for timely diagnosis and treatment, necessary to improve the survival rate of patients. However, manual delineation is time consuming and subject to intra- and inter-observer variations among dermatologists. This underlines the need for an accurate and automatic approach to skin lesion segmentation. To tackle this issue, we propose a multi-task convolutional neural network (CNN) based, joint detection and segmentation framework, designed to initially localize the lesion and subsequently, segment it. A `Faster region-based convolutional neural network' (Faster-RCNN) which comprises a region proposal network (RPN), is used to generate bounding boxes/region proposals, for lesion localization in each image. The proposed regions are subsequently refined using a softmax classifier and a bounding-box regressor. The refined bounding boxes are finally cropped and segmented using `SkinNet', a modified version of U-Net. We trained and evaluated the performance of our network, using the ISBI 2017 challenge and the PH2 datasets, and compared it with the state-of-the-art, using the official test data released as part of the challenge for the former. Our approach outperformed others in terms of Dice coefficients ($>0.93$), Jaccard index ($>0.88$), accuracy ($>0.96$) and sensitivity ($>0.95$), across five-fold cross validation experiments.
Hybrid Subspace Learning for High-Dimensional Data
Venue: arXiv cs.LG 2018
Year: 2018

The high-dimensional data setting, in which p >> n, is a challenging statistical paradigm that appears in many real-world problems. In this setting, learning a compact, low-dimensional representation of the data can substantially help distinguish signal from noise. One way to achieve this goal is to perform subspace learning to estimate a small set of latent features that capture the majority of the variance in the original data. Most existing subspace learning models, such as PCA, assume that the data can be fully represented by its embedding in one or more latent subspaces. However, in this work, we argue that this assumption is not suitable for many high-dimensional datasets; often only some variables can easily be projected to a low-dimensional space. We propose a hybrid dimensionality reduction technique in which some features are mapped to a low-dimensional subspace while others remain in the original space. Our model leads to more accurate estimation of the latent space and lower reconstruction error. We present a simple optimization procedure for the resulting biconvex problem and show synthetic data results that demonstrate the advantages of our approach over existing methods. Finally, we demonstrate the effectiveness of this method for extracting meaningful features from both gene expression and video background subtraction datasets.
Where The Light Gets In: Analyzing Web Censorship Mechanisms in India
Venue: arXiv cs.CY 2018
Year: 2018

This paper presents a detailed study of the Internet censorship in India. We consolidated a list of potentially blocked websites from various public sources to assess censorship mechanisms used by nine major ISPs. To begin with, we demonstrate that existing censorship detection tools like OONI are grossly inaccurate. We thus developed various techniques and heuristics to correctly assess censorship and study the underlying mechanism involved in these ISPs. At every step we corroborated our finding manually to test the efficacy of our approach, a step largely ignored by others. We fortify our findings by adjudging the coverage and consistency of censorship infrastructure, broadly in terms of average number of network paths and requested domains the infrastructure surveils. Our results indicate a clear disparity among the ISPs, on how they install censorship infrastructure. For instance, in Idea network we observed the censorious middleboxes on over 90% of our tested intra-AS paths whereas for Vodafone, it is as low as 2.5%. We conclude our research by devising our own novel anti-censorship strategies, that does not depend on third party tools (like proxies, Tor and VPNs etc.). We managed to anti-censor all blocked websites in all ISPs under test.
Scaling notifications beyond alerts: from subtly drawing attention up to forcing the user to take action
Venue: arXiv cs.HC 2018
Year: 2018

New computational devices, in particular wearable devices, offer the unique property of always being available and thus to be able to constantly update the user with information, such as by notifications. While research has been done in sophisticated notifications, devices today mainly stick to a binary level of information, while they are either attention drawing or silent. In this paper, we want to go further and propose scalable notifications, which adjust the intensity reaching from subtle to obtrusive and even going beyond that level, while forcing the user to take action. To illustrate the technical feasibility and validity of this concept, we developed three prototypes providing mechano-pressure, thermal, and electrical feedback and evaluated them in different lab studies. Our first prototype provides subtle poking through to high and frequent pressure on the user's spine, which creates a significantly improved back posture. In a second scenario, the users are enabled to perceive the overuse of a drill by an increased temperature on the palm of a hand until the heat is intolerable and the users are forced to eventually put down the tool. The last project comprises a speed control in a driving simulation, while electric muscle stimulation on the users' legs conveys information on changing the car's speed by a perceived tingling until the system independently forces the foot to move. Although our selected scenarios are long way from being realistic, we see these lab studies as a means to validate our proof-of-concept. In conclusion, all studies' findings support the feasibility of our concept of a scalable notification system, including the system of forced intervention. While we envisage the implementation of our proof-of-concept into future wearables, more realistic application scenarios are worthy of exploration.
Scalability Analysis of a LoRa Network under Imperfect Orthogonality
Venue: arXiv cs.IT 2018
Year: 2018

Low-power wide-area network (LPWAN) technologies are gaining momentum for internet-of-things (IoT) applications since they promise wide coverage to a massive number of battery-operated devices using grant-free medium access. LoRaWAN, with its physical (PHY) layer design and regulatory efforts, has emerged as the widely adopted LPWAN solution. By using chirp spread spectrum modulation with qausi-orthogonal spreading factors (SFs), LoRa PHY offers coverage to wide-area applications while supporting high-density of devices. However, thus far its scalability performance has been inadequately modeled and the effect of interference resulting from the imperfect orthogonality of the SFs has not been considered. In this paper, we present an analytical model of a single-cell LoRa system that accounts for the impact of interference among transmissions over the same SF (co-SF) as well as different SFs (inter-SF). By modeling the interference field as Poisson point process under duty-cycled ALOHA, we derive the signal-to-interference ratio (SIR) distributions for several interference conditions. Results show that, for a duty cycle as low as 0.33%, the network performance under co-SF interference alone is considerably optimistic as the inclusion of inter-SF interference unveils a further drop in the success probability and the coverage probability of approximately 10% and 15%, respectively for 1500 devices in a LoRa channel. Finally, we illustrate how our analysis can characterize the critical device density with respect to cell size for a given reliability target.
On Optimizing Deep Convolutional Neural Networks by Evolutionary Computing
Venue: arXiv cs.NE 2018
Year: 2018

Optimization for deep networks is currently a very active area of research. As neural networks become deeper, the ability in manually optimizing the network becomes harder. Mini-batch normalization, identification of effective respective fields, momentum updates, introduction of residual blocks, learning rate adoption, etc. have been proposed to speed up the rate of convergent in manual training process while keeping the higher accuracy level. However, the problem of finding optimal topological structure for a given problem is becoming a challenging task need to be addressed immediately. Few researchers have attempted to optimize the network structure using evolutionary computing approaches. Among them, few have successfully evolved networks with reinforcement learning and long-short-term memory. A very few has applied evolutionary programming into deep convolution neural networks. These attempts are mainly evolved the network structure and then subsequently optimized the hyper-parameters of the network. However, a mechanism to evolve the deep network structure under the techniques currently being practiced in manual process is still absent. Incorporation of such techniques into chromosomes level of evolutionary computing, certainly can take us to better topological deep structures. The paper concludes by identifying the gap between evolutionary based deep neural networks and deep neural networks. Further, it proposes some insights for optimizing deep neural networks using evolutionary computing techniques.
Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability
Venue: arXiv cs.DS 2018
Year: 2018

A matched formula is a CNF formula whose incidence graph admits a matching which matches a distinct variable to every clause. We study phase transition in a context of matched formulas and their generalization of biclique satisfiable formulas. We have performed experiments to find a phase transition of property "being matched" with respect to the ratio $m/n$ where $m$ is the number of clauses and $n$ is the number of variables of the input formula $φ$. We compare the results of experiments to a theoretical lower bound which was shown by Franco and Gelder (2003). Any matched formula is satisfiable, moreover, it remains satisfiable even if we change polarities of any literal occurrences. Szeider (2005) generalized matched formulas into two classes having the same property -- var-satisfiable and biclique satisfiable formulas. A formula is biclique satisfiable if its incidence graph admits covering by pairwise disjoint bounded bicliques. Recognizing if a formula is biclique satisfiable is NP-complete. In this paper we describe a heuristic algorithm for recognizing whether a formula is biclique satisfiable and we evaluate it by experiments on random formulas. We also describe an encoding of the problem of checking whether a formula is biclique satisfiable into SAT and we use it to evaluate the performance of our heuristic
Blockchain Queueing Theory
Venue: arXiv cs.CE 2018
Year: 2018

Blockchain has many benefits including decentralization, availability, persistency, consistency, anonymity, auditability and accountability, and it also covers a wide spectrum of applications ranging from cryptocurrency, financial services, reputation system, Internet of Things, sharing economy to public and social services. Not only may blockchain be regarded as a by-product of Bitcoin cryptocurrency systems, but also it is a type of distributed ledger technology through using a trustworthy, decentralized log of totally ordered transactions. By summarizing the literature of blockchain, it is found that more papers focus on engineering implementation and realization, while little work has been done on basic theory, for example, mathematical models (Markov processes, queueing theory and game models), performance analysis and optimization of blockchain systems. In this paper, we develop queueing theory of blockchain systems and provide system performance evaluation. To do this, we design a Markovian batch-service queueing system with two different service stages, while the two stages are suitable to well express the mining process in the miners pool and the building of a new blockchain. By using the matrix-geometric solution, we obtain a system stable condition and express three key performance measures: (a) The number of transactions in the queue, (b) the number of transactions in a block, and (c) the transaction-confirmation time. Finally, We use numerical examples to verify computability of our theoretical results. Although our queueing model is simple under exponential or Poisson assumptions, our analytic method will open a series of potentially promising research in queueing theory of blockchain systems.
Metal Artifact Reduction in Cone-Beam X-Ray CT via Ray Profile Correction
Venue: arXiv cs.CV 2018
Year: 2018

In computed tomography (CT), metal implants increase the inconsistencies between the measured data and the linear attenuation assumption made by analytic CT reconstruction algorithms. The inconsistencies give rise to dark and bright bands and streaks in the reconstructed image, collectively called metal artifacts. These artifacts make it difficult for radiologists to render correct diagnostic decisions. We describe a data-driven metal artifact reduction (MAR) algorithm for image-guided spine surgery that applies to scenarios in which a prior CT scan of the patient is available. We tested the proposed method with two clinical datasets that were both obtained during spine surgery. Using the proposed method, we were not only able to remove the dark and bright streaks caused by the implanted screws but we also recovered the anatomical structures hidden by these artifacts. This results in an improved capability of surgeons to confirm the correctness of the implanted pedicle screw placements.
Geospatial Analysis and Internet of Things in Environmental Informatics
Venue: arXiv cs.CY 2018
Year: 2018

Geospatial analysis offers large potential for better understanding, modelling and visualizing our natural and artificial ecosystems, using Internet of Things as a pervasive sensing infrastructure. This paper performs a review of research work based on the IoT, in which geospatial analysis has been employed in environmental informatics. Six different geospatial analysis methods have been identified, presented together with 26 relevant IoT initiatives adopting some of these techniques. Analysis is performed in relation to the type of IoT devices used, their deployment status and data transmission standards, data types employed, and reliability of measurements. This paper scratches the surface of this combination of technologies and techniques, providing indications of how IoT, together with geospatial analysis, are currently being used in the domain of environmental research.
Two Practical Random-Subcarrier-Selection Methods for Secure Precise Wireless Transmission
Venue: arXiv cs.IT 2018
Year: 2018

In secure precise directional modulation (DM) networks, two practical random-subcarrier-selection (RSS) methods are proposed to transmit confidential message to the desired user per orthogonal frequency division multiplexing (OFDM) symbol with only single receive power peak formed by constructing random subcarrier set and performing a randomization procedure. This scheme completely addresses the crucial problem facing secure precise wireless transmission (SPWT), how to achieve the SPWT per OFDM symbol while the traditional SPWT holds only in statistically average sense. Several necessary conditions for SPWT per OFDM is derived and proposed: randomly distributed, sparse, and distinct subcarrier distance between two pair of adjacent antennas. Two random subcarrier sets (RSSs), quadratic subcarrier set (QSS) and prime subcarrier set (PSS), are constructed, where the former means the subcarrier index associated with any antennas is the square of antenna index, and the latter implies that the subcarrier indices over all antennas are prime numbers. Subsequently, following those conditions for SPWT per OFDM, a random factor is defined, and a randomization procedure (RP) is proposed. Its detailed process includes the following steps: integer mod, ordering, blocking, and block interleaving where BI is repeated until the random factor is greater than the predefined threshold. This yields a single main receive energy peak (SMREP) at the desired position with other positions, outside the SMREP, harvesting only weak receive energy seriously corrupted by AN.
Accurate indoor mapping using an autonomous unmanned aerial vehicle (UAV)
Venue: arXiv cs.RO 2018
Year: 2018

An autonomous indoor aerial vehicle requires reliable simul- taneous localization and mapping (SLAM), accurate flight control, and robust path planning for navigation. This paper presents a system level combination of these existing technologies for 2D navigation. An Unmanned aerial vehicle (UAV) called URSA (Unmanned Recon and Safety Aircraft) that can autonomously flight and mapping indoors environments with an accuracy of 2 cm was developed. Performance in indoor environments was assessed in terms of mapping and navigation precision.
Sunlight Enabled Vehicle Detection by LED Street Lights
Venue: arXiv cs.OH 2018
Year: 2018

We propose and demonstrate a preliminary traffic sensing system based on the widely distributed LED street lights. The system utilizes and discriminates the photoelectric responses of the LEDs to sunlight when a vehicle moves through the LEDs' field of view aiming at the road. A data vector is constructed from the consecutively collected time samples of a moving observation window, and a support vector machine (SVM) based learning algorithm is subsequently developed to classify the presence of a vehicle. Finally, we build a simulated platform to experimentally evaluate the performance of the vehicle detection algorithm.
Bionic Reflex Control Strategy for Robotic Finger with Kinematic Constraints
Venue: arXiv cs.SY 2018
Year: 2018

This paper presents a bionic reflex control strategy for a kinematically constrained robotic finger. Here, the bionic reflex is achieved through a force tracking impedance control strategy. The dynamic model of the finger is reduced subject to kinematic constraints. Thereafter, an impedance control strategy that allows exact tracking of forces is discussed. Simulation results for a single finger holding a rectangular object against a flat surface are presented. Bionic reflex response time is of the order of milliseconds.
Automated Extraction of Personal Knowledge from Smartphone Push Notifications
Venue: arXiv cs.IR 2018
Year: 2018

Personalized services are in need of a rich and powerful personal knowledge base, i.e. a knowledge base containing information about the user. This paper proposes an approach to extracting personal knowledge from smartphone push notifications, which are used by mobile systems and apps to inform users of a rich range of information. Our solution is based on the insight that most notifications are formatted using templates, while knowledge entities can be usually found within the parameters to the templates. As defining all the notification templates and their semantic rules are impractical due to the huge number of notification templates used by potentially millions of apps, we propose an automated approach for personal knowledge extraction from push notifications. We first discover notification templates through pattern mining, then use machine learning to understand the template semantics. Based on the templates and their semantics, we are able to translate notification text into knowledge facts automatically. Users' privacy is preserved as we only need to upload the templates to the server for model training, which do not contain any personal information. According to our experiments with about 120 million push notifications from 100,000 smartphone users, our system is able to extract personal knowledge accurately and efficiently.
Directed Random Geometric Graphs
Venue: arXiv cs.SI 2018
Year: 2018

Many real-world networks are intrinsically directed. Such networks include activation of genes, hyperlinks on the internet, and the network of followers on Twitter among many others. The challenge, however, is to create a network model that has many of the properties of real-world networks such as powerlaw degree distributions and the small-world property. To meet these challenges, we introduce the \textit{Directed} Random Geometric Graph (DRGG) model, which is an extension of the random geometric graph model. We prove that it is scale-free with respect to the indegree distribution, has binomial outdegree distribution, has a high clustering coefficient, has few edges and is likely small-world. These are some of the main features of aforementioned real world networks. We empirically observe that word association networks have many of the theoretical properties of the DRGG model.