Open Access. Powered by Scholars. Published by Universities.®

Social and Behavioral Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Faculty of Engineering and Information Sciences - Papers: Part A

Complete

Publication Year

Articles 1 - 2 of 2

Full-Text Articles in Social and Behavioral Sciences

Novel Algorithms For Complete Targets Coverage In Energy Harvesting Wireless Sensor Networks, Changlin Yang, Kwan-Wu Chin Jan 2014

Novel Algorithms For Complete Targets Coverage In Energy Harvesting Wireless Sensor Networks, Changlin Yang, Kwan-Wu Chin

Faculty of Engineering and Information Sciences - Papers: Part A

This paper addresses the problem of maximizing the network lifetime of rechargeable Wireless Sensor Networks (WSNs) whilst ensuring all targets are monitored continuously by at least one sensor node. The objective is to determine a group of sensor nodes, and their wake-up schedule such that within a time interval, one subset of nodes are active whilst others enter the sleep state to conserve energy as well as recharge their battery. We propose a Linear Programming (LP) based solution to determine the activation schedule of sensor nodes whilst affording them recharging opportunities and at the same time ensures complete target coverage. …


Systems Of Illative Combinatory Logic Complete For First Order Propositional And Predicate Calculus, Henk Barendregt, Martin Bunder, Wil Dekkers Jan 1993

Systems Of Illative Combinatory Logic Complete For First Order Propositional And Predicate Calculus, Henk Barendregt, Martin Bunder, Wil Dekkers

Faculty of Engineering and Information Sciences - Papers: Part A

Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators or, in a more direct way, in which derivations are not translated. Both translations are closely related in a canonical way. The two direct translations turn out to be complete. The paper fulfills the …