Title: |
Effectiveness of Educational Virtual Worlds in the Metaverse A Study Based on the ARCS Model |
Authors: |
Dimitrios Magetos, Prof. Sarandis Mitropoulos |
Source: |
International Journal of Latest Engineering Research and Applications, pp 01 - 10, Vol 10 - No. 06, 2025 |
Abstract: |
The digital revolution and the development of Web 3.0 have radically transformed the landscape of education, with virtual worlds and the Metaverse emerging as promising tools for enhancing the learning experience. This study evaluates the effectiveness of an educational virtual world for teaching basic computer technology concepts to middle school students, using Keller's ARCS model. The study involved 60 middle school students (aged 12-15) who attended corresponding courses in a virtual environment in the metaverse Spatial.io. Access to the virtual environment was through the school laboratory infrastructure and only through computers, without the use of specialized immersion equipment such as HDM or specialized VR devices. Data were collected through an ARCS questionnaire with a 5-point Likert scale. All ARCS dimensions showed high scores (Attention: 4.22±0.84, Relevance: 4.12±0.76, Confidence: 3.80±1.02, Satisfaction: 4.24±0.80). Strong positive correlations were also found between all dimensions (r=0.52-0.74, p<0.01). The educational virtual world proved to be effective in enhancing learning motivation, with the confidence dimension needing further improvement. |
Keywords: |
Virtual worlds, Metaverse, ARCS, Web, AR, VR, Avatar, Spatial |
 |
Download Full Article |
DOI: |
10.56581/IJLERA.10.6.01-10 |
Title: |
Identifying Inverse Dominationin the Join of Two Graphs |
Authors: |
Rhia Mae Charis Ompoy, Margie L. Baterna, Grace M. Estrada, Mark Kenneth C. Engcot, Enrico L. Enriquez |
Source: |
International Journal of Latest Engineering Research and Applications, pp 11 - 18, Vol 10 - No. 06, 2025 |
Abstract: |
Let G=(V G ,E(G)) be a nontrivial connected simple graph. A subset S of V G is a dominating set of G if for every v∈V G ∖S, there exists x∈S such that xv ∈E G .Let D be a minimum dominating set of G. If S⊆V(G)\D is a dominating set of G, then S is called an inverse dominating set with respect to D. An inverse dominating set S⊆V G ∖D is an identifying inverse dominating set of G if for every v∈V(G), NG[v] ∩S is distinct. The minimum cardinality of an identifying inverse dominating set of G, denoted by γID(−1)(G), is called the identifying inverse domination number of G. In this paper, we give the identifying inverse dominating set and the identifying inverse domination number in the join of two connected nontrivial graphs. |
Keywords: |
dominating set, identifying code, inverse dominating set, join of two graphs |
|
Download Full Article |
DOI: |
10.56581/IJLERA.10.6.11-18 |
Title: |
Risk Analysis of the Coastal Protection Embankment Construction Project (Revetment Type) in Buol Regency |
Authors: |
Tutang Muhtar Kamaludin, Setiyawan, Muhammad Zaki |
Source: |
International Journal of Latest Engineering Research and Applications, pp 19 - 27, Vol 10 - No. 06, 2025 |
Abstract: |
The dangers that could arise in a production project are, design planning elements, creation safety elements, human useful resource elements, cloth and equipment elements, monetary, market and financial elements, dating and coordination factors, environmental factors, and legality/settlement, settlement and political factors. This study objectives to determine what risks can occur and to determine the evaluation and coping with of risks that have an effect on the development of coastal protection embankments (Revetment kind). The technique used is statistics collection via distributing questionnaires, carrying out information tabulation, descriptive statistics, reliability trying out, risk evaluation, danger response and chance manipulate. The dangers that affect are climate conditions and unsure situations, fabric rate increases, delays in cloth delivery, slim venture vicinity situations and human mistakes. dealing with of the above dangers includes reducing risk, avoiding risk, transferring danger and accepting danger. |
Keywords: |
Risk, Factors, Project, Revtment, Conditions |
|
Download Full Article |
DOI: |
10.56581/IJLERA.10.6.19-27 |
Title: |
Outer-Connected Fair Domination in the Join of Two Graphs |
Authors: |
Rene L. Duhilag Jr., Margie L. Baterna, Grace M. Estrada, Mark Kenneth C. Engcot, Enrico L. Enriquez |
Source: |
International Journal of Latest Engineering Research and Applications, pp 28 - 36, Vol 10 - No. 06, 2025 |
Abstract: |
Let G=(V G ,E(G)) be a nontrivial connected simple graph. A subset S of V G is a dominating set of G if for every v∈V G ∖S, there exists x∈S such that xv ∈E G . A set S⊆V G is said to be an outer-connected dominating set in G if S is dominating and either S=V G or V G ∖S is connected. A fair dominating set in graph G is a dominating set S such that all vertices in V(G)∖S are dominated by the equal number of vertices in S. A nonempty subset S⊆V (G) is an outer-connected fair dominating set of G, if S is a fair dominating set of G and the subgraph V G ∖S induced by V G ∖S is connected. The outer-connected fair domination number of G is the minimum cardinality of an outer-connected fair dominating set of G, denoted by γcfd(G).In this paper, we give the outer-connected fair dominating set and the outer-connected fair domination number in the join of two connected noncomplete graphs. |
Keywords: |
corona, dominating set, join, fair, outer-connected |
|
Download Full Article |
DOI: |
10.56581/IJLERA.10.6.28-36 |