Service Oriented Architecture (SOA) is a paradigm that provides important advantages like interoperability, reusability and flexibility, particularly beneficial for B2B applications. In the current paper, we consider specific architectures of inter-organizational workflows (IOWF) fairly widespread in the B2B area and implementing different cooperation schemas. Our aim is to propose new generic IOWF-architectures by using the SOA paradigm in order to obtain IOWF models flexible enough to ease their adaptation, evolution and reuse. For that, we introduce the concept of Service-Based Cooperation Pattern (SBCP) that supports the definition of IOWF models based on services. A SBCP is defined by three main dimensions: the distribution of services, the control of execution and the structure of interaction between services. Also, we define a concept of composite cooperation pattern based on the combination of elementary patterns. We illustrate our approach by a general description of our cooperation framework called “S-IOFLOW” that supports the implementation of IOWF models obeying to the described SBCP. Three main points characterize our approach: (i) the use of a pattern-based approach; (ii) the definition of composite patterns by reusing elementary ones and (iii) the support of several cooperation schemas with different types of control.

Signals that represent information may be classified into two forms: numeric and symbolic. Symbolic signals such as DNA symbolic sequences cannot be directly processed with digital signal processing (DSP) techniques. The only way to apply DSP in genomic field is the mapping of DNA symbolic sequences to numerical sequences. Hence, biological properties are reflected in a numerical domain. This opens a field to present a set of tools for solving genomic problems. In literature many techniques have been developed for numerical representation of DNA sequences. The main drawback of these techniques is that each nucleotide is represented by a numerical value depending on nucleotide type only ignoring its position in codon and DNA sequence. In this paper a new approach for DNA symbolic to numeric representation called Circular Mapping (CM) is introduced. It’s based on graphical representation of DNA sequence that maps each nucleotide by a complex numerical value depending not only on nucleotide type but also on its position in codons. The main applications of this method are the gene prediction that aims to locate the protein-coding regions and the classification of exons and introns in DNA sequences. The proposed approach showed significant improvement in exons and introns classification as compared with the existing techniques. The efficiency of this method in classification depends on the right choice of the mapping angle (θ) as indicated by the power spectral analysis results over the sequences of the human genome (GRch37/hg19).

The wireless access networks design problem is formulated as a constrained optimization problem, where the goal is to find a network topology such that an objective function is optimized, subject to a set of constraints. The objective function may be the total cost, or some performance measure like utilization, call blocking or throughput. The constraints may be bounds on link capacities, cost elements, or some network performance measure. However, the optimization problem is too complex. In this paper, we propose a novel Ant Colony Optimization (ACO) algorithm to finding the total cost of connecting the BSs to the MSCs, and connecting the MSCs to the LE called by the optimal centralized wireless access network. Numerical results show that performance of our proposed algorithm is much better than previous studies.

Due to the latest developments in the area of science and Technology resulted in the developments of efficient data transfer, capability of handling huge data and the retrieval of data efficiently. Since the data that is stored is increasing voluminously, methods to retrieve relative information and security related concerns are to be addressed efficiently to secure this bulk data. Also with emerging concepts of big data, these security issues are a challenging task. This paper addresses the issue of secure data transfer using the concepts of data mining in cloud environment using hadoop mapreduce. Based on the experimentation done results are analyzed and represented with respect to time and space complexity when compared hadoop with non hadoop approach.

The Monte Carlo simulation method uses random sampling to study properties of systems with components that behave in a random state. More precisely, the idea is to simulate on the computer the behavior of these systems by randomly generating the variables describing the behavior of their components. In this paper, we propose an efficient and reliable simulation scheme based on Monte Carlo algorithm and combining two variance reduction procedures. We simulate a European option price numerically using the proposed simulation scheme.

This paper discusses about the significance of selecting right requirements management tools. It’s no secret that poorly understood user requirements and uncontrolled scope creep to many software project failures. Many of the application development professionals buy wrong tools for the wrong reasons. To avoid purchasing the more complex and expensive tool, the organization needs to be realistic about the particular problem for which they opt. Software development organizations are improving the methods, they use to gather, analyze, trace, document, prioritize and manage their requirements. This paper considers four leading Requirements Management tools; Analyst Pro, CORE, Cradle and Caliber RM, the focus is to select the appropriate tool according to their capabilities and customers need.

Michael Jackson defines a Problem Frame as a mean to describe and classify software development problems. The initial description of problem Frames is essentially graphical. A weakness of this proposal is the lack of formal specification allowing efficient reasoning tools. This paper deals with Problem Frames’ formal specification with Description Logics. We first propose a formal terminology of Problem Frames leading to the specification of a Problem Frames’ TBOX and a specific problem’s ABOX. The Description Logics inference tools can then be used to decompose multi frame problems or to fix a particular problem into a Problem Frame.

This research focuses on the basic concepts of continuum robot manipulator and control methodology. OCTARM Continuum robot manipulator is a 6 DOF serial robot manipulator. From the control point of view, robot manipulator divides into two main parts i.e. kinematics and dynamic parts. The dynamic parameters of this system are highly nonlinear. To control of this system nonlinear control methodology (computed torque controller and sliding mode controller) is introduced. Computed torque controller (CTC) is an influential nonlinear controller to certain systems which it is based on feedback linearization and computes the required arm torques using the nonlinear feedback control law. When all dynamic and physical parameters are known computed torque controller works superbly; practically a large amount of systems have uncertainties and sliding mode controller reduce this kind of limitation. Sliding mode controller (SMC) is a significant nonlinear controller under condition of partly uncertain dynamic parameters of system. This controller is used to control of highly nonlinear systems especially for robot manipulators, because this controller is a robust and stable. Comparative study between computed torque controller and sliding mode controller is introduced in this research.