نتایج جستجو برای: inter sentential switching

تعداد نتایج: 191232  

2004
Max Garagnani

Hybrid models are characterised by the integration of two (or more) different paradigms of representation within the same system. Most current planning problem description languages are purely sentential, i.e., based on predicate logic formalisms [3, 14]. The ramification of the effects of action [16] makes the sentential description of planning problems that involve the spatial movement of phy...

Journal: :Information and Control 1976
Meera Blattner

Divide the context-free languages into equivalence classes in the following way: L1 and L2 are in the same class if there are a-transducers M and M such that M(L1) ~ L~ and d~r(L,) = L1. Define L1 and L~ to be structurally similar if they are in the same class. Among the results given below are: (I) if L1 and L2 are structurally similar and L1 has a structurally similar set of (right) sententia...

2001
Ibrahim T. Okumus Junseok Hwang Haci Ali Mantar Steve J. Chapin

Bandwidth Management Points (BMP) are a necessity to manage the intra and inter-domain resources in the Internet. In this paper we propose a way to setup inter-domain Label Switched Path (LSP) with the help of a BMP in a MultiProtocol Label Switching (MPLS) over Diffserv network. We use extended Simple Inter-domain Bandwidth Broker Signalling Protocol (SIBBS) to distribute the labels inter-doma...

Journal: :Computer Speech & Language 2022

Code-switching (CS), defined as the mixing of languages in conversations, has become a worldwide phenomenon. The prevalence CS been recently met with growing demand and interest to build automatic speech recognition (ASR) systems. In this paper, we present our work on code-switched Egyptian Arabic–English ASR. We first contribute filling huge gap resources by collecting, analyzing publishing sp...

2003
Wen-Chi Hsie Kevin C. Yeh Jason S. Chang Thomas C. Chuang

We present a new approach to aligning bilingual English and Chinese text at sub-sentential level by interleaving alphabetic texts and punctuations matches. With sub-sentential alignment, we expect to improve the effectiveness of alignment at word, chunk and phrase levels and provide finer grained and more reusable translation memory.

2011
Jack K. Horner

Two logics are implicationally equivalent if the axioms and inference rules of each imply the axioms of the other. Characterizing the inferential equivalences of various formulations of the sentential calculi is foundational. Using an automated deduction system, I show that Łukasiewicz's CN can be derived from Frege's Begriffsschrift, the first sentential calculus ; the proof appears to be novel.

2015
Paddy J. Slator Christopher W. Cairo Nigel J. Burroughs Marek Cebecauer

We develop a Bayesian analysis framework to detect heterogeneity in the diffusive behaviour of single particle trajectories on cells, implementing model selection to classify trajectories as either consistent with Brownian motion or with a two-state (diffusion coefficient) switching model. The incorporation of localisation accuracy is essential, as otherwise false detection of switching within ...

2006
Cristel Pelsser Olivier Bonaventure

MultiProtocol Label Switching (MPLS) is used today inside most large Service Provider (SP) networks. In this paper, we analyze the establishment of interdomain MPLS LSPs with QoS constraints. These LSPs cross diverse SP networks that may belong to different companies. We show that using the standard BGP route for the establishment of such LSPs is not sufficient. We propose two path establishmen...

1998
Yuan-Chi Chang David G. Messerschmitt

Digital video coding has traditionally used frame-by-frame synchronous reconstruction. The transport must then be delayjitter-free, forcing the modern integrated service packet network such as the Internet to operate in an inefficient “circuit emulation” mode. This mode results in a jitter-free delay representative of the worst-case network delay, which is problematic for delay-sensitive intera...

1996
Jonathan S. Shapiro David J. Farber Jonathan M. Smith

Protected application decomposition is limited by the performance of the local interprocess procedure call implementation. In this paper, we measure the performance of a new IPC implementation, and show that the cost of IPC can be reduced to the cost of raw memory copy plus a small overhead. Even on machines with poor context switching performance, our implementation compares favorably with bco...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید