Marketing and the Logic of Service: Value Facilitation, Value Creation and Co-creation, and Their Marketing Implications

The discussion of a service-dominant logic has made the findings of decades of service marketing research a topic of interest for marketing at large. Some fundamental aspects of the logic such as value creation and its marketing implications are more complex than they have been treated as so far and need to be further developed to serve marketing theory and practice well. Following the analysis in the present article it is argued that although customers are co-producers in service processes, according to the value-in-use notion adopted in the contemporary marketing and management literature they are fundamentally the creators of value for themselves. Furthermore, it is concluded that although by providing goods and services as input resources into customers’ consumption and value-generating processes firms are fundamentally value facilitators, interactions with customers that exist or can be created enable firms to engage themselves with their customers’ processes and thereby they become co-creators of value with their customers. As marketing implications it is observed that 1) the goal of marketing is to support customers’ value creation, 2) following a service logic and due to the existence of interactions where the firm’s and the customer’s processes merge into an integrated joint value creation process, the firm is not restricted to making value propositions only, but can directly and actively influence the customer’s value fulfilment as well and extend its marketing process to include activities during customer-firm interactions, and 3) although all goods and services are consumed as service, customers’ purchasing decisions can be expected to be dependant of whether they have the skills and interest to use a resource, such as a good, as service or want to buy extended market offerings including process-related elements. Finally, the analysis concludes with five service logic theses.

Distributed computation of fixed points of infinity-nonexpansive maps

The distributed implementation of an algorithm for computing fixed points of an infinity-nonexpansive map is shown to converge to the set of fixed points under very general conditions.

Multipath routing to provide quality of service in mobile ad hoc networks

Because of frequent topology changes and node failures, providing quality of service routing in mobile ad hoc networks becomes a very critical issue. The quality of service can be provided by routing the data along multiple paths. Such selection of multiple paths helps to improve reliability and load balancing, reduce delay introduced due to route rediscovery in presence of path failures. There are basically two issues in such a multipath routing Firstly, the sender node needs to obtain the exact topology information. Since the nodes are continuously roaming, obtaining the exact topology information is a tough task. Here, we propose an algorithm which constructs highly accurate network topology with minimum overhead. The second issue is that the paths in the path set should offer best reliability and network throughput. This is achieved in two ways 1) by choice of a proper metric which is a function of residual power, traffic load on the node and in the surrounding medium 2) by allowing the reliable links to be shared between different paths.

Distributed Simulation Of Flexible Manufacturing Systems

Flexible Manufacturing Systems (FMS), widely considered as the manufacturing technology of the future, are gaining increasing importance due to the immense advantages they provide in terms of cost, quality and productivity over the conventional manufacturing. An FMS is a complex interconnection of capital intensive resources and high levels of system performance is very crucial for survival in a competing environment.Discrete event simulation is one of the most popular methods for performance evaluation of FMS during planning, design and operation phases. Indeed fast simulators are suggested for selection of optimal strategies for flow control (which part type to enter and at what instant), AGV scheduling (which vehicle to carry which part), routing (which machine to process the part) and part selection (which part for processing next). In this paper we develop a C-net based model for an FMS and use the same for distributed discrete event simulation. We illustrate using examples the efficacy of destributed discrete event simulation for the performance evaluation of FMSs.

Linear Coding Schemes for the Distributed Computation of Subspaces

Let X-1,..., X-m be a set of m statistically dependent sources over the common alphabet F-q, that are linearly independent when considered as functions over the sample space. We consider a distributed function computation setting in which the receiver is interested in the lossless computation of the elements of an s-dimensional subspace W spanned by the elements of the row vector X-1,..., X-m]Gamma in which the (m x s) matrix Gamma has rank s. A sequence of three increasingly refined approaches is presented, all based on linear encoders. The first approach uses a common matrix to encode all the sources and a Korner-Marton like receiver to directly compute W. The second improves upon the first by showing that it is often more efficient to compute a carefully chosen superspace U of W. The superspace is identified by showing that the joint distribution of the {X-i} induces a unique decomposition of the set of all linear combinations of the {X-i}, into a chain of subspaces identified by a normalized measure of entropy. This subspace chain also suggests a third approach, one that employs nested codes. For any joint distribution of the {X-i} and any W, the sum-rate of the nested code approach is no larger than that under the Slepian-Wolf (SW) approach. Under the SW approach, W is computed by first recovering each of the {X-i}. For a large class of joint distributions and subspaces W, the nested code approach is shown to improve upon SW. Additionally, a class of source distributions and subspaces are identified, for which the nested-code approach is sum-rate optimal.

Subchannel allocation and power control in femtocells to provide quality of service

Femtocells are a new concept which improves the coverage and capacity of a cellular system. We consider the problem of channel allocation and power control to different users within a Femtocell. Knowing the channels available, the channel states and the rate requirements of different users the Femtocell base station (FBS), allocates the channels to different users to satisfy their requirements. Also, the Femtocell should use minimal power so as to cause least interference to its neighboring Femtocells and outside users. We develop efficient, low complexity algorithms which can be used online by the Femtocell. The users may want to transmit data or voice. We compare our algorithms with the optimal solutions.

Low Complexity Power and Scheduling Policies for Wireless Networks to Provide Quality of Service

We consider optimal power allocation policies for a single server, multiuser system. The power is consumed in transmission of data only. The transmission channel may experience multipath fading. We obtain very efficient, low computational complexity algorithms which minimize power and ensure stability of the data queues. We also obtain policies when the users may have mean delay constraints. If the power required is a linear function of rate then we exploit linearity and obtain linear programs with low complexity.

Facilitated advocacy: supporting farmers to have a voice in policy making and the development of service provision

Listening to people, especially those who are poor, and involving them in policy making and decisions about service delivery processes are logical steps in building better services and improving policies aimed at poverty alleviation. This case describes a facilitated advocacy that helped to negotiate and support a role for poor people who farm and fish, to contribute recommendations for changes in services and policies that impact on their lives. The national Government of India’s Department of Animal Husbandry and Dairying and the Indian Council for Agricultural Research, both in the capital Delhi, have been linking with farmers and fishers and state government officials in the eastern states of Jharkhand, Orissa and West Bengal, in partnership with the STREAM Initiative of the intergovernmental Network of Aquaculture Centers in Asia Pacific and with the support of the UK Government Department for International Development, Natural resources Systems Program supporting farmers to have a voice(13 p.)

Influence of birefringence dispersion on distributed measurement of polarization coupling in birefringent fibers

A white light interferometer is developed to measure the distributed polarization coupling in high-birefringence polarization-maintaining fibers (PMFs). Usually the birefringence dispersion between two orthogonal eigenmodes of PMFs is neglected in such systems. Theoretical analysis and experimental results show that the birefringence dispersion becomes a nonnegligible factor in a long-fiber test. Significant broadening of interferograms and loss of longitudinal coherence are observed. The spatial resolution and measurement sensitivity of the system decrease correspondingly. Optimum spectrum width selection is presented for better spatial resolution and measurement range. c 2007 Society of Photo-Optical Instrumentation Engineers.