Registered Data

[CT002]


  • Session Time & Room
    • CT002 (1/1) : 2C @G301 [Chair: Akanksha Singh]
  • Classification
    • CT002 (1/1) : General logic (03B) / Enumerative combinatorics (05A) / Combinatorics (05-)

[00017] Modified Operational Laws for Neutrosophic Numbers in Decision-Making Problems

  • Session Time & Room : 2C (Aug.22, 13:20-15:00) @G301
  • Type : Contributed Talk
  • Abstract : This presented work results from the study of the existing basic operational laws of neutrosophic numbers which had some shortcomings clearly stating that these are the special type of neutrosophic numbers and not applicable in every practical situation. To overcome this limitation the general basic operational laws of neutrosophic numbers are proposed in this paper and a numerical example from a real-life situation has been solved optimally to show the validity of the proposed neutrosophic numbers laws.
  • Classification : 03B52, 03B52, 15B15, 28E10
  • Format : Talk at Waseda University
  • Author(s) :
    • Akanksha Singh (Chandigarh University)

[00092] The explicit formulae for the distributions of words

  • Session Time & Room : 2C (Aug.22, 13:20-15:00) @G301
  • Type : Contributed Talk
  • Abstract : The distributions of the number of words play key roles in information theory, statistics, and DNA analysis. Bassino et al. 2010, Regnier et al. 1998, and Robin et al. 1999 showed generating functions of the distributions in rational forms. However, we can not expand rational functions except for simple cases and do not have explicit formulae for the distributions from them. 
We show the explicit formulae for the distributions of words for the Bernoulli models.
  • Classification : 05A05, 05A15, 60C05, 62E15
  • Format : Talk at Waseda University
  • Author(s) :
    • Hayato Takahashi (Random Data Lab. Inc. )

[02538] Probabilistic proofs for some important combinatorial identities

  • Session Time & Room : 2C (Aug.22, 13:20-15:00) @G301
  • Type : Contributed Talk
  • Abstract : Combinatorial identities involving binomial coefficients are very useful in various areas of applied mathematics, especially in discrete mathematics. Using a probabilistic approach, we present simple proofs for some important combinatorial identities involving moments of the gamma, normal, and chi-squared random variates. Some generalizations and interpretations are also given.
  • Classification : 05A19, 05A10, 33B15, 60C05, 62E15
  • Format : Online Talk on Zoom
  • Author(s) :
    • Ashok Kumar Pathak (Central University of Punjab, Bathinda)

[02359] A Weighted Max-Min Model for Stochastic Fuzzy Multi-Objective Supplier Selection in a Supply Chain

  • Session Time & Room : 2C (Aug.22, 13:20-15:00) @G301
  • Type : Contributed Talk
  • Abstract : This research is focused on the study of Nonsymmetrical Stochastic Fuzzy Multi-Objective Supplier Selection Linear Programming (SFMOSSLP) with objective and constraint functions containing fuzzy parameters and random variables. This study aimed to develop an algorithm to transform the SFMOSSLP into a Deterministic Single-Objective Linear Programming (DSOLP) using the weighted max-min method so it can be easy to solve using the simplex method. In the end, we showcase the algorithm's performance and discuss its practicality.
  • Classification : 03B52, 03E72, 90C05, 90C15, 60G07
  • Author(s) :
    • Grandianus Seda Mada (Universitas Gadjah Mada)
    • Nugraha K. F. Dethan (Universitas Timor)
    • Julius Aloysius Nenoharan (Universitas Timor)

[02653] Random generation of Phylogenetic networks

  • Session Time & Room : 2C (Aug.22, 13:20-15:00) @G301
  • Type : Contributed Talk
  • Abstract : Phylogenetic networks are complex structures used to represent evolutionary histories with reticulate events. Random generation of such networks is a fundamental problem in phylogenetics, as it allows for the exploration of the space of possible networks and can provide insights into the properties of the space. In this paper, we present a new algorithm for the random generation of phylogenetic networks with Boltzmann sampling. The algorithm uses a probabilistic model based on the decomposition of a network into smaller subnetworks, which are then sampled independently. The Boltzmann factor is used to control the frequency of the different subnetwork types in the generated network ensemble. We show that our algorithm is efficient, accurate and can generate diverse sets of networks with different properties. Our algorithm is expected to be useful in various applications, such as testing the performance of phylogenetic methods, exploring the space of evolutionary histories, and simulating reticulation events in biological systems.
  • Classification : 05-xx
  • Author(s) :
    • Marefatollah Mansouri (University of Vienna )