نتایج جستجو برای: identifying code

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

2008
Geoffrey Exoo Ville Junnila Tero Laihonen Sanna Ranto

A nonempty set of words in a binary Hamming space F is called an r-identifying code if for every word the set of codewords within distance r from it is unique and nonempty. The smallest possible cardinality of an r-identifying code is denoted by Mr(n). In this paper, we consider questions closely related to the open problem whether Mt+r(n + m) ≤ Mt(m)Mr(n) is true. For example, we show results ...

2017
Petros Manousis Apostolos V. Zarras Panos Vassiliadis George Papastefanatos

Correctly identifying the embedded queries within the source code of an information system is a significant aid to developers and administrators, as it can facilitate the visualization of a map of the information system, the identification of areas affected by schema evolution, code migration, and the planning of the joint maintenance of code and data. In this paper, we provide a solution to th...

2011
Irène Charon Olivier Hudry Antoine Lobstein

Let G be a simple, undirected graph with vertex set V . For v ∈ V and r ≥ 1, we denote by BG,r(v) the ball of radius r and centre v. A set C ⊆ V is said to be an r-identifying code in G if the sets BG,r(v) ∩ C, v ∈ V , are all nonempty and distinct. A graph G admitting an ridentifying code is called r-twin-free, and in this case the size of a smallest r-identifying code in G is denoted by γr(G)...

Journal: :Discrete Applied Mathematics 2012
Florent Foucaud Ralf Klasing Adrian Kosowski André Raspaud

In an undirected graph G = (V,E), a subset C ⊆ V such that C is a dominating set of G, and each vertex in V is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky et al. in 1998. Because of the variety of its applications, for example for fault-detection in networks or the location of fires in facili...

2005
Alberto Leva Luigi Piroddi

This paper presents a methodology for identifying variable-structure models of magneto-rheological dampers (MRDs) that are structurally simple, easy to estimate and well suited for model-based control. Linear-in-the-parameters NARX models are adopted, and an identification method is developed based on the minimisation of the simulation error. Both the model structure and the parameters are sele...

2014
Rolf S. Kaas Pimlapas Leekitcharoenphon Frank M. Aarestrup Ole Lund

Whole genome sequencing (WGS) shows great potential for real-time monitoring and identification of infectious disease outbreaks. However, rapid and reliable comparison of data generated in multiple laboratories and using multiple technologies is essential. So far studies have focused on using one technology because each technology has a systematic bias making integration of data generated from ...

Journal: :IOP Conference Series: Earth and Environmental Science 2021

Journal: :ACM Transactions on Applied Perception 2023

Eye tracking studies have shown that reading code, in contradistinction to text, includes many vertical jumps. As different lines of code may quite functions (e.g., variable definition, flow control, or computation), it is important accurately identify the being read. We design experiments require a specific line text be scrutinized. Using distribution gazes around this line, we then calculate ...

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

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