Journal articles: 'Universal models'

1

Naturman, Colin, and Henry Rose. "ULTRA-UNIVERSAL MODELS." Quaestiones Mathematicae 15, no. 2 (April 1992): 189–95. http://dx.doi.org/10.1080/16073606.1992.9631683.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

CARAMELLO, OLIVIA. "Universal models and definability." Mathematical Proceedings of the Cambridge Philosophical Society 152, no. 2 (October 19, 2011): 279–302. http://dx.doi.org/10.1017/s0305004111000624.

Full text

Abstract:

AbstractWe establish some general results on universal models in Topos Theory and show that the investigation of such models can shed light on problems of definability in Logic as well as on De Morgan's law and the law of excluded middle for Grothendieck toposes.

APA, Harvard, Vancouver, ISO, and other styles

3

Cho, Peter. "Unified universal seesaw models." Physical Review D 48, no. 11 (December 1, 1993): 5331–41. http://dx.doi.org/10.1103/physrevd.48.5331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Fiserová, Eva. "Testing hypotheses in universal models." Discussiones Mathematicae Probability and Statistics 26, no. 2 (2006): 127. http://dx.doi.org/10.7151/dmps.1078.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Guha, Partha, and Mikhail Olshanetsky. "Quest for Universal Integrable Models." Journal of Nonlinear Mathematical Physics 6, no. 3 (January 1999): 273–93. http://dx.doi.org/10.2991/jnmp.1999.6.3.5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Boumans, Marcel, and Neil De Marchi. "Models, Measurement, and “Universal Patterns”." History of Political Economy 50, S1 (2018): 231–48. http://dx.doi.org/10.1215/00182702-7033956.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Beloshapka, V. K. "Universal Models For Real Submanifolds." Mathematical Notes 75, no. 3/4 (March 2004): 475–88. http://dx.doi.org/10.1023/b:matn.0000023331.50692.87.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Stokoe, William C. "Models, Signs, and Universal Rules." Sign Language Studies 1, no. 1 (2000): 10–16. http://dx.doi.org/10.1353/sls.2000.0006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Avigad, Jeremy. "Saturated models of universal theories." Annals of Pure and Applied Logic 118, no. 3 (December 2002): 219–34. http://dx.doi.org/10.1016/s0168-0072(02)00030-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Peretyat'kin, M. G. "Semantically universal classes of models." Algebra and Logic 30, no. 4 (July 1991): 271–82. http://dx.doi.org/10.1007/bf01985062.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Baldwin, J., and S. Shelah. "Abstract classes with few models have ‘homogeneous-universal’ models." Journal of Symbolic Logic 60, no. 1 (March 1995): 246–65. http://dx.doi.org/10.2307/2275520.

Full text

Abstract:

This paper is concerned with a class K of models and an abstract notion of submodel ≤. Experience in first order model theory has shown the desirability of finding a ‘monster model’ to serve as a universal domain for K. In the original constructions of Jónsson and Fraïssé, K was a universal class and ordinary substructure played the role of ≤. Working with a cardinal λ satisfying λ<λ = λ guarantees appropriate downward Löwenheim-Skolem theorems; the existence and uniqueness of a homogeneous-universal model appears to depend centrally on the amalgamation property. We make this apparent dependence more precise in this paper.The major innovation of this paper is the introduction of a weaker notion (chain homogeneous-universal) to replace the natural notion of (K, <)-homogeneous-universal model. Modulo a weak extension of ZFC (provable if V = L), we show (Corollary 5.24) that a class K obeying certain minimal restrictions satisfies a fundamental dichotomy. For arbitrarily large λ, either K has the maximal number of models in power λ or K has a unique chain homogeneous-universal model of power λ. We show (5.25) in a class with amalgamation this dichotomy holds for the notion of K-homogeneous-universal model in the more normal sense.The methods here allow us to improve our earlier results [5] in two other ways: certain requirements on all chains of a given length are replaced by requiring winning strategies in certain games; the notion of a canonically prime model is avoided. A full understanding of these extensions requires consideration of the earlier papers but we summarize them quickly here.

APA, Harvard, Vancouver, ISO, and other styles

12

Ponce, William A. "New universal 3-3-1 models." Revista de la Academia Colombiana de Ciencias Exactas, Físicas y Naturales 42, no. 165 (December 26, 2018): 319. http://dx.doi.org/10.18257/raccefyn.784.

Full text

Abstract:

Se revisa de manera sistemática como se construyen los modelos sin cargas eléctricas exóticas basados en el grupo gauge local SU(3)c ⊗ SU(3)L ⊗ U(1)X, usando como base conjuntos cerrados de fermiones los cuales incluyen las partículas y las antipartículas de los campos eléctricamente cargados. Nuestro análisis no solo reproduce los modelos presentes en la literatura, sino que muestra la existencia de dos modelos nuevos independientes de familias no estudiados a la fecha. © 2018. Acad. Colomb. Cienc. Ex. Fis. Nat.

APA, Harvard, Vancouver, ISO, and other styles

13

Ben Salem, Malek, Olivier Roustant, Fabrice Gamboa, and Lionel Tomaso. "Universal Prediction Distribution for Surrogate Models." SIAM/ASA Journal on Uncertainty Quantification 5, no. 1 (January 2017): 1086–109. http://dx.doi.org/10.1137/15m1053529.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Merhav, N. "Universal classification for hidden Markov models." IEEE Transactions on Information Theory 37, no. 6 (1991): 1586–94. http://dx.doi.org/10.1109/18.104319.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Rissanen, J. "Fast universal coding with context models." IEEE Transactions on Information Theory 45, no. 4 (May 1999): 1065–71. http://dx.doi.org/10.1109/18.761250.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Martin, Alvaro, Gadiel Seroussi, and Marcelo J. Weinberger. "Universal Enumerative Coding for Tree Models." IEEE Transactions on Information Theory 60, no. 3 (March 2014): 1387–411. http://dx.doi.org/10.1109/tit.2013.2295217.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Feverati, G., L. Frappat, and E. Ragoucy. "Universal Hubbard models with arbitrary symmetry." Journal of Statistical Mechanics: Theory and Experiment 2009, no. 04 (April 20, 2009): P04014. http://dx.doi.org/10.1088/1742-5468/2009/04/p04014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Schmidt, Daniel F., and Enes Makalic. "Universal Models for the Exponential Distribution." IEEE Transactions on Information Theory 55, no. 7 (July 2009): 3087–90. http://dx.doi.org/10.1109/tit.2009.2018331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Bartoš, Tomáš. "Universal indexing of arbitrary similarity models." Proceedings of the VLDB Endowment 6, no. 12 (August 28, 2013): 1392–97. http://dx.doi.org/10.14778/2536274.2536324.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Freedman, Michael, and Vyacheslav Krushkal. "Engel groups and universal surgery models." Journal of Topology 13, no. 3 (June 30, 2020): 1302–16. http://dx.doi.org/10.1112/topo.12155.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

CASANOVAS, ENRIQUE, and SAHARON SHELAH. "UNIVERSAL THEORIES AND COMPACTLY EXPANDABLE MODELS." Journal of Symbolic Logic 84, no. 3 (March 6, 2019): 1215–23. http://dx.doi.org/10.1017/jsl.2019.16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Džamonja, Mirna, and Saharon Shelah. "On the existence of universal models." Archive for Mathematical Logic 43, no. 7 (May 25, 2004): 901–36. http://dx.doi.org/10.1007/s00153-004-0235-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

ǅamonja, Mirna. "Club Guessing and the Universal Models." Notre Dame Journal of Formal Logic 46, no. 3 (July 2005): 283–300. http://dx.doi.org/10.1305/ndjfl/1125409327.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Hoover, Douglas N. "Probabilities on models of universal sentences." Proceedings of the American Mathematical Society 98, no. 2 (February 1, 1986): 294. http://dx.doi.org/10.1090/s0002-9939-1986-0854036-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Axenides, Minos, Stephen D. Ellis, and Costas Kounnas. "Universal behavior ofD-dimensional superstring models." Physical Review D 37, no. 10 (May 15, 1988): 2964–76. http://dx.doi.org/10.1103/physrevd.37.2964.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Holst, Niels. "A universal simulator for ecological models." Ecological Informatics 13 (January 2013): 70–76. http://dx.doi.org/10.1016/j.ecoinf.2012.11.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Qing Gao, Gang Feng, Daoyi Dong, and Lu Liu. "Universal Fuzzy Models and Universal Fuzzy Controllers for Discrete-Time Nonlinear Systems." IEEE Transactions on Cybernetics 45, no. 5 (May 2015): 880–87. http://dx.doi.org/10.1109/tcyb.2014.2338312.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Gao, Qing, Gang Feng, Yong Wang, and Jianbin Qiu. "Universal Fuzzy Models and Universal Fuzzy Controllers for Stochastic Nonaffine Nonlinear Systems." IEEE Transactions on Fuzzy Systems 21, no. 2 (April 2013): 328–41. http://dx.doi.org/10.1109/tfuzz.2012.2213823.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Shurygin, Viktor, Anna Berestova, Tatiana Litvinova, Eugeny Kolpak, and Alesya Nureyeva. "Universal Models and Platforms in E-Learning." International Journal of Emerging Technologies in Learning (iJET) 16, no. 09 (May 4, 2021): 63. http://dx.doi.org/10.3991/ijet.v16i09.19697.

Full text

Abstract:

The study describes the effectiveness of digital technological solutions in education. Students, postgraduates, teachers, and medical business representatives have tested a comprehensive educational product based on the capabilities of learning management system (LMS) platforms. The online course was implemented on the e-learning platforms such as Moodle, Schoology, TalentLMS, Canvas LMS, Docebo, iSpringLearn's, Brightspace, Absorb LMS. The implementation of advanced e-learning models ensured the effectiveness of the educational process. The focus on the development of the personal potential of each educational process participant made it possible to create a personalized learning environment and evoke a sense of personal significance and importance. The focus on feedback has created a creative communication environment for the exchange of knowledge, thoughts and ideas satisfying participants' educational needs for self-expression and creativity. The collective creativity of the educational process participants made it possible to develop a high-quality corporate culture of the students involved, which became the basis for establishing business partnerships in the system of education, science, and business. Based on the observations, a universal model of an effective educational process in the digital age has been developed.

APA, Harvard, Vancouver, ISO, and other styles

30

Neshitoi, V. V. "Zipf’s and Bradford’s laws and universal models." Automatic Documentation and Mathematical Linguistics 44, no. 1 (February 2010): 30–37. http://dx.doi.org/10.3103/s0005105510010048.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Singla, Yaman Kumar, Swapnil Parekh, Somesh Singh, Changyou Chen, Balaji Krishnamurthy, and Rajiv Ratn Shah. "MINIMAL: Mining Models for Universal Adversarial Triggers." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 10 (June 28, 2022): 11330–39. http://dx.doi.org/10.1609/aaai.v36i10.21384.

Full text

Abstract:

It is well known that natural language models are vulnerable to adversarial attacks, which are mostly input-specific in nature. Recently, it has been shown that there also exist input-agnostic attacks in NLP models, called universal adversarial triggers. However, existing methods to craft universal triggers are data intensive. They require large amounts of data samples to generate adversarial triggers, which are typically inaccessible by attackers. For instance, previous works take 3000 data samples per class for the SNLI dataset to generate adversarial triggers. In this paper, we present a novel data-free approach, MINIMAL, to mine input-agnostic adversarial triggers from models. Using the triggers produced with our data-free algorithm, we reduce the accuracy of Stanford Sentiment Treebank’s positive class from 93.6% to 9.6%. Similarly, for the Stanford Natural LanguageInference (SNLI), our single-word trigger reduces the accuracy of the entailment class from 90.95% to less than 0.6%. Despite being completely data-free, we get equivalent accuracy drops as data-dependent methods

APA, Harvard, Vancouver, ISO, and other styles

32

Gu, Ming Gao, Liuquan Sun, and Changquan Huang. "A universal procedure for parametric frailty models." Journal of Statistical Computation and Simulation 74, no. 1 (January 2004): 1–13. http://dx.doi.org/10.1080/0094965031000097304.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Klyuchnikov, A. S. "Performance Determination of New Universal Dryer Models." Agricultural Machinery and Technologies 12, no. 5 (November 8, 2018): 44–48. http://dx.doi.org/10.22314/2073-7599-2018-12-5-44-48.

Full text

Abstract:

Drying of seed material plays an important part in the system of post-harvest processing and greatly affects the yield quality of the seed material.(Research purpose)Determination of the performance of two modules of a new dryer, taking into account the statistical characteristics of humidity, impurity content and the intensity of submitting the grain heap of various crops to post-harvest processing.(Materials and methods)The research group has tested a mini-module of a new universal dryer developed in the laboratory workshops of Yaroslavl State Agricultural Academy, in the Bolshoye Selo district of the Yaroslavl region. The calculation has been based on the data of the average regional farm.(Results and discussion)It has been determined that the average statistical percentage of moisture removal from the original grain heap was 10.52 percent; gross grain harvest per year – 1,500 tons; the estimated capacity by the dried seed material of the base module is 5 tons per hour, that of the mini module - 0.35 tons per hour. Due to the contribution of Yaroslavl State Agricultural Academy, fully mechanized receiving chambers with air chutes accommodating 300 or 600 cubic meters of heap coming from combines have been introduced into the production lines of post-harvest processing of the crop material. The efficiency calculation of the mini-module has been caused by the need to use it on the farms for the independent supply of high-quality seed material.(Conclusions)The experiment results have confirmed the validity of the calculations and the effectiveness of the new method of drying. In unfavorable weather, grain crops were harvested by a forage harvester and then dried in a mini-module. After processing, high-quality seeds were obtained, the germination rate of which accounted 98-99 percent.

APA, Harvard, Vancouver, ISO, and other styles

34

SASAKI, R. "Universal Lax Pair for Generalised CalogerosMoser Models." Journal of Non-linear Mathematical Physics 8, Supplement (2001): 254. http://dx.doi.org/10.2991/jnmp.2001.8.supplement.44.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Haddad, T. A. S., S. T. R. Pinho, and S. R. Salinas. "Universal critical behavior of aperiodic ferromagnetic models." Physical Review E 61, no. 4 (April 1, 2000): 3330–33. http://dx.doi.org/10.1103/physreve.61.3330.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

St-Charles, Pierre-Luc, Guillaume-Alexandre Bilodeau, and Robert Bergevin. "Universal Background Subtraction Using Word Consensus Models." IEEE Transactions on Image Processing 25, no. 10 (October 2016): 4768–81. http://dx.doi.org/10.1109/tip.2016.2598691.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Il’ichev, V. G. "Universal stock constants in models of competition." Mathematical Models and Computer Simulations 8, no. 1 (January 2016): 73–83. http://dx.doi.org/10.1134/s2070048216010038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Khisamiev, A. N. "Universal functions and almost c-simple models." Siberian Mathematical Journal 56, no. 3 (May 2015): 526–40. http://dx.doi.org/10.1134/s0037446615030167.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Cohen-Tannoudji, G. "Universal constants, standard models and fundamental metrology." European Physical Journal Special Topics 172, no. 1 (June 2009): 5–24. http://dx.doi.org/10.1140/epjst/e2009-01038-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Oliveira, M. J. de, J. F. F. Mendes, and M. A. Santos. "Nonequilibrium spin models with Ising universal behaviour." Journal of Physics A: Mathematical and General 26, no. 10 (May 21, 1993): 2317–24. http://dx.doi.org/10.1088/0305-4470/26/10/006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Avigad, Jeremy. "Erratum to “Saturated models of universal theories”." Annals of Pure and Applied Logic 121, no. 2-3 (June 2003): 285. http://dx.doi.org/10.1016/s0168-0072(03)00004-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Wootton, James R., and Jiannis K. Pachos. "Universal Quantum Computation with Abelian Anyon Models." Electronic Notes in Theoretical Computer Science 270, no. 2 (February 2011): 209–18. http://dx.doi.org/10.1016/j.entcs.2011.01.032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Kłopotowska, Agnieszka. "Tactile Architectural Models as Universal ‘Urban Furniture’." IOP Conference Series: Materials Science and Engineering 245 (October 2017): 082039. http://dx.doi.org/10.1088/1757-899x/245/8/082039.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Cubitt, Toby S., Ashley Montanaro, and Stephen Piddock. "Universal quantum Hamiltonians." Proceedings of the National Academy of Sciences 115, no. 38 (August 30, 2018): 9497–502. http://dx.doi.org/10.1073/pnas.1804949115.

Full text

Abstract:

Quantum many-body systems exhibit an extremely diverse range of phases and physical phenomena. However, we prove that the entire physics of any quantum many-body system can be replicated by certain simple, “universal” spin-lattice models. We first characterize precisely what it means for one quantum system to simulate the entire physics of another. We then fully classify the simulation power of all two-qubit interactions, thereby proving that certain simple models can simulate all others, and hence are universal. Our results put the practical field of analogue Hamiltonian simulation on a rigorous footing and take a step toward justifying why error correction may not be required for this application of quantum information technology.

APA, Harvard, Vancouver, ISO, and other styles

45

Wasserman, Larry, Aaditya Ramdas, and Sivaraman Balakrishnan. "Universal inference." Proceedings of the National Academy of Sciences 117, no. 29 (July 6, 2020): 16880–90. http://dx.doi.org/10.1073/pnas.1922664117.

Full text

Abstract:

We propose a general method for constructing confidence sets and hypothesis tests that have finite-sample guarantees without regularity conditions. We refer to such procedures as “universal.” The method is very simple and is based on a modified version of the usual likelihood-ratio statistic that we call “the split likelihood-ratio test” (split LRT) statistic. The (limiting) null distribution of the classical likelihood-ratio statistic is often intractable when used to test composite null hypotheses in irregular statistical models. Our method is especially appealing for statistical inference in these complex setups. The method we suggest works for any parametric model and also for some nonparametric models, as long as computing a maximum-likelihood estimator (MLE) is feasible under the null. Canonical examples arise in mixture modeling and shape-constrained inference, for which constructing tests and confidence sets has been notoriously difficult. We also develop various extensions of our basic methods. We show that in settings when computing the MLE is hard, for the purpose of constructing valid tests and intervals, it is sufficient to upper bound the maximum likelihood. We investigate some conditions under which our methods yield valid inferences under model misspecification. Further, the split LRT can be used with profile likelihoods to deal with nuisance parameters, and it can also be run sequentially to yield anytime-valid P values and confidence sequences. Finally, when combined with the method of sieves, it can be used to perform model selection with nested model classes.

APA, Harvard, Vancouver, ISO, and other styles

46

Ghani, Neil, Fredrik Nordvall Forsberg, and Federico Orsanigo. "Universal properties for universal types in bifibrational parametricity." Mathematical Structures in Computer Science 29, no. 06 (March 22, 2019): 810–27. http://dx.doi.org/10.1017/s0960129518000336.

Full text

Abstract:

AbstractIn the 1980s, John Reynolds postulated that a parametrically polymorphic function is an ad-hoc polymorphic function satisfying a uniformity principle. This allowed him to prove that his set-theoretic semantics has a relational lifting which satisfies the Identity Extension Lemma and the Abstraction Theorem. However, his definition (and subsequent variants) has only been given for specific models. In contrast, we give a model-independent axiomatic treatment by characterising Reynolds’ definition via a universal property, and show that the above results follow from this universal property in the axiomatic setting.

APA, Harvard, Vancouver, ISO, and other styles

47

Shafahi, Ali, Mahyar Najibi, Zheng Xu, John Dickerson, Larry S. Davis, and Tom Goldstein. "Universal Adversarial Training." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 04 (April 3, 2020): 5636–43. http://dx.doi.org/10.1609/aaai.v34i04.6017.

Full text

Abstract:

Standard adversarial attacks change the predicted class label of a selected image by adding specially tailored small perturbations to its pixels. In contrast, a universal perturbation is an update that can be added to any image in a broad class of images, while still changing the predicted class label. We study the efficient generation of universal adversarial perturbations, and also efficient methods for hardening networks to these attacks. We propose a simple optimization-based universal attack that reduces the top-1 accuracy of various network architectures on ImageNet to less than 20%, while learning the universal perturbation 13× faster than the standard method.To defend against these perturbations, we propose universal adversarial training, which models the problem of robust classifier generation as a two-player min-max game, and produces robust models with only 2× the cost of natural training. We also propose a simultaneous stochastic gradient method that is almost free of extra computation, which allows us to do universal adversarial training on ImageNet.

APA, Harvard, Vancouver, ISO, and other styles

48

Liebscher, Eckhard. "A Universal Selection Method in Linear Regression Models." Open Journal of Statistics 02, no. 02 (2012): 153–62. http://dx.doi.org/10.4236/ojs.2012.22017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Li, Haoxuan, and Zheng Wang. "Universal Sparse Adversarial Attack on Video Recognition Models." International Journal of Multimedia Data Engineering and Management 12, no. 3 (July 2021): 1–15. http://dx.doi.org/10.4018/ijmdem.291555.

Full text

Abstract:

Recent studies discover that deep neural networks (DNNs) are vulnerability to adversarial examples. So far, most of the adversarial researches have focused on image models. Whilst several attacks have been proposed for video models, their crafted perturbation are mainly per-instance and totally polluted ways. Thus, universal sparse video attacks are still unexplored. In this article, propose a new method to explore universal sparse adversarial perturbation for video recognition system and study the robustness of a 3D-ResNet based video action recognition model. A large number of experiments on UCF101 and HMDB51 show that this attack method can reduce the success rate of recognition model to 5% or less, while only changes 1% of pixels in the video. On this basis, by changing the selection method of sparse pixels and the pollution mode in the algorithm, the patch attack algorithm with temporal sparsity and the one pixel attack algorithm are proposed.

APA, Harvard, Vancouver, ISO, and other styles

50

Müller, B. "Is Finite-Size Scaling Universal for Ising Models?" International Journal of Modern Physics C 09, no. 04 (June 1998): 585–89. http://dx.doi.org/10.1142/s0129183198000480.

Full text

Abstract:

The sensitivity on shape and boundaries at the Curie point of the universal critical ratio LdM2/χ for the Ising model is confirmed by a comparison of square and rectangular lattices. Tests with three different algorithms give the same results for the universal critical ratio on various lattice types and always the same dependence on the system's aspect ratio.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Universal models'

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