Connectivity of workflow nets : the foundations of stepwise verification

Behavioral models capture operational principles of real-world or designed systems. Formally, each behavioral model defines the state space of a system, i.e., its states and the principles of state transitions. Such a model is the basis for analysis of the system’s properties. In practice, state spaces of systems are immense, which results in huge computational complexity for their analysis. Behavioral models are typically described as executable graphs, whose execution semantics encodes a state space. The structure theory of behavioral models studies the relations between the structure of a model and the properties of its state space. In this article, we use the connectivity property of graphs to achieve an efficient and extensive discovery of the compositional structure of behavioral models; behavioral models get stepwise decomposed into components with clear structural characteristics and inter-component relations. At each decomposition step, the discovered compositional structure of a model is used for reasoning on properties of the whole state space of the system. The approach is exemplified by means of a concrete behavioral model and verification criterion. That is, we analyze workflow nets, a well-established tool for modeling behavior of distributed systems, with respect to the soundness property, a basic correctness property of workflow nets. Stepwise verification allows the detection of violations of the soundness property by inspecting small portions of a model, thereby considerably reducing the amount of work to be done to perform soundness checks. Besides formal results, we also report on findings from applying our approach to an industry model collection.

Flexible service systems

Service science combines scientific, management, and engineering disciplines to improve the understanding of how service systems cooperate to create business value. Service systems are complex configurations of people, technologies, and resources that coexist in a common environment of service provisioning. While the general concepts of service science are understood and agreed upon, the representation of service systems using models is still in its infancy. In this chapter, we look at business processes and their role in properly representing service systems. We propose flexible process graphs, a high-level process modeling language, and extend it in order to specify service systems and their compositions within shared environments in a flexible way. The discussion in this chapter is the first step towards a formal description of service science environment, including service systems, networks, and whole ecology.

Hypergraph-based modeling of ad-hoc business processes

Process models are usually depicted as directed graphs, with nodes representing activities and directed edges control flow. While structured processes with pre-defined control flow have been studied in detail, flexible processes including ad-hoc activities need further investigation. This paper presents flexible process graph, a novel approach to model processes in the context of dynamic environment and adaptive process participants’ behavior. The approach allows defining execution constraints, which are more restrictive than traditional ad-hoc processes and less restrictive than traditional control flow, thereby balancing structured control flow with unstructured ad-hoc activities. Flexible process graph focuses on what can be done to perform a process. Process participants’ routing decisions are based on the current process state. As a formal grounding, the approach uses hypergraphs, where each edge can associate any number of nodes. Hypergraphs are used to define execution semantics of processes formally. We provide a process scenario to motivate and illustrate the approach.

Flexible process graph : a prologue

Businesses document their operational processes as process models. The common practice is to represent process models as directed graphs. The nodes of a process graph represent activities and directed edges constitute activity ordering constraints. A flexible process graph modeling approach proposes to generalize process graph structure to a hypergraph. Obtained process structure aims at formalization of ad-hoc process control flow. In this paper we discuss aspects relevant to concurrent execution of process activities in a collaborative manner organized as a flexible process graph. We provide a real world flexible process scenario to illustrate the approach.

Anti-wind-up designs for dynamic positioning of marine vehicles with control allocation

This paper presents a framework for the design of a joint motion controller and a control allocation strategy for dynamic positioning of marine vehicles. The key aspects of the proposed designs are a systematic approach to deal with actuator saturation and to inform the motion controller about saturation. The proposed system uses a mapping that translates the actuator constraint sets into constraint sets at the motion controller level. Hence, while the motion controller addresses the constraints, the control allocation algorithm can solve an unconstrained optimisation problem. The constrained control design is approached using a multivariable anti-wind-up strategy for strictly proper controllers. This is applicable to the implementation of PI and PID type of motion controllers.

Broadcast anti-jamming systems

In a traditional anti-jamming system a transmitter who wants to send a signal to a single receiver spreads the signal power over a wide frequency spectrum with the aim of stopping a jammer from blocking the transmission. In this paper, we consider the case that there are multiple receivers and the transmitter wants to broadcast a message to all receivers such that colluding groups of receivers cannot jam the reception of any other receiver. We propose efficient coding methods that achieve this goal and link this problem to well-known problems in combinatorics. We also link a generalisation of this problem to the Key Distribution Pattern problem studied in combinatorial cryptography.

Anti-proliferative and cytotoxic activity of pentadactylin isolated from Leptodactylus labyrinthicus on melanoma cells

Nowadays, the emergence of resistance to the current available chemotherapeutic drugs by cancer cells makes the development of new agents imperative. The skin secretion of amphibians is a natural rich source of antimicrobial peptides (AMP), and researchers have shown that some of these wide spectrum molecules are also toxic to cancer cells. The aim of this study was to verify a putative anticancer activity of the AMP pentadactylin isolated for the first time from the skin secretion of the frog Leptodactylus labyrinthicus and also to study its cytotoxic mechanism to the murine melanoma cell line B16F10. The results have shown that pentadactylin reduces the cell viability of B16F10 cells in a dose-dependent manner. It was also cytotoxic to normal human fibroblast cells; nevertheless, pentadactylin was more potent in the first case. The studies of action mechanism revealed that pentadactylin causes cell morphology alterations (e.g., round shape and shrinkage morphology), membrane disruption, DNA fragmentation, cell cycle arrest at the S phase, and alteration of mitochondrial membrane potential, suggesting that B16F10 cells die by apoptosis. The exact mechanism that causes reduction of cell viability and cytotoxicity after treatment with pentadactylin is still unknown. In conclusion, as cancer cells become resilient to death, it is worthwhile the discovery of new drugs such as pentadactylin that induces apoptosis.

On secure multi-party computation in black-box groups

We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function f G (x 1,...,x n ) = x 1 ·x 2 ⋯ x n in an arbitrary finite group (G,·), where the input of party P i is x i  ∈ G for i = 1,...,n. For flexibility, we are interested in protocols for f G which require only black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our results are as follows. First, on the negative side, we show that if (G,·) is non-abelian and n ≥ 4, then no ⌈n/2⌉-private protocol for computing f G exists. Second, on the positive side, we initiate an approach for construction of black-box protocols for f G based on k-of-k threshold secret sharing schemes, which are efficiently implementable over any black-box group G. We reduce the problem of constructing such protocols to a combinatorial colouring problem in planar graphs. We then give two constructions for such graph colourings. Our first colouring construction gives a protocol with optimal collusion resistance t < n/2, but has exponential communication complexity O(n*2t+1^2/t) group elements (this construction easily extends to general adversary structures). Our second probabilistic colouring construction gives a protocol with (close to optimal) collusion resistance t < n/μ for a graph-related constant μ ≤ 2.948, and has efficient communication complexity O(n*t^2) group elements. Furthermore, we believe that our results can be improved by further study of the associated combinatorial problems.

Flupirtine enhances the anti-hyperalgesic effects of morphine in a rat model of prostate bone metastasis

Objective Current treatments for cancer pain are often inadequate, particularly when metastasis to bone is involved. The addition to the treatment regimen of another drug that has a complementary analgesic effect may increase the overall analgesia without the necessity to increase doses, thus avoiding dose-related side effects. This project investigated the synergistic effect of the addition of the potassium channel (KCNQ2–3) modulator flupirtine to morphine treatment in a rat model of prostate cancer-induced bone pain. Design Syngeneic prostate cancer cells were injected into the right tibia of male Wistar rats under anesthesia. This led to expanding tumor within the bone in 2 weeks, together with the concurrent development of hyperalgesia to noxious heat. Paw withdrawal thresholds from noxious heat were measured before and after the maximum non-sedating doses of morphine and flupirtine given alone and in combinations. Dose-response curves for morphine (0.13–5.0 mg/kg ip) and flupirtine (1.25–10.0 mg/kg ip) given alone and in fixed-dose combinations were plotted and subjected to an isobolographic analysis. Results Both morphine (ED50 = 0.74 mg/kg) and flupirtine (ED50 = 3.32 mg/kg) caused dose-related anti-hyperalgesia at doses that did not cause sedation. Isobolographic analysis revealed that there was a synergistic interaction between flupirtine and morphine. Addition of flupirtine to morphine treatment improved morphine anti-hyperalgesia, and resulted in the reversal of cancer-induced heat hyperalgesia. Conclusions These results suggest that flupirtine in combination with morphine may be useful clinically to provide better analgesia at lower morphine doses in the management of pain caused by tumors growing in bone.

Phosphorylation of caveolin-1 is anti-apoptotic and promotes cell attachment during oxidative stress of kidney cells

Aims: Caveolin-1 (cav1) is reported to have both cell survival and pro-apoptotic characteristics. This may be explained by its localisation or phosphorylation in injured cells. This study investigated the role of cav1 in kidney cells of different nephron origin and developmental state after oxidative stress. Methods: Renal MCDK distal tubular, HK2 proximal tubular epithelial cells and HEK293T renal embryonic cells were treated with 1mM hydrogen peroxide. Apoptosis, loss of cell adhesion, and cell survival were compared with expression of cav1 in its non-phosphorylated and phosphorylated (p-cav1) forms. Cav1 was transfected into the HEK293T cells, or caveolae were disrupted with filipin or nystatin in HK2 cells, to investigate functions of cav1 and p-cav1. Results: Oxidative stress induced more apoptosis in HK2s than MDCKs (p<0.05). HK2s had lower endogenous cav1 and p-cav1 than MDCKs (p<0.05). Both cell lines had increased p-cav1, but not cav1, with oxidative stress. This increase was greatest in MDCKs (p<0.01). Cav1 was located mainly in the plasma membrane of untreated cells and translocated to the cytoplasm with oxidative stress in both cell lines, more so in MDCKs. Disruption of caveolae caused cytoplasmic translocation of cav1 in HK2s, but did not alter high levels of oxidative stress-induced apoptosis. When HEK293Ts lacking endogenous cav1 were transfected with cav1, oxidant-induced apoptosis and loss of cell adhesion was decreased (p<0.01), and p-cav1 was induced by treatment. Conclusion: Cav1 expression and localisation in kidney cells is not anti-apoptotic, but increased expression of p-cav1 may promote cell survival after oxidative stress. © 2008 Royal College of Pathologists of Australasia.

On-line estimation of Allan variance parameters

A new online method is presented for estimation of the angular random walk and rate random walk coefficients of IMU (inertial measurement unit) gyros and accelerometers. The online method proposes a state space model and proposes parameter estimators for quantities previously measured from off-line data techniques such as the Allan variance graph. Allan variance graphs have large off-line computational effort and data storage requirements. The technique proposed here requires no data storage and computational effort of O(100) calculations per data sample.

Brandis' leaked anti-piracy proposal is unrealistic

The Australian Government has proposed Internet Service Providers (ISPs) monitor and punish Australians who download and infringe copyright. In a discussion paper circulated by Attorney-General George Brandis, and leaked by Crikey last Friday, the government proposes a sweeping change to Australian copyright law. If implemented, it would force ISPs to take steps to prevent Australians from infringing copyright. What these steps might be is very vague. They could include blocking peer-to-peer traffic, slowing down internet connections, passing on warnings from industry groups, and handing over subscriber details to copyright owners.

Anomaly detection in online social networks : using data-mining techniques and fuzzy logic

This research is a step forward in improving the accuracy of detecting anomaly in a data graph representing connectivity between people in an online social network. The proposed hybrid methods are based on fuzzy machine learning techniques utilising different types of structural input features. The methods are presented within a multi-layered framework which provides the full requirements needed for finding anomalies in data graphs generated from online social networks, including data modelling and analysis, labelling, and evaluation.

The association between the measurement of adherence to anti-diabetes medicine and the HbA1c

BACKGROUND: Adherence to medicines is important in subjects with diabetes, as nonadherence is associated with an increased risk of morbidity and mortality. However, it is not clear whether there is an association between adherence to medicines and glycaemic control, as not all studies have shown this. One of the reasons for this discrepancy may be that, although there is a standard measure of glycaemic control i.e. HbA1c, there is no standard measure of adherence to medicines. Adherence to medicines can be measured either qualitatively by Morisky or non-Morisky methods or quantitatively using the medicines possession ratio (MPR). AIMS OF THE REVIEW: The aims of this literature review are (1) to determine whether there is an association between adherence to anti-diabetes medicines and glycaemic control, and (2) whether any such association is dependent on how adherence is measured. Methods A literature search of Medline, CINAHL and the Internet (Google) was undertaken with search terms; 'diabetes' with 'adherence' (or compliance, concordance, persistence, continuation) with 'HbA1c' (or glycaemic control). RESULTS: Twenty-three studies were included; 10 qualitative and 12 quantitative studies, and one study using both methods. For the qualitative methods measurements of adherence to anti-diabetes medicines (non-Morisky and Morisky), eight out of ten studies show an association with HbA1c. Nine of ten studies using the quantitative MPR, and two studies using MPR for insulin only, have also shown an association between adherence to anti-diabetes medicines and HbA1c. However, the one study that used both Morisky and MPR did not show an association. Three of the four studies that did not show a relationship, did not use a range of HbA1c values in their regression analysis. The other study that did not show a relationship was specifically in a low income population. CONCLUSIONS: Most studies show an association between adherence to anti-diabetes medicines and HbA1c levels, and this seems to be independent of method used to measure adherence. However, to show an association it is necessary to have a range of HbA1c values. Also, the association is not always apparent in low income populations.