The purpose of this paper is to describe an investigation into an ontology-based computational recognition of children’s jokes. While humor has been studied for centuries, computational humor has received very little attention. This may in part be due to the difficulty of the task: at the very least, it requires formal methods for humor generation/recognition and ‘‘being able to produce/interpr...

There are many existing studies released in the field of Computer Vision, especially Automatic License Plate Recognition. However, most them focused on using one method at time, such as Thresholding algorithms, Edge Detections or Morphological transformations. This research paper proposes to automate plate recognition process, by combining four algorithms from three methods mentioned above: Ada...

Automatic differentiation is used for the solution of optimal control problems. Original problem is reduced to a nonlinear programming problem using general RungeKutta integration formulas. Canonical formulas which use a fast automatic differentiation strategy are given to compute derivatives of goal function.

We present a fully automatic method for content selection evaluation in summarization that does not require the creation of human model summaries. Our work capitalizes on the assumption that the distribution of words in the input and an informative summary of that input should be similar to each other. Results on a large scale evaluation from the Text Analysis Conference show that input-summary...

We reflect on the formal development models applicable to embedded control systems in light of our experience with safety-critical applications from the aerospace domain. This leads us to propose two complementary enhancements to Parnas' four-variable model, one elaborating the structure outside the control computer, and the other elaborating the structure inside the control computer. We then i...

In this paper we analyze the consistency and stability properties of Runge-Kutta discrete adjoints. Discrete adjoints are very popular in optimization and control since they can be constructed automatically by reverse mode automatic differentiation. The consistency analysis uses the concept of elementary differentials and reveals that the discrete Runge-Kutta adjoint method has the same order o...

Vectorization is very important to the efficiency of computation in the popular problem-solving environment Matlab. It is shown that a class of Runge-Kutta methods investigated by Milne and Rosser that compute a block of new values at each step are well-suited to vectorization. Local error estimates and continuous extensions that require no additional function evaluations are derived. A (7,8) p...