Set of Software Quality Static Analyzers (SSQSA) is a set of software tools for static analysis that is incorporated in the framework developed to target the common aim – consistent software quality analysis. The main characteristic of all integrated tools is the independency of the input computer language. Language independency is achieved by enriched Concrete Syntax Tree (eCST) that is used a...

The allocation of experts to programmer teams, which meet constraints on professional competences related programming technologies, languages and tools an IT project specifies is a hard combinatorial problem. This paper solves the problem forming maximum number teams whose all within each team. It develops compares two algorithms: heuristic greedy exact optimal. algorithm iteratively set cover ...

A chain graph (CG) is a graph admitting both directed and undi-rected edges with (partially) directed cycles forbidden. It generalizes both the concept of undirected graph (UG) and the concept of directed acyclic graph (DAG). A chain graph can be used to describe eeciently the conditional independence structure of a multidimensional discrete probability distribution in the form of a graphoid, t...

Graphical structures such as causal networks or Markov networks are very useful tools for representing irrelevance or independency relationships. Singly connected networks are important speciic cases where there is no more than one undirected path connecting each pair of variables. The aim of this paper is to investigate the kind of properties that a dependency model must verify in order to be ...

A plane spanning tree is a tree drawn in the plane so that its edges are closed straight line segments and any two edges do not intersect internally, and no three of its vertices are collinear. In this paper, we present several results on a plane spanning tree such that the graph which is obtained from the tree by adding a line segment between any two end-vertices of the tree is self-intersecting.