Deriving gradient algorithms for time-dependent neural network structures typically requires numerous chain rule expansions, diligent bookkeeping, and careful manipulation of terms. In this paper, we show how to use the principle of Network Reciprocity to derive such algorithms via a set of simple block diagram manipulation rules. The approach provides a common framework to derive popular algor...

We introduce the essential inputs (variables) for terms (trees) and tree automata. It is proved that if an input xi is essential for a tree t and an automaton A then there is a chain of subtrees connecting xi with the root of t such that xi is essential for each subtree belonging to this chain. There are investigations which treat some rules for removing and adding of fictive (non-essential) in...

This paper adopts agent-based simulation to study the horizontal competition among homogenous price-setting retailers in a one-to-many supply chain (a supply chain consists of one supplier and multiple retailers). We model the supplier and retailers as agents, and design their behavioral rules respectively. The results show that although the agents learn individually based on their own experien...

In a multi-tiered E-Business application, database access control can be implemented in the application tier or in the database tier or in both. We describe the advantages of Application Service Provider-based Supply Chain Management and present a much simplified database schema for this application. Common user queries which provide input to decision making systems relevant to supply chain opt...

In this paper we proposed a block cryptosystem based on 1d-k5 Chain C CA, by alternatively iterating leftand right-toggle chain rules, this kind of encryption is achieved by backward iteration and decryption is realized via forward iteration. From theory proof, we can ensure the security of the cryptosystem, and make mostly confusion and diffusion function. Experimant shows that this cryptosyst...

Given a strongly stationary Markov chain (discrete or continuous) and a finite set of stopping rules, we show a noncombinatorial method to compute the law of stopping. Several examples are presented. The problem of embedding a graph into a larger but minimal graph under some constraints is studied. Given a connected graph, we show a noncombinatorial manner to compute the law of a first given pa...

We propose an integrated supply chain management framework that allows us to explicitly consider the impact of product perishability on a broad scale that includes manufacturers, distribution centers, wholesalers, and demand markets. The framework proposed herein also makes it possible to consider the oligopolistic competition across wholesalers that drives price and demand fluctuations. Furthe...

A chain rule and a subadditivity for the entropy of type β, which is one of the nonextensive (nonadditive) entropies, were derived by Z.Daróczy. In this paper, we study the further relations among Tsallis type entropies which are typical nonextensive entropies. We show some inequalities related to Tsallis entropies, especially the strong subadditivity for Tsallis type entropies and the subaddit...

We present a generalization of the scalar importance function employed by Metropolis Light Transport (MLT) and related Markov chain rendering algorithms. Although MLT is known for its user-designable mutation rules, we demonstrate that its scalar contribution function is similarly programmable in an unbiased manner. Normally, MLT samples light paths with a tendency proportional to their brightn...

This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejection chains create powerful compound moves within Local Search algorithms. Their potential to yield state of the art algorithms has been validated for the traveling salesman problem (TSP), for example. We show how ejection chain...