نتایج جستجو برای: pairwise non

تعداد نتایج: 1335263  

2011
Thomas R. Bewley

A new class of integer sequences is introduced in which any pair of identical symbols in the sequence, separated a certain number of digits apart, appears in the sequence, with that separation, at most once. For any given sequence length n and number of distinct symbols used, m, such a sequence, if it exists, is not unique; our attention is thus focused on the lexographically first such sequenc...

Journal: :CoRR 2013
Konrad Kulakowski

The pairwise comparisonsmethod is a convenient tool used when the relative order among different concepts (alternatives) needs to be determined. One popular implementation of the method is based on solving an eigenvalue problem for the pairwise comparisons matrix. In such cases the ranking result the principal eigenvector of the pairwise comparisonmatrix is adopted, whilst the eigenvalue is use...

2003
O. COSTIN

Borel summation techniques are developed to obtain exact invariants from formal adiabatic invariants (given as divergent series in a small parameter) for a class of differential equations, under assumptions of analyticity of the coefficients; the method relies on the study of associated partial differential equations in the complex plane. The type and location of the singularities of these asso...

1997
William Li

A general algorithmic approach to the construction of optimal designs, using the columnwise-pairwise (CP) procedures, was recently proposed (Li and Wu 1995; Li 1996a). This presentation shows several areas to which the new techniques can be applied: optimal non-orthogonal designs, design repair problem, optimal mixed-level designs, and optimal Latin-hypercubes. Each optimal design is constructe...

Journal: :Parallel Processing Letters 1992
Ian Parberry

A new sorting network with exactly the same size and depth as the odd-even sorting network is presented. This sorting network is designed using the zero-one principle, and proceeds by first sorting pairs of bits and sorting the pairs into lexicographic order.

2017
ISAAC GOLDBRING

Recently, Boutonnet, Chifan, and Ioana proved that McDuff’s examples of continuum many pairwise non-isomorphic separable II1 factors are in fact pairwise non-elementarily equivalent. Their proof proceeded by showing that any ultrapowers of any two distinct McDuff examples are not isomorphic. In a paper by the first two authors of this paper, Ehrenfeucht-Fraïsse games were used to find an upper ...

Journal: :journal of sciences islamic republic of iran 0

in this paper, we discuss strong laws for weighted sums of pairwise negatively dependent random variables. the results on i.i.d case of soo hak sung [9] are generalized and extended.

2015
Thomas Bury

Financial markets are a typical example of complex systems where interactions between constituents lead to many remarkable features. Here we give empirical evidence, by making as few assumptions as possible, that the market microstructure capturing almost all of the available information in the data of stock markets does not involve higher order than pairwise interactions. We give an economic i...

2011
Naoko Kinoshita Chris Sheppard

This paper reports research investigating the validity of using Pairwise Variability Indexes in research into the second language acquisition of speech rhythm. Findings determined that 1) expert native-speakers rate non-native speaker rhythm based on a common factor, and 2) part of that common factor can be accounted for by the use of vocalic pairwise variability. It was concluded that the PVI ...

Journal: :نظریه تقریب و کاربرد های آن 0
farhad hosseinzadeh-lotfi department of mathematics, islamic azad university, science and research branch, tehran, iran. mohammad izadikhah department of mathematics, islamic azad university, arak branch, arak branch, iran. r. roostaee department of mathematics, islamic azad university, arak branch, arak branch, iran. mohsen rostamy-malkhalifeh department of mathematics, islamic azad university, science and research branch, tehran, iran.

this research proposes a methodology for ranking decision making units byusing a goal programming model.we suggest a two phases procedure. in phase1, by using some dea problems for each pair of units, we construct a pairwisecomparison matrix. then this matrix is utilized to rank the units via the goalprogramming model.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید