Procurement and development program for nickel-cadmium cells to specification s-615-p-2 Technical status report no. 12, May 25 - Aug. 26, 1966

Procurement, development, and testing of nickel- cadmium cell

Le coût économique des politiques de réduction de la mobilité

Le système de transport, qui joue un rôle décisif dans le dynamisme économique des grandes agglomérations, se trouve confronté dans la plupart de ces villes à une double difficulté environnementale et financière (financement des infrastructures pour accompagner l'augmentation de la demande de transport, financement des transports collectifs, etc.). Parmi les raisons qui sont invoquées pour rendre compte de ces difficultés, on trouve de plus en plus cité l'étalement urbain. Des comparaisons entre les grandes villes mondiales [Base Millenium UITP, 1996] peuvent montrer en effet que les villes les moins denses sont aussi les villes les plus consommatrices d'énergie : le système de transport très dépendant de la voiture particulière y est très coûteux pour la collectivité, les systèmes alternatifs plus respectueux de l'environnement, et particulièrement les transports collectifs, ont du mal à s'imposer tant la concurrence avec la voiture est difficile. On trouve dans la littérature deux approches pour traiter ce problème : certains insistent sur les gains de vitesse offerts par le système de transport, d'autres portent un regard plus économique. Ces deux approches conduisent à des préconisations de politiques publiques assez différentes qui font l'objet de virulents débats au sein de la communauté académique et des administrations. Cet article expose le cadre analytique dans lequel sont faits les développements et se propose de simuler les effets de ces politiques sur le surplus économique en utilisant un modèle multimodal (MATISSE_ INRETS), et en retenant les dernières valeurs tutélaires françaises proposées par l'administration française en 2000 (valeur du temps, valeurs environnementales).Politique des transports urbains ; coût économique ; maîtrise de la mobilité ; modèle multimodal MATISSE (INRETS)

Practical Range Minimum Queries Revisited

Finding the position of the minimal element in a subarray A[i..j] of an array A of size n is a fundamental operation in many applications. In 2011, Fischer and Heun presented the first index of size 2n+o(n) bits which answers the operation in constant time for any subarray. The index can be computed in linear time and queries can be answered without consulting the original array. The most recent and currently fastest practical index is due to Ferrada and Navarro (DCC\u2716). It reduces the range minimum query (RMQ) to more fundamental and well studied queries on binary vectors, namely rank and select, and a RMQ query on an array of sublinear size derived from A. A range min-max tree is employed to solve this recursive RMQ call. In this paper, we review their practical design and suggest a series of changes which result in consistently faster query times. Specifically, we provide a customized select implementation, switch to two levels of recursion, and use the sparse table solution for the recursion base case instead of a range min-max tree. We provide an extensive empirical evaluation of our new implementation and also compare it to the state of the art. Our experimental study shows that our proposal significantly outperforms the previous solutions on established benchmarks (up to a factor of three) and furthermore accelerates real world applications such as traversing a succinct tree or listing all distinct elements in an interval of an array

DNA DAMAGE RESPONSE OF EX-VIVO PORCINE EYE LENSES IN ORGAN-CULTURE AND IN-VITRO CULTURED LENS EPITHELIAL CELLS TO IONIZING RADIATION.

Astronauts on space missions, especially on long-term missions to Moon or Mars have a higher risk for the expression of radiation late effects such as cancer or sub-capsular cortical eye lens opacities. This is due to higher dose and different patterns of cellular energy deposition from high-linear-energy-transfer (LET) components of galactic cosmic radiation in space than that of terrestrial low-LET radiation on Earth. The eye lens is considered to be a radiation sensitive organ with radiation induced cataract to occur with a threshold absorbed dose of 0.5 Gy of sparsely ionizing radiation. For terrestrial occupational radiation lens exposure limit is set to yearly 20 mSv by the International Commission on Radiological Protection (1). Doses perceived by astronauts are much higher: in average 150 mSv per year on the International Space Station (ISS) and 1.2 to 1.4 mSv per day on Apollo and Skylab missions (2)

An integrated assessment model with endogenous growth

We introduce endogenous directed technical change into numerical integrated climate and development policy assessment. We distinguish expenditures on innovation (R&D) and imitation (international technology spillovers) and consider the role of capital investment in creating and implementing new technologies. Our main contribution is to calibrate and numerically solve the model and to examine the model’s sensitivity. As an application, we assess a carbon budget-based climate policy and vary the beginning of energy-saving technology transfer. Accordingly, China is a main beneficiary of early technology transfer. Herein, our results highlight the importance of timely international technology transfer for efficiently meeting global emission targets. Most of the consumption gains from endogenous growth are captured in the baseline. Moreover, mitigation costs turn out to be insensitive to changes in most of the parameters of endogenous growth. A higher effectivity of energy-specific relative to labor-specific expenditures on innovation and imitation reduces mitigation costs, though

The Quantile Index - Succinct Self-Index for Top-k Document Retrieval

One of the central problems in information retrieval is that of finding the k documents in a large text collection that best match a query given by a user. A recent result of Navarro & Nekrich (SODA 2012) showed that single term and phrase queries of length m can be solved in optimal O(m+k) time using a linear word sized index. While a verbatim implementation of the index would be at least an order of magnitude larger than the original collection, various authors incrementally improved the index to a point where the space requirement is currently within a factor of 1.5 to 2.0 of the text size for standard collections. In this paper, we propose a new time/space trade-off for different top-k indexes. This is achieved by sampling only a quantile of the postings in the original inverted file or suffix array-based index. For those queries that cannot be answered using the sampled version of the index we show how to compute the query results on the fly efficiently. As an example, we apply our method to the top-k framework by Navarro & Nekrich. Under probabilistic assumptions that hold for most standard texts, and for a standard scoring function called term frequency, our index can be represented with only sublinearly many bits plus the space needed for a compressed suffix array of the text, while maintaining poly-logarithmic query times. We evaluate our solution on real-world datasets and compare its practical space usage and performance against state-of-the-art implementations. Our experiments show that our index compresses below the size of the original text. To our knowledge it is the first suffix array-based text index that is able to break this bound in practice even for non-repetitive collections, while still maintaining reasonable query times of under half a millisecond on average for top-10 queries