Results 21 to 30 of about 144,330 (264)
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
Modification of mechanical properties of Shanghai clayey soil with expanded polystyrene
In the present study, the resistance characteristics of Shanghai clayey soil-expanded polystyrene (EPS) mixture have been explored, using unconfined compressive and consolidation and rebound tests.
Jili Qu +7 more
doaj +1 more source
Soil compaction is one of the main causes of soil degradation, and some parameters have been used to characterize it, like those related to compressibility and the degree of compactness.
Luis Eduardo Akiyoshi Sanches Suzuki +5 more
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
In South Korea, Honam High-Speed Railway has a relatively large residual settlement issue and high fines content has been pointed out as one of the causes. Design guidelines regulate not to use soils containing fines content higher than 25%.
Panyabot Kaothon +3 more
doaj +1 more source
Compressed text indexing with wildcards
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wing-Kai Hon +4 more
openaire +2 more sources
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
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
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

