Search results for "bound"
showing 10 items of 2948 documents
MR2986428 Lebedev, Leonid P.(CL-UNC); Vorovich, Iosif I.; Cloud, Michael J. Functional analysis in mechanics. Second edition. Springer Monographs in …
2014
Absolutely summing operators on C[0,1] as a tree space and the bounded approximation property
AbstractLet X be a Banach space. For describing the space P(C[0,1],X) of absolutely summing operators from C[0,1] to X in terms of the space X itself, we construct a tree space ℓ1tree(X) on X. It consists of special trees in X which we call two-trunk trees. We prove that P(C[0,1],X) is isometrically isomorphic to ℓ1tree(X). As an application, we characterize the bounded approximation property (BAP) and the weak BAP in terms of X∗-valued sequence spaces.
Dasymetric distribution of votes in a dense city
2017
[EN] A large proportion of electoral analyses using geography are performed on a small area basis, such as polling units. Unfortunately, polling units are frequently redrawn, provoking breaks in their data series. Previous electoral results play a key role in many analyses. They are used by political party workers and journalists to present quick assessments of outcomes, by political scientists and electoral geographers to perform detailed scrutinizes and by pollsters and forecasters to anticipate electoral results. In this paper, we study to what extent more complex geographical approaches (based on a proper location of electors on the territory using dasymetric techniques) are of value in…
Multi-Resource Management for Multi-Tier Space Information Networks: A Cooperative Game
2019
With the drastic increase of space information network (SIN) traffic and the diversity of network traffic types, the optimal allocation of the scarce network resources is of great significance for optimizing the SIN system capability. In this paper, we propose a multi-resource management method for multi-tier SIN using the cooperative Nash bargaining solution. Since the original problem is a non-convex problem, we firstly make logarithmic transition, and then find a tightest lower bound function to convert the initial problem into a convex one. In order to carry out the optimal bandwidth and power allocation in SIN, we construct a joint bandwidth and power allocation (JBPA) algorithm. Simul…
Predictions forNDK,K̄DNandNDD̄molecules
2012
In this work baryon systems made of three hadrons which contain one nucleon and one D meson, and in addition another meson, , K or , are investigated using the Fixed Center Approximation to the Faddeev equations. In this work we use Λc(2595), X(3700) and D*s0(2317) bound states as a cluster and a third particle scattering form that clusters. In all cases we find bound states and quasibound states.
Double precision errors in the logistic map: statistical study and dynamical interpretation.
2007
The nature of the round-off errors that occur in the usual double precision computation of the logistic map is studied in detail. Different iterative regimes from the whole panoply of behaviors exhibited in the bifurcation diagram are examined, histograms of errors in trajectories given, and for the case of fully developed chaos an explicit formula is found. It is shown that the statistics of the largest double precision error as a function of the map parameter is characterized by jumps whose location is determined by certain boundary crossings in the bifurcation diagram. Both jumps and locations seem to present geometric convergence characterized by the two first Feigenbaum constants. Even…
Trial Methods for Nonlinear Bernoulli Problem
1997
In this article we consider a free boundary problem which is related to formation of waves on a fluid surface (for example the ship waves). We study the possibility to construct ‘trial’ methods where one solves a sequence of standard flow problems formulated in different geometries that converge to the final free boundary. Furthermore, we use the shape optimization techniques to analyse the convergence of the fixed point iteration near a fixed point. For stream function case we conclude that the fast convergence can be obtained by using non-standard boundary conditions and we present numerical results to confirm the analysis.
New upper bounds for some instances from benchmark for vector packing problem
2021
This dataset is a result of the research: Đorđe Stakić, Miodrag Živković, Ana Anokić, "A Reduced Variable Neighborhood Search Approach to the Heterogeneous Vector Bin Packing Problem", Information Technology and Control, 2021, 50(4), 808-826, https://doi.org/10.5755/j01.itc.50.4.29009 Files are given by algorithm described in it. This dataset consists of 14 solutions with better bounds for instances described in paper: Heßler, K., Gschwind, T., Irnich, S. Stabilized branch-and-price algorithms for vector packing problems. European Journal of Operational Research, 2018, 271(2), 401-419. https://doi.org/10.1016/j.ejor.2018.04.047 File structure: Instance name: UB: solut…
Application of the 3-D boundary element method to delaminated composite structures
2013
A three-dimensional boundary element model for anisotropic solids is presented to study the fracture mechanics behavior of delaminated composite structures. The multi-domain technique is implemented to model the layered configurations and the cracks occurring at bi-material interface. The Modified Crack Closure Integral technique is implemented to characterize the fracture mechanics behavior of delaminations in terms of the total energy release rate and mode mix phase angles. Validating analyses, performed on different delaminated configurations, have shown the effectiveness of the proposed approach. Moreover, some original results are presented to investigate the effects of the stacking se…
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
2006
There remains today an open problem whether the rotation distance between binary trees or equivalently the diagonal-flip distance between triangulations can be computed in polynomial time. We present an efficient algorithm for computing lower and upper bounds of this distance between a pair of triangulations.