We investigate Berlekamp’s negacyclic codes and discover that these codes, when considered over the integers modulo 4, do not suffer any of the restrictions on the minimum distance observed in Berlekamp’s original papers [2, 3]. We present an algebraic decoding algorithm for this class of codes that corrects any error pattern of Lee weight ≤ t. Our treatment uses Gröbner bases, the decoding com...

Design weights in surveys are often adjusted to accommodate auxiliary information and to meet pre-specified range restrictions, typically via some ad hoc algorithmic adjustment to a generalised regression estimator. In this paper, we present a simple solution to this problem using empirical likelihood methods or generalised regression. We first develop algorithms for computing empirical likelih...

A production process transforming multiple inputs to different outputs is considered in conventional data envelopment analysis (DEA) models. In various settings, however, there are factors that simultaneously play the roles of both input and output called dual-role factors. some situations, additional information available impose on a DEA model with factors, or decision maker forced restriction...

This paper investigates the effects of business tax lobbying in the presence of investments that are sunk or costly to adjust in the short run. We show that industries which rely more heavily on sunk capital are generally more successful in obtaining tax breaks through lobbying; this reverses the usual logic of the capital levy problem. Nevertheless, these industries invest less in long-run equ...

Selectional restrictions are semantic sortal constraints imposed on the participants of linguistic constructions to capture contextuallydependent constraints on interpretation. Despite their limitations, selectional restrictions have proven very useful in natural language applications, where they have been used frequently in word sense disambiguation, syntactic disambiguation, and anaphora reso...

We extend ALC with preferential role restrictions as concept constructors, and argue that preferential universal restriction represents a defeasible version of standard universal restriction. The resulting DL is more expressive without adding to the complexity of TBox reasoning. We present a tableau system to compute TBox entailment, show that this notion of entailment is not sufficient when ad...

In graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. Various problems arise, such as determining the minimum number of brushes that are required to clean the entire graph. This number is called the brushing number. Here, we study a new variant of the brushing problem in which one vertex is cleaned at a time, but more than one brush may traverse a dirty ed...

Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers. In a view of appearance of new processors and applied problems with data streams, sorting changed its face. This changes and generalizations are the subject of investigation in the research below.

When we apply stacked regression to classification we need only discriminant indices which can be negative. In many situations, we want these indices to be positive, e.g., if we want to use them to count posterior probabilities, when we want to use stacked regression to combining classification. In such situation, we have to use least squares regression under the constraint βk ≥ 0, k = 1, 2, . ...