Results 1  10
of
18,464
Verb Semantics And Lexical Selection
, 1994
"... ... structure. As Levin has addressed (Levin 1985), the decomposition of verbs is proposed for the purposes of accounting for systematic semanticsyntactic correspondences. This results in a series of problems for MT systems: inflexible verb sense definitions; difficulty in handling metaphor and new ..."
Abstract

Cited by 520 (4 self)
 Add to MetaCart
... structure. As Levin has addressed (Levin 1985), the decomposition of verbs is proposed for the purposes of accounting for systematic semanticsyntactic correspondences. This results in a series of problems for MT systems: inflexible verb sense definitions; difficulty in handling metaphor and new usages; imprecise lexical selection and insufficient system coverage. It seems one approach is to apply probability methods and statistical models for some of these problems. However, the question reminds: has PSR exhausted the potential of the knowledgebased approach? If not, are there any alternatives that can improve the handling of these problems? We suggest an alternative that represents verb semantic knowledge and accounts for not only finetuned systematic semanticsyntactic correspondences, but also semanticinterpretation correspondences. A verb is not represented by a predicate or simple primitives, but by a set of semantic components that are sensitive to the syntactic altern
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensorbased planning, visibility, decisiontheoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.
Dynamics of Random Early Detection
 In Proceedings of ACM SIGCOMM
, 1997
"... In this paper we evaluate the effectiveness of Random Early Detection (RED) over traffic types categorized as nonadaptive, fragile and robust, according to their responses to congestion. We point out that RED allows unfair bandwidth sharing when a mixture of the three traffic types shares a link Thi ..."
Abstract

Cited by 464 (1 self)
 Add to MetaCart
In this paper we evaluate the effectiveness of Random Early Detection (RED) over traffic types categorized as nonadaptive, fragile and robust, according to their responses to congestion. We point out that RED allows unfair bandwidth sharing when a mixture of the three traffic types shares a link This urlfairness is caused by the fact that at any given time RED imposes the same loss rate on all jlows, regardless of their bandwidths. We propose Fair Random Early Drop (FRED), a modified version of RED. FRED uses peractivejlow accounting to impose 011 each flow a loss rate that depends on the flow’s buffer use. We sl~ow that FRED provides better protection than RED for adaptive uragile and robust) flows. In addition, FRED is able to isolate nonadaptive greedy trafic more effectively. Finally we present a “twopacketbuffer ” gateway mechanism to support a large number of f7ows without incurring additional queueing delays inside the network These improvements are demonstrated by simulations of TCP and UDP traffic. FRED does not make any assumptions about queueing architecture: it will work with a FIFO gateway. FRED’s peractivejlow accounting uses memory in proportion to the total number of b@fers used: a FRED gateway maintains state only for flows for which it has packets buffered, not for all flows that traverse the gateway, 1.
The effects of feedback interventions on performance: A historical review, a metaanalysis, and a preliminary feedback intervention theory
 Psychological Bulletin
, 1996
"... Since the beginning of the century, feedback interventions (FIs) produced negative—but largely ignored—effects on performance. A metaanalysis (607 effect sizes; 23,663 observations) suggests that FIs improved performance on average (d =.41) but that over '/3 of the FIs decreased performance. ..."
Abstract

Cited by 429 (1 self)
 Add to MetaCart
mance. This finding cannot be explained by sampling error, feedback sign, or existing theories. The authors proposed a preliminary FI theory (FIT) and tested it with moderator analyses. The central assumption of FIT is that FIs change the locus of attention among 3 general and hierarchically organized levels
FIXED POINT THEOREMS FOR THE CLASS Q(X,Y) CHIMING CHEN AND CHILIN YEN
, 2005
"... We study a new family of functions Q(X,Y), research its properties, and get some fixed point theorems about this family. 1. Introduction and preliminaries Kuratowski [6] showed that a continuous compact map f: X → X defined on a closed convex subset X of a Banach space has a fixed point. This theore ..."
Abstract
 Add to MetaCart
We study a new family of functions Q(X,Y), research its properties, and get some fixed point theorems about this family. 1. Introduction and preliminaries Kuratowski [6] showed that a continuous compact map f: X → X defined on a closed convex subset X of a Banach space has a fixed point. This theorem has enormous influence on fixed point theory, variational inequalities, and equilibrium problems. In 1968, Goebel [5] established the wellknown coincidence theorem, and then there had been a
FIXED POINT THEOREMS FOR THE CLASS Q(X,Y) CHIMING CHEN AND CHILIN YEN
, 2005
"... We study a new family of functions Q(X,Y), research its properties, and get some fixed point theorems about this family. 1. Introduction and ..."
Abstract
 Add to MetaCart
We study a new family of functions Q(X,Y), research its properties, and get some fixed point theorems about this family. 1. Introduction and
FIXED POINT THEOREMS FOR THE CLASS Q(X,Y) CHIMING CHEN AND CHILIN YEN
, 2005
"... We study a new family of functions Q(X,Y), research its properties, and get some fixed point theorems about this family. 1. Introduction and preliminaries Kuratowski [6] showed that a continuous compact map f: X → X defined on a closed convex subset X of a Banach space has a fixed point. This theore ..."
Abstract
 Add to MetaCart
We study a new family of functions Q(X,Y), research its properties, and get some fixed point theorems about this family. 1. Introduction and preliminaries Kuratowski [6] showed that a continuous compact map f: X → X defined on a closed convex subset X of a Banach space has a fixed point. This theorem has enormous influence on fixed point theory, variational inequalities, and equilibrium problems. In 1968, Goebel [5] established the wellknown coincidence theorem, and then there had been a
Damage Identification and Health Monitoring of Structural and Mechanical Systems from . . .
, 1996
"... ..."
Almost Optimal Lower Bounds for Small Depth Circuits
 RANDOMNESS AND COMPUTATION
, 1989
"... We give improved lower bounds for the size of small depth circuits computing several functions. In particular we prove almost optimal lower bounds for the size of parity circuits. Further we show that there are functions computable in polynomial size and depth k but requires exponential size when ..."
Abstract

Cited by 280 (8 self)
 Add to MetaCart
We give improved lower bounds for the size of small depth circuits computing several functions. In particular we prove almost optimal lower bounds for the size of parity circuits. Further we show that there are functions computable in polynomial size and depth k but requires exponential size when the depth is restricted to k1. Our main lemma which is of independent interest states that by using a random restriction we can convert an AND of small ORs to an OR of small ANDs and conversely.
Results 1  10
of
18,464