نتایج جستجو برای: closures
تعداد نتایج: 4617 فیلتر نتایج به سال:
In response to the inherent dynamic nature of the oceans and continuing difficulty in managing ecosystem impacts of fisheries, interest in the concept of dynamic ocean management, or real-time management of ocean resources, has accelerated in the last several years. However, scientists have yet to quantitatively assess the efficiency of dynamic management over static management. Of particular i...
In this paper, we propose an approach to find transitive closures on large data sets in distributed (i.e., parallel) environment. Finding transitive closures of data records is a preprocessing step of a two-step approach to data quality control, such as data accuracy, redundancy, consistency, currency and completeness. The objective of finding transitive closures is to reduce the number of reco...
In a previous paper Sharkey et al. (Bull Math Biol doi: 10.1007/s11538-013-9923-5 , 2012) proved the exactness of closures at the level of triples for Markovian [Formula: see text] (susceptible-infected-removed) dynamics on tree-like networks. This resulted in a deterministic representation of the epidemic dynamics on the network that can be numerically evaluated. In this paper, we extend this ...
Given P ⊂ R, a mixed integer set P I = P ∩ (Z × Rn−t), and a k-tuple of n-dimensional integral vectors (π1, . . . , πk) where the last n− t entries of each vector is zero, we consider the relaxation of P I obtained by taking the convex hull of points x in P for which π 1 x, . . . , π T k x are integral. We then define the k-dimensional lattice closure of P I to be the intersection of all such r...
The writers are congratulated for developing analytical approximations to Einstein integrals herein INT1 and INT2 . It was stated by the writers in their technical note that these algorithms can be incorporated into professional hydraulic software, and the discussers agree on this. However, it is pointed out here that the calculation of INT1 and INT2 can be easily incorporated more directly by ...
The writer presents a parametric study devoted to investigate the behavior of nonprismatic members having T-sections by using three-dimensional ~3D! finite-element models ~FEMs!. Fixed-end moments and stiffness coefficients were computed from the 3DFEMs considering thrust effects. As a result of the parametric study, the writer proposed a practical modeling technique based on two-noded beam ele...
Closure theorems in hamiltonian graph theory are of the following type: Let G be a 2connected graph and let II, u be two distinct nonadjacent vertices of G. If condition c(u, u) holds, then G is hamiltonian if and only if G + MU is hamiltonian. We discuss several results of this type in which u and v are vertices of a subgraph H of G on four vertices and c(u, u) is a condition on the neighborho...
Adámek, Herrlich, and Reiterman showed that a cocomplete category A is cocomplete if there exists a small (full) subcategory B such that every A-object is a colimit of B-objects. The authors of the present paper strengthened the result to totality in the sense of Street and Walters. Here we weaken the hypothesis, assuming only that the colimit closure is attained by transfinite iteration of the...
The only proof of this I know is kind of fiddly and not enlightening. But the point is that in most categories that appear ‘in nature,’ regular, strong, and extremal epics are about the same, and all are the correct notion of quotient, while ordinary epimorphisms may not be. For example, N→ Q is epic in Rings, but not extremal epic. In Top the epics are the surjective maps, while the regular = ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید