A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Sum of Squares Lower Bounds from Pairwise Independence
[article]
2015
arXiv
pre-print
Preserved Fulltext
Other Versions
no assignment can satisfy more than a |P^-1(1)|2^k+ϵ fraction of I's constraints but the degree Ω(n) Sum of Squares semidefinite programming hierarchy cannot certify that I is unsatisfiable. ...
We prove that for every ϵ>0 and predicate P:{0,1}^k→{0,1} that supports a pairwise independent distribution, there exists an instance I of the MaxP constraint satisfaction problem on n variables such that ...
Acknowledgements Thanks to Ryan O'Donnell, Li-Yang Tan, and David Steurer for fruitful discussions and the anonymous reviewers for their valuable comments and suggestions on a previous version of this ...
arXiv:1501.00734v2
fatcat:4rf3wkyymnfjppvdonb4ayna2y
Joint Ranging and Synchronization for an Anchorless Network of Mobile Nodes
2015
IEEE Transactions on Signal Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
For a set of nodes, a pairwise least squares solution is proposed for estimating the pairwise range parameters between the nodes, in addition to estimating the clock offsets and clock skews. ...
Synchronization and localization are critical challenges for the coherent functioning of a wireless network, which are conventionally solved independently. ...
Following immediately, given the lower bound on the variance of as , the lower bound on the variance of the distance estimate (38) is (45) where is the Vandermonde-like matrix (33) . ...
doi:10.1109/tsp.2015.2391076
fatcat:dd7wlo65j5derfotfxc32c4dmm
Analysis of Printing Substrate, Ink Age and Number of IR Drying Influence on Electrical Resistance of Conductive Inks
2015
Acta Graphica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper analyzes the influence of printing substrate, age of ink and the number of IR drying on the electrical resistance of the conductive inks. ...
As a result of availability of new technologies, functional printing as a segment has become one of the most interesting directions of research and development in graphic technology. ...
This test is based on the linearly independent pairwise comparisons among the estimated marginal means. Univariate Tests
Dependent Variable:Resistance
Sum of Squares
df
Mean Square
F
Sig. ...
doaj:b43df0b405f448b0a99bba8de346dd18
fatcat:kpc7borgr5bm3hkis6vwlfkzr4
Effects of artificial light with different wavelengths and irradiances on the sleep behaviors of Chestnut buntings (Emberiza rutila)
2021
figshare.com
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The effect of light spectrums overall ranked from the most to the least as 510 nm green, 580 nm yellow or white, and 470 nm blue or 620 nm orange light; the sleep parameters were affected more with higher ...
The study highlights the potential of adjusting spectral compositions of light source to mitigate the disturbance of artificial light to avian sleep. ...
Frequency of awakenings
Based on Mean
0.852
2
24
0.439
Frequency of awakenings
Sum of Squares
df
Mean Square
F
Sig. ...
doi:10.6084/m9.figshare.15082759.v1
fatcat:4ozrj5mdnveczay7vgbc7dfizm
Exploring Time Series Segmentations Using Uncertainty and Focus+Context Techniques
2020
Eurographics Conference on Visualization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
So far, the influence of uncertainties in the context of time series segmentation could not be investigated. ...
Hence, experts face the additional challenge of understanding the reliability of multiple alternative the segmentation results. ...
The bounds are calculated based on the statistical power of 0.95, the number of study participants n = 111, and the Significance level α = 0.05, yielding the upper and lower bounds, of which only the lower ...
doi:10.2312/evs.20201040
dblp:conf/vissym/BorsEMTSG20
fatcat:uzpscdhdkjhs7njkfouardpi7y
Multiuser square-law detection with applications to fiber optic communications
2006
IEEE Transactions on Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Great potential is found for the multiuser square-law detector when compared with the conventional single-user square-law detector. ...
We study the optimal detector and two detectors with simpler structures: the asymptotically optimal detector and the pairwise linear detector. ...
The lower bound to the error probability we use is a ball tangent to the above upper bound ball at the most likely error point from outside with a radius of , as shown in Fig. 4 . ...
doi:10.1109/tcomm.2006.876866
fatcat:xeddwbnvbrdvzagh4ixrg5wstu
Remarks on space-time codes including a new lower bound and an improved code
2003
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
This correspondence presents a new asymptotically exact lower bound on pairwise error probability of a space-time code as well as an example code that outperforms the comparable orthogonal-design-based ...
Also contained in the correspondence are an exact expression for pairwise error probability (PEP), signal design guidelines, and some observations relating to the reception of ODST codes. ...
of the lower bound. ...
doi:10.1109/tit.2003.817475
fatcat:hylqexjmcndz3cmrf4sbobzc54
Learning Disentangled Representation with Pairwise Independence
2019
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The evidence lower bound implicitly encourages mutual independence of latent codes so it is too strong for our assumption. Therefore, we introduce another lower bound in our method. ...
Existing learning methods are based on the assumption that disentangled factors are mutually independent and incorporate this assumption with the evidence lower bound. ...
Acknowledgments This work is funded by the National Natural Science Foundation of China (NSFC) under Grant NO. 61773336 and NO. 91748127. We would like to thank the data providers. ...
doi:10.1609/aaai.v33i01.33014245
fatcat:lwopxwahc5et3expo5vxgeid2e
Random Access Schemes in Wireless Systems With Correlated User Activity
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Traditional random access schemes are designed based on the aggregate process of user activation, which is created on the basis of independent activations of the users. ...
Both attempt to maximize the throughput using only pairwise correlations, but they rely on different assumptions about the higher-order dependencies. ...
Min-Sum Pairwise Correlations We now consider the lower bound (Eq. (3)) and minimize the sum of product expectations in each slot: MPC(A) = 1 K K k=1 N n=1 N m=1 1(n = m)A nk A mk E [x n x m ] . (5) Compared ...
arXiv:1803.03610v1
fatcat:ksskgfzocrcdlguzop37qvpocy
The Accuracy of Floating Point Summation
1993
SIAM Journal on Scientific Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
list of negative numbers and a list of nonnegative numbers, and then repeatedly forming the sum of the largest nonnegative and most negative elements and placing the sum into the appropriate list, in ...
The usual recursive summation technique is just one of several ways of computing the sum of n floating point numbers. Five summation methods and their variations are analyzed here. ...
I thank Jeremy Du Croz and Philip Gill for providing some of the references, and Des Higham, Nick Trefethen, and the referee for suggesting improvements to the manuscript. ...
doi:10.1137/0914050
fatcat:mmwu3ugehrbd3oe6wxozubub2y
On comparing sums of square roots of small integers
[article]
2006
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
In particular, our result implies a subexponential algorithm to compare two sums of square roots of integers of size o(k k). ...
It is an important problem in computational geometry to determine a good upper bound of - r(n,k). ...
We obtain a lower bound of difference of two sums of square roots. Our lower bound beats the root separation bound as long as n ≤ ck log k for some constant c. ...
arXiv:cs/0603002v1
fatcat:qs6bvoxphzaerdyu7d2mzxsov4
On Comparing Sums of Square Roots of Small Integers
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In particular, our result implies an algorithm subexponential in k (i.e. with time complexity 2 o(k) (log n) O(1) ) to compare two sums of square roots of integers of value o(k log k). * ...
It is an important problem in computational geometry to determine a good upper bound of − log r(n, k). ...
We obtain a lower bound of difference of two sums of square roots. Our lower bound beats the root separation bound as long as n ≤ ck log k for some constant c. ...
doi:10.1007/11821069_22
fatcat:jz52uwzauvhlxhwnqufjyef5oi
Broadcast Gossip Algorithms for Consensus
2009
IEEE Transactions on Signal Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We provide theoretical and numerical results on the mean square error performance, on the convergence rate and study the effect of the "mixing parameter" on the convergence rate of the broadcast gossip ...
We prove that the random consensus value is, in expectation, the average of initial node measurements and that it can be made arbitrarily close to this value in mean squared error sense, under a balanced ...
bound the above, we need to lower bound term. ...
doi:10.1109/tsp.2009.2016247
fatcat:2bo7gdapbrfszo3scfexlw5bwm
Semiparametric Maximum Likelihood Estimates of Spatial Dependence
2002
Geographical Analysis
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Conveniently, the bounds can be expressed as a function of a weighted sum of the traces of pairwise products among the spatial basis matrices. ...
based upon the average of the lower and upper log-determinant bounds from (3). ...
doi:10.1353/geo.2002.0004
fatcat:ymq2rg4vnnavzou6wogqhoi7ra
Page 825 of ASQ World Conference on Quality and Improvement Proceedings Vol. 43, Issue
[page]
1989
ASQ World Conference on Quality and Improvement Proceedings
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The upper and lower bounds can be either from specifications or statistically determined. In the latter case, the selection of bounds is dependent upon the normality and symmetry of the data. ...
Methods of turning point, signed run, cumulative pairwise comparison, and mean square successive difference tests [3] were used. ...
« Previous
Showing results 1 — 15 out of 59,437 results