we denote by $ls[n](t,k,v)$ a large set of $t$-$(v,k,lambda)$ designs of size $n$, which is a partition of all  $k$-subsets ofa $v$-set into $n$ disjoint  $t$-$(v,k,lambda)$ designs and$n={v-t choose k-t}/lambda$.   we use the notation$n(t,v,k,lambda)$ as the maximum possible number of mutuallydisjoint cyclic $t$-$(v,k,lambda)$designs. in this paper we givesome new bounds for $n(2,29,4,3)$ and ...

a study of the atmospheric particulate size distribution of total suspended particulate matter(tspm) and associated heavy metals concentrations has been carried out for the urban part of sarajevo city,bosnia and herzegovina. urban particles (n=150) were collected using a high volume air sampler equippedwith a 6-stage impactor. apart from fe which has been determined by flame atomic absorption s...

dissolution pressure and nozzle temperature effects on particle size and distribution were investigated for ress (rapid expansion of supercritical solution) process. supercritical co2 was used as solvent and ibuprofen was applied as the model component in all runs. the resulting ibuprofen nano-particles (about 50 nm in optimized runs) were analyzed by sem and laser diffraction particle size ana...

this paper investigates the short- run and long-run effects of government size and exports on the economic growth of iran as a developing oil export based economy for the period of 1974 - 2008 using an autoregressive distributed lags (ardl) framework. a modified form of feder (1982) and subsequently ram’s (1986) model has been applied to include both government size and exports in growth equati...

This paper describes Grammar Learning by Partition Search, a general method for automatically constructing grammars for a range of parsing tasks. Given a base grammar, a training corpus, and a parsing task, Partition Search constructs an optimised probabilistic context-free grammar by searching a space of nonterminal set partitions, looking for a partition that maximises parsing performance and...

This paper describes Grammar Learning by Partition Search, a general method for automatically constructing grammars for a range of parsing tasks. Given a base grammar, a training corpus, and a parsing task, Partition Search constructs an optimised probabilistic context-free grammar by searching a space of nonterminal set partitions, looking for a partition that maximises parsing performance and...