Efficiently solving the problem of computing, in a distributed fashion, the shortest paths of a graph whose topology dynamically changes over time is a core functionality of many today’s digital infrastructures, probably the most prominent example being communication networks. Many solutions have been proposed over the years for this problem that can be broadly classified into two categories, namely Distance-Vector and Link-State algorithms. Distance-Vector algorithms are widely adopted solutions when scalability and reliability are key issues or when nodes have either limited hardware resources, as they result in being very competitive approaches in terms of both the memory and the computational point of view. In this paper, we first survey some of the most established solutions of the Distance-Vector category. Then, we discuss some recent algorithmic developments in this area. Finally, we propose a new experimental study, conducted on a prominent category of network instances, namely generalized linear preference (GLP) power-law networks, to rank the performance of such solutions.

There has been a recent revival of interest in the notion of a `trajectory' of a quantum particle. In this paper we detail the relationship between Dirac's ideas, Feynman paths and the Bohm approach. The key to the relationship is the weak value of the momentum which Feynman calls a transition probability amplitude. With this identification we are able to conclude that a Bohm `trajectory' is the average of an ensemble of actual individual stochastic Feynman paths. This implies that they can be interpreted as the mean momentum flow of a set of individual quantum processes and not the path of an individual particle. This enables us to give a clearer account of the experimental two-slit results of Kocsis {\em et al.}}

The arranged paths of dominoes have many shapes. The scaling law for the propagation speed of domino toppling has been extensively investigated. However, in all previous investigations, the scaling law for the velocity of domino toppling motion in curved lines was not taken into account. In the present work, the finite-element analysis (FEA) program ABAQUS was used to study the velocity of domino toppling motion in curved lines. It is shown that the domino propagation speed has a rising trend with increasing domino spacing in a straight line. It is also found that domino propagation speed is linearly proportional to the square root of domino separation. This research proved that the scaling law for the speed of domino toppling motion given by Sun (2020) is true [B-H. Sun, 2020. Scaling law for the propagation speed of domino toppling. AIP Advances, 10(9),095124.]. Moreover, the shape of domino arrangement paths has no influence on the scaling law for the propagation speed of dominoes but can affect the coefficient of the scaling law for the velocity. Therefore, the amendatory function for the propagation speed of dominoes in curved lines was formulated by the FEA data. The fitted amendatory function, $\varphi_{revise}$, provides the simple method for a domino player to quickly estimate the propagation speed of dominoes in curved lines.

Physical measurements might display range values extending towards infinite. The occurrence of infinity in physical equations, such as the black hole singularities, is a troublesome issue that causes many theories to break down when assessing extreme events. Different methods, such as re-normalization, have been proposed to avoid detrimental infinity. Here a novel technique is proposed, based on physical geometrical considerations and the Alexander Horned sphere, that permits to undermine infinity in physical equations. In this unconventional approach, a continuous monodimensional line becomes an assembly of countless bidimensional lines that superimpose in quantifiable knots and bifurcations.

To sample from complex, high-dimensional distributions, one may choose algorithms based on the Hybrid Monte Carlo (HMC) method. HMC-based algorithms generate nonlocal moves alleviating diffusive behavior. Here, I build on an already defined HMC framework, Hybrid Monte Carlo on Hilbert spaces [A. Beskos, F.J. Pinski, J.-M. Sanz-Serna and A.M. Stuart, Stoch. Proc. Applic. 121, 2201 - 2230 (2011); doi:10.1016/j.spa.2011.06.003] that provides finite-dimensional approximations of measures π which have density with respect to a Gaussian measure on an infinite-dimensional Hilbert (path) space. In all HMC algorithms, one has some freedom to choose the mass operator. The novel feature of the algorithm described in this article lies in the choice of this operator. This new choice defines a Markov Chain Monte Carlo (MCMC) method which is well defined on the Hilbert space itself. As before, the algorithm described herein uses an enlarged phase space Π having the target π as a marginal, together with a Hamiltonian flow that preserves Π. In the previous method, the phase space π was augmented with Brownian bridges. With the new choice for the mass operator, π is augmented with Ornstein-Uhlenbeck (OU) bridges. The covariance of Brownian bridges grows with its length, which has negative effects on the Metropolis-Hasting acceptance rate. This contrasts with the covariance of OU bridges which is independent of the path length. The ingredients of the new algorithm include the definition of the mass operator, the equations for the Hamiltonian flow, the (approximate) numerical integration of the evolution equations, and finally the Metropolis-Hastings acceptance rule. Taken together, these constitute a robust method for sampling the target distribution in an almost dimension-free manner. The behavior of this novel algorithm is demonstrated by computer experiments for a particle moving in two dimensions, between two free-energy basins separated by an entropic barrier.

Holistic information integrity for managing wicked problems, developing equity is getting attention. Artifitial intelligence based topologies, dual sensor-information nodes, are prototyped to offer more availability, reliability, maintainability for operating healthy urbanism. Bipartite spider-webs, cube-connected cycles are aimed in ‘the radial-ring urban-building skeleton’ and ‘wetlands and sparsely populated areas’, respectively. Furthermore, honeycomb tori, mathematical HT(m), m≥2, for tasks related to wireless communications, are found having two mutually independent Hamiltonian paths (MIHP). This parallelism creates dual cipher-coding, supports logistic privacy, and help prevent information loss, electromagnetic interference, unexpected changes caused by such as clogged water.

Abstract: Our goal is to create point-of-care (POC) strategies that accelerate decision making, increase efficiency, improve outcomes, and enhance standards of care in island communities faced with global warming, rising oceans, population migration, and intensifying weather disasters. We assessed needs in the Bantayan Archipelago and mainland Cebu Province, Visayas Islands, Philippines, to map POC diagnostics, rescue times, and spatial care paths. Significant deficiencies were lack of cardiac troponin testing for rapid diagnosis of acute myocardial infarction, absence of blood gas and pH testing for support of critically ill patients, and geographic gaps prolonging patient transfers and delaying treatment. Strengths comprised primary care that can be facilitated by POC testing, logical inter-island transfers for which decision making and triage could be accelerated with onboard diagnostic testing, and healthcare small-world networks amenable to POC advances, such as pre-hospital testing, that avoid overloading emergency rooms. Healthcare resources must be distributed to archipelago islands, not concentrated in large metropolitan areas inaccessible for emergency interventions. We conclude that a point-of-need focus will help improve public health, decrease disparities in mortality among rural islanders versus urban dwellers, and pave the way for heightened resilience in anticipation of the adverse impact of global warming on vulnerable coastal areas.

In a rapidly evolving educational and economic landscape, exacerbated by the unforeseen ripple effects of the pandemic, this qualitative tracer study, encompassing 30 alumni participants from batches 2017 to 2022, delves into the professional journeys of College of Arts and Sciences alumni from St. Michael's College in Iligan City, Philippines. Combining in-depth literature reviews, astute observations, insightful informal interviews, and rigorous thematic analysis, this research unveils invaluable insights. The findings resonate with a clarion call for educational institutions to synchronize curricula with industry requisites, nurturing graduates with the critical thinking and communication skills imperative for heightened employability. Amidst this voyage, it becomes evident that personal aspirations wield remarkable influence in carving distinct career trajectories, underscoring the indispensable role of comprehensive career guidance and counseling within educational domains. Noteworthy is the profound impact of the ever-changing economic dynamics of the Philippines on the employability of these alumni, demanding perpetual adaptation in educational paradigms. Remarkably, the collective contributions of these graduates span diverse academic programs, attesting to their positive workforce imprint. Further exploration reveals a substantial proportion engaging in post-graduate education and training to enrich their qualifications. In a remarkable testament to their educational journey, alumni manifest a notably high level of job satisfaction, buoyed by facets like work-life equilibrium and employment stability. Overall, this tracer study is poised to drive transformative shifts in higher education, advocating for curricular harmonization, amplified career support, holistic skill cultivation, resilience to economic fluctuations, and sustained research to remain aligned with the dynamic job market. It serves as a catalyst in shaping an empowered, content, and adaptive workforce for tomorrow's challenges and opportunities.

The COVID-19 pandemic may have increased interpersonal and intimate violence, harmful use of alcohol and other drugs (AOD), and mental health problems. The present study uses a valid path model to describe relationships between these conditions of young Mexicans during the second year of the pandemic. A sample of 7,420 young Mexicans ages 18 to 24—two-thirds of whom were women—completed the Life Events Checklist, the Alcohol, Smoking, and Substance Involvement Screening Test, the Major-Depressive-Episode Checklist, the Generalized Anxiety Scale, and the Posttraumatic Stress Disorder (PTSD) Checklist. Young Mexicans reported higher rates of victimization and perpetration of interpersonal and intimate violence and mental health symptomatology than those noted pre-pandemic and in the first year of the pandemic. Harmful use of AOD rates were like those reported by adolescents before. Findings suggested asymmetric victimization and perpetration of intimate violence by gender (with women being at a higher risk than men, p≤.05). More men than women engaged in the harmful use of AOD (except for sedatives, which more women abuse). In contrast, more women than men were at risk of all mental health conditions. The path model indicates that being a victim of intimate violence predicts harmful use of tobacco, alcohol, cocaine, and sedatives, depression, anxiety, and specific PTSD symptoms (such as re-experimentation and avoidance symptoms). Being a victim of interpersonal violence resulted in severe PTSD symptoms (including avoidance, negative alterations in cognition-mood, and hyperarousal signs). Harmful use of sedatives predicted depressive symptoms. Men´s victimizing intimate violence model contrasted with that of women, which also included being the victim of interpersonal violence and severe PTSD symptoms. The high school youth model had three paths -victimizing-intimate violence, victimizing-interpersonal abuse, and sedative use, which predicted depression. The findings of this study could serve as the basis for future studies exploring mechanisms that predict violence patterns to develop the most cost-effective preventive programs and public policies and to address mental health conditions during community emergencies.

Abstract The modified Bessel function (MBF) of the first kind is a fundamental special function in mathematics with applications in a large number of areas. When the order of this function is integer, it has an integral representation which includes the exponential of the cosine function. Here we generalize this MBF to include a fractional parameter, such that the exponential in the previously mentioned integral is replaced by a Mittag-Leffler function. The necessity for this generalization arises from a problem of communication in networks. We find the power series representation of the fractional MBF of the first kind, as well as some differential properties. We give some examples of its utility in graph/networks analysis and mention some fundamental open problems for further investigation.

Numerous studies have shown the multiple benefits of plant biodiversity and the crucial role of resident’s awareness in conservation and land management. Plant biodiversity is investigated in an analytical monitoring report conducted jointly with local population engaged in livestock activities and the young residents who are shifting toward hospitality and tourism. The study area, covering over 800 km2 in Sardinia, is half forested and has landscape interest. During the research, genotypes of Quercus ilex L. with sweet acorns and richer in polyphenols were discovered, the oldest ecosystem services in those rural communities. Collaborative monitoring focused attention on the benefits of plants in different habitats: 53% of these have been known to livestock farmers as food for local breeds of goats and pigs; 15% are officinal and 13% endemic. They have also been used in human nutrition within the Mediterranean diet, and they have landscape and garden interest. The study analyzes numerical data from a critical and educational perspective. These data serve as indicators of ecosystem health for the purpose of sustainable management policies, and attest to collaborative monitoring as a tool for analyzing human activities and the necessary balance between profit and biodiversity conservation, given the current challenging climate change conditions.

The quickest path problem in the multistate flow networks, also known as the quickest path reliability problem (QPRP), aims at calculating the probability of transmitting a minimum of d units of flow/dat/commodity from a source node to a destination node through one single path within T units of time. Several exact and approximation algorithms have been proposed in the literature to address this problem. Most of the exact algorithms in the literature need prior knowledge of all the network’s minimal paths (MPs), which is considered a weak point. In addition to the time, the budget is always limited in real-world systems, making it an essential consideration in the analysis of systems’ performance. Hence, this study considers the QPRP under the cost constraints and provides an efficient approach based on the node-child matrix to address the problem without knowing the MPs. We show the correctness of the algorithm, compute its complexity results, illustrate it through a benchmark example, and conduct extensive experimental results on the known benchmarks and one thousand randomly generated test problems to demonstrate its practical superiority compared to the existing algorithms in the literature.

Routing a person through a traffic network presents a tension between selecting a fixed route that is easy to navigate and selecting an aggressively adaptive route that minimizes the expected travel time. We propose to create non-aggressive adaptive routes in the middle-ground seeking the best of both these extremes. Specifically, these routes still adapt to changing traffic conditions, however we limit the number of adjustments made in the route. This improves the user experience, by providing a continuum of options between saving travel time and minimizing navigation. We design strategies to model single and multiple route adjustments, and investigate enumerative techniques to solve these models. To alleviate the intractability with handling real-life traffic data, we develop efficient algorithms with easily computable lower and upper bounds. We finally present computational experiments highlighting the benefits of limited adaptability in terms of reducing the expected travel time.