Orders of service for special occasions

Digital image

Photocopies of previous file of orders of service

Digital image

Orders of service arranged after the revolution

Digital image

Part of order of service and Hebrew prayer, recommended during the revolution

Digital image

Effects of transit quality of service characteristics on daily bus ridership

A case study of Brisbane, the capital city of Queensland, Australia, explored how explicit measures of transit quality of service (e.g., service frequency, service span, and travel time ratio) and implicit environmental predictors (e.g., topographic grade factor) influenced bus ridership. The primary hypothesis tested was that bus ridership was higher in suburbs with high transit quality of service than in suburbs with limited service quality. Multiple linear regression, used to identify a strong positive relationship between route intensity (bus-km/h-km2) and bus ridership, indicated that both increased service frequency and spatial route density corresponded to higher bus ridership. Additionally, the travel time ratio (i.e., the ratio of in-vehicle transit travel time to in-vehicle automobile travel time) had a significant negative association with suburban ridership: transit use declined as travel time ratio increased. In contrast, topographic grade and service span did not significantly affect suburban bus ridership. The study findings enhance the fundamental understanding of traveler behavior, which is informative to urban transportation policy, planning, and provision.

New perspectives on design and delivery: The context of service desk

This research has identified the trends apparent in service desk design and delivery literature. By doing archival analysis, this investigation has led to the development of a generic framework which has identified three themes in service desk design – User groups, Support models, and Technology types – and two themes in service desk delivery – Direction of delivery, and Executive support level. This research also aims to provide an understanding of service desk functions and the challenges faced by organisations in delivering those functions.

The impact of service failure on brand credibility

Recent studies have examined the consequences of brand credibility, with the majority of works embedded in physical goods. Despite the growing attention service branding receives, little is known about how service failure and recovery efforts impact on brand credibility in service organisations. The purpose of this study is to examine how brand credibility is affected by service failure and an organisations recovery efforts. An online self-completion survey of airline consumers (n=875) was employed to test the relationships between the focal constructs. The results show that a service firm’s effective complaint handling positively impacts satisfaction with complaining, overall satisfaction and service brand credibility. The study also finds that the higher the perceived magnitude of failure, the more difficult it is to satisfy a customer. These results demonstrate that it is possible to maintain service brand credibility during a service failure, provided brand managers develop and implement effective complain handling procedures.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

Distributed Transmission of Functions of Correlated Sources over a Fading Multiple Access Channel

In this paper we address the problem of distributed transmission of functions of correlated sources over a fast fading multiple access channel (MAC). This is a basic building block in a hierarchical sensor network used in estimating a random field where the cluster head is interested only in estimating a function of the observations. The observations are transmitted to the cluster head through a fast fading MAC. We provide sufficient conditions for lossy transmission when the encoders and decoders are provided with partial information about the channel state. Furthermore signal side information maybe available at the encoders and the decoder. Various previous studies are shown as special cases. Efficient joint-source channel coding schemes are discussed for transmission of discrete and continuous alphabet sources to recover function values.

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.