,4 simple implementation of doubleended priority queues is presented. The proposed structure, called a min-max heap, can be built in linear time; in contrast to conventional heaps, it allows both FindMin and FindMax to be performed in constant time; Insert, DeleteMin, and DeleteMax operations can be performed in logarithmic time. Min-max heaps can be generalized to support other similar order-s...

In the field of algorithmic analysis, one of the more well-known exercises is the subset sum problem. That is, given a set of integers, determine whether one or more integers in the set can sum to a target value. Aside from the brute-force approach of verifying all combinations of integers, several solutions have been found, ranging from clever uses of various data structures to computationally...

To prepare activated carbons with a high porosity and low ash content from pyrolyzed rice husk, the method of KOH or K2CO3 solution leaching after CO2 activation was investigated. The effects of KOH or K2CO3 concentration and leaching time on the yield, ash content, and textural properties of the activated carbon were studied, and the activated carbon prepared under the best conditions was char...

Leaching of calcium ions increases the porosity of cement-based materials, consequently resulting in a negative effect on durability since it provides an entry for aggressive harmful ions, causing reinforcing steel corrosion. This study investigates the effects of leaching behavior of calcium ions on the compression and durability of cement-based materials. Since the parameters influencing the ...

Dumitrescu [arXiv:1607.07673] describes a data structure referred to as a Selectable Sloppy Heap. We present a simplified approach, and also point out aspects of Dumitrescu’s exposition that require scrutiny.

In this paper we present a new heap abstraction that seeks to strike a balance between the use of non-local (transitive) properties to gain precision and exploiting heap-locality. The abstraction represents the heap as an (evolving) tree of heapcomponents, with only a single heap-component being accessible at any time. The representation is tailored to yield several benefits: (a) It localizes t...

Heap spraying is a security attack that increases the exploitability of memory corruption errors in type-unsafe applications. In a heap-spraying attack, an attacker coerces an application to allocate many objects containing malicious code in the heap, increasing the success rate of an exploit that jumps to a location within the heap. Because heap layout randomization necessitates new forms of a...

keywords: Automated theorem proving, rst-order clauses with equality. Abstract We provide a standard abstract architecture around which high-performance theorem provers for full clausal logic with equality can be built. A WAM-like heap structure for storing terms (as DAG's, with structure sharing) and several substitution trees Gra95b] are central in the architecture. These two data structures ...

This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic specifications are particular first-order formulae with constrained algebraic structure, called patterns. Program configurations satisfy patterns iff they match their algebraic structure and satisfy their constraints. Using a sim...