30879884
Generation of lower bounds for minimum span frequency assignment
Minimum span frequency assignment problems require lower bounds for the span in order to assess the quality of individual assignments, and to effectively compare different meta-heuristic algorithms. The generation of good lower bounds requires the identification of critical subproblems. These subproblems are subgraphs of a constraint graph. Sometimes clique subgraphs lead to good lower bounds. However for some problems the clique must be modified in order to obtain the best possible bound. This can be time consuming, requires manual intervention and is dependent on the initial clique obtained and the specific problem. For practical use, a simple bounding technique is needed that can be universally applied to all problems without modification. Two algorithms based on meta-heuristics are presented that aim to find a subproblem that gives the best possible lower bound. This avoids the need for clique detection routines and manual intervention, and gives a robust and automatic method for generating lower bounds for all minimum span problems. These algorithms use mathematical programming formulations of the frequency assignment problem. Extensive testing on a wide range of problems shows that bounds from the new algorithms match those using previous techniques, and in some cases are significantly better.
18928754
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
Frequencies have to be assigned to transmitters whenever a radio network is established or modified. This is ideally done is a way which minimises interference in the network. Lower bounds are necessary to establish the effectiveness of the heuristic algorithms used for this task and to assess the quality of the assignments obtained. 
 
In the fixed spectrum frequency assignment problem the available frequencies are known in advance. The constraints are often binary constraints, specifying the necessary frequency separation between given pairs of transmitters. There may be penalties (or weights) associated with the violation of each constraint; it is then either necessary to minimise the number of constraints violated or, increasingly often, to minimise the sum of the weights associated with violated constraints. 
 
A technique for generating lower bounds for these quantities is presented. This is an evolution of a technique which has recently appeared in the literature. It produces better quality bounds, is in general significantly faster and allows larger problems to be handled.
26823713
Top-Down Synthesis of Divide-and-Conquer Algorithms
Abstract A top-down method is presented for the derivation of algorithms from a formal specification of a problem. This method has been implemented in a system called cypress . The synthesis process involves the top-down decomposition of the initial specification into a hierarchy of specifications for subproblems. Synthesizing programs for each of these subproblems results in the composition of a hierarchically structured program. The initial specification is allowed to be partial in that some or all of the input conditions may be missing. cypress completes the specification and produces a totally correct applicative program. Much of cypress ' knowledge comes in the form of ‘design strategies’ for various classes of algorithms. The structure of a class of divide-and-conquer algorithms is explored and provides the basis for several design strategies. Detailed derivations of mergesort and quicksort algorithms are presented.
44972038
Project CALC: Calculus as a Laboratory Course
Calculus is the study of change. The concepts of calculus enable us to model processes that change and to describe properties of these processes that remain constant in the midst of change. Now change has come to the learning of calculus -change driven by the need to respond to the revolution in technology and fueled by funds from the United States National Science Foundation. What should be changed? How and how fast? What should remain constant? In this paper we describe one answer to these questions: Project CALC, a new calculus course developed at Duke University. The key features of our approach are real-world problems, hands-on activities, discovery learning, writing and revision of writing, teamwork, and intelligent use of available tools.
8670255
Applications of a Strategy for Designing Divide-and-Conquer Algorithms
Abstract A strategy for designing divide-and-conquer algorithms that was originally presented in a previous article is extended and applied to several new problems. The extension involves techniques for modifying the original specification based on specific kinds of failures that can occur during the design process. We derive several divide-and-conquer algorithms that are substantially more efficient than previously known algorithms. This paper also emphasizes the naturalness with which divide-and-conquer algorithms can be transformed into a parallel format. One problem explored is to find the maximum sum over all rectangular subregions of a given matrix of integers. For an n × n matrix there is a straightforward O(n6) enumeration algorithm. We derive a O(n3) divide-and-conquer algorithm, then show that it can be executed in O(log2n) time in parallel and, furthermore, with pipelining of inputs it can be executed with O(1) time between successive outputs.
16933924
Using architecture evaluation to prepare a large Web based system for evolution
This paper describes an ongoing effort to develop architecture documentation and to evaluate the architecture using the Architecture Tradeoff Analysis Method/sup SM/ (ATAM/sup SM/). The system is a large Web based application using J2EE, portal and Web services technology that is replacing a large number of legacy applications. It has very detailed documentation at the design level, but is lacking overall architecture documentation. We describe how the architecture is being documented in an iterative manner, and how sample scenarios are being developed as input for an ATAM. The package of the documentation, scenarios and ATAM will fill in important gaps in existing knowledge, and it will provide an important baseline for the system's evolution.
13000609
Disambiguating Geographic Names in a Historical Digital Library
Geographic interfaces provide natural, scalable visualizationss for many digital library collections, but the wide range of data in digital libraries presents some particular problems for identifying and disambiguating place names. We describe the toponym-disambiguation system in the Perseus digital library and evaluate its performance. Name categorization varies significantly among different types of documents, but toponym disambiguation performs at a high level of precision and recall with a gazetteer an order of magnitude larger than most other applications.