Inventory replenishment rules contribute significantly to the bullwhip effect and inventory instability in supply chains. Smoothing replenishment rules have been suggested as a mitigation solution for the bullwhip effect but dampening the bullwhip effect might increase inventory instability. This paper evaluates a real-time inventory replenishment system denoted as SPC that utilizes a control c...

In this paper, for effective multi-echelon supply chains under stochastic and fuzzy environments, an inventory management framework and deterministic/stochastic-neuro-fuzzy cost models within the context of this framework are structured. Then, a numerical application in a three-echelon tree-structure chain is presented to show the applicability and performance of proposed framework. It can be s...

We present a simple SSA construction algorithm, which allows direct translation from an abstract syntax tree or bytecode into an SSA-based intermediate representation. The algorithm requires no prior analysis and ensures that even during construction the intermediate representation is in SSA form. This allows the application of SSA-based optimizations during construction. After completion, the ...

A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in computational biology to compare evolutionary histories of species. In this paper we present a formulation of two related combinatorial embedding problems concerning tanglegrams in terms of CNF-formulas. The first problem is known as planar embedding ...

In the previous papers [4], [5], the author gave several completeness and incompleteness results on some predicate extensions with the constant domain of intermediate and modal propositional logics by means of the theory of canonical formulas (cf. [1]). However, these results are on subframe and cofinal subframe logics, and little is known for non cofinal subframe logics. In this note, we show ...

Rivcst [5] defines the notion of a decision list as a representation for Boolean functions. He shows that k-decision lists, a generalization of k-CNF and k-DNF formulas, are learnable for constant k in the PAC (or distribution-free) learning model [&,3]. Ehrenfcucht and Haussler [l] define the notion of the rank of a decision tree, and prove that decision trees of constant rank are also learnab...

The topological structure of a CNF formula can be represented as a hypergraph, where the vertices of the hypergraph correspond to the variables of the CNF and the hyperedges correspond to the clauses. Given a small treewidth tree decomposition for a hypergraph of a CNF formula, a variety of methods are known for deciding its satisfiability. In this paper we report on our effort to learn whether...

We profile the occurrence of clausal extraposition in corpora from different domains and demonstrate that extraposition is a pervasive phenomenon in German that must be addressed in German sentence realization. We present two different approaches to the modeling of extraposition, both based on machine learned decision tree classifiers. The two approaches differ in their view of the movement ope...

Syntax Trees (ASTs) We view a BNF grammar to define a collection of abstract syntax trees, for example: