‎a $mu$-way $(v,k,t)$ $trade$ of volume $m$ consists of $mu$‎ ‎disjoint collections $t_1$‎, ‎$t_2‎, ‎dots t_{mu}$‎, ‎each of $m$‎ ‎blocks‎, ‎such that for every $t$-subset of $v$-set $v$ the number of‎ ‎blocks containing this t-subset is the same in each $t_i (1leq‎ ‎i leq mu)$‎. ‎in other words any pair of collections ${t_i,t_j}$‎, ‎$1leq i< j leq mu‎$ is a $(v,k,t)$ trade of volume $m$. in th...

‎A $mu$-way $(v,k,t)$ $trade$ of volume $m$ consists of $mu$‎ ‎disjoint collections $T_1$‎, ‎$T_2‎, ‎dots T_{mu}$‎, ‎each of $m$‎ ‎blocks‎, ‎such that for every $t$-subset of $v$-set $V$ the number of‎ ‎blocks containing this t-subset is the same in each $T_i (1leq‎ ‎i leq mu)$‎. ‎In other words any pair of collections ${T_i,T_j}$‎, ‎$1leq i< j leq mu‎$ is a $(v,k,t)$ trade of volume $m$. In th...

A 3-way \((v,k,t)\) trade \(T\) of volume \(m\) consists three pairwise disjoint collections \(T_{1}\), \(T_{2}\) and \(T_{3}\), each blocks size \(k\), such that for every \(t\)-subset \(v\)-set \(V\), the number containing this is same in \(T_{i}\) \(1\leq i\leq 3\). If any found(\(T\)) occurs at most once 3\), then called Steiner trade. We attempt to complete spectrum \(S_{3s}(v,k)\), set al...

The complexity of diagnosis tasks in large-scale, heterogeneous dynamic systems has turned the attention in this area toward model-based methods. Most model-based diagnostic systems try to nd a set of failed components that can explain observed discrepancies in system behavior consistently with constraints represented by the models. Observations are usually sensor-based and discrepancies are de...

HAS-V is a cryptographic hash function which processes 1024-bit message blocks and produces a hash value of variable length. The design of the hash function is based on design principles of the MD4 family. Recently, weaknesses have been shown in members of this family. Therefore, the analysis of the HAS-V hash function is of great interest. To the best of our knowledge this is the first article...