Connection, Trust, and Commitment: Dimensions of Co-creation?

The purpose of this research is to identify a key driver of relationship closeness for service organizations. Based upon the co-creation concept from Service-Dominant Logic, connection is proposed as a new construct rooted in emotional attachment that bolsters the effect of trust and commitment on future intention among customers of a service-intense organization. Causal models are verified with a large empirical sample drawn from an organization in the process of dealing with the increasing sense of depersonalization that has afflicted growing organizations in a variety of industries. The paper distinguishes an important dimension of customer relationships that can be affected by service managers in order to enhance customer loyalty and satisfaction

Socio-Economic Sourcing: Benefits of Small Business Set-Asides in Public Procurement

Purpose Small businesses are critical to economic health and encouraged in government spending by set-asides – annual small business sourcing goals that often are not attained. Little research has explored the negative and risky stigmas associated with small business sourcing. Design/methodology/approach This research explores reduced transaction costs of small business sourcing to government buyers. A survey of 350 government source selections reveals lower transaction costs derived from lower perceived risk of receiving a bid protest and via more efficient source selection processes. Findings Contrary to common bias, the performance level of small businesses is no less than that of large business. Thus, small businesses engender lower transaction costs for correcting supplier’s performance. On the basis of these findings, managerial and theoretical implications are discussed

On the Non-existence of 3-Dimensional Tiling in the Lee Metric

AbstractWe prove that there does not exist a tiling with Lee spheres of radius at least 2 in the 3-dimensional Euclidean space. In particular, this result verifies a conjecture of Golomb and Welch forn=3

Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms

The local minimum degree of a graph is the minimum degree that can be reached by means of local complementation. For any n, there exist graphs of order n which have a local minimum degree at least 0.189n, or at least 0.110n when restricted to bipartite graphs. Regarding the upper bound, we show that for any graph of order n, its local minimum degree is at most 3n/8+o(n) and n/4+o(n) for bipartite graphs, improving the known n/2 upper bound. We also prove that the local minimum degree is smaller than half of the vertex cover number (up to a logarithmic term). The local minimum degree problem is NP-Complete and hard to approximate. We show that this problem, even when restricted to bipartite graphs, is in W[2] and FPT-equivalent to the EvenSet problem, which W[1]-hardness is a long standing open question. Finally, we show that the local minimum degree is computed by a O*(1.938^n)-algorithm, and a O*(1.466^n)-algorithm for the bipartite graphs

Current-induced two-level fluctuations in pseudo spin-valves (Co/Cu/Co) nanostructures

Two-level fluctuations of the magnetization state of pseudo spin-valve pillars Co(10 nm)/Cu(10 nm)/Co(30 nm) embedded in electrodeposited nanowires (~40 nm in diameter, 6000 nm in length) are triggered by spin-polarized currents of 10^7 A/cm^2 at room temperature. The statistical properties of the residence times in the parallel and antiparallel magnetization states reveal two effects with qualitatively different dependences on current intensity. The current appears to have the effect of a field determined as the bias field required to equalize these times. The bias field changes sign when the current polarity is reversed. At this field, the effect of a current density of 10^7 A/cm^2 is to lower the mean time for switching down to the microsecond range. This effect is independent of the sign of the current and is interpreted in terms of an effective temperature for the magnetization.Comment: 4 pages, 5 figures, revised version, to be published in Phys. Rev. Let

Spin-dependent transport in cluster-assemblednanostructures: influence of cluster size and matrix material

Abstract.: Spin-dependent transport in granular metallic nanostructures has been investigated by means of a thermoelectric measurement. Cobalt clusters of well-defined size (〈n〉 = 15-600) embedded in copper and silver matrices show magnetic field responses of up to several hundred percent at low temperature. The experimental observations are attributed to spin mixing. The influence of cluster size and matrix are discusse

The Parameterized Complexity of Domination-type Problems and Application to Linear Codes

We study the parameterized complexity of domination-type problems. (sigma,rho)-domination is a general and unifying framework introduced by Telle: a set D of vertices of a graph G is (sigma,rho)-dominating if for any v in D, |N(v)\cap D| in sigma and for any $v\notin D, |N(v)\cap D| in rho. We mainly show that for any sigma and rho the problem of (sigma,rho)-domination is W[2] when parameterized by the size of the dominating set. This general statement is optimal in the sense that several particular instances of (sigma,rho)-domination are W[2]-complete (e.g. Dominating Set). We also prove that (sigma,rho)-domination is W[2] for the dual parameterization, i.e. when parameterized by the size of the dominated set. We extend this result to a class of domination-type problems which do not fall into the (sigma,rho)-domination framework, including Connected Dominating Set. We also consider problems of coding theory which are related to domination-type problems with parity constraints. In particular, we prove that the problem of the minimal distance of a linear code over Fq is W[2] for both standard and dual parameterizations, and W[1]-hard for the dual parameterization. To prove W[2]-membership of the domination-type problems we extend the Turing-way to parameterized complexity by introducing a new kind of non deterministic Turing machine with the ability to perform `blind' transitions, i.e. transitions which do not depend on the content of the tapes. We prove that the corresponding problem Short Blind Multi-Tape Non-Deterministic Turing Machine is W[2]-complete. We believe that this new machine can be used to prove W[2]-membership of other problems, not necessarily related to dominationComment: 19 pages, 2 figure

Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets

An identifying code of a (di)graph $G$ is a dominating subset $C$ of the vertices of $G$ such that all distinct vertices of $G$ have distinct (in)neighbourhoods within $C$. In this paper, we classify all finite digraphs which only admit their whole vertex set in any identifying code. We also classify all such infinite oriented graphs. Furthermore, by relating this concept to a well known theorem of A. Bondy on set systems we classify the extremal cases for this theorem

Fermi-Edge Singularities in AlxGa1-xAs Quantum Wells : Extrinsic Versus Many-Body Scattering Processes

A Fano resonance mechanism is evidenced to control the formation of optical Fermi-edge singularities in multi-subband systems such as remotely doped AlxGa1-xAs heterostructures. Using Fano parameters, we probe the physical nature of the interaction between Fermi-sea electrons and empty conduction subbands. We show that processes of extrinsic origin like alloy-disorder prevail easily at 2D over multiple diffusions from charged valence holes expected by many-body scenarios.Comment: 4 pages, 3 figures, accepted for publication in Physical Review Letter

Periodic harmonic functions on lattices and points count in positive characteristic

This survey addresses pluri-periodic harmonic functions on lattices with values in a positive characteristic field. We mention, as a motivation, the game "Lights Out" following the work of Sutner, Goldwasser-Klostermeyer-Ware, Barua-Ramakrishnan-Sarkar, Hunzikel-Machiavello-Park e.a.; see also 2 previous author's preprints for a more detailed account. Our approach explores harmonic analysis and algebraic geometry over a positive characteristic field. The Fourier transform allows us to interpret pluri-periods of harmonic functions on lattices as torsion multi-orders of points on the corresponding affine algebraic variety.Comment: These are notes on 13p. based on a talk presented during the meeting "Analysis on Graphs and Fractals", the Cardiff University, 29 May-2 June 2007 (a sattelite meeting of the programme "Analysis on Graphs and its Applications" at the Isaac Newton Institute from 8 January to 29 June 2007