We study the combinatorial FIFO stack-up problem. In delivery industry, bins have to be stacked-up from conveyor belts onto pallets with respect to customer orders. Given k sequences q1, . . . , qk of labeled bins and a positive integer p, the aim is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto an initially empty pallet of unbounded capaci...

in this research the simulation of an air independent proton exchange membrane fuel cell (pemfc) propulsion system was taken into consideration. the system consists of several parts including pem fuel cell stack, metal hydride and liquid oxygen (lox) tanks, and also pre-heaters of oxygen and hydrogen gases along with other heat exchangers, to ensure proper operation of system. the heat recovery...

"Multi-Protocol Label Switching (MPLS)" [1] requires a set of procedures for augmenting network layer packets with "label stacks", thereby turning them into "labeled packets". Routers which support MPLS are known as "Label Switching Routers", or "LSRs". In order to transmit a labeled packet on a particular data link, an LSR must support an encoding technique which, given a label stack and a net...

A unidirectional heap is a heap where all pointers go in one direction, e.g. from newer to older objects. For a strict functional language , such as Erlang, the heap may be arranged so that it is unidirec-tional. We here present a compacting garbage collection algorithm which utilizes the fact that a heap is unidirectional. Only one memory space is used in our algorithm. In fact, no extra memor...

There are infinite sequences of graphs {Gn} where |Gn| = n such that the minimal dominating sets for H × Gi fall into predictable patterns, in light of which γ(Gn × H) may be nearly linear in n; the coefficient of linearity may be regarded as the average density of the dominating set in the H-fibers of the product. The specific cases where the sequence {Gn} consists of cycles or path is explore...

The Java Virtual Machine (Jvm) needs, for the purpose of garbage collection (GC), to determine the data type stored in every memory location. Jvms that can do this reliably are said to be type-accurate (TA). Full typeaccuracy usually exacts a price in performance due to the need to scan stacks and registers accurately. The mostly accurate approach presented here can reduce the TA overhead signi...

This paper presents a generic addressing framework (GAF) which enables the development of protocol stack independent applications. This framework has been developed in the context of dynamic protocol stack composition [8]. Having a way to compose [8][7] and build [3] protocol stacks is not sufficient. The protocol layers a stack is composed of have an impact on the addressing used inside the st...