Using wireless mobile terminals has become the mainstream of Internet transactions, which can verify the identity of users by passwords, fingerprints, sounds, and images. However, once these identity data are stolen, traditional information security methods will not avoid online transaction fraud. The existing convolutional neural network model for fraud detection needs to generate many derivative features. This paper proposes a fraud detection model based on the convolutional neural network in the field of online transactions, which constructs an input feature sequencing layer that implements the reorganization of raw transaction features to form different convolutional patterns. Its significance is that different feature combinations entering the convolution kernel will produce different derivative features. The advantage of this model lies in taking low dimensional and nonderivative online transaction data as the input. The whole network consists of a feature sequencing layer, four convolutional layers and pooling layers, and a fully connected layer. Verifying with online transaction data from a commercial bank, the experimental results show that the model achieves excellent fraud detection performance without derivative features. And its precision can be stabilized at around 91% and recall can be stabilized at around 94%, which increased by 26% and 2%, respectively, comparing with the existing CNN for fraud detection.

Cloud Computing is becoming more and more popular for solving problems that need high concurrency and a lot of resources. Many traditional areas of research choose to solve their problems through the cloud, and workflow scheduling is one of them. Cloud computing brings many benefits, meanwhile, due to the almost “infinite” amount of resources for users, it also brings new challenges for scheduling and optimization, in which cost and makespan are the most concerned issues for workflow scheduling. Users want to obtain a low cost and fast makespan solution. This paper focuses on how to find an optimized solution to achieve better cost-makespan at the same time under the constraint of deadline. In order to solve this problem, an immune particle swarm optimization algorithm (IMPSO) is proposed, which effectively improves the quality and speed of the optimization. The proposed IMPSO overcomes the problem of slow convergence of PSO, which is easy to fall into local optimization. Experiments show the efficiency and effectiveness of the proposed approach.

The creation of value-added services by automatic composition of existing ones is gaining significant momentum as the potential silver bullet in service-oriented computing. A large number of composition methods have been proposed, and most of them are based on the matching of input and output parameters of services only. However, most services in the real world are not universally applicable, and some applicable conditions or restrictions are imposed on them by their providers. Such constraints have a great impact on service composition, but have been largely ignored by the existing methods. In this paper, they are discussed and defined, and a simple formal expression is adopted to describe them. Two novel concepts, called service intension and service extension, are presented, which allow one to divide the basic elements of a web service definition into two parts. Consequently, their use allows us to propose a constraint-aware service composition method in which service constraints are well taken care. The proposed solution includes a graph search-based algorithm and two novel preprocessing methods. A publicly available test set from ICEBE05 is used to evaluate and analyze the proposed methodology.

By arranging multiple existing web services into workflows to create value-added services, automatic web service composition has received much attention in service-oriented computing. A large number of methods have been proposed for it although most of them are merely based on the matching of input-output parameters of services. Besides these parameters, some other elements can affect the execution of services and their composition, such as the preconditions and service execution results. In particular, the execution effects of some services are often uncertain because of the complex and dynamically changing application environments in the real world, and this can cause the emergence of nondeterministic choices in the workflows of composite services. However, the previous methods for automatic service composition mainly rely on sequential structures, which make them difficult to take into account uncertain effects during service composition. In this paper, Graphplan is employed and extended to tackle this problem. In order to model services with uncertain effects, we first extend the original form of Graphplan. Then, we propose a novel approach that can introduce branch structures into composite solutions to cope with such uncertainty in the service composition process. Extensive experiments are performed to evaluate and analyze the proposed methodology.

Link similarity is widely applied in measuring the similarity between such objects as Web pages, scientific papers, and social networks. However, there are some deficiencies in the existing methods to measure it. For example, they cannot handle some semantic-similar contents. Their computation may not lead to accurate results in some cases. This paper presents a novel method to do so. It introduces the semantic similarity to calculate the similarity between two given objects, and overcomes the drawback caused by the fact that the existing methods ignore the semantic information of objects. It also gives a novel computation function to make the computing result of similarity more accurate.

The use of information technology and management systems for the betterment of health care is more and more important and popular. However, existing efforts mainly focus on informatization of hospitals or medical institutions within the organizations, and few are directly oriented to the patients, their families, and other ordinary people. The strong demand for various medical and public health care services from customers calls for the creation of powerful individual-oriented personalized health care service systems. Service computing and related technologies can greatly help one in fulfilling this task. In this paper, we present PHISP: a Public-oriented Health care Information Service Platform, which is based on such technologies. It can support numerous health care tasks, provide individuals with many intelligent and personalized services, and support basic remote health care and guardianship. In order to realize the personalized customization and active recommendation of intelligent services for individuals, several key techniques for service composition are integrated, which can support branch and parallel control structures in the process models of composite services and are highlighted in this paper.