Search results for "Operation"

Joint Route Planning under Varying Market Conditions

2006

Purpose - To provide empirical evidence on the level of savings that can be attained by joint route planning and how these savings depend on specific market characteristics.Design/methodology/approach - Joint route planning is a measure that companies can take to decrease the costs of their distribution activities. Essentially, this can either be achieved through horizontal cooperation or through outsourcing distribution to a Logistics Service Provider. The synergy value is defined as the difference between distribution costs in the original situation where all entities perform their orders individually, and the costs of a system where all orders are collected and route schemes are set up s…

Fostering novelty while reducing failure: Balancing the twin challenges of product innovation

2016

This paper aims to further our understanding of how the degrees of innovation novelty and innovation failure are connected. It argues that a better understanding of the specific predictors of innovation novelty and failure would improve our understanding of the innovation process and inform R&D managerial interventions to reduce the occurrences of failure and enhance radical innovation. This investigation draws on data on 5387 Spanish manufacturing firms from the 2009 Spanish Community Innovation Survey (CIS). Unlike prior studies which examine product innovation, degree of innovation novelty, and innovation failures in separate models, this study relies on a multivariate model to account f…

Prediction of Tool Wear in Machining

2007

Multi-directional vs. mono-directional multi-step strategies for single point incremental forming of non-axisymmetric components

2020

Abstract Multi Stage approach is used in Single Point Incremental Forming (SPIF) to overcome one of the main forming limitations, namely the maximum wall angle, characterizing the single stage process. In this paper, different multi-path strategies for the production of parts with flat edges are considered in order to evaluate the best solution in terms of feasibility and geometrical accuracy of the final part: A) mono-directional incremental draw angle; B) mono-directional incremental draw angle with increasing part side; C) Multi-directional approach with non-horizontal path planes. Strain evaluation by means of CGA (Circular Grid Analysis) and defect analysis have been carried out in ord…

Topological Logics with Connectedness over Euclidean Spaces

2013

We consider the quantifier-free languages, Bc and Bc °, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected interior. These languages are interpreted over the regular closed sets of R n ( n ≥ 2) and, additionally, over the regular closed semilinear sets of R n . The resulting logics are examples of formalisms that have recently been proposed in the Artificial Intelligence literature under the rubric Qualitative Spatial Reasoning. We prove that the satisfiability problem for Bc is undecidable over the regular closed semilinear sets in all dimensions greater than 1,…

Functions definable by numerical set-expressions

2011

A "numerical set-expression" is a term specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. If these operations are confined to the usual Boolean operations together with the result of lifting addition to the level of sets, we speak of "additive circuits". If they are confined to the usual Boolean operations together with the result of lifting addition and multiplication to the level of sets, we speak of "arithmetic circuits". In this paper, we investigate the definability of sets and functions by means of additive and arithmetic circuits, occasionally augmented with additional operations.

Nash codes for noisy channels

2012

This paper studies the stability of communication protocols that deal with transmission errors. We consider a coordination game between an informed sender and an uninformed decision maker, the receiver, who communicate over a noisy channel. The sender's strategy, called a code, maps states of nature to signals. The receiver's best response is to decode the received channel output as the state with highest expected receiver payoff. Given this decoding, an equilibrium or "Nash code" results if the sender encodes every state as prescribed. We show two theorems that give sufficient conditions for Nash codes. First, a receiver-optimal code defines a Nash code. A second, more surprising observati…

Some complexity and approximation results for coupled-tasks scheduling problem according to topology

2016

International audience; We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain,. . .). In such a context, we design some efficient polynomial-time approximation algorithms for an intractable scheduling problem according to some parameters.

Computational Limitations of Affine Automata

2019

We present two new results on the computational limitations of affine automata. First, we show that the computation of bounded-error rational-values affine automata is simulated in logarithmic space. Second, we give an impossibility result for algebraic-valued affine automata. As a result, we identify some unary languages (in logarithmic space) that are not recognized by algebraic-valued affine automata with cutpoints.

Quantum, stochastic, and pseudo stochastic languages with few states

2014

Stochastic languages are the languages recognized by probabilistic finite automata (PFAs) with cutpoint over the field of real numbers. More general computational models over the same field such as generalized finite automata (GFAs) and quantum finite automata (QFAs) define the same class. In 1963, Rabin proved the set of stochastic languages to be uncountable presenting a single 2-state PFA over the binary alphabet recognizing uncountably many languages depending on the cutpoint. In this paper, we show the same result for unary stochastic languages. Namely, we exhibit a 2-state unary GFA, a 2-state unary QFA, and a family of 3-state unary PFAs recognizing uncountably many languages; all th…