2,465 research outputs found
Apollo-Soyuz Doppler-tracking experiment MA-089
The Doppler tracking experiment was designed to test the feasibility of improved mapping of the earth's gravity field by the low-low satellite-to-satellite tracking method and to observe variations in the electron density of the ionosphere between the two spacecraft. Data were taken between 1:01 and 14:37 GMT on July 24, 1975. Baseline data taken earlier, while the docking module was still attached to the command and service module, indicated that the equipment operated satisfactorily. The ionospheric data contained in the difference between the Doppler signals at the two frequencies are of excellent quality, resulting in valuable satellite-to-satellite observations, never made before, of wave phenomena in the ionosphere. The gravity data were corrupted by an unexpectedly high noise level of as-yet-undetermined origin, with periods greater than 150 seconds, that prevented unambiguous identification of gravity-anomaly signatures
Molecular modeling of -endotoxins from Bacillus thuringiensis.
Bacillus thuringiensis (Bt) is a Gram-positive entomotoxic bacterium widely used to control crop pests and disease vectors. Since the introduction of transgenic plants expressing Bt genes, it has been demonstrated that Bt-crops constitute an important tool in the increase of productivity and in the decrease of the use of chemical pesticides. Its success comes from the production of the ?-endotoxins (Cry). These toxins share a molecular mechanism of similar action or, at least, some common aspects
Logics of preference when there is no best
Well-behaved preferences (e.g., total pre-orders) are a cornerstone of several areas in artificial intelligence, from knowledge representation, where preferences typically encode likelihood comparisons, to both game and decision theories, where preferences typically encode utility comparisons. Yet weaker (e.g., cyclical) structures of comparison have proven important in a number of areas, from argumentation theory to tournaments and social choice theory. In this paper we provide logical foundations for reasoning about this type of preference structures where no obvious best elements may exist. Concretely, we compare and axiomatize a number of ways in which the concepts of maximality and optimality can be lifted to this general class of preferences. In doing so we expand the scope of the long-standing tradition of the logical analysis of preference
Pós-colheita de frutos de macaúba em ambiente com temperatura controlada: efeito sobre a água na polpa.
Este trabalho objetivou avaliar a perda de massa, a atividade de água e a estabilidade oxidativa em frutos de macaúba armazenados a 20 ºC
Compressed Data Structures for Dynamic Sequences
We consider the problem of storing a dynamic string over an alphabet
in compressed form. Our representation
supports insertions and deletions of symbols and answers three fundamental
queries: returns the -th symbol in ,
counts how many times a symbol occurs among the
first positions in , and finds the position
where a symbol occurs for the -th time. We present the first
fully-dynamic data structure for arbitrarily large alphabets that achieves
optimal query times for all three operations and supports updates with
worst-case time guarantees. Ours is also the first fully-dynamic data structure
that needs only bits, where is the -th order
entropy and is the string length. Moreover our representation supports
extraction of a substring in optimal time
Detection of alfa-amylase inhibitors by a zymography method, performed in isoelectric focusing electrophoretic PhastGels.
Succinct Indexable Dictionaries with Applications to Encoding -ary Trees, Prefix Sums and Multisets
We consider the {\it indexable dictionary} problem, which consists of storing
a set for some integer , while supporting the
operations of \Rank(x), which returns the number of elements in that are
less than if , and -1 otherwise; and \Select(i) which returns
the -th smallest element in . We give a data structure that supports both
operations in O(1) time on the RAM model and requires bits to store a set of size , where {\cal B}(n,m) = \ceil{\lg
{m \choose n}} is the minimum number of bits required to store any -element
subset from a universe of size . Previous dictionaries taking this space
only supported (yes/no) membership queries in O(1) time. In the cell probe
model we can remove the additive term in the space bound,
answering a question raised by Fich and Miltersen, and Pagh.
We present extensions and applications of our indexable dictionary data
structure, including:
An information-theoretically optimal representation of a -ary cardinal
tree that supports standard operations in constant time,
A representation of a multiset of size from in bits that supports (appropriate generalizations of) \Rank
and \Select operations in constant time, and
A representation of a sequence of non-negative integers summing up to
in bits that supports prefix sum queries in constant
time.Comment: Final version of SODA 2002 paper; supersedes Leicester Tech report
2002/1
The Case for Learned Index Structures
Indexes are models: a B-Tree-Index can be seen as a model to map a key to the
position of a record within a sorted array, a Hash-Index as a model to map a
key to a position of a record within an unsorted array, and a BitMap-Index as a
model to indicate if a data record exists or not. In this exploratory research
paper, we start from this premise and posit that all existing index structures
can be replaced with other types of models, including deep-learning models,
which we term learned indexes. The key idea is that a model can learn the sort
order or structure of lookup keys and use this signal to effectively predict
the position or existence of records. We theoretically analyze under which
conditions learned indexes outperform traditional index structures and describe
the main challenges in designing learned index structures. Our initial results
show, that by using neural nets we are able to outperform cache-optimized
B-Trees by up to 70% in speed while saving an order-of-magnitude in memory over
several real-world data sets. More importantly though, we believe that the idea
of replacing core components of a data management system through learned models
has far reaching implications for future systems designs and that this work
just provides a glimpse of what might be possible
- …