The Multiverse Logical Modularity for Proof Assistants

Proof assistants play a dual role as programming languages and logical systems . We propose the multiverse, ageneral type-theoretic approach to endow proof assistants with logical modularity . The multiverse consists of multiple universe hierarchies that describe the reasoning principles and effects available to define a term at a given type .…

Understanding the Basis of Graph Convolutional Neural Networks via an Intuitive Matched Filtering Approach

Graph Convolutional Neural Networks (GCNN) are becoming a preferred model for data processing on irregular domains . Their analysis and principles of operation are rarely examined due to the black box nature of NNs . We show that their convolution layerseffectively perform matched filtering of input data with the chosen patterns(features) This allows us to provide a unifying account of GCNNs through amatched filter perspective .…

ZS SLR Zero Shot Sign Language Recognition from RGB D Videos

Sign Language Recognition (SLR) is a challenging research area in computervision . To tackle the annotation bottleneck in SLR, we formulate a two-stream model . We use two vision Transformer models, for humandetection and visual features representation . We configure a transformerencoder-decoder architecture, as a fast and accurate human detection model, toovercome the challenges of the current human detection models.…

On the Queue Number of Partial Orders

Heath and Pemmaraju conjectured that every poset ofwidth $w$ has queue-number at most $w$. Alam et al. constructed posets of width $w+1 with queue-numbers $w-+$ . Our contribution is a construction of posets with width $W$ with $Omega(w^2) This asymptotically matches the known upper bound .…

Approximation and parameterized algorithms to find balanced connected partitions of graphs

Partitioning a connected graph into $k$~vertex-disjoint connected subgraph is a classical problem that has been intensivelyinvestigated since late seventies . We propose a simplepseudo-polynomial $\frac{k}{2}$-approximation algorithm for the same problem with running-time $O(|V|^3|E|/\varepsilon) We also propose a fixed-parameter tractable algorithmbased on integer linear programming for the unweighted $text{max-min BCP}_k$parameterized by the size of a vertical cover .…

Expressing and Executing Informed Consent Permissions Using SWRL The All of Us Use Case

The informed consent process is a complicated procedure involving permissions as well a variety of entities and actions . In this paper, we discuss the use ofSemantic Web Rule Language (SWRL) to further extend the Informed ConsentOntology (ICO) We present four use cases of permissions from the All of Usinformed consent document and translate these permissions into SWRL expressionsto extend and operationalize ICO .…

A User Study on Hybrid Graph Visualizations

Hybrid visualizations mix different metaphors in a single layout of anetwork . The popular NodeTrix model combines node-link diagrams and matrix-based representations . The results of our study provide interesting indications about advantages/drawbacks of the considered models on performing classical tasks of analysis.…

Approximation and parameterized algorithms to find balanced connected partitions of graphs

Partitioning a connected graph into $k$~vertex-disjoint connected subgraph is a classical problem that has been intensivelyinvestigated since late seventies . We propose a simplepseudo-polynomial $\frac{k}{2}$-approximation algorithm for the same problem with running-time $O(|V|^3|E|/\varepsilon) We also propose a fixed-parameter tractable algorithmbased on integer linear programming for the unweighted $text{max-min BCP}_k$parameterized by the size of a vertical cover .…

Learning Sparse Analytic Filters for Piano Transcription

filterbank learning has become an increasingly popular strategy for various audio-related machine learning tasks . We build upon a standard pianotranscription model, modifying only the feature extraction stage . The filterbank module is designed such that its complex filters are unconstrained1D convolutional kernels with long receptive fields .…

A Simplicial Model for KB4_n Epistemic Logic with Agents that May Die

The standard semantics of multi-agent epistemic logic $S5$ is based on Kripkemodels whose accessibility relations are reflexive, symmetric and transitive . This one dimensional structure contains implicit higher-dimensional information beyond pairwise interactions, that has been formalized as pure simplicialmodels . Here we extend the theory toencompass all simplicial models – including those that are not pure .…

Geometric Amortization of Enumeration Algorithms

In this paper, we introduce the technique of geometric amortization forenumeration algorithms . This technique can be used to make the delay of enumeration algorithms more regular without much overhead on the space it uses . We show that, using geometricamortization, such an algorithm can be transformed into an algorithm with delay$O(p\log K)$ and $O(s\logK)$ space .…

Medical Graphs in Patient Information Systems in Primary Care

Graphs are very effective tools in visualizing information and are used in many fields including the medical field . In most developing countries primarycare, graphs are used to monitor child growth . These measures are therefore often displayed using line graphs, basing it on three indicators (stunting,underweight and wasting) based on the WHO 2006 Child Growth Standard .…

On Specialization of a Program Model of Naive Pattern Matching in Strings Extended Abstract

We have proved that for any pattern p the tail recursive program model ofnaive pattern matching may be automatically specialized w.r.t. the pattern p to a specialized version of the so-called KMP-algorithm, using the Higman-Kruskalrelation that controls the unfolding/folding . Given an input string, theresponding residual program finds the first occurrence of p in the string in linear time on the string length .…

Network control by a constrained external agent as a continuous optimization problem

Social science studies dealing with control in networks typically resort toheuristics or describing the static control distribution . Optimal policies require interventions that optimize control over a socioeconomicnetwork subject to real-world constraints . We integrate optimisation tools from deep-learning with network science into a framework that is able to optimizes interventions in real-life networks .…

The complexity of high dimensional cuts

Cut problems form one of the most fundamental classes of problems in algorithm theory . For general complexes, we show that THS is W[1] hard with respect to the solution size $k$. We also define a problem called Boundary Nontrivialization (BNT) We provide randomized (approximation) FPT algorithms for the globalvariants of THS and BNT .…

Artificial Intelligence in the Global South AI4D Potential and Risks

Artificial intelligence is becoming more widely available in all parts of the world . This paper examines the key issues and questions arising in the emergingsub-field of AI for global development (AI4D) We propose that although there are many risks associated with the use of AI, the potential benefits are enough to warrant detailed research and investigation of the most appropriate and effective ways to design, develop, implement, and use such technologies in the Global South .…

A Systematic Approach to Cleaning Routine Health Surveillance Datasets An Illustration Using National Vector Borne Disease Control Programme Data of Punjab India

Advances in ICT4D and data science facilitate systematic, reproducible, andscalable data cleaning for strengthening routine health information systems . Alogic model for data cleaning was used and it included an algorithm forscreening, diagnosis, and editing datasets in a rule-based, interactive, andsemi-automated manner .…

The Moderating Effect of Gender on Adopting Digital Government Innovations in Ethiopia

Digital government innovation is being recognised as a solution to many problems faced by governments in providing services to their citizens . It is especially important for low-income countries where there are resource constraints . Research was aimed at exploring the moderating effect of gender on the adoption of a digital government innovation in Ethiopia based on the UTAUT model (n=270) and using structural equation modeling (SEM) The results reveal that gender only moderates the relationship between facilitatingconditions and usage behavior of government employees to adopt the digitalgovernment innovation which is inconsistent with other findings .…

The complexity of high dimensional cuts

Cut problems form one of the most fundamental classes of problems in algorithm theory . For general complexes, we show that THS is W[1] hard with respect to the solution size $k$. We also define a problem called Boundary Nontrivialization (BNT) We provide randomized (approximation) FPT algorithms for the globalvariants of THS and BNT .…

Primal and Dual Combinatorial Dimensions

We give tight bounds on relation between the primal and dual of variouscombinatorial dimensions . These dimensional notions play animportant role in the area of learning theory . In particular, we give an appropriate generalization to multi-valued function classes of awell-known bound due to Assouad (1983), that relates the primal .…

No DBA No regret Multi armed bandits for index tuning of analytical and HTAP workloads with provable guarantees

Automating physical database design has remained a long-term interest indatabase research due to substantial performance gains afforded by optimisedstructures . We propose a self-driving approach to online index selection that eschews the DBA and query optimiser, and instead learns the benefits of viable structuresthrough strategic exploration and direct performance observation .…

On Specialization of a Program Model of Naive Pattern Matching in Strings Extended Abstract

We have proved that for any pattern p the tail recursive program model ofnaive pattern matching may be automatically specialized w.r.t. the pattern p to a specialized version of the so-called KMP-algorithm, using the Higman-Kruskalrelation that controls the unfolding/folding . Given an input string, theresponding residual program finds the first occurrence of p in the string in linear time on the string length .…

Gender based occupational segregation a bit string approach

Gender-based occupational segregation has been suggested as one of the most important determinants of the still existing gender wage gap . Despite somesigns of a decreasing trend, there is evidence that occupational genderedsegregation is persistent . Using an agent-based model we provide aframework that introduces discriminatory behavior based on labour market theories of discrimination .…

A Simplicial Model for KB4_n Epistemic Logic with Agents that May Die

The standard semantics of multi-agent epistemic logic $S5$ is based on Kripkemodels whose accessibility relations are reflexive, symmetric and transitive . This one dimensional structure contains implicit higher-dimensional information beyond pairwise interactions, that has been formalized as pure simplicialmodels . Here we extend the theory toencompass all simplicial models – including those that are not pure .…

On a Tverberg graph

For a graph whose vertices are closed, consider the closed (open) balls with diameters induced by its edges . The graphis called a (an open) Tverberg graph) if these closed balls intersect . For any finite set of points in the plane, there exists a Hamiltonian cycle that is a Tverberberg graph .…