Row Sequences Research Articles

Normal orthogonal transformation algorithm of 2D image

A new 2D transformation algorithm based on algorithm of matrix operator formation in 1D discrete orthogonal transformation is presented. Complexity 2D algorithm creation is a high order of matrix operator when 2D image is presented as a sequence of rows (columns). In this case the order of matrix operator is N 2 for image matrix of N order. As result, the number of its elements is equal to N 4 , which is equivalent of huge figure for image, having size N = 256…1024. A simple algorithm for creation of matrix operator in 2D discrete transformation was obtained. It allows reduce to N 3 the memory volume, required for transform coefficient calculation. It makes possible to classify images having matrix of order N ≈ 256…1024. The algorithm is illustrated on the example selected from the ease of inspection results.

Control of Peach Twig Borer in Almonds, 2014: Table 1

This study was designed to evaluate the efficacy of reduced-risk insecticides for control of PTB. The study was conducted in a 3-year-old untreated almond orchard with 4.3 m between trees and 6.4 m between rows and with the cultivar row sequence “Nonpareil, Monterey, Nonpareil, Aldrich” near Westley, CA. Seven treatments were replicated eight times in an RCB design. Each replicate was a single tree and there was an untreated buffer between each treated tree. Materials were …

Zero distribution of incomplete Padé and Hermite–Padé approximations

We prove that a subsequence of the normalized zero counting measures of incomplete Padé approximants tend, as the degree of the numerators goes to infinity and that of the denominators remains bounded, to the uniform distribution on the largest circle centered at the origin inside of which the approximants converge in the sense of the Hausdorff content. As a consequence, a Jentzsch–Szegő type theorem for row sequences of Hermite–Padé approximants is given.

Tracking a hospital outbreak of KPC-producing ST11 Klebsiella pneumoniae with whole genome sequencing

An outbreak of carbapenem-resistant Klebsiella pneumoniae strains emerged at a hospital, and was tracked in order to understand the spread of these infectious pathogens. A total of 66 K. pneumoniae strains were collected from sterile samples in 2012. The MICs of 20 antimicrobial agents were determined for all strains. Molecular typing was performed with pulsed-field gel electrophoresis (PFGE). Twelve blaKPC-producing K. pneumoniae strains isolated from ten patients were selected for whole genome sequencing. Phylogenetic reconstruction of these 12 strains was performed by the use of single-nucleotide polymorphism (SNP) row sequences of each draft genome sequence. Plasmids from the 12 strains were separated by S1 digestion and PFGE. The 12 K. pneumoniae strains isolated from the ten patients were deemed to be representative of the hospital outbreak, owing to their similar PFGE patterns. These 12 blaKPC-producing strains conferred multidrug resistance, which contrasted with the remaining 54, more susceptible, strains in the hospital. Differences in SNPs between each draft genome of the blaKPC-producing strains partitioned the 12 outbreak strains into three separate clades. The patients with each clade shared close hospital units. All 12 strains harboured at least one multidrug resistance plasmid. Strains showing high-level resistance may facilitate nosocomial dissemination and result in an infectious pathogen outbreak. Although the 12 blaKPC-producing K. pneumoniae strains possessed similar PFGE patterns, SNP variations throughout the genome allowed the strains to be divided into three clades. These results suggest that three independent transmission events led to hospital-wide dissemination of the outbreak strains.

Inverse Theorem on Row Sequences of Linear Padé-orthogonal Approximation

We give necessary and sufficient conditions for the convergence with geometric rate of the denominators of linear Padé-orthogonal approximants corresponding to a measure supported on a general compact set in the complex plane. Thereby, we obtain an analog of Gonchar’s theorem on row sequences of Padé approximants.

The Selection of Cultural Units by Non-Contingent Cultural Events

We assessed the effects of non-contingent cultural events on the recurrence of the coordinated behaviors of groups of individuals (interlocking behavioral contingencies—IBCs). Laboratory microcultures (three participants each) performed an experimental task, which consisted of selecting rows of a matrix. After each 20 cycles of sequences of choices of rows, a new participant replaced an old one, thus creating a “generational shift .” Individual consequences (plastic coins exchangeable for money) were contingent on the choice of odd-numbered rows. Cultural events (printed stamps exchangeable for school supplies to be donated) occurred after the three participants had made their choices, but these events were not contingent on any particular sequence of rows (IBCs, and the aggregate product produced). During the first 60 cycles, the cultural events occurred after 80% of the cycles, independently of the aggregate product. Next, there was a sequence of 30 cycles in which no cultural event occurred. Finally, the experimental conditions returned to the initial non-contingent occurrence of cultural events. The results show the strengthening of operant individual behaviors, as well as of IBCs in the non-contingent conditions. Cultural transmission was also observed. We discuss the parallel between the observed recurrence of IBCs and previous studies on superstitious individual behavior. The results add to the acknowledged selection of cultural practices by long-term contingent products the possible selection of “superstitious” cultural practices by non-contingent cultural events. Such a possibility should be further investigated, with original or similar experimental designs.

A New Approach for Mining Order-Preserving Submatrices Based on All Common Subsequences.

Order-preserving submatrices (OPSMs) have been applied in many fields, such as DNA microarray data analysis, automatic recommendation systems, and target marketing systems, as an important unsupervised learning model. Unfortunately, most existing methods are heuristic algorithms which are unable to reveal OPSMs entirely in NP-complete problem. In particular, deep OPSMs, corresponding to long patterns with few supporting sequences, incur explosive computational costs and are completely pruned by most popular methods. In this paper, we propose an exact method to discover all OPSMs based on frequent sequential pattern mining. First, an existing algorithm was adjusted to disclose all common subsequence (ACS) between every two row sequences, and therefore all deep OPSMs will not be missed. Then, an improved data structure for prefix tree was used to store and traverse ACS, and Apriori principle was employed to efficiently mine the frequent sequential pattern. Finally, experiments were implemented on gene and synthetic datasets. Results demonstrated the effectiveness and efficiency of this method.

Rate of convergence of row sequences of multipoint Padé approximants

As a consequence of studying the exact rate of convergence of row sequences of multipoint Padé approximants, we prove that their zero limit distribution is a generalized balayage measure determined by the table of interpolation points and the region of meromorphy of the function being approximated, provided the configuration of these sets satisfies mild topological restrictions. Should there exist a subsequence of approximants converging at a faster rate on a given continuum that does not reduce to a single point, we prove that such a subsequence is overconvergent in the sense of the Hausdorff content.

Direct and Inverse Results on Row Sequences of Hermite–Padé Approximants

We give necessary and sufficient conditions for the convergence with geometric rate of the common denominators of simultaneous rational interpolants with a bounded number of poles. The conditions are expressed in terms of intrinsic properties of the system of functions used to build the approximants. Exact rates of convergence for these denominators and the simultaneous rational approximants are provided.

Entropic commensurate-incommensurate transition.

The equilibrium properties of a minimal tiling model are investigated. The model has extensive ground state entropy, with each ground state having a quasiperiodic sequence of rows. It is found that the transition from the ground state to the high temperature disordered phase proceeds through a sequence of periodic arrangements of rows, in analogy with the commensurate-incommensurate transition. We show that the effective free energy of the model resembles the Frenkel-Kontorova Hamiltonian, but with temperature playing the role of the strength of the substrate potential, and with the competing lengths not explicitly present in the basic interactions.

Incomplete Padé approximation and convergence of row sequences of Hermite–Padé approximants

We give a Montessus de Ballore type theorem for row sequences of Hermite–Padé approximations of vector valued analytic functions refining some results in this direction due to P.R. Graves-Morris and E.B. Saff. We do this introducing the notion of incomplete Padé approximation which contains, in particular, simultaneous Padé approximation and may be applied in the study of other systems of approximants as well.

How well does the Hermite–Padé approximation smooth the Gibbs phenomenon?

In order to reduce the Gibbs phenomenon exhibited by the partial Fourier sums of a periodic function $f$, defined on $[-\pi ,\pi ]$, discontinuous at 0, Driscoll and Fornberg considered so-called singular Fourier-Padé approximants constructed from the Hermite-Padé approximants of the system of functions $(1,g_{1} (z),g_{2} (z))$, where $g_{1} (z)=\log (1-z)$ and $g_{2} (z)$ is analytic, such that $\operatorname {Re}(g_{2} (e^{it}))=f (t)$. Convincing numerical experiments have been obtained by these authors, but no error estimates have been proven so far. In the present paper we study the special case of Nikishin systems and their Hermite-Padé approximants, both theoretically and numerically. We obtain rates of convergence by using orthogonality properties of the functions involved along with results from logarithmic potential theory. In particular, we address the question of how to choose the degrees of the approximants, by considering diagonal and row sequences, as well as linear Hermite-Padé approximants. Our theoretical findings and numerical experiments confirm that these Hermite-Padé approximants are more efficient than the more elementary Padé approximants, particularly around the discontinuity of the goal function $f$.

Coverage-dependent adsorption superstructure transition ofC60/Cu(001)

We have investigated the growth and structure of a ${\text{C}}_{60}$ monolayer film on Cu(001) with scanning tunneling microscopy at room temperature and 100 K. We discovered that the equilibrium adsorption structure of annealed ${\text{C}}_{60}$ films depends sensitively on the initial deposition coverage; for a coverage of 0.5 monolayer ${\text{C}}_{60}$ orders in an one-bright-and-one-dim (1B1D) row sequence along the [110] direction whereas for a coverage close to one monolayer ${\text{C}}_{60}$ orders in a two-bright-and-one-dim (2B1D) sequence. At the transition region of the bright and dim row segments, ${\text{C}}_{60}$ often appears ``frizzy'' at room temperature. This indicates that a ${\text{C}}_{60}$ rotates and adopts molecular orientations with inequivalent symmetry. Upon annealing, the ${\text{C}}_{60}$ film exhibits a high thermal stability before ${\text{C}}_{60}$ fragmentation and desorption occur at $\ensuremath{\sim}880--960\text{ }\text{K}$, depending on its adsorption superstructure. The duality of equilibrium superstructure in ${\text{C}}_{60}/\text{Cu}(001)$ is unique among studied ${\text{C}}_{60}$ monolayers on metals. We argue that different boundary energy of the 1B1D and 2B1D phases offers a plausible explanation on the observed tunability of superstructure versus coverage.

More than multiplication in a 12 × 12 multiplication table

This note presents demonstrations of mathematics that emerges when problems are posed with respect to a combined 12 × 12 multiplication table showing multiplier and multiplicand. Through processes such as recognizing and extending patterns, specializing and generalizing particular functional relationships between the diagonal and row sequences are compressed. Insights obtained from the various methods can be used to deepen teachers’ and students’ understandings of possible ways to bridge arithmetic and algebra.

Bayesian Analysis of a Multinomial Sequence and Homogeneity of Literary Style

To help settle the debate around the authorship of Tirant lo Blanc, all words in each chapter are categorized according to their length, and the appearances of certain words are counted, thus forming two contingency tables of ordered rows. A Bayesian multinomial change-point analysis of the sequence of rows, reveals a clear stylistic boundary, estimated to be near chapters 371 and 382. A Bayesian cluster analysis of these rows confirms the existence of that boundary, and reveals a few chapters that are misclassified by the estimated change-point. The statistical evidence supports the hypotheses of one main author writing about four fifths of the book, with a second author finishing the book by filling in material, mainly at the end of it.

Study of Sb adsorption on the Si(0 0 1)–In(4 × 3) surface

The process of Sb adsorption onto Si(0 0 1)–In(4×3) surface phase has been studied using scanning tunneling microscopy (STM), reflection high-energy electron diffraction (RHEED) and Auger electron spectroscopy (AES) techniques. Above 400 °C, Sb tends to destroy the initial In-induced phase and terminate the surface forming Sb/Si(0 0 1) interface. Between 400 and about 200 °C, however, the decomposition of In-induced reconstruction becomes partial; removing of In atoms from InSi bonds results in the relaxation of substrate atoms to the sequence of dimer rows separated by 4 a 0 which is also destroyed by further Sb adsorption. Below 200 °C, the (4×1) structure remains intact against Sb deposition. In this case, In and Sb atoms form disordered layer mediated by the corrugation of (4×1) structure.

Sequential and parallel fodder production in wheat (Wticum aestivum)-based cropping system with special reference to nitrogen economy

A field experiment was conducted during 1988-89 and 1989-90 for obtaining forage for animals and effecting nitrogen economy in wheat (Triticum aestivutn L. emend. Fiori & Paol.)-based cropping system. Sorghum [Sorghum bicolor (L.) Moench] gave significantly higher green fodder (36.0 and 31.7 tonnesiha), dry matter (10.1 and 10.4 tonnesiha) and crude protein (930 and 684 kgiha) compared with cowpea [ V i g ~ unguiculala (L.) Walp.] in both years. However, cowpea gave significantly higher crude protein yield than sorghum in 1988. Wheat grown after cowpea gave significantly higher grain and straw yields than when grown after sorghum. In association with wheaf Egyptian clover (Trifolium alerrmdrinum L.) in border method (in every founhpkipped row) gave 7.7-7.9 tonnesiha green fodder and 1.08-1.31 tonnesiha dry matter without causing significant reduction in wheat yield. The effect of nitrogen on wheat yield was significant and 120 kg Nlha gave significantly higher grain yield than 80 kg Niha. There was a significant interaction between N levels to wheat crop and preceding forage crops in the rainy season. There was no significant difference in wheat yield due to 80 and 120 kg Niha grown after cowpea, whereas after sorghum 120 icg Niha recorded significantly higher grain yield than 80 kg Nha. Therefore, growing of Egyption clover with wheat in every fourth skipped row sequence after cowpea found more productive and remunerative cropping system and economized fertilizer N up to 40 kg Niha without adversely affecting the wheat yield.

Maximum-entropy distributions of nonnegative random variables with conditional-additive structure

The principle of maximum entropy (ME) is used to obtain distributions of a nonnegative random variable X with conditional-additive structure: for each value of a finite control factor ηX is a sum of components whose conditional expectations (given the value of η) are known. We show that the ME distribution of X is a convex combination of convolutions of geometric sequences or exponential distributions for integer or continuous X, respectively, and find the distribution of η. In the integer case, we apply the method of “matrix unfolding” to the probability generating function of X and show that the probabilities can be blocked in rows that form a general matrix-geometric sequence. Studying an M/G/ l queueing system where the service time has conditional-additive structure, we show that the stationary queue-length probabilities can be blocked in a general matrix-geometric sequence of rows and evaluated by simple real-arithmetic matrix computations

Overconvergence of subsequences of rows of Padé approximants with gaps

The block structure of the Padé table associated with a formal power series is well known. We study the analytic properties of the given power series in the case that as we travel along a row of the corresponding table, we encounter blocks of increasing size. Thus, we extend to row sequences of Padé approximants some classical results due to Hadamard and Ostrowski related with the overconvergence of subsequences of Taylor polynomials and the analytic properties of the limit function under the presence of gaps in the power series.

Generalized Wythoff arrays, shuffles and interspersions

Suppose a is a strictly increasing sequence of integers satisfying a(1) = 1. Let b be the ordered complement of a, and suppose b is infinite and satisfies b( n< a( n), for every n ⩾ 1. For every positive integer i, let w( i, j) be the sequence given by w( i, 1) = a( a( i)), w( i, 2) = b( a( i)), w( i, j) = a( w( i, j − 1)) if j is odd and ⩾3, and w( i, j) = b( w( i, j − 2)) if j is even and ⩾ 4. Then the sequences w( i, j), for i = 1, 2, 3,…, partition the set of positive integers. For a( n) of the form [α n], where α is an irrational number between 1 and 2, we denote the resulting array W( α). This is the original Wythoff array of W= (1+ 5 ) 2 . For certain α, the row sequences of W( α) obey simple recurrence relations. For others, W( α) exhibits remarkable properties concerning the manner in which the terms of each row fit, in magnitude, among the terms of each other row. These properties are discussed in terms of shuffles and interpersions.