Rock map of the Yellow River (Huang He) expedition, China, 1925-1927 : Sheet 10

This layer is part of a set of georeferenced, raster images of the manuscript, paper map set entitled: Ch'ing-Hai upper Yellow River expedition : Rock and Simpson, 1925-27, [cartography by J.F. Rock]. Scale 1:250,000. This layer image is of Sheet X [of 10] covering a portion of the Yellow River (Huang He) region in northeastern Sichuan Sheng, China, including the source of the Min Chiang (Min Jiang). The map set details the route and surrounding environs of the Arnold Arboretum's "Western China" expedition led by Joseph Rock, 1924-1927. The set covers a portion of the Yellow River (Huang He) region in south central China (Qinghai, Gansu, and Sichuan shengs (a portion of historic Tibet)). It shows features, labeled variously in English, Chinese, Wade-Giles transliteration, and Tibetan, including: rivers, streams, lakes, mountains, gorges, valleys, plateaus, plains, cities, towns, villages, provincial capitals, county seats, passes, monasteries, ruin sites, native tribe locations, and more. Relief is shown by hachures, spot heights, and landform drawings. The original manuscript map set is part of the Harvard College Library, Harvard Map Collection. "Joseph Rock traced his travels for the [Arnold] Arboretum's [Western China] 1924-1927 expedition in a colorful, hand-drawn map entitled 'Ch'ing-Hai upper Yellow River expedition.' The pen-and-ink drawing was made on ten sheets that when joined form a single, irregularly-shaped map, approximately six by eight feet in size. The individual sheets are numbered, using roman numerals; on sheet VII is a second title, 'Choni Territory, Upper and Lower T'ieh-Pu country and route to Sung-Pan, J. F. Rock, 1925-1927.' Topographical and other features are identified using a combination of English, Chinese characters, Wade-Giles transliterations and Tibetan script. Rock's attractive cursive style and use of hachures, spot heights, and landform drawings to depict relief add character to the map." -- Text from the Arnold Arboretum Web site.

Rock map of the Yellow River (Huang He) expedition, China, 1925-1927 : Sheet 1

This layer is part of a set of georeferenced, raster images of the manuscript, paper map set entitled: Ch'ing-Hai upper Yellow River expedition : Rock and Simpson, 1925-27, [cartography by J.F. Rock]. Scale 1:250,000. This layer image is of Sheet I [of 10] covering a portion of the Yellow River (Huang He) region in eastern Qinghai Sheng, China. The map set details the route and surrounding environs of the Arnold Arboretum's "Western China" expedition led by Joseph Rock, 1924-1927. The set covers a portion of the Yellow River (Huang He) region in south central China (Qinghai, Gansu, and Sichuan shengs (a portion of historic Tibet)). It shows features, labeled variously in English, Chinese, Wade-Giles transliteration, and Tibetan, including: rivers, streams, lakes, mountains, gorges, valleys, plateaus, plains, cities, towns, villages, provincial capitals, county seats, passes, monasteries, ruin sites, native tribe locations, and more. Relief is shown by hachures, spot heights, and landform drawings. The original manuscript map set is part of the Harvard College Library, Harvard Map Collection. "Joseph Rock traced his travels for the [Arnold] Arboretum's [Western China] 1924-1927 expedition in a colorful, hand-drawn map entitled 'Ch'ing-Hai upper Yellow River expedition.' The pen-and-ink drawing was made on ten sheets that when joined form a single, irregularly-shaped map, approximately six by eight feet in size. The individual sheets are numbered, using roman numerals; on sheet VII is a second title, 'Choni Territory, Upper and Lower T'ieh-Pu country and route to Sung-Pan, J. F. Rock, 1925-1927.' Topographical and other features are identified using a combination of English, Chinese characters, Wade-Giles transliterations and Tibetan script. Rock's attractive cursive style and use of hachures, spot heights, and landform drawings to depict relief add character to the map." -- Text from the Arnold Arboretum Web site.

Nucleation regime map for liquid bound granules

Nucleation is the first step in granulation where the powder and liquid first contact. Two types of nucleation in wet granulation processes are proposed. Drop controlled nucleation, where one drop forms one nucleus, occurs when drops hitting the powder surface do not overlap (low spray flux Psi(a)) and the drop must wet quickly into the bed (short drop penetration time t(p)). If either criterion is not met, powder mixing characteristics will dominate (mechanical dispersion regime). Granulation experiments were performed with lactose powder, water, PEG200, and 7% HPC solution in a 6 L and a 25 L mixer granulator. Size distributions were measured as the drop penetration time and spray flux were varied. At short penetration times, decreasing Psi(a) caused the nuclei distribution to become narrower. When drop penetration time was high, the nuclei size distribution was broad independent of changes in dimensionless spray flux. Nucleation regime maps were plotted for each set of experiments in each mixer as a function of the dimensionless distribution width delta. The nucleation regime map demonstrates the interaction between drop penetration time and spray flux in nucleation. The narrowest distribution consistently occurred at low spray flux and low penetration time, proving the existence of the drop controlled regime. The nucleation regime map provides a rational basis for design and scale-up of nucleation and wetting in wet granulation.

Incorporating level set methods in Geographical Information Systems (GIS) for land-surface process modelling

Land-surface processes include a broad class of models that operate at a landscape scale. Current modelling approaches tend to be specialised towards one type of process, yet it is the interaction of processes that is increasing seen as important to obtain a more integrated approach to land management. This paper presents a technique and a tool that may be applied generically to landscape processes. The technique tracks moving interfaces across landscapes for processes such as water flow, biochemical diffusion, and plant dispersal. Its theoretical development applies a Lagrangian approach to motion over a Eulerian grid space by tracking quantities across a landscape as an evolving front. An algorithm for this technique, called level set method, is implemented in a geographical information system (GIS). It fits with a field data model in GIS and is implemented as operators in map algebra. The paper describes an implementation of the level set methods in a map algebra programming language, called MapScript, and gives example program scripts for applications in ecology and hydrology.

Recursive self-organizing map as a contractive iterative function system

Recently, there has been a considerable research activity in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. However, the representational capabilities and internal representations of the models are not well understood. We rigorously analyze a generalization of the Self-Organizing Map (SOM) for processing sequential data, Recursive SOM (RecSOM [1]), as a non-autonomous dynamical system consisting off a set of fixed input maps. We show that contractive fixed input maps are likely to produce Markovian organizations of receptive fields o the RecSOM map. We derive bounds on parameter $\beta$ (weighting the importance of importing past information when processing sequences) under which contractiveness of the fixed input maps is guaranteed.

An integer-valued data envelopment analysis model with bounded outputs

Integer-valued data envelopment analysis (DEA) with alternative returns to scale technology has been introduced and developed recently by Kuosmanen and Kazemi Matin. The proportionality assumption of their introduced "natural augmentability" axiom in constant and nondecreasing returns to scale technologies makes it possible to achieve feasible decision-making units (DMUs) of arbitrary large size. In many real world applications it is not possible to achieve such production plans since some of the input and output variables are bounded above. In this paper, we extend the axiomatic foundation of integer-valuedDEAmodels for including bounded output variables. Some model variants are achieved by introducing a new axiom of "boundedness" over the selected output variables. A mixed integer linear programming (MILP) formulation is also introduced for computing efficiency scores in the associated production set. © 2011 The Authors. International Transactions in Operational Research © 2011 International Federation of Operational Research Societies.

Optimal design of the renewable energy map of Greece using weighted goal-programming and data envelopment analysis

Renewable energy forms have been widely used in the past decades highlighting a "green" shift in energy production. An actual reason behind this turn to renewable energy production is EU directives which set the Union's targets for energy production from renewable sources, greenhouse gas emissions and increase in energy efficiency. All member countries are obligated to apply harmonized legislation and practices and restructure their energy production networks in order to meet EU targets. Towards the fulfillment of 20-20-20 EU targets, in Greece a specific strategy which promotes the construction of large scale Renewable Energy Source plants is promoted. In this paper, we present an optimal design of the Greek renewable energy production network applying a 0-1 Weighted Goal Programming model, considering social, environmental and economic criteria. In the absence of a panel of experts Data Envelopment Analysis (DEA) approach is used in order to filter the best out of the possible network structures, seeking for the maximum technical efficiency. Super-Efficiency DEA model is also used in order to reduce the solutions and find the best out of all the possible. The results showed that in order to achieve maximum efficiency, the social and environmental criteria must be weighted more than the economic ones.

A virtual species set for robust and reproducible species distribution modelling tests

Predicting species potential and future distribution has become a relevant tool in biodiversity monitoring and conservation.In this data article we present the suitability map of a virtual species generated based on two bioclimatic variables, and a dataset containing more than 700,000 random observations at the extent of Europe. The dataset includes spatial attributes such as: distance to roads, protected areas, country codes, and the habitat suitability of two spatially clustered species (grassland and forest species) and a wide-spread species.

Habitat Map for Lizard Island reef, Australia derived from a photo-transect survey field data collected in December 2011 and September/October 2012

An object based image analysis approach (OBIA) was used to create a habitat map of the Lizard Reef. Briefly, georeferenced dive and snorkel photo-transect surveys were conducted at different locations surrounding Lizard Island, Australia. For the surveys, a snorkeler or diver swam over the bottom at a depth of 1-2m in the lagoon, One Tree Beach and Research Station areas, and 7m depth in Watson's Bay, while taking photos of the benthos at a set height using a standard digital camera and towing a surface float GPS which was logging its track every five seconds. The camera lens provided a 1.0 m x 1.0 m footprint, at 0.5 m height above the benthos. Horizontal distance between photos was estimated by fin kicks, and corresponded to a surface distance of approximately 2.0 - 4.0 m. Approximation of coordinates of each benthic photo was done based on the photo timestamp and GPS coordinate time stamp, using GPS Photo Link Software (www.geospatialexperts.com). Coordinates of each photo were interpolated by finding the gps coordinates that were logged at a set time before and after the photo was captured. Dominant benthic or substrate cover type was assigned to each photo by placing 24 points random over each image using the Coral Point Count excel program (Kohler and Gill, 2006). Each point was then assigned a dominant cover type using a benthic cover type classification scheme containing nine first-level categories - seagrass high (>=70%), seagrass moderate (40-70%), seagrass low (<= 30%), coral, reef matrix, algae, rubble, rock and sand. Benthic cover composition summaries of each photo were generated automatically in CPCe. The resulting benthic cover data for each photo was linked to GPS coordinates, saved as an ArcMap point shapefile, and projected to Universal Transverse Mercator WGS84 Zone 56 South. The OBIA class assignment followed a hierarchical assignment based on membership rules with levels for "reef", "geomorphic zone" and "benthic community" (above).

Nowhere Landscape, for Clarinets, Trombones, Percussion, Violins, and Electronics and “The Map and the Territory: Documenting David Dunn’s Sky Drift”

1. nowhere landscape, for clarinets, trombones, percussion, violins, and electronics

nowhere landscape is an eighty-minute work for nine performers, composed of acoustic and electronic sounds. Its fifteen movements invoke a variety of listening strategies, using slow change, stasis, layering, coincidence, and silence to draw attention to the sonic effects of the environment—inside the concert hall as well as the world outside of it. The work incorporates a unique stage set-up: the audience sits in close proximity to the instruments, facing in one of four different directions, while the musicians play from a number of constantly-shifting locations, including in front of, next to, and behind the audience.

Much of nowhere landscape’s material is derived from a collection of field recordings

made by the composer during a road trip from Springfield, MA to Douglas, WY along US- 20, a cross-country route made effectively obsolete by the completion of I-90 in the mid- 20th century. In an homage to artist Ed Ruscha’s 1963 book Twentysix Gasoline Stations, the composer made twenty-six recordings at gas stations along US-20. Many of the movements of nowhere landscape examine the musical potential of these captured soundscapes: familiar and anonymous, yet filled with poignancy and poetic possibility.

2. “The Map and the Territory: Documenting David Dunn’s Sky Drift”

In 1977, David Dunn recruited twenty-six musicians to play his work Sky Drift in the

Anza-Borrego Desert in Southern California. This outdoor performance was documented with photos and recorded with four stationary microphones to tape. A year later, Dunn presented the work in New York City as a “performance/documentation,” playing back the audio recording and projecting slides. In this paper I examine the consequences of this kind of act: what does it mean for a recording of an outdoor work to be shared at an indoor concert event? Can such a complex and interactive experience be successfully flattened into some kind of re-playable documentation? What can a recording capture and what must it exclude?

This paper engages with these questions as they relate to David Dunn’s Sky Drift and to similar works by Karlheinz Stockhausen and John Luther Adams. These case-studies demonstrate different solutions to the difficulty of documenting outdoor performances. Because this music is often heard from a variety of equally-valid perspectives—and because any single microphone only captures sound from one of these perspectives—the physical set-up of these kind of pieces complicate what it means to even “hear the music” at all. To this end, I discuss issues around the “work itself” and “aura” as well as “transparency” and “liveness” in recorded sound, bringing in thoughts and ideas from Walter Benjamin, Howard Becker, Joshua Glasgow, and others. In addition, the artist Robert Irwin and the composer Barry Truax have written about the conceptual distinctions between “the work” and “not- the-work”; these distinctions are complicated by documentation and recording. Without the context, the being-there, the music is stripped of much of its ability to communicate meaning.

Mapping social values of ecosystem services: What is behind the map?

A growing interest in mapping the social value of ecosystem services (ES) is not yet methodologically aligned with what is actually being mapped. We critically examine aspects of the social value mapping process that might influence map outcomes and limit their practical use in decision making. We rely on an empirical case of participatory mapping, for a single ES (recreation opportunities), which involves diverse stakeholders such as planners, researchers, and community representatives. Value elicitation relied on an individual open-ended interview and a mapping exercise. Interpretation of the narratives and GIS calculations of proximity, centrality, and dispersion helped in exploring the factors driving participants’ answers. Narratives reveal diverse value types. Whereas planners highlighted utilitarian and aesthetic values, the answers from researchers revealed naturalistic values as well. In turn community representatives acknowledged symbolic values. When remitted to the map, these values were constrained to statements toward a much narrower set of features of the physical (e.g., volcanoes) and built landscape (e.g., roads). The results suggest that mapping, as an instrumental approach toward social valuation, may capture only a subset of relevant assigned values. This outcome is the interplay between participants’ characteristics, including their acquaintance with the territory and their ability with maps, and the mapping procedure itself, including the proxies used to represent the ES and the value typology chosen, the elicitation question, the cartographic features displayed on the base map, and the spatial scale.

The Plastic Coupled Map Lattice: a Novel Image‐processing Paradigm

Coupled map lattices (CML) can describe many relaxation and optimization algorithms currently used in image processing. We recently introduced the ‘‘plastic‐CML’’ as a paradigm to extract (segment) objects in an image. Here, the image is applied by a set of forces to a metal sheet which is allowed to undergo plastic deformation parallel to the applied forces. In this paper we present an analysis of our ‘‘plastic‐CML’’ in one and two dimensions, deriving the nature and stability of its stationary solutions. We also detail how to use the CML in image processing, how to set the system parameters and present examples of it at work. We conclude that the plastic‐CML is able to segment images with large amounts of noise and large dynamic range of pixel values, and is suitable for a very large scale integration(VLSI) implementation.

Aplicação de um value stream map nos serviços após venda automóvel

O projeto desenvolvido tem como objetivo principal a melhoria da eficiência na prestação de serviços de reparação de chapa e pintura na Caetano Auto Colisão, através da aplicação de ferramentas associadas à filosofia Lean. Apesar das ferramentas e técnicas lean estarem bem exploradas nas empresas de produção e manufatura, o mesmo não se verifica em relação às empresas da área dos serviços. O Value Stream Mapping é uma ferramenta lean que consiste no mapeamento do fluxo de materiais e informação necessários para a realização das atividades (que acrescentam e não acrescentam valor), desempenhadas pelos colaboradores, fornecedores e distribuidores, desde a obtenção do pedido do cliente até à entrega final do serviço. Através desta ferramenta é possível identificar as atividades que não acrescentam valor para o processo e propor medidas de melhoria que resultem na eliminação ou redução das mesmas. Com base neste conceito, foi realizado o mapeamento do processo de prestação de serviços de chapa e pintura e identificados os focos de ineficiência. A partir desta análise foram sugeridas melhorias que têm como objetivo atingir o estado futuro proposto assim como tornar o processo mais eficiente. Duas destas melhorias passaram pela implementação dos 5S na sala das tintas e pela elaboração de um relatório A3 para o centro de lavagens. O projeto realizado permitiu o estudo de um problema real numa empresa de serviços, bem como a proposta de um conjunto de melhorias que a médio prazo se espera virem a contribuir para a melhoria da eficiência na prestação de serviços de chapa e pintura.

Efficient Image and Video Representations for Retrieval

Image (Video) retrieval is an interesting problem of retrieving images (videos) similar to the query. Images (Videos) are represented in an input (feature) space and similar images (videos) are obtained by finding nearest neighbors in the input representation space. Numerous input representations both in real valued and binary space have been proposed for conducting faster retrieval. In this thesis, we present techniques that obtain improved input representations for retrieval in both supervised and unsupervised settings for images and videos. Supervised retrieval is a well known problem of retrieving same class images of the query. We address the practical aspects of achieving faster retrieval with binary codes as input representations for the supervised setting in the first part, where binary codes are used as addresses into hash tables. In practice, using binary codes as addresses does not guarantee fast retrieval, as similar images are not mapped to the same binary code (address). We address this problem by presenting an efficient supervised hashing (binary encoding) method that aims to explicitly map all the images of the same class ideally to a unique binary code. We refer to the binary codes of the images as `Semantic Binary Codes' and the unique code for all same class images as `Class Binary Code'. We also propose a new class­ based Hamming metric that dramatically reduces the retrieval times for larger databases, where only hamming distance is computed to the class binary codes. We also propose a Deep semantic binary code model, by replacing the output layer of a popular convolutional Neural Network (AlexNet) with the class binary codes and show that the hashing functions learned in this way outperforms the state­ of ­the art, and at the same time provide fast retrieval times. In the second part, we also address the problem of supervised retrieval by taking into account the relationship between classes. For a given query image, we want to retrieve images that preserve the relative order i.e. we want to retrieve all same class images first and then, the related classes images before different class images. We learn such relationship aware binary codes by minimizing the similarity between inner product of the binary codes and the similarity between the classes. We calculate the similarity between classes using output embedding vectors, which are vector representations of classes. Our method deviates from the other supervised binary encoding schemes as it is the first to use output embeddings for learning hashing functions. We also introduce new performance metrics that take into account the related class retrieval results and show significant gains over the state­ of­ the art. High Dimensional descriptors like Fisher Vectors or Vector of Locally Aggregated Descriptors have shown to improve the performance of many computer vision applications including retrieval. In the third part, we will discuss an unsupervised technique for compressing high dimensional vectors into high dimensional binary codes, to reduce storage complexity. In this approach, we deviate from adopting traditional hyperplane hashing functions and instead learn hyperspherical hashing functions. The proposed method overcomes the computational challenges of directly applying the spherical hashing algorithm that is intractable for compressing high dimensional vectors. A practical hierarchical model that utilizes divide and conquer techniques using the Random Select and Adjust (RSA) procedure to compress such high dimensional vectors is presented. We show that our proposed high dimensional binary codes outperform the binary codes obtained using traditional hyperplane methods for higher compression ratios. In the last part of the thesis, we propose a retrieval based solution to the Zero shot event classification problem - a setting where no training videos are available for the event. To do this, we learn a generic set of concept detectors and represent both videos and query events in the concept space. We then compute similarity between the query event and the video in the concept space and videos similar to the query event are classified as the videos belonging to the event. We show that we significantly boost the performance using concept features from other modalities.

Self-Organizing Map Neural Architectures Based on Limit Cycle Attractors

Recent efforts to develop large-scale neural architectures have paid relatively little attention to the use of self-organizing maps (SOMs). Part of the reason is that most conventional SOMs use a static encoding representation: Each input is typically represented by the fixed activation of a single node in the map layer. This not only carries information in an inefficient and unreliable way that impedes building robust multi-SOM neural architectures, but it is also inconsistent with rhythmic oscillations in biological neural networks. Here I develop and study an alternative encoding scheme that instead uses limit cycle attractors of multi-focal activity patterns to represent input patterns/sequences. Such a fundamental change in representation raises several questions: Can this be done effectively and reliably? If so, will map formation still occur? What properties would limit cycle SOMs exhibit? Could multiple such SOMs interact effectively? Could robust architectures based on such SOMs be built for practical applications? The principal results of examining these questions are as follows. First, conditions are established for limit cycle attractors to emerge in a SOM through self-organization when encoding both static and temporal sequence inputs. It is found that under appropriate conditions a set of learned limit cycles are stable, unique, and preserve input relationships. In spite of the continually changing activity in a limit cycle SOM, map formation continues to occur reliably. Next, associations between limit cycles in different SOMs are learned. It is shown that limit cycles in one SOM can be successfully retrieved by another SOM’s limit cycle activity. Control timings can be set quite arbitrarily during both training and activation. Importantly, the learned associations generalize to new inputs that have never been seen during training. Finally, a complete neural architecture based on multiple limit cycle SOMs is presented for robotic arm control. This architecture combines open-loop and closed-loop methods to achieve high accuracy and fast movements through smooth trajectories. The architecture is robust in that disrupting or damaging the system in a variety of ways does not completely destroy the system. I conclude that limit cycle SOMs have great potentials for use in constructing robust neural architectures.