The purpose of this paper is to reconsider the phonology of English nasal-final prefixes within the framework of Optimality Theory, especially making use of a relation of correspondence. In this paper, I show that compared with previous analyses employing rules and their extrinsic orderings, a constraint-based approach can give a better account of the phenomenon. In order to do this, following ...

This paper presents ideas for formally representing and working with prepositions as stand-alone constructs in connection with nouns and verbs, as prefixes, and as connecting constituents in compounds. As main starting points serve (a) Davis’ proto(typical) roles for linking subject and complements of verbs with semantic roles in HPSG, (b) Pustejovsky’s generative lexicon theory, and (c) Cyc’s ...

We propose a new algorithm for computing the longest prefix of each suffix of a given string of length n over a constant-sized alphabet of size σ that occurs elsewhere in the string with Hamming distance at most k. Specifically, we show that the proposed algorithm requires time O(n(σR) log log n(log k + log logn)) on average, where R = d(k + 2)(logσ n + 1)e, and space O(n). This improves upon t...

As interest in IPv6 deployment in cellular networks increases, several migration issues have been being raised; IPv6 prefix management is the issue addressed in this document. Based on the idea that DHCPv6 servers can manage prefixes, we use DHCPv6 Prefix Delegation to address such prefix management issues as an access router offloading delegation of prefixes and release tasks to a DHCPv6 serve...

Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit such a semantics is to consider (finite prefixes of) net unfoldings, which contain enough information to reason about the reachable markings of the original Petri nets. In this paper, we propose several improvements to ...

This paper shows that a simple algorithm produces the all-prefixes-LCSs-graph in O(mn) time for two input sequences of size m and n. Given any prefix p of the first input sequence and any prefix q of the second input sequence, all longest common subsequences (LCSs) of p and q can be generated in time proportional to the output size, once the all-prefixes-LCSs-graph has been constructed. The pro...

With the deployment of IPv6 [1], several Internet Service Providers are ready to offer IPv6 access to the public. In conjunction with widely deployed "always on" media such as ADSL and the expectation that customers will be assigned a /48 IPv6 unicast address prefix (see RFC 3513 [3] and section 3 of RFC 3177 [2]), an efficient mechanism for delegating address prefixes to the customer’s sites i...

We propose an IP forwarding table search engine architecture, VLMP (Vertical Logical operation with Maskencoded Prefix-length), for routers with multi-gigabit/sec speed links. We discuss the existing approaches and the requirements for search engines, and go on to propose VLMP search engine architecture that expands upon a Content Addressable Memory (CAM) and can perform wire-speed packet proce...

In this paper we aim to describe the latest work on the syntactic-semantic classification of verbs in Croatian language. We tried to extract the specific semantics and function of verb prefixes in Croatian and capture these specific features in the Croatian verb valency lexicon CROVALLEX. The syntactic and semantic connection between base verbs and derived prefixed verbs is revealed and modelle...