Results 241 to 250 of about 282,015 (284)
Some of the next articles are maybe not open access.
Computing Maximal Covers for Protein Sequences
Journal of Computational Biology, 2023A partial cover of a string or sequence of length n, which we model as an array x=x[1..n], is a repeating substring u of x such that "many" positions in x lie within occurrences of u. A maximal cover u*-introduced in 2018 by Mhaskar and Smyth as optimal cover-is a partial cover that, over all partial covers u, maximizes the positions covered.
G. Brian Golding +3 more
openaire +2 more sources
Maximal covering tree problems
Naval Research Logistics, 1993Summary: \textit{V. A. Hutson} and \textit{C. S. ReVelle} [Transp. Sci. 23, No. 4, 288- 299 (1989; Zbl 0696.90073)] define the maximal direct covering tree problem as a bicriterion problem to identify a subtree of a given tree. The two criteria are to maximize demand covered by the subtree and to minimize the cost of the subtree.
Church, Richard, Current, John
openaire +2 more sources
Some Covering Properties Using Fuzzy Maximal Covers
Tuijin Jishu/Journal of Propulsion Technology, 2023The aim of this article is to define fuzzy maximal open cover and discuss its few properties. we also defined and study fuzzy m-compact space and discussed its properties. Also we obtain few more results on fuzzy minimal c-regular and fuzzy minimal c-normal spaces. We have proved that a fuzzy Haussdorff m-compact space is fuzzy minimal c- normal.
openaire +1 more source
SIAM Journal on Discrete Mathematics, 2005
Summary: We present an efficient procedure for identifying all maximal covers from the set of covers implied by a 0-1 knapsack constraint. It requires tight bounds for the cardinality of certain minimal covers and an ordering of the covers implied by the knapsack constraint. This type of maximal cover can be very useful for tightening 0-1 models.
openaire +1 more source
Summary: We present an efficient procedure for identifying all maximal covers from the set of covers implied by a 0-1 knapsack constraint. It requires tight bounds for the cardinality of certain minimal covers and an ordering of the covers implied by the knapsack constraint. This type of maximal cover can be very useful for tightening 0-1 models.
openaire +1 more source
Planar maximal covering with ellipses
Computers & Industrial Engineering, 2009We consider a maximal covering location problem on the plane, where the objective is to provide maximal coverage of weighted demand points using a set of ellipses at minimum cost. The problem involves selecting k out of m ellipses. The problem occurs naturally in wireless telecommunications networks as coverage from some transmission towers takes an ...
Mustafa S. Canbolat, Michael von Massow
openaire +1 more source
Maximal Direct Covering Tree Problems
Transportation Science, 1989Concepts of coverage are extended to a problem of network design. Maximal covering tree problems are introduced to widen the applicability of the minimal spanning tree (MST), a classic network design problem, which defines the minimal length connection of all nodes in a network.
Vicki Aaronson Hutson +1 more
openaire +1 more source
The Maximal Conditional Covering Problem
INFOR: Information Systems and Operational Research, 1996AbstractThis paper formulates and solves three new problems in the location coverage literature. Two of the formulations are variations of a problem which we term the Maximal Conditional Covering Problem (MCCP I and II), and the third we term the Multiobjective Conditional Covering Problem (MOCCP).
Charles Revelle +2 more
openaire +1 more source
Covering maximal ideals with minimal primes
Algebra universalis, 2015All rings in the paper under review are commutative rings with identity. A ring is a UMP-ring if every maximal ideal in the ring is the union of the minimal prime ideals it contains. Banerjee, Ghosh and Henriksen [\textit{B. Banerjee} et al., Algebra Univers. 62, No.
Dube, Themba, Ighedo, Oghenetega
openaire +1 more source
Dodecagonal tilings as maximal cluster coverings
Ferroelectrics, 2001Abstract It is shown that the Socolar tiling, which is quasiperiodic and 12-fold symmetric, can be characterized as the unique tiling which is maximally covered by a suitably pair of clusters. Analogous results can be obtained also for other dodecagonal tilings, among them the shield tiling.
Gähler, F. +3 more
openaire +2 more sources
1979
In Exercise 4 of Chapter VII one showed that if T is a maximal torus in a matrix group G , then for any x ∈ G , xTx -1 is also a maximal torus. What we prove In this chapter is that if T is our standard maximal torus in one of our connected matrix groups G , then (†) $$G = \mathop \cup \limits_{X \in G} {\text{ }}xT{x^{ - 1}}$$ showing that ...
openaire +1 more source
In Exercise 4 of Chapter VII one showed that if T is a maximal torus in a matrix group G , then for any x ∈ G , xTx -1 is also a maximal torus. What we prove In this chapter is that if T is our standard maximal torus in one of our connected matrix groups G , then (†) $$G = \mathop \cup \limits_{X \in G} {\text{ }}xT{x^{ - 1}}$$ showing that ...
openaire +1 more source