As a contemporary Irish playwright who is well-known for his monologue plays, Conor McPherson (1971- ) illustrates the changing process of Irishness within scope clashing traditional and modern values in The Weir. In early twentieth century as result nationalist isolationist policy, identity was constructed rural, agricultural, Catholic, but it began to change with impact Celtic Tiger referring...

This paper presents a restricted version of Set-Local Multi-Component TAGs (Weir, 1988) which retains the strong generative capacity of Tree-Local MultiComponent TAG (i.e. produces the same derived structures) but has a greater derivational generative capacity (i.e. can derive those structures in more ways). This formalism is then applied as a framework for integrating dependency and constituen...

S.A. McCoy, F. Crawley and P.W.H. Chung Hazid Technologies Ltd., Suite 109, Loughborough University Innovation Centre, Loughborough, Leics, LE11 3EH, UK Department of Chemical & Process Engineering, University of Strathclyde, James Weir Building, 75 Montrose Street, Glasgow, G1 1XJ, UK Modelling and Reasoning Research Group, Department of Computer Science, Loughborough University, Loughborough,...

A pair of Mond–Weir type multi-objective higher order symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under higher order K –F-convexity assumptions. Our results generalize several known results in the literature.

A second-order dual for a nonlinear programming problem was introduced by Mangasarian ([1]). Later, Mond [2] proved duality theorems under a condition which is called “second-order convexity”. This condition is much simpler than that used by Mangasarian. Later, Mond and Weir [3] reformulated the second-order dual. In [4], Mond considered the class of nondifferentiable mathematical programming p...

We present a polynomial-time parsing algorithm for CCG, based on a new decomposition of derivations into small, shareable parts. Our algorithm has the same asymptotic complexity, O.n6/, as a previous algorithm by VijayShanker and Weir (1993), but is easier to understand, implement, and prove correct.

Valeri Petkov,*,† Nick Bedford,† Marc R. Knecht,‡,§ Michael G. Weir,‡ Richard M. Crooks,‡ Wenjie Tang,‡ Graeme Henkelman,‡ and Anatoly Frenkel| Department of Physics, 203 Dow Science, Central Michigan UniVersity, Mt. Pleasant, Michigan 48859, Department of Chemistry and Biochemistry, The UniVersity of Texas at Austin, 5300 Austin, Texas 78712, and Department of Physics, YeshiVa UniVersity, 245 ...

In this paper, we discuss nondifferentiable minimax fractional programming problem where the involved functions are locally Lipschitz. Furthermore, weak, strong and strict converse duality theorems are proved in the setting of Mond-Weir type dual under the assumption of generalized (F,α,ρ,d)-convexity.