Elastic wave propagation for plane strain problems by the theory of characteristics

Elastic wave propagation in two dimensions using theory of characteristic

Generalized characteristics method for elastic wave propagation problems

Characteristic equations are derived in generalized curvilinear coordinates. Linear elastic, isotropic, and homogeneous constitutive equations have been used in the derivation. The generalized characteristic equations readily lend themselves to any requirements of space dimension and geometry. A simple boundary value problem is solved to indicate the applicability of these equations

The evolving maintenance of certification process: update on the financial status of the medical boards

Medical board organizations have accumulated large asset balances, in part due to the monetization of physician board recertification, as well as capital gains in positive investment conditions. Physicians across the country have raised concerns regarding the effectiveness and efficiency of existing recertification processes, to which the American Board of Medical Specialties and independent accreditation boards have responded with newly instituted changes. The present article analyzes the publicly available F990 tax forms of the medical boards in an effort to provide data to the ongoing debate. Although some boards have begun to mobilize assets in recent years, many continue to accumulate wealth. It remains to be seen whether the new recertification programs will bring about change or perpetuate organizational wealth

RLZAP: Relative Lempel-Ziv with Adaptive Pointers

Relative Lempel-Ziv (RLZ) is a popular algorithm for compressing databases of genomes from individuals of the same species when fast random access is desired. With Kuruppu et al.'s (SPIRE 2010) original implementation, a reference genome is selected and then the other genomes are greedily parsed into phrases exactly matching substrings of the reference. Deorowicz and Grabowski (Bioinformatics, 2011) pointed out that letting each phrase end with a mismatch character usually gives better compression because many of the differences between individuals' genomes are single-nucleotide substitutions. Ferrada et al. (SPIRE 2014) then pointed out that also using relative pointers and run-length compressing them usually gives even better compression. In this paper we generalize Ferrada et al.'s idea to handle well also short insertions, deletions and multi-character substitutions. We show experimentally that our generalization achieves better compression than Ferrada et al.'s implementation with comparable random-access times

Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that leads to algorithms improving the previously known complexities for both problems. In particular, we significantly improve the space bounds, which in practical applications are likely to be a bottleneck

A response to “Trends in tropical tree growth: re-analysis confirms earlier findings”

We recently demonstrated that growth trends from tree rings from Van der Sleen et al. (2015) and Groenendijk et al. (2015) are affected by demographic biases. In particular, clustered age distributions led to a negative bias in their growth trends. In a response, they challenge our analysis and present an alternative correction approach. We here show that their arguments are incorrect and based on misunderstanding of our analysis, and that their alternative approach does not work

Scenarios in the development of Mediterranean cyclones

The Mediterranean is one of the most cyclogenetic regions in the world. The cyclones are concentrated along its northern coasts and their tracks are oriented more or less west-east, with several secondary tracks connecting them to Europe and to North Africa. The aim of this study is to examine scenarios in the development of Mediterranean cyclones, based on five selected winter seasons (October–March). We detected the cyclones subjectively using 6-hourly Sea-Level Pressure maps, based on the NCAR/NCEP reanalysis archive. <br><br> HMSO (1962) has shown that most Mediterranean cyclones (58%) enter the Mediterranean from the Atlantic Ocean (through Biscay and Gibraltar), and from the south-west, the Sahara Desert, while the rest are formed in the Mediterranean Basin itself. Our study revealed that only 13% of the cyclones entered the Mediterranean, while 87% were generated in the Mediterranean Basin. The entering cyclones originate in three different regions: the Sahara Desert (6%), the Atlantic Ocean (4%), and Western Europe (3%). <br><br> The cyclones formed within the Mediterranean Basin were found to generate under the influence of external cyclonic systems, i.e. as "daughter cyclones" to "parent cyclones" or troughs. These parent systems are located in three regions: Europe (61%), North Africa and the Red Sea (34.5%) and the Mediterranean Basin itself (4.5%). The study presents scenarios in the development of Mediterranean cyclones during the winter season, emphasizing the cyclogenesis under the influence of various external forcing. <br><br> The large difference with respect to the findings of HMSO (1962) is partly explained by the dominance of spring cyclones generating in the Sahara Desert, especially in April and May that were not included in our study period

Efficient LZ78 factorization of grammar compressed text

We present an efficient algorithm for computing the LZ78 factorization of a text, where the text is represented as a straight line program (SLP), which is a context free grammar in the Chomsky normal form that generates a single string. Given an SLP of size $n$ representing a text $S$ of length $N$, our algorithm computes the LZ78 factorization of $T$ in $O(n\sqrt{N}+m\log N)$ time and $O(n\sqrt{N}+m)$ space, where $m$ is the number of resulting LZ78 factors. We also show how to improve the algorithm so that the $n\sqrt{N}$ term in the time and space complexities becomes either $nL$, where $L$ is the length of the longest LZ78 factor, or $(N - \alpha)$ where $\alpha \geq 0$ is a quantity which depends on the amount of redundancy that the SLP captures with respect to substrings of $S$ of a certain length. Since $m = O(N/\log_\sigma N)$ where $\sigma$ is the alphabet size, the latter is asymptotically at least as fast as a linear time algorithm which runs on the uncompressed string when $\sigma$ is constant, and can be more efficient when the text is compressible, i.e. when $m$ and $n$ are small.Comment: SPIRE 201

Faster subsequence recognition in compressed strings

Computation on compressed strings is one of the key approaches to processing massive data sets. We consider local subsequence recognition problems on strings compressed by straight-line programs (SLP), which is closely related to Lempel--Ziv compression. For an SLP-compressed text of length $\bar m$, and an uncompressed pattern of length $n$, C{\'e}gielski et al. gave an algorithm for local subsequence recognition running in time $O(\bar mn^2 \log n)$. We improve the running time to $O(\bar mn^{1.5})$. Our algorithm can also be used to compute the longest common subsequence between a compressed text and an uncompressed pattern in time $O(\bar mn^{1.5})$; the same problem with a compressed pattern is known to be NP-hard