In several cases, a sequence of free cumulants that counts certain binary plane trees corresponds to classical the decreasing versions same trees. Using two new operations on we call insertion and decomposition, prove this surprising phenomenon holds for families troupes. We give simple characterization troupes, showing they are plentiful. Troupes provide broad framework generalizing results kn...

Forth is a stack machine that represents a good match for the register stack of the Explicit Parallel Instruction Computer (EPIC) architecture. In this paper we will introduce a new calling mechanism using the register stack to implement a Forth system more efficiently. Based upon our performance measurements, we will show that the new calling mechanism is a promising technique to improve the p...

Pushdown systems are a model of computation equipped with one stack where only the top of the stack is inspected and modified in each step of transitions. Although this is a natural restriction, some extensions of pushdown systems require more general operations on stack: conditional pushdown systems inspect the whole stack contents and discrete timed pushdown systems increment the ages of the ...

We consider magnetic oscillations of the critical current in stacks of intrinsic Josephson junctions. Depending on junction lateral size and magnetic field, oscillations may have either the period of half a flux quantum per junction (wide-stack regime) or one flux quantum per junction (narrow-stack regime). For junctions with lateral sizes of the order of several Josephson lengths, the stack cr...

In this paper, we present an optimized implementation of secure VoIP protocol stack so that the stack would fit into the memory and computation budget of constrained embedded systems. The novel approach that we take to achieve this is to perform cross-layer optimization of buffers and buffer operations. Buffers and buffer operations are involved in playback, capture, codec transformations, and ...

We show a novel execution method of queries over structural data. We present the idea in detail on SBQL (a.k.a. AOQL)—a powerful language with clean semantics. SBQL stands for the Stack-Based Query Language. The stack used in its name and semantics is a heavy and centralised structure which makes parallel and stream processing unfeasible. We propose to process stack-based queries without a stac...

In this paper, we describe a novel algorithm to create a concurrent wait-free stack. To the best of our knowledge, this is the first wait-free algorithm for a general purpose stack. In the past, researchers have proposed restricted wait-free implementations of stacks, lock-free implementations, and efficient universal constructions that can support wait-free stacks. The crux of our wait-free im...

Currently, protocol stacks operate in various contexts and it is therefore not possible to know the required properties of a stack (both functional and non-functional) in advance. The stack has to be dynamically built up from components, based on the requirements and the momentary situation. The first step in building the stack is to determine the component types to be used and the stack archit...

Thermoacoustic engines (TAEs) are devices which convert heat energy into useful acoustic work whereas thermoacoustic refrigerators (TARs) convert acoustic work into temperature gradient. These devices work without any moving component. Study presented here comprises of a combination system i.e. thermoacoustic engine driven thermoacoustic refrigerator (TADTAR). This system has no moving componen...

In previous work, we presented a Typed Assembly Language (TAL). TAL is sufficiently expressive to serve as a target language for compilers of high-level languages such as ML. This work assumed such a compiler would perform a continuation-passing style transform and eliminate the control stack by heap-allocating activation records. However, most compilers are based on stack allocation. This pape...