## CLEDGE A Hybrid Cloud Edge Computing Framework over Information Centric Networking

Edge computing has emerged as a prominentigm for low-latency data processing . Certain latency-sensitive processing operations may need to be performed at the edge, while delay-tolerant operations can be performed on the cloud . CLEDGE (CLoud + EDGE) aims to maximize the on-time completion of tasks offloaded by applications with diverse latency requirements .…

## Facilitating Meta Theory Reasoning Invited Paper

Structural proof theory is praised for being a symbolic approach to reasoning . For this to be possible, proof systems must be designed as a set of rules . Therefore, one must consider all ways these rules can interact and prove that they satisfy certain properties which makes them “well-behaved” Meta-theory proofs typically involve many cases on structures with lots ofsymbols .…

## Pilot Study Suggests Online Media Literacy Programming Reduces Belief in False News in Indonesia

Online training materials and educational videos were more likely to identify misinformation than those in our controlgroup (total $N$=1000) Given the promising results of our preliminary study, we plan to expand efforts in this area, and build upon lessons learned from this pilot study .…

## Recommending best course of treatment based on similarities of prognostic markers

The goal of this paper is topropose collaborative filtering based recommender system in the healthcare sector to recommend remedies based on the symptoms experienced by the patients . A new dataset is developed consisting of remedies concerning diseases to address the limited availability of the data .…

## Touring the MetaCoq Project Invited Paper

MetaCoq aims to provide the first fully-certified realistic implementation of a type checker for the full calculus underlying the Coq proofassistant . We show how theoretical tools such as bidirectional type-checking, Tait-Martin-L\”of/Takahashi’s confluence proof technique and monadic anddependently-typed programming can help construct the following artefacts: aspecification of Coq’s syntax and type theory, the Polymorphic Cumulative CumulativeCalculus of (Co)-Inductive Constructions (PCUIC); a monad for the manipulation of raw syntax and interaction with Coq system; a verification of PCUIC’smetatheory, whose main results are the confluence of reduction, typepreservation and principality of typing; a realistic, correct and completetype-checker for PCIC .…

## Towards a Human Values Dashboard for Software Development An Exploratory Study

There is a growing awareness of the importance of human values in software systems . We argue that a tool that can identify human values from softwaredevelopment artefacts can (partially) address this gap . Our study finds that a human values dashboard would be useful for the development team (e.g.,…

## Future Intelligent Autonomous Robots Ethical by Design Learning from Autonomous Cars Ethics

Development of the intelligent autonomous robot technology presupposes its beneficial effect on the individuals and societies . In the case of disruptive emergent technology, not only questions of how to build, but also why to build and with what consequences are important .…

## Verified Mutable Data Structures

Formal verification is the only form of sofware testing that can guarantee the absence of bugs . The implementation we propose is based on the LongMap of the Scala standard library with some minor adaptations . We give the specification withrespect to an implementation of a map based on a list of tuples, that we .plement…

## Bidding and Pricing in Budget and ROI Constrained Markets

In online advertising markets, setting budget and return on investment (ROI) constraints are two prevalent ways to help advertisers (i.e. buyers) utilizelimited monetary resources efficiently . In this work, we provide a holistic view of ROI and budget constrained markets .…

## Adelfa A System for Reasoning about LF Specifications

We present a system called Adelfa that provides mechanized support for reasoning about specifications developed in the Edinburgh Logical Framework orLF . Typing judgements in LF are represented by atomic formulas in L_LF and quantification is permitted overcontexts and terms that appear in such formulas .…

## EnergySaver Software Manual

Energy Saver is a software that monitors electric energy consumption from data capture to consumption forecast for the following month . It uses Open Source technologies applied to the internet of Things (IoT), embedded systems, and Long Short-Term Memory NeuralNetworks (LSTM) The software has as its objective the monitoring of electricenergy consumption .…

## MD Simulation of Hundred Billion Metal Atom Cascade Collision on Sunway Taihulight

MISA-MD is a new implementation of molecular dynamics . It uses a hash-based structure to efficiently store an atom and find its neighbors . Compared with a state-of-the-art MD program LAMMPS, it requires less memory usage andachieve better computational performance .…

## Countability of Inductive Types Formalized in the Object Logic Level

The set of integer number lists with finite length, and the set of binary trees with integer labels are countably infinite . Many inductively definedtypes also have countably many elements . In this paper, we formalize the syntaxof first order inductive definitions in Coq and prove them countable, undersome side conditions .…

## Wasserstein Distances Geodesics and Barycenters of Merge Trees

This paper presents a unified computational framework for estimation of distances, geodesics and barycenters of merge trees . We extend recent work on the edit distance [106] and introduce a new metric, called the Wassersteindistance between merge trees, which is purposely designed to enable efficientcomputations .…

## DxHash A Scalable Consistent Hash Based on the Pseudo Random Sequence

Consistent hasing has played a fundamental role as a data router and a loadbalancer in various fields, such as distributed database, cloud infrastructure, and peer-to-peer network . The existing consistent hashing schemescan’t meet the requirements simultaneously, including full consistency,scalability, small memory footprint, low update time and low query complexity .…

## Architecture of Automated Crypto Finance Agent

We present the cognitive architecture of an autonomous agent for active portfolio management in decentralized finance . It involves activities such as asset selection, portfolio balancing, liquidity provision, and trading . Partial implementation of the architecture is provided and supplied with preliminary results .…

## AutoFL Enabling Heterogeneity Aware Energy Efficient Federated Learning

Federated learning enables a cluster of decentralized mobile devices at theedge to collaboratively train a shared machine learning model, while keeping the raw training samples on device . This decentralized training approach isdemonstrated as a practical solution to mitigate the risk of privacy leakage .…

## Towards a Benchmark Set for Program Repair Based on Partial Fixes

A partial fix to a known software issue is a programmer’s failed attempt to fix the issue the first time . The result is abenchmark set of 2204 benchmark tasks for automated program repair based on partial fixes . The benchmark set is available open source and open to further contributions to further improvements and improvement .…

## In Bed Person Monitoring Using Thermal Infrared Sensors

The world is expecting an aging population and shortage of healthcareprofessionals . This poses the problem of providing a safe and dignified lifefor the elderly . Technological solutions involving cameras can contribute to safety, comfort and efficient emergency responses, but they are invasive ofprivacy .…

## Evaluation of Human AI Teams for Learned and Rule Based Agents in Hanabi

Deep reinforcement learning has generated superhuman AI in competitive gamessuch as Go and StarCraft . Can similar learning techniques create a superior AIteammate for human-machine collaborative games? Will humans prefer AI teammatesthat improve objective team performance or those that improve subjectivemetrics of trust?…

## Enhancing Loop Invariant Synthesis via Reinforcement Learning

Loop-invariant synthesis is the basis of every program verificationprocedure . Despite the common belief that the design ofheuristics is vital for the effective performance of a verifier, little work has been performed toward obtaining the optimal heuristics for eachinvarant-synthesis tool .…

## MODRL D EL Multiobjective Deep Reinforcement Learning with Evolutionary Learning for Multiobjective Optimization

This paper proposes a multiobjective deep reinforcementlearning with evolutionary learning algorithm for a typical complex problem called the multiObjective vehicle routing problem with time windows (MO-VRPTW) In the proposed algorithm, the decomposition strategy is applied to generatesubproblems for a set of attention models .…

## On the Extended TSP Problem

We initiate the theoretical study of Ext-TSP, a problem that originates inthe area of profile-guided binary optimization . Given a graph $G=(V, E)$ withpositive edge weights $w: E \rightarrow R^+$ and a non-increasing discountfunction $f(\cdot)$ such that $f(1) = 1$ for $i k$ for someparameter $k$ That is part of the problem definition .…

## MultiBench Multiscale Benchmarks for Multimodal Representation Learning

MultiBench is a systematic and unified large-scale benchmark spanning 15 datasets, 10 modalities, 20 prediction tasks, and 6 research areas . MultiBench provides an automated end-to-end machine learning pipeline that simplifies and standardizes data loading, experimental setup, and model evaluation .…

## Robust Risk Sensitive Reinforcement Learning Agents for Trading Markets

Trading markets are inherently a multiagent domain composed of many actors taking actions and changing theenvironment . To tackle these type of scenarios agents need to exhibit certaincharacteristics such as risk-awareness, robustness to perturbations and lowlearning variance . We propose a family of algorithms that use risk-averse functions and variance reduction techniques .…

## Near Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time

In the numerical linear algebra community, it is thought that to obtain nearly-optimal bounds for various problems such as rank computation and finding a linearly independent subset of columns, regression, low rankapproximation, maximum matching on general graphs and linear matroid union, onewould need to resolve the logarithmic factors in the sketching dimension for existingconstant factor approximation oblivious subspace embeddings .…

## Applying Declarative Analysis to Software Product Line Models An Industrial Study

Software Product Lines (SPLs) are families of related software products developed from a common set of artifacts . Most existing analysis tools can be applied to a single product at a time, but not to an entire SPL . In this paper, we take an existing declarative analysis (behaviouralteration) written in Grok, port it to Datalog, and apply it to a set of automotive software product lines from General Motors .…

## Tableaux for Free Logics with Descriptions

The paper provides a tableau approach to definite descriptions . We focus on formalizations of the so-called minimal free description theory (MFD) The tableau systems formalise MFD based on PFL (positive free logic), NFL (negative free logic) and PQFL (the quasi-free counterparts of the former ones) Also the logic NQFLm is taken into account, which is equivalent to the logic of definedness applied in computer science and constructivemathematics for dealing with partial functions .…

## Interacting Safely with an Unsafe Environment

We give a presentation of Pure type systems where contexts need not bewell-formed . We show that this presentation is equivalent to the usual one . The main motivation for this presentation was that, when we extend Pure type systemswith computation rules, we want to declare constants before the computation rules that are needed to check the type .…

## Developers Task Satisfaction and Performance during the COVID 19 Pandemic

Following onset of the COVID-19 pandemic and subsequent lockdowns, software engineers’ daily life was disrupted and forced intoworking remotely from home . We found that the time software engineers spent doingspecific tasks (e.g., coding, bugfixing, helping others) from home was similarto pre-pandemic times .…

## On the complexity of open shop scheduling with time lags

The minimization of makespan in open shop with time lags has been shownNP-hard in the strong sense even for the case of two machines and unit-time operations . The minimized makespan is NP-hard for weighted completion time or for jobs with release dates .…

## A Functional Programming Language with Versions

Modern software development heavily uses versioned packages, but programming languages rarely support the concept of versions in their semantics . This paper proposes a programming language that intrinsically supports versions . The proposed core calculus, called Lambda VL, has versioned values, each containing different values under different versions .…

## Pseudo labelling Enhanced Media Bias Detection

This paper proposes a simple but effective data augmentation method . It uses pseudo-labelling to select samples from noisy distantsupervision datasets . The result shows that the proposed methodimproves the accuracy of biased news detection models . The proposed method shows that it can be used to improve news detection accuracy .…

## Systematic Translation of Formalizations of Type Theory from Intrinsic to Extrinsic Style

Type theories can be formalized using the intrinsically (hard) or theextrinsically (soft) typed style . In large libraries of type theoreticalfeatures, often both styles are present, which can lead to code duplication and integration issues . We define an operator that systematically translates a hard-typed into thecorresponding soft-typing formulation .…

## Towards a Benchmark Set for Program Repair Based on Partial Fixes

A partial fix to a known software issue is a programmer’s failed attempt to fix the issue the first time . The result is abenchmark set of 2204 benchmark tasks for automated program repair based on partial fixes . The benchmark set is available open source and open to further contributions to further improvements and improvement .…

## Asynchronous games on Petri nets and ATL

We define a game on distributed Petri nets, where several players interact with each other, and with an environment . The players, or users, have perfect knowledge of the current state, and pursue a common goal . Such goal is expressed by Alternating-time Temporal Logic (ATL) The users have a winning strategy if they can cooperate to reach their goal, no matter how the environment behaves .…

## Touring the MetaCoq Project Invited Paper

MetaCoq aims to provide the first fully-certified realistic implementation of a type checker for the full calculus underlying the Coq proofassistant . We show how theoretical tools such as bidirectional type-checking, Tait-Martin-L\”of/Takahashi’s confluence proof technique and monadic anddependently-typed programming can help construct the following artefacts: aspecification of Coq’s syntax and type theory, the Polymorphic Cumulative CumulativeCalculus of (Co)-Inductive Constructions (PCUIC); a monad for the manipulation of raw syntax and interaction with Coq system; a verification of PCUIC’smetatheory, whose main results are the confluence of reduction, typepreservation and principality of typing; a realistic, correct and completetype-checker for PCIC .…

## Park4U Mate Context Aware Digital Assistant for Personalized Autonomous Parking

People park their vehicle depending on interior and exterior contexts, even unconsciously . Park4U Mate is a voice-based in-car assistant that is aware ofinterior and exterior context . The solution was demonstrated to thirty-five users in test-drives and their feedback was collected on the system’s decision-making capability as well as on the human-machine-interaction .…

## Automating Induction by Reflection

In first-orderlogic induction requires an infinite number of axioms, which is not a feasible input to a computer-aided theorem prover requiring a finite input . In this work we introduce a new method, inspired by the field of axiomatictheories of truth, that allows to express schematic inductive definitions .…

## More Robust Dense Retrieval with Contrastive Dual Learning

ContrastiveDual Learning for Approximate Nearest Neighbor (DANCE) is an effective training paradigm for dense retrieval . DANCE incorporates an additionaldual training object of query retrieval, inspired by the classic informationretrieval training axiom, query likelihood . With contrastive learning, the dualtraining object of DANCE learns more tailored representations for queries and documents to keep the embedding space smooth and uniform, thriving on theranking performance of Dance on the MS MARCO document retrieval task .…

## Modeling User Behaviour in Research Paper Recommendation System

User intention which often changes dynamically is considered to be animportant factor for modeling users in the design of recommendation systems . Hybrid Topic Model (HTM) comprising Latent Dirichlet Allocation (LDA) and Word2Vec is proposed toderive the topic of interest of users and the history of preferences .…