Introducing Inter Relatedness between Wikipedia Articles in Explicit Semantic Analysis

Explicit Semantic Analysis (ESA) is a technique used to represent a piece of text as a vector in the space of concepts, such as Articles found in Wikipedia . We propose a methodology to incorporate knowledge of Inter-relatedness betweenWikipedia Articles to the vectors obtained from ESA using a technique calledRetrofitting to improve the performance of subsequent tasks that use ESA to form vector embeddings .…

Fast Class wise Updating for Online Hashing

Online image hashing has received increasing research attention recently, which processes large-scale data in a streaming fashion to update the hashfunctions on-the-fly . A novel supervised online hashing scheme, termed Fast Class-wiseUpdating for Online Hashing, is proposed to address the above two challenges by introducing a novel and efficient inner product operation .…

Diversifying Relevant Phrases

Diverse keyword suggestions for a given landing page or matching queries todiverse documents is an active research area in online advertising . Modern search engines provide advertisers with products like Dynamic Search Ads andSmart Campaigns where they extract meaningful keywords/phrases from theadvertiser’s product inventory .…

Image sets of perfectly nonlinear maps

We present a lower bound on the image size of a $d$-uniform map, $d\geq 1$ of finite fields . We show that any almost-3-to-1 quadratic map is APN,if $n$ is even . We also show that anon-bijective almost bent map contains at most $2^n-2^{(n-1)/2) elements .…

Further strengthening of upper bounds for perfect k Hashing

An important asymptotic upper bound for general $k$ was derived by Fredmanand Koml\’os in the ’80s . In this paper, we further improve the bounds for $5\leq k \leq 8$ Themethod we use, which depends on the reduction of an optimization problem to afinite number of cases, shows that further results might be obtained by refined arguments at the expense of higher complexity .…

Trade offs in Decentralized Multi Antenna Architectures The WAX Decomposition

As the number of antennas increases the computational complexity required to process data using centralizedarchitectitectures become prohibitively high . Decentralized architectures can reduce the requirements by pre-processing the data before it arrives at a central processing unit (CPU) However, performing decentralized processing introducesalso cost in complexity/interconnection bandwidth at the antenna end which isin general being ignored .…

SuperCoder Program Learning Under Noisy Conditions From Superposition of States

A new method of program learning in a Domain Specific Language is based on gradient descent with no direct search . The method surpasses the state-of-the-art forsynthesising long programs and is able to learn programs under noise . The first component of our method is anattention-based recurrent neural network, which provides an appropriateinitialization point for the gradient descent that optimizes the probabilisticrepresentation of the DSL variables .…

Difference restriction algebras of partial functions with operators discrete duality and completion

We exhibit an adjunction between abstract algebras of partialfunctions and a category of set quotients . We show that the monad induced by our adjunctionyields the compatible completion of any atomic representable algebra . We then extend these adjunction,duality, and completion results to representable algebraas equipped witharbitrary additional completely additive and compatibility preservingoperators .…

Combined Sieve Algorithm for Prime Gaps

A new Combined Sieve algorithm is presented with cost proportional to thenumber of enumerated factors over a series of intervals . This algorithmachieves a significant speedup, over a traditional sieve, when handling many [10^4, 10^7] intervals concurrently . In real world tests, this new algorithm regularly runs 10,000x faster .…

A Comparative Evaluation of Population based Optimization Algorithms for Workflow Scheduling in Cloud Fog Environments

This work presents a comparative evaluation of four population-basedoptimization algorithms for workflow scheduling in cloud-fog environments . These algorithms are as follows: Particle Swarm Optimization (PSO), GeneticAlgorithm (GA), Differential Evolution (DE) and GA-PSO . Future work will include expansion of the workflows used by increasing the number of tasks as well as adding some more workflows .…

Edge assisted Democratized Learning Towards Federated Analytics

Federated Analytics (FA) reuses the Federated Learning (FL) infrastructure to evaluate the population-level summary of model performances . The current realization of FL adopts single server-multiple clientarchitecture with limited scope for FA . We need to design a robust learning mechanism than the FL that unleashes a viable infrastructure for FA and trains learning models with better generalization capability .…

Designing Voice Controllable APIs

The main purpose of a voice command system is to process a sentence innatural language and perform the corresponding action . This mapping is usually performed after the API is already implemented, possibly by other programmers . In this paper, we describe how the API developercan use patterns to map sentences to API calls by utilizing the similarities between names and types in the sentences and the API .…

TracerX Dynamic Symbolic Execution with Interpolation

Dynamic Symbolic Execution (DSE) is an important method for the testing of programs . We present anew interpolation algorithm and implement it on top of the KLEE system . The main objective is to address the path explosion problem in pursuit of codepenetration: to prove that a target program point is either reachable orunreachable .…

HPM Frame A Decision Framework for Executing Software on Heterogeneous Platforms

Heterogeneous computing is one of the most important computational solutionsto meet rapidly increasing demands on system performance . The refactoring of systems forexecution on such platforms is highly desired but also difficult to perform . We have identified a current need for asystematic approach that supports engineers in the refactororing process — from CPU-centric applications to software that is executed on heterogeneousplatforms .…

Evaluation of Reusability in Aspect Oriented Software using Inheritance Metrics

Aspect-Oriented Software Development (AOSD) is a promising methodology forefficiently capturing the cross-cutting functionalities (concerns) as independent units called aspects . Inheritance of classes and aspects play avital role in defining the units of encapsulation . It is essential toquantitatively capture the impact of inheritance in AOSD using design levelmetrics and to infer on the higher level quality attribute, reusability .…

Deep Gravity enhancing mobility flows generation with deep neural networks and geographic information

There is increasing interest around the challenging problem offlow generation, which consists in generating the flows between a set ofgeographic locations, given the characteristics of the locations and without any information about the real flows . Existing solutions to flow generation are mainly based on mechanistic approaches, such as the gravity model and theradiation model, which suffer from underfitting and overdispersion .…

On the Equivalence Between High Order Network Influence Frameworks General Threshold Hypergraph Triggering and Logic Triggering Models

In this paper, we study several high-order network-influence-propagationframeworks . In one framework, we use hyperedges to represent many-to-one influence — collectiveinfluence of a group of nodes on another node . We prove that theBoolean-function triggering model, even with refined details of influencelogic, is equivalent to the hypergraph triggering model and the general threshold model .…

Independence of the Fundamental Equation of the Oscillation Model on Algebraic Representations Social Media Echo Chamber Effect

In the oscillation model that describes the user dynamics of online social networks, it is known that the fundamental equation can explicitly describe the relationship between the network structure and user dynamics . The fundamental equation uses algebra that satisfies the anti-commutation relation, and its matrix representation is not unique .…

How cumulative is technological knowledge

The cumulativeness of a technology is characterized by the structure of its knowledge base, which is different from, but closely related to, the size of the knowledge base . We find that across technologies, this rate isversely related to the rate of invention over time .…

Enabling collaborative data science development with the Ballet framework

Ballet is a lightweight software framework for collaborative open-source data science and a cloud-based environment, with a plugin for collaborative feature engineering . We present a novel ML programming model to address the challenges of scaling data science collaborations . We use Ballet to conduct an extensive case study analysis of a real-worldincome prediction problem, and discuss implications for collaborative projects.…

Multi Agent Maximization of a Monotone Submodular Function via Maximum Consensus

Constrained submodular set function maximization problems often appear inmulti-agent decision-making problems with a discrete feasible set . However, submodul set function optimization problems are known to beNP-hard . Our objective is to obtain adistributed suboptimal polynomial-time algorithm that enables each agent to obtain its respective policy via local interactions with its neighboring agents .…