Search 250 million research papers

Guides: DOI resolver: DOI resolver

Usc Library · 2012

Cited by 0

Resolver

Gredos (University of Salamanca) · 2011

Cited by 0

Resolver

Bulletin of Miscellaneous Information (Royal Gardens Kew)

Cited by 0

Resolver

Dom Blanco · Mānoa/Mānoa · 2025

Cited by 0

resolver

Martin H. Weik · 2000

Cited by 0

resolver

SpringerReference · 2011

Cited by 0

Koordinatenwandler (Resolver)

Wolfgang K. Giloi, Rudolf Lauber · 1963

Cited by 0

Resolver problemas

Avante. · 2008

Cited by 0

Name Resolver

Chris Bizon, Gaurav Vaidya, Patrick Wang et al. · Open MIND · 2026

Name Resolver (Name Lookup or NameRes) takes lexical strings and attempts to map them to identifiers (CURIEs) from a vocabulary or ontology.

Cited by 0Open access

resolver, n.

Oxford University Press eBooks · 2023

Cited by 0

Resolver conflictos

Merino, Manel · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2003

Cited by 0Open access

Name Resolver

Gaurav Vaidya, cbizon, Patrick Wang et al. · Zenodo (CERN European Organization for Nuclear Research) · 2026

Name Resolver (Name Lookup or NameRes) takes lexical strings and attempts to map them to identifiers (CURIEs) from a vocabulary or ontology.

Cited by 0Open access

Name Resolver

Chris Bizon, Gaurav Vaidya, Patrick K. Wang et al. · Zenodo (CERN European Organization for Nuclear Research) · 2026

Name Resolver (Name Lookup or NameRes) takes lexical strings and attempts to map them to identifiers (CURIEs) from a vocabulary or ontology.

Cited by 0Open access

Name Resolver

Chris Bizon, Gaurav Vaidya, Patrick Wang et al. · Open MIND · 2026

Name Resolver (Name Lookup or NameRes) takes lexical strings and attempts to map them to identifiers (CURIEs) from a vocabulary or ontology.

Cited by 0Open access

HyperDID resolver

Marc Grau De La Mano · QRU Quaderns de Recerca en Urbanisme · 2025

This thesis presents the design and implementation of HyperDID, a decentralized identity layer that introduces did:hyper:<id> as an abstraction layer over existing DID methods. By decoupling the identifier from the underlying resolution mechanism, HyperDID empowers users to associate human-readable names with any compatible DID (e.g., did:ethr, did:web) and to change or migrate their resolution strategy over time. A smart contract enables decentralized registration and ownership of identifiers, which point to signed external documents following a custom schema. These documents support versioning, tag-based aliasing, and cryptographic integrity via EIP-712 signatures. A TypeScript library supports document validation, resolution, and interaction with both HyperDID and native DID methods. The proposed approach enhances flexibility and user autonomy, while remaining standards-compliant and interoperable.

Cited by 0Open access

Class Resolver

Charles Tapley Hoyt · Zenodo (CERN European Organization for Nuclear Research) · 2025

What's Changed Remove ray by @cthoyt in https://github.com/cthoyt/class-resolver/pull/77 Update cruft by @cthoyt in https://github.com/cthoyt/class-resolver/pull/78 Improve type checking (Part 3) by @cthoyt in https://github.com/cthoyt/class-resolver/pull/79 Add strict type checking by @cthoyt in https://github.com/cthoyt/class-resolver/pull/75 Full Changelog: https://github.com/cthoyt/class-resolver/compare/v0.5.5...v0.6.0

Cited by 0Open access

Linearized Resolver

Ramin Alipour-Sarabi, Zahra Nasiri‐Gheidari, Farid Tootoonchian et al. · 2018

Resolvers are used in position estimation systems. These electromagnetic sensors, take the benefits of electrical machines. In comparison with encoders, they are robust and more reliable. However, their accuracy is questioned when one of the output voltages is in the peak position. In these situation the other signal is about zero. Therefore, the rate of signal to noise is too low and more susceptible to be affected from environmental disturbances. To overcome this inefficiency, a new winding scheme is suggested in this paper. The proposed winding arrangement that is carried out on a disk type variable reluctance resolver has its own merits: compact size, fault tolerate capability, high accuracy and easy to manufacture. Finite element analysis verify the analytical expressions. Finally, a prototype of proposed resolver is fabricated. Both the finite element analysis and experimental results confirms the excellence of new winding configuration over the custom one.

Cited by 4

RESOLVER EQUAÇÕES

Portal do Conhecimento (Government of Cabo Verde) · 2012

É vasto o conjunto de equações que podem apresentar-se no domínio da\nMatemática, bem como na vida corrente, em que aquela e os seus resultados têm de\naplicar-se para resolver problemas concretos ligados a domínios muito variados, e tanto\nnos de âmbito mais técnico, como nos ligados às designadas Ciências Sociais, passando,\nlá pelo meio, pela Economia e pela Gestão.

Cited by 0

DNS Resolver Testing

Široký, Filip · Brno University of Technology Digital Library (Brno University of Technology) · 2018

Tento dokument popisuje automatizaci tvorby scénářů pro nástroj Deckard, který slouží na testování rekurzivních resolverů. Tyto scénáře jsou založeny na skutečném provozu mezi prohlížečem a webovou stránkou zachyceném při načítání této stránky. Výsledný scénář je doplněn i o dotazy, které v zachyceném provoz nebyly, ale na které by se resolver mohl ptát například při minimalizaci dotazu. Na rozdíl od živého provozu by použití scénářů mělo zajistit deterministické prostředí pro testování. Reálný provoz není pro testování ideální kvůli například rotaci IP adres, rozdílnému obsahu serverů a úpravy obsahu. Scénář by měl obsahovat všechny odpovědi na dotazy, na které by se resolver mohl zeptat. S vygenerovanými scénáři můžeme porovnávat odpovědi různých implementací a verzí DNS resolveru. Můžeme tak odhalit změny v jejich chování.

Cited by 0

Link Resolver Testing

Karen Harker · University of North Texas Digital Library (University of North Texas) · 2012

This excel file accompanies a workshop presentation titled 'Is it really that bad? Verifying the extent of full-text linking problems'.

Cited by 0