Results 261 to 270 of about 31,425,090 (332)
Does Doxastic Justification Have a Basing Requirement?
Paul Silva
exaly +2 more sources
Some of the next articles are maybe not open access.
Hermeneutical Injustice as Basing Failure
, 2019This paper defends a novel view of hermeneutical epistemic injustice (HEI). To this effect, it starts by arguing that Miranda Fricker’s account is too restrictive: hermeneutical epistemic injustice is more ubiquitous than her account allows.
M. Simion
semanticscholar +1 more source
The integrative index algorithm based on fact-base and rule-base
2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery, 2010The integrative index algorithm, also known as simultaneous in-one algorithm, which has high value and deserves further research. This article first introduces relevant definitions, and gives specific examples of multi-pattern in-one; then analyzed the calculation process of multi-mode in-one.
Shu-Xi Wang, Zeng-Yan Xia
openaire +1 more source
Theoretical and practical aspects of basing in manufacturing
Russian Engineering Research, 2017B. Bazrov
exaly +2 more sources
Rounding the bases with a secure base
Attachment & Human Development, 2016Parental availability and responsiveness were experimentally manipulated to determine the effects on children's athletic performance. Fifty children (3-12-year-olds) ran as fast as possible around a softball diamond twice: once while parents were available and responsive and once while parents were unavailable and unresponsive (engrossed in mobile ...
openaire +2 more sources
2009
We study expansions in non-integer negative base ? β introduced by Ito and Sadahiro [7]. Using countable automata associated with ( ? β)-expansions, we characterize the case where the ( ? β)-shift is a system of finite type. We prove that, if β is a Pisot number, then the ( ? β)-shift is a sofic system.
Frougny, Christiane, LAI, ANNA CHIARA
openaire +2 more sources
We study expansions in non-integer negative base ? β introduced by Ito and Sadahiro [7]. Using countable automata associated with ( ? β)-expansions, we characterize the case where the ( ? β)-shift is a system of finite type. We prove that, if β is a Pisot number, then the ( ? β)-shift is a sofic system.
Frougny, Christiane, LAI, ANNA CHIARA
openaire +2 more sources
A RBAC-Based Policy Information Base
Sixth IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'05), 2005This paper presents a framework for representing and distributing access control policies in distributed heterogeneous systems. Access control polices follow the RBAC (role based access control) model proposed by the NIST. The framework is based on the provisioning strategy defined by IETF, i.e., the RBAC information is represented in terms of a PIB ...
Timothy E. Squair +2 more
openaire +1 more source
Basing error in coordinate measurements of cylindrical gears
Russian Engineering Research, 2016V. Pechenin, M. Bolotov
exaly +2 more sources
Context-Based Naming in Information Bases
International Journal of Cooperative Information Systems, 1997In information bases following semantic and object-oriented data models, logical names are used for the external identification of objects. Yet the naming schemes employed are not "natural" enough and several problems often arise: logical names can be ambiguous, excessively long, unrelated to or unable to follow the changes of the environment of the ...
Manos Theodorakis, Panos Constantopoulos
openaire +1 more source

