Considerable eeorts have been undertaken to construct environments supporting dynamic software processes. The road to success neither takes us into the runtime stack of the process engine (rule-based approaches), nor may we tolerate the straight-jacket of a static Petri net. We propose an environment centered around dynamic task nets, which provide project managers with all details required to ...

Processing information requests over heterogeneous dataspaces is very challenging because aimed at guaranteeing user satisfaction with respect to conflicting requirements on result quality and response time. In [3], it has been argued that, in dynamic contexts preventing substantial user involvement in interpreting requests, information on similar requests recurring over time can be exploited d...

Software process dynamics challenge the capabilities of process centered software en gineering environments Dynamic task nets represent evolving software processes by hierarchically organized nets of tasks which are connected by control ow data ow and feedback relations Project managers operate on dynamic task nets in order to as sess the current status of a project trace its history perform im...

Consider a connected undirected graph G = (V,E), a subset of vertices C ⊆ V , and an integer r ≥ 1; for any vertex v ∈ V , let Br(v) denote the ball of radius r centered at v, i.e., the set of all vertices linked to v by a path of at most r edges. If for all vertices v ∈ V , the sets Br(v) ∩C are all nonempty and different, then we call C an r-identifying code. A graph admits at least one r-ide...

let $g$ be a non-abelian finite group. in this paper, we prove that $gamma(g)$ is $k_4$-free if and only if $g cong a times p$, where $a$ is an abelian group, $p$ is a $2$-group and $g/z(g) cong mathbb{ z}_2 times mathbb{z}_2$. also, we show that $gamma(g)$ is $k_{1,3}$-free if and only if $g cong {mathbb{s}}_3,~d_8$ or $q_8$.

we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.

The paper presents the contextualization of the Anatomical pathology (AP) workflow focusing on nonconformity during the reception and registration steps. Context is described by contextual elements related to heterogeneous sources such as the actor, the task, the situation and the local environment. The objective of this work is the application of contextual graph to the "workflow" of an AP exa...

In this paper we begin the first systematic study of distributions of quadrant marked mesh patterns. Mesh patterns were introduced recently by Brändén and Claesson in connection with permutation statistics. Quadrant marked mesh patterns are based on how many elements lie in various quadrants of the graph of a permutation relative to the coordinate system centered at one of the points in the gra...

The standard graph cut technique is a robust method for globally optimal image segmentation. However, because of its global nature, it is prone to capture outlying areas similar to the object of interest. This paper proposes a novel method to constrain the standard graph cut technique for tracking objects in a region of interest. By introducing an additional penalty on pixels based upon their d...

Let $$G=(V,E)$$ be a finite graph (here V and E denote the set of vertices edges G respectively) $$M_G$$ centered Hardy–Littlewood maximal operator defined there. We find optimal value $$\mathbf{{C}}_{G,p}$$ such that inequality $$\begin{aligned} \mathrm{Var\,}_{p}M_{G}f\le \mathbf{C}_{G,p}\mathrm{Var\,}_{p}f \end{aligned}$$ holds for every $$f:V\rightarrow {\mathbb {R}},$$ where $$\mathrm{Var\...