Optimal Paths and Costs of Adjustment in Dynamic DEA Models: With Application to Chilean Department Stores

In this paper we propose a range of dynamic data envelopment analysis (DEA) models which allow information on costs of adjustment to be incorporated into the DEA framework. We first specify a basic dynamic DEA model predicated on a number or simplifying assumptions. We then outline a number of extensions to this model to accommodate asymmetric adjustment costs, non-static output quantities, non-static input prices, and non-static costs of adjustment, technological change, quasi-fixed inputs and investment budget constraints. The new dynamic DEA models provide valuable extra information relative to the standard static DEA models-they identify an optimal path of adjustment for the input quantities, and provide a measure of the potential cost savings that result from recognising the costs of adjusting input quantities towards the optimal point. The new models are illustrated using data relating to a chain of 35 retail department stores in Chile. The empirical results illustrate the wealth of information that can be derived from these models, and clearly show that static models overstate potential cost savings when adjustment costs are non-zero.

Steiner triple systems with two disjoint subsystems

It is shown that there exists a triangle decomposition of the graph obtained from the complete graph of order v by removing the edges of two vertex disjoint complete subgraphs of orders u and w if and only if u, w, and v are odd, ((v)(2)) - ((u)(2)) - ((w)(2)) equivalent to 0 (mod 3), and v >= w + u + max {u, w}. Such decompositions are equivalent to group divisible designs with block size 3, one group of size u, one group of size w, and v - u - w groups of size 1. This result settles the existence problem for Steiner triple systems having two disjoint specified subsystems, thereby generalizing the well-known theorem of Doyen and Wilson on the existence of Steiner triple systems with a single specified subsystem. (c) 2005 Wiley Periodicals, Inc.

Timing analysis of assembler code control-flow paths

Timinganalysis of assembler code is essential to achieve the strongest possible guarantee of correctness for safety-critical, real-time software. Previous work has shown how timingconstrain ts on controlflow paths through high-level language programs can be formalised using the semantics of the statements comprisingthe path. We extend these results to assembler-level code where it becomes possible to not only determine timingconstrain ts, but also to verify them against the known execution times for each instruction. A minimal formal model is developed with both a weakest liberal precondition and a strongest postcondition semantics. However, despite the formalism’s simplicity, it is shown that complex timingb ehaviour associated with instruction pipeliningand iterative code can be modelled accurately.

Programs as paths: An approach to timing constraint analysis

A program can be decomposed into a set of possible execution paths. These can be described in terms of primitives such as assignments, assumptions and coercions, and composition operators such as sequential composition and nondeterministic choice as well as finitely or infinitely iterated sequential composition. Some of these paths cannot possibly be followed (they are dead or infeasible), and they may or may not terminate. Decomposing programs into paths provides a foundation for analyzing properties of programs. Our motivation is timing constraint analysis of real-time programs, but the same techniques can be applied in other areas such as program testing. In general the set of execution paths for a program is infinite. For timing analysis we would like to decompose a program into a finite set of subpaths that covers all possible execution paths, in the sense that we only have to analyze the subpaths in order to determine suitable timing constraints that cover all execution paths.

Multiple conduction paths in boron δ-doped diamond structures

Impedance spectroscopy has been used to investigate conductivity within boron-doped diamond in an intrinsic/delta-doped/intrinsic (i-d-i) multilayer structure. For a 5 nm thick delta layer, three conduction pathways are observed, which can be assigned to transport within the delta layer and to two differing conduction paths in the i-layers adjoining the delta layer. For transport in the i-layers, thermal trapping/detrapping processes can be observed, and only at the highest temperature investigated (673 K) can transport due to a single conduction process be seen. Impedance spectroscopy is an ideal nondestructive tool for investigating the electrical characteristics of complex diamond structures.

How transition paths differ:enterprise performance in Russia and China

We use enterprise survey data to analyse and contrast the determinants of enterprise performance in China and Russia. We find that in China, enterprise growth and efficiency is associated with rapid increases in factor inputs, and with ownership to a lesser extent, but not greatly correlated with industry-specific or institutional factors. However, in Russia, enterprise growth is not associated with improvements in factor quantity (except for labor) or quality. The main determinants of company performance are instead demand and institutional factors at a regional level. The findings are robust across a variety of specifications.

Paths of the least resistance:understanding how motives form in international retail joint venturing

Developing the premise that strategies are forged through an ongoing mutual process of developing motives and responses to multiple degrees of resistance, this paper examines the motives underpinning the adoption of joint venture strategies using empirical details from four British retail firms. The findings point to multiple motives forming from multiple paths of resistance in the foreign market, but also among individuals within the firm as well as across the whole international programme. Moreover, this study reveals a paradoxical tension between management's operational impatience to immediately ground the retail format and an overall wariness or gloomy perceptions associated with adopting an international retail joint venture. The paper therefore concludes that the motives and barriers are manifestations of the struggles involved in internationalising retail operations.

Competition for shortest paths on sparse graphs

Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of a nonlinear overlap cost that penalizes congestion. Routing becomes more difficult as the number of selected nodes increases and exhibits ergodicity breaking in the case of multiple routers. The ground state of such systems reveals nonmonotonic complex behaviors in average path length and algorithmic convergence, depending on the network topology, and densities of communicating nodes and routers. A distributed linearly scalable routing algorithm is also devised. © 2012 American Physical Society.