While the advertisements shown by television stations pay for the content that the stations provide, most of us would rather not watch them. This paper describes a system called mythcomm that attempts to make removing them easy through a visualization. We want to do this quickly, since it would be as worthwhile to simply watch the commercials if it took too long. Mythcomm takes advantage of the...

This paper examines the problems of applying traditional function points count rules to virtual reality systems (VRS). From the analysis of the differences between traditional and VRS systems, a set of deficiencies in the IFPUG 4.1 function points count method was detected. Due to the increasing importance of these kinds of applications, it is necessary to study how traditional function points ...

In this paper we offer a formal account of reasoning with legal cases in terms of argumentation schemes. These schemes, and undercutting attacks associated with them, are formalised as defeasible rules of inference within the ASPIC+ framework. We begin by modelling the style of reasoning with cases developed by Aleven and Ashley in the CATO project, which describes cases using factors, and then...

Most applications of data envelopment analysis (DEA) employ standard constant or variable returns-to-scale (CRS or VRS) models. In this paper we suggest that these models may sometimes underutilize our knowledge of the underlying production process. For example, in the context of higher education considered in the reported application, individual universities often maintain a certain student-to...

We extend the applicability of idempotent methods to deterministic dynamic games through the min-max distributive property. This induces a very high curse-of-complexity. A representation of the space of max-plus hypo-convex functions as a min-max linear space is used to obtain a method for attenuating this complexity growth. This is applied in a game of search and deception. The problem is form...

The present paper deals with an optimal stopping problem with several possible search areas in which travel costs are assumed among the areas. In terms of the future availability of an offer once obtained and passed up, the following two cases are considered: (1) it becomes instant.ly and forever unavailable and (2) it remains forever available, called a no recall model and a recall model. resp...