A requirement analysis is the basis and source of software system development, its accuracy, consistency completeness are keys to determining quality. However, at present, most requirements specifications prepared manually, which has some problems, such as inconsistency with business description, low preparation efficiency, being error prone difficulty communicating effectively personnel. Aimin...

hansen et‎. ‎al.‎, ‎using the autographix software ‎package‎, ‎conjectured that the szeged index $sz(g)$ and the‎ ‎wiener index $w(g)$ of a connected bipartite graph $g$ with $n geq ‎4$ vertices and $m geq n$ edges‎, ‎obeys the relation‎ ‎$sz(g)-w(g) geq 4n-8$‎. ‎moreover‎, ‎this bound would be the best possible‎. ‎this paper offers a proof to this conjecture‎.

An st-path is a path with the end-vertices s and t. An s-path is a path with an end-vertex s. The results of this paper include necessary and sufficient conditions for a {claw, net}-free graph G with s, t ∈ V (G) and e ∈ E(G) to have (1) a Hamiltonian s-path, (2) a Hamiltonian st-path, (3) a Hamiltonian sand st-paths containing e when G has connectivity one, and (4) a Hamiltonian cycle containi...

L. Kuchariková, E. Tillová, J. Belan, M. Chalupová, A. Vaško, I. Švecová, University of Žilina, Faculty of Mechanical Engineering, Slovakia The present work deals with evaluation of eutectic Si (its shape, size, and distribution), dendrite cell size and dendrite arm spacing in aluminium cast alloys which were cast into different moulds (sand and metallic). Structural parameters were evaluated u...

A key issue in software evolution analysis is being able to compute evolutionary change accurately and with rich semantics. This dissertation describes a mathematical framework for enabling accurate computation of semantic evolutionary change. It is based on graphs for representing software semantics, graph transformations for modeling evolution, and effects of graph transformations for capturi...

A key issue in software evolution analysis is being able to compute evolutionary change accurately and with rich semantics. This dissertation describes a mathematical framework for enabling accurate computation of semantic evolutionary change. It is based on graphs for representing software semantics, graph transformations for modeling evolution, and effects of graph transformations for capturi...

An st-path is a path with the end-vertices s and t. An s-path is a path with an end-vertex s. The results of this paper include necessary and sufficient conditions for a {claw, net}-free graph G with s, t ∈ V (G) and e ∈ E(G) to have (1) Hamiltonian s-path, (2) a Hamiltonian st–path, (3) a Hamiltonian sand st-paths containing e when G has connectivity one, and (4) a Hamiltonian cycle containing...

In the 14 July 1997, issue of Lancet, Schlemper et al. [1] reported a study in which four Japanese and four Western pathologists (from the United States, Canada, Germany, and Finland) compared their diagnoses of gastric biopsy and resection specimens having epithelial lesions ranging from reactive, through preneoplastic, to invasive carcinoma. These pathologists independently classified microsc...