Modeling and Analysis of Workflows Using Petri Nets

A workflow system, in its general form, is basically a heterogeneous and distributed information system where the tasks are performed using autonomous systems. Resources, such as databases, labor, etc. are typically required to process these tasks. Prerequisite to the execution of a task is a set of constraints that reflect the applicable business rules and user requirements.In this paper we present a Petri Net (PN) based framework that (1) facilitates specification of workflow applications, (2) serves as a powerful tool for modeling the system under study at a conceptual level, (3) allows for a smooth transition from the conceptual level to a testbed implementation and (4) enables the analysis, simulation and validation of the system under study before proceeding to implementation. Specifically, we consider three categories of task dependencies: control flow, value and external (temporal).We identify several structural properties of PN and demonstrate their use for conducting the following type of analyses: (1) identify inconsistent dependency specifications among tasks; (2) test for workflow safety, i.e. test whether the workflow terminates in an acceptable state; (3) for a given starting time, test whether it is feasible to execute a workflow with the specified temporal constraints. We also provide an implementation for conducting the above analyses.     

A pure geometric theory of gravity and a material distribution

A field theory is constructed in the context of parameterized absolute parallelism geometry. The theory is shown to be a pure gravity one. It is capable of describing the gravitational field and a material distribution in terms of the geometric structure of the geometry used (the parallelization vector fields). Three tools are used to attribute physical properties to the geometric objects admitted by the theory. Poisson and Laplace equations are obtained in the linearized version of the theory. The spherically symmetric solution of the theory, in free space, is found to coincide with the Schwarzschild exterior solution of general relativity. The theory respects the weak equivalence principle in free space only. Gravity and the material distribution are not minimally coupled.     

A New Adaptive Neuro-sliding Mode Control for Gantry Crane

This paper presents a new adaptive neuro-sliding mode control for gantry crane as varying rope length. This control method derived from combining the sliding surfaces of three subsystem of the gantry crane (trolley position, rope length, anti-swing) to draw out two system sliding surfaces: the trolley position with the anti-swing and the rope length and the anti-swing. On the based of the sliding mode control principle, drawn out the equivalent controller and the switching controller for gantry crane. But due to the uncertain parameters-nonlinear model of gantry crane with the bound disturbances, combining the neural approximate method, defined the neural controller and the compensation controller for the difference between the equivalent controller and the neural controller for two system control inputs: trolley position and rope length. The adaptive control laws for these controllers were deduced from Lyapunov’s stable criteria to asymptotically stabilize the sliding surfaces. Simulation studies are performed to illustrate the effectiveness of the proposed control.     

Copy-move forgery detection of duplicated objects using accurate PCET moments and morphological operators

This paper presents a new method for copy-move forgery detection of duplicated objects. A bounding rectangle is drawn around the detected object to form a sub-image. Morphological operator is used to remove the unnecessary small objects. Highly accurate polar complex exponential transform moments are used as features for the detected objects. Euclidian distance and correlation coefficient between the feature vectors are calculated and used for searching the similar objects. A set of 20 forged images with duplicated objects is carefully selected from previously published works. Additional 80 non-forged images are edited by the authors and forged by duplicating different kinds of objects. Numerical simulation is performed where the results show that the proposed method successfully detect different kinds of duplicated objects. The proposed method is much faster than the previously existing methods. Also, it exhibits high robustness to various attacks such as additive white Gaussian noise, JPEG compression, rotation, and scaling.     

Calculating optimal modulation periods to maximize the peak capacity in two-dimensional HPLC

Theoretical calculations are presented to optimize modulation period for maximum total peak capacity in comprehensive two-dimensional HPLC (2D-HPLC) taking into account the effect of modulation on the apparent peak capacity of the first-dimension (1D) separation. Results indicate that modulation periods are most favorable when they are adjusted to approximately 2.2-4 times the standard deviation of a 1D peak in order to avoid excessively short run times at the second dimension (2D). Data are presented that effective peak capacities of several thousand in 60 min can be expected for practical 2D-HPLC conditions, utilizing 1D gradient elution followed by 2D isocratic elution, that remain at approximately 50-70% of the theoretical maximum peak capacity. This work suggests that lower modulation frequencies and longer 2D separation times than previously proposed are favorable under realistic chromatographic conditions, alleviating some practical problems associated with 2D-HPLC.     

The Dynamic Lot-Sizing Problem for Multiple Items Under Limited Capacity

This paper addresses the problem of scheduling the timing and quantities of production of n different products over m periods for a single production facility with a prespecified capacity. We assume that the demand is deterministic and can vary from one period to another and from one product to another. The objective is to minimize the sum of production setup and inventory holding costs. For medium-size problems, optimal solution algorithms do not yet exist and therefore heuristic solution algorithms are of interest. Most of the existing heuristics make use of the “forward-pass” concept in one way or the other. Forward pass means we begin by determining the lot sizes for earlier periods before moving to study the later periods. In this paper we study the forward-pass approach as well as a different solution approach which we call the four-step algorithm. We develop the feasibility conditions for pure forward-pass algorithms. Finally, we perform a comparative evaluation study.     

An evolutionary bargaining‐based approach for incentivized cooperation in opportunistic networks

Opportunistic networking enables users to communicate in an environment where connectivity is intermittent or unstable. However, such networking scheme assumes that mobile nodes voluntary cooperate, which cannot be guaranteed. Some nodes can simply exhibit selfish behavior and thus diminish the effectiveness of the approach. In this paper, a game scenario is formulated in which the nodes try to convince each other to participate in packets forwarding. Each node is considered as a player in this game. When a node comes in the communication range of another, a bargaining game starts between them as part of the message forwarding process. Both players try to have a mutual agreement on a price for message forwarding. We present a new incentive mechanism called evolutionary bargaining‐based incentive scheme (EBIS) to motivate selfish nodes to cooperate in data forwarding. In EBIS, a node negotiates with other nodes to obtain an agreeable amount of credit for its forwarding service. Nodes apply a sequential bargaining game and then adapt their strategies using an evolutionary model to maximize the probability of reaching an agreement. Unlike classical bargaining games, nodes in our model are boundedly rational. In addition, we use the evolutionary stable strategy (ESS) concept to determine the adaptive strategies for the nodes. The comparison of EBIS with a benchmarked model demonstrates that EBIS performs better in terms of packet delivery ratio and average latency.     

An efficient routing protocol for cognitive radio networks of energy-limited devices

Telecommunication Systems - In the era of Internet-of-things (IoT), the future 5G networks are supposed to provide ubiquitous connectivity, high speed, as well as low latency and energy efficiency...