A Probabilistic Model of Early Argument Structure Acquisition Afra Alishahi Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2008 Developing computational algorithms that capture the complex structure of natural language is an open problem. In particular, learning the abstract properties of language only from usage data remains a challenge. In this dissertation...

In the spring of 2012 an archaeological survey was conducted within the Rayen region in order to explore all the archaeological periods in this region and document all archaeological settlement patterns of this region. In general, 52 archaeological sites were discovered and documented which included all prehistoric and historic sites. Among these sites, three of them seem to belong to the Paleo...

Let $n\ge 1$ and $s\ge be integers. An almost $s$-stable subset $A$ of $[n]=\{1,\dots,n\}$ is a such that for any two distinct elements $i, j\in A$, one has $|i-j|\ge s$. For family $\cal F$ non-empty subsets $[n]$ an integer $r\ge 2$, the chromatic number $r$-uniform Kneser hypergraph $\mbox{KG}^r({\cal F})$, whose vertex set edge $\{A_1,\dots, A_r\}$ pairwise disjoint in F$, been studied exte...

Pezeshk S., Ojagh S.M., Alishahi A. (2015): Effect of plant antioxidant and antimicrobial compounds on the shelf-life of seafood – a review. Czech J. Food Sci., 33: 195–203. While the use of synthetic antioxidants and antibacterials to keep the quality of seafood products has become a commonplace, consumer concern about their safety has motivated the seafood industry to seek natural alternative...

A Kneser graph KGn,k is a graph whose vertices are all k-element subsets of [n], with two vertices connected if and only if the corresponding sets do not intersect. A famous result due to Lovász states that the chromatic number of a Kneser graph KGn,k is equal to n − 2k + 2. In this paper we discuss the chromatic number of random Kneser graphs and hypergraphs. It was studied in two recent paper...

Given positive integers n⩾2k, the Kneser graph KGn,k is a whose vertex set collection of all k-element subsets {1,…,n}, with edges connecting pairs disjoint sets. One classical results in combinatorics, conjectured by and proved Lovász, states that chromatic number equal to n−2k+2. In this paper, we study random KGn,k(p), is, obtained from including each independently probability p. We prove th...

La autotraducción, práctica consistente en la traducción de los propios escritos a otra lengua, se ha convertido un terreno particularmente fructífero para reforzar el concepto invisibilidad del traductor o, por contrario, cuestionarlo. Dos posturas han adoptado estudios concernientes autotraducción respecto tema invisibilidad. Por lado, potestad asumida autotraductor permite acceso privilegiad...

A family $F$ of $k$-sets on an $n$-set $X$ is said to be $(s,t)$-union intersecting if for any $A_1,\ldots,A_{s+t}$ in this family, we have $\left(\cup_{i=1}^s A_i\right)\cap\left(\cup_{i=1}^t A_{i+s}\right)\neq \varnothing.$ The celebrated Erdős-Ko-Rado theorem determines the size and structure largest (or $(1,1)$-union intersecting) family. Also, Hilton-Milner second $k$-sets. In paper, $t\ge...