Top-<Emphasis Type="Italic">k</Emphasis> overlapping densest subgraphs

Finding dense subgraphs is an important problem in graph mining and has many practical applications. At the same time, while large real-world networks are known to have many communities that are not well-separated, the majority of the existing work focuses on the problem of finding a single densest subgraph. Hence, it is natural to consider the question of finding the top-k densest subgraphs. One major challenge in addressing this question is how to handle overlaps: eliminating overlaps completely is one option, but this may lead to extracting subgraphs not as dense as it would be possible by allowing a limited amount of overlap. Furthermore, overlaps are desirable as in most real-world graphs there are vertices that belong to more than one community, and thus, to more than one densest subgraph. In this paper we study the problem of finding top-k overlapping densest subgraphs, and we present a new approach that improves over the existing techniques, both in theory and practice. First, we reformulate the problem definition in a way that we are able to obtain an algorithm with constant-factor approximation guarantee. Our approach relies on using techniques for solving the max-sum diversification problem, which however, we need to extend in order to make them applicable to our setting. Second, we evaluate our algorithm on a collection of benchmark datasets and show that it convincingly outperforms the previous methods, both in terms of quality and efficiency.     

Specification-driven model transformation testing

Testing model transformations poses several challenges, among them the automatic generation of appropriate input test models and the specification of oracle functions. Most approaches for the generation of input models ensure a certain coverage of the source meta-model or the transformation implementation code, whereas oracle functions are frequently defined using query or graph languages. However, these two tasks are usually performed independently regardless of their common purpose, and sometimes, there is a gap between the properties exhibited by the generated input models and those considered by the transformations. Recently, we proposed a formal specification language for the declarative formulation of transformation properties (by means of invariants, pre-, and postconditions) from which we generated partial oracle functions used for transformation testing. Here, we extend the usage of our specification language for the automated generation of input test models by SAT solving. The testing process becomes more intentional because the generated models ensure a certain coverage of the transformation requirements. Moreover, we use the same specification to consistently derive both the input test models and the oracle functions. A set of experiments is presented, aimed at measuring the efficacy of our technique.     

Capturing crossings: Convex hulls of segment and plane intersections

We give a simple O(nlogn) algorithm to compute the convex hull of the (possibly Θ(n²)) intersection points in an arrangement of n line segments in the plane. We also show an arrangement of dn hyperplanes in d-dimensions whose arrangement has Θ(nd−1) intersection points on the convex hull.     

Effect of treatment with 13-cis-retinoic acid and ara-C on the hematopoietic stem cells of patients with myelodysplastic syndromes

PURPOSE: To assess the "in vivo" effect of 13-cis-retinoic acid and low dose Ara-C in MDS as well as to establish "in vitro" advantage of retinoid dose-related growth pattern on bone marrow cultures as defined by culture timing and CFU-GM proliferative response. PATIENTS AND METHODS: We evaluated 28 patients diagnosed of MDS according to FAB classification, of whom 4 cases had RA, 8 cases SRA, 14 cases RAEB and 2 cases RAEB-T. Patients who had RA and SRA were treated with oral 13-cis-retinoic acid at doses of 20-40 mg daily for 4 months and those cases with RAEB and RAEB-T had subcutaneous Ara-C at doses of 3 mg/m2 twice a day for 21 days. The "in vivo" and "in vitro" effect of retinoic acid on the haemopoietic differentiation was evaluated by the growth CFU-GM in semisolid cell culture methods. RESULTS: Increasing in vitro concentrations of 13-cis retinoic acid did not enhance the growth of myelodysplastic progenitors. Nevertheless, our study did not find any beneficial therapeutic effect of retinoic compounds in MDS patients. In this study, low-dose Ara-C (3 mg/m2) showed similar effects when compared with higher doses reported by others. Furthermore, in terms of CFU-GM proliferation the concentration of colonies before and after treatment were fairly similar in all but two patients. CONCLUSIONS: The results drawn from our study demonstrated that there is no beneficial advantage of 13-cis-retinoic acid as a differentiation inducing agent on myelodysplastic patients. In contrast, lower doses of Ara-C showed similar effects on haemopoiesis of MDS patients than standard doses of 10-20 mg/m2 but with less side effects.     

Boosting the confidence of new product development teams: The role of team boundary spanning,team size and functional diversity

In today's highly interconnected, uncertain and dynamic business environment, team boundary spanning has become an important determinant of the performance of new product development (NPD) projects. Despite the positive evidence supporting the use of boundary spanning activities by NPD teams, little is still known about how boundary spanning teams become high-performance teams. The current study advances research on this subject by examining the mediating effect of team potency on the relationship between team boundary spanning and new product performance, as well as the moderating effects of team size and functional diversity on the relationship between team boundary spanning and team potency. Data from a time-lagged survey study of 140 NPD projects found that team boundary spanning can promote team potency that, in turn, results in greater new product quality and new product creativity. The positive effect of team boundary spanning on team potency was found to be more pronounced for NPD teams of medium size and high levels of functional diversity.     

Velocity‐based formulations for standard and quasi‐incompressible hypoelastic‐plastic solids

We present three velocity‐based updated Lagrangian formulations for standard and quasi‐incompressible hypoelastic‐plastic solids. Three low‐order finite elements are derived and tested for non‐linear solid mechanics problems. The so‐called V‐element is based on a standard velocity approach, while a mixed velocity–pressure formulation is used for the VP and the VPS elements. The two‐field problem is solved via a two‐step Gauss–Seidel partitioned iterative scheme. First, the momentum equations are solved in terms of velocity increments, as for the V‐element. Then, the constitutive relation for the pressure is solved using the updated velocities obtained at the previous step. For the VPS‐element, the formulation is stabilized using the finite calculus method in order to solve problems involving quasi‐incompressible materials. All the solid elements are validated by solving two‐dimensional and three‐dimensional benchmark problems in statics as in dynamics. Copyright © 2016 John Wiley & Sons, Ltd.     

Multi-object tracking evaluated on sparse events

This article presents a visual object tracking method and applies an event-based performance evaluation metric for assessment. The proposed monocular object tracker is able to detect and track multiple object classes in non-controlled environments. The tracking framework uses Bayesian per-pixel classification to segment an image into foreground and background objects, based on observations of object appearances and motions in real-time. Furthermore, a performance evaluation method is presented and applied to different state-of-the-art trackers based on successful detections of semantically high level events. These events are extracted automatically from the different trackers an their varying types of low level tracking results. Then, a general new event metric is used to compare our tracking method with the other tracking methods against ground truth of multiple public datasets.     

Evaluating the usability of natural language query languages and interfaces to Semantic Web knowledge bases

The need to make the contents of the Semantic Web accessible to end-users becomes increasingly pressing as the amount of information stored in ontology-based knowledge bases steadily increases. Natural language interfaces (NLIs) provide a familiar and convenient means of query access to Semantic Web data for casual end-users. While several studies have shown that NLIs can achieve high retrieval performance as well as domain independence, this paper focuses on usability and investigates if NLIs and natural language query languages are useful from an end-user's point of view. To that end, we introduce four interfaces each allowing a different query language and present a usability study benchmarking these interfaces. The results of the study reveal a clear preference for full natural language query sentences with a limited set of sentence beginnings over keywords or formal query languages. NLIs to ontology-based knowledge bases can, therefore, be considered to be useful for casual or occasional end-users. As such, the overarching contribution is one step towards the theoretical vision of the Semantic Web becoming reality.     

A UML/OCL framework for the analysis of graph transformation rules

In this paper we present an approach for the analysis of graph transformation rules based on an intermediate OCL representation. We translate different rule semantics into OCL, together with the properties of interest (like rule applicability, conflicts or independence). The intermediate representation serves three purposes: (1) it allows the seamless integration of graph transformation rules with the MOF and OCL standards, and enables taking the meta-model and its OCL constraints (i.e. well-formedness rules) into account when verifying the correctness of the rules; (2) it permits the interoperability of graph transformation concepts with a number of standards-based model-driven development tools; and (3) it makes available a plethora of OCL tools to actually perform the rule analysis. This approach is especially useful to analyse the operational semantics of Domain Specific Visual Languages. We have automated these ideas by providing designers with tools for the graphical specification and analysis of graph transformation rules, including a back-annotation mechanism that presents the analysis results in terms of the original language notation.