Because the change of the society and the raise of consumption level, people value the quality of life more and more, and when they make decisions o products, the quality of products and the customer services all affect their decisions . This situation also extends to hospitality, not only delicate diet but also customer service plays on important role in the purchase willingness of consumers. Customer service not only includes attendants¡¦ spirits and attitude, but also the decoration of retail stores, the taste of food, and the dress of attendants. Raising the quality of service helps the company credibility and consumer promise, and people will purchase and recommend the product because of the company credibility, and customers will support the company because of the consumer promise even if there are other lower price rival commodities they sill still support the company. The present research focuses on the service quality of coffee chain stores in Kaohsiung and analyze if the credibility and consumer promise affect the purchase willingness or not. For the method of the present research, the first step is the sampling surveys, which are totally 236 surveys, and the questions of the survey are the quality of service, the credibility, consumer promise, and the participants¡¦ information. Then, I analyze the data and discuss how the credibility and consumer promise affect the participant¡¦s evaluations to the service quality and the willingness of repurchase. The results show a significant relation between service quality and the willingness of repurchase, and the credibility and consumer promise also affect the willingness of repurchase partially. At the end of the present research are the discussion and suggestions for the future research.

International Telemetering Conference Proceedings / October 27-30, 1997 / Riviera Hotel and Convention Center, Las Vegas, Nevada / A spacecraft complying with the CCSDS Packet Telemetry standard generates telemetry data as a stream of packets. Generally, each packet has different requirements for data transfer characteristics (such as delay and reliability). These requirements are called Quality of Service (QoS) requirements. This paper proposes an extension to the CCSDS Packet Telemetry standard to specify QoS requirements of each packet. The method proposed in this paper is to associate with each packet (1) a level of delay tolerance and (2) a level of loss tolerance. This paper shows how packets should be handled based on this QoS information, and demonstrates that most of the QoS requirements for telemetry data transfer can be met by using this information. This paper also addresses some topics for future investigations.

Differentiated Services architecture permits the allocation of different levels of service to different users. And the Assured Forwarding Per-Hop-Behavior Group defined different drop precedence in the DS routers to provide soft guarantees. However, it has been observed that the drop precedence cannot achieve the desired target rates because of the strong interaction of the transport protocol with packet drops in the Internet. An Internet Service Provider (ISP) does not know what kind of traffic will be sent into the network, so the Internet Service Provider should be able to adapt different types of clients and provides certain quality of services (QOS). We propose a new flow control scheme to enhance the edge routers in a Differentiated Services network with the adaptive drop precedence according to actual flow rates to improve the fairness among the different types of traffics through the Differentiated Services network.

Ever since 1989, the number of lawyer candidates having passed the lawyer examination has been increasing year by year. How do lawyers find their ways of survival in the keenly competitive legal market? Apart from strengthening their legal expertise, lawyers also have to pay concern for customer satisfaction because lawyer business actually belongs to service industry. To let customers feel satisfied, the first thing that lawyers should do is to understand the thinking of customers. After lawyers have understood what their customers think, they are able to provide customers with their desirable services. After a lawyer has grasped the minds of customers, a good reputation of the lawyer can be gradually cultivated. This research paper studies the divorce lawsuits of six women and their interactive experiences with lawyers. Employing the way of in-depth interviews, the study firstly understands these women¡¦s dissatisfaction with their lawyers. And from five different service facets, including the tangibility, reliability, reactivity, guarantee nature and concern nature, the paper summarizes and rearranges the services that the women experiencing divorce lawsuits expect from their lawyers, the most significant services to these women, and the service items that they expect to see improvement from their lawyers. The research results can be a reference for future lawyers to make improvement when handling the cases of family affairs. According to these six interviewed women, in the facet of reliability, the most significant service to them is whether the lawyer has assisted the woman customers in attaining their expected results in the judgments. Besides, what these women expect and attach high importance to are whether their lawyers treat them with a considerate, kind and mild attitude in the process of offering professional legal service, whether their lawyers communicate with them with the greatest patience, and whether their lawyers give explanation in understandable language in the communication process with them. The lawyers are expected to give concrete suggestions for other problems derived from these women¡¦s active proposal of lawsuits. In this way, the helplessness and uneasiness of these women caused in the process of lawsuit can be reduced, and the women¡¦s sense of trust in their lawyers will be increased. Therefore, lawyers not only have to assist women in solving their legal disputes, but also should help them walk out of the shadow of their unhappy marriages to start another new life. Through the realm of marriage lawsuits, lawyers can also establish their reputation and acquire profits in this professional area, achieving a win-win situation in the end.

To be effective, applications such as streaming multimedia require both a more stable and more reliable service than the default best effort service from the underlying computer network. To guarantee steady data transmission despite the unpredictability of the network, a single reserved path for each traffic flow is used. However, a single dedicated path suffers from single link failures. To allow for continuous service inexpensively, unreserved backup paths are used in this thesis. While there are no wasted resources using unreserved backup paths, recovery from a failure may not be perfect. Thus, a goal for this approach is to design algorithms that compute backup paths to mask the failure for all traffic, and failing that, to maximize the number of flows that can be unaffected by the failure. Although algorithms are carefully designed with the goal to provide perfect recovery, when using only unreserved backup paths, re-routing of all affected flows, at the same service quality as before the failure, may not be possible under some conditions, particularly when the network was already fully loaded prior to the failure. Alternate strategies that trade off service quality for continuous traffic flow to minimize the effects of the failure on traffic should be considered. In addition, the actual backup path calculation can be problematic because finding backup paths that can provide good service often requires a large amount of information regarding the traffic present in the network, so much that the overhead can be prohibitive. Thus, algorithms are developed with trade-offs between good performance and communication overhead. In this thesis, a family of algorithms is designed such that as a whole, inexpensive, scalable, and effective performance can be obtained after a failure. Simulations are done to study the trade-offs between performance and scalability and between soft and hard service guarantees. Simulation results show that some algorithms in this thesis yield competitive or better performance even at lower overhead. The more reliable service provided by unreserved backup paths allows for better performance by current applications inexpensively, and provides the groundwork to expand the computer network for future services and applications.

To be effective, applications such as streaming multimedia require both a more stable and more reliable service than the default best effort service from the underlying computer network. To guarantee steady data transmission despite the unpredictability of the network, a single reserved path for each traffic flow is used. However, a single dedicated path suffers from single link failures. To allow for continuous service inexpensively, unreserved backup paths are used in this thesis. While there are no wasted resources using unreserved backup paths, recovery from a failure may not be perfect. Thus, a goal for this approach is to design algorithms that compute backup paths to mask the failure for all traffic, and failing that, to maximize the number of flows that can be unaffected by the failure. Although algorithms are carefully designed with the goal to provide perfect recovery, when using only unreserved backup paths, re-routing of all affected flows, at the same service quality as before the failure, may not be possible under some conditions, particularly when the network was already fully loaded prior to the failure. Alternate strategies that trade off service quality for continuous traffic flow to minimize the effects of the failure on traffic should be considered. In addition, the actual backup path calculation can be problematic because finding backup paths that can provide good service often requires a large amount of information regarding the traffic present in the network, so much that the overhead can be prohibitive. Thus, algorithms are developed with trade-offs between good performance and communication overhead. In this thesis, a family of algorithms is designed such that as a whole, inexpensive, scalable, and effective performance can be obtained after a failure. Simulations are done to study the trade-offs between performance and scalability and between soft and hard service guarantees. Simulation results show that some algorithms in this thesis yield competitive or better performance even at lower overhead. The more reliable service provided by unreserved backup paths allows for better performance by current applications inexpensively, and provides the groundwork to expand the computer network for future services and applications.

To be effective, applications such as streaming multimedia require both a more stable and more reliable service than the default best effort service from the underlying computer network. To guarantee steady data transmission despite the unpredictability of the network, a single reserved path for each traffic flow is used. However, a single dedicated path suffers from single link failures. To allow for continuous service inexpensively, unreserved backup paths are used in this thesis. While there are no wasted resources using unreserved backup paths, recovery from a failure may not be perfect. Thus, a goal for this approach is to design algorithms that compute backup paths to mask the failure for all traffic, and failing that, to maximize the number of flows that can be unaffected by the failure. Although algorithms are carefully designed with the goal to provide perfect recovery, when using only unreserved backup paths, re-routing of all affected flows, at the same service quality as before the failure, may not be possible under some conditions, particularly when the network was already fully loaded prior to the failure. Alternate strategies that trade off service quality for continuous traffic flow to minimize the effects of the failure on traffic should be considered. In addition, the actual backup path calculation can be problematic because finding backup paths that can provide good service often requires a large amount of information regarding the traffic present in the network, so much that the overhead can be prohibitive. Thus, algorithms are developed with trade-offs between good performance and communication overhead. In this thesis, a family of algorithms is designed such that as a whole, inexpensive, scalable, and effective performance can be obtained after a failure. Simulations are done to study the trade-offs between performance and scalability and between soft and hard service guarantees. Simulation results show that some algorithms in this thesis yield competitive or better performance even at lower overhead. The more reliable service provided by unreserved backup paths allows for better performance by current applications inexpensively, and provides the groundwork to expand the computer network for future services and applications. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

No description available.

No description available.

Sensor networks comprise resource-constrained wireless nodes with the capability of gathering information about their surroundings and have recently risen to prominence with the promise of being an effective computing platform for diverse applications, ranging from event detection to environmental monitoring. The database community proposed the use of sensor network query processors (SNQPs) as means to meet data collection requirements using a declarative query language. Declarative queries posed against a sensor network constitute an effective means to repurpose sensor networks and reduce the high software development costs associated with them. The range of sensor network applications is very broad. Such applications have diverse, and often conflicting, QoS expectations in terms of the delivery time of results, the acquisition interval at which data is collected, the total energy consumption of the deployment, or the network lifetime. The conflicting nature of these desiderata is aggravated by the resource-constrained nature of sensor networks as a computing fabric, making it particularly challenging to reconcile the trade-offs that arise. Previously, SNQPs have been focussed on evaluating queries as energy-efficiently as possible. There has been comparatively less work on attempting to meet a broad range of optimization goals and constraints that captured these QoS expectations. In this respect, previous work in SNQP has not aimed at being general purpose across the breadth of applications to which sensor networks have been applied. This PhD dissertation presents an approach for enabling QoS-awareness in SNQPs so that query evaluation plans are generated that exhibit good performance for a broader range of sensor network applications in terms of their QoS expectations. The research contributions reported here include (a) a functional decomposition of the decision-making steps required to compile a declarative query into a query evaluation plan in a sensor network setting; (b) algorithms to implement these decision-making steps; and (c) an empirical evaluation to show the benefits of QoS-awareness compared to a representative fixed-goal SNQP.