نتایج جستجو برای: resolvability

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

Journal: :Inf. Res. 2007
Nishikant Kapoor John T. Butler Gary C. Fouty James A. Stemper Joseph A. Konstan

Introduction. Digital library users collect, enhance and manage their online reference collections to facilitate their research tasks. These personal collections, therefore, are likely to reflect users' interests, and are representative of their profile. Understanding these collections offers great opportunities for developing personalized digital library services, such as reference recommender...

Journal: :IEEE Trans. Robotics and Automation 1996
Bradley J. Nelson Pradeep K. Khosla

Force and vision sensors provide complementary information, yet they are fundamentally different sensing modalities. This implies that traditional sensor integration techniques that require common data representations are not appropriate for combining the feedback from these two disparate sensor. In this paper, we introduce the concept of vision and force sensor resolvability as a means of comp...

Journal: :CoRR 2013
Yasutada Oohama

Abstract—In this paper we consider the identification (ID) via multiple access channels (MACs). In the general MAC the ID capacity region includes the ordinary transmission (TR) capacity region. In this paper we discuss the converse coding theorem. We estimate two types of error probabilities of identification for rates outside capacity region, deriving some function which serves as a lower bou...

2006
Martha L. Gray

Listeners with sensorineural hearing loss are often impaired in their ability to perceive the pitch associated with the fundamental frequency (FO) of complex harmonic sounds. Four studies investigated the relationship between FO discrimination performance and the ability to resolve individual harmonic frequencies of a complex, testing the hypotheses (1) that the accurate FO discrimination perfo...

Journal: :Australasian J. Combinatorics 2003
Varaporn Saenpholphat Ping Zhang

For an ordered set W = {w1, w2, · · · , wk} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the k-vector r(v|W ) = (d(v, w1), d(v, w2), · · · , d(v, wk)), where d(x, y) represents the distance between the vertices x and y. The set W is a connected resolving set for G if distinct vertices of G have distinct representations with respect to W and the...

2007
Nishikant Kapoor John T. Butler Sean M. McNee Gary C. Fouty James A. Stemper Joseph A. Konstan

Users’ personal citation collections reflect users’ interests and thus offer great potential for personalized digital services. We studied 18,120 citations in the personal collections of 96 users of RefWorks citation management system to understand these in terms of their resolvability i.e. how well these citations can be resolved to a unique identifier and to their online sources. While fewer ...

Journal: :IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans 2008

Journal: :Journal of Mathematics 2022

Nowadays, the study of source localization in complex networks is a critical issue. Localization has been investigated using variety feasible models. To identify network’s diffusion, it necessary to find vertex from which observed diffusion spreads. Detecting virus network equivalent finding minimal doubly resolving set (MDRS) network. This paper calculates sets (DRSs) for certain convex polyto...

Journal: :Symmetry 2023

The generalized Petersen graphs are a type of cubic graph formed by connecting the vertices regular polygon to corresponding star polygon. This has many interesting properties. As result, it been widely researched. In this work, edge metric dimensions GP(2l + 1, l) and GP(2l, explored, is shown that dimension equal its dimension. Furthermore, proved upper bound same as value for l).

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

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