Relevant bibliographies by topics / Locality of the error

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Locality of the error'

Author: Grafiati
Published: 4 June 2021
Last updated: 16 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Locality of the error.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Locality of the error"

1

SHEA, GLENN M., and JODI J. L. ROWLEY. "Resolution of the types and type localities of some early nominal species of the Australian myobatrachid frog genus Pseudophryne Fitzinger, 1843." Zootaxa 4407, no. 1 (2018): 51. http://dx.doi.org/10.11646/zootaxa.4407.1.3.

Full text
Abstract:
The types and type localities of Bombinator australis Gray, 1835, Pseudophryne bibronii Günther, 1859, and Phryniscus albifrons Duméril, Bibron & Duméril, 1854, are defined. The nominal type locality for B. australis, Swan River, is considered to be in error. The source of the specimen, Joseph Wright, owned property in the Swan River colony in Western Australia, but later resided in Sydney, the latter locality within the known range of the species. We designate a specimen in the Museum National d’Histoire Naturelle, Paris as lectotype of Pseudophryne bibronii, restricting the type locality of both species to Parramatta, near Sydney, based on the published statements of the collector, François Péron. The holotype of Phryniscus albifrons, a species defined by a painting of a specimen, was likely to have been collected by Jules Verreaux, but the only extant Pseudophryne obtained from Verreaux does not match the type illustration. Verreaux is renowned for the numerous errors in the localities associated with his specimens, and the locality for this specimen, Moreton Bay, Queensland, is likely to be another such error. Resolution of these issues facilitates ongoing taxonomic work on the genus using genetic and morphological data.
APA, Harvard, Vancouver, ISO, and other styles
2

Meyer, Harvey B. "Locality and Statistical Error Reduction on Correlation Functions." Journal of High Energy Physics 2003, no. 01 (2003): 048. http://dx.doi.org/10.1088/1126-6708/2003/01/048.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wei, Wei, Lu Zhang, and Nan Hua. "Error management in service security breaches." Journal of Services Marketing 33, no. 7 (2019): 783–97. http://dx.doi.org/10.1108/jsm-04-2018-0114.

Full text
Abstract:
Purpose Error management has begun to receive growing attention from both academic scholars and industry practitioners in marketing. However, the impacts of error management on consumers remain understudied. Taking data breach as an increasingly recognized error in the modern service industry, this paper aims to explore the impact of hotels’ error management on consumer attitudes and downstream behavioral intentions. This research also investigates whether such impacts can be moderated by data breach locality. Furthermore, this research examines the underlying mechanism through which a firm’s error management influences consumers’ attitudes and behaviors. Design/methodology/approach A total of 280 people were recruited to participate in a scenario-based experimental study and complete an online survey. Findings Results revealed that the impacts of a focal firm’s error management on consumer attitude, word-of-mouth, and revisit intention were only significant when the data breach occurred at the focal firm (versus the rival firm), which was mediated by consumer trust. However, this mediating effect of consumer trust was not found when the focal firm reacted to a data breach that occurred at a rival firm. Originality/value This research represents one of the first studies to introduce the concept of consumer trust to understand the impact of error management on consumers following a data breach. By further including data breach locality as a potential moderator, this research provides suggestions on how firms should strategize their marketing efforts for more effective results.
APA, Harvard, Vancouver, ISO, and other styles
4

Lee, Justin, Aryeh H. Miller, Grant M. Connette, Khin Swe Oo, George R. Zug, and Daniel G. Mulcahy. "Corrigendum: First record of the Malaysian Bridle Snake, Dryocalamus subannulatus (Duméril, Bibron & Duméril, 1854), in Myanmar (Reptilia, Serpentes, Colubridae)." Check List 16, no. 5 (2020): 1393. http://dx.doi.org/10.15560/16.5.1393.

Full text
Abstract:
Upon final cataloguing and proofing of the entire collection from the expedition reported in this paper, we noticed an error in the exact locality. The correct locality for USNM 581990 should be: Thayawthadangyi Island group; Daung (Don) Island; N side cove (12º 17’ 10” N, 98º 06’ 05” E, WGS84), Tanintharyi Region, Myanmar.
APA, Harvard, Vancouver, ISO, and other styles
5

Lüscher, Martin, and Peter Weisz. "Locality and exponential error reduction in numerical lattice gauge theory." Journal of High Energy Physics 2001, no. 09 (2001): 010. http://dx.doi.org/10.1088/1126-6708/2001/09/010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Benuwa, Ben-Bright, and Benjamin Ghansah. "Locality-Sensitive Non-Linear Kalman Filter for Target Tracking." International Journal of Distributed Artificial Intelligence 13, no. 1 (2021): 36–57. http://dx.doi.org/10.4018/ijdai.2021010102.

Full text
Abstract:
Target tracking (TT) with non-linear kalman filtering (NLKF) has recently become a very popular research area, particularly in the field of marine engineering and air traffic control. Contemporary NLKF algorithms have been very effective, in particular, with extensions and merging with a reduced root mean square error (RMSE) value. However, there are a number of issues that confront NLKF approaches, notably weakness in robustness, convergence speed, and tracking accuracy due to large initial error and weak observability. Furthermore, NLKF algorithms significantly results in error for high non-linear systems (NLS) because of the propagation of uncertainty. Again, there is a problem of estimating future states as a result of white noise. To handle these issues, the authors propose a novel non-linear filtering algorithm, called locality-sensitive NLKF (LSNLKF) that incorporates locality-sensitive adaptors into the structure of an integrated NLKF. They are the extended kalman filter (EKF) and the unscented kalman filter (UKF) for TT.
APA, Harvard, Vancouver, ISO, and other styles
7

OSCHADLEUS, H. DIETER. "Type locality of the Baya Weaver Ploceus philippinus (Passeriformes, Ploceidae)." Zootaxa 4524, no. 3 (2018): 395. http://dx.doi.org/10.11646/zootaxa.4524.3.7.

Full text
Abstract:
The Baya Weaver Ploceus philippinus (Linnaeus, 1766) was one of the first weaverbirds to be described, and although Linnaeus (1766) provided its specific epithet and the type locality of the Philippines, the Baya Weaver does not occur there. Hartert (1902, p. 577) thus restricted the locality to Ceylon (now Sri Lanka), and this locality has been used in all major references since, in spite of Stresemann (1952) showing that the type was most probably collected by Pierre Poivre in India. This paper draws attention to this error so that avian handbooks and taxonomic works may refer to the correct type locality of the Baya Weaver as Puducherry (previously Pondicherry), Puducherry district, India.
APA, Harvard, Vancouver, ISO, and other styles
8

Chen, Zijun, Kevin J. Satzinger, Juan Atalaya, et al. "Exponential suppression of bit or phase errors with cyclic error correction." Nature 595, no. 7867 (2021): 383–87. http://dx.doi.org/10.1038/s41586-021-03588-y.

Full text
Abstract:
AbstractRealizing the potential of quantum computing requires sufficiently low logical error rates1. Many applications call for error rates as low as 10−15 (refs. 2–9), but state-of-the-art quantum platforms typically have physical error rates near 10−3 (refs. 10–14). Quantum error correction15–17 promises to bridge this divide by distributing quantum logical information across many physical qubits in such a way that errors can be detected and corrected. Errors on the encoded logical qubit state can be exponentially suppressed as the number of physical qubits grows, provided that the physical error rates are below a certain threshold and stable over the course of a computation. Here we implement one-dimensional repetition codes embedded in a two-dimensional grid of superconducting qubits that demonstrate exponential suppression of bit-flip or phase-flip errors, reducing logical error per round more than 100-fold when increasing the number of qubits from 5 to 21. Crucially, this error suppression is stable over 50 rounds of error correction. We also introduce a method for analysing error correlations with high precision, allowing us to characterize error locality while performing quantum error correction. Finally, we perform error detection with a small logical qubit using the 2D surface code on the same device18,19 and show that the results from both one- and two-dimensional codes agree with numerical simulations that use a simple depolarizing error model. These experimental demonstrations provide a foundation for building a scalable fault-tolerant quantum computer with superconducting qubits.
APA, Harvard, Vancouver, ISO, and other styles
9

Kim, Jin‐Bum, and Rae‐Hong Park. "Unsupervised binary hashing method using locality preservation and quantisation error minimisation." Electronics Letters 51, no. 3 (2015): 255–57. http://dx.doi.org/10.1049/el.2014.3980.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Liu, Ren-Shuo, Meng-Yen Chuang, Chia-Lin Yang, Cheng-Hsuan Li, Kin-Chu Ho, and Hsiang-Pang Li. "Improving Read Performance of NAND Flash SSDs by Exploiting Error Locality." IEEE Transactions on Computers 65, no. 4 (2016): 1090–102. http://dx.doi.org/10.1109/tc.2014.2345387.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Locality of the error"

1

Lavauzelle, Julien. "Codes with locality : constructions and applications to cryptographic protocols." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLX082/document.

Full text
Abstract:
Les codes localement corrigibles ont été introduits dans le but d'extraire une partie de l'information contenue dans un mot de code bruité, en effectuant un nombre limité de requêtes à ses symboles, ce nombre étant appelé la localité du code. Ces dernières années ont vu la construction de trois familles de tels codes, dont la localité est sous-linéaire en la taille du message, et le rendement est arbitrairement grand. Ce régime de paramètres est particulièrement intéressant pour des considérations pratiques.Dans cette thèse, nous donnons une rapide revue de littérature des codes localement corrigibles, avant d'en proposer un modèle combinatoire générique, à base de block designs. Nous définissons et étudions ensuite un analogue, dans le cas projectif, des relèvements affine de codes introduits par Guo, Kopparty et Sudan. Nous établissons par ailleurs plusieurs liens entre ces deux familles, pour finir par une analyse précise de la structure monomiale de ces codes dans le cas du relèvement plan.Une deuxième partie de la thèse se focalise sur l'application de ces codes à deux protocoles cryptographiques. D'abord, nous proposons un protocole de récupération confidentielle d'information (private information retrieval, PIR) à partir de codes basés sur des designs transversaux, dont la taille des blocs s'apparente à la localité d'un code localement corrigible. Les protocoles ainsi construits ont l'avantage de n'exiger aucun calcul pour les serveurs, et de présenter une faible redondance de stockage ainsi qu'une complexité de communication modérée. Ensuite, nous donnons une construction générique de preuve de récupérabilité (proof of retrievability, PoR) à base de codes admettant une riche structure d'équations de parité à petit poids. Nous en donnons finalement une analyse de sécurité fine ainsi que plusieurs instanciations fondées sur des codes à propriétés locales<br>Locally correctable codes (LCCs) were introduced in order to retrieve pieces of information from a noisy codeword, by using a limited number of queries to its symbols, this number being called the locality. Three main families of LCCs reaching sublinear locality and arbitrarily high rate have been built so far. This specific range of parameters is of particular interest concerning practical applications of LCCs.In this thesis, after giving a state of the art for LCCs, we study how they can be built using block designs. We then give an analogue over projective spaces of the family of affine lifted codes introduced by Guo, Kopparty and Sudan. We exhibit several links between both families, and we give a precise analysis of the monomial structure of the code in the case of the lifting of order 2.The second part of the thesis focuses on the application of these codes to two cryptographic protocols. We first build a new private informatin retrieval (PIR) protocol from codes based on transversal designs, whose block size defines the locality of the code. Our construction features no computation on the server side, low storage overhead and moderate communication complexity. Then, we propose a new generic construction of proof-of-retrievability (PoR) that uses codes equipped with an elaborate structure of low-weight parity-check equations. We give a rigorous analysis of the security of our scheme, and we finally propose practical instantiations based on codes with locality
APA, Harvard, Vancouver, ISO, and other styles
2

Cerecke, Carl. "Locally least-cost error repair in LR parsers." Thesis, University of Canterbury. Computer Science, 2003. http://hdl.handle.net/10092/5492.

Full text
Abstract:
This thesis presents some methods for improving the efficiency and effectiveness of locally least-cost error repair algorithms for an LR-based parser. Three different algorithms for reducing the search space are described and compared using a collection of 59,643 incorrect Java programs collected from novice programmers. Two of the algorithms prove particularly effective at reducing the search space. Also presented is a more efficient priority queue implementation for storing transformations of the input string. The effect on repairs of different grammars describing the same language is investigated, and a comparison of different methods of assigning costs to edit operations is performed.
APA, Harvard, Vancouver, ISO, and other styles
3

Liu, Yuan. "Mixed anova model analysis of microarray experiments with locally polled error /." Electronic version (PDF), 2004. http://dl.uncw.edu/etd/2004/liuy/yuanliu.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Shafieipour, Mohammad. "Efficient Error-Controllable High-Order Electromagnetic Modelling of Scattering on Electrically Large Targets with the Locally Corrected Nyström Method." IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2014. http://hdl.handle.net/1993/31181.

Full text
Abstract:
This dissertation is about efficient computation of the electromagnetic fields with the locally corrected Nyström (LCN) method as a point-based boundary element method (BEM). The concept of surface integral equations is discussed and the electric field integral equation (EFIE) is derived from the Maxwell’s equations. Due to its point-based nature, the LCN discretization of the EFIE has some advantages over discretizing the EFIE by the method-of-moments (MoM) which is an element-based BEM. On the other hand, due to maturity of the MoM, a large body of work is available to resolve the numerical issues arising in MoM while there has been less work related to the relatively new LCN. To combine the benefits of the LCN method and the classical Rao-Wilton-Glisson MoM, equivalence between these BEMs are established and their exact relationships are derived. Both the vector-potential EFIE and the mixed-potential EFIE are covered. Various aspects of achieving HO convergence to the correct answer using high-order (HO) LCN method are discussed. In particular, the patch size limitation, predicting the optimal degrees of freedom, and the effect of dynamic range in the solution are discussed both analytically and numerically to provide concrete motivations towards HO LCN. The benefits of an HO BEM can not be realized unless an HO geometry representation is used in conjunction with the BEM. Non-uniform rational b-spline (NURBS) surfaces are the most widely adopted HO geometry modelling technique in various disciplines due to their many advantages. However, a typical mesh created out of NURBS surfaces contain both triangular and quadrilateral elements while formulating LCN based on Gaussian quadrature rules on triangular elements have limitations. As a result, the LCN community has mostly adopted LCN based on curvilinear quadrilateral modelling of the geometry. A new class of Newton-Cotes quadrature rules for triangles is proposed to facilitate incorporating NURBS surfaces into the HO LCN.<br>May 2016
APA, Harvard, Vancouver, ISO, and other styles
5

Basilico, David Anthony. "Quantification and locality." Diss., The University of Arizona, 1993. http://hdl.handle.net/10150/186305.

Full text
Abstract:
This dissertation develops a transformational theory of scope which is based not on the position to which an entire quantificational noun phrase (QNP) can move and adjoin but on the position and to which a quantificational determiner can move and adjoin. Following Heim (1982), a tripartite representation for sentences containing QNPs is adopted in which quantificational determiners move out of their containing noun phrases and adjoin to the sentence node at the level of Logical Form (LF). By utilizing this type of representation, asymmetries between the movement possibilities of a phrase and scope possibilities of a phrase can be captured. This dissertation argues that movement of an operator is free but constrained by the operator acquiring the selection index of the phrase which it binds. The selection index is percolated up the tree in a series of local relationships (government, specifier/head and X-Bar). This index percolation is dependent on the ability of a syntactic head to acquire an index. The necessity of this index percolation approach is demonstrated in the first chapter, which investigates the phenomenon of unselective binding between an adverbial operator and indefinite in restrictive 'if/when' clauses. It shows that this relationship is sensitive to some syntactic islands but not others. It demonstrates that the index percolation approach is the best way to capture the selective island sensitivities of this phenomenon. Additional motivation for this account is given in chapter two, which deals with internally headed relative clauses (IHRCs). Several parallels between IHRCs and restrictive 'if/when' clauses are noted. It shows that the binding of the internal head by the determiner associated with the IHRC is similar to the binding of an indefinite by an adverbial operator. The next two chapters treat the phenomenon of partial Wh-movement. These chapters further show the application of the index percolation account because they argue that the relationships noted above between an adverbial operator and indefinite and operator and internal head are analogous to the relationship between a partially moved WH-Phrase and the sentence initial scope marker. In chapter six, the scope of quantified possessive phrases in English is examined. This is a case where movement of a phrase and scope of a phrase sharply differ. The approach where the determiner of the possessive is moved alone, with index percolation from the phrase in the specifier position to the moved determiner, is shown to best handle these cases.
APA, Harvard, Vancouver, ISO, and other styles
6

Razenshteyn, Ilya. "Beyond locality-sensitive hashing." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/89862.

Full text
Abstract:
Thesis: S.M. in Computer Science and Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>32<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 43-45).<br>We present a new data structure for the c-approximate near neighbor problem (ANN) in the Euclidean space ... This is the first improvement over the result by Andoni and Indyk (FOCS 2006) and the first data structure that bypasses a locality-sensitive hashing lower bound proved by O'Donnell, Wu and Zhou (ICS 2011). By known reductions we obtain a data structure for the Hamming space and ... which is the first improvement over the result of Indyk and Motwani (STOC 1998).<br>by Ilya Razenshteyn.<br>S.M. in Computer Science and Engineering
APA, Harvard, Vancouver, ISO, and other styles
7

McGinnis, Martha. "Locality in A-movement." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/9650.

Full text
Abstract:
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1998.<br>Includes bibliographical references (leaves [219]-229).<br>In this dissertation, I demonstrate that the feature-based Attract theory of syntactic movement solves several empirical challenges for Relativized Minimality, while incorporating its key insights. Chapter 1 introduces the theory of phrase structure, syntactic movement, and abstract Case to be adopted throughout the dissertation. This chapter also lays out a cross-linguistic typology of possibilities for A-movement to the subject position. Chapter 2 concerns cases of advancing,where the argument generated highest is attracted by the feature (EPP) driving movement to the subject position. Here locality interacts with a condition (Case Identification) preventing an argument from "pied-piping" to check EPP if it checks Case elsewhere. In some instances, advancing is forced jointly by locality and Case Identification. Given two equally local arguments, Case Identification determines which can be attracted to the subject position. However, newly identified "superraising" violations support the view that locality is respected even if the highest argument has already checked Case. In the first part of Chapter 3, I argue for the central empirical proposal of this dissertation, Lethal Ambiguity: an anaphoric dependency cannot be established between two specifiers of the same head. I contend that one argument can A-scramble past another only by entering, or leapfrogging through, a multiple-specifier configuration with it. In either case, no anaphoric dependency can be established between the two arguments. In the second part of Chapter 3, I present cases of leapfrogging in A-movement to the subject position, also subject to Lethal Ambiguity. Chapter 4 extends the empirical coverage of Lethal Ambiguity to answer a long-standing question from the literature-namely, why anaphoric clitics cannot be object clitics, I argue that Lethal Ambiguity rules out the object clitic derivation for anaphors because an anaphoric object checks Case in a multiple-specifier configuration with the would-be antecedent. I adopt a passive-like derivation for the well-formed anaphoric clitic construction, where the clitic is a categorically underspecified external argument. Since this argument cannot be attracted to check Case or EPP, the object can skip over it to the subject position without Lethal Ambiguity arising. The remainder of the chapter is devoted to other potential cases of skipping.<br>by Martha Jo McGinnis.<br>Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
8

Fenati, Andrea. "Data Locality in Serverless Computing." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20401/.

Full text
Abstract:
Negli ultimi anni il serverless computing, un nuovo paradigma cloud, ha sperimentato una rapida crescita. Questo modello, chiamato anche Function as a Service (FaaS), permette l’esecuzione di funzioni stateless in risposta ad eventi asincroni. Il suo incremento di popolarità è derivato dalla semplicità di utilizzo. Lo sviluppatore si preoccupa solamente di scrivere il codice delle funzioni e di specificare i requisiti in termini di risorse all’interno della console del provider utilizzato. Tutto il resto, compreso il dimensionamento delle risorse, è gestito in modo automatico dal gestore cloud in base al carico di lavoro richiesto. Inoltre, FaaS offre modalità originali di design e di sviluppo software unite ad una maggior flessibilità nell’uso e nel calcolo dei costi. Questo elaborato è stato inserito in un contesto più ampio, al quale ha partecipato un laureando della Magistrale di Informatica dell’Università di Bologna e due correlatori della University of Southern Denmark. Il progetto, partendo dalla piattaforma serverless open-source Apache OpenWhisk, è volto a dimostrare l’importanza della data locality durante la fase di scheduling delle funzioni. La data locality è importante per ridurre i tempi di esecuzione nel caso in cui le funzioni necessitino di interagire con basi di dati. Come dimostrato in questa tesi, eseguire le cloud functions il più vicino possibile ai dati utilizzati riduce considerevolmente la latenza.
APA, Harvard, Vancouver, ISO, and other styles
9

Greenfield, D. L. "Rentian locality in chip multiprocessors." Thesis, University of Cambridge, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.599668.

Full text
Abstract:
This thesis extends techniques from digital circuit interconnect prediction (in particular Rent’s rule) to analyse and predict interconnectedness in software, Chip-Multiprocessors (CMP) and Networks-on-Chip (NoC). In VLSI (Very Large Scale Integrated) circuits, the fractal connectivity of Rent’s rule is a well known predictor of the physical locality of interconnect across many orders of magnitude. It is shown how a generalised Rent’s rule can characterise and model both spatial and temporal locality in software, and it is demonstrated that locality effects can be exploited in Network-on-Chip design for fault tolerance. Evidence of Rentian fractal scaling in software is examined across several benchmarks using multiple methods. Given Rentian scaling, many fundamental results are derived for future many-core CMP architectures that relate number of cores, communication, on-chip memory and the Rent’s exponent, including some surprising scaling requirements towards fine-grain communication. It is also shown that existing models of an algorithm’s asymptotic time and energy cost are inadequate to account for physical communication costs and locality. A new analytical framework that utilises locality and its Rentian characterisation is demonstrated on several example algorithms, and a study is made of the ‘embedding problem’ for composing embeddings of algorithms together. Finally, in examining the interplay of communication and massively parallel computation at larger scales, we look at the mammalian brain as a proof-of-existence. We show that Rent’s rule also appears to apply to neuronal systems, and that this relates to the allometric scaling of communication to computation.
APA, Harvard, Vancouver, ISO, and other styles
10

Collins, Daniel G. "Perspectives on quantum non-locality." Thesis, University of Bristol, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.247668.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Locality of the error"

1

(FamilySearch), Family History Library. Locality catalog. Church of Jesus Christ of Latter-Day Saints, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ham, Christopher. Locality purchasing. Health ServicesManagement Centre, University of Birmingham, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

(FamilySearch), Family History Library. Locality catalog. Church of Jesus Christ of Latter-Day Saints, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

(FamilySearch), Family History Library. Locality catalog. Churchof Jesus Christ of Latter-Day Saints, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gordon, Eric, and Adriana de Souza e Silva. Net Locality. John Wiley & Sons, Ltd, 2011. http://dx.doi.org/10.1002/9781444340679.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

(FamilySearch), Family History Library. Locality catalog. Church of Jesus Christ of Latter-Day Saints, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

(FamilySearch), Family History Library. Locality catalog. Church of Jesus Christ of Latter-Day Saints, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

(FamilySearch), Family History Library. Locality catalog. Church of Jesus Christ of Latter-Day Saints, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

(FamilySearch), Family History Library. Locality catalog. Church of Jesus Christ of Latter-Day Saints, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Planets in locality. Llewellyn Publications, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Locality of the error"

1

Weispfenning, Volker. "Efficient decision algorithms for locally finite theories." In Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-16776-5_729.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Valdinoci, Enrico. "All Functions Are (Locally) s-Harmonic (up to a Small Error)—and Applications." In Lecture Notes in Mathematics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-74042-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Manegold, Stefan. "Locality." In Encyclopedia of Database Systems. Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_2974.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Stapp, Henry P. "Locality." In Compendium of Quantum Physics. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-70626-7_108.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Merlo, Paola. "Locality." In Parsing with Principles and Classes of Information. Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-009-1708-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Manegold, Stefan. "Locality." In Encyclopedia of Database Systems. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_2974-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

’t Hooft, Gerard. "Locality." In Fundamental Theories of Physics. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-41285-6_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pini, Riccardo, Maria Luisa Ralli, and Saravanakumar Shanmugam. "Emergency Department Clinical Risk." In Textbook of Patient Safety and Clinical Risk Management. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-59403-9_15.

Full text
Abstract:
AbstractThe emergency department of any institution is an entry point for a significant number of patients to any health care organization. The department caters to various trauma and medical emergencies in both adults and in children round the clock and is adequately staffed with emergency physicians, and nursing to handle such emergencies at all times and days. The department also oversees operations of the prehospital emergency medical services (ambulance) and coordinates their services.The emergency department (ED) is considered particularly high risk for adverse events (AE): 60% of ED patients experienced Medication Error (Patanwala et al., Ann Emerg Med 55:522–526, 2010). From a systematically review about AE related to ED, appears that the prevalence of AE among hospitalized patients ranging from 2.9% to 16.6%, with 36.9% to 51% of events considered preventable (Stang et al., PLoS One 8:e74214, 2013).Maintaining quality and developing error-free systems have been the focus of engineering over the last few decades.Consider the degree of variability of every individual human being compared to machine and also wisdoms from engineering field, for error-free system that guarantees good quality assistance should be defined a program reasonably simple, locally relevant, easily implementable, not be resource intense and have tangible outcomes which can be measured.
APA, Harvard, Vancouver, ISO, and other styles
9

Stapp, Henry P. "Einstein Locality." In Compendium of Quantum Physics. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-70626-7_60.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Manegold, Stefan. "Memory Locality." In Encyclopedia of Database Systems. Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_686.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Locality of the error"

1

Sim, Jaehyeong, Jun-Seok Park, Seungwook Paek, and Lee-Sup Kim. "Timing error masking by exploiting operand value locality in SIMD architecture." In 2014 32nd IEEE International Conference on Computer Design (ICCD). IEEE, 2014. http://dx.doi.org/10.1109/iccd.2014.6974667.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ghaemi, Seyedeh Golsana, Iman Ahmadpour, Mehdi Ardebili, and Hamed Farbeh. "SMARTag: Error Correction in Cache Tag Array by Exploiting Address Locality." In 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 2018. http://dx.doi.org/10.23919/date.2018.8467758.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shamshiri, Saeed, and Kwang-Ting Cheng. "Error-locality-aware linear coding to correct multi-bit upsets in SRAMs." In 2010 IEEE International Test Conference (ITC). IEEE, 2010. http://dx.doi.org/10.1109/test.2010.5699220.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhu, Hao, and Shenghua Gao. "Locality Constrained Deep Supervised Hashing for Image Retrieval." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/499.

Full text
Abstract:
Deep Convolutional Neural Network (DCNN) based deep hashing has shown its success for fast and accurate image retrieval, however directly minimizing the quantization error in deep hashing will change the distribution of DCNN features, and consequently change the similarity between the query and the retrieved images in hashing. In this paper, we propose a novel Locality-Constrained Deep Supervised Hashing. By simultaneously learning discriminative DCNN features and preserving the similarity between image pairs, the hash codes of our scheme preserves the distribution of DCNN features thus favors the accurate image retrieval.The contributions of this paper are two-fold: i) Our analysis shows that minimizing quantization error in deep hashing makes the features less discriminative which is not desirable for image retrieval; ii) We propose a Locality-Constrained Deep Supervised Hashing which preserves the similarity between image pairs in hashing.Extensive experiments on the CIFARA-10 and NUS-WIDE datasets show that our method significantly boosts the accuracy of image retrieval, especially on the CIFAR-10 dataset, the improvement is usually more than 6% in terms of the MAP measurement. Further, our method demonstrates 10 times faster than state-of-the-art methods in the training phase.
APA, Harvard, Vancouver, ISO, and other styles
5

Zhang, Dongdong, Pinghai Yang, and Xiaoping Qian. "Adaptive NC Path Generation From Massive Point Data With Bounded Error." In ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-49626.

Full text
Abstract:
This paper presents an approach for generating curvature-adaptive finishing tool paths with bounded error directly from massive point data in three-axis CNC milling. This approach uses the Moving Least Squares (MLS) surface as the underlying surface representation. A closed-form formula for normal curvature computing is derived from the implicit form of MLS surfaces. It enables the generation of curvature-adaptive tool paths from massive point data that is critical for balancing the trade-off between machining accuracy and speed. To ensure the path accuracy and robustness for arbitrary surfaces where there might be abrupt curvature change, a novel guidance field algorithm is introduced. It overcomes potential excessive locality of curvature-adaptive paths by examining the neighboring points’ curvature within a self-updating search bound. Our results affirm that the combination of curvature-adaptive path generation and the guidance field algorithm produces high-quality NC paths from a variety of point cloud data with bounded error.
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Peng, Chunbo Fan, Yuanyuan Ren, and Zhou Sun. "An error analysis on locally linear embedding." In 2013 IEEE International Conference on Granular Computing (GrC). IEEE, 2013. http://dx.doi.org/10.1109/grc.2013.6740451.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ko, Hua-Wei, Shiv G. Kapoor, Placid M. Ferreira, et al. "Machine-Tool Error Observer Design With Application to Thermal Error Tracking." In ASME 2018 13th International Manufacturing Science and Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/msec2018-6554.

Full text
Abstract:
A parameter identification procedure for identifying the parameters of a volumetric error model of a large and complex machine tool usually requires a large number of observations of volumetric error components in its workspace. This paper demonstrates the possibility of applying optimal observation/experimental design theories to volumetric error model parameter identification of a large 5-axis machine with one redundant axis. Several designs such as A-, D- and K-optimal designs seek to maximize the amount of information carried in the observations made in an experiment. In this paper, we adapt these design approaches in the construction of machine-tool error observers by determining locations in the workspace at which components of volumetric errors must be measured so that the underlying error model parameters can be identified. Many of optimal designs tend to localize observations at either the center or the boundary of the workspace. This can leave large volumes of the workspace inadequately represented, making the identified model parameters particularly susceptible to model inadequacy issues. Therefore, we develop constrained optimization algorithms that force the distribution of observation points in the machine’s workspace. Optimal designs provide the possibility of efficiency (reduced number of observations and hence reduced measurement time) in the identification procedure. This opens up the possibility of tracking thermal variations of the volumetric error model with periodic quick measurements. We report on the design, implementation and performance of a constrained K-optimal in tracking the thermal variations of the volumetric error over a 5.5 hour period of operations with measurements being made each hour.
APA, Harvard, Vancouver, ISO, and other styles
8

Chen, Hu, Sanghamitra Roy, and Koushik Chakraborty. "Exploiting static and dynamic locality of timing errors in robust L1 cache design." In 2014 15th International Symposium on Quality Electronic Design (ISQED). IEEE, 2014. http://dx.doi.org/10.1109/isqed.2014.6783300.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dinur, Irit, and Elazar Goldenberg. "Locally Testing Direct Product in the Low Error Range." In 2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, 2008. http://dx.doi.org/10.1109/focs.2008.26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rombaut, Joost, Aleksandra Pižurica, and Wilfried Philips. "Locally adaptive passive error concealment for wavelet coded video." In IS&T/SPIE Electronic Imaging, edited by Frederic Truchetet and Olivier Laligant. SPIE, 2009. http://dx.doi.org/10.1117/12.807486.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Locality of the error"

1

Tate, Adrian, Amir Kamil, Anshu Dubey, et al. Programming Abstractions for Data Locality. Office of Scientific and Technical Information (OSTI), 2014. http://dx.doi.org/10.2172/1172915.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ne`eman, Y., and A. Botero. Can EPR non-locality be geometrical? Office of Scientific and Technical Information (OSTI), 1995. http://dx.doi.org/10.2172/113979.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cumming, L. M. A Halifax slate graptolite locality, Nova Scotia. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 1985. http://dx.doi.org/10.4095/120057.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lorence, Mark J., and M. Satyanarayanan. IPwatch: A Tool for Monitoring Network Locality. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada461111.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Adams, Mark. Segmental Refinement: A Multigrid Technique for Data Locality. Office of Scientific and Technical Information (OSTI), 2014. http://dx.doi.org/10.2172/1160342.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Agarwal, Anant, and Anoop Gupta. Temporal, Processor, and Spatial Locality in Multiprocessor Memory References. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada213790.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Vinyard, Natalia Sergeevna, Theodore Sonne Perry, and Igor Olegovich Usov. Error Budgeting. Office of Scientific and Technical Information (OSTI), 2017. http://dx.doi.org/10.2172/1398889.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Guiso, Luigi, Paola Sapienza, and Luigi Zingales. Monnet's Error? National Bureau of Economic Research, 2015. http://dx.doi.org/10.3386/w21121.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kostov-Kytin, Vladislav, Chavdar Karov, Iliya Dimitrov, and Rositsa Nikolova. New Investigations on the Columbite from Vishteritsa Locality, Western Rhodopes. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, 2020. http://dx.doi.org/10.7546/crabs.2020.05.08.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Eberhard, P. H. A realistic model for quantum theory with a locality property. Office of Scientific and Technical Information (OSTI), 1987. http://dx.doi.org/10.2172/6201536.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Locality of the error' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography