Готові списки джерел за темами / Boundy

Добірка наукової літератури з теми "Boundy"

Автор: Grafiati

Опубліковано: 10 грудня 2022

Оновлено: 29 січня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Boundy".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Boundy"

CHEN, Zi-Yun, Jian-Ning SUN, Ren-Ming YUAN, and Wei-Mei JIANG. "Analysis Study on Convective Boundy Layer Eddy Structure in Water Tank by Orthonormal Wavelet." Chinese Journal of Geophysics 47, no. 6 (November 2004): 1085–92. http://dx.doi.org/10.1002/cjg2.591.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dijk, Nico M. Van. "An Error-Bound Theorem for Approximate Markov Chains." Probability in the Engineering and Informational Sciences 6, no. 3 (July 1992): 413–24. http://dx.doi.org/10.1017/s026996480000262x.

Повний текст джерела

Анотація:

Recently an error-bound theorem was reported to conclude analytic error bounds for approximate Markov chains. The theorem required a uniform bound for marginal expectations of the approximate model. This note will relax this bound to steady state rather than marginal expectations as of practical interest(i) to simplify verification and/or(ii) to obtain a more accurate error bound.A communication model is studied in detail to support the results.

Стилі APA, Harvard, Vancouver, ISO та ін.

BLANCHARD, PH, and J. STUBBE. "BOUND STATES FOR SCHRÖDINGER HAMILTONIANS: PHASE SPACE METHODS AND APPLICATIONS." Reviews in Mathematical Physics 08, no. 04 (May 1996): 503–47. http://dx.doi.org/10.1142/s0129055x96000172.

Повний текст джерела

Анотація:

Properties of bound states for Schrödinger operators are reviewed. These include: bounds on the number of bound states and on the moments of the energy levels, existence and nonexistence of bound states, phase space bounds and semi-classical results, the special case of central potentials, and applications of these bounds in quantum mechanics of many particle systems and dynamical systems. For the phase space bounds relevant to these applications we improve the explicit constants.

Стилі APA, Harvard, Vancouver, ISO та ін.

Paulavičius, Remigijus, and Julius Žilinskas. "INFLUENCE OF LIPSCHITZ BOUNDS ON THE SPEED OF GLOBAL OPTIMIZATION." Technological and Economic Development of Economy 18, no. 1 (April 10, 2012): 54–66. http://dx.doi.org/10.3846/20294913.2012.661170.

Повний текст джерела

Анотація:

Global optimization methods based on Lipschitz bounds have been analyzed and applied widely to solve various optimization problems. In this paper a bound for Lipschitz function is proposed, which is computed using function values at the vertices of a simplex and the radius of the circumscribed sphere. The efficiency of a branch and bound algorithm with proposed bound and combinations of bounds is evaluated experimentally while solving a number of multidimensional test problems for global optimization. The influence of different bounds on the performance of a branch and bound algorithm has been investigated.

Стилі APA, Harvard, Vancouver, ISO та ін.

Pereira, Rajesh, and Mohammad Ali Vali. "Generalizations of the Cauchy and Fujiwara Bounds for Products of Zeros of a Polynomial." Electronic Journal of Linear Algebra 31 (February 5, 2016): 565–71. http://dx.doi.org/10.13001/1081-3810.3333.

Повний текст джерела

Анотація:

The Cauchy bound is one of the best known upper bounds for the modulus of the zeros of a polynomial. The Fujiwara bound is another useful upper bound for the modulus of the zeros of a polynomial. In this paper, compound matrices are used to derive a generalization of both the Cauchy bound and the Fujiwara bound. This generalization yields upper bounds for the modulus of the product of $m$ zeros of the polynomial.

Стилі APA, Harvard, Vancouver, ISO та ін.

Anade, Dadja, Jean-Marie Gorce, Philippe Mary, and Samir M. Perlaza. "An Upper Bound on the Error Induced by Saddlepoint Approximations—Applications to Information Theory." Entropy 22, no. 6 (June 20, 2020): 690. http://dx.doi.org/10.3390/e22060690.

Повний текст джерела

Анотація:

This paper introduces an upper bound on the absolute difference between: ( a ) the cumulative distribution function (CDF) of the sum of a finite number of independent and identically distributed random variables with finite absolute third moment; and ( b ) a saddlepoint approximation of such CDF. This upper bound, which is particularly precise in the regime of large deviations, is used to study the dependence testing (DT) bound and the meta converse (MC) bound on the decoding error probability (DEP) in point-to-point memoryless channels. Often, these bounds cannot be analytically calculated and thus lower and upper bounds become particularly useful. Within this context, the main results include, respectively, new upper and lower bounds on the DT and MC bounds. A numerical experimentation of these bounds is presented in the case of the binary symmetric channel, the additive white Gaussian noise channel, and the additive symmetric α -stable noise channel.

Стилі APA, Harvard, Vancouver, ISO та ін.

Kılıçer, Pınar, Elisa Lorenzo García, and Marco Streng. "Primes Dividing Invariants of CM Picard Curves." Canadian Journal of Mathematics 72, no. 2 (May 7, 2019): 480–504. http://dx.doi.org/10.4153/s0008414x18000111.

Повний текст джерела

Анотація:

AbstractWe give a bound on the primes dividing the denominators of invariants of Picard curves of genus 3 with complex multiplication. Unlike earlier bounds in genus 2 and 3, our bound is based, not on bad reduction of curves, but on a very explicit type of good reduction. This approach simultaneously yields a simplification of the proof and much sharper bounds. In fact, unlike all previous bounds for genus 3, our bound is sharp enough for use in explicit constructions of Picard curves.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ipsen, Ilse C. F. "Relative perturbation results for matrix eigenvalues and singular values." Acta Numerica 7 (January 1998): 151–201. http://dx.doi.org/10.1017/s0962492900002828.

Повний текст джерела

Анотація:

It used to be good enough to bound absolute of matrix eigenvalues and singular values. Not any more. Now it is fashionable to bound relative errors. We present a collection of relative perturbation results which have emerged during the past ten years.No need to throw away all those absolute error bound, though. Deep down, the derivation of many relative bounds can be based on absolute bounds. This means that relative bounds are not always better. They may just be better sometimes – and exactly when depends on the perturbation.

Стилі APA, Harvard, Vancouver, ISO та ін.

Li, Yating, and Yaqiang Wang. "Schur Complement-Based Infinity Norm Bounds for the Inverse of GDSDD Matrices." Mathematics 10, no. 2 (January 7, 2022): 186. http://dx.doi.org/10.3390/math10020186.

Повний текст джерела

Анотація:

Based on the Schur complement, some upper bounds for the infinity norm of the inverse of generalized doubly strictly diagonally dominant matrices are obtained. In addition, it is shown that the new bound improves the previous bounds. Numerical examples are given to illustrate our results. By using the infinity norm bound, a lower bound for the smallest singular value is given.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ambainis, Andris, Martins Kokainis, Krišjānis Prūsis, Jevgēnijs Vihrovs, and Aleksejs Zajakins. "All Classical Adversary Methods Are Equivalent for Total Functions." ACM Transactions on Computation Theory 13, no. 1 (March 2021): 1–20. http://dx.doi.org/10.1145/3442357.

Повний текст джерела

Анотація:

We show that all known classical adversary lower bounds on randomized query complexity are equivalent for total functions and are equal to the fractional block sensitivity fbs( f ). That includes the Kolmogorov complexity bound of Laplante and Magniez and the earlier relational adversary bound of Aaronson. This equivalence also implies that for total functions, the relational adversary is equivalent to a simpler lower bound, which we call rank-1 relational adversary. For partial functions, we show unbounded separations between fbs( f ) and other adversary bounds, as well as between the adversary bounds themselves. We also show that, for partial functions, fractional block sensitivity cannot give lower bounds larger than √ n ⋅ bs( f ), where n is the number of variables and bs( f ) is the block sensitivity. Then, we exhibit a partial function f that matches this upper bound, fbs( f ) = Ω (√ n ⋅ bs( f )).

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Boundy"

Nagar, Atulya Kumar. "Application of functional bounds to nonlinear boundary value problems." Thesis, University of York, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.318245.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kelner, Jonathan 1980. "Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/30169.

Повний текст джерела

Анотація:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Includes bibliographical references (leaves 37-39).
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree: 1. It is a classical result of Gilbert, Hutchinson, and Tarjan [12] that one can find asymptotically optimal separators on these graphs if he is given both the graph and an embedding of it onto a low genus surface. Does there exist a simple, efficient algorithm to find these separators given only the graph and not the embedding? 2. In practice, spectral partitioning heuristics work extremely well on these graphs. Is there a theoretical reason why this should be the case? We resolve these two questions by showing that a simple spectral algorithm finds separators of cut ratio O(sqrt(g/n)) and vertex bisectors of size O(sqrt(gn)) in these graphs, both of which are optimal. As our main technical lemma, we prove an O(g/n) bound on the second smallest eigenvalue of the Laplacian of such graphs and show that this is tight, thereby resolving a conjecture of Spielman and Teng. While this lemma is essentially combinatorial in nature, its proof comes from continuous mathematics, drawing on the theory of circle packings and the geometry of compact Riemann surfaces.
by Jonathan Kelner.
S.M.

Стилі APA, Harvard, Vancouver, ISO та ін.

Yarahmadian, Shantia. "Point wise Green function bounds and long-time stability of large-amplitude noncharacteristic boundary layers." [Bloomington, Ind.] : Indiana University, 2008. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3337271.

Повний текст джерела

Анотація:

Thesis (Ph.D.)--Indiana University, Dept. of Mathematics, 2008.
Title from PDF t.p. (viewed on Jul 28, 2009). Source: Dissertation Abstracts International, Volume: 69-12, Section: B, page: 7553. Adviser: Kevin Zumbrun.

Стилі APA, Harvard, Vancouver, ISO та ін.

Medida, Shivaji. "Curvilinear Extension to the Giles Non-reflecting Boundary Conditions for Wall-bounded Flows." Connect to Online Resource-OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=toledo1185309100.

Повний текст джерела

Анотація:

Thesis (M.S.)--University of Toledo, 2007.
Typescript. "Submitted as partial fulfillments of the requirements for the Master of Science Degree in Mechanical Engineering." "A thesis entitled"--at head of title. Bibliography: leaves 196-205.

Стилі APA, Harvard, Vancouver, ISO та ін.

Fresneda-Portillo, Carlos. "Boundary-domain integral equation systems for the Stokes system with variable viscosity and diffusion equation in inhomogeneous media." Thesis, Brunel University, 2016. http://bura.brunel.ac.uk/handle/2438/14521.

Повний текст джерела

Анотація:

The importance of the Stokes system stems from the fact that the Stokes system is the stationary linearised form of the Navier Stokes system [Te01, Chapter1]. This linearisation is allowed when neglecting the inertial terms at a low Reinolds numbers Re << 1. The Stokes system essentially models the behaviour of a non - turbulent viscous fluid. The mixed interior boundary value problem related to the compressible Stokes system is reduced to two different BDIES which are equivalent to the original boundary value problem. These boundary-domain integral equation systems (BDIES) can be expressed in terms of surface and volume parametrix-based potential type operators whose properties are also analysed in appropriate Sobolev spaces. The invertibility and Fredholm properties related to the matrix operators that de ne the BDIES are also presented. Furthermore, we also consider the mixed compressible Stokes system with variable viscosity in unbounded domains. An analysis of the similarities and differences with regards to the bounded domain case is presented. Furthermore, we outline the mapping properties of the surface and volume parametrix-based potentials in weighted Sobolev spaces. Equivalence and invertibility results still hold under certain decay conditions on the variable coeffi cient The last part of the thesis refers to the mixed boundary value problem for the stationary heat transfer partial di erential equation with variable coe cient. This BVP is reduced to a system of direct segregated parametrix-based Boundary-Domain Integral Equations (BDIEs). We use a parametrix different from the one employed by Chkadua, Mikhailov and Natroshvili in the paper [CMN09]. Mapping properties of the potential type integral operators appearing in these equations are presented in appropriate Sobolev spaces. We prove the equivalence between the original BVP and the corresponding BDIE system. The invertibility and Fredholm properties of the boundary-domain integral operators are also analysed in both bounded and unbounded domains.

Стилі APA, Harvard, Vancouver, ISO та ін.

Phạm, Phú Tinh [Verfasser]. "Upper bound limit and shakedown analysis of elastic-plastic bounded linearly kinematic hardening structures / Phu Tinh Pham." Aachen : Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen, 2011. http://d-nb.info/1018189491/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Azarskov, V., L. Zhiteckii, and K. Solovchuk. "Robust adaptive stabilization of multivariable static systems with unknown square gain matrices and bounded disturbances having unknown bounds." Thesis, Національний авіаційний університет, 2016. http://er.nau.edu.ua/handle/NAU/28626.

Повний текст джерела

Анотація:

This work deals with designing the adtipUvj robust control systems containing linear discrete-time multivariable static plants which have unknown and possibly singtdar square gain matrices in the presence of arbitrary bounded disturbances whose bounds are unknown. The asymptotical properties of these systems are established

Стилі APA, Harvard, Vancouver, ISO та ін.

Kramer, Eugene. "Nonhomogeneous Boundary Value Problems for the Korteweg-de Vries Equation on a Bounded Domain." University of Cincinnati / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1258478397.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Krietenstein, Thorben [Verfasser], and Elmar [Akademischer Betreuer] Schrohe. "Bounded H∞-calculus for a degenerate elliptic boundary value problem / Thorben Krietenstein ; Betreuer: Elmar Schrohe." Hannover : Gottfried Wilhelm Leibniz Universität Hannover, 2019. http://d-nb.info/1204458901/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dür, Mirjam. "A Class of Problems where Dual Bounds Beat Underestimation Bounds." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 2000. http://epub.wu.ac.at/1468/1/document.pdf.

Повний текст джерела

Анотація:

We investigate the problem of minimizing a nonconvex function with respect to convex constraints, and we study different techniques to compute a lower bound on the optimal value: The method of using convex envelope functions on one hand, and the method of exploiting nonconvex duality on the other hand. We investigate which technique gives the better bound and develop conditions under which the dual bound is strictly better than the convex envelope bound. As a byproduct, we derive some interesting results on nonconvex duality. (author's abstract)
Series: Forschungsberichte / Institut für Statistik

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Boundy"

Bounty. Christchurch, N.Z: Canterbury University Press, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Randall, Joshua. Beauty & the Bounty (Bounty Hunter). USA: PaperJacks, 1988.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Randall, Joshua. Bounty on a Lawman (Bounty Hunter). USA: PaperJacks, 1987.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Napoli, Donna Jo. Bound. New York: Atheneum Books for Young Readers, 2004.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gunning, Sally. Bound. New York: William Morrow, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Napoli, Donna Jo. Bound. Waterville, Me: Thorndike Press, 2005.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gunning, Sally. Bound. New York: William Morrow, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hoffman, Henry. Bound. [South Thomaston, Me.?]: Dan River Press, 1991.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gunning, Sally. Bound. New York: William Morrow, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gunning, Sally. Bound. New York: William Morrow, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Boundy"

Ish-Shalom, Oren, Shachar Itzhaky, Noam Rinetzky, and Sharon Shoham. "Run-time Complexity Bounds Using Squeezers." In Programming Languages and Systems, 320–47. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_12.

Повний текст джерела

Анотація:

AbstractDetermining upper bounds on the time complexity of a program is a fundamental problem with a variety of applications, such as performance debugging, resource certification, and compile-time optimizations. Automated techniques for cost analysis excel at bounding the resource complexity of programs that use integer values and linear arithmetic. Unfortunately, they fall short when execution traces become more involved, esp. when data dependencies may affect the termination conditions of loops. In such cases, state-of-the-art analyzers have shown to produce loose bounds, or even no bound at all.We propose a novel technique that generalizes the common notion of recurrence relations based on ranking functions. Existing methods usually unfold one loop iteration, and examine the resulting relations between variables. These relations assist in establishing a recurrence that bounds the number of loop iterations. We propose a different approach, where we derive recurrences by comparing whole traces with whole traces of a lower rank, avoiding the need to analyze the complexity of intermediate states. We offer a set of global properties, defined with respect to whole traces, that facilitate such a comparison, and show that these properties can be checked efficiently using a handful of local conditions. To this end, we adapt state squeezers, an induction mechanism previously used for verifying safety properties. We demonstrate that this technique encompasses the reasoning power of bounded unfolding, and more. We present some seemingly innocuous, yet intricate, examples where previous tools based on cost relations and control flow analysis fail to solve, and that our squeezer-powered approach succeeds.

Стилі APA, Harvard, Vancouver, ISO та ін.

Hella, Lauri, and Miikka Vilander. "Defining Long Words Succinctly in FO and MSO." In Revolutions and Revelations in Computability, 125–38. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-08740-0_11.

Повний текст джерела

Анотація:

AbstractWe consider the length of the longest word definable in FO and MSO via a formula of size n. For both logics we obtain as an upper bound for this number an exponential tower of height linear in n. We prove this by counting types with respect to a fixed quantifier rank. As lower bounds we obtain for both FO and MSO an exponential tower of height in the order of a rational power of n. We show these lower bounds by giving concrete formulas defining word representations of levels of the cumulative hierarchy of sets. In addition, we consider the Löwenheim-Skolem and Hanf numbers of these logics on words and obtain similar bounds for these as well.

Стилі APA, Harvard, Vancouver, ISO та ін.

Abdulla, Parosh Aziz, Mohamed Faouzi Atig, Adwait Godbole, S. Krishna, and Viktor Vafeiadis. "The Decidability of Verification under PS 2.0." In Programming Languages and Systems, 1–29. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_1.

Повний текст джерела

Анотація:

AbstractWe consider the reachability problem for finite-state multi-threaded programs under thepromising semantics() of Lee et al., which captures most common program transformations. Since reachability is already known to be undecidable in the fragment of with only release-acquire accesses (-), we consider the fragment with only relaxed accesses and promises (). We show that reachability under is undecidable in general and that it becomes decidable, albeit non-primitive recursive, if we bound the number of promises.Given these results, we consider a bounded version of the reachability problem. To this end, we bound both the number of promises and of “view-switches”, i.e., the number of times the processes may switch their local views of the global memory. We provide a code-to-code translation from an input program under (with relaxed and release-acquire memory accesses along with promises) to a program under SC, thereby reducing the bounded reachability problem under to the bounded context-switching problem under SC. We have implemented a tool and tested it on a set of benchmarks, demonstrating that typical bugs in programs can be found with a small bound.

Стилі APA, Harvard, Vancouver, ISO та ін.

Paulsen, Brandon, and Chao Wang. "LinSyn: Synthesizing Tight Linear Bounds for Arbitrary Neural Network Activation Functions." In Tools and Algorithms for the Construction and Analysis of Systems, 357–76. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99524-9_19.

Повний текст джерела

Анотація:

AbstractThe most scalable approaches to certifying neural network robustness depend on computing sound linear lower and upper bounds for the network’s activation functions. Current approaches are limited in that the linear bounds must be handcrafted by an expert, and can be sub-optimal, especially when the network’s architecture composes operations using, for example, multiplication such as in LSTMs and the recently popular Swish activation. The dependence on an expert prevents the application of robustness certification to developments in the state-of-the-art of activation functions, and furthermore the lack of tightness guarantees may give a false sense of insecurity about a particular model. To the best of our knowledge, we are the first to consider the problem of automatically synthesizing tight linear bounds for arbitrary n-dimensional activation functions. We propose the first fully automated method that achieves tight linear bounds while only leveraging the mathematical definition of the activation function itself. Our method leverages an efficient heuristic technique to synthesize bounds that are tight and usually sound, and then verifies the soundness (and adjusts the bounds if necessary) using the highly optimized branch-and-bound SMT solver, dReal. Even though our method depends on an SMT solver, we show that the runtime is reasonable in practice, and, compared with state of the art, our method often achieves 2-5X tighter final output bounds and more than quadruple certified robustness.

Стилі APA, Harvard, Vancouver, ISO та ін.

Casado, L. G., B. G.-Tóth, E. M. T. Hendrix, and F. Messine. "On Monotonicity Detection in Simplicial Branch and Bound over a Simplex." In Computational Science and Its Applications – ICCSA 2022 Workshops, 113–26. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10562-3_9.

Повний текст джерела

Анотація:

Abstract The concept of exploiting proven monotonicity for dimension reduction and elimination of partition sets is well known in the field of Interval Arithmetic Branch and Bound (B &B). Part of the concepts can be applied in simplicial B &B over a box. The focus of our research is here on minimizing a function over a lower simplicial dimension feasible set, like in blending and portfolio optimization problems. How can monotonicity be detected and be exploited in a B &B context? We found that feasible directions can be used to derive bounds on the directional derivative. Specifically, Linear Programming can be used to detect the sharpest bounds.

Стилі APA, Harvard, Vancouver, ISO та ін.

Csaba, Béla, Judit Nagy-György, Ian Levitt, and Endre Szemerédi. "Tight Bounds for Embedding Bounded Degree Trees." In Fete of Combinatorics and Computer Science, 95–137. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13580-4_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Bottesch, Ralph, Max W. Haslbeck, Alban Reynaud, and René Thiemann. "Verifying a Solver for Linear Mixed Integer Arithmetic in Isabelle/HOL." In Lecture Notes in Computer Science, 233–50. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-55754-6_14.

Повний текст джерела

Анотація:

AbstractWe implement a decision procedure for linear mixed integer arithmetic and formally verify its soundness in Isabelle/HOL. We further integrate this procedure into one application, namely into , a formally verified certifier to check untrusted termination proofs. This checking involves assertions of unsatisfiability of linear integer inequalities; previously, only a sufficient criterion for such checks was supported. To verify the soundness of the decision procedure, we first formalize the proof that every satisfiable set of linear integer inequalities also has a small solution, and give explicit upper bounds. To this end we mechanize several important theorems on linear programming, including statements on integrality and bounds. The procedure itself is then implemented as a branch-and-bound algorithm, and is available in several languages via Isabelle’s code generator. It internally relies upon an adapted version of an existing verified incremental simplex algorithm.

Стилі APA, Harvard, Vancouver, ISO та ін.

Havlena, Vojtěch, Ondřej Lengál, and Barbora Šmahlíková. "Sky Is Not the Limit." In Tools and Algorithms for the Construction and Analysis of Systems, 118–36. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99527-0_7.

Повний текст джерела

Анотація:

AbstractWe propose several heuristics for mitigating one of the main causes of combinatorial explosion in rank-based complementation of Büchi automata (BAs): unnecessarily high bounds on the ranks of states. First, we identify elevator automata, which is a large class of BAs (generalizing semi-deterministic BAs), occurring often in practice, where ranks of states are bounded according to the structure of strongly connected components. The bounds for elevator automata also carry over to general BAs that contain elevator automata as a sub-structure. Second, we introduce two techniques for refining bounds on the ranks of BA states using data-flow analysis of the automaton. We implement out techniques as an extension of the tool Ranker for BA complementation and show that they indeed greatly prune the generated state space, obtaining significantly better results and outperforming other state-of-the-art tools on a large set of benchmarks.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ehrgott, Matthias, and Xavier Gandibleux. "Bounds and Bound Sets for Biobjective Combinatorial Optimization Problems." In Lecture Notes in Economics and Mathematical Systems, 241–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-56680-6_22.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Aghazadeh, Zahra, and Philipp Woelfel. "Upper Bounds for Boundless Tagging with Bounded Objects." In Lecture Notes in Computer Science, 442–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53426-7_32.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Boundy"

Eldar, Y. C. "MSE bounds dominating the cramer-RAO bound." In 2005 Microwave Electronics: Measurements, Identification, Applications. IEEE, 2005. http://dx.doi.org/10.1109/ssp.2005.1628653.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Tempero, Ewan, and Richard Ladner. "Tight bounds for weakly bounded protocols." In the ninth annual ACM symposium. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/93385.93421.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Chen, Jian-Jia, and Samarjit Chakraborty. "Resource Augmentation Bounds for Approximate Demand Bound Functions." In 2011 IEEE 32nd Real-Time Systems Symposium (RTSS). IEEE, 2011. http://dx.doi.org/10.1109/rtss.2011.32.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Saito, Shota. "On Meta-Bound for Lower Bounds of Bayes Risk." In 2022 IEEE International Symposium on Information Theory (ISIT). IEEE, 2022. http://dx.doi.org/10.1109/isit50566.2022.9834810.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Fichte, Johannes K., Markus Hecher, and Andreas Pfandler. "Lower Bounds for QBFs of Bounded Treewidth." In LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3373718.3394756.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Chandrasekar, Krishna, and Steven Verstockt. "Page Boundary Extraction of Bound Historical Herbaria." In Special Session on Artificial Intelligence and Digital Heritage: Challenges and Opportunities. SCITEPRESS - Science and Technology Publications, 2020. http://dx.doi.org/10.5220/0009154104760483.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

FLAVIN, J. N. "A CLASS OF BOUNDS FOR MOVING BOUNDARY PROBLEMS." In Proceedings of the 15th Conference on WASCOM 2009. WORLD SCIENTIFIC, 2010. http://dx.doi.org/10.1142/9789814317429_0024.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gipson, G. S., and B. W. Yeigh. "Explicit formulations for advanced Green’s functions with built-in boundaries." In BOUNDARY ELEMENT METHOD 2006. Southampton, UK: WIT Press, 2006. http://dx.doi.org/10.2495/be06001.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Katsikadelis, J. T. "The meshless analog equation method: a new highly accurate truly mesh-free method for solving partial differential equations." In BOUNDARY ELEMENT METHOD 2006. Southampton, UK: WIT Press, 2006. http://dx.doi.org/10.2495/be06002.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Arzani, H., and M. H. Afshar. "Solving Poisson’s equations by the Discrete Least Square meshless method." In BOUNDARY ELEMENT METHOD 2006. Southampton, UK: WIT Press, 2006. http://dx.doi.org/10.2495/be06003.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Boundy"

Clerc, Jean-Louis. Geometry of the Shilov Boundary of a Bounded Symmetric Domain. GIQ, 2012. http://dx.doi.org/10.7546/giq-10-2009-11-55.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Clerc, Jean-Louis. Geometry of the Shilov Boundary of a Bounded Symmetric Domain. Journal of Geometry and Symmetry in Physics, 2012. http://dx.doi.org/10.7546/jgsp-13-2009-25-74.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hayward, N., and S. Paradis. Geophysical reassessment of the role of ancient lineaments on the development of the western margin of Laurentia and its sediment-hosted Zn-Pb deposits, Yukon and Northwest Territories. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/330038.

Повний текст джерела

Анотація:

The role of crustal lineaments in the development of the western margin of Laurentia, Selwyn basin and associated sediment-hosted Zn-Pb deposits (clastic-dominated, Mississippi-Valley-type) in Yukon and NWT, are reassessed through a new 3-D inversion strategy applied to new compilations of gravity and magnetic data. Regionally continuous, broadly NE-trending crustal lineaments including the Liard line, Fort Norman structure, and Leith Ridge fault, were interpreted as having had long-standing influence on craton, margin, and sedimentary basin development. However, multiple tectonic overprints including terrane accretion, thrust faulting, and plutonism obscure the region's history. The Liard line, related to a transfer fault that bounds the Macdonald Platform promontory, is refined from the integration of the new geophysical models with published geological data. The geophysical models support the continuity of the Fort Norman structure below the Selwyn basin, but the presence of Leith Ridge fault is not supported in this area. The ENE-trending Mackenzie River lineament, traced from the Misty Creek Embayment to Great Bear Lake, is interpreted to mark the southern edge of a cratonic promontory. The North American craton is bounded by a NW-trending lineament interpreted as a crustal manifestation of lithospheric thinning of the Laurentian margin, as echoed by a change in the depth of the lithosphere-asthenosphere boundary. The structure is straddled by Mississippi Valley-type Zn-Pb occurrences, following their palinspastic restoration, and also defines the eastern limit of mid-Late Cretaceous granitic intrusions. Another NW-trending lineament, interpreted to be associated with a shallowing of lower crustal rocks, is coincident with clastic-dominated Zn-Pb occurrences.

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, Jan Hladik, and Rafael Peñaloza. PSpace Automata with Blocking for Description Logics. Aachen University of Technology, 2006. http://dx.doi.org/10.25368/2022.157.

Повний текст джерела

Анотація:

In Description Logics (DLs), both tableau-based and automatabased algorithms are frequently used to show decidability and complexity results for basic inference problems such as satisfiability of concepts. Whereas tableau-based algorithms usually yield worst-case optimal algorithms in the case of PSpace-complete logics, it is often very hard to design optimal tableau-based algorithms for ExpTime-complete DLs. In contrast, the automata-based approach is usually well-suited to prove ExpTime upper-bounds, but its direct application will usually also yield an ExpTime-algorithm for a PSpace-complete logic since the (tree) automaton constructed for a given concept is usually exponentially large. In the present paper, we formulate conditions under which an on-the-fly construction of such an exponentially large automaton can be used to obtain a PSpace-algorithm. We illustrate the usefulness of this approach by proving a new PSpace upper-bound for satisfiability of concepts w.r.t. acyclic terminologies in the DL SI, which extends the basic DL ALC with transitive and inverse roles.

Стилі APA, Harvard, Vancouver, ISO та ін.

Kim, Chang-Bae, and J. A. Krommes. Improved rigorous upper bounds for transport due to passive advection described by simple models of bounded systems. Office of Scientific and Technical Information (OSTI), August 1988. http://dx.doi.org/10.2172/7178866.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Weyburne, David W. The Origin of the Log Law Region for Wall-bounded Turbulent Boundary Layer Flows. Fort Belvoir, VA: Defense Technical Information Center, February 2011. http://dx.doi.org/10.21236/ada538378.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Bather, John, and Herman Chernoff. Bounds and Asymptotic Expansions for Solutions of the Free Boundary Problems Related to Sequential Decision Versions of a Bioequivalence Problem. Fort Belvoir, VA: Defense Technical Information Center, November 1993. http://dx.doi.org/10.21236/ada273551.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Derbentsev, V., A. Ganchuk, and Володимир Миколайович Соловйов. Cross correlations and multifractal properties of Ukraine stock market. Politecnico di Torino, 2006. http://dx.doi.org/10.31812/0564/1117.

Повний текст джерела

Анотація:

Recently the statistical characterizations of ﬁnancial markets based on physics concepts and methods attract considerable attentions. The correlation matrix formalism and concept of multifractality are used to study temporal aspects of the Ukraine Stock Market evolution. Random matrix theory (RMT) is carried out using daily returns of 431 stocks extracted from database time series of prices the First Stock Trade System index (www.kinto.com) for the ten-year period 1997-2006. We ﬁnd that a majority of the eigenvalues of C fall within the RMT bounds for the eigenvalues of random correlation matrices. We test the eigenvalues of C within the RMT bound for universal properties of random matrices and ﬁnd good agreement with the results for the Gaussian orthogonal ensemble of random matrices—implying a large degree of randomness in the measured cross-correlation coeﬃcients. Further, we ﬁnd that the distribution of eigenvector components for the eigenvectors corresponding to the eigenvalues outside the RMT bound display systematic deviations from the RMT prediction. We analyze the components of the deviating eigenvectors and ﬁnd that the largest eigenvalue corresponds to an inﬂuence common to all stocks. Our analysis of the remaining deviating eigenvectors shows distinct groups, whose identities correspond to conventionally identiﬁed business sectors. Comparison with the Mantegna minimum spanning trees method gives a satisfactory consent. The found out the pseudoeﬀects related to the artiﬁcial unchanging areas of price series come into question We used two possible procedures of analyzing multifractal properties of a time series. The ﬁrst one uses the continuous wavelet transform and extracts scaling exponents from the wavelet transform amplitudes over all scales. The second method is the multifractal version of the detrended ﬂuctuation analysis method (MF-DFA). The multifractality of a time series we analysed by means of the diﬀerence of values singularity stregth (or Holder exponent) ®max and ®min as a suitable way to characterise multifractality. Singularity spectrum calculated from daily returns using a sliding 250 day time window in discrete steps of 1. . . 10 days. We discovered that changes in the multifractal spectrum display distinctive pattern around signiﬁcant “drawdowns”. Finally, we discuss applications to the construction of crushes precursors at the ﬁnancial markets.

Стилі APA, Harvard, Vancouver, ISO та ін.

Vaughan, Diane Elizabeth, and Dean L. Preston. Physical Uncertainty Bounds (PUB). Office of Scientific and Technical Information (OSTI), March 2015. http://dx.doi.org/10.2172/1209314.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Whitehead, John A., Friedrich Busse, Louis Howard, Charles Doering, and Peter Constantin. Bounds on Turbulent Transport. Fort Belvoir, VA: Defense Technical Information Center, July 2003. http://dx.doi.org/10.21236/ada417533.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!