Introduction Conclusions References Tables Figures ◭ ◮ ◭ ◮ Back Close Full Screen / Esc Abstract Introduction Conclusions References

Composable safety certification envisions reuse of safety case argument-fragments together with safety-relevant components in order to reduce the cost and time needed to achieve certification. The argumentfragments could cover safety aspects relevant for different contexts in which the component can be used. Creating argument-fragments for the out-of-context components is time-consuming and cur...

In this paper a schema of graphical parameters is proposed. Based on the parameter integrity introduced by Barefoot, Entringer and Swart, members Ψ(G) of this schema have the general form Ψ(G) = min{ |S| + ψ(G − S) : S ⊂ V (G) }, where ψ(G) is another given graphical parameter. Examples include integrity, mean integrity, connectivity and vertex cover number. General results and bounds for the s...

We show that there exists a Martin-Löf random degree which has a strong minimal cover.

Let X = {x1, ..., xn} be a set, and let P = {P1, ..., Pm} be a set of subsets of X. The goal is to find the smallest sub-collection of sets R ⊆ P whose union covers all of X. More concretely, we can say that each xi, 1 ≤ i ≤ n represents a “skill”, and each Pj, 1 ≤ j ≤ m represents a “person”. In this case, xi ∈ Pj if person Pj has the skill xi. Then, as an employer, the goal is to find the min...

The front cover shows ABB serving the cement manufacturing industry, which it has done since 1961 with turnkey installations, electrical equipment and automation systems. In 1990, ABB recognised the MES (Manufacturing Execution Systems) business area as a natural extension to its technology portfolio. Since then, ABB has provided added value solutions that are independent from the installed pro...

A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. In this article a lower and an upper bound for ψk of the rooted product graphs are presented. Two characterizations are given when those bounds are attained. Moreover ψ2 and ψ3 are exactly de...