Search

At the research level, novel active materials for batteries are synthesised on a small scale, fabricated into electrodes and electrochemically characterised using each group's established process due to the lack of standards. Recently, eminent researchers have criticised the implementation of e. g. low active material contents/electrode loadings, the use of research‐type battery cell constructions, or the lack of statistically relevant data, resulting in overstated data and thus giving misleading predictions of the key performance indicators of new battery technologies. Here, we report on the establishment of a reference system for the development of sodium‐ion batteries. Electrodes are fabricated under relevant conditions using 9.5 mg/cm2 self‐synthesised Na3V2(PO4)3/C cathode active material and 3.6 mg/cm2 commercially available hard carbon anode active material. It is found that different types of battery cells are more or less suitable for half‐ and/or full‐cell testing, resulting in ir/reproducible or underestimated active material capacities. Furthermore, the influence of electrode overhang, which is relevant for upscaling, is evaluated. The demonstrator cell (TRL 4–5) has been further characterised providing measured data on the power/energy density and thermal behaviour during rate testing up to 15 C and projections are made for its practical limits. [ABSTRACT FROM AUTHOR]

Ki‐67, a nuclear protein expressed in all stages of cellular proliferation, is a valuable tool to assess tumor proliferation and has been linked to more aggressive tumor behavior. However, interlaboratory staining heterogeneity and inter‐observer variability challenge its reproducibility. Round Robin tests are a suitable tool to standardize and harmonize immunohistochemical and molecular analyses in histopathology. The study investigates the interrater and interlaboratory reproducibility of Ki‐67‐scoring using both manual and automated approaches. Unstained TMA slides comprising diverse tumor types (breast cancer, neuroendocrine tumors, lymphomas, and head and neck squamous cell carcinoma) were distributed to six pathology laboratories, each employing their routine staining protocols. Manual and automated scoring methods were applied, and interrater and interlaboratory agreement assessed using intraclass correlation coefficients (ICC). The results highlight good‐to‐excellent reliability overall, with automated scoring demonstrating higher consistency (ICC 0.955) than manual scoring (ICC 0.871). Results were more variable when looking at the individual entities. Reliability remained good for lymphomas (ICC 0.878) and breast cancer (ICC 0.784) and was poor in well‐differentiated neuroendocrine tumors (ICC 0.354). This study clearly advocates standardized practices and training to ensure consistency in Ki‐67‐assessment, and it demonstrates that this can be achieved in a peer‐to‐peer approach in local quality‐circles. [ABSTRACT FROM AUTHOR]

"Cloud computing" hosts software and other services in remote data centers that customers can access worldwide. The user may access all the services and applications online. The IT industry has benefited greatly from the proliferation of cloud computing. On the flip side, organizations moved their operations to the cloud as a result of industrial automation. A surge in demand for cloud computing was directly correlated to the quick migration of businesses. Businesses looking to minimize expenses without sacrificing service quality will find this approach to be ideal. Considering the meteoric rise of cloud computing, service providers are delighted. Contrarily, distributing resources is a challenging task. Cloud computing overcomes some of its most fundamental obstacles, one of which is the load-balancing approach employed by load-balancers to economically optimize costs while minimizing time expenditures. Quick services for cloud customers and minimal cost for cloud providers are the goals of the optimal resource allocation method. This research suggests a novel approach to increase task processing time, which can aid in increasing cloud computing's load balancing capabilities. The proposed method Enhanced Throttled Load Balancing Algorithm (ETLBA) is an upgrade to the original Throttled Algorithm, which efficiently performs resource allocation and load balancing. The proposed ETLBA is contrasted with the existing algorithms, Round Robin, Active Monitoring Load Balancing Algorithm (AMLBA) and Throttled Load Balancing Algorithm (TLBA) to display the efficacy. Cloud Analyst tool simulates the proposed and existing methods. According on the results of the simulations, the proposed algorithm ETLBA achieves better outcomes than the popular existing algorithms in terms of processing time, request processing time, and datacenter cost. It shows 18% reduction in response time, 7% reduction in data center processing time, 16% reduction in data center request processing time and 4% less data center cost compared to the existing solutions. ETLBA performs better by selecting virtual machines using a prioritized index table and consumption index. It limits idling resources, improves response as well as reduces processing times, and cloud costs compared to conventional solutions. [ABSTRACT FROM AUTHOR]

This study introduces an innovative approach to optimize cloud computing job distribution using the Improved Dynamic Johnson Sequencing Algorithm (DJS). Emphasizing on-demand resource sharing, typical to Cloud Service Providers (CSPs), the research focuses on minimizing job completion delays through efficient task allocation. Utilizing Johnson's rule from operations research, the study addresses the challenge of resource availability post-task completion. It advocates for queuing models with multiple servers and finite capacity to improve job scheduling models, subsequently reducing wait times and queue lengths. The Dynamic Johnson Sequencing Algorithm and the M/M/c/K queuing model are applied to optimize task sequences, showcasing their efficacy through comparative analysis. The research evaluates the impact of makespan calculation on data file transfer times and assesses vital performance indicators, ultimately positioning the proposed technique as superior to existing approaches, offering a robust framework for enhanced task scheduling and resource allocation in cloud computing. [ABSTRACT FROM AUTHOR]

Ratios of glycerol dialkyl glycerol tetraethers (GDGT), which are membrane lipids of bacteria and archaea, are at the base of several paleoenvironmental proxies. They are frequently applied to soils as well as lake‐ and marine sediments to generate records of past temperature and soil pH. To derive meaningful environmental information from these reconstructions, high analytical reproducibility is required. Based on submitted results by 39 laboratories from across the world, which employ a diverse range of analytical and quantification methods, we explored the reproducibility of brGDGT‐based proxies (MBT′5ME, IR, and #ringstetra) measured on four soil samples and four soil lipid extracts. Correct identification and integration of 5‐ and 6‐methyl brGDGTs is a prerequisite for the robust calculation of proxy values, but this can be challenging as indicated by the large inter‐interlaboratory variation. The exclusion of statistical outliers improves the reproducibility, where the remaining uncertainty translates into a temperature offset from median proxy values of 0.3–0.9°C and a pH offset of 0.05–0.3. There is no apparent systematic impact of the extraction method and sample preparation steps on the brGDGT ratios. Although reported GDGT concentrations are generally consistent within laboratories, they vary greatly between laboratories. This large variability in brGDGT quantification may relate to variations in ionization efficiency or specific mass spectrometer settings possibly impacting the response of brGDGTs masses relative to that of the internal standard used. While ratio values of GDGT are generally comparable, quantities can currently not be compared between laboratories. Key Points: 39 laboratories participated in a round robin to determine the reproducibility of glycerol dialkyl glycerol tetraethers (GDGT) proxy values and quantitiesPeak selection impacts the ratio values and there is no apparent systematic impact of the extraction method and sample preparation stepsQuantification of GDGTs remains a problem, and comparison of GDGT concentrations between laboratories requires further method development [ABSTRACT FROM AUTHOR]

This paper presents a novel approach utilizing the GTK3 toolkit to simulate and visualize context switching in operating systems, focusing particularly on Round Robin scheduling. Context switching, crucial for multitasking efficiency, involves saving and restoring process states. Through dynamic transitions between processes, the framework elucidates Round Robin's CPU resource allocation, aiding in understanding its efficiency and fairness. The visualization serves as a valuable tool for researchers, educators, and practitioners, offering insights into CPU scheduling intricacies. Additionally, it provides a platform for experimentation, enabling the exploration of scheduling performance under various parameters. Overall, this work advances comprehension of CPU scheduling algorithms and offers a practical tool for real-world scenario analysis. [ABSTRACT FROM AUTHOR]

Blockchain is one of the leading technologies, and it has already begun to transform several industries and areas, including banking, business, healthcare, smart homes, and the Internet of Things. Its benefits include a decentralized network, robustness, availability, stability, anonymity, audibility, and accountability. As Blockchain applications proliferate, it becomes clear that most of the effort is focused on their engineering implementation. However, there has yet to be much focus on the theoretical side. This paper simulated the mining process in Blockchain-based systems using queuing theory. In order to simulate Bitcoin, one of the most well-known cryptocurrencies, we used actual data from Bitcoin and JSIMgraph's M/M/n/L queuing system. We used genuine Bitcoin data and JSIMgraph's M/M/n/L queuing system to replicate Bitcoin, one of the most well-known cryptocurrencies. We produced realistic results that are applicable and will pave the way for future theoretical research on Blockchain-based Queuing systems. Our study implemented both non-preemptive algorithms (such as First Come First Serve, Longest Job First, Shortest Job First, and Last Come First Serve) and preemptive algorithms (such as Round Robin). Further, the average queue waiting time of transactions under these algorithms is also compared. [ABSTRACT FROM AUTHOR]

VANETs are wireless communication networks that enable vehicles to communicate with each other and RSUs. RSUs are crucial in establishing connectivity among the moving vehicles on the road and enhancing road safety and traffic management. For operational purposes, RSUs require electrical energy which is expensive, hence it is highly advisable to prioritize the preservation of this valuable energy resource. Therefore, the energy consumption across all RSUs should be minimized for efficient usage. Apart from operating itself, RSUs need energy to fulfill the requests they receive. These requests arrive at different time stamps and require the RSUs for different intervals of time for their processing. Hence, scheduling of these requests should be done so that the energy of the RSUs does not get under or over utilized. To do so, we have applied Median Average Round Robin algorithm (MARR) and Round Robin algorithm (RR) on the VANET scenario. For comparative analysis, the results have been compared with a random scenario with no scheduling algorithm and also with the nearest fast scheduling algorithm (NFS). It turns out that MARR_VDS performs the best by reducing the energy usage by 50% approximately and also minimizing the overall cost of VANET by using 55% lesser number of RSUs. [ABSTRACT FROM AUTHOR]

Image analysis techniques have been applied and shown to be a valuable tool in nuclear forensics analysis. The interlaboratory exercise reported here has tested quantitative and qualitative approaches for characterizing nuclear materials. Particle size, surface features and morphology descriptions were compared by four laboratories on a common image set generated by Scanning Electron Microscopy and Digital Light Microscopy. Quantitative analysis of the image sets through the Morphological Analysis for MAterials software highlighted the strength of image analysis, but also that the application of the software alone can introduce significant bias in the analysis. Qualitative morphology descriptions following the process outlined by Tamasi et al. (J Radioanal Nuclear Chem 307:1611–1619, 2015) were compared with a discussion on the robustness and reproducibility of the results. Future work should continue to focus on proficiency and standardization of image analysis through continued exercises within the extended nuclear forensics community. [ABSTRACT FROM AUTHOR]

The equitable distribution of radio resources among different users in wireless networks is a difficult problem and has attracted the interest of many studies. This study presents the Proportional Fair QLearning Algorithm (PFLA) to enable the equitable distribution of radio resources among diverse users through the integration of Q-learning and proportional fairness principles. The PFLA, Round Robin (RR), and Max Throughput (MaxTP) algorithms were compared to evaluate their effectiveness in resource allocation. Performance was measured in terms of sum-rate throughputs and fairness index. The comparison results showed an improvement in the fairness index metrics for PFLA compared to the other algorithms. PFLA showed gains of 11.62 and 43% in the fairness index compared to RR and MaxTP, respectively. These results show that PFLA is more efficient in utilizing available resources, leading to higher overall system throughput and demonstrating its ability to balance performance metrics between users, especially when the number of users increases. [ABSTRACT FROM AUTHOR]

Abstract Ratios of glycerol dialkyl glycerol tetraethers (GDGT), which are membrane lipids of bacteria and archaea, are at the base of several paleoenvironmental proxies. They are frequently applied to soils as well as lake‐ and marine sediments to generate records of past temperature and soil pH. To derive meaningful environmental information from these reconstructions, high analytical reproducibility is required. Based on submitted results by 39 laboratories from across the world, which employ a diverse range of analytical and quantification methods, we explored the reproducibility of brGDGT‐based proxies (MBT′5ME, IR, and #ringstetra) measured on four soil samples and four soil lipid extracts. Correct identification and integration of 5‐ and 6‐methyl brGDGTs is a prerequisite for the robust calculation of proxy values, but this can be challenging as indicated by the large inter‐interlaboratory variation. The exclusion of statistical outliers improves the reproducibility, where the remaining uncertainty translates into a temperature offset from median proxy values of 0.3–0.9°C and a pH offset of 0.05–0.3. There is no apparent systematic impact of the extraction method and sample preparation steps on the brGDGT ratios. Although reported GDGT concentrations are generally consistent within laboratories, they vary greatly between laboratories. This large variability in brGDGT quantification may relate to variations in ionization efficiency or specific mass spectrometer settings possibly impacting the response of brGDGTs masses relative to that of the internal standard used. While ratio values of GDGT are generally comparable, quantities can currently not be compared between laboratories.

Modeling the probability of blocking User Equipment (UE) sessions within a cell is a crucial aspect within the management of 5G services with Guaranteed Bit Rate (GBR) requirements, especially in the process of planning in advance the deployment of such services. The complexity of modeling the UE blocking probability arises from the dependency of this performance indicator on multiple factors, including the UE channel quality within the cell, the MAC scheduling discipline, the statistical distributions of the traffic demand and session duration, and the GBR requirements of the corresponding service. In this vein, we propose an analytical model to assess the UE blocking probability for a GBR service. The proposed model is based on a Markov chain which is insensitive to the holding time distribution of the UE data sessions. Furthermore, it may consider as input any continuous distribution for the average Signal-to-Interference-plus-Noise Ratio (SINR) within the cell. The simulation results demonstrate the execution time of the proposed model is on the order of tens of milliseconds, which makes it suitable for testing multiple network configurations in a short term, training ML models or detecting traffic anomalies in real time. Additionally, the results show that our model exhibits an estimation error for the UE blocking probability below 2.6%.

Because of the Internet's phenomenal growth in recent years, computing resources are now more widely available. It led to the development of a new computing concept known as Cloud Computing, allowing users to share resources such as networks, servers, storage, applications, services, software, and data across multiple devices on demand for economical and fast. Load balancing is an important branch of cloud computing as it optimizes machine utilization by distributing tasks equally over resources. It occurs among physical hosts or Virtual Machines in a cloud environment. Round robin is a commonly used algorithm in load balancing. RR gives a time quantum for each task and is in circular order. It is noted that it suffers from many problems, such as the waste of time and the high cost. In the present study, the greedy algorithm was enhanced and implemented to allocate and schedule tasks that come to the cloud on Virtual Machines in balance. The task with the longest execution time is given to the virtual machine with the least load using an improved greedy algorithm. The outcomes demonstrate that the suggested algorithm outperformed round robin in makespan. Also, all Virtual Machines in the proposed algorithm finish their work simultaneously, whereas round robin is unbalanced. [ABSTRACT FROM AUTHOR]

Many sports leagues organize their competitions as round‐robin tournaments. This tournament design has a rich mathematical structure that has been studied in the literature over the years. We review some of the main properties and fundamental scheduling methods of round‐robin tournaments. Special attention is given to extra‐mural tournaments in which each team in the competition has its venue. Teams play either at home or away in such tournaments in each round. The surge of breaks in the perfect alternation of home and away breaks is studied in detail. [ABSTRACT FROM AUTHOR]

A variety of algorithms handles processes on the CPU. The round-robin algorithm is an efficient CPU scheduling mechanism for a time-sharing operating system. The system processes the methods based on the time slice; however, determining the time slice has proven highly challenging for the researchers. As a result, a variety of dynamic time quantum scheduling techniques are presented by various academics to address this challenge. This study aims to determine how to best schedule resources to maximize efficiency. It is important to note that this scheduling mechanism rotates between the processes after the static quantum time is complete. However, the quantum decision affects how effectively and efficiently the procedures may be scheduled. Additionally, the quantum decision has an impact on the scheduling of processes. The average waiting time, turnaround time, and context switch times of the Round Robin scheduling algorithm are high enough to influence the system's performance. To get over the round-drawbacks, robin's the authors in this study suggest using the improved algorithm Median-Average Round Robin (MARR). Using the median and average of the burst time of each process, the author proposes a dynamic time quantum for the system. The authors compared the proposed model with four other scheduling algorithms. The results vividly depict that the proposed algorithms successfully give effective results with reduced average turnaround time and waiting time. In the future, cost and RAM utilization will be considered to enhance the algorithm.

As ever-increasing amounts of renewable electricity enter the energy supply mix on a regional, national and international basis, greater emphasis is being placed on energy conversion and storage technologies to deal with the oscillations, excess and lack of electricity. Hydrogen generation via proton exchange membrane water electrolysis (PEMWE) is one technology that offers a pathway to store large amounts of electricity in the form of hydrogen. The challenges to widespread adoption of PEM water electrolyzers lie in their high capital and operating costs which both need to be reduced through R&D. An evaluation of reported PEMWE performance data in the literature reveals that there are excessive variations of in situ performance results that make it difficult to draw conclusions on the pathway forward to performance optimization and future R&D directions. To enable the meaningful comparison of in situ performance evaluation across laboratories there is an obvious need for standardization of materials and testing protocols. Herein, we address this need by reporting the results of a round robin test effort conducted at the laboratories of five contributors to the IEA Electrolysis Annex 30. For this effort a method and equipment framework were first developed and then verified with respect to its feasibility for measuring water electrolysis performance accurately across the various laboratories. The effort utilized identical sets of test articles, materials, and test cells, and employed a set of shared test protocols. It further defined a minimum skeleton of requirements for the test station equipment. The maximum observed deviation between laboratories at 1 A cm −2 at cell temperatures of 60 °C and 80 °C was 27 and 20 mV, respectively. The deviation of the results from laboratory to laboratory was 2–3 times higher than the lowest deviation observed at one single lab and test station. However, the highest deviations observed were one-tenth of those extracted by a literature survey on similar material sets. The work endorses the urgent need to identify one or more reference sets of materials in addition to the method and equipment framework introduced here, to enable accurate comparison of results across the entire community. The results further imply that cell temperature control appears to be the most significant source of deviation between results, and that care must be taken with respect to break-in conditions and cell electrical connections for meaningful performance data.

The research aims to identify: - The relationship between mental alertness and psychological flexibility among students of the Department of Physical Education and Sports Sciences at the Faculty of Al-Noor University The researchers used the descriptive curriculum to suit the nature of the current research, and the research community included the 198 students in the Department of Physical Education and Sports Sciences at al-Nour University School for the academic season (2021-2022) and the 198 students distributed throughout the courses. The research sample included 150 students from the research community to represent the final application sample, and the researchers used the spss statistical package to analyze the results of the research. The researchers concluded: - There is a morally significant correlation between mental alertness and psychological flexibility among students in the Department of Physical Education and Sports Sciences at the University College of Al-Noor.

keeping pace with the development in the field of education, attention has been paid to the learner by sharing his ideas, recording his answers and sharing them with his peers with all the answers to reach the model answer and to exit the educational process towards better learning. Therefore, a new educational step must be taken in a teaching method that differs from the previous one, which is the ring method. The idea of this method is based on the student’s answer the question, situation or the problem, and it can be used to know and discover the tribal concepts of students. The teachers were interested in organizing educational activities that depend on the discussion among group members to reach to an organized participatory product that leads to the production of common answers and ideas so that education becomes more effective. The effect of communication between learners may appear, which increases their motivation to learn, especially in the field of physical education and learning volleyball skills, which leads to the generation of positive trends towards practicing skills and increases they desire to participate more in the lesson. Research aims to: The - Recognizing the effect of using the round robin in learn the art of performing some volleyball skills for middle school students. - Identifying the effect of using the round robin in learn the art of performing the trend towards physical education lesson for female students The researchers used the experimental method for its relevance and the nature of the research. The research sample consisted of students of the fourth preparatory stage. Two divisions were randomly selected. One of them is an experimental method that used the round robin in learn the art of performing basic volleyball skills, and the other is a control method that uses the method used by the subject school. Statistical means have been used to extract the results of the research. The researchers concluded that the experimental group that used the round robin was superior to the control group that used the method followed by the school in learning the skills of serving from the bottom, passing from the bottom and passing from the top with the volleyball. The researchers also recommended the use of the round robin in teaching the basic skills of volleyball in the physical education lesson and other sports activities.

Copyright of Journal of Education & Science is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Task scheduling algorithms are crucial for optimizing the utilization of computing resources. This work proposes a unique approach for improving task execution in real-time systems using an enhanced Round Robin scheduling algorithm variant incorporating dynamic time quantum and priority. The proposed algorithm adjusts the time slice allocated to each task based on execution time and priority, resulting in more efficient resource utilization. We also prioritize higher-priority tasks and execute them as soon as they arrive in the ready queue, ensuring the timely completion of critical tasks. We evaluate the performance of our algorithm using a set of real-world tasks and compare it with traditional Round Robin scheduling. The results show that our proposed approach significantly improves task execution time and resource utilization compared to conventional Round Robin scheduling. Our approach offers a promising solution for optimizing task execution in real-time systems. The combination of dynamic time quantum and priorities adds a unique element to the existing literature in this field. [ABSTRACT FROM AUTHOR]

Passive technologies, including intelligent reflecting surfaces (IRS), are gaining traction thanks to their ability to enhance communication systems while maintaining minimal cost and low complexity. They can assist a wireless sensor network (WSN) by achieving low power requirements for sensors and aid communication needs in many applications, for instance, environmental monitoring. In this paper, we propose an IRS-equipped WSN which describes sensors equipped with IRSs instead of active radio frequency (RF) electronics. The IRS sensor node (ISN) intercepts a dedicated signal from a power source such as a base station (BS) and modulates the transmission of that signal to an intended recipient. In order to enable multiple sensors to transmit to the receiver, we study opportunistic scheduling (OS) utilizing multi-sensor diversity while considering blind IRS operation, and compare it with round-robin (RR), proportional fairness (PF), and a theoretical upper bound. We study the effect of the choice of the number of IRS elements N and number of ISNs L on the average throughput of the system under OS. Finally, we provide pertinent comparisons for the different scheduling schemes and IRS configurations under relevant system performance metrics, highlighting different scenarios in which each scheme performs better. [ABSTRACT FROM AUTHOR]

Cloud computing is a massive amount of dynamic ad distributed resources that are delivered on request to clients over the Internet. Typical centralized cloud computing models may have difficulty dealing with challenges caused by IoT applications, such as network failure, latency, and capacity constraints. One of the introduced methods to solve these challenges is fog computing which makes the cloud closer to IoT devices. A system for dynamic congestion management brokerage is presented in this paper. With this proposed system, the IoT quality of service (QoS) requirements as defined by the service-level agreement (SLA) can be met as the massive amount of cloud requests come from the fog broker layer. In addition, a forwarding policy is introduced which helps the cloud service broker to select and forward the high-priority requests to the appropriate cloud resources from fog brokers and cloud users. This proposed idea is influenced by the weighted fair queuing (WFQ) Cisco queuing mechanism to simplify the management and control of the congestion that may possibly take place at the cloud service broker side. The system proposed in this paper is evaluated using iFogSim and CloudSim tools, and the results demonstrate that it improves IoT (QoS) compliance, while also avoiding cloud SLA violations. [ABSTRACT FROM AUTHOR]

Summary: Enhancement of network performance is a big challenge today for the emerging technology based on IEEE 802.16. Wireless technology is an alternate solution to wired technology. Network availability all the way is an important challenge in day‐to‐day life. Due to the huge population, the availability of the network is again a big challenge. Also, it becomes more difficult to capture the network if considering rural areas, hilly, lakes, and seashores today. This work proposed relay stations in WiMAX (Worldwide Interoperability for Microwave Access) networks along with various bandwidth allocation algorithms to increase the signal strength over the long distance using retransmission of the original signal by relay station and extend the coverage with a higher data rate and higher user capacity. The availability of WiMAX networks for the channel bandwidth assignment to users for data and service is very important in today's scenario. This paper focuses on evaluating the performance of bandwidth allocation algorithms in light WiMAX networks with and without relay stations. The performance evaluation is done by increasing the number of nodes with various bandwidth allocation techniques with and without relay stations. In this work the round robin and strict priority algorithms are used for channel bandwidth allocation in a light WiMAX network and performance is analyzed through throughput, goodput, and packet drop rate, which will help to implement and configure the suggested optimal parameters in the production environment. This work enhanced the throughput and goodput and reduce the dropout rate, and the user capacity also increased. [ABSTRACT FROM AUTHOR]

Real-time task scheduling is a critical part of systems since processes must finish their work at a certain time. Large data streams require high energy efficiency and rapid response times. Real-time system performance must be improved through task scheduling on resources. Numerous researchers have recently and rapidly proposed enormous efforts with enhancements in numerous task scheduling methods. Round Robin algorithm has been commonly utilized in task scheduling. In this paper, a Modified Median Mean Round Robin (MMMRR) algorithm is proposed to significantly enhance the performance of the Round Robin algorithm. The proposed algorithm finds an ideal dynamic time quantum └(median+ mean)/2)┘ and generated for each round depending on the remaining burst time of the processes. The system performance has been enhanced in terms of waiting time, turnaround time and context switching. The experimental results show that the proposed algorithm outperforms ADRR, HYRR, EDRR, MARR and MMRR algorithms. [ABSTRACT FROM AUTHOR]

Salt crystallization is a major cause of damage in porous building materials. Accelerated salt weathering tests carried out in the laboratory are among the most common methods to assess the durability of material to salt decay. However, existing standards and recommendations for salt weathering tests have limitations in terms of effectiveness and/or reliability. In the framework of the RILEM Technical Committee 271-ASC, a procedure has been developed which proposes a new approach to salt crystallization tests. It starts from the consideration that salt damage can be seen as a process developing in two phases: accumulation of the salt in the material and propagation of the decay. In the first phase, salts are introduced in the material and accumulate close to the evaporation surface, while in the second phase damage propagates because of repeated dissolution and crystallization cycles, induced by re-wetting with liquid water and by relative humidity changes. In this paper, the procedure is described and the results of a first round robin validation of the test, carried out on 7 materials and involving 10 laboratories, are presented. The results show that the procedure is effective to cause decay within the time period of the test (about 3 months) and that the decay increases with subsequent cycles. The decay observed differs in type and severity depending on the salt type and concentration and on the type of substrate. The decay types detected in the laboratories are generally representative of those observed in the field for the selected substrates. The differences in durability between the various substrates, as assessed at the end of the test, are in line with the durability expected based on field observation. The reproducibility of the results in terms of decay type is good; some differences have been observed in terms of material loss. These are more significant in the case of NaCl contaminated specimens. Based on the results, proposals for fine-tuning of the procedure are given. [ABSTRACT FROM AUTHOR]

As part of 3GPP releases 15 and 16 Wi-Fi networks have been integrated with the 5G Core, which is a key feature in private network scenarios. Another important feature for private networks is multi-tenancy, whereby an infrastructure provider shares a common radio access network among several tenants subject to service level agreements (SLAs). 3GPP has defined network slicing on the radio access segment supporting multi-tenancy for 5GNR, but a similar feature is lacking in Wi-Fi networks. In this paper we present G-ADRR, which, to be best of our knowledge, is the first global slicing policy for Wi-Fi that delivers per-tenant radio level SLAs over a given geographical area. We extensively evaluate the performance of G-ADRR by means of an experimental prototype and packet level simulations, and demonstrate its advantages as compared to two alternative global scheduling strategies and a static slice configuration policy commonly used in the state-of-the-art. [ABSTRACT FROM AUTHOR]

Performance is an essential characteristic of any cloud computing system. It can be enhanced through parallel computing, scheduling, and load balancing. This work evaluates the connection between the response time (RT) and virtual machine's (VM's) CPU utilization when cloudlets are allocated from the datacenter broker to VM. To accentuate the RT and VM's CPU utilization, a set of 100 and 500 heterogeneous cloudlets are analyzed under hybridized provisioning, scheduling, and allocation algorithm using CloudSim simulator. These include space shared (SS) and time shared (TS) provisioning policy, shortest job first (SJF), first come first search (FCFS), round robin (RR), and a novel length-wise allocation (LwA) algorithm. The experimental analysis shows that the RT is the least when SJF is combined with RR allocation at 40.665 seconds, and VM's CPU utilization is the least when SJF is combined with LwA policy at 12.48 in all combinations of SS and TS provisioning policy. [ABSTRACT FROM AUTHOR]