This study assesses the effectiveness of HCV self-testing (HCVST) distribution models compared to provider-led HCV testing (PL-HCVT), including the standard of care facility-based HCVT (SOC-HCVT) and community-based organization HCVT (CBO-HCVT) among people who inject drugs (PWID) in Vietnam. A cross-sectional study was conducted as part of a larger implementation science study in Hanoi and Ho Chi Minh City from September 2023 to April 2024. We engaged 8 CBOs and 10 public and private clinics in offering choice of HCVST through community-based and facility-based distribution, and secondary distribution), or PL-HCVT via SOC-HCVT and CBO-HCVT. Among 1,165 PWID, 693 opted for HCVST and 472 for PL-HCVT. The proportion of first-time testers was significantly higher in HIVST community-based and secondary distribution as well as CBO-HCVT compared to SOC-HCVT and facility-based HCVST (87.1%, 93.3% and 82.7% vs. 41.9% and 35.7%, respectively; p < 0.001). Overall, HCV seropositivity rate was lower in HCVST than PL-HCVT, however, higher in HCVST facility-based and community-based distribution compared to HCVST secondary distribution (28.1% and 20.4% vs. 5.7%, respectively). Community-based HCVST was most effective, followed by facility-based HCVST and secondary distribution. Our findings indicate that HCVST effectively reaches first-time testers and results in more people diagnosed and treated among PWID.

Internet of things (IoT) is a network of smart things. This indicates the ability of these physical things to transfer information with other physical things. The characteristics of these networks, such as topology dynamicity and energy constraint, challenges the routing problem in these networks. Previous routing methods could not achieve the required performance in this type of network. Therefore, developers of this network designed and developed specific methods in order to satisfy the requirements of these networks. One of the routing methods is utilization of multi-path protocols which send data to its destination using routes with separate links. One of such protocols is AOMDV routing protocol. In this paper, this method is improved using gray system theory which chooses the best paths used for separate routes to send packets. To do this, AOMDV packet format is altered and some fields are added to it so that energy criteria, link expiration time, and signal to noise ratio can also be considered while selecting the best route. The proposed method named RMPGST-IoT is introduced which chooses the routes with highest rank for concurrent transmission of data, using a specific routine based on the gray system theory. In order to evaluate and report the results, the proposed RMPGST-IoT method is compared to the ERGID and ADRM-IoT approaches with regard to throughput, packet receiving rate, packet loss rate, average remaining energy, and network lifetime. The results demonstrate the superior performance of the proposed RMPGST-IoT compared to the ERGID and ADRM-IoT approaches.

Internet of things (IoT) is a network of smart things. This indicates the ability of these physical things to transfer information with other physical things. IoT has introduced various services and daily human life depends on its reliable and accessible operation. The characteristics of these networks, such as topology dynamicity and energy constraint, challenges the routing problem in these networks. Previous routing methods could not achieve the required performance in this type of network. Therefore, developers of this network designed and developed specific methods in order to satisfy the requirements of these networks. One of the routing methods is utilization of multi-path protocols which send data to its destination using routs with separate links. One of such protocols is AOMDV routing protocol. AOMDV protocol is a multi-path protocol which uses multiple different paths for sending information in order to maintain the network traffic balance, manage and control node energy, decrease latency, etc. In this paper, this method is improved using gray system theory which chooses the best paths used for separate routes to send packets. To do this, AOMDV packet format is altered and some fields are added to it so that energy criteria, link expiration time, and signal to noise ratio can also be considered while selecting the best route. The proposed method named GSTMPR-IoT is introduced which chooses the routs with highest rank for concurrent transmission of data, using a specific routine based on the gray system theory. In order to evaluate and report the results, the proposed GSTMPR-IoT method is compared to the EECRP and AOMDV approaches with regard to throughput, packet delivery rate, end to end delay, average residual energy, and network lifetime. The results demonstrate the superior performance of the proposed GSTMPR-IoT compared to the EECRP and AOMDV approaches.

Transportation is a crucial component of supply chain management, responsible for delivering goods and services to customers. This paper explores the application of game theory concepts, precisely the Shapley value, to cost allocation in transportation operations involving drones and trucks. Our focus is on shortest-path games in which agents own nodes in a network and seek to transport items between nodes at the lowest possible cost. We provide a comprehensive literature review of the Shapley value and its use in shortest-path games, with particular emphasis on transportation networks. Our proposed model includes sets of customers, drones, and trucks and uses binary decision variables to indicate whether a drone or truck serves a given customer. The objective is to minimize the total cost of serving all customers while adhering to capacity and synchronization constraints. We use the Shapley value to determine the contribution and cost-sharing of each drone and truck in serving the customers. Through a combination of denitions, theorems, and examples, we explore the formal meaning of the Shapley value and its relationship to shortest-path games in transportation networks. We highlight exceptional cases and considerations that must be taken into account when applying the Shapley value in such scenarios.

The rational design of magnetic carbon composites, encompassing both composition and microstructure, holds significant potential for achieving exceptional electromagnetic wave absorbing materials (EAMs). In this study, FeCo@CM composites was efficiently fabricated through an advanced microwave plasma assisted reduction chemical vapor deposition (MPARCVD) technique, offering high efficiency, low cost, and energy-saving benefits. By depositing graphitized carbon microspheres, the dielectric properties were significantly enhanced, resulting in improved electromagnetic wave absorption performances through optimized impedance matching and a synergistic effect with magnetic loss. A systematic investigation revealed that the laminar-stacked structure of FeCo exhibited superior properties compared to its spherical counterpart, supplying a higher number of exposed edges and enhanced catalytic activity, which facilitated the deposition of uniform and low-defect graphitized carbon microspheres. Consequently, the dielectric loss performance of the FeCo@CM composites was dramatically improved due to increased electrical conductivity and the formation of abundant heterogeneous interfaces. At a 40 wt% filling amount and a frequency of 7.84 GHz, the FeCo@CM composites achieved a minimum reflection loss value of -58.2 dB with an effective absorption bandwidth (fE) of 5.13 GHz. This study presents an effective strategy for developing high-performance EAMs.

The sensor nodes have limited computation, sensing, communication capabilities and generally operated by batteries in a harsh atmosphere with non-replenish able power sources. These limitations force the sensor network subject to failure because most of the energy is spent on sensing, computing and data transmission. This paper introduces an Energy Efficient Clustering and Shortest-Path Routing Protocol (EECSRP) to assist Wireless Sensor Networks (WSNs) by (a) extending the lifespan of the network (b) effectively using the battery power (c) decreasing the network overhead and (d) ensuring a high packet transmission ratio with minimal delay. The delay time-based Cluster Head (CH) is elected based on the node degree, residual energy and Received Signal Strength (RSS) to accomplish the goal. Additionally, the RSS-based network partitioning is implemented to evaluate the gradient based on demand routing between source (sensing node) and destination (BS). Whenever the current CH residual energy goes under the threshold level, the proposed protocol performs the clustering process, reducing the exchange of control packets. However, the BS periodically gathers the data from every single CH which helps to reduce the collision and Medium Access Control (MAC) layer conflict. From the simulation results, it is the evident that the proposed protocol performance in terms of average end-to-end latency, packet delivery ratio, average energy consumption and control overhead is better than the well-known current protocols.

Pheochromocytoma and sympathetic paraganglioma (PPGL) are rare neuroendocrine tumors characterized by catecholamine production in the adrenal medulla and extra-adrenal paraganglia. PPGL with metastasis was termed malignant PPGL. However, the distinction between “benign” and “malignant” PPGLs has been debated. Currently, all PPGLs are believed to have some metastatic potential and are assigned malignant tumors (ICD-O/3) by the WHO Classification of Endocrine Organs (2017, 4th edition). Therefore, the previous categories benign and malignant PPGL have been eliminated in favor of a risk stratification approach. The Grading of Adrenal Pheochromocytoma and Paraganglioma (GAPP) is a tool for risk stratification for predicting metastasis and the prognosis of patients. At least 30% of PPGLs are hereditary, with 20 genes identified and genotype-phenotype correlations clarified. Of these, VHL, RET, and NF1 have been well investigated and are the primary cause of bilateral PCC. In addition, succinate dehydrogenase gene subunits SDHB and SDHD are strongly correlated with extra-adrenal location, younger age, multiple tumors, metastasis, and poor prognosis. Disease stratification by catecholamine phenotype and molecular profiling correlates with histological grading by GAPP. PPGLs should be understood comprehensively based on clinical, biochemical, molecular, and pathological data for patient care. A flow chart for pathological diagnosis is included.

Personalized recommendation is an important part of ecommerce platform. In the recommendation system, the neural network is used to enhance collaborative filtering to accurately capture user preferences, so as to obtain better recommendation performance. Traditional recommendation methods focused on the results of a single user behavior, ignoring the modeling of multiple interactive behaviors of users, such as click, add to cart and purchase. Although many studies had also focused on Multi-Behavior modeling, two important challenges remained. 1)Since multiple behavioral context information was ignored, it was still a challenge to identify the multimodal relationships of behaviors. 2) Surveillance signals were still sparse. In order to solve this problem, this paper proposes Two-path Multi-behavior Sequence Modeling(TP_MB). First, a two-path learning strategy is introduced to maximize the multiple interaction information of user items learned by the two paths, which effectively enhances the robustness of the model. Second, a multi-behavior dependent encoder is designed. Contextual information is obtained through behavior dependencies in the interaction of different user. In addition, three contrastive learning methods are designed, which not only obtain additional auxiliary supervision signals, but also alleviate the problem of sparse supervision signals. Extensive experiments on two real datasets demonstrate that our method outperforms state-of-the-art multi-behavior recommendation methods.

Unmanned Aerial Vehicles (UAVs) have become increasingly important in various applications, including environmental monitoring, disaster response, and surveillance, due to their flexibility, efficiency, and ability to access hard-to-reach areas. Effective path planning for multiple UAVs exploring a target area is crucial for maximizing coverage and operational efficiency. This study presents a novel approach to optimizing collaborative navigation for UAVs using Multi-Agent Reinforcement Learning (MARL). To enhance the efficiency of this process, we introduce the Adaptive Dimensionality Reduction (ADR) framework, which includes Autoencoders (AEs) and Principal Component Analysis (PCA) for dimensionality reduction and feature extraction. The ADR framework significantly reduces computational complexity by simplifying high-dimensional state spaces while preserving crucial information. Additionally, we incorporate communication modules to facilitate inter-UAV coordination, further improving path planning efficiency. Our experimental results demonstrate that the proposed approach significantly enhances exploration performance and reduces computational complexity, showcasing the potential of combining MARL with ADR techniques for advanced UAV navigation in complex environments.

Bandung and Lembang are the cities that are chosen by many tourists (local and foreign) as their destinations. Geographically, these cities are placed side-by-side and each city has its own characteristics. As in Bandung, there are many hotels and culinary spots, meanwhile, in Lembang, there are many scenery tourism spots. Tourists usually have limited time to visit all the destinations on holiday, which makes them choose several tourist destinations to visit. In this paper, the tourism itinerary recommendation system is proposed by calculating the most optimal route between destinations and approaching the Vehicle Routing Problem with Time Windows. The optimal route is defined by using Dijkstra the shortest path algorithm by using the collaboration between the road information (road length, traffic condition, travel time, and weather condition) and criteria weight that is determined using the Analytics Hierarchy Process as the graph weights. According to the simulation results, the criteria weights are 6.9%, 62.7%, 18.6%, and 11.9% for Route Length, Traffic Condition, Travel Time, and Weather Condition respectively. Moreover, the optimal number of tourism itinerary plans for the tourist in this research is 4 destinations. As the usage of computational resources, it takes 31.8% of CPU and 61.9% of Memory usage. For the time processing, it increases exponentially as the increment of number of requested stops. The output of this research is expected to be a solution to the tourist itinerary plan, especially in Bandung and Lembang.

The normal growth and development of skeletal muscle is essential for the health of the body. The regulation of skeletal muscle by intestinal microorganisms and their metabolites has been continuously revealed. Acetate is the predominant short-chain fatty acid synthesized by gut microbiota through the fermentation of dietary fiber, however, the underlying molecular mechanisms governing the interaction between acetate and skeletal muscle during rapid growth stage remain to be further elucidated; Here, specific pathogen-free (SPF) mice, germ-free (GF) mice, and germ-free mice supplemented with sodium acetate (GS) were used to evaluate the effects of acetate on skeletal muscle growth and development of young mice with gut microbiota deficiency; We found the concentration of serum acetate, body mass gain, succinate dehydrogenase activity and expression of myogenesis maker gene of skeletal muscle in the GS group was higher than GF group following sodium acetate supplement. Furthermore, the transcriptome analysis revealed that acetate activated biological processes regulating skeletal muscle growth and development in GF group that are inhibited due to gut microbiota deficiency. In vitro experiment, we proved that acetate up-regulated Gm16062 to promote skeletal muscle cell differentiation; Overall, our findings proved that acetate promote skeletal muscle growth and development in young mice via increase Gm16062 expression.

A graph based path planning method consisting of off-line part and on-line part for multi-UAV system in windy condition is proposed. In the off-line part, the task area is divided into grids. When two nodes is close enough, they are connected and weighted by the cost, obtained by solving an optimization problem based on difference method, between them. In order to ensure the accuracy of the difference method, the adjacent radius is set to be small enough. In order to ensure the generated paths close to analytical solution, the grid size is set to be much smaller than the adjacent radius. The shortest path algorithm is used to update the adjacent matrix and path matrix. In the on-line part, the target position assignment and optimal velocity can be obtained by accessing the adjacent matrix and path matrix. At the end of this paper, some numerical examples are taken to illustrate the validity of our method and the influence of the parameters.

A Wireless Body Area Sensor Network (WBASN) is combination of numerous sense nodes, positioned onto/close or inside a person body. Wireless Body Area Sensor Networks (WBASN) is a developing automation trend that exploits wireless sensor nodes to put instantaneous wearable well-being of ill person to improve individual’s existence. The sensor nodes might be used outwardly to observe abundant health parameters (like heart activity, blood pressure and cholesterol) of an ill person at a vital site within hospital. Hence the goal of WBASN is much crucial, enhancing the lifetime of nodes is compulsory to sustain many issues such as utility and efficiency. It is essential to evaluate time that when the first node will die it we want to refresh or change the battery reason is that loss of crucial information is not tolerable. The lifetime is termed as the time interval when a first node dies out due to battery exhaustion. In our proposed protocol life time of a network is the main concern as well other protocol related issues such as throughput, path loss, and residual energy. Bio-sensors are used for deployment on human body. Poisson distribution and equilibrium model techniques have been used for attaining the required results. Multi-hop network topology and random network node deployment used to achieve minimum energy consumption and longer network lifetime.

The benefits of multi-robot systems are substantial, bringing gains in efficiency, quality, and cost, and are useful in a wide range of environments from warehouse automation, to agriculture, and even extend in part to entertainment. In multi-robot system research, the main focus is on ensuring efficient coordination in the operation of the robots, both in task allocation and navigation. However, much of this research seldom strays from theoretical bounds; there are many reasons for this, with the most prominent and impactful being resource limitations. This is especially true for research in areas such as multi-robot path planning (MRPP) and navigation coordination. This is a large issue in practice as many approaches are not designed with meaningful real-world implications in mind and are not scalable to large multi-robot systems. This survey aims to look into the coordination and path-planning issues and challenges faced when working with multi-robot systems, especially those using a prioritised planning approach and identify key areas which are not well-explored and the scope of applying existing MRPP approaches to real-world settings.

Unmanned delivery technology using unmanned aerial vehicles (UAVs) has the potential to solve issues such as traffic congestion and labor shortages. We investigated a method to construct a route between the source and destination nodes in a wireless multi-hop network by installing a radio terminal in each house. If the relay functions of all nodes in the network are in operation, the number of control messages for route construction increases, and the message relay forwarding load of each node increases. Keeping all node pairs multi-hop connectivity, we establish a method to operate the relay function with as few nodes as possible. End nodes that have not activated the relay function connect to the relay node with the closest physical distance. In this paper, we propose methods for selecting nodes to operate the relay function. Specifically, one method is based on random selection, another method is based on the number of adjacent nodes, and a third method is based on the Multipoint Relay (MPR) of the Optimized Link State Routing Protocol (OLSR). For each method, we evaluate whether the route construction is available, the number of relay nodes, the total distance of constructed routes, and the distance in population-dense regions. We clarify the characteristics of each method, and the method based on MPR is the best for constructing a network suitable for UAV navigation routes. In addition, the smaller the number of relay nodes, the more unexpected collisions on the links due to route conflicts. We clarify the minimum node density required to apply the MPR method which reduces the number of relay nodes suppressing route conflicts.

This investigation explores a novel path-planning and optimization strategy for multiple cooperative robotic agents, applied in a fully observable and dynamically changing obstacle field. Current dynamic path planning strategies employ static algorithms operating over incremental time-steps. We propose a cooperative multi-agent (CMA) based algorithm, based on natural flocking of animals, using vector operations. It is preferred over more common graph search algorithms like A* as it can be easily applied for dynamic environments. CMA algorithm executes obstacle avoidance using static potential fields around obstacles, that scale based on relative motion. Optimization strategies including interpolation and Bezier curves are applied to the algorithm. To validate effectiveness, CMA algorithm is compared with A* using static obstacles due to lack of equivalent algorithms for dynamic environments. CMA performed comparably to A* with difference ranging from -0.2% to 1.3%. CMA algorithm is applied experimentally to achieve comparable performance, with an error range of -0.5% to 5.2%. These errors are attributed to the limitations of the Kinect V1 sensor used for obstacle detection. The algorithm was finally implemented in a 3D simulated space, indicating that it is possible to apply with drones. This algorithm shows promise for application in warehouse and inventory automation, especially when the workspace is observable.

This paper focuses on robust multi-criteria traffic network equilibrium problems with path capacity constraints. The concepts of robust vector equilibrium and robust vector equilibrium with respect to worst case are introduced, respectively. To generate a subset of robust vector equilibrium, an equivalent min-max optimization problem is constructed. In addition, a direct search algorithm, in which the step size without derivatives and redundant parameters, for solving this min-max problem is proposed. To find a subset of robust vector equilibrium with respect to worst case, an equivalent smoothing optimization problem based on a variant version of ReLU activation function is established. Numerical experiments are also presented to expound the advantages of the algorithms.

Recommender systems as an effective information filtering system can be used to obtain information through the user's explicit or implicit behavior. On the one hand finding items that may be of interest to the user. On the other hand, the recommendation facilitates the interaction between the user and the item to increase the revenue. Recommender systems have been widely used in various fields, such as e-commerce, travel recommendation, online books and movies, social networks, etc, which can satisfy the intrinsic implicit needs of users through personalized services. In recent years, the development of deep learning has further improved the performance of recommendation systems. Although these methods improve the performance of the recommendation system, when the number of users and products increases, the recommendation system may face sparsity and cold start problems, and thus cannot achieve personalized recommendations. Knowledge graphs, which are structured data, have become the choice of many algorithms due to the high quality and wide scale of the data, and therefore many recommendation algorithms combined with knowledge graphs have emerged as a popular new direction in recommendation systems. These algorithms are able to preserve the rich connections between different entities. Moreover, when constructing the features of an entity, the entities that are far away from the central entity can also be utilized. Entities are no longer only directly connected to each other. To address the shortcomings of existing recommendation algorithms, this paper designs the recommendation algorithm GPRE using graph neural networks. GPRE focuses on expressing the user's features. The graph neural network provides GPRE with a strong generalization capability for modeling, which can provide long-range semantics between users and entities, as well as selective entity selection in the auxiliary graph neural network. Explicit semantic links are established between remote and central nodes to reduce the introduction of noise. In this paper, experiments are conducted on real-world datasets and the results are compared with baselines. The experimental results show that GPRE performs well on the experimental dataset.

In Ultra-wideband (UWB)-based wireless ranging or distance measurement, differentiation between line-of-sight~(LOS), non-line-of-sight~(NLOS), and multi-path (MP) conditions are important for precise indoor localization. This is because the accuracy of the reported measured distance in UWB ranging systems is directly affected by the measurement conditions (LOS, NLOS or MP). However, the major contributions in literature only address the binary classification between LOS and NLOS in UWB ranging systems. The MP condition is usually ignored. In fact, the MP condition also has a significant impact on the ranging errors of the UWB compared to the direct LOS measurement results. Though, the magnitudes of the error contained in MP conditions are generally lower than completely blocked NLOS scenarios. This paper addresses machine learning techniques for identification of the mentioned three classes (LOS, NLOS, and MP) in the UWB indoor localization system using an experimental data-set. The data-set was collected in different conditions at different scenarios in indoor environments. Using the collected real measurement data, we compare three machine learning (ML) classifiers, i.e., support vector machine (SVM), random forest (RF) based on an ensemble learning method, and multilayer perceptron (MLP) based on a deep artificial neural network, in terms of their performance. The results show that applying ML methods in UWB ranging systems are effective in identification of the above-mentioned three classes. In specific, the overall accuracy reaches up to 91.9% in the best-case scenario and 72.9% in the worst-case scenario. Regarding the F1-score, it is 0.92 in the best-case and 0.69 in the worst-case scenario. For reproducible results and further exploration, we (will) provide the publicly accessible experimental research data discussed in this paper at PUB - Publications at Bielefeld University. The evaluations of the three classifiers are conducted using the open-source python machine learning library scikit-learn.

The RPL protocol is a routing protocol for low power and lossy networks. In such a network, energy is a very scarce resource; so many studies are focused on minimizing global energy consumption. End-to-end latency is another important performance indicator of the network, but existing research tends to focus more on energy consumption and ignore the end-to-end delay of data transmission. In this paper, we propose a kind of energy equalization routing protocol to maximize the surviving time of the restricted nodes so that the energy consumed by each node is close to each other. At the same time, a multi-path forwarding route is proposed based on the cache utilization. The data is sent to the sink node through different parent nodes at a certain probability, not only by selecting the preferred parent node, thus avoiding buffer overflow and reducing end-to-end delay. Finally, the two algorithms are combined to accommodate different application scenarios. The experimental results show that the proposed three improved schemes improve the reliability of the routing, extend the lifetime of the network, reduce the end-to-end delay, and reduce the number of DAG reconfiguration.

The emerging working mode of coordinated trucks and drones has demonstrated significant practical potential in various fields, including logistics and delivery, intelligence surveillance reconnaissance, area monitoring, and patrol. The seamless collaboration between trucks and drones is garnering widespread attention in academia and has emerged as a key technology for achieving efficient and secure transportation. This paper provides a comprehensive and in-depth review of the research status on the routing problem for coordinated trucks and drones, covering aspects such as application background, cooperative modes, configurations, issues have been taken into consideration, and solution methodologies.

Compared to traditional multi-robot path planning problems, multi-chain robot path planning (MCRPP) is more challenging because it must account for collisions between robot units and between the bodies of a chain and the leading unit during towing. To address MCRPP more efficiently, we propose a novel algorithm called Multi-Train Safe Interval Path Planning (MT-SIPP). Based on safe interval path planning principles, we categorize conflicts in the multi-train planning process into three types: travel conflicts, waiting conflicts, and station conflicts. To handle travel conflicts, we use an improved k-robust method to ensure trains avoid collisions with other trains during movement. To resolve waiting conflicts, we apply a time correction method to ensure the safety of positions occupied by trains during waiting periods. To address station conflicts, we introduce node constraints to prevent other trains from occupying the station positions of trains that have reached their target stations and are stopped. Experimental results on three benchmark maps show that the MT-SIPP algorithm achieves about a 30% improvement in solution success rate and nearly a 50% increase in the maximum number of solvable instances compared to existing methods. These results confirm the effectiveness of MT-SIPP in addressing the challenges of MCRPP.

Wireless Sensor Networks (WSNs) continue to provide essential services for various applications such as surveillance, data gathering, and data transmission from the hazardous environments to safer destinations. This has been enhanced by the energy-efficient routing protocols that are mostly designed for such purposes. Gateway-based Energy-Aware Multi-hop Routing protocol (MGEAR) is one of the homogenous routing schemes that was recently designed to more efficiently reduce the energy consumption of distant nodes. However, it has been found that the protocol has a high energy consumption rate, lower stability period, less data transmission to the Base station (BS). In this paper, an enhanced Heterogeneous Gateway-based Energy-Aware multi-hop routing protocol ( HMGEAR) is proposed. The proposed routing scheme is based on the introduction of heterogeneous nodes in the existing scheme, selection of the head based on the residual energy, introduction of multi-hop communication strategy in all the regions of the network, and implementation of energy hole elimination technique. Results show that the proposed routing scheme outperforms two existing ones.

In this paper, a model of the hub covering the location-routing problem with simultaneous delivery and pickup should be designed in order to minimize the total costs, minimize the maximum vehicles travel time and minimize the amount of CO_2 gas emissions. Two-stage stochastic programming is used in this paper to control the uncertainty parameters of the problem. The mathematical model aims to decide the appropriate location of hubs and vehicle routing for simultaneous delivery and pickup of products. In this regard, the results obtained from the LP-Metric method show that there is a conflict between the objective functions, and with the reduction of the amount of CO_2 gas emissions and the reduction of the maximum vehicles travel time, the total costs have increased. On the other hand, by examining the economical factor, it was observed that by reducing this factor, the robustness factors are changed and the total costs of the network are reduced. MOIWO and MOALO were used to solve the problem in large scale, the result of which was the existence of a significant difference between the calculation time averages. Also, the efficiency of these methods was very high compared to the LP-Metric method and the maximum relative difference was less than 2.83%. The results of numerical examples show a higher efficiency of the MOALO than the MOIWO.

This work presents a multi-start algorithm for solving the capacitated vehicle routing problem with two-dimensional loading constraints (2L-CVRP) allowing for the rotation of goods. Researches dedicated to graph theory and symmetry considered the vehicle routing problem as a classical application. This problem has complex aspects that stimulate the use of advanced algorithms and symmetry in graphs. The use of graph modeling of the 2L-CVRP problem by undirected graph allowed the high performance of the algorithm. The developed algorithm is based on metaheuristics such as the Constructive Genetic Algorithm (CGA), to construct promising initial solutions; a Tabu Search (TS), to improve the initial solutions on the routing problem; and a Large Neighborhood Search (LNS), for the loading subproblem. Although each one of these algorithms allowed to solve parts of the 2L-CVRP, the combination of these three algorithms to solve this problem was unprecedented in the scientific literature. In our approach, a parallel mechanism for checking the loading feasibility of routes was implemented using multi-threading programming to improve the performance. Additionally, memory structures, like hash-tables, were implemented to save time by storing and querying previously evaluated results for the loading feasibility of routes. For benchmarks, tests were done on well-known instances available in the literature. The results proved that the framework matched or outperformed most of the previous approaches. As the main contribution, this work brings higher quality solutions for large-size instances of the pure CVRP. This paper involves themes related to the symmetry journal, mainly complex algorithms, graphs, search strategies, complexity, graph modeling, and genetic algorithms. In addition, the paper especially focuses on topic-related aspects of special interest of the community involved in symmetry studies, such as, graph algorithms and graph theory.

The advent of Sixth Generation (6G) wireless technologies introduces challenges and opportunities for Mobile Ad Hoc Networks (MANETs) and Vehicular Ad Hoc Networks (VANETs), necessitating a reevaluation of traditional routing protocols. This paper introduces the Multi-Metric Scoring Dynamic Source Routing (MMS-DSR), a novel enhancement of the Dynamic Source Routing (DSR) protocol, designed to meet the demands of 6G-enabled MANETs and the dynamic environments of VANETs. MMS-DSR integrates advanced technologies and methodologies to enhance routing performance in dynamic scenarios. Key among these is the use of a CNN-LSTM based beamforming algorithm, which optimizes beamforming vectors dynamically, exploiting spatial-temporal variations characteristic of 6G channels. This enables MMS-DSR to adapt beam directions in real-time based on evolving network conditions, improving link reliability and throughput. Furthermore, MMS-DSR incorporates a multi-metric scoring mechanism that evaluates routes based on multiple QoS parameters, including latency, bandwidth, and reliability, enhanced by the capabilities of Massive MIMO and the IEEE 802.11ax standard. This ensures route selection is context-aware and adaptive to changing dynamics, making it effective in urban settings where vehicular and mobile nodes coexist. Additionally, the protocol uses machine learning techniques to predict future route performance, enabling proactive adjustments in routing decisions. The integration of dynamic beamforming and machine learning allows MMS-DSR to effectively handle the high mobility and variability of 6G networks, offering a robust solution for future wireless communications, particularly in smart cities.

Underwater Wireless Sensor Networks (UWSN) enables various oceanic applications which require effective packet transmission. In this case, sparse node distribution, dynamic network topology and inappropriate selection of relay nodes cause void holes. Addressing this problem, we present a Relay based Void Hole Prevention and Repair protocol (ReVOHPR) by multiple Autonomous Underwater Vehicles (AUV) for UWSN. ReVOHPR efficiently identifies and avoids void holes and trap relay nodes to avoid it. ReVOHPR adopts the following operations as Ocean Depth (levels) based Equal Cluster Formation, Dynamic Sleep Scheduling, Virtual Graph based Routing, and Relay Assisted Void Hole Repair. For energy efficient cluster forming, Entropy based Eligibility Ranking (E2R) is presented which elects stable cluster heads (CHs). Then, dynamic sleep scheduling is implemented Dynamic Kernel Kalman Filter (DK2F) algorithm in which Sleep and Active modes based on the nodes current status. Inter Cluster Routing is performed by maximum matching nodes which selects by Dual criteria and also data transmitted to AUV. Finally, void holes are detected and repair by Bi-Criteria Mayfly Optimization (BiCMO) algorithm. The BiCMO focuses on reducing the number of holes, data packet loss and maximizes Quality of Service (QoS) and energy efficiency of the networks. This protocol is timely deal with node failures in packet transmission via multi-hop routing. Simulation is implemented by NS3 (AquaSim module) simulator that evaluates the performance in network simulation for following metrics as average energy consumption, delay, packet delivery rate and throughput.

Reservoir routing has been a routine procedure in hydrology, hydraulics and water management. It is typically based on the mass balance (continuity equation) and a conceptual equation relating storage and outflow. If the latter is linear, then there exists an analytical solution of the resulting differential equation, which can directly be utilized to find the outflow from known inflow, and to obtain macroscopic characteristics of the process, such as response and residence times, and their distribution functions. Here we streamline the reservoir routing framework and extend it to find approximate solutions for nonlinear cases. The proposed framework can also be useful for climatic tasks, such as describing the mass balance of atmospheric carbon dioxide and determining characteristic residence times, which have been an issue of controversy. Application of the theoretical framework results in excellent agreement with real world data. In this manner, we easily quantify the atmospheric carbon exchanges, and obtain reliable and intuitive results, without the need to resort to complex climate models. The mean residence time of atmospheric carbon dioxide turns out to be no more than four years and the response time is smaller than that, thus opposing the much longer mainstream estimates.

The recent Planck Legacy release confirmed the existence of an enhanced lensing amplitude in the cosmic microwave background (CMB) power spectra, which endorses the positive curvature of the early Universe with a confidence level exceeding 99%. In this study, the pre-existing curvature is incorporated to extend the field equations where the derived wave function of the Universe is utilized to model Universe evolution with reference to the scale factor of the early Universe and its radius of curvature upon the emission of the CMB. The wave function reveals both positive and negative solutions, implying that matter and antimatter of early Universe plasma evolve in opposite directions as distinct Universe sides. The wave function indicates that a nascent hyperbolic expansion is followed by a first phase of decelerating expansion away from early plasma during the first 10 Gyr, and then, a second phase of accelerating expansion in reverse directions, whereby both Universe sides free-fall towards each other under gravitational acceleration. Simulations of the predicted conformal curvature evolution demonstrate the fast orbital speed of outer stars owing to the external fields exerted on galaxies as they travel through conformally curved space-time. Finally, the wave function predicts an eventual time-reversal phase comprising rapid spatial contraction that culminates in a Big Crunch, signalling a cyclic Universe. These findings reveal that early plasma could have separated and evolved into distinct sides that collectively and geometrically influencing the Universe evolution, physically explanting the effects attributed to dark matter and energy.

Legacy IPv4 networks are strenuous to manage and operate. Network operators are in need to minimize the capital and operational expenditure of running network infrastructure. The implementation of Software-defined networking (SDN) addresses those issues by minimizing the expenditures in the long run. Legacy networks need to integrate with the SDN networks for the smooth migration towards the fully functional SDN environment. In this paper, we compare the network performance of the legacy network with the SDN network for IP routing in order to determine the feasibility of the SDN deployment in the Internet Service provider (ISP) network. The simulation of the network is performed in the Mininet test-bed and the network traffic is generated using distributed Internet traffic generator. Open network operating system is used as a controller for the SDN network in which SDN-IP application is used for IP routing. Round trip time, bandwidth, and packet transmission rate from both SDN and legacy networks are first collected and then the comparison is done. We found that SDN-IP performs better in terms of bandwidth and latency as compared to legacy routing. The experimental analysis of interoperability between SDN and legacy networks shows that SDN implementation in production level carrier-grade ISP network is viable and progressive.

The organic fraction of municipal solid waste (OFMSW) is a significant environmental threat, and an economic and social challenge to manage. As such, the efficient treatment of OFMSW is a significant key factor in achieving sustainable waste management. Decentralized Composting (DC) develops a new framework of waste management. The DC Analysis Model (DCAM), proposed in our previous study, provides a powerful tool for decision makers, based on the quantification of the DC project characteristics. In this paper, we focus on the qualitative analysis as a complementary tool to support decision making, in cases where quantitative analysis is unequivocal. The qualitative analysis identifies the main players in the field, the critical stakeholders and the potential conflicts between them. It also reveals the root problems and the core competencies for the project's implementation. DCAM qualitative analysis in Shefa-Amr (case study) indicates that unresolved root problems, such as the “lack of national regulation”, “clear ownership of the project” and “lack of ongoing budget” can result in an unsustainable composting system. Countering that, “the commitment of the municipality”, together with “economic viability” and securing “suitable areas for placing composters” are among the most important core competencies for the effective implementation of DC projects.

Insulin-like Growth Factor 2 mRNA binding Protein 1 (IGF2BP1) is a promising candidate gene for influencing economic traits in livestock and poultry. The second intronic region of IGF2BP1 is closely related to growth traits, although the exact mechanism remains unclear. The preliminary resequencing results of goats in our laboratory demonstrated that the IGF2BP1 gene region was subject to strong selection, then we selected multiple single nucleotide polymorphisms (SNPs) to identify. Seven SNPs were located in the conserved region of the second intron, and their functions and relationship with growth traits require further clarification. This study selected 348 Nanjiang Yellow goats as experimental subjects, and chose Time of Flight Mass Spectrometer (MALDI-TOF) as the main method. Our results showed that six SNPs were significantly correlated with the growth traits of the Nanjiang yellow goat by association analysis. Among them, the rs652062749(A>G) was identified as the primary locus affecting the later stage of growth traits of Nanjiang yellow goat. Moreover, there was a strong linkage among three SNPs, and the rs638185407 (T>A) mutant type was observed to increase the luciferase activity in H293T cells extremely significantly. The TTAACT, TTCCCC, and ATCACT combination genotypes were dominant combination genotypes, which provided theoretical references for further genetic co-breeding. The results of our study demonstrate the potential role of the IGF2BP1 gene as a functional genetic marker in the breeding programs of Nanjiang Yellow goats.

In 2023, we proposed the modified Delay and Doppler Profiler (mDDP) as an inter-carrier interference (ICI) countermeasure for underwater acoustic OFDM mobile communications in a multipath environment. However, the performance improvement in computer simulation and pool experiments was not significant. In a subsequent study, the accuracy of the Channel Transfer Function (CTF), which is the input for the mDDP channel parameter estimation, was considered insufficient. Then a 2-step mDDP was devised. This paper presents simulations of underwater OFDM communications using 1- to 3-step mDDPs. The simulation conditions are a two-wave multipath environment where the receiving transducer moves at a speed of 0.3 m/sec and is subjected to a Doppler shift in the opposite direction. As NumCOL, the number of taps in the multi-tap equalizer which removes ICI, was increased, Bit Error Rate (BER) of 0.016 at NumCOL = 1 was significantly reduced by a factor of approximately 40 to BER of 0.00041 at NumCOL = 41 for the 2-step mDDP.

The multi-stage, multi-level assembly job shop scheduling problem (MsMlAJSP) is commonly encountered in the manufacturing of complex customized products. Ensuring production efficiency while effectively improving energy utilization is a key focus in the industry. For the energy-efficient MsMlAJSP (EEMsMlAJSP), an improved imperialist competitive algorithm based on Q-learning (IICA-QL) is proposed to minimize the maximum completion time and total energy consumption. In IICA-QL, a decoding strategy with energy-efficient triggers based on problem characteristics is designed to ensure solution quality while effectively enhancing search efficiency. Additionally, an assimilation operation with operator parameter self-adaptation based on Q-learning is devised to overcome the challenge of balancing exploration and exploitation with fixed parameters, thus the convergence and diversity of the algorithmic search is enhanced. Finally, the effectiveness of the energy-efficient strategy decoding trigger mechanism and the operator parameter self-adaptation operation based on Q-learning is demonstrated through experimental results, and the effectiveness of IICA-QL for solving EEMsMlAJSP is verified by comparing with other algorithms.

Aiming at effectively generating safe and reliable motion paths for quadruped robots, a hierar-chical path planning approach driven by dynamic 3D point cloud is proposed in this article. The developed path planning model is essentially constituted of two layers: global path planning layer and local path planning layer. At the global path planning layer, a new method is proposed for calculating terrain potential field based on point cloud height segmentation. Variable step size is employed to improve the path smoothness. At the local path planning layer, a real-time prediction method for potential collision area and a strategy for temporary target point selection is developed. Quadruped robot experiments were carried out in an outdoor complex environment. The experi-mental results verified that, for global path planning, the smoothness of the path is improved and the complexity of the passing ground is reduced. The effective step size is increased by a maxi-mum of 13.4 times, and the number of iterations is decreased by up to 1/6, compared with the traditional fixed step size planning algorithm. For local path planning, the path length is short-ened by 20%, more efficient dynamic obstacle avoidance and more stable velocity planning are achieved by using the improved dynamic window approach (DWA).

In this paper, we present a full coverage path planning (CPP) algorithm for the marine surveys conducted in the convex polygon shaped search area. The survey is supposed to carry out by torpedo-type AUVs (autonomous underwater vehicles). Due to their nonholonomic mechanical characteristics, these vehicles have nonzero minimum turning radius. For any given polygon shaped search area, it can always be partitioned into one or more convex polygons. With this in mind, this paper proposes a novel search algorithm called CbSPSA (Calculation based Shortest Path Search Algorithm) for full coverage of any given convex polygon shaped search area. By aligning the search inter-tracks alongside the edge with the minimum height, we can guarantee the minimum number of the vehicle’s turns. In addition, the proposed method can guarantee the planned path is strictly located inside the polygon area without overlapped or crossed path lines, and also has the total path length as short as possible. Considering the vehicle’s nonzero minimum turning radius, we also propose a sort of smoothing algorithm to smooth the waypoint path searched by CbSPSA so as for the vehicle to exactly follow it. The smoothed path is also guaranteed to be strictly located inside the polygon. Numerical simulation analyses are also carried out to verify the effectiveness of the proposed schemes.

This study explores the complexities of sport manager selection, investigating the impact of affirmative action, recruitment strategies, organizational culture, diversity initiatives in board selection, and career advancement insights from coaches' perspectives. To conduct this investigation, a purposive sampling technique was employed, selecting 65 prominent sports managers and coaches from Romania. Participants, aged between 35 to 58 years old, boasted an average of 10 to 20 years of sports experience and were chosen based on specific criteria, including academic qualifications. Data collection occurred over an extended period, spanning from fall 2022 to spring 2024, through semi-structured interviews with sport managers and coaches. The findings unveiled persistent challenges in effectively implementing affirmative action measures, as sport managers grapple with balancing the promotion of deserving candidates while maintaining continuity in board culture. Achieving meaningful diversity necessitates nuanced approaches that consider both candidate quality and cultural compatibility. Moreover, the study sheds light on coaches' perspectives when considering executive council positions, highlighting various pathways to career advancement. Recruitment practices prioritized informal methods, emphasizing board cohesion. Despite the recognized importance of diversity, challenges persist in selecting candidates solely based on demographic representation. The study provides valuable insights into promoting diversity and inclusivity within sports organizations' executive councils. Future research directions may include exploring longitudinal trends and delving into the qualitative experiences of underrepresented groups, with the aim of advancing understanding and promoting equity within sports organizations.

In recent years, the delivery of medical supplies has faced significant challenges due to natural disasters and recurrent public health emergencies. Addressing the need for improved logistics operations during such crises, this article presents an innovative approach integrating vehicle and Unmanned Aerial Vehicle (UAV) logistics to enhance the efficiency and resilience of medical supply chains. Our study introduces a dual-mode distribution framework that employs the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm for efficiently clustering demand zones unreachable by conventional vehicles, thereby identifying areas requiring UAV delivery. Furthermore, we categorize the demand for medical supplies into two distinct sets based on vehicle accessibility, optimizing distribution routes via both UAVs and vehicles. Through comparative analysis, our findings reveal that the artificial bee colony (ABC) algorithm significantly outperforms the genetic algorithm in terms of solving efficiency, iteration counts, and delivery speed. However, the ABC algorithm's tendency towards early local optimization and rapid convergence leads to potential stagnation in local optima. To mitigate this issue, we incorporate a simulated annealing technique into the ABC framework, culminating in a refined optimization approach that successfully overcomes the limitations of premature local optima convergence. The experimental results validate the efficacy of our enhanced algorithm, demonstrating reduced iteration counts, shorter computation times, and substantially improved solution quality over traditional logistic models. The proposed method holds promise for significantly improving the operational efficiency and service quality of the healthcare system's logistics during critical situations.

In aerospace, robotics, network engineering and mechanical engineering, there exist complex and urgent challenges that can be abstracted into mathematical optimization problems. Therefore, exploring solutions to these optimization problems is a crucial task. Metaheuristic algorithms have been applied across various fields.The Snake Optimization Algorithm (SO) is an innovative metaheuristic method recognized for its efficient solving capabilities.However, this algorithm encounters challenges such as diminished search efficiency in the later stages and a propensity to become ensnared in local optima. To mitigate these issues, this paper introduces an enhanced Snake Optimization Algorithm (ISO). ISO integrates the RIME Algorithm(RIME)and introduces two effective enhancement strategies to improve its capability to evade local optima.To assess the effectiveness of ISO,the population distribution state was first measured using three algorithms, including Star Discrepancy, and the exploration and exploitation performance was analyzed using the CEC2017 test functions. Subsequently, utilized 23 benchmark functions for testing.The evaluation outcomes indicate that ISO exhibits outstanding performance in terms of convergence velocity and robustness.Additionally, it was applied to engineering fields including UAV path planning,Robot path planning, Wireless sensor network node deployment and Pressure vessel design.In comparison to the SO algorithm, the ISO algorithm demonstrates superior stability, converges earlier, and improves its ability to solve for optimal .These findings highlight the significant potential of the ISO algorithm in diverse test functions and a wide range of interdisciplinary problems.

In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node or link failure. He then shows that “whether there is a protection routing to the destination” is NP-complete. Tapolcai find that two completely independent spanning trees, abbreviated as CISTs, can be used to configure the protection routing. In this paper, we propose dual protection routing trees, denoted as dual-PRTs to replace CISTs, which are less restrictive than CISTs. Next, we propose a transformation algorithm that uses dual-PRTs to configure the protection routing. Taking complete graphs Kn, complete bipartite graphs Km,n, hypercubes Qn, locally twisted cubes LTQn as examples, we provide a recursive method to construct dual-PRTs on them. This article will show that there are no two CISTs on K3,3, Q3, and LTQ3, but there exist dual-PRTs that can be used to configure the protection routing. As shown in the performance evaluation of simulation results, for both Qn and LTQn, we get the average path length of protection routing configured by dual-PRTs is shorter than that by two CISTs.

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.

Background: Escalating climate change concerns have prompted the healthcare sector, particularly anaesthesia, to reassess its practices to align with environmental sustainability. Anesthetic gases like desflurane, sevoflurane, and isoflurane significantly impact the environment due to their high Global Warming Potentials (GWPs) and prolonged atmospheric lifetimes. This manuscript investigates these impacts and advocates for strategies to reduce the carbon footprint of anesthetic care while maintaining patient safety. Methods: We reviewed the environmental impacts of anesthetic gases and explored various strategies for sustainable anaesthesia. These strategies include adopting anesthetics with lower GWPs, enhancing recycling and waste reduction techniques, transitioning to intravenous anaesthesia, and implementing low-flow anaesthesia methods. We also examined barriers to these strategies, such as educational gaps, technological challenges, resistance to change, and policy limitations. Results: Adopting anesthetics with lower GWPs, such as sevoflurane over desflurane, and implementing low-flow anaesthesia can significantly reduce greenhouse gas emissions. Recycling and waste reduction techniques, though challenging, offer additional environmental benefits. Transitioning to intravenous anaesthesia can eliminate the direct GWP contributions from volatile anesthetic gases. However, these strategies require comprehensive education, advocacy for research and innovation, strategic change management, and supportive policies. Conclusions: Continuous monitoring and evaluation are crucial to ensure the effectiveness of sustainable practices in anaesthesia. Establishing robust Key Performance Indicators (KPIs) and utilizing advanced analytical tools will enable the anaesthesia community to adapt and refine practices. Collaborative efforts among clinicians, policymakers, and stakeholders are essential to significantly reduce the environmental impact of anaesthesia and promote ecological responsibility within healthcare.

The thesis proposes a argument that a mass point moving in a horizontal circle on the Earth’s surface can generate a radial centrifugal force of the Earth’s center of mass, thus realizing an unconventional anti-gravity path. Based on the author’s theory of absolute airspace and its reference system, and through the theoretical analysis of the difference in the distribution of gravitational acceleration at different latitudes caused by the rotation of the earth, and the centrifugal force of a mass point moving in a horizontal circle on the earth’s surface is analyzed, the validity of the argument is demonstrated. At the same time, the paper puts forward two possible basic principles, and makes theoretical analysis and demonstration. Conceive of the concrete experimental verification of principle two is proposed. Four technical schemes for anti-gravity ascent are proposed and basic analysis is made. On the premise of not fully considering the practical technical ability, it is theoretically proved that three of them have realistic operability and development potential. In theory, this paper opens up a different way of anti-gravity for human beings, which will bring new ideas and prospects for human beings to get rid of the bondage of gravity.

Job characteristics shape organizational sustainability, conferring tangible benefits to employees. Job characteristics shape attitudes toward work, such as satisfaction and engagement, and are related to the well-being and health of employees. The aim of the study was to determine and describe the role of work engagement and support at work in the relation between selected job characteristics (organizational justice, job control, and role clarity) and self-rated health. The study was conducted on a sample of 368 employees representing various industries. The study used: Utrecht Work Engagement Scale (UWES), Organizational Justice Survey, Coworker Support Scale, Supervisor Support Scale, Role Clarity Scale, Job Control Scale. Cantril ladder was used to measure self-rated health. The presented study established the importance of lower scores on the UWES subscale: dedication as a significant moderator of the examined correlations. In relation to the correlation: justice and its dimensions, and self-rated health, support from supervisors showed a greater effect than that from coworkers. The conducted study expands knowledge on the formation of employees' self-rated health through the sense of justice experienced within the organization. The results obtained are applicable to organizational practice. This finding highlights the importance of supporting organizational justice, which contributes to employee well-being (particularly when combined with high levels of work engagement and supervisor support) and ultimately increases organizational sustainability. Further research can be continued taking into account the limitations of the previous procedure of selecting people for the study and the measurement tools used.

The challenging terrain and deep ravines characteristic of mountainous regions often result in slower path planning and suboptimal flight paths for Unmanned Aerial Vehicles (UAVs) when traditional meta-heuristic optimization algorithms are employed. This study investigates the application of an Improved Enhanced Snake Optimizer (IESO) for three-dimensional path planning in a simulated rugged mountainous terrain. The initialization process in the enhanced snake optimizer is refined by integrating the Chebyshev chaotic map. Additionally, a non-monotonic factor is introduced to modulate the "temperature," and a boundary condition is incorporated into the dynamic opposition learning mechanism. These modifications collectively reduce the likelihood of population convergence to local optima during optimization. The feasibility of IESO is validated through time complexity and global convergence analyses. Comparative simulation experiments benchmarked IESO against five state-of-the-art optimization algorithms across test functions and path-planning simulated scenarios. The experimental results indicate that the enhanced algorithm achieves superior optimization precision, faster convergence speeds, and improved quality in the planned trajectories by 30%.

Laser Photoacoustic Spectrometers (LPAS), which provide photoacoustic spectra for detecting food frauds or adulteration, and fluorescence-based systems for recognition of contamination by heavy metal ions in water are two important families of sensors for health and environmental purposes. Both sensor families require one or more low-frequency Lock-In Amplifiers (LIAs) to extract the signal of interest from background noise. In the cited applications, the required LIA frequency is quite low (up to 1kHz), and this leads to a simplification of the hardware with consequent good results in portability, economy, reduced size, weight and low-cost characteristics. The present system, called ENEA DSP Box Due, is based on a very inexpensive microcontroller proto-board and can replace four commercial LIAs, resulting in significant savings in both cost and space. Furthermore, it incorporates a dual-channel oscilloscope and a sinusoidal function generator. This article outlines the architecture of the ENEA DSP Box Due, its electrical characterization and its applications within a project concerning laser techniques for food and water safety.

Background: To investigate the preoperative clinical and radiological factors that predict the development of a postoperative intraabdominal abscess (IAA) in patients with acute appendicitis who were treated by laparoscopic appendectomy (LA). Methods: Two hundred sixteen patients with pathologically proven acute appendicitis underwent LA between January 2013 and March 2018 in our department. Of these, 147 patients were diagnosed with complicated appendicitis (CA) (CA group), while the other 69 patients were diagnosed with simple appendicitis (SA) (SA group). We compared the perioperative clinical and radiographic factors between the two groups and investigated the predictive factors of postoperative IAA. Results: Sixteen patients developed postoperative IAA in the CA group, while no patients did in the SA group. The univariate analysis revealed that time from onset to surgery more than 3 days (p = 0.011), the preoperative CT finding of periappendiceal fluid (p = 0.003), abscess (p < 0.001), and free air (p <0.001), operation time more than 120 minutes (p = 0.023) and placement of a drainage tube (p <0.001) were significantly associated with the development of IAA. Multivariate analysis revealed that the preoperative CT finding of free air was independently associated with the development of IAA (p = 0.007, odds ratio = 5.427). Conclusions: IAA was developed predominantly in the patients with CA. Preoperative CT findings of free air was found to be an independent predictor for the development of IAA. Surgeons should be meticulous in managing the postoperative course of patients with this finding.

Routing quantum information among different nodes in a network is a fundamental prerequisite for a quantum internet. While single-qubit routing has been largely addressed, many-qubit routing protocols have not been intensively investigated so far. Building on the many-excitation transfer protocol in Ref. , we apply the perturbative transfer scheme to a two-excitation routing protocol on a network where multiple two-receivers block are coupled to a linear chain. We address both the case of switchable and permanent couplings between the receivers and the chain. We find that the protocol allows for efficient two-excitation routing on a fermionic network, although for a spin-12 network only a limited region of the network is suitable for high-quality routing.

The generalization of Farey graphs and extended Farey graphs are all originated from Farey graph and scale-free and small-world simultaneously. We propose a labeling of the vertices for it that allows determining all the shortest paths routing between any two vertices only based on their labels. The maximum number of shortest paths between any two vertices is huge as the product of two Fibonacci numbers, however, the label-based routing algorithm runs in linear time O(n). The existence of an efficient routing protocol for Farey-type models should help the understanding of several physical dynamic processes on it.

This manuscript proposes a novel tangent-graph-based method that provides all distinctive topology paths, as a set of trajectories that can not be transformed into each other by gradual bending and stretching without colliding with obstacles. As the global optimal trajectory (limited by dynamic constraints) may not correspond to the shortest path (almost without dynamic constraints), it is important to provide all distinctive topology paths rather than just the globally shortest one. One of the application is provide initial paths for trajectory planning methods, such as time elastic band (TEB) and dynamic window approach (DWA). Considering that a mobile platform is always working in a dynamic changing environment and that update the whole graph is time consuming, a dynamic rectify method is proposed to update tangents according to local map provided by sensor reading. Finally, results under real grid maps are presented.

Due to the long-term deformation settlement of foundations, issues such as damage and functional failure of buildings and structures have long been of concern in the engineering field. The creep of soil is one of the primary causes leading to long-term deformation of foundations. In this paper, the consolidation deformation, creep characteristics, and creep model of reconstituted saturated silty clay were studied by isotropic compression test and triaxial shear creep test. The results show that for the isotropic compression test, although the applied load adopts different stages of loading, as long as the final applied confining pressure is the same, the number of stages applied by the confining pressure has little effect on the final isotropic consolidation deformation of the sample and the triaxial undrained shear strength after creep. However, for the triaxial shear creep test, it is found that under the same final deviatoric stress, the final deviatoric strain of the sample is closely related to the number of loading stages of deviatoric stress. It shows that the more loading stages of the sample loaded with the same deviatoric stress, the smaller the final deviatoric strain, and the triaxial undrained shear strength of the sample after creep will increase. In addition, it is reasonable to determine the pore pressure dissipation of the sample to 95%((u0-u0)/u0=95%) as the main consolidation end time (tEOP) of the sample. The isotropic consolidation creep curves and the triaxial shear creep curves show certain nonlinearity. Then the logarithmic model and the hyperbolic model were used to fit the creep curves of the samples. It is found that the hyperbolic model has a better fitting effect than the logarithmic model, but for the triaxial shear creep test, the creep parameters of the sample change greatly. Therefore, studying the creep characteristics of soil under different pre-loading steps is of significant engineering importance for evaluating the long-term deformation of underground structures.

This paper studies the maximum reliability of multi-hop relay UAV, in which UAV provides wireless services for remote users without direct communication link on the ground as a coded cooperative relay. In this paper, the analytical expressions of total power loss and total bit error rate are derived as reliability measures. Firstly, based on the environmental statistical parameters, a LOS probability model is proposed. Then the problem of minimizing the bit error rate of static and mobile UAVs is studied. The goal is to minimize the total bit error rate by jointly optimizing the height, elevation, power and path loss, and subject to the maximum allowable path loss con-straints, transmission power allocation constraints and UAV height and elevation constraints. At the same time the total path loss is minimized to achieve maximum ground communication cov-erage. However, the formulated joint optimization problem is non-convex and generally difficult to solve. Therefore, we decomposed the problem into two subproblems and proposed an effective joint optimization iteration algorithm. Finally, the simulation results are given, and the analysis shows that the optimal height of different reliability measures is slightly different, and using the mobility of UAVs can improve the reliability of communication performance.

The uncertainty in the secondary path of an Active Noise Control (ANC) headphone affects the waterbed effect and stability of the feedback system. This study focuses on the uncertainty of the secondary path when real users wear headphones, and proposes a new uncertainty constraint based on the measured results of the secondary path transfer function under different wearing conditions of dummy head and limited subjects. This constraint and a cascaded second-order infinite impulse response filter with fixed coefficients are used to formulate a control strategic function, which is optimized by the Improved Grey Wolf Optimizer (IGWO) algorithm to obtain the optimal controller with better noise reduction performance. The proposed method and simulation model are validated based on the experimental test results. The results demonstrate that the safety factor and waterbed suppressing factor contained in the proposed uncertainty constraint ensures more stable noise reduction and effective suppression of the waterbed effect for new subjects without a priori data.

Businesses use technological and social media marketing to respond to the Covid-19 pandemic. This study aims to understand better the factors that impact the spread of new technologies, the effectiveness of social media advertising, and the longevity of businesses. The study used a quantitative strategy based on partial least squares structural equation modeling to learn about the phenomenon of interest as much as possible. Dhaka, Bangladesh, small and medium-sized businesses participated in the survey. According to the findings, the popularity of internet and e-business technologies may be attributed to their apparent usefulness and ease of use. It is connecting internet/e-business technology, social media marketing, and the long-term success of small and medium-sized enterprises. Still, the expense factor was insufficient to prove that SMEs engage in social media advertising. Mediating effects between components may be better understood via internet/e-business technology and social media marketing, as shown by this study. This study is the first of its kind in Bangladesh and sheds light on the resilience of SMEs in the face of the Covivirus-19 pandemic, notwithstanding its focus on the capital city of Dhaka.

Background: Forecasting nonlinear stochastic systems most often is quite difficult, without giving in to temptations to simply simplify models for the sake of permitting simple computations. Objective: Here, two basic algorithms, Adaptive Simulated Annealing (ASA) and path-integral codes PATHINT/PATHTREE (and their quantum generalizations qPATHINT/qPATHTREE) are offered to detail such systems. Method: ASA and PATHINT/PATHTREE have been effective to forecast properties in three disparate disciplines in neuroscience, financial markets, and combat analysis. Applications are described for COVID-19. Results: Results of detailed calculations have led to new results and insights not previously obtained. Conclusion: These 3 applications give strong support to a quite generic application of these tools to stochastic nonlinear systems.

This paper introduces a new routing and touring service both for outdoor and indoor places of touristic and cultural interest designed to be used in the wider area of ​​Attica, Greece. This service is the result of the work done in OPTORER project and it aspires to offer a range of innovative and thematic routes to several specified points of interest in the selected area of Attica, encouraging the combination of indoors and outdoors routes in a single tour. The aim is to optimize the user experience while promoting specific, user-centric features with safety and social welfare being a priority for every designed tour resulting in enhancing the touristic experience in the area. Using a common smartphone device, as well as common wearable devices (i.e., smartwatches), the OPTORER service will provide an end-to-end solution by developing the algorithms and end-user applications, together with an orchestration platform responsible for managing, operating and executing the service that produces and presents to the end user results derived from solving dynamically complex optimization problems.

This paper presents an in-depth contextualized tutorial on Agricultural IoT (Agri-IoT), covering the fundamental concepts, assessment of routing architectures and protocols, and performance optimization techniques via systematic survey and synthesis of related literature. The negative impacts of climate change and the increasing global population on food security and unemployment threats have motivated the adoption of the wireless sensor network (WSN)-based Agri-IoT as an indispensable underlying technology in precision agriculture and greenhouses to improve food production capacities and quality. However, most related Agri-IoT testbed solutions have failed to achieve their performance expectations due to the lack of an in-depth and contextualized reference tutorial that provides a holistic overview of communication technologies, routing architectures, and performance optimization modalities based on users’ expectations. Thus, although IoT applications are founded on a common idea, each use case (e.g., Agri-IoT) varies based on specific performance and users expectations as well as its technological, architectural, and deployment requirements. Likewise, the agricultural setting is a unique and hostile area where conventional IoT technologies do not apply, hence the need for this tutorial. Consequently, this tutorial addresses these via the following contributions: (1) a systematic overview of the fundamental concepts, technologies, and architectural standards of WSN-based Agri-IoT, (2) an evaluation of the technical design requirements of a robust, location-independent, and affordable Agri-IoT, (3) a comprehensive survey of the benchmarking fault tolerance techniques, communication standards, routing and medium access control (MAC) protocols, and WSN-based Agri-IoT testbed solutions, and (4) an in-depth case study on how to design a self-healing, energy-efficient, affordable, adaptive, stable, autonomous, and cluster-based WSN-specific Agri-IoT from a proposed taxonomy of multi-objective optimization (MOO) metrics that can guarantee an optimized network performance. Furthermore, this tutorial established new taxonomies of faults, architectural layers, and MOO metrics for cluster-based Agri-IoT (CA-IoT) networks and a 3-tier objective framework with remedial measures for designing an efficient associated supervisory protocol for cluster-based Agri-IoT networks.

The widespread proliferation of sensor nodes in the era of Internet of Things (IoT) coupled with increasing usage of wireless spectrums especially the ISM band makes it difficult to deploy real-life IoT. Currently, the cognitive radio technology enables sensor nodes communicate with each other through the licensed spectrum bands as well as the free ISM bands. Cognitive radio networks (CRSNs) are considered as a promising solution to the problem of spectrum under utilization and artificial radio spectrum scarcity. The paradigm of dynamic spectrum access allows secondary users (SUs) to utilize wireless spectrum resources which belong to primary users (PUs) with minimal interference to PUs. Due to the dynamic spectrum availability and quality, routing for SUs in multi-hop CRSNs is a challenge. In this paper, we introduce novel routing metrics that estimate both the future spectrum availability and the average transmission time with the consideration of both the global statistical spectrum usage and local instant spectrum resources. In our novel routing metrics, one retransmission is allowed and considered to reduce the probability of rerouting upon PU's arrival. Then, we propose two routing algorithms for multi-hop CRSNs. Finally, we conduct simulations, whose results show that our proposed algorithms lead to a significant performance improvement over the reference algorithm.

Aiming at the APF algorithm in the collision-free path planning and LQR algorithm tracking process, there are problems such as unreachable target points, local optimization, low safety coefficient of autonomous lane change collision avoidance tracking control and poor stability, this paper proposes an optimized APF method, which solves the defects of the traditional artificial potential field method by adding the distance adjustment factor, the safety distance protection model and the sub-target virtual potential field, and at the same time generates the autonomous driving car collision-free path. The path tracking control system is designed based on feed-forward control and DLQR controller, in which the vehicle dynamics state space model is used as the basis, the model is linearized and discretized, and the corresponding constraint variables are set to minimize the control command objective cost function under the constraints, and the objective of the DLQR controller.The objective is to accurately determine the steering angle in order to achieve path tracking and eliminate the lateral error between the reference path and the actual path caused by external interference.Finally, the simulink model and CarSim parameter configuration joint simulation platform are built, and different obstacle scenarios and different speeds are selected for collision-free path planning and tracking motion simulation research and analysis, which verifies the accuracy and practicability of the algorithm, and shows more obvious advantages in obstacle avoidance ability, path smoothing degree, and collision avoidance safety stability. The ideas proposed in this paper are expected to be further extended and popularized to actual path planning problems, which has important practical significance and engineering value.

Daily vitamin D supplementation using higher than normal dosing (up to the upper limit, UL) and intermittent (once or twice per week) dosing were studied in patients with increased risk of vitamin D deficiency. Using a PubMed database an adequate search for published randomized control trials and other studies was done and results were analyzed. This review provides overview of use of 7000 IU daily, 30,000 IU per week or twice weekly and 50,000 IU weekly of vitamin D on rapid restore of 25(OH)D concentrations to at least 30 ng/mL in different groups of patients at high risk of vitamin D deficiency. The above mention dosing should be considered in adults with obesity or multi-diseased patients on requiring multi-treatment with the use of several drugs, including drugs affecting vitamin D metabolism. The simple schedule for 7000 IU/day, 30,000 IU/week or twice weekly or 50,000 IU/week, all for 6-8 weeks of use by patients representing the increased risk of vitamin D deficiency were provided for consideration. It appeared that higher daily doses or intermittent doses suggested above are effective, safe and responsive for patient’s preferences.

Artificial intelligence provides a new research concept for digital image processing. However, at present, artificial intelligence is rarely introduced into the teaching of digital image processing in colleges and universities, and there are problems such as obsolete teaching content, single teaching methods, and simple course experiments, which affect the teaching effect and are not conducive to the cultivation of comprehensive and innovative talents. Digital image processing technology brings more possibilities to communication engineering and makes communication more convenient. For example, video calls and photo transmission make people's communication methods in daily life more and more diversified. Time and space limitations allow people to meet online, creating more communication possibilities. However, there are still many problems and methods worthy of in-depth exploration. Therefore, this paper has a comprehensive understanding and mastery of the traditional and deep learning methods of digital image processing to improve the relevant project practice and scientific research exploration ability and refer for similar research conclusions.

The blood counts of α thalassemia carriers (α-thal) are similar to those of β thalassemia carriers, except for Hgb A2 that is not elevated. The objective of this study was to determine whether mathematical formulas are effective for detecting suspected α-thal. The data were obtained from the database of the prevention program for detecting couples at risk for having a child with hemoglobinopathy. RBC indices were analyzed using mathematical formulas and the sensitivity and negative predictive value (NPV) calculated. Among 1334 blood counts suspected α-thal analyzed, only the Shine&Lal and the Support Vector Machine formulas revealed high sensitivity and NPV. Sensitivity was 85.54 and 99.33% and NPV 98.93 and 99.93%, respectively. Molecular defects were found in 291, 81 had normal α genes. Molecular analysis was not performed in 962. Based on these results, mathematical formulas incorporating one of these reliable formulas for detecting suspected α or β thalassemia carriers in the program of the automatic analyzers can flag these results and increase the awareness of the primary physicians about the carrier risk and send an alert with a recommendation for further testing.

This study explores fault-tolerant consensus in leader-following heterogeneous multi-agent systems, focusing on actuator failures in uncrewed aerial vehicles (UAVs) and uncrewed ground vehicles (UGVs). An optimization-based fault-tolerant consensus algorithm is proposed. The algorithm utilizes the Euler-Lagrange formula to ensure system consistency under actuator failures, with the Lyapunov stability theory proving the asymptotic stability of the consistency error. The algorithm is applied to heterogeneous multi-agent systems of UAVs and UGVs to derive optimal fault-tolerant consensus control laws for each vehicle type. Simulation experiments give evidence for the feasibility of the proposed control strategy.

We describe an interesting case report about a patient with hemophilia A with severe chronic elbow arthropathy who underwent multiple surgical because of his condition. We collected all the clinical and imaging findings, and we compared the decision-making flow chart and the surgery performed with the most recent indications, treatments and complications reported in the literature. The aim of this case report is to show how usually the hemophilic patient even if young usually comes to our attention from the beginning with complex and advance musculoskeletal disease. Elbow hemophilic arthropathy is a complex disease and the management in these patients could be more difficult than others because of the higher risk of complications rate after all surgical procedures, for this reason it’s very important to treat these patients in hub centers with expertise in well-coordinated multidisciplinary teams. The path from diagnosis to surgical treatment of hemophilic elbow arthropathy can be a risky one, as it happened in this case.

Session-based recommendations which aim to predict subsequent user-item interaction based on historical user behavior during anonymous sessions can be challenging tasks. Two main challenges need to be addressed and improved: (1) How to analyze these sessions to accurately and completely capture users’ preferences, and (2) how to identify and eliminate any interference caused by noisy behavior. Existing methods have not adequately addressed these issues since they either neglected the valuable insight that can be gained from analyzing consecutive groups of items or failed to take these noisy data in sessions seriously and handled them properly, which can jointly impede recommendation systems from capturing users’ real intentions. To address these two problems, we designed a multi-order semantic denoising (MSD) model for session-based recommendations. Specifically, we grouped items of different lengths as varying multi-order semantic units to mine the user’s primary intention from multiple dimensions. Meanwhile, a novel denoising network was designed to alleviate the interference of noisy behavior and provide a more precise session representation. The result of extensive experiments on three real-world datasets demonstrated that the proposed MSD model exhibited improved performance compared with existing state-of-the-art methods in session-based recommendation.

This study explores the crucial roles of energy literacy, transition, and justice in addressing the global climate crisis. Through a systematic bibliometric survey and thematic analysis of existing literature, we identify a scarcity in research (<0.1%, n = 17,773) concurrently integrating the three crucial terms: energy literacy; energy transition; and energy justice. This study emphasizes the importance of energy literacy in empowering societies to make informed decisions, which is essential for facilitating equitable energy transitions and achieving sustainability goals. We delve into the interconnections between energy literacy and energy justice, proposing the integration of these concepts into educational systems, including social media platforms to foster an understanding of energy systems, their environmental impacts, and socio-economic implications. Emphasizing the strategic use of social media, the study also introduces the ‘COMPEL Justice’ framework—Communities Prepared for Energy Literacy and Justice—which aims to enhance public engagement and participation in energy transition initiatives. By analyzing publications from various academic and governmental sources, we provide insights into the challenges and opportunities that lie in promoting energy literacy and justice, particularly in the context of global efforts to mitigate climate change and enhance energy equity. Finally, exemplary application and implications associated with the adoption of the proposed framework within the context of oil-producing regions (e.g., Louisiana in the United States) are presented.

Dairy farming dates to the early Neolithic era in Europe, Middle East, Asia, and Africa. Over time, the industry has evolved from small ranches and farmhouses milk processing units to large, intensive dairy farms and big, high-tech processing units. Despite the industry’s contribution to the economy and food production, multiple studies have tainted cattle farming as a main contributor to climate change. This study explores literature in dairy farming and sustainable development goals (SDGs) to identify current scholarly developments since the formulation and adoption of SDGs in 2015 and themes for future research. This paper argues that dairy animals are not the source of sustainability shortfalls as depicted by multiple scholarly articles, but human processes associated with dairy farming. Data was analyzed using R package, Excel, NVIVO, and VoS Viewer. A review of literature shows that dairy farming and its contribution to sustainability has gained more intensive scientific interest since 2015. Moreover, livestock management, feed production and management, stakeholder’s management, logistics and supply chain management, and waste management are the sources of environmental adversities associated with dairy farming. Notably, these are human processes developed from commercialization of dairy farming and involve multiple stakeholders across the supply chain. While solutions are embedded within these processes, innovation emerges as a key driver of sustainability and source of opportunities to strengthen sustainability in dairy farming sector and achieve the sustainable development goals.

Earth observation satellites can capture images of specific areas in Earth's orbit based on user requirements. Despite the high demand for satellite imagery, satellites remain a scarce resource. When there are many observation tasks that are large and dense, they may interfere with each other due to satellite mobility. To address this issue, a multi-satellite scheduling algorithm based on a task merging mechanism has been proposed. This paper proposes a two-stage approach to the problem: task merging phase and merging task scheduling phase. The task merging phase introduces two methods based on Mean Shift and Complete Graph to generate the merging task set. In the merging task scheduling phase, a multi-satellite scheduling algorithm based on merging tasks is employed to solve the problem. Finally, certain measurement experiments suggest the effectiveness of the algorithm.

Public safety and intelligent surveillance systems critically depend on anomaly behavior detection for effective monitoring. In real-world pedestrian detection scenarios, prevalent challenges such as missed detections, complex background interference, and small target sizes hinder accurate anomaly identification. To address these issues, this study introduces YOLO-ABD, a lightweight method for anomaly behavior detection that integrates small target detection and channel shuffling. This method employs YOLOv8n as the baseline model, incorporating a small target detection mechanism in the Head part and utilizing GSConv convolution in the Backbone to enhance perceptual capability. Additionally, the SimAM attention mechanism is integrated to mitigate complex background interference, thereby improving target detection performance. Evaluation on the IITB-Corridor dataset demonstrated mAP50 and mAP50-95 scores of 89.3% and 60.6%, respectively. Generalization testing on the street-view-gdogo dataset further highlighted the superiority of YOLO-ABD over advanced detection algorithms, underscoring its effectiveness and generalizability. With a relatively small parameter count, YOLO-ABD presents an excellent lightweight solution for pedestrian anomaly behavior detection.

Light can interfere like a wave in a multi-path experiment, but it also has particle properties when interacting with matter. In a closer look, the interference pattern is created by many individual detections ("clicks"), which do not all occur simultaneously. An established assumption is therefore that a single light particle is capable of interfering with itself by superimposing all possibilities to get from the source to the detector. This is in stark contrast to our experience with macroscopic objects, which always "decide" in favour of only one of the alternative paths.In 2010, Jin et al. (Ref. 15) described an event-based model which allowed the authors to show that an interference pattern consisting of clicks can arise in a multi-path experiment even if photons, like macroscopic objects, only follow one path. To do this, photons must be able to transmit the information about their travelling duration to the detector and the detector must have a basic memory. A threshold function uses the message of several light quanta to decide whether a single detection is initiated, which is not the evidence for a single photon. In this "proof of principle", the authors do not claim that the detector function is a realistic one.In the present paper, this detector is replaced by a material consisting of ionizable molecules whose interaction with light takes place according to a modified version of Einstein's radiation laws. Based on this, a photon pair interaction mediated by matter takes place, which in a multi-path experiment generates an interference pattern of clicks at the detector, even if an arbitrary amount of time elapses between the individual detections. In the present model an interference pattern with minima that have less than half the intensity of the maxima is the result of a peculiar behaviour of the detector: In this case, the entirety of its electrons must be described as a unit (a “field”) with many equidistant energy levels. The results of a simulation are presented which enable the model to be tested in experiments.

Light can interfere like a wave in a multi-path experiment, but it also has particle properties when interacting with matter. In a closer look, the interference pattern is created by many individual detections ("clicks"), which do not all occur simultaneously. An established assumption is therefore that a single light particle is capable of interfering with itself by superimposing all possibilities to get from the source to the detector. This is in stark contrast to our experience with macroscopic objects, which always "decide" in favour of only one of the alternative paths.In 2010, Jin et al. (Ref. 15) described an event-based model which allowed the authors to show that an interference pattern consisting of clicks can arise in a multi-path experiment even if photons, like macroscopic objects, only follow one path. To do this, photons must be able to transmit the information about their travelling duration to the detector and the detector must have a basic memory. A threshold function uses the message of several light quanta to decide whether a single detection is initiated, which is not the evidence for a single photon. In this "proof of principle", the authors do not claim that the detector function is a realistic one.In the present paper, this detector is replaced by a material consisting of ionizable molecules whose interaction with light takes place according to a modified version of Einstein's radiation laws. Based on this, a photon pair interaction mediated by matter takes place, which in a multi-path experiment generates an interference pattern of clicks at the detector, even if an arbitrary amount of time elapses between the individual detections. In the present model an interference pattern with minima that have less than half the intensity of the maxima is the result of a peculiar behaviour of the detector: In this case, the entirety of its electrons must be described as a unit (a “field”) with many equidistant energy levels. The results of a simulation are presented which enable the model to be tested in experiments.

With the rapid development of smart phones, tablets and their operative systems, many positioning enabled sensors have been built into these devices. Users can now accurately fix their location according to the function of GPS receivers. For indoor environments, as in the case we are studying, WiFi based positioning is preferred to GPS due to the attenuation or obstruction of signals. This paper deals with the automatic classification of customers in a Sports Shop Center on the basis of their movements around the shop's premises. To achieve this goal, we start by collecting (x,y) coordinates from customers while they visit the store. Consequently, any costumer's path through the shop is formed by a list of coordinates, obtained with a frequency of one measurement per minute. Then, a guess about the full trajectory is constructed and a number of parameters about these trajectories is calculated before performing an Unsupervised Learning Clustering Process. As a result, we can identify several types of customers, and the dynamics of their behavior inside the shop. This information is of great value to the company, to be used both in the long term and also in short periods of time, monitoring the current state of the shop at any moment, identifying different types of situation appearing during restricted periods, or predicting customer flow conditions

Railway has been used as one of the most crucial means of transportation in public mobility and economic development. For efficiently operating railways, the electrification system in railway infrastructure, which supplies electric power to trains, is essential facilities for stable train operation. Due to its important role, the electrification system needs to be rigorously and regularly inspected and managed. This paper presents a supervised learning method to classify Mobile Laser Scanning (MLS) data into ten target classes representing overhead wires, movable brackets and poles, which are recognized key objects in the electrification system. In general, the layout of railway electrification system shows a strong regularity of spatial relations among object classes. The proposed classifier is developed based on Conditional Random Field (CRF), which characterizes not only labeling homogeneity at short range, but also the layout compatibility between different object classes at long range in the probabilistic graphical model. This multi-range CRF model consists of a unary term and three pairwise contextual terms. In order to gain computational efficiency, MLS point clouds is converted into a set of line segments where the labeling process is applied. Support Vector Machine (SVM) is used as a local classifier considering only node features for producing the unary potentials of CRF model. As the short-range pairwise contextual term, Potts model is applied to enforce a local smoothness in short-range graph. While, long-range pairwise potentials are designed to enhance spatial regularities of both horizontal and vertical layouts among railway objects. We formulate two long-range pairwise potentials as the log posterior probability obtained by Naïve Bayes classifier. The directional layout compatibilities are characterized in probability look-up tables which represent co-occurrence rate of spatial relations in horizontal and vertical directions. The likelihood function is formulated by multivariate Gaussian distributions. In the proposed multi-range CRF model, the weight parameters to balance four sub-terms are estimated by applying the Stochastic Gradient Descent (SGD). The results show that the proposed multi-range CRF can effectively classify detailed railway elements, representing the average recall of 97.66% and the average precision of 97.07% for all classes.

The Soil and Water Assessment Tool (SWAT) is one of the most widely used hydrologic models. SWAT has been undergoing constant changes since its development. However, compartment review and testing of SWAT are comparably limited, especially the flood routing functions. In this study, the daily flood routing subroutines of different SWAT versions were reviewed and tested using a well observed segment of the Weser river located in Germany. Results show several problems with the flood routing subroutines of SWAT. The variable storage subroutine of SWAT (revision 664) does not transform the flood wave. Unphysical results could be obtained with the variable storage routing of SWAT (revision 528). The Muskingum subroutine of SWAT (revisions 664 and 528) overestimates channel evaporation (resulting in a bias of 14\% to 19% in streamflow) and underestimates transmission losses. Simulated results show that the timing and shape of the flood wave could be improved with a corrected Muskingum subroutine. Based on the results of this study, we suggest the SWAT user community to review their existing SWAT models to see how the aforementioned issues will affect their methods, findings and conclusions.

The reliability of Underwater Wireless Sensor Networks (UWSNs) is measured in terms of energy consumption (EC), end-to-end delay(E2E) and packet delivery ratio (PDR). The adverse effects of channel may cause data loss. Reducing delay up to possible extend improves the reliability of the network, also increasing the number of nodes in a particular network increase reliability. Besides, increasing the number of nodes improve reliability but also increase power consumption. In order to overcome these shortcomings, the two routing protocols are proposed in this paper, namely Delay and Reliability Aware Routing (DRAR) protocol and Cooperative Delay and Reliability Aware Routing (Co-DRAR) protocol for UWSNs. In DRAR protocol, network is divided into two equal regions where two sink nodes(SNs) are positioned at upper region of the network and two SNs are placed at the mid region of the network. The protocol choose the relay node based on residual energy (RE), distance and Bit Error Rate (BER). These parameters protect the data packets from corruption and also provide stable path (where nodes remain active for longer period and do not die quickly). The protocol uses single link and may get worse sometimes while changing channel circumstances. To address this problem, cooperative routing scheme is added to DRAR protocol in order to developed its enhanced version known as Co-DRAR protocol. The protocol works by allowing the destination to receive multiple copies of data packets in order to decide the quality of packets. The proposed protocols DRAR and Co-DRAR perform routing irrespective to geographical position of sensors nodes conversely to the some of conventional routing protocols that's way our propose protocol better perform than the well-known protocol i.e. Depth base routing (DBR) in terms of EC, E2E, PDR, dead nodes, packet drop ratio and number of alive nodes (ANs).

A new variant of two-echelon routing problem is investigated, where the truck and the drone are used to cooperatively complete the deliveries of all parcels. The truck not only acts as a tool for parcel delivery, but also serves as a moving depot for the drone. The drone can carry several parcels and take off from the truck, while returning to the truck after completing the delivery. The energy consumption model for the routing process of the drone is analyzed, when it is utilized to deliver multiple parcels. A two-stage route-based modelling approach is proposed to optimize both the truck’s main route and the drone’s adjoint flying routes. A hybrid heuristic integrating nearest neighbor and cost saving strategies is developed to quickly construct a feasible solution. The simulated annealing algorithm is applied to improve the quality of the solution, where a Tabu list is employed to improve the search efficiency. Random instances at different scales are used to test the performance of the proposed algorithm. A case study based on the practical road network in Changsha, China, is presented, through which the sensitivity analysis is conducted with respect to some critical factors.

Snow crab replaced groundfish fisheries as the primary focus of the Newfoundland and Labrador (NL) fishing industry in the mid-1990s. Over the past three decades, management philosophies in this male-only fishery have shifted from promoting industry expansion to promoting industry rationalization to implementing Precautionary Approach (PA) management. Until the mid-2010s, there were regionalized management strategies characterized by higher exploitation rates in northern than southern sub-stock units along the NL marine shelves. However, in the late 2010s, exploitation rates were permitted to elevate to high levels across the entire stock range in association with a large resource decline and evidence of biological harm through fishing emerged in chronically depleted areas. In 2019, when stock and fishery productivity were near historic lows, a multi-indicator PA system was informally introduced into management of the resource. This event coincided with anticipated improvements in stock and fishery performance. This paper examines the extent to which the multi-indicator PA management system, focused on promotion of both biological protection and maximization of fishing efficiency, may have contributed to recent improvements in stock and fishery status. A suite of indicators from areas implementing PA guidance into management in 2019 prior to formal adoption of the PA system in 2023 suggest the system has been highly beneficial in promoting rapid recovery, improving stock and fishery performance metrics to levels matching or exceeding historic levels under similar conditions. We discuss capacity of the system to better safeguard biological aspects of resource and fisheries productivity moving forward under a scenario of an expectant resource decline.

This paper proposes an electric vehicle routing problem with considering states of charging stations and suggests solution strategies. Charging of electric vehicles is a main issue in the field of electric vehicle routing problem. There are many studies to find locations of charging stations, recharging functions for batteries of vehicles, and so on. However, states of charging stations significantly affect the routes of electric vehicles, which is not much explored. The states may include open or close of charging stations, occupied or empty of charging slots, and so on. This paper investigates how the states of charging stations are estimated and routing strategies are determined. We formulate a mixed integer programming model and suggest how to solve the problem with exact method. Numerical examples provide the optimal routing strategies of electric vehicles in the changing environments of the states of charging stations.

River flood routing computes changes in shape of a flood wave over time as it travels downstream along a river. Conventional flood routing models, especially hydrodynamic models require high quality and quantity of input data such as measured hydrologic time series, geometric data, hydraulic structures and hydrological parameters. Unlike physically based models, machine learning algorithms, which are data driven models, do not require much knowledge about underlying physical processes and can identify complex nonlinearity between inputs and outputs. Due to the higher performance, less complexity, and low computation cost, novel machine learning methods as a single application or hybrid application were introduced by researchers to achieve more accurate and efficient flood routing. This paper reviews the recent application of machine learning methods in river flood routing.

The purpose of this paper is to develop a theoretical predictive model for LNG shipping routes selection process. Strategic decisions about shipping costs could be improved if a deeper knowledge about products economic value is provided. Developments made on the extraction and industrial processes related to this fossil fuel are driving the natural gas sector towards a unique globalised market. Moreover, data analytics applications as well as machine learning are topics presented as perfect catalysers for achieving an unprecedented natural gas globalised market. Additionally, this paper aims at showing the state of the art of new techniques used in transportation engineering that might have synergies with other industries (eg. commodities cost reduction, energy supply…). Finally, this paper aims to provide foundation for further research and development using more sophisticated data and algorithms that will help to close the gap between theoretical and practical scope of this techniques.

Opportunistic Routing is a promising paradigm that has been proposed for efficient and reliable transfer of data packets in mobile ad hoc networks. This routing strategy takes advantage of the broadcasting nature of the wireless medium to increase the number of probable forwarding devices and improves the reliability of data transfer in the network. Opportunistic Routing utilizes the reception of the same broadcasted packet at multiple devices in the network and selects one best forwarder dynamically from the set of multiple receivers. A number of opportunistic routing protocols have been proposed over these years for effective data delivery in ad hoc networks. But as the speed and mobility of devices increases in the network, performances of the existing opportunistic routing protocols degrade considerably, leading to reduced Quality of Service and poor transmission efficiency. The exceptional potential of opportunistic routing is thus underutilized. In this research we introduce Optimized Opportunistic Routing (OOR) strategy that guarantee excellent Quality of Service and high transmission efficiency to the latest applications using opportunistic routing for communication in highly dynamic ad hoc networks. Simulation results show that our method achieve significant performance improvements compared to all other existing opportunistic routing protocols in highly dynamic mobile ad hoc networks.

Traditional 3D reconstruction models have consistently encountered a challenge: attaining high recall of object edges while preserving precision. In this paper, we introduce a post-processing method Multi-Head Attention Refiner (MA-R) aimed at tackling this challenge by integrating a multi-head attention mechanism within the U-Net style refiner module. The 3D reconstruction model applying this method demonstrates excellence in parsing intricate image details, resulting in significant enhancement of boundary predictions and increased recall rates. In our experiments, our method significantly enhances the reconstruction performance of Pix2Vox++ when multiple images are utilized as input. Specifically, it achieves an enhanced Intersection Over Union score of approximately 1.1% compared to the original Pix2Vox++ model when 16-view images are employed.

We propose an innovative approach called SMPTC3, designed specifically to enhance security and privacy in cross-chain transaction verification. This approach addresses multi-chain, multi-participant information exchange and large-scale cross-chain transfers, resisting various types of malicious attacks. We leverage the verifiability of cross-chain transactions based on smart contracts and innovatively transform transaction information into confidential sets, organizing them into quadratic secret polynomials. By utilizing secret sharing and random distribution techniques, we construct a secure multiparty computation method, tailored for cross-chain transactions. To enhance the efficiency of cross-chain transactions, we introduce cross-chain batch processing technology, grouping inter-chain transactions into cross-chain transaction sets. Unlike traditional distributed notary technologies, SMPTC3 designates honest participants as a cross-chain notary group, reducing the time required for redundant signature confirmations and significantly lowering the possibility of malicious notaries. Theoretical analysis and empirical experiments demonstrate that SMPTC3 is highly efficient in addressing cross-chain transaction security issues.

With the large-scale application of Internet of Things (IoT) in the medical field, eHealthcare has attracted wide attention. With the help of IoT devices, eHealthcare allows doctors to monitor patients’ health conditions and make recommendations accordingly. The addition of cloud computing greatly saves Healthcare Center’s (HC) computing resources. In order to provide privacy and fine-grained access control, Attribute-b ased encryption (ABE) is widely favored. HC usually operates multiple medical institutions in different regions, and each medical institution can be regarded as a attribute authority. Therefor, multi-authority (MA) ABE is usually concerned to encrypt the patient data. However for existing MA-ABE algorithms, the ciphertext is long and the efficiency of encryption and decryption is low. These problems will greatly increase the computing burden of patients and seriously affect the efficiency of data transmission. Hence we propose a decentralized key-policy MA-ABE in eHealthcare. The proposed algorithm can achieve decentralization, that is, it does not need central authority. Meanwhile, compared with existing MA-ABE algorithms, the length of ciphertext generated by our algorithm is shorter, and the efficiency of encryption and decryption is significantly improved. With the help of Java Pairing Based Cryptography, we carried out the experiments which show that our algorithm can effectively reduce the time required for encryption and decryption.

ABSTRACT Purpose: Tongue image analysis for disease diagnosis is an ancient traditional non-invasive diagnosis technique widely used by traditional medicine practitioners. Deep Learning based multi-label disease detection models offer tremendous potential to clinical decision support systems, by facilitating preliminary diagnosis. Methods: In this work, we propose a multi-label disease detection pipeline, where in observation and analysis of tongue images captured and received via smartphones assist in predicting the health status of an individual. All images are voluntarily given by subjects consulting collaborating physicians. Images thus acquired are first and foremost classified either into a diseased or a normal category by a 5-fold cross-validation algorithm using a convolution neural network (MobileNetV2) model for binary classification. Once the diseased label is predicted, the image is used to diagnose multiple diseases using the prediction algorithm based on DenseNet121. Results: Average accuracy of 93 % was achieved in classifying diseased from normal healthy tongue by detection model with MobileNetV2 architecture. Multilabel disease classification produced more than 90% accurate results for the seven class labels considered. Conclusion: AI based image analysis shows promising results and an extensive dataset could provide further improvements to this approach. Rather than employing high-cost sophisticated image capturing setup, experimenting with smartphone images opens opportunity to provide preliminary health status to individuals on smartphone prior to further line of treatment and diagnosis.

Assessing the quality of corn seeds necessitates evaluating their content of water, fat, protein, and starch. This study integrates hyperspectral imaging technology with chemometric analysis techniques to achieve non-invasive and rapid detection of multiple key components in corn seeds. Hyperspectral images of the embryo surface of maize seeds were collected within the wavelength range of 1100~2498nm. Subsequently, image segmentation techniques were applied to extract the germ structure of the corn seeds as the region of interest. Seven spectral data preprocessing algorithms were employed, and the Detrending Transformation (DT) algorithm was identified as the optimal preprocessing method through comparative analysis using the Partial Least Squares Regression (PLSR) model. To reduce spectral redundancy and streamline the prediction model, three algorithms were employed for characteristic wavelength extraction: Successive Projections Algorithm (SPA), Competitive Adaptive Reweighted Sampling (CARS), and Uninformative Variable Elimination (UVE). Using both the original spectra and the extracted characteristic wavelengths, four content detection models were constructed: PLSR, Back Propagation Neural Network (BPNN), Radial Basis Function Neural Network (RBFNN), and Least Squares Support Vector Machine (LSSVM). The experimental results demonstrate that the DT-CARS-LSSVM model exhibits exceptional accuracy and stability in predicting these four key components, with determination coefficients of 0.9877, 0.9344, 0.9827, and 0.9592, respectively. This study not only provides a scientific basis for evaluating the quality of corn seeds but also opens up new avenues for the development of non-invasive detection technology in related fields.

The state of the grinding wheel in the grinding process directly affects the surface quality of the workpiece. The monitoring of the wear state of the grinding wheel can effectively identify the wear information of the grinding wheel and timely and effectively repair the grinding wheel. In this paper, a multi-sensor fusion precision grinding wheel wear intelligent monitoring system is established for typical difficult-to-machine aerospace material titanium alloy, and a multi-eigenvalue fusion algorithm based on improved support vector machine (SVM) is proposed. The extracted sound emission signal wavelet packet decomposition coefficient mean square value, force signal grinding force ratio, and vibration signal effective value are used as the input of the improved support vector machine, and the identification strategy is adjusted by the entropy weight evaluation method. The results show that the monitoring system established in this paper can effectively identify the wear state of the grinding wheel, and the monitoring accuracy can reach more than 92%.

The objective of image super-resolution is to reconstruct a high-resolution (HR) image with the prior knowledge from one or several low-resolution (LR) images. However, in the real world, due to the limited complementary information, the performance of both single-frame and multi-frame super-resolution reconstruction degrades rapidly as the magnification increases. In this paper, we propose a novel two-step image super resolution method concatenating multi-frame super-resolution (MFSR) with single-frame super-resolution (SFSR), to progressively upsample images to the desired resolution. The proposed method consisting of an L0-norm constrained reconstruction scheme and an enhanced residual back-projection network, integrating the flexibility of the variational model-based method and the feature learning capacity of the deep learning-based method. To verify the effectiveness of the proposed algorithm, extensive experiments with both simulated and real world sequences were implemented. The experimental results show that the proposed method yields superior performance in both objective and perceptual quality measurements, compared to the baseline super-resolution algorithms in the cascade model. In addition, the experiment indicates that this cascade model can be robustly applied to different SFSR and MFSR methods.

This paper proposes a new approach for multi-focus images fusion based on Region Mosaicing on Contrast Pyramids (REMCP). A density-based region growing method is developed to construct a focused region mask for multi-focus images. The segmented focused region mask is decomposed into a mask pyramid, which is then used for supervised region mosaicking on a contrast pyramid. In this way, the focus measurement and the continuity of focused regions are incorporated and the pixel level pyramid fusion is improved at the region level. Objective and subjective experiments show that the proposed REMCP is more robust to noise than compared algorithms and can fully preserves the focus information of the multi-focus images meanwhile reducing distortions of the fused images.

Driven by the growing interest of the scientific community and the proliferation of research in this field, cranial implants have seen significant advancements in recent years regarding design techniques, structural optimisation, appropriate material selection and fixation system method. Custom implants not only enhance aesthetics and functionality but are also crucial for achieving proper biological integration and optimal blood irrigation, critical aspects in bone regeneration and tissue health. This research aims to optimize the properties of implants designed from triply periodic minimal surface structures. The gyroid architecture is employed for its balance between mechanical and biological properties. Experimental samples were designed varying three parameters of the surface model: cell size, isovalue and shape factor. Computational simulation tools were used for determining the relationship between those parameters and the response variables: the surface area, permeability, porosity and Young modulus. These tools include computer aided design, finite element method and computational fluid dynamics. With the simulated values, the corresponding regression models were fitted. Using the NSGA-II, a multi-objective optimisation was carried out, finding the Pareto set which includes surface area and permeability as targets, and fulfil the constraints related with the porosity and Young modulus. From these non-dominated solutions, the most convenient for a given application was chosen, and an optimal implant was designed, from a patient computed tomography scan. An implant prototype was additively manufactured for validating the proposed approach.

The arsRBC operon encodes a 3-protein arsenic resistance system. ArsR regulates the transcription of the operon, while ArsB and ArsC are involved in exporting trivalent arsenic and reducing pentavalent arsenic respectively. Previous research in Agrobacterium tumefaciens 5A demonstrated ArsR has regulatory control over a wide range of metal related proteins and metabolic pathways. We hypothesized that ArsR has broad regulatory control in other Gram-negative bacteria and set out to test this. Here, we use differential proteomics to investigate changes caused by the presence of the arsR gene in human microbiome-relevant Escherichia coli during arsenite (AsIII) exposure. We show that ArsR has broad-ranging impacts such as the expression of TCA cycle enzymes during AsIII stress. Additionally, we found that the Isc [Fe-S] cluster and molybdenum cofactor assembly proteins are upregulated regardless of the presence of ArsR under these same conditions. An important finding from this differential proteomics analysis was the identification of response mechanisms that were strain, ArsR, and arsenic specific, providing new clarity to this complex regulon. Given the widespread occurrence of the arsRBC operon, these findings should have broad applicability across microbial genera, including sensitive environments such as the human gastrointestinal tract.

With the continuous improvement and observable benefits of electric vehicles (EVs), major logistic companies are introducing more EVs into their conventional fleets. This gives rise to a new type of vehicle routing problem with mixed vehicles, where heterogeneous internal combustion vehicles (ICVs) and electric vehicles are considered in route planning. In addition, certain deliveries that are not efficient on any type of vehicles, are outsourced to third-party common carriers. In this paper, we define this problem as a mixed vehicle routing problem with common carriers (MVRPC). The objective of such problems is to minimize the transportation costs by considering routes with ICVs and EVs, the possibility of visiting recharging stations, outsourcing options, and drivers’ layover regulations. This variant of the vehicle routing problems has many practical applications, particularly in the design of long-haul transportation and last-mile delivery services. Effective MVRPC solutions play a key role in promoting the going Green image and optimally allocating resources. The problem has received limited attention in the literature likely because addressing all the needed aspects is especially challenging. To solve the large-scale problem, we develop a branch-and-cut pricing framework that relies on strong cuts and customized labeling algorithms. Numerical experiments highlight the effectiveness of our algorithm. This success can be attributed to tailored critical resources, dynamically bounded bidirectional labeling procedures, strong dominance criteria, and implementation strategies.

Background: Forecasting nonlinear stochastic systems most often is quite difficult, without giving in to temptations to simply simplify models for the sake of permitting simple computations. Objective: Here, two basic algorithms, Adaptive Simulated Annealing (ASA) and path-integral codes PATHINT/PATHTREE (and their quantum generalizations qPATHINT/qPATHTREE) are offered to detail such systems. Method: ASA and PATHINT/PATHTREE have been effective to forecast properties in three disparate disciplines in neuroscience, financial markets, and combat analysis. Applications are described for COVID-19. Results: Results of detailed calculations have led to new results and insights not previously obtained. Conclusion: These 3 applications give strong support to a quite generic application of these tools to stochastic nonlinear systems.

Keywords: olfactory rehabilitation; chronic pain; fMRI;

Unmanned aerial vehicle (UAV), or drone is recognized for its potential to improve efficiency and address last-mile delivery issues. As a result, there has been a lot of activity in recent years in the field of drone scheduling and routing. Unlike the vehicle routing problem, drone route design is difficult due to several operational characteristics, such as speed optimization, multitrip operation, and energy consumption estimation. On the one hand, drone energy consumption is a complex nonlinear function of both speed and payload in practice. On the other hand, the high operating speed of drones can significantly curtail the drone range, thereby limiting the efficiency of drone delivery systems. Most of the existing drone delivery models either assume constant drone speed or do not consider the effect of drone speed and parcel weight on energy consumption, leading to costly or energy-infeasible routes. This paper addresses the trade-off between speed and flight range in a multi-trip drone routing problem with variable flight speeds (DRP-VFS), in which a team of homogeneous drones is employed for delivery services. We propose a new model to particularly consider energy constraints using a nonlinear energy consumption model and treat drone speeds as decision variables so that various drone speeds can be adopted in applications. The DRP-VFS is initially formulated as mixed-integer linear programming (MILP) to minimize total energy consumption. To solve large-scale instances, we propose a three-phase adaptive large neighborhood search (ALNS) algorithm. The experimental results demonstrate that suboptimal solutions can be found effectively in practical scenarios using the proposed method. Furthermore, results indicate that operating drones at variable speeds leads to about 21% of energy savings compared to fixed speeds, boasting advantages in cost-savings and range extensions.

Internet of things (IoT) is a network of smart things. This indicates the ability of these physical things to transfer information with other physical things. The characteristics of these networks, such as topology dynamicity and energy constraint, challenges the routing problem in these networks. Previous routing methods could not achieve the required performance in this type of network. Therefore, developers of this network designed and developed specific methods in order to satisfy the requirements of these networks. One of the routing methods is utilization of multipath protocols which send data to its destination using routes with separate links. One of such protocols is RPL routing protocol. In this paper, this method is improved using composite metrics which chooses the best paths used for separate routes to send packets. We propose Energy and Load aware RPL (ELaM-IoT) protocol, which is an enhancement of RPL protocol. It uses a composite metric, calculated based on remaining energy, hop count, Link Expiration Time (LET), load and battery depletion index (BDI) for the route selection. In order to evaluate and report the results, the proposed ELaM-IoT method is compared to the ERGID and ADRM-IoT approaches with regard to average remaining energy, and network lifetime. The results demonstrate the superior performance of the proposed ELaM-IoT compared to the ERGID and ADRM-IoT approaches.

Due to the inherent limitations of a single viewpoint, reconstructing 3D human meshes 1 from a single image has long been a challenging task. While deep learning networks enable us to 2 approximate the shape of unseen sides, capturing the texture details of the non-visible side remains 3 difficult with just one image. Traditional methods utilize Generative Adversarial Networks (GANs) 4 to predict the normal maps of the non-visible side, thereby inferring detailed textures and wrinkles 5 on the model’s surface. However, we have identified challenges with existing normal prediction 6 networks when dealing with complex scenes, such as a lack of focus on local features and insufficient 7 modeling of spatial relationships.To address these challenges, we introduce EMAR—Enhanced 8 Multi-scale Attention-driven Single Image 3D Human Reconstruction. This approach incorporates 9 a novel Enhanced Multi-Scale Attention (EMSA) mechanism, which excels at capturing intricate 10 features and global relationships in complex scenes. EMSA surpasses traditional single-scale attention 11 mechanisms by adaptively adjusting the weights between features, enabling the network to more 12 effectively leverage information across various scales.Furthermore, we have improved the feature 13 fusion method to better integrate representations from different scales. This enhanced feature fusion 14 allows the network to more comprehensively understand both fine details and global structures 15 within the image. Finally, we have designed a hybrid loss function tailored to the introduced attention 16 mechanism and feature fusion method, optimizing the network’s training process and enhancing the 17 quality of reconstruction results.Our network demonstrates significant improvements in performance 18 for 3D human model reconstruction. Experimental results show that our method exhibits greater 19 robustness to challenging poses compared to traditional single-scale approaches.

Although the field of geomatics has seen multiple technological advances in the recent years which enabled new applications and simplified the consolidated ones, some tasks remain challenging, inefficient, and time- and cost-consuming. This is the case of accurate tridimensional surveys of narrow spaces. Static laser scanning is an accurate and reliable approach but impractical for extensive tunnel environments; portable laser scanning is on the other hand time-effective and efficient but not very reliable without ground control constraints. This paper describes the development process of a novel image-based multi-camera system meant to solve this specific problem: delivering accurate, reliable, and efficient results. The development is illustrated from the system conceptualization and initial investigations to the design choices and requirements for accuracy. The resulted working prototype has been put to the test to verify effectiveness of the proposed approach.

After developed the formulation of a "general relativity" in C⁴ [2], we proceed with the formulation of a Hamilton-Jacobi equation in C⁴. We argue that in this consideration, the usual problems of the ADM formalism, do not exist, due to the complex time as it exists in our consideration. Specically, we can derive a suitable dispersion relation in order to work with and nd a generalised super Hamiltonian

With the rising cost of animal feed protein, finding affordable and effective substitutes is crucial. Walnut kernel cake, a polyphenols, fiber, protein and fat-rich byproduct of walnut oil extraction, has been underexplored as a potential protein replacement in pig feed. In this study, we found that feeding large Diqing Tibetan pigs walnut kernel cake promoted adipose deposition and improved pork quality during pig growth. Transcriptome analysis revealed the upregulation of genes ANGPTL8, CCNP, ETV4, and TRIB3, associated with adipose deposition. Pathway analysis highlighted enrichment in adipose-deposition-related pathways, including PPAR, Insulin, PI3K-Akt, Wnt, and MAPK signaling. Further analysis identified DEGs (differentially expressed genes) positively correlated with adipose-related traits, such as PER2 and PTGES. Single-cell transcriptome data pointed to the specific expression of CD248 and PTGES in adipocyte progenitor/stem cells (APSCs), pivotal for adipocyte differentiation and adipose deposition regulation. This study demonstrates walnut kernel cake's potential to substitute soybean cake in pig feed, providing high-quality protein and promoting adipose deposition. It offers insights into feed protein replacement, human functional food, fat metabolism, and related diseases, with marker genes and pathways supporting pig breeding and pork quality improvement.