In this paper, we investigate various strategies to predict both syntactic dependency parsing and contiguous multiword expression (MWE) recognition, testing them on the dependency version of French Treebank (Abeillé and Barrier, 2004), as instantiated in the SPMRL Shared Task (Seddah et al., 2013). Our work focuses on using an alternative representation of syntactically regular MWEs, which capt...

The ubiquitous linking of computers in local and global networks makes possible the sharing of thoughts by people who are separated spatially or temporally. Many efforts are made to increase opportunities for effective collaborative working, learning and acting through innovative uses of computer technology, and one of these efforts is to build group knowledge collaboratively. This paper presen...

IKI IS A HAWAIIAN WORD THAT REfers to being quick. Leuf and Cunningham (2001) define a Wiki as “a freely expandable collection of interlinked Web pages, a hypertext system for storing and modifying information — a database where each page is easily editable by any user with a forms-capable Web browser client” (p. 14). The authors also differentiate between the terms Wiki (uppercase W) and wiki:...

One of the most widely considered cache replacement policies is Least Recently Used (LRU) based on which many other policies have been developed. LRU has been studied analytically in the literature under the assumption that the object requests are independent. However, such an assumption does not seem to be in agreement with recent studies of Web-traces, which indicate the existence of short te...

Covering algorithms for binary classification build a list of one-sided partial models in a greedy manner. The original motivation therefor stems from the context of rule learning where the expressiveness of a single rule is too limited to serve as standalone model. If the model space is richer, the decomposition into subproblems is not strictly necessary but separately solved subproblems might...

system architecture, compression, performance evaluation Linux, memory optimization This report summarizes our research on implementing a compressed memory in computer systems. The basic premise is that the throughput for applications whose working set size does not fit in main memory degrades significantly due to an increase in the number of page faults. Hence we propose compressing memory pag...

M.Ly computer applications require the manipulation of large data arrays. These applÍcations can behave b-adly under a paged virtual memory (vM) system, due to poor memory access _p¿tterns. One solution to this problem is tiling, a technique in which the arays are partitioned into sub-arrays that map one-to-one with VM -pages. Software implementations of tiling have been described in the litera...

EKER, ABDULAZIZ. Characterization of Context Switch Effects on L2 Cache. (Under the direction of Dr. Yan Solihin.) Multitasking is common in most systems. In order to use the processor resources efficiently, a multitasking system schedules processes to run for certain intervals by switching (saving and restoring) their contexts. However, since processes bring their own data to the cache when th...

The evolution of the global telecommunications industry into an open services market presents developers of telecommunication service and management systems with many new challenges. Increased competition, complex service provision chains and integrated service offerings require effective techniques for the rapid integration of service and management systems over multiple organisational domains...

The risk of death for hemodialysis patients is thought to be highest on the days following the longest interval without dialysis (usually Mondays and Tuesdays); however, existing results are inconclusive. To clarify this we analyzed Dialysis Outcomes and Practice Patterns Study (DOPPS) data of 22,163 hemodialysis patients from the United States, Europe, and Japan. Our study focused on the assoc...