This paper presents a thorough examination of the validity of three evaluation measures on parser output. We assess parser performance of an unlexicalised probabilistic parser trained on two German treebanks with different annotation schemes and evaluate parsing results using the PARSEVAL metric, the Leaf-Ancestor metric and a dependency-based evaluation. We reject the claim that the TüBa-D/Z a...

rangeland plans as an management option is subject that by giving range to beneficiaries beneficiaries will be identified in the plans whit specific programs. the purpose of this study is to identify factors affecting the performance of rangelands schemes and consequently to rank the projects in razavi khorasan by identified factors. six original schemes in razavi khorasan were selected for thi...

Talk Abstract We examine the solution of high-frequency Helmholtz equations using 2nd, 4th and 6th order finite difference schemes. The examples include two problems with known analytic solutions, enabling error evaluation of the different schemes on various grids (9–18 points per wavelength). We use our block-parallel CARP-CG algorithm [Parallel Computing 36, 2010] for solving the equations. T...

Argumentation Scheme Frameworks Katie Atkinson and Trevor Bench-Capon Department of Computer Science University of Liverpool Liverpool L69 3BX UK {K.M.Atkinson,tbc}@liverpool.ac.uk Abstract. This paper presents an approach to modelling and reasoning about arguments that exploits and combines two of the most popular mechanisms used within computational modelling of argumentation: argumentation s...

Recent years have seen an increasing interest in developing standards for linguistic annotation, with a focus on the interoperability of the resources. This effort, however, requires a profound knowledge of the advantages and disadvantages of linguistic annotation schemes in order to avoid importing the flaws and weaknesses of existing encoding schemes into the new standards. This paper address...

Nonstandard finite difference schemes for the Black-Scholes partial differential equation preserving the positivity property are proposed. Computationally simple schemes are derived by using a nonlocal approximation in the reaction term of the Black-Scholes equation. Unlike the standard methods, the solutions of new proposed schemes are positive and free of the spurious oscillations.

This paper presents a survey of the literature on writer identification schemes and techniques up till date. The paper outlines an overview of the writer identification schemes mainly in Chinese, English, Arabic and Persian languages. Taxonomy of different features adopted for online and offline writer identification schemes is also drawn at. The feature extraction methods adopted for the schem...

In recent years, several nations and private associations have introduced Internet voting as additional means to conduct elections. To date, a variety of voting schemes to conduct Internet-based elections have been constructed, both from the scientific community and industry. Because of its fundamental importance to democratic societies, Internet voting – as any other voting method – is bound t...