نتایج جستجو برای: 2 locating set

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

‎Let $f$ be a proper $k$-coloring of a connected graph $G$ and‎ ‎$Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into‎ ‎the resulting color classes‎. ‎For a vertex $v$ of $G$‎, ‎the color‎ ‎code of $v$ with respect to $Pi$ is defined to be the ordered‎ ‎$k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$‎, ‎where $d(v,V_i)=min{d(v,x):~xin V_i}‎, ‎1leq ileq k$‎. ‎If‎ ‎distinct...

Journal: :Designs, Codes and Cryptography 2021

In this article, we study locating-dominating codes in binary Hamming spaces $$\mathbb {F}^n$$ . Locating-dominating have been widely studied since their introduction 1980s by Slater and Rall. They are dominating sets suitable for distinguishing vertices graphs. Dominating as well multiple articles. Previously, Honkala et al. (Discret Math Theor Comput Sci 6(2):265, 2004) presented a lower boun...

2002
Jing Xiao Jimin Liu Tat-Seng Chua

Pronunciation-translated names (P-Names) bring more ambiguities to Chinese word segmentation and generic named entity recognition. As there are few annotated resources that can be used to develop a good P-Name extraction system, this paper presents a bootstrapping algorithm, called PN-Finder, to tackle this problem. Starting from a small set of P-Name characters and context cue-words, the algor...

1994
Lawrence A. Rowe John S. Boreczky Charles A. Eads

Video-on-Demand systems have received a good deal of attention recently. Few studies, however, have addressed the problem of locating a video of interest in a large video database. This paper describes the design and implementation of a metadata database and query interface that attempts to solve this information retrieval problem. Sample queries were collected by interviewing a variety of user...

Journal: :Discrete Applied Mathematics 2011
Ali Behtoei Behnaz Omoomi

Let c be a proper k-coloring of a connected graph G andΠ = (C1, C2, . . . , Ck) be an ordered partition of V (G) into the resulting color classes. For a vertex v of G, the color code of v with respect to Π is defined to be the ordered k-tuple c Π (v) := (d(v, C1), d(v, C2), . . . , d(v, Ck)), where d(v, Ci) = min{d(v, x)|x ∈ Ci}, 1 ≤ i ≤ k. If distinct vertices have distinct color codes, then c...

Journal: :Environmental Health Perspectives 2002
WC Holton

CA Corresponding Author Tel: (+55)11 3726 7222, ext. 2165 Fax: (+55)11 3726 1505 E-mail: [email protected] BACKGROUND: We have previously shown that the calcium-binding protein MRP-14 secreted by neutrophils mediates the antinociceptive response in an acute inflammatory model induced by the intraperitoneal injection of glycogen in mice. Aim: In an attempt to broaden the concept that neutrophil...

Developing the infrastructures for preventing non-communicable diseases is one of the most important goals of healthcare context in recent years. In this regard, the number and capacity of preventive healthcare facilities as well as assignment of customers to facilities should be determined for each region. Besides the accessibility, the utility of customers is a determinative factor in partici...

A. Alem Tabriz A. Ayooq, A. Javani

In this paper, a new mathematical model for the problem of job scheduling in virtual manufacturing cells (VMC) is presented to minimizing the completion time of all jobs. Sequence dependent setup times of machines is considered and lot-streaming is possible. In Virtual manufacturing cells, each job has a different processing path and there is a set of machines for processing each operation. The...

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

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