Integrasi E-Servqual, Model Kano, dan HOQ dalam Meningkatkan Kepuasan Pelanggan Jasa Ojek Online

Online motorcycle taxi service providers become business opportunities that grow and develop. The development of digital business opportunities is also supported by the increasingly widespread service users. This research aims to determine the characteristics of online motorcycle taxi service users and the attributes that are priority for users. In this study, several methods are used and integrated include: e-ServQual, IPA (importance-performance analysis), Kano Model, and House of Quality. The measurement result of the consumer satisfaction index is 55.58%, meaning that the consumers are quite satisfied with the online service. Based on the findings of this study, the attributes prioritized by consumers are the punctuality of the driver's arrival as stated in the application (attribute 14), the driver confirms the customer's order quickly (attribute 15), and the driver is easy to obtain (attribute 17). Finally, this study also recommends corrective actions to these service providers, among others: maintaining server reliability with a relative importance of 21.4%, regularly conducting driver training with a relative importance of 15.2%, and increasing the number of drivers with a relative importance 4.3%.

CROWDBC: A Blockchain-Base Decentralized Framework for Crowdsourcing

Due to lack of server reliability and user data privacy encryption of data is required before the cloud is outsourced. We have found a compromised method within the blockchain in order to perform a keyword search which is secured on data that is encrypted against malicious service providers and users in cloud. SSE: Privately offers the cloud storage used in symmetric search encryption (SSE) systems, which cannot be regarded as a true cloud. The cloud service is also known to be credible. Let us start by emphasizing the importance of data storage within a public chain. The client is allowed by system to upload them in form which is encrypted, data content is distributed to the nodes of cloud and make sure that the data is available through encryption techniques. Presentation of a blockchain based system for providing the keyword search service with secure storage of distributed data. TKSE performs verifiability on server side so that true cloud servers are protected from being posed by owners of malicious data in the data storage process. Furthermore, technology of blockchain and hash functions are used to allow payment which is fair without third parties involvement for research fees, although if cloud or user is harmful. Our review of security and evaluation of performance show that TKSE is efficient and safe and be suited for cloud computing.

Reliability of a Clustered-Task Server under Modulated Correlation

Server resource allocation and traffic management is a large area of research and business concern in order to ensure proper functionality and maintenance procedures. As a result, good server reliability models that can incorporate workload and traffic stress are necessary. This paper generalizes previous dynamic server reliability models for partitioned servers with clustered-task selection by relaxing the assumption that the correlation between channels in the server remain constant. We allow the correlation to vary deterministically with time, or as a function of a random process in discrete or continuous time. The explicit form of the survival function is derived in such cases. Numerical illustrations demonstrate the dangers of erroneously assuming independence among channels, which can lead to costly and unnecessary interventions in the system. In addition, we numerically explore the effects of a variable correlation on the survival function.

The Service Time Properties of an Unreliable Server Characterize the Exponential Distribution

Consider the total service time of a job on an unreliable server under preemptive-repeat-different and preemptive-resume service disciplines. With identical initial conditions, for both cases, we notice that the distributions of the total service time under these two disciplines coincide, when the original service time (without interruptions due to server failures) is exponential and independent of the server reliability. We show that this fact under varying server reliability is a characterization of the exponential distribution. Further we show, under the same initial conditions, that the coincidence of the mean values also leads to the same characterization.

The Service Time Properties of an Unreliable Server Characterize the Exponential Distribution

Consider the total service time of a job on an unreliable server under preemptive-repeat-different and preemptive-resume service disciplines. With identical initial conditions, for both cases, we notice that the distributions of the total service time under these two disciplines coincide, when the original service time (without interruptions due to server failures) is exponential and independent of the server reliability. We show that this fact under varying server reliability is a characterization of the exponential distribution. Further we show, under the same initial conditions, that the coincidence of the mean values also leads to the same characterization.