Integration of LIDAR and IFSAR for mapping

LiDAR and IfSAR data is now widely used for a number of applications, particularly those needing a digital elevation model. The data is often complementary to other data such as aerial imagery and high resolution satellite data. This paper will review the current data sources and the products and then look at the ways in which the data can be integrated for particular applications. The main platforms for LiDAR are either helicopter or fixed wing aircraft, often operating at low altitudes, a digital camera is frequently included on the platform, there is an interest in using other sensors such as 3 line cameras of hyperspectral scanners. IfSAR is used from satellite platforms, or from aircraft, the latter are more compatible with LiDAR for integration. The paper will examine the advantages and disadvantages of LiDAR and IfSAR for DEM generation and discuss the issues which still need to be dealt with. Examples of applications will be given and particularly those involving the integration of different types of data. Examples will be given from various sources and future trends examined

Network problems & algorythms

Special structure linear programming problems have received considerable attention during the last two decades and among them network problems are of particular importance and have found numerous applications in manage- ment science and technology. The mathematical models of the shortest route, maximal flow, and pure minimum cost flow problems are presented and various interrelationships among them are investigated. Finally three algorithms due to Dijkstra and Ford and Fulkerson which deal with the solution of the above three network problems are discussed

A weighted least squares solution for space intersection of spaceborne stereo SAR data

The use of stereoscopic SAR images offers an alternative to interferometric SAR for the generation of digital elevation models (DEMs). The stereo radargrammetric method is robust and can generate DEMs of sufficient accuracy to geocode SAR images. Previous work has shown that ground coordinates with accuracy of four times the resolution cell can be obtained from ERS data without using any ground control points (GCPs), where the high accuracy of the orbit and satellite position of the order of metres introduce insignificant errors into the intersection procedure. The orbit data for RADARSAT is not as accurate as that for ERS, and the perpendicular relationship between the resultant velocity vector and the resultant range vector is uncertain in terms of image geometry. Hence, it is necessary to refine the method to allow for possible errors. This paper introduces a weighted space intersection algorithm based on an analysis of the predicted errors. A radargrammetric error model for observation errors is also formulated to predict the accuracy of the algorithm. The revised method can be used without any GCPs, but this can lead to systematic errors due to less accurate orbit data, and it has been found that the use of two GCPs provides a reasonable solution. The method is insensitive to the spatial distribution of GCPs, which is often critical in traditional methods. The error statistics of the results generated from 32 independent check points, distributed through the entire SAR image, approach the predicted errors and give positional accuracy of 38 m in three dimensions

Chaotic Crystallography: How the physics of information reveals structural order in materials

We review recent progress in applying information- and computation-theoretic measures to describe material structure that transcends previous methods based on exact geometric symmetries. We discuss the necessary theoretical background for this new toolset and show how the new techniques detect and describe novel material properties. We discuss how the approach relates to well known crystallographic practice and examine how it provides novel interpretations of familiar structures. Throughout, we concentrate on disordered materials that, while important, have received less attention both theoretically and experimentally than those with either periodic or aperiodic order.Comment: 9 pages, two figures, 1 table; http://csc.ucdavis.edu/~cmg/compmech/pubs/ChemOpinion.ht

Combinatorial optimization and metaheuristics

Today, combinatorial optimization is one of the youngest and most active areas of discrete mathematics. It is a branch of optimization in applied mathematics and computer science, related to operational research, algorithm theory and computational complexity theory. It sits at the intersection of several fields, including artificial intelligence, mathematics and software engineering. Its increasing interest arises for the fact that a large number of scientific and industrial problems can be formulated as abstract combinatorial optimization problems, through graphs and/or (integer) linear programs. Some of these problems have polynomial-time (“efficient”) algorithms, while most of them are NP-hard, i.e. it is not proved that they can be solved in polynomial-time. Mainly, it means that it is not possible to guarantee that an exact solution to the problem can be found and one has to settle for an approximate solution with known performance guarantees. Indeed, the goal of approximate methods is to find “quickly” (reasonable run-times), with “high” probability, provable “good” solutions (low error from the real optimal solution). In the last 20 years, a new kind of algorithm commonly called metaheuristics have emerged in this class, which basically try to combine heuristics in high level frameworks aimed at efficiently and effectively exploring the search space. This report briefly outlines the components, concepts, advantages and disadvantages of different metaheuristic approaches from a conceptual point of view, in order to analyze their similarities and differences. The two very significant forces of intensification and diversification, that mainly determine the behavior of a metaheuristic, will be pointed out. The report concludes by exploring the importance of hybridization and integration methods

An extension of set partitioning with application to scheduling problems

The well known problems of set covering, set partitioning and set packing are defined and their interrelationship is considered. A natural generalisation called the extended set partitioning model is presented and the three standard models are shown to be special cases of this generalisation. In addition, the extended model includes another type of set problem which can be of greater use in certain applications. The model forms the basis of a computer assisted bus crew scheduling system developed by the authors. The system is in regular use by Dublin City Services in the Republic of Ireland. Finally, the equivalence between a special case of the set partitioning problem and the shortest route problem is considered and it is shown that this equivalence also applies to the extended model

Cultural transmission results in convergence towards colour term universals.

As in biological evolution, multiple forces are involved in cultural evolution. One force is analogous to selection, and acts on differences in the fitness of aspects of culture by influencing who people choose to learn from. Another force is analogous to mutation, and influences how culture changes over time owing to errors in learning and the effects of cognitive biases. Which of these forces need to be appealed to in explaining any particular aspect of human cultures is an open question. We present a study that explores this question empirically, examining the role that the cognitive biases that influence cultural transmission might play in universals of colour naming. In a large-scale laboratory experiment, participants were shown labelled examples from novel artificial systems of colour terms and were asked to classify other colours on the basis of those examples. The responses of each participant were used to generate the examples seen by subsequent participants. By simulating cultural transmission in the laboratory, we were able to isolate a single evolutionary force-the effects of cognitive biases, analogous to mutation-and examine its consequences. Our results show that this process produces convergence towards systems of colour terms similar to those seen across human languages, providing support for the conclusion that the effects of cognitive biases, brought out through cultural transmission, can account for universals in colour naming

Developments in linear and integer programming

In this review we describe recent developments in linear and integer (linear) programming. For over 50 years Operational Research practitioners have made use of linear optimisation models to aid decision making and over this period the size of problems that can be solved has increased dramatically, the time required to solve problems has decreased substantially and the flexibility of modelling and solving systems has increased steadily. Large models are no longer confined to large computers, and the flexibility of optimisation systems embedded in other decision support tools has made on-line decision making using linear programming a reality (and using integer programming a possibility). The review focuses on recent developments in algorithms, software and applications and investigates some connections between linear optimisation and other technologies

A co-operative parallel heuristic for integer linear programming: Combining simulated annealing with branch & bound

This paper considers the exact approach of branch and bound (B&B) and the metaheuristic known as simulated annealing (SA) for processing integer programs (IP). We extend an existing SA implementation (GPSIMAN) for pure zero–one integer programs (PZIP) to process a wider class of IP models, namely mixed zero–one integer programs (MZIP). The extensions are based on depth-first B&B searches at different points within the SA framework. We refer to the resultant SA implementation as MIPSA. Furthermore, we have exploited the use of parallel computers by designing a co-operative parallel heuristic whereby concurrent executions of B&B and MIPSA, linked through a parallel computer, exchange information in order to influence their searches. Results reported for a wide range of models taken from a library of MIP benchmarks demonstrate the effectiveness of using a parallel computing approach which combines B&B with SA