Data partitioning for parallel spatial join processing

The cost of spatial join processing can be very high because of the large sizes of spatial objects and the computation-intensive spatial operations. While parallel processing seems a natural solution to this problem, it is not clear how spatial data can be partitioned for this purpose. Various spatial data partitioning methods are examined in this paper. A framework combining the data-partitioning techniques used by most parallel join algorithms in relational databases and the filter-and-refine strategy for spatial operation processing is proposed for parallel spatial join processing. Object duplication caused by multi-assignment in spatial data partitioning can result in extra CPU cost as well as extra communication cost. We find that the key to overcome this problem is to preserve spatial locality in task decomposition. We show in this paper that a near-optimal speedup can be achieved for parallel spatial join processing using our new algorithms.

Practical parallel coset enumeration

Coset enumeration is a most important procedure for investigating finitely presented groups. We present a practical parallel procedure for coset enumeration on shared memory processors. The shared memory architecture is particularly interesting because such parallel computation is both faster and cheaper. The lower cost comes when the program requires large amounts of memory, and additional CPU's. allow us to lower the time that the expensive memory is being used. Rather than report on a suite of test cases, we take a single, typical case, and analyze the performance factors in-depth. The parallelization is achieved through a master-slave architecture. This results in an interesting phenomenon, whereby the CPU time is divided into a sequential and a parallel portion, and the parallel part demonstrates a speedup that is linear in the number of processors. We describe an early version for which only 40% of the program was parallelized, and we describe how this was modified to achieve 90% parallelization while using 15 slave processors and a master. In the latter case, a sequential time of 158 seconds was reduced to 29 seconds using 15 slaves.

The knowledge gap: A perspective on trade, industry, technology and policy from pre-war Australian music technology manufacturing (1903-30)

Australia struggles to achieve economic competitiveness, prevent expansion of the trade deficit and develop value-added production despite applications of policy strategies from protectionism to trade liberalisation. This article argues that these problems were emerging at the turn of the century, and that an investigation of music technology manufacturing in the first two decades of this century reveals fundamental problems in the conduct of relevant policy analysis. Analysis has focused on the trade or technology gap which is only symptomatic of an underlying knowledge gap. The article calls for a knowledge policy approach which can allow protection without the negative effects of isolation from global markets and without having to resort to unworkable utopian free-trade dogma. A shift of focus from a 'goods traded' view to a knowledge transaction (or diffusion) perspective is advocated.

Computational chemistry on Fujitsu vector-parallel processors: Development and performance of applications software

In this and a preceding paper, we provide an introduction to the Fujitsu VPP range of vector-parallel supercomputers and to some of the computational chemistry software available for the VPP. Here, we consider the implementation and performance of seven popular chemistry application packages. The codes discussed range from classical molecular dynamics to semiempirical and ab initio quantum chemistry. All have evolved from sequential codes, and have typically been parallelised using a replicated data approach. As such they are well suited to the large-memory/fast-processor architecture of the VPP. For one code, CASTEP, a distributed-memory data-driven parallelisation scheme is presented. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

Target similarity effects: Support for the parallel distributed processing assumptions

Recent research has begun to provide support for the assumptions that memories are stored as a composite and are accessed in parallel (Tehan & Humphreys, 1998). New predictions derived from these assumptions and from the Chappell and Humphreys (1994) implementation of these assumptions were tested. In three experiments, subjects studied relatively short lists of words. Some of the Lists contained two similar targets (thief and theft) or two dissimilar targets (thief and steal) associated with the same cue (ROBBERY). AS predicted, target similarity affected performance in cued recall but not free association. Contrary to predictions, two spaced presentations of a target did not improve performance in free association. Two additional experiments confirmed and extended this finding. Several alternative explanations for the target similarity effect, which incorporate assumptions about separate representations and sequential search, are rejected. The importance of the finding that, in at least one implicit memory paradigm, repetition does not improve performance is also discussed.

Parallel processing and image analysis in the eyes of mantis shrimps

The compound eyes of mantis shrimps, a group of tropical marine crustaceans, incorporate principles of serial and parallel processing of visual information that may be applicable to artificial imaging systems. Their eyes include numerous specializations for analysis of the spectral and polarizational properties of light, and include more photoreceptor classes for analysis of ultraviolet light, color, and polarization than occur in any other known visual system. This is possible because receptors in different regions of the eye are anatomically diverse and incorporate unusual structural features, such as spectral filters, not seen in other compound eyes. Unlike eyes of most other animals, eyes of mantis shrimps must move to acquire some types of visual information and to integrate color and polarization with spatial vision. Information leaving the retina appears to be processed into numerous parallel data streams leading into the central nervous system, greatly reducing the analytical requirements at higher levels. Many of these unusual features of mantis shrimp vision may inspire new sensor designs for machine vision

Spatial aspects of trade liberalization in Colombia: A general equilibrium approach

This paper offers some preliminary steps in the marriage of some of the theoretical foundations of new economic geography with spatial computable general equilibrium models. Modelling the spatial economy of Colombia using the traditional assumptions of computable general equilibrium (CGE) models makes little sense when one territorial unit, Bogota, accounts for over one quarter of GDP and where transportation costs are high and accessibility low compared to European or North American standards. Hence, handling market imperfections becomes imperative as does the need to address internal spatial issues from the perspective of Colombia`s increasing involvement with external markets. The paper builds on the Centro de Estudios de Economia Regional (CEER) model, a spatial CGE model of the Colombian economy; non-constant returns and non-iceberg transportation costs are introduced and some simulation exercises carried out. The results confirm the asymmetric impacts that trade liberalization has on a spatial economy in which one region, Bogota, is able to more fully exploit scale economies vis--vis the rest of Colombia. The analysis also reveals the importance of different hypotheses on factor mobility and the role of price effects to better understand the consequences of trade opening in a developing economy.

An analysis of US greenhouse gas cap-and-trade proposals using a forward-looking economic model

We develop a forward-looking version of the recursive dynamic MIT Emissions Prediction and Policy Analysis (EPPA) model, and apply it to examine the economic implications of proposals in the US Congress to limit greenhouse gas (GHG) emissions. We find that shocks in the consumption path are smoothed out in the forward-looking model and that the lifetime welfare cost of GHG policy is lower than in the recursive model, since the forward-looking model can fully optimize over time. The forward-looking model allows us to explore issues for which it is uniquely well suited, including revenue-recycling and early action crediting. We find capital tax recycling to be more welfare-cost reducing than labor tax recycling because of its long-term effect on economic growth. Also, there are substantial incentives for early action credits; however, when spread over the full horizon of the policy they do not have a substantial effect on lifetime welfare costs.

TRADE-OFF BETWEEN IMMUNE STIMULATION AND EXPRESSION OF STORAGE PROTEIN GENES

Proteins stored in insect hemolymph may serve (is a source of amino acids and energy for metabolism, and development. The expression of the main storage proteins was assessed in bacterial-challenged honey bees using real-time (RT)-PCH and Western blot.. After ensuring that. the immune system had, been activated by measuring the ensuing expression (, the innate immune response genes, defensin-1 (def-1) and prophenoloxidase (pro PO), we verified the expression of four genes encoding storage proteins. The levels of vitellogenin (vg) mRNA and of the respective protein. were significantly lowered in bees injected with bacteria or water only (injury). An equivalent response was observed in orally-infected bees. The levels of apolipophorin II/I (apoLP-II/I) and hexamerin (hex 70a) mRNAs did not significantly change, but levels of Hex 70a protein subunit showed a substantial decay after bacterial challenge or injury. Infection also caused a strong reduction in the levels of apoLP-III transcripts. Our findings are consistent with a down-regulation, of the express and accumulation of storage proteins as a consequence of activation of the immune system, suggesting that this phenomenon. represents a strategy to redirect resources to combat injury or infection. (C) 2009 Wiley Periodicals, Inc.

Trade spectrum of K4-e

A K-4 - e trade consists of two disjoint decompositions of some simple graph H into copies of K-4 - e. The number of vertices of H is referred to as the foundation of the trade, while the number of copies of K-4 - e in each of the decompositions is called the volume of the trade. We determine the values of v and s for which there exists a K-4 - e trade of volume s and foundation v.

Strategic trade policy under uncertainty: Sufficient conditions for the optimality of ad valorem, specific and quadratic trade taxes

In most previous work on strategic trade policy the form of government intervention has been prescribed in advance. In this paper, we apply a solution concept discussed by Klemperer and Meyer for games in which the strategy space consists of the class of all (non state-contingent) price quantity schedules. We examine a series of specific assumptions on demand and supply conditions and derive the associated equilibrium trade policies. We derive welfare implications for all cases examined.

Alternatives for parallel Krylov subspace basis computation

Numerical methods related to Krylov subspaces are widely used in large sparse numerical linear algebra. Vectors in these subspaces are manipulated via their representation onto orthonormal bases. Nowadays, on serial computers, the method of Arnoldi is considered as a reliable technique for constructing such bases. However, although easily parallelizable, this technique is not as scalable as expected for communications. In this work we examine alternative methods aimed at overcoming this drawback. Since they retrieve upon completion the same information as Arnoldi's algorithm does, they enable us to design a wide family of stable and scalable Krylov approximation methods for various parallel environments. We present timing results obtained from their implementation on two distributed-memory multiprocessor supercomputers: the Intel Paragon and the IBM Scalable POWERparallel SP2. (C) 1997 by John Wiley & Sons, Ltd.