SearcharxivSearch

arXiv subjects

Prateek

Publications and source records attributed to Prateek.

4 recordsLinked to original sources

Continuous Algebra: Algebraic Semantics for Continuous Propositional Logic

We present algebraic semantics for Continuous Propositional Logic, CPL, introduced by Itai Ben Yaacov, viewed as {\L}ukasiewicz propositional logic with a reversed truth-falsity orientation and enriched by a unary halving connective. We introduce continuous algebras as MV-algebras together with an unary operator $\kappa$ analogous to the halving operator introduced in CPL and analyze their core structural properties, including ideals, quotient constructions, and subdirect representations. We further establish a correspondence between continuous algebras and the class of 2-divisible $\ell u$-groups, extending Mundici's representation theory to the continuous setting. This correspondence leads to a purely algebraic proof of the weak completeness theorem for CPL.

math.LO

Zutu: A Platform for Localization and Navigation of Swarm Robots Using Virtual Grids

Swarm robots, which are inspired from the way insects behave collectively in order to achieve a common goal, have become a major part of research with applications involving search and rescue, area exploration, surveillance etc. In this paper, we present a swarm of robots that do not require individual extrinsic sensors to sense the environment but instead use a single central camera to locate and map the swarm. The robots can be easily built using readily available components with the main chassis being 3D printed, making the system low-cost, low-maintenance, and easy to replicate. We describe Zutu's hardware and software architecture, the algorithms to map the robots to the real world, and some experiments conducted using four of our robots. Eventually, we conclude the possible applications of our system in research, education, and industries.

cs.RO

CONTRACTFIX: A Framework for Automatically Fixing Vulnerabilities in Smart Contracts

The increased adoption of smart contracts in many industries has made them an attractive target for cybercriminals, leading to millions of dollars in losses. Thus, deploying smart contracts with detected vulnerabilities (known to developers) are not acceptable, and fixing all the detected vulnerabilities is needed, which incurs high manual labor cost without effective tool support. To fill this need, in this paper, we propose ContractFix, a novel framework that automatically generates security patches for vulnerable smart contracts. ContractFix is a general framework that can incorporate different fix patterns for different types of vulnerabilities. Users can use it as a security fix-it tool that automatically applies patches and verifies the patched contracts before deploying the contracts. To address the unique challenges in fixing smart contract vulnerabilities, given an input smart contract, \tool conducts our proposed ensemble identification based on multiple static verification tools to identify vulnerabilities that are amenable for automatic fix. Then, ContractFix generates patches using template-based fix patterns and conducts program analysis (program dependency computation and pointer analysis) for smart contracts to accurately infer and populate the parameter values for the fix patterns. Finally, ContractFix performs static verification that guarantees the patched contract is free of vulnerabilities. Our evaluations on $144$ real vulnerable contracts demonstrate that \tool can successfully fix $94\%$ of the detected vulnerabilities ($565$ out of $601$) and preserve the expected behaviors of the smart contracts.

cs.SE

Placement Of Energy Aware Wireless Mesh Nodes For E-Learning In Green Campuses

Energy efficiency solutions are more vital for Green Mesh Network (GMN) campuses. Today students are benefited using these e-learning methodologies. Renewable energies such as solar, wind, hydro has tremendous applications on energy efficient wireless networks for sustaining the ever growing traffic demands. One of the major issues in designing a GMN is minimizing the number of deployed mesh routers and gateways and satisfying the sustainable QOS based energy constraints. During low traffic periods the mesh routers are switched to power save or sleep mode. In this paper we have mathematically formulated a single objective function with multi constraints to optimize the energy. The objective is to place minimum number of Mesh routers and gateways in a set of candidate location. The mesh nodes are powered using the solar energy to meet the traffic demands. Two global optimisation algorithms are compared in this paper to optimize the energy sustainability, to guarantee seamless connectivity.

cs.NI