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.
Filters
Finite limits and monotone computations: the lower bounds criterion
Proceedings of Computational Complexity. Twelfth Annual IEEE Conference
Preserved Fulltext
Apparently this is the rst combinatorial lower bounds criterion for monotone computations. It is symmetric and yields (in a uniform and easy way) exponential lower bounds. ...
The proof is relatively simple and direct, and combines the bottlenecks counting approach of Haken with the idea of nite limit due to Sipser. ...
Acknowledgments
I thank Armin Haken, Alexander Razborov and Avi Wigderson for interesting discussions and remarks. ...
doi:10.1109/ccc.1997.612325
dblp:conf/coco/Jukna97
fatcat:esk4nwwkjvcybjjnq7wlssx4we
LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
2011
Proceedings of the 11th Asian Logic 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 2017; you can also visit the original URL.
The file type is application/pdf.
We survey what is known about limitwise monotonic functions and sets and discuss their applications in effective algebra and computable model theory. ...
computable strong η-representations, and study the limitwise monotonic spectra of a set. ...
a finite collection of points, all adjacent, such that the left and right endpoints are limit points. ...
doi:10.1142/9789814360548_0004
fatcat:qnjmyxwq55cvfectfpuupmjhvi
SPARQL for a Web of Linked Data: Semantics and Computability
[chapter]
2012
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 2018; you can also visit the original URL.
The file type is application/pdf.
For both models we discuss properties such as monotonicity and computability as well as the implications of querying a Web that is infinitely large due to data generating servers. ...
The World Wide Web currently evolves into a Web of Linked Data where content providers publish and link data as they have done with hypertext for the last 20 years. ...
It is easy to see that any SPARQL LD(R) query which uses an empty set of seed URIs is not satisfiable and, thus, monotonic and finitely computable. ...
doi:10.1007/978-3-642-30284-8_8
fatcat:4b62wjtcfjfxnm3gwduos2ir54
A Finite-Volume Method for Convection Problems with Embedded Moving-Boundaries
[chapter]
2009
Computational Fluid Dynamics 2008
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 2018; you can also visit the original URL.
The file type is application/pdf.
Tailor-made limiters are derived such that the resulting scheme is monotone. The results obtained are very accurate, without requiring much computational overhead. ...
Monotonicity and Limiters Noting that the EB-affected cell-face states (7) are higher-order accurate and linear, wiggles are imminent. ...
We define non-standard monotonicity arguments,r i− 1 2 andr i+ 3 2 , and derive the limited forms of c i− 1 2 and c i+ 3 2 (see [1] for details). c i+ 1 2 , however, is not limited as we can not define ...
doi:10.1007/978-3-642-01273-0_65
fatcat:fxs4a6yg3zf7xd5za5r6hq4nma
Page 5798 of Mathematical Reviews Vol. , Issue 2001H
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We also intro- duce the idea of a limit automaton of a class and using this concept we analyse the finite recognizability of a class and its subclasses. ...
We show that all the automata belonging to a finite definable class, except for the limit automata, form a finitely recognizable class of automata. ...
Prefix-Like Complexities and Computability in the Limit
[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 2017; you can also visit the original URL.
The file type is application/pdf.
machines, for both finite and infinite sequences. ...
We introduce and compare several natural variations of prefix complexity definitions based on generalized Turing machines embodying the idea of limit computability, as well as complexities based on oracle ...
The authors are grateful to Marcus Hutter, Jan Poland, and Shane Legg for useful discussions and proofreading. ...
doi:10.1007/11780342_9
fatcat:sbskoi7r4zfzhd2zf3vzu2hux4
The expressive power of indeterminate dataflow primitives
1992
Information and Computation
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.
The trace set of any finite network built out of Hoare-monotone and limit-closed processes by aggregation, feedback and output hiding is Hoare-monotone, and hence the input-output relation is also Hoaremonotone ...
The aggregate of two networks, N and M, with Hoaremonotone and limit-closed trace sets has a Hoare-monotone and limit-closed trace set. ...
doi:10.1016/0890-5401(92)90043-f
fatcat:uj2xt7cjzvbkvo5ju7jd4dy7qi
Statistical properties of the error covariance in a Kalman filter with random measurement losses
2010
49th IEEE Conference on Decision and Control (CDC)
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.
A similar analysis leads to a necessary condition on the measurement arrival probability for the error covariance to have a finite asymptotic variance. 49th IEEE Conference on Decision and Control ...
Although we have not yet shown the monotonic convergence of this whole sequence, monotonic convergent subsequences are identified. ...
The authors are with the School of Electrical Engineering and Computer Science, University of Newcastle, University Drive, Callaghan NSW 2308, Australia. E-mail: eduardo.rohr@uon.edu.au ...
doi:10.1109/cdc.2010.5717554
dblp:conf/cdc/RohrMF10
fatcat:j6gkqgv5xvctvf6vblle3tlov4
The Theory of WSTS: The Case of Complete WSTS
[chapter]
2012
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 2013; you can also visit the original URL.
The file type is application/pdf.
Karp and Miller [KM69] proposed an algorithm, for Petri nets, which computes a finite representation of the cover , i.e., of the downward closure of the reachability set of a Petri net. ...
This computes the so-called clover of a state. When S is the completion of a WSTS X, the clover in S is a finite description of the downward closure of the reachability set. ...
Acknowledgement We wish to acknowledge Rémi Bonnet and Sylvain Schmitz for fruitful discussions. ...
doi:10.1007/978-3-642-31131-4_2
fatcat:2f7au2xk65e5ndnao3c5o6337y
Multi-dimensional limiting process for hyperbolic conservation laws on unstructured grids
2010
Journal of Computational Physics
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.
The present paper presents an efficient and accurate limiting strategy for the multidimensional hyperbolic conservation laws on unstructured grids within the framework of finite volume method. ...
Mathematically, this condition satisfies the maximum principle which is a complementary condition ensuring monotonicity. ...
Technology (Grant 20090091724), the second stage of the Brain Korea 21 Project for Mechanical and Aerospace Engineering Research at Seoul National University, and by Agency for Defense Development. ...
doi:10.1016/j.jcp.2009.10.011
fatcat:q5dbmia7cnc7ravtn66tnughva
Multi-dimensional limiting process for finite volume methods on unstructured grids
2012
Computers & Fluids
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.
This condition satisfies the maximum principle, which ensures monotonicity, and numerical results show that MLP is effective to prevent unwanted oscillations as well as to capture multi-dimensional flow ...
The present paper deals with the continuous work of extending multi-dimensional limiting process (MLP), which has been quite successfully proposed on two-and three-dimensional structured grids, onto the ...
and viscous computations on structured grids [1, 2] . ...
doi:10.1016/j.compfluid.2012.04.015
fatcat:s27jjalmdvd7jjw2n3w4sjeqoq
Remarks on two-loop free energy inN=4supersymmetric Yang-Mills theory at finite temperature
1999
Physical Review D, Particles and fields
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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
1998 pre-print arXiv:hep-th/9811224v1 fatcat:z3m4vvby6zacdhdenzkrjkdapqOther Versions
As a result of a two-loop computation we obtain, in the large N 't Hooft limit, F(g^2N→ 0)≈ -π^2/6N^2V_3T^4(1-3/2π^2g^2N). ...
The strong coupling behavior of finite temperature free energy in N=4 supersymmetric SU(N) Yang-Mills theory has been recently discussed by Gubser, Klebanov and Tseytlin in the context of AdS-SYM correspondence ...
We are grateful to Pierre Binétruy and all members of LPTHE for their kind hospitality. ...
doi:10.1103/physrevd.59.061701
fatcat:tfvvac3zo5codiza72atdh66uu
Page 4395 of Mathematical Reviews Vol. , Issue 2002F
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “A pattern is a finite string of constant and variable symbols. ...
p = 1/2, and monotonic probabilistic learning with p = 2/3. ...
Monotonic Limiters for a Second-Order Finite-Volume Advection Scheme Using Icosahedral-Hexagonal Meshes
2010
Monthly Weather Review
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.
An assessment of a recently developed (by Miura) second-order numerical advection scheme for icosahedralhexagonal grids on the sphere is presented, and the effects of monotonic limiters that can be used ...
The limiters of Zalesak, Dukowicz and Kodis, and Thuburn are tested within this numerical scheme. ...
For conservative finite-volume schemes, monotonicity can be achieved either by modifying the tracer value at the interfaces, where it is used to compute the flux, or by adjusting the fluxes after they ...
doi:10.1175/2010mwr3503.1
fatcat:qyueer5yjnem7eszpw2qqsjuoy
Limitwise monotonic functions, sets, and degrees on computable domains
2010
Journal of Symbolic Logic (JSL)
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.
We then study which sets and degrees are support increasing (support strictly increasing) limitwise monotonic on various computable domains. ...
of order-computable sets and the class of support increasing (support strictly increasing) limitwise monotonic sets on certain domains. ...
Let γ be such a computable ordinal, and let A, B ∈ SILM(ω γ ) have limit approximation functions f A and f B . ...
doi:10.2178/jsl/1264433912
fatcat:chu6mbawmjhffkzovaz4ahaq44
« Previous
Showing results 1 — 15 out of 278,101 results