Search results for: S. Lehmann

Authors: Ulrike Völlinger, Erik Lehmann, Rainer Stark

Abstract:

The intention of this paper is, to help the user of evolutionary algorithms to adapt them easier to their problem at hand. For a lot of problems in the technical field it is not necessary to reach an optimum solution, but to reach a good solution in time. In many cases the solution is undetermined or there doesn-t exist a method to determine the solution. For these cases an evolutionary algorithm can be useful. This paper intents to give the user rules of thumb with which it is easier to decide if the problem is suitable for an evolutionary algorithm and how to design them.

Keywords: Multi criteria optimization, Memetic algorithms

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1364

Authors: Ahmed Shuhaiber, Hans Lehmann

Abstract:

Mobile payments have been deployed by businesses for more than a decade. Customers use mobile payments if they trust in this relatively new payment method, have a belief and confidence in, as well as reliance on its services and applications. Despite its potential, the current literature shows that there is lack of customer trust in B2C mobile payments, and a lack of studies that determine the factors that influence their trust in these payments; which make these factors yet to be understood, especially in the Middle East region. Thus, this study aims to explore the factors that influence customer trust in mobile payments. The empirical data for this explorative study was collected by establishing four focus group sessions in the UAE. The results indicate that the explored significant factors can be classified into five main groups: customer characteristics, environmental (social and cultural) influences, provider characteristics, mobile-device characteristics, and perceived risks.

Keywords: B2C mobile payments, Mobile commerce, Mobile payment services and application, Trust in mobile payments.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2667

Authors: O. A. Rahmeh, P. Johnson, S. Lehmann

Abstract:

Grid networks provide the ability to perform higher throughput computing by taking advantage of many networked computer-s resources to solve large-scale computation problems. As the popularity of the Grid networks has increased, there is a need to efficiently distribute the load among the resources accessible on the network. In this paper, we present a stochastic network system that gives a distributed load-balancing scheme by generating almost regular networks. This network system is self-organized and depends only on local information for load distribution and resource discovery. The in-degree of each node is refers to its free resources, and job assignment and resource discovery processes required for load balancing is accomplished by using fitted random sampling. Simulation results show that the generated network system provides an effective, scalable, and reliable load-balancing scheme for the distributed resources accessible on Grid networks.

Keywords: Complex networks, grid networks, load-balancing, random sampling.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1742