New integer linear programming approaches for course timetabling

The most complete form of academic timetabling problem is the population and course timetabling problem. In this problem, there may be multiple classes of each subject, and the decision on which students are to constitute each class is made in concert with the decision on the timetable for each class. In order to solve this problem, it is normally simplified or decomposed in some fashion. One simplification commonly used in practice is known as blocking: it is assumed that the classes can be partitioned into sets of classes (or blocks) that will be timetabled in parallel. This restricts clashing to occur only between classes in the same block, and essentially removes the timetabling aspect of the problem, which can be carried out once the blocks are constituted and the classes populated. The problem of constituting the blocks and populating the classes, known as the course blocking and population problem, is nevertheless a challenging problem, and provides the focus of this paper. We demonstrate, using data provided by a local high school, that integer linear programming approaches can solve the problem in a matter of seconds. Key features include remodelling to remove symmetry caused by students with identical subject selection, and the observation that in practice, only integrality of the block composition variables needs to be enforced; the class population aspects of the model have strong integrality properties.     

Guest Editor's Introduction: Unwanted Traffic: Finding and Defending against Denial of Service, Spam, and Other Internet Flotsam

The Internet is full of unwanted traffic, from junk mail, to advertising and scams that pose as social media, to fake "clicks" on ads, to denial-of-service attacks against online services. Each type causes problems in one way or another, and network operators have to work hard to identify and eliminate unwanted traffic. This issue examines the overall problem, and presents a selection of research into mitigation.     

Experiences in developing and applying a software engineering technology testbed

A major problem in empirical software engineering is to determine or ensure comparability across multiple sources of empirical data. This paper summarizes experiences in developing and applying a software engineering technology testbed. The testbed was designed to ensure comparability of empirical data used to evaluate alternative software engineering technologies, and to accelerate the technology maturation and transition into project use. The requirements for such software engineering technology testbeds include not only the specifications and code, but also the package of instrumentation, scenario drivers, seeded defects, experimentation guidelines, and comparative effort and defect data needed to facilitate technology evaluation experiments. The requirements and architecture to build a particular software engineering technology testbed to help NASA evaluate its investments in software dependability research and technology have been developed and applied to evaluate a wide range of technologies. The technologies evaluated came from the fields of architecture, testing, state-model checking, and operational envelopes. This paper will present for the first time the requirements and architecture of the software engineering technology testbed. The results of the technology evaluations will be analyzed from a point of view of how researchers benefitted from using the SETT. The researchers just reported how their technology performed in their original findings. The testbed evaluation showed (1) that certain technologies were complementary and cost-effective to apply; (2) that the testbed was cost-effective to use by researchers within a well-specified domain of applicability; (3) that collaboration in testbed use by researchers and the practitioners resulted comparable empirical data and in actions to accelerate technology maturity and transition into project use, as shown in the AcmeStudio evaluation; and (4) that the software engineering technology testbed’s requirements and architecture were suitable for evaluating technologies and accelerating their maturation and transition into project use.

Negotiating with bounded rational agents in environments with incomplete information using an automated agent

Many tasks in day-to-day life involve interactions among several people. Many of these interactions involve negotiating over a desired outcome. Negotiation in and of itself is not an easy task, and it becomes more complex under conditions of incomplete information. For example, the parties do not know in advance the exact tradeoff of their counterparts between different outcomes. Furthermore information regarding the preferences of counterparts might only be elicited during the negotiation process itself. In this paper we propose a model for an automated negotiation agent capable of negotiating with bounded rational agents under conditions of incomplete information. We test this agent against people in two distinct domains, in order to verify that its model is generic, and thus can be adapted to any domain as long as the negotiators' preferences can be expressed in additive utilities. Our results indicate that the automated agent reaches more agreements and plays more effectively than its human counterparts. Moreover, in most of the cases, the automated agent achieves significantly better agreements, in terms of individual utility, than the human counterparts playing the same role.     

Functional knockout of the transient outward current, long-QT syndrome, and cardiac remodeling in mice expressing a dominant-negative Kv4 alpha subunit

Amino acid changes S180A (S-->A at site 180), H197Y, Y277F, T285A, and A308S are known to shift the maximum wavelength of absorption (lambda max) of red and green visual pigments toward blue, essentially in an additive fashion. To test the generality of this "five-sites" rule, we have determined the partial amino acid sequences of red and green pigments from five mammalian orders (Artiodactyla, Carnivora, Lagomorpha, Perissodactyla, and Rodentia). The result suggests that cat (Felis catus), dog (Canis familiaris), and goat (Capra hircus) pigments all with AHYTA at the five critical sites have lambda max values of approximately 530 nm, whereas rat (Rattus norvegicus) pigment with AYYTS has a lambda max value of approximately 510 nm, which is accurately predicted by the five-sites rule. However, the observed lambda max values of the orthologous pigments of European rabbit (Oryctolagus cuniculus), white-tailed deer (Odocoileus virginianus), gray squirrel (Sciurus carolinensis), and guinea pig (Cavia procellus) are consistently more than 10 nm higher than the predicted values, suggesting the existence of additional molecular mechanisms for red and green color vision. The inferred amino acid sequences of ancestral organisms suggest that the extant mammalian red and green pigments appear to have evolved from a single ancestral green-red hybrid pigment by directed amino acid substitutions.     

Longitudinal assessment of inpatient use and functioning of seriously mentally ill veterans with and without co-occurring substance use disorders

Within a fungal species, a subset of individuals may have more than the minimal complement of chromosomes. If the extra chromosomes are composed primarily of DNA not found in all representatives of the species, they are most appropriately referred to as supernumerary chromosomes. The patterns of repeated DNA sequences on certain supernumerary chromosomes suggest that they have a different evolutionary history from the essential chromosomes in the same genome. Supernumerary chromosomes can carry functional genes and, in at least two fungal species, genes on such chromosomes play important roles in host-pathogen interactions. Supernumerary chromosomes that confer an adaptive advantage in certain habitats, such as the ability to cause disease on a specific host, may be referred to as "conditionally dispensable" chromosomes in order to reflect their importance in some, but not all, growth conditions. In addition to describing the structural and functional characteristics of known supernumerary chromosomes in fungi, this review discusses the relative merits of the terms that have been used to describe them, and establishes experimental criteria for their identification.     

Monte Carlo techniques for phrase-based translation

Recent advances in statistical machine translation have used approximate beam search for NP-complete inference within probabilistic translation models. We present an alternative approach of sampling from the posterior distribution defined by a translation model. We define a novel Gibbs sampler for sampling translations given a source sentence and show that it effectively explores this posterior distribution. In doing so we overcome the limitations of heuristic beam search and obtain theoretically sound solutions to inference problems such as finding the maximum probability translation and minimum risk training and decoding.     

Negative results for software effort estimation

More than half the literature on software effort estimation (SEE) focuses on comparisons of new estimation methods. Surprisingly, there are no studies comparing state of the art latest methods with decades-old approaches. Accordingly, this paper takes five steps to check if new SEE methods generated better estimates than older methods. Firstly, collect effort estimation methods ranging from “classical” COCOMO (parametric estimation over a pre-determined set of attributes) to “modern” (reasoning via analogy using spectral-based clustering plus instance and feature selection, and a recent “baseline method” proposed in ACM Transactions on Software Engineering). Secondly, catalog the list of objections that lead to the development of post-COCOMO estimation methods. Thirdly, characterize each of those objections as a comparison between newer and older estimation methods. Fourthly, using four COCOMO-style data sets (from 1991, 2000, 2005, 2010) and run those comparisons experiments. Fifthly, compare the performance of the different estimators using a Scott-Knott procedure using (i) the A12 effect size to rule out “small” differences and (ii) a 99 % confident bootstrap procedure to check for statistically different groupings of treatments. The major negative result of this paper is that for the COCOMO data sets, nothing we studied did any better than Boehms original procedure. Hence, we conclude that when COCOMO-style attributes are available, we strongly recommend (i) using that data and (ii) use COCOMO to generate predictions. We say this since the experiments of this paper show that, at least for effort estimation, how data is collected is more important than what learner is applied to that data.