Results 21 to 30 of about 142,687 (264)
Tailings dam is a man-made hazard with high potential energy; dam failure would cause great losses to human lives and properties. However, the limitations of conventional reinforcement methods like geosynthetic make it easy to slide along the weak ...
Jianzhong Liu +7 more
doaj +1 more source
O conhecimento das relações entre propriedades físicas e mecânicas do solo pode contribuir no desenvolvimento de funções de pedotransferência, que permitam estimar outras propriedades do solo de difícil mensuração.
Luis Eduardo Akiyoshi Sanches Suzuki +3 more
doaj +1 more source
For analysing text algorithms, for computing superstrings, or for testing random number generators, one needs to compute all overlaps between any pairs of words in a given set. The positions of overlaps of a word onto itself, or of two words, are needed to compute the absence probability of a word in a random text, or the numbers of common words shared
Rodrigo Cánovas +2 more
openaire +2 more sources
The coefficient of consolidation is traditionally considered as a constant value in soil consolidation calculations. This paper uses compression and recompression indexes to calculate the solution-dependent nonlinear compressibility, thus ...
Chao Xu, Suli Pan
doaj +1 more source
Uma das medidas mais efetivas na prevenção da compactação do solo é a aplicação de pressões inferiores à sua capacidade de suporte de carga, estimada pela tensão de pré-consolidação (σp).
Henrique Debiasi +4 more
doaj +1 more source
Structured quantitative characterization and elastoplastic constitutive model of clay
Soil structure can improve the stability of soil skeleton. Hence, the void ratio of structured soils is usually higher than that of the reconstituted soils under the same effective stress.
LI Wu-gang 1, YANG Qing 2, LIU Wen-hua 1, YANG Gang 2, SUN Xiu-li 1
doaj +1 more source
On Indexing and Compressing Finite Automata [PDF]
An index for a finite automaton is a powerful data structure that supports locating paths labeled with a query pattern, thus solving pattern matching on the underlying regular language. In this paper, we solve the long-standing problem of indexing arbitrary finite automata. Our solution consists in finding a partial co-lexicographic order of the states
Cotumaccio, Nicola, Prezza, Nicola
openaire +3 more sources
Compressed text indexing with wildcards
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wing-Kai Hon +4 more
openaire +2 more sources
Compressed full-text indexes [PDF]
Full-text indexes provide fast substring search over large text collections. A serious problem of these indexes has traditionally been their space consumption. A recent trend is to develop indexes that exploit the compressibility of the text, so that their size is a function of the compressed text length. This concept has evolved into
Gonzalo Navarro 0001, Veli Mäkinen
openaire +1 more source
Parallel and Distributed Compressed Indexes [PDF]
We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text, so that their size is a function of the compressed text size. Moreover, they support a considerable amount of functions, more than many classical indexes. We make use of this extended
Luís M. S. Russo +2 more
openaire +1 more source

