Registered Data

[CT005]


  • Session Time & Room
    • CT005 (1/1) : 5C @G302 [Chair: Devsi Dudabhai Bantva]
  • Classification
    • CT005 (1/1) : Graph theory (05C) / Generalities, axiomatics, foundations of continuum mechanics of solids (74A) / Basic linear algebra (15A)

[00979] Optimal radio channel assignment to transmitters in a network by graph labeling approach

  • Session Time & Room : 5C (Aug.25, 13:20-15:00) @G302
  • Type : Contributed Talk
  • Abstract : An optimal radio channel assignment to transmitters in a network is modelled by graph labeling approach. A radio labeling of a graph $G$ is a mapping $f : V(G) \rightarrow \{0,1,2,\ldots\}$ satisfying $|f(u)-f(v)| \geq diam(G)+1-d(u,v)$ for all $u,v \in V(G)$. The radio number $rn(G)$ of $G$ is the smallest number $k$ such that $G$ has radio labeling $f$ with $\max\{f(v) : v \in V(G)\}=k$. We present our recent results on optimal radio labelings of graphs.
  • Classification : 05C78, 05C15, 05C12
  • Format : Talk at Waseda University
  • Author(s) :
    • Devsi Dudabhai Bantva (Lukhdhirji Engineering College, Morbi)

[00511] Metapopulation network models explain non-Poissonian statistics of intercontact times

  • Session Time & Room : 5C (Aug.25, 13:20-15:00) @G302
  • Type : Contributed Talk
  • Abstract : Intercontact times in empirical data obtained from humans and animals typically obey heavy-tailed distributions as opposed to exponential distributions that would correspond to Poisson processes. We show that this phenomenon is a mathematical property of a most basic metapopulation network model used in epidemiology and ecology modeling, in which individuals move from a patch to another according to the simple or other types of random walks. Our results hold true for any network structure.
  • Classification : 05C82, 60K20
  • Format : Talk at Waseda University
  • Author(s) :
    • Elohim Fonseca dos Reis (State University of New York at Buffalo)
    • Naoki Masuda (State University of New York at Buffalo)

[00451] Transmission problems for composite layered elastic structures containing interfacial cracks

  • Session Time & Room : 5C (Aug.25, 13:20-15:00) @G302
  • Type : Contributed Talk
  • Abstract : We investigate mixed transmission problems of the generalized thermo-electro-magneto elasticity theory for complex elastic multi-layered structures containing interfacial cracks. We apply the potential method and the theory of pseudodifferential equations and analyze smoothness properties and asymptomatic behaviour of solutions near the edges of cracks and near the curves where different type boundary conditions collide. We describe the stress singularity exponents explicitly.
  • Classification : 74A15, 74H35, 74F05, 74F15
  • Format : Talk at Waseda University
  • Author(s) :
    • David Natroshvili (Georgian Technical University)

[00902] Influence of the statistical parameters of random particulate materials on wave propagation

  • Session Time & Room : 5C (Aug.25, 13:20-15:00) @G302
  • Type : Contributed Talk
  • Abstract : Current models predicting the effective properties of random particulate materials neglect the correlation between the particles positions by using the hole correction approximation. A recent method which predicts more than one effective wavenumber is adapted in order to take into account these correlations. The method is validated against Monte-Carlo simulations and the influence of the correlations is demonstrated with computed effective wavenumbers.
  • Classification : 74A40, 78A48, 82D30
  • Format : Talk at Waseda University
  • Author(s) :
    • Kevish Kumar Napal (University of Sheffield)
    • ARTUR LEWIS GOWER (University of Sheffield)
    • Paulo Sergio Piva (The University of Sheffield)
    • Aristeidis Karnezis (The University of Sheffield)

[02254] Optimized first order alternating algorithms for fast and accurate low rank tensor decomposition

  • Session Time & Room : 5C (Aug.25, 13:20-15:00) @G302
  • Type : Contributed Talk
  • Abstract : CP tensor decomposition has been proven to be a powerful tool for extracting information from large high order tensor, being widely applied in many areas such as chemistry, biology and medical science. However, efficiently computing the CP tensor still remains a challenge. In this study, we propose some optimized first order alternating least square algorithms for low rank tensor decomposition. We validate and illustrate the proposed algorithms by using simulated and real multi-way data.
  • Classification : 15A72, 15A69, 65Z05
  • Format : Talk at Waseda University
  • Author(s) :
    • HUIWEN YU (Aarhus University)
    • Ove Christiansen (Aarhus University)