This paper describes some preliminary work on the use of SCR-style speci cation as a tool for Independent Veri cation and Validation (IV&V). Our intention is to use formal methods not as a part of the development process itself, but as a `shadow' activity, performed by an independent team of experts. Our long-term expectation is that this approach will turn out to be a less painful way of intro...

concentrations of six heavy metals including cr, mn, ni, pb, v and zn were determined in topsoil (from 47 grid cells), surface water (4 streams) and groundwater (8 wells and 4 qanats) from an agriculturalarea located at south part of the iranian capital, near the tehran oil refinery. concentrations of the elementswere measured using flame and flameless atomic absorption spectrometry. based on t...

Cognition of technical systems, as the ability to perceive situations, to learn about favorable behavior, and to autonomously generate decisions, adds new attributes to safety issues. The system can cope with heavily changing conditions but its future behavior is not known a-priori. Therefore, present software solutions to safety like a comprehensive analysis of the specification and its implem...

2014 A transmission electron microscope (TEM) investigation of surface defects contained in an asgrown Ti3Al + V ordered alloy (DO19) was carried out and evidence was obtained for two categories of defects, namely antiphase boundaries (APB) and superlattice intrinsic stacking faults (SISF). APBs are nonplanar, they are thermal defects that were formed during alloy ordering ; they are often term...

If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.

Let e be an edge of a G connecting the vertices u and v. Define two sets N1 (e | G) and N2(e |G) as N1(e | G)= {xV(G) d(x,u) d(x,v)} and N2(e | G)= {xV(G) d(x,v) d(x,u) }.The number of elements of N1(e | G) and N2(e | G) are denoted by n1(e | G) and n2(e | G) , respectively. The Szeged index of the graph G is defined as Sz(G) ( ) ( ) 1 2 n e G n e G e E    . In this paper we compute th...

let e be an edge of a g connecting the vertices u and v. define two sets n1 (e | g) andn2(e |g) as n1(e | g)= {xv(g) d(x,u) d(x,v)} and n2(e | g)= {xv(g) d(x,v) d(x,u) }.thenumber of elements of n1(e | g) and n2(e | g) are denoted by n1(e | g) and n2(e | g) ,respectively. the szeged index of the graph g is defined as sz(g) ( ) ( ) 1 2 n e g n e g e e    . inthis paper we compute the sz...