Results 1  10
of
14
A Linear Programming Formulation for Global Inference in Natural Language Tasks
 In Proceedings of CoNLL2004
, 2004
"... The typical processing paradigm in natural language processing is the "pipeline" approach, where learners are being used at one level, their outcomes are being used as features for a second level of predictions and so one. In addition to accumulating errors, it is clear that the sequential ..."
Abstract

Cited by 117 (32 self)
 Add to MetaCart
(Show Context)
The typical processing paradigm in natural language processing is the "pipeline" approach, where learners are being used at one level, their outcomes are being used as features for a second level of predictions and so one. In addition to accumulating errors, it is clear that the sequential processing is a crude approximation to a process in which interactions occur across levels and down stream decisions often interact with previous decisions. This work develops a general...
Planning Motions of Polyhedral Parts by Rolling
, 2000
"... The nonholonomic nature of rolling between rigid bodies can be exploited to achieve dextrous manipulation of industrial parts with minimally complex robotic effectors. While for parts with smooth surfaces a relatively well developed theory exists, planning for parts with only piecewise smooth surfa ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
The nonholonomic nature of rolling between rigid bodies can be exploited to achieve dextrous manipulation of industrial parts with minimally complex robotic effectors. While for parts with smooth surfaces a relatively well developed theory exists, planning for parts with only piecewise smooth surfaces is largely an open problem. The problem of arbitrarily displacing and reorienting a polyhedron by means of rotations about edges belonging to a fixed plane is considered. Relevant theoretical results are reviewed, and a polynomial time algorithm is proposed that allows planning such motions. The effects of finite accuracy in representing problem data, as well as the operational and computational complexity of the method are considered in detail.
On modal logics of linear inequalities
 Proc. AiML 2010
, 2010
"... We consider probabilistic modal logic, graded modal logic and stochastic modal logic, where linear inequalities may be used to express numerical constraints between quantities. For each of the logics, we construct a cutfree sequent calculus and show soundness with respect to a natural class of mode ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We consider probabilistic modal logic, graded modal logic and stochastic modal logic, where linear inequalities may be used to express numerical constraints between quantities. For each of the logics, we construct a cutfree sequent calculus and show soundness with respect to a natural class of models. The completeness of the associated sequent calculi is then established with the help of coalgebraic semantics which gives completeness over a (typically much smaller) class of models. With respect to either semantics, it follows that the satisfiability problem of each of these logics is decidable in polynomial space. Keywords: Probabilistic modal logic, graded modal logic, linear inequalities
Verification of regular architectures using ALPHA: a case study
 Internal publication 823, IRISA, Campus de Beaulieu
, 1994
"... We present a formal method for the verification of regular VLSI architectures. In our method, the behavioral specification of the chip and its implementation are first expressed in Alpha, a language for the design of regular synchronous architectures. The behavioral specification is refined down to ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We present a formal method for the verification of regular VLSI architectures. In our method, the behavioral specification of the chip and its implementation are first expressed in Alpha, a language for the design of regular synchronous architectures. The behavioral specification is refined down to an abstract architecture description, while the implementation is simplified by induction techniques up to the same abstract architecture level. Verification is then done by matching both descriptions. This method has been successfully applied to check the correctness of a 300.000 transistor VLSI systolic chip named Api69 for sequence comparison. Proc. Int. Conf. on Application Specific Array Processors, San Francisco, IEEE Computer Society Press, August 1994, pp. 164176 1: Introduction Traditionally, hardware systems have been validated by means of simulation. This method is limited, as it is difficult to achieve 100% fault coverage. This is the reason why formal verification is being ...
Effective use of phrases in language modeling to improve information retrieval
 2004 Symposium on AI & Math Special Session on Intelligent Text Processing
, 2004
"... Traditional information retrieval models treat the query as a bag of words, assuming that the occurrence of each query term is independent of the positions and occurrences of others. Several of these traditional models have been extended to incorporate positional information, most often through the ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Traditional information retrieval models treat the query as a bag of words, assuming that the occurrence of each query term is independent of the positions and occurrences of others. Several of these traditional models have been extended to incorporate positional information, most often through the inclusion of phrases. This has shown improvements in effectiveness on large, modern test collections. The language modeling approach to information retrieval is attractive because it provides a wellstudied theoretical framework that has been successful in other fields. Incorporating positional information into language models is intuitive and has shown significant improvements in several languagemodeling applications. However, attempts to integrate positional information into the languagemodeling approach to IR have not shown consistent significant improvements. This paper provides a broader exploration of this problem. We apply the backoff technique to incorporate a bigram phrase language model with the traditional unigram one and compare its performance to an interpolation of a conditional bigram model with the unigram model. While this novel application of backoff does not improve effectiveness, we find that our formula for interpolating a conditional bigram model with the unigram model yields significantly different results from prior work. Namely, it shows an 11 % relative improvement in average precision on one query set, while yielding no improvement on the other two. 1.
A Ring Selection Problem for SONET
, 2002
"... In this research we describe a ring selection problem for ring based telecommunication networks. This Minimum Coverage Connected Rings (MCCR) Problem is formulated as an integer program. Further, we evaluate the complexity of this problem and prove that MCCR is NPHard. Since the solution of large i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this research we describe a ring selection problem for ring based telecommunication networks. This Minimum Coverage Connected Rings (MCCR) Problem is formulated as an integer program. Further, we evaluate the complexity of this problem and prove that MCCR is NPHard. Since the solution of large instances of MCCR by traditional mathematical programming techniques is difficult, we develop a technique based on constraint addition to solve it. This solution procedure iteratively solves the setcovering problem with additional constraints and stops upon reaching an optimal solution to MCCR. Computational results are presented for a large number of instances of MCCR while various parameter such as the size and cost structure of the data is varied. It is shown that our constraint addition procedure performs reasonably well for a diverse set of problem instances.
Learning and Inference for Information Extraction
, 2005
"... Information extraction is a process that extracts limited semantic concepts from text documents and presents them in an organized way. Unlike several other natural language tasks, information extraction has a direct impact on enduser applications. Despite its importance, information extraction is s ..."
Abstract
 Add to MetaCart
Information extraction is a process that extracts limited semantic concepts from text documents and presents them in an organized way. Unlike several other natural language tasks, information extraction has a direct impact on enduser applications. Despite its importance, information extraction is still a difficult task due to the inherent complexity and ambiguity of human languages. Moreover, mutual dependencies between local predictions of the target concepts further increase difficulty of the task. In order to enhance information extraction technologies, we develop general approaches for two aspects – relational feature generation and global inference with classifiers. It has been quite convincingly argued that relational learning is suitable in training a complicated natural language system. We propose a relational feature generation approach that facilitates relational learning through propositional learning algorithms. In particular, we develop a relational representation language to produce features in a data driven way. The resulting features capture the relational structures of a given domain, and therefore allow the learning algorithms to effectively learn the relational definitions of target concepts. Although the learned classifier can be used to directly predict the target concepts, conflicts between the labels of different target variables often occur due to imperfect classifiers. We propose
Dexterous Grippers: Putting . . .
 THE INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH 2002; 21; 427
, 2002
"... In this paper, we describe the realization and control of robotic endeffectors that are designed to achieve high operational versatility with limited constructive complexity. The design of such endeffectors, which can be regarded either as lowcomplexity robot hands or as highly versatile robot gri ..."
Abstract
 Add to MetaCart
In this paper, we describe the realization and control of robotic endeffectors that are designed to achieve high operational versatility with limited constructive complexity. The design of such endeffectors, which can be regarded either as lowcomplexity robot hands or as highly versatile robot grippers, is based on the intentional exploitation of nonholonomic effects that occur in rolling. While the potential usefulness of manipulation by rolling has been theoretically established in the literature, several problems in the practical implementation of the concept remained open. In particular, manipulation of parts of complex, and a priori unknown, shape is considered in this paper. Experimental lowcomplexity grippers that realize dexterous manipulation by rolling are also described.
unknown title
"... This paper describes the integration of a formal loop generation technique into an autoparallelizing compiler, MARS. A brief survey of loop generation techniques is given and is followed by the description of the loop generation strategy employed in our implementation. We describe the necessary ..."
Abstract
 Add to MetaCart
This paper describes the integration of a formal loop generation technique into an autoparallelizing compiler, MARS. A brief survey of loop generation techniques is given and is followed by the description of the loop generation strategy employed in our implementation. We describe the necessary input and output representations required for formal loop generation and describe how such a transformation Jits into a complete compiler strategy. Given MARS ’ extended linear algebraic program representation and the constraints of a global compiler strategy, we have successfully integrated a formal tool into a FORTRAN compiler and have shown that combined they can outperform an existing commercial compiler. 1