Relevant bibliographies by topics / Randomization of arithmetic

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Conference papers

Academic literature on the topic 'Randomization of arithmetic'

Author: Grafiati
Published: 25 May 2024

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 'Randomization of arithmetic.'

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 "Randomization of arithmetic"

1

Emiris, Ioannis Z. "A Complete Implementation for Computing General Dimensional Convex Hulls." International Journal of Computational Geometry & Applications 08, no. 02 (1998): 223–53. http://dx.doi.org/10.1142/s0218195998000126.

Full text
Abstract:
We present a robust implementation of the Beneath-Beyond algorithm for computing convex hulls in arbitrary dimension. Certain techniques used are of independent interest in the implementation of geometric algorithms. In particular, two important, and often complementary, issues are studied, namely exact arithmetic and degeneracy. We focus on integer arithmetic and propose a general and efficient method for its implementation based on modular arithmetic. We suggest that probabilistic modular arithmetic may be of wide interest, as it combines the advantages of modular arithmetic with the speed o
APA, Harvard, Vancouver, ISO, and other styles
2

Poirier, Julia, GY Zou, and John Koval. "Confidence intervals for a difference between lognormal means in cluster randomization trials." Statistical Methods in Medical Research 26, no. 2 (2014): 598–614. http://dx.doi.org/10.1177/0962280214552291.

Full text
Abstract:
Cluster randomization trials, in which intact social units are randomized to different interventions, have become popular in the last 25 years. Outcomes from these trials in many cases are positively skewed, following approximately lognormal distributions. When inference is focused on the difference between treatment arm arithmetic means, existent confidence interval procedures either make restricting assumptions or are complex to implement. We approach this problem by assuming log-transformed outcomes from each treatment arm follow a one-way random effects model. The treatment arm means are f
APA, Harvard, Vancouver, ISO, and other styles
3

Gao, Pengfei, Hongyi Xie, Fu Song, and Taolue Chen. "A Hybrid Approach to Formal Verification of Higher-Order Masked Arithmetic Programs." ACM Transactions on Software Engineering and Methodology 30, no. 3 (2021): 1–42. http://dx.doi.org/10.1145/3428015.

Full text
Abstract:
Side-channel attacks, which are capable of breaking secrecy via side-channel information, pose a growing threat to the implementation of cryptographic algorithms. Masking is an effective countermeasure against side-channel attacks by removing the statistical dependence between secrecy and power consumption via randomization. However, designing efficient and effective masked implementations turns out to be an error-prone task. Current techniques for verifying whether masked programs are secure are limited in their applicability and accuracy, especially when they are applied. To bridge this gap,
APA, Harvard, Vancouver, ISO, and other styles
4

Hegland, Markus. "Numerical methods for computing the greatest common divisor of univariate polynomials using floating point arithmetic." ANZIAM Journal 60 (August 15, 2019): C127—C139. http://dx.doi.org/10.21914/anziamj.v60i0.14059.

Full text
Abstract:
Computing the greatest common divisor (GCD) for two polynomials in floating point arithmetic is computationally challenging and even standard library software might return the result GCD=1 even when the polynomials have a nontrivial GCD. Here we review Euclid's algorithm and test a variant for a class of random polynomials. We find that our variant of Euclid's method often produces an acceptable result. However, close monitoring of the norm of the vector of coefficients of the intermediate polynomials is required.
 
 References R. M. Corless, P. M. Gianni, B. M. Trager, and S. M. Wat
APA, Harvard, Vancouver, ISO, and other styles
5

Pearce, S. C. "Some Design Problems in Crop Experimentation. I. The Use of Blocks." Experimental Agriculture 31, no. 2 (1995): 191–204. http://dx.doi.org/10.1017/s0014479700025278.

Full text
Abstract:
SUMMARYField experiments are commonly designed in blocks and there are sound reasons for using them, for example, control of unwanted environmental differences and administrative convenience. If used, they should be chosen to correspond to perceived differences in the site or to simplify farm operations and not merely to conform to statistical desiderata. Thus, it is not essential that each must contain one plot for each treatment, though there are advantages if they do. Some of the consequences of using other block sizes are examined, it being borne in mind that modern computer packages will
APA, Harvard, Vancouver, ISO, and other styles
6

Schicho, Kurt, Michael Figl, Rudolf Seemann, et al. "Comparison of laser surface scanning and fiducial marker–based registration in frameless stereotaxy." Journal of Neurosurgery 106, no. 4 (2007): 704–9. http://dx.doi.org/10.3171/jns.2007.106.4.704.

Full text
Abstract:
✓The authors compared the accuracy of laser surface scanning patient registration using the commercially available Fazer (Medtronic, Inc.) with the conventional registration procedure based on fiducial markers (FMs) in computer-assisted surgery. Four anatomical head specimens were prepared with 10 titanium microscrews placed at defined locations and scanned with a 16-slice spiral computed tomography unit. To compare the two registration methods, each method was applied five times for each cadaveric specimen; thus data were obtained from 40 registrations. Five microscrews (selected following a
APA, Harvard, Vancouver, ISO, and other styles
7

Allen, Brian, Edward Florez, Reza Sirous, et al. "Comparative effectiveness of tumor response assessment methods: Standard-of-care versus computer-assisted response evaluation." Journal of Clinical Oncology 35, no. 6_suppl (2017): 432. http://dx.doi.org/10.1200/jco.2017.35.6_suppl.432.

Full text
Abstract:
432 Background: In clinical trials and clinical practice, tumor response assessment with computed tomography (CT) defines critical end points in patients with metastatic disease treated with systemic agents. Methods to reduce errors and improve efficiency in tumor response assessment could improve patient care. Methods: Eleven readers from 10 different institutions independently categorized tumor response according to three different therapeutic response criteria using paired baseline and initial post-therapy CT studies from 20 randomly selected patients with metastatic renal cell carcinoma tr
APA, Harvard, Vancouver, ISO, and other styles
8

Allen, Brian C., Edward Florez, Reza Sirous, et al. "Comparative Effectiveness of Tumor Response Assessment Methods: Standard of Care Versus Computer-Assisted Response Evaluation." JCO Clinical Cancer Informatics, no. 1 (November 2017): 1–16. http://dx.doi.org/10.1200/cci.17.00026.

Full text
Abstract:
Purpose To compare the effectiveness of metastatic tumor response evaluation with computed tomography using computer-assisted versus manual methods. Materials and Methods In this institutional review board–approved, Health Insurance Portability and Accountability Act–compliant retrospective study, 11 readers from 10 different institutions independently categorized tumor response according to three different therapeutic response criteria by using paired baseline and initial post-therapy computed tomography studies from 20 randomly selected patients with metastatic renal cell carcinoma who were
APA, Harvard, Vancouver, ISO, and other styles
9

Krymovskyi, K. G., O. A. Kaniura, and T. M. Kostiuk. "Necessary diagnostic criteria of dental crowding in children during mixed dentition with different facial skeleton growth patterns." Reports of Vinnytsia National Medical University 25, no. 4 (2021): 616–19. http://dx.doi.org/10.31393/reports-vnmedical-2021-25(4)-18.

Full text
Abstract:
Annotation. Pathology of dental crowding during mixed dentition is one of the most common and difficult in the practice of dentist-orthodontist. Its prevalence, according to modern scientific data reaches 77% and occurs in all pathologies of occlusion (malocclusions). The aim of our study is to establish the relationship between the formation of dental crowding and the growth patterns of facial skeleton during mixed dentition in order to improve the effectiveness of orthodontic treatment. We used 42 pairs of plaster models and 42 slices of cone-beam computed tomography images (CBCT) for patien
APA, Harvard, Vancouver, ISO, and other styles
10

Nakai, Takeshi, Yuto Misawa, Yuuki Tokushige, Mitsugu Iwamoto, and Kazuo Ohta. "How to Solve Millionaires’ Problem with Two Kinds of Cards." New Generation Computing, January 5, 2021. http://dx.doi.org/10.1007/s00354-020-00118-8.

Full text
Abstract:
AbstractCard-based cryptography, introduced by den Boer aims to realize multiparty computation (MPC) by using physical cards. We propose several efficient card-based protocols for the millionaires’ problem by introducing a new operation called Private Permutation (PP) instead of the shuffle used in most of existing card-based cryptography. Shuffle is a useful randomization technique by exploiting the property of card shuffling, but it requires a strong assumption from the viewpoint of arithmetic MPC because shuffle assumes that public randomization is possible. On the other hand, private rando
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Randomization of arithmetic"

1

Courtois, Jérôme. "Leak study of cryptosystem implementations in randomized RNS arithmetic." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS290.

Full text
Abstract:
On parlera d'analyse forte pour une analyse qui permet de retrouver la clef d'un système cryptographique et d'une analyse faible dans le cas où on élimine des clefs candidates. Le but de cette thèse est essentiellement la compréhension du comportement de l'aléa des distances de Hamming produites par un système cryptographique de type ECC (Elliptic Curve for Cryptography) quand on utilise une représentation RNS (Residue Number System) avec la méthode des moduli aléatoires. Le Chapitre 2 introduit les différentes notions nécessaires à la compréhension de ce document. Il introduit brièvement l'al
APA, Harvard, Vancouver, ISO, and other styles
2

Marrez, Jérémy. "Représentations adaptées à l'arithmétique modulaire et à la résolution de systèmes flous." Electronic Thesis or Diss., Sorbonne université, 2019. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2019SORUS635.pdf.

Full text
Abstract:
Les calculs modulaires entrant en jeu dans les applications en cryptographie asymétrique utilisent le plus souvent un modulo premier standardisé, dont le choix n’est pas toujours libre en pratique. L’amélioration des opérations modulaires est centrale pour l’efficacité et la sécurité de ces primitives. Cette thèse propose de fournir une arithmétique modulaire efficace pour le plus grand nombre de premiers possible, tout en la prémunissant contre certains types d’attaques. Pour ce faire, nous nous intéressons au système PMNS utilisé pour l’arithmétique modulaire, et proposons des méthodes afin
APA, Harvard, Vancouver, ISO, and other styles
3

Dosso, Fangan Yssouf. "Contribution de l'arithmétique des ordinateurs aux implémentations résistantes aux attaques par canaux auxiliaires." Electronic Thesis or Diss., Toulon, 2020. http://www.theses.fr/2020TOUL0007.

Full text
Abstract:
Cette thèse porte sur deux éléments actuellement incontournables de la cryptographie à clé publique, qui sont l’arithmétique modulaire avec de grands entiers et la multiplication scalaire sur les courbes elliptiques (ECSM). Pour le premier, nous nous intéressons au système de représentation modulaire adapté (AMNS), qui fut introduit par Bajard et al. en 2004. C’est un système de représentation de restes modulaires dans lequel les éléments sont des polynômes. Nous montrons d’une part que ce système permet d’effectuer l’arithmétique modulaire de façon efficace et d’autre part comment l’utiliser
APA, Harvard, Vancouver, ISO, and other styles
4

Samuel, Sindhu. "Digital rights management (DRM) - watermark encoding scheme for JPEG images." Diss., 2008. http://hdl.handle.net/2263/27910.

Full text
Abstract:
The aim of this dissertation is to develop a new algorithm to embed a watermark in JPEG compressed images, using encoding methods. This encompasses the embedding of proprietary information, such as identity and authentication bitstrings, into the compressed material. This watermark encoding scheme involves combining entropy coding with homophonic coding, in order to embed a watermark in a JPEG image. Arithmetic coding was used as the entropy encoder for this scheme. It is often desired to obtain a robust digital watermarking method that does not distort the digital image, even if this implies
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Randomization of arithmetic"

1

Didier, Laurent-Stephane, Fangan-Yssouf Dosso, Nadia El Mrabet, Jeremy Marrez, and Pascal Veron. "Randomization of Arithmetic Over Polynomial Modular Number System." In 2019 IEEE 26th Symposium on Computer Arithmetic (ARITH). IEEE, 2019. http://dx.doi.org/10.1109/arith.2019.00048.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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