Se connecter

Bibliographies thématiques / Probabilistic number theory / Articles de revues

Articles de revues sur le sujet « Probabilistic number theory »

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Probabilistic number theory.

Auteur : Grafiati

Publié le 4 juin 2021

Mis à jour le 1 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Probabilistic number theory ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

Indlekofer, K. H. « Number theory—probabilistic, heuristic, and computational approaches ». Computers & ; Mathematics with Applications 43, n^o 8-9 (avril 2002) : 1035–61. http://dx.doi.org/10.1016/s0898-1221(02)80012-8.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Stakėnas, V. « On some inequalities of probabilistic number theory ». Lithuanian Mathematical Journal 46, n^o 2 (avril 2006) : 208–16. http://dx.doi.org/10.1007/s10986-006-0022-2.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

Erdõs, P. « Recent problems in probabilistic number theory and combinatorics ». Advances in Applied Probability 24, n^o 4 (décembre 1992) : 766–67. http://dx.doi.org/10.1017/s0001867800024654.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

Stakėnas, Vilius. « Jonas Kubilius and genesis of probabilistic number theory ». Lithuanian Mathematical Journal 55, n^o 1 (janvier 2015) : 25–47. http://dx.doi.org/10.1007/s10986-015-9263-2.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Zhang, Wen-Bin. « Probabilistic number theory in additive arithmetic semigroups II ». Mathematische Zeitschrift 235, n^o 4 (1 décembre 2000) : 747–816. http://dx.doi.org/10.1007/s002090000165.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Elliott, P. D. T. A. « Jonas Kubilius and Probabilistic Number Theory Some Personal Reflections ». Lithuanian Mathematical Journal 55, n^o 1 (janvier 2015) : 2–24. http://dx.doi.org/10.1007/s10986-015-9262-3.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Daili, Noureddine. « DENSITIES AND NATURAL INTEGRABILITY. APPLICATIONS IN PROBABILISTIC NUMBER THEORY ». JP Journal of Algebra, Number Theory and Applications 47, n^o 1 (1 juillet 2020) : 51–65. http://dx.doi.org/10.17654/nt047010051.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

8

Lokutsievskiy, Lev V. « Optimal probabilistic search ». Sbornik : Mathematics 202, n^o 5 (31 mai 2011) : 697–719. http://dx.doi.org/10.1070/sm2011v202n05abeh004162.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

9

Aistleitner, Christoph, et Christian Elsholtz. « The Central Limit Theorem for Subsequences in Probabilistic Number Theory ». Canadian Journal of Mathematics 64, n^o 6 (1 décembre 2012) : 1201–21. http://dx.doi.org/10.4153/cjm-2011-074-1.

Texte intégral

Résumé :

Abstract Let (nk)k≥1 be an increasing sequence of positive integers, and let f (x) be a real function satisfyingIf the distribution ofconverges to a Gaussian distribution. In the casethere is a complex interplay between the analytic properties of the function f , the number-theoretic properties of (nk)k≥1, and the limit distribution of (2).In this paper we prove that any sequence (nk)k≥1 satisfying lim contains a nontrivial subsequence (mk)k≥1 such that for any function satisfying (1) the distribution ofconverges to a Gaussian distribution. This result is best possible: for any ε > 0 there exists a sequence (nk)k≥1 satisfying lim such that for every nontrivial subsequence (mk)k≥1 of (nk)k≥1 the distribution of (2) does not converge to a Gaussian distribution for some f.Our result can be viewed as a Ramsey type result: a sufficiently dense increasing integer sequence contains a subsequence having a certain requested number-theoretic property.

Styles APA, Harvard, Vancouver, ISO, etc.

10

Haik, Sumayra. « AFFINE LINES AND ADVANCED PROBABILISTIC MODEL THEORY ». Mathematical Statistician and Engineering Applications 70, n^o 2 (26 février 2021) : 01–14. http://dx.doi.org/10.17762/msea.v70i2.8.

Texte intégral

Résumé :

Letjbe an almost surely algebraic, meromorphic domain.Recent developments in singular logic [36, 22] have raised the question ofwhether every pseudo-Dedekind number is ultra-Gaussian and singular.We show tha

Styles APA, Harvard, Vancouver, ISO, etc.

11

Lazorec, Mihai-Silviu. « Probabilistic aspects of ZM-groups ». Communications in Algebra 47, n^o 2 (16 octobre 2018) : 541–52. http://dx.doi.org/10.1080/00927872.2018.1482310.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

12

Keller, Frank, et Ash Asudeh. « Probabilistic Learning Algorithms and Optimality Theory ». Linguistic Inquiry 33, n^o 2 (avril 2002) : 225–44. http://dx.doi.org/10.1162/002438902317406704.

Texte intégral

Résumé :

This article provides a critical assessment of the Gradual Learning Algorithm (GLA) for probabilistic optimality-theoretic (OT) grammars proposed by Boersma and Hayes (2001). We discuss the limitations of a standard algorithm for OT learning and outline how the GLA attempts to overcome these limitations. We point out a number of serious shortcomings with the GLA: (a) A methodological problem is that the GLA has not been tested on unseen data, which is standard practice in computational language learning. (b) We provide counterexamples, that is, attested data sets that the GLA is not able to learn. (c) Essential algorithmic properties of the GLA (correctness and convergence) have not been proven formally. (d) By modeling frequency distributions in the grammar, the GLA conflates the notions of competence and performance. This leads to serious conceptual problems, as OT crucially relies on the competence/performance distinction.

Styles APA, Harvard, Vancouver, ISO, etc.

13

Corob Cook, Ged, et Matteo Vannacci. « Probabilistic finiteness properties for profinite groups ». Journal of Algebra 574 (mai 2021) : 584–616. http://dx.doi.org/10.1016/j.jalgebra.2021.01.026.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

14

Ragot, Jean-François. « Probabilistic absolute irreducibility test for polynomials ». Journal of Pure and Applied Algebra 172, n^o 1 (juillet 2002) : 87–107. http://dx.doi.org/10.1016/s0022-4049(01)00165-7.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

15

Dvurecenskij, Anatolij, et Jiri Rachunek. « Probabilistic Averaging in Bounded Rℓ-Monoids ». Semigroup Forum 72, n^o 2 (25 mars 2006) : 191–206. http://dx.doi.org/10.1007/s00233-005-0545-6.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

16

Guralnick, Robert M., et William M. Kantor. « Probabilistic Generation of Finite Simple Groups ». Journal of Algebra 234, n^o 2 (décembre 2000) : 743–92. http://dx.doi.org/10.1006/jabr.2000.8357.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

17

KUBOTA, Hisayoshi, et Hiroshi SUGITA. « PROBABILISTIC PROOF OF LIMIT THEOREMS IN NUMBER THEORY BY MEANS OF ADELES ». Kyushu Journal of Mathematics 56, n^o 2 (2002) : 391–404. http://dx.doi.org/10.2206/kyushujm.56.391.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

18

Heijungs, Reinout. « On the number of Monte Carlo runs in comparative probabilistic LCA ». International Journal of Life Cycle Assessment 25, n^o 2 (22 octobre 2019) : 394–402. http://dx.doi.org/10.1007/s11367-019-01698-4.

Texte intégral

Résumé :

Abstract Introduction The Monte Carlo technique is widely used and recommended for including uncertainties LCA. Typically, 1000 or 10,000 runs are done, but a clear argument for that number is not available, and with the growing size of LCA databases, an excessively high number of runs may be a time-consuming thing. We therefore investigate if a large number of runs are useful, or if it might be unnecessary or even harmful. Probability theory We review the standard theory or probability distributions for describing stochastic variables, including the combination of different stochastic variables into a calculation. We also review the standard theory of inferential statistics for estimating a probability distribution, given a sample of values. For estimating the distribution of a function of probability distributions, two major techniques are available, analytical, applying probability theory and numerical, using Monte Carlo simulation. Because the analytical technique is often unavailable, the obvious way-out is Monte Carlo. However, we demonstrate and illustrate that it leads to overly precise conclusions on the values of estimated parameters, and to incorrect hypothesis tests. Numerical illustration We demonstrate the effect for two simple cases: one system in a stand-alone analysis and a comparative analysis of two alternative systems. Both cases illustrate that statistical hypotheses that should not be rejected in fact are rejected in a highly convincing way, thus pointing out a fundamental flaw. Discussion and conclusions Apart form the obvious recommendation to use larger samples for estimating input distributions, we suggest to restrict the number of Monte Carlo runs to a number not greater than the sample sizes used for the input parameters. As a final note, when the input parameters are not estimated using samples, but through a procedure, such as the popular pedigree approach, the Monte Carlo approach should not be used at all.

Styles APA, Harvard, Vancouver, ISO, etc.

19

Pfeifer, Dietmar. « A probabilistic variant of Chernoff's product formula ». Semigroup Forum 46, n^o 1 (décembre 1993) : 279–85. http://dx.doi.org/10.1007/bf02573572.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

20

Morillas, Patricia. « Optimal dual fusion frames for probabilistic erasures ». Electronic Journal of Linear Algebra 32 (6 février 2017) : 191–203. http://dx.doi.org/10.13001/1081-3810.3267.

Texte intégral

Résumé :

For any fixed fusion frame, its optimal dual fusion frames for reconstruction is studied in case of erasures of subspaces. It is considered that a probability distribution of erasure of subspaces is given and that a blind reconstruction procedure is used, where the erased data are set to zero. It is proved that there are always optimal duals. Sufficient conditions for the canonical dual fusion frame being either the unique optimal dual, a non-unique optimal dual, or a non optimal dual, are obtained. The reconstruction error is analyzed, using the optimal duals in the probability model considered here and using the optimal duals in a non-probability model.

Styles APA, Harvard, Vancouver, ISO, etc.

21

Damian, E., et A. Lucchini. « Finite Groups withp-Multiplicative Probabilistic Zeta Function ». Communications in Algebra 35, n^o 11 (23 octobre 2007) : 3451–72. http://dx.doi.org/10.1080/00927870701509313.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

22

Breuer, Thomas, Robert M. Guralnick et William M. Kantor. « Probabilistic generation of finite simple groups, II ». Journal of Algebra 320, n^o 2 (juillet 2008) : 443–94. http://dx.doi.org/10.1016/j.jalgebra.2007.10.028.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

23

Chan, Yu, Emelie Curl, Jesse Geneson, Leslie Hogben, Kevin Liu, Isaac Odegard et Michael Ross. « Using Markov Chains to Determine Expected Propagation Time for Probabilistic Zero Forcing ». Electronic Journal of Linear Algebra 36, n^o 36 (7 juin 2020) : 318–33. http://dx.doi.org/10.13001/ela.2020.5127.

Texte intégral

Résumé :

Zero forcing is a coloring game played on a graph where each vertex is initially colored blue or white and the goal is to color all the vertices blue by repeated use of a (deterministic) color change rule starting with as few blue vertices as possible. Probabilistic zero forcing yields a discrete dynamical system governed by a Markov chain. Since in a connected graph any one vertex can eventually color the entire graph blue using probabilistic zero forcing, the expected time to do this is studied. Given a Markov transition matrix for a probabilistic zero forcing process, an exact formula is established for expected propagation time. Markov chains are applied to determine bounds on expected propagation time for various families of graphs.

Styles APA, Harvard, Vancouver, ISO, etc.

24

Thiagarajan, P. S., et Shaofa Yang. « A Theory of Distributed Markov Chains ». Fundamenta Informaticae 175, n^o 1-4 (28 septembre 2020) : 301–25. http://dx.doi.org/10.3233/fi-2020-1958.

Texte intégral

Résumé :

We present the theory of distributed Markov chains (DMCs). A DMC consists of a collection of communicating probabilistic agents in which the synchronizations determine the probability distribution for the next moves of the participating agents. The key feature of a DMC is that the synchronizations are deterministic, in the sense that any two simultaneously enabled synchronizations involve disjoint sets of agents. Using our theory of DMCs we show how one can analyze the behavior using the interleaved semantics of the model. A key point is, the transition system which defines the interleaved semantics is—except in degenerate cases—not a Markov chain. Hence one must develop new techniques to analyze these behaviors exhibiting both concurrency and stochasticity. After establishing the core theory we develop a statistical model checking procedure which verifies the dynamical properties of the trajectories generated by the the model. The specifications consist of Boolean combinations of component-wise bounded linear time temporal logic formulas. We also provide a probabilistic Petri net representation of DMCs and use it to derive a probabilistic event structure semantics.

Styles APA, Harvard, Vancouver, ISO, etc.

25

DAMIAN, ERIKA, et ANDREA LUCCHINI. « A PROBABILISTIC GENERALIZATION OF SUBNORMALITY ». Journal of Algebra and Its Applications 04, n^o 03 (juin 2005) : 313–23. http://dx.doi.org/10.1142/s0219498805001204.

Texte intégral

Résumé :

A subnormal subgroup X of G has the following property: there exists a Dirichlet polynomial Q(s) with integer coefficients such that, for each t ∈ ℕ, Q(t) is the conditional probability that t random elements generate G given that they generate G together with the elements of X In this paper we analyze how far can a subgroup X be with this property from being a subnormal subgroup.

Styles APA, Harvard, Vancouver, ISO, etc.

26

Matera, Guillermo. « Probabilistic Algorithms for Geometric Elimination ». Applicable Algebra in Engineering, Communication and Computing 9, n^o 6 (1 juillet 1999) : 463–520. http://dx.doi.org/10.1007/s002000050115.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

27

HIRTH, ULRICH MARTIN. « Probabilistic Number Theory, the GEM/Poisson-Dirichlet Distribution and the Arc-sine Law ». Combinatorics, Probability and Computing 6, n^o 1 (mars 1997) : 57–77. http://dx.doi.org/10.1017/s0963548396002805.

Texte intégral

Résumé :

The prime factorization of a random integer has a GEM/Poisson-Dirichlet distribution as transparently proved by Donnelly and Grimmett [8]. By similarity to the arc-sine law for the mean distribution of the divisors of a random integer, due to Deshouillers, Dress and Tenenbaum [6] (see also Tenenbaum [24, II.6.2, p. 233]), – the ‘DDT theorem’ – we obtain an arc-sine law in the GEM/Poisson-Dirichlet context. In this context we also investigate the distribution of the number of components larger than ε which correspond to the number of prime factors larger than nε.

Styles APA, Harvard, Vancouver, ISO, etc.

28

Yee, Eugene. « Theory for Reconstruction of an Unknown Number of Contaminant Sources using Probabilistic Inference ». Boundary-Layer Meteorology 127, n^o 3 (20 mars 2008) : 359–94. http://dx.doi.org/10.1007/s10546-008-9270-5.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

29

Shareshian, John. « On the Probabilistic Zeta Function for Finite Groups ». Journal of Algebra 210, n^o 2 (décembre 1998) : 703–7. http://dx.doi.org/10.1006/jabr.1998.7560.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

30

Damian, Erika, et Andrea Lucchini. « The probabilistic zeta function of finite simple groups ». Journal of Algebra 313, n^o 2 (juillet 2007) : 957–71. http://dx.doi.org/10.1016/j.jalgebra.2007.02.055.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

31

Mosbah, Mohamed. « PROBABILISTIC GRAPH GRAMMARS ». Fundamenta Informaticae 26, n^o 3,4 (1996) : 341–62. http://dx.doi.org/10.3233/fi-1996-263406.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

32

Alon, Noga. « Choice Numbers of Graphs : a Probabilistic Approach ». Combinatorics, Probability and Computing 1, n^o 2 (juin 1992) : 107–14. http://dx.doi.org/10.1017/s0963548300000122.

Texte intégral

Résumé :

The choice number of a graph G is the minimum integer k such that for every assignment of a set S(v) of k colors to every vertex v of G, there is a proper coloring of G that assigns to each vertex v a color from S(v). By applying probabilistic methods, it is shown that there are two positive constants c1 and c2 such that for all m ≥ 2 and r ≥ 2 the choice number of the complete r-partite graph with m vertices in each vertex class is between c1r log m and c2r log m. This supplies the solutions of two problems of Erdős, Rubin and Taylor, as it implies that the choice number of almost all the graphs on n vertices is o(n) and that there is an n vertex graph G such that the sum of the choice number of G with that of its complement is at most O(n1/2(log n)1/2).

Styles APA, Harvard, Vancouver, ISO, etc.

33

SHAKERI, S. « A CONTRACTION THEOREM IN MENGER PROBABILISTIC METRIC SPACES ». Journal of Nonlinear Sciences and Applications 01, n^o 03 (20 septembre 2008) : 189–93. http://dx.doi.org/10.22436/jnsa.001.03.07.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

34

Shatanawi, Wasfi, et Mihai Postolache. « Mazur-Ulam theorem for probabilistic 2-normed spaces ». Journal of Nonlinear Sciences and Applications 08, n^o 06 (6 décembre 2015) : 1228–33. http://dx.doi.org/10.22436/jnsa.008.06.29.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

35

Bruce, Juliette, et Daniel Erman. « A probabilistic approach to systems of parameters and Noether normalization ». Algebra & ; Number Theory 13, n^o 9 (7 décembre 2019) : 2081–102. http://dx.doi.org/10.2140/ant.2019.13.2081.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

36

Ben-Ari, Iddo, et Michael Neumann. « Probabilistic approach to Perron root, the group inverse, and applications ». Linear and Multilinear Algebra 60, n^o 1 (janvier 2012) : 39–63. http://dx.doi.org/10.1080/03081087.2011.559167.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

37

Abbes, Samy. « Introduction to Probabilistic Concurrent Systems ». Fundamenta Informaticae 187, n^o 2-4 (19 octobre 2022) : 71–102. http://dx.doi.org/10.3233/fi-222133.

Texte intégral

Résumé :

The first part of the paper is an introduction to the theory of probabilistic concurrent systems under a partial order semantics. Key definitions and results are given and illustrated on examples. The second part includes contributions. We introduce deterministic concurrent systems as a subclass of concurrent systems. Deterministic concurrent system are “locally commutative” concurrent systems. We prove that irreducible and deterministic concurrent systems have a unique probabilistic dynamics, and we characterize these systems by means of their combinatorial properties. ACM CSS: G.2.1; F.1.1

Styles APA, Harvard, Vancouver, ISO, etc.

38

Sproston, Jeremy. « Probabilistic Timed Automata with Clock-Dependent Probabilities ». Fundamenta Informaticae 178, n^o 1-2 (13 janvier 2021) : 101–38. http://dx.doi.org/10.3233/fi-2021-2000.

Texte intégral

Résumé :

Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a variant of probabilistic timed automata in which transition probabilities can depend linearly on clock values. Clock-dependent probabilistic timed automata allow the modelling of a continuous relationship between time passage and the likelihood of system events. We show that the problem of deciding whether the maximum probability of reaching a certain location is above a threshold is undecidable for clock-dependent probabilistic timed automata. On the positive side, we show that the maximum and minimum probability of reaching a certain location in clock-dependent probabilistic timed automata can be approximated using a region-graph-based approach.

Styles APA, Harvard, Vancouver, ISO, etc.

39

Krishna, A. V. N. « Probabilistic (Multiple Cipher) Based ECC Mechanism ». Journal of Discrete Mathematical Sciences and Cryptography 15, n^o 6 (décembre 2012) : 323–38. http://dx.doi.org/10.1080/09720529.2012.10698385.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

40

Michener, H. Andrew, et Wing Tung Au. « A probabilistic theory of coalition formation inn‐person sidepayment games ». Journal of Mathematical Sociology 19, n^o 3 (août 1994) : 165–88. http://dx.doi.org/10.1080/0022250x.1994.9990142.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

41

FREIVALDS, RŪSIŅŠ. « NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA ». International Journal of Foundations of Computer Science 19, n^o 03 (juin 2008) : 565–80. http://dx.doi.org/10.1142/s0129054108005826.

Texte intégral

Résumé :

Size (the number of states) of finite probabilistic automata with an isolated cut-point can be exponentially smaller than the size of any equivalent finite deterministic automaton. However, the proof is non-constructive. The result is presented in two versions. The first version depends on Artin's Conjecture (1927) in Number Theory. The second version does not depend on conjectures not proved but the numerical estimates are worse. In both versions the method of the proof does not allow an explicit description of the languages used. Since our finite probabilistic automata are reversible, these results imply a similar result for quantum finite automata.

Styles APA, Harvard, Vancouver, ISO, etc.

42

Quick, Martyn. « Probabilistic Generation of Wreath Products of Non-abelian Finite Simple Groups ». Communications in Algebra 32, n^o 12 (31 décembre 2004) : 4753–68. http://dx.doi.org/10.1081/agb-200036751.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

43

Adell, José A., et Alberto Lekuona. « A probabilistic generalization of the Stirling numbers of the second kind ». Journal of Number Theory 194 (janvier 2019) : 335–55. http://dx.doi.org/10.1016/j.jnt.2018.07.003.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

44

Liebeck, Martin W., et Aner Shalev. « Simple Groups, Probabilistic Methods, and a Conjecture of Kantor and Lubotzky ». Journal of Algebra 184, n^o 1 (août 1996) : 31–57. http://dx.doi.org/10.1006/jabr.1996.0248.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

45

Brown, Kenneth S. « The Coset Poset and Probabilistic Zeta Function of a Finite Group ». Journal of Algebra 225, n^o 2 (mars 2000) : 989–1012. http://dx.doi.org/10.1006/jabr.1999.8221.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

46

Fulman, Jason. « Finite Affine Groups : Cycle Indices, Hall–Littlewood Polynomials, and Probabilistic Algorithms ». Journal of Algebra 250, n^o 2 (avril 2002) : 731–56. http://dx.doi.org/10.1006/jabr.2001.9104.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

47

Huynh, Dung T., et Lu Tian. « On Some Equivalence Relations for Probabilistic Processes1 ». Fundamenta Informaticae 17, n^o 3 (1 septembre 1992) : 211–34. http://dx.doi.org/10.3233/fi-1992-17304.

Texte intégral

Résumé :

In this paper, we investigate several equivalence relations for probabilistic labeled transition systems: bisimulation equivalence, readiness equivalence, failure equivalence, trace equivalence, maximal trace equivalence and finite trace equivalence. We formally prove the inclusions (equalities) among these equivalences. We also show that readiness, failure, trace, maximum trace and finite trace equivalences for finite probabilistic labeled transition systems are decidable in polynomial time. This should be contrasted with the PSPACE completeness of the same equivalences for classical labeled transition systems. Moreover, we derive an efficient polynomial time algorithm for deciding bisimulation equivalence for finite probabilistic labeled transition systems. The special case of initiated probabilistic transition systems will be considered. We show that the isomorphism problem for finite initiated labeled probabilistic transition systems is NC(1) equivalent to graph isomorphism.

Styles APA, Harvard, Vancouver, ISO, etc.

48

Mo, Hongming. « An Emergency Decision-Making Method for Probabilistic Linguistic Term Sets Extended by D Number Theory ». Symmetry 12, n^o 3 (3 mars 2020) : 380. http://dx.doi.org/10.3390/sym12030380.

Texte intégral

Résumé :

Emergency decision-making has become as one of the hot issues in recent years. The aim of emergency decision-making is to reduce the casualties and property losses. All the processes of emergency decision-making are full of incompleteness and hesitation. The problem of emergency decision-making can be regarded as one of the multi-attribute decision-making (MADM) problems. In this manuscript, a new method to solve the problem of emergency decision-making named D-PLTS is proposed, based on D number theory and the probability linguistic term set (PLTS). The evaluation information given by experts is tidied to be the form of PLTS, which can be directly transferred to the form of the D number, no matter whether the information is complete or not. Furthermore, the integration property of D number theory is carried out to fuse the information. Besides, two examples are given to demonstrate the effectiveness of the proposed method. Compared with some existing methods, the D-PLTS is more straightforward and has less computational complexity. Allocation weights that are more reasonable is the future work for the D-PLTS method.

Styles APA, Harvard, Vancouver, ISO, etc.

49

Zhang, Huiming. « On Nonnegative Integer-Valued Lévy Processes and Applications in Probabilistic Number Theory and Inventory Policies ». American Journal of Theoretical and Applied Statistics 2, n^o 5 (2013) : 110. http://dx.doi.org/10.11648/j.ajtas.20130205.11.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

50

Markov, Boris A., et Yury I. Sukharev. « Probabilistic and dynamic colloid equations ». Butlerov Communications 57, n^o 3 (31 mars 2019) : 33–41. http://dx.doi.org/10.37952/roi-jbc-01/19-57-3-33.

Texte intégral

Résumé :

We obtained two equations that characterize the structure of the colloid: the equation of the Schrodinger type that specifies the redistribution of heat and potential energy in the colloid and material equation – the diffusion equation with the operator of Liesegang associated directly with a substance that allows you to find the discontinuities of the structures caused by the vibrations of electrically charged particles. This procedure based on the assumption of the instability of the colloidal state, caused by the movement of charged particles. The reality is not collected in parts from the particles of matter in the course of evolution from the past to the future, and is all at once from the past to the future for a given pattern, that is, for specific PATTERNS, as defined by quantum theory. Without going deep into the theory of Kulakov, we will accept its fundamental provisions as a certain given. The forms of this structural data were obtained experimentally and mathematically confirmed. Let there be a certain angle of the skeleton, where due to the unevenness and partial randomness of the structure of the core grids forms "defects" – that is, electrical or magnetic moments of a particular order. Then small mobile clusters are attracted to it by electrostatic or electromagnetic forces, which are then adsorbed and somehow arranged on the "defects" in accordance with their dipole moments. This circumstance can be determined by "magic numbers", that is, as the number of clusters "stuck" to the defect of the core structure, with the formation of chemical bonds in the future. We can assume that the spanning structure of Coxeter can form small clusters form regular polyhedrons, and may occur or other structure having more complicated form.

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!