نتایج جستجو برای: mθ d set

تعداد نتایج: 1191431  

2005
Henry C. M. Leung Francis Y. L. Chin

Finding similar patterns (motifs) in a set of sequences is an important problem in Computational Molecular Biology. Pevzner and Sze [18] defined the planted (l,d)-motif problem as trying to find a lengthl pattern that occurs in each input sequence with at most d substitutions. When d is large, this problem is difficult to solve because the input sequences do not contain enough information on th...

2000

Gaussian-3 ground-state total electronic energies have been approximated using single point 6-31G(d) basis set Harteee±Fock self-consistent-®eld (HF-SCF) total energies and partial charges based on our earlier rapid estimation of correlation energy from partial charges method. Sixty-®ve closed-shell neutral molecules (composed of H, C, N, O, and F atoms) of the G2/97 thermochemistry database we...

2004
Atsushi IMIYA

Boundary tracking and surface generation are ones of main topological topics for threedimensional digital image analysis. However, there is no adequate theory to make relations between these different topological properties in a completely discrete way, In this paper, we present a new boundary tracking algorithm which gives not only a set of border points but also the surface structures by usin...

‎ Let $(X,d)$ be a metric space and $Jsubseteq (0,infty)$ be a nonempty set. We study the structure of the arbitrary intersection of vector-valued Lipschitz algebras, and define a special Banach subalgebra of $cap{Lip_gamma (X,E):gammain J}$, where $E$ is a Banach algebra, denoted by $ILip_J (X,E)$. Mainly, we investigate $C-$character amenability of $ILip_J (X,E)$.

2008
Henning Fernau

We are going to analyze simple search tree algorithms for Weighted d-Hitting Set. Although the algorithms are simple, their analysis is technically rather involved. However, this approach allows us to even improve on elsewhere previously published running time estimates for the more restricted case of (unweighted) d-Hitting Set. 1

2005
Mark W. Paris

Accurate numerical solution of the five-body Schrödinger equation is effected via variational Monte Carlo in a correlated quark model. The spectrum is assumed to exhibit a narrow resonance with strangeness S = +1. A fully antisymmetrized and pair-correlated five-quark wave function is obtained for the assumed non-relativistic Hamiltonian which has spin, isospin, and color dependent pair interac...

Journal: :فیزیک زمین و فضا 0
شادی طباطبایی میر اریک برگمن محمدرضا قیطانچی

studying crustal and upper mantel structures has been limited in the iranian plateau and there has been little work done in this field. in this paper we have a primary motive to map pn and sn velocities beneath most of the iranian plateau in order to test 3-d mantle models and to develop and test a method to produce pn and sn travel time correction surfaces that are the 3-d analogue of travel t...

Journal: :communication in combinatorics and optimization 0
nasrin dehgardi sirjan university of technology, sirjan 78137, iran lutz volkmann lehrstuhl ii fur mathematik, rwth aachen university, 52056 aachen, germany

let $d$ be a finite and simple digraph with vertex set $v(d)$‎.‎a signed total roman $k$-dominating function (str$k$df) on‎‎$d$ is a function $f:v(d)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin n^{-}(v)}f(x)ge k$ for each‎‎$vin v(d)$‎, ‎where $n^{-}(v)$ consists of all vertices of $d$ from‎‎which arcs go into $v$‎, ‎and (ii) every vertex $u$ for which‎‎$f(u)=-1$ has a...

2001
Matthias Schwab Jon F. Claerbout

Seismic 3-D field data is often recorded as a set of relatively sparse and often irregular 2-D lines. Under the assumption that the data consists of the superposition of local plane waves, such data can be interpolated by prediction-error techniques using a set of two 2-D filters instead of the conventional single 3-D filter. The two 2-D prediction-error filters are found by two independent lin...

2000
ARRIGO BONISOLI bonisoli

All known finite sharply 4-transitive permutation sets containing the identity are groups, namely S4, S5, A6 and the Mathieu group of degree 11. We prove that a sharply 4-transitive permutation set on 11 elements containing the identity must necessarily be the Mathieu group of degree 11. The proof uses direct counting arguments. It is based on a combinatorial property of the involutions in the ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید