To understand oneself is one of the greatest challenges for man. Subsequently, a multitude of theories was proposed by the past to model the mind and the behaviour that it dictates. Nowadays, computational technology has progressed to the point that partial implementations of mental models can be rigorously constructed. ACT-R (Anderson et al., 2004) is a computational cognitive theory that allo...

condolence is part of austin’s expressive speech act and is related to searle’s behabitives illocutionary act. although a theoretically sound issue in pragmatics, condolence speech act has not been investigated as much as other speech acts in discourse-related studies. this paper aims at investigating interjections and intensifiers while performing condolence speech act among persian and englis...

In this note we provide a simpler proof of a probabilistic analysis of the set cover problem given in [6]. We also prove these results using the language of high probability instead of using convergence in probability or convergence almost everywhere, making the previous results more precise.

This paper presents efforts in preparation of the Polish-toEnglish SMT system for the TED lectures domain that is to be evaluated during the IWSLT 2012 Conference. Our attempts cover systems which use stems and morphological information on Polish words (using two different tools) and stems and POS.

Based on a conjecture regarding the power of unique 2-prover-1-round games presented in [Khot02], we show that vertex cover is hard to approximate within any constant factor better than 2. We actually show a stronger result, namely, based on the same conjecture, vertex cover on k-uniform hypergraphs is hard to approximate within any constant factor better than k.

Land cover/land use categories are relevant components in land management. Understanding how land cover/land use change over time is necessary to assess the consequences of humans and natural stressors on the earth’s environment and resources. The aim of the study was to map and monitor the spatial and temporal change in land cover/land use for the periods of 1977, 1991 and 2016 and to predict ...

Given a tree and a set of paths in the tree, the problem of finding a minimum number of paths from the given path set to cover all the vertices in the tree is investigated in the paper. To distinguish from the classical path cover problem, such an optimization problem is referred to as vertex covering by paths. The problem and its edge variant, edge covering by paths, find applications in machi...