Registered Data

[CT160]


  • Session Time & Room
    • CT160 (1/1) : 3E @D502 [Chair: Elaine M. Raybourn]
  • Classification
    • CT160 (1/1) : Social and behavioral sciences: general topics (91C) / Operations research, mathematical programming (90-) / Geometry education (97G)

[02661] Practicing Responsible Computation and Innovation in HPC: A Sociotechnical Approach

  • Session Time & Room : 3E (Aug.23, 17:40-19:20) @D502
  • Type : Industrial Contributed Talk
  • Abstract : Recent advances in high performance computing (HPC) and artificial intelligence (AI) have reignited discussions for more responsible and ethical computing regarding the use and design of HPC sociotechnical ecosystems within the context of cultures and evolving societal norms. This contributed talk provides practical guidelines derived from computational and social science that scientists, educators, and practitioners alike can employ to become more aware of personal values that may unconsciously shape approaches to computation and ethics.
  • Classification : 91C99, 68-01, 68-04, 68N01, ethics, sociotechnical approach, responsible computing
  • Format : Talk at Waseda University
  • Author(s) :
    • Elaine M. Raybourn (Sandia National Laboratories)
    • Osni Marques (Lawrence Berkeley National Laboratory)
    • Killian Muollo (Sandia National Laboratories)

[00301] On some modifications in the conjugate gradient method and its application in unconstrained optimization problems

  • Session Time & Room : 3E (Aug.23, 17:40-19:20) @D502
  • Type : Contributed Talk
  • Abstract : Conjugate gradient (CG) methods are preferably used to solve large-scale unconstrained optimization problems due to strong local and global convergence properties and low memory requirements. To enhanse its convergence, we introduce an improved hybrid form of the conjugate gradient method in this work. We propose a new form of CG parameter (βk), combining the Fletcher Reeves (FR) and three-term search directions. Our proposed search directions formula satisfies the sufficient descent condition independent of any line search and are bounded. For the global convergence, some proper assumptions on the objective function and its gradient have been taken into account, which fulfills the strong Wolfe-Powell line search conditions. Finally, numerical experiments have been carried out on some standard benchmark test functions and compared with other CG methods from the literature to check the validity of the proposed algorithm. Numerical results guarantee the efficiency and robustness of our proposed CG method.
  • Classification : 90-XX, 90C26, 90C30, 90bxx, 90-08
  • Format : Online Talk on Zoom
  • Author(s) :
    • Sweta Kumari (Birla Institute of Technology Mesra, Ranchi)
    • Darakhshan Jabeen Syeda (Birla Institute of Technology Mesra, Ranchi)

[01303] Partially Mixed Cooperative Strategies in Evolutionary Games on Networks

  • Session Time & Room : 3E (Aug.23, 17:40-19:20) @D502
  • Type : Contributed Talk
  • Abstract : Cooperation is fundamental for the development of human societies. Different approaches have been proposed to explain the emergence of cooperation or partial cooperation in populations of individuals playing classical types of games. In this talk, we analyze the emergence of a new kind of cooperation, where we have a set of full cooperators and one of the partial ones, for the classical games. We prove conditions for Nash equilibria to be asymptotically stable.
  • Classification : 91CXX
  • Format : Online Talk on Zoom
  • Author(s) :
    • Jean Carlo Moraes (Universidade Federal do Rio Grande do Sul)

[02381] Dynamic parking pricing for smart urban transportation system

  • Session Time & Room : 3E (Aug.23, 17:40-19:20) @D502
  • Type : Contributed Talk
  • Abstract : Traffic jam is one of the critical challenges of an urban city. Researchers have reported that search for a parking space significantly contributes to this problem. By having a dynamic pricing depending on the demand, this challenge can partially be addressed by filtering customers to move to other non-demanding parking spaces or look for cost reasonable options. Furthermore, parking places will compete to maximize their profit. Hence, a game theoretic or hierarchical decision making model can best describe the scenario. Bounded by the allowed maximum parking pricing, perhaps set by the city administration, and the minimum price to stay in business, this paper models a dynamic parking pricing as a price-wise continuous multilevel decision making problem.
  • Classification : 90-XX, 90B06, 00A69
  • Author(s) :
    • Surafel L Tilahun (Addis Ababa Science and Technology University)

[01102] Independent Study in Designing Mathematics Learning Using GeoGebra AR

  • Session Time & Room : 3E (Aug.23, 17:40-19:20) @D502
  • Type : Industrial Contributed Talk
  • Abstract : This research examines the implementation of one program from the Indonesian Ministry of Education, Culture, Research, and Technology, i.e., independent studies, in the Department of Mathematics Education at a public university in Langsa, Aceh, Indonesia. The activities focused on compiling learning designs that apply the GeoGebra Augmented Reality (AR) to geometrical concepts in secondary schools by adopting the ADDIE Model. The aim is for pre-service mathematics teachers to explore learning activities independently in mastering Technological Pedagogical Content Knowledge (TPACK) when teaching mathematics. Our findings suggest the implementation of such an independent study because of its advantages and program improvisation as a form of program development.
  • Classification : 97Gxx, 97Hxx, 97Uxx
  • Format : Online Talk on Zoom
  • Author(s) :
    • Guntur Maulana Muhammad (Universitas Samudra)
    • Natanael Karjanto (Sungkyunkwan University)
    • Iden Rainal Ihsan (Universitas Samudra)