The lithium-ion batteries are widely used as a power source for portable devices, including cell phones. The useful life is about 2 years or 500 cycles, contributing to the generation of waste from electrical and electronic equipment (WEEE). Mining of lithium and cobalt damages the environment and is onerous; therefore, sustainable alternatives, such as obtaining these elements from secondary sources as recycling of lithium-ion batteries, are essential to provide the inputs used in the sector. However, the metallurgical route which will used to recovering them must be considered, due to this work aims for a more environmentally favorable process using DL-malic acid 1.5 M and instead of compared with sulfuric acid 2 M, heat pretreatment of 1 h and 3 h, and for all conditions, experiments were carried out with and without adding the oxidizing agent hydrogen peroxide. The best yields occurred in presence of H2O2 10 % v/v, and heat pretreatment of 1 h: 33.49 % Co and 4.63 % Li, and 29.78 % Co e 3.44 % Li were recovered by sulfuric acid and DL-malic acid, respectively.

Epithelial–mesenchymal transition (EMT) is defined as a cellular process during which epithelial cells acquire mesenchymal phenotypes and behavior following the downregulation of epithelial features. EMT and its reversed process, the mesenchymal-epithelial transition (MET), and the special form of EMT, the endothelial-mesenchymal transition (EndMT), have been thought as a universal dogma controlling developmental and pathological processes. More than half a century of EMT study has made it a large research field and a mainstream concept. However, discrepancies and disputes over EMT and EMT research have also grown over time. Particularly, neither the epithelial and mesenchymal states/properties nor their regulatory networks nor specific markers have been defined, rendering the EMT, MET and EndMT concepts groundless. Moreover, EMT and MET effects should not be a cause, but rather a consequence of or an accompanying effect during developmental and pathological processes. EMT and MET represented by the change in cell shapes or adhesiveness or symbolized by EMT factors are biased interpretation of the overall change in cellular property and regulatory networks during development and cancer progression. The true meaning of EMT effects in some developmental and pathological processes, such as fibrosis, needs re-evaluation. But the core EMT factors are actually a few components of the regulatory networks of neural stemness, which determines tumorigenicity and pluripotency. The EMT effects in cancer progression and neural crest formation are wrong attribution of the role of neural stemness during cancer progression and the cell-intrinsic property of neural crest cells to the unknown mesenchymal state. It is time to reassess the significance of EMT and its related concepts in scientific research.

Flavonoids are secondary plant metabolites involved in biological activity that are present in plentiful proportions in many plant origin foods and beverages. Owing to their chemical difference and qualities that make them beneficial for human health, they have received a lot of focus in research. This review therefore presents an account on the chemical structure of flavonoids, food sources and their metabolism with emphasis on bioavailability. And they also examine their antioxidant, anti-inflammatory, anticancer, cardiovascular protective, neuroprotective, and antimicrobial properties and reveal related molecular processes. In addition, it overviews the clinical data concerning their possible use in the prevention and treatment of chronic diseases. Some of the problems that attend current flavonoid research are also dealt with; such issues as variation in the bioactivity of flavonoids and scarcity of clinical studies. This review is designed to present current state of knowledge and to provoke further research concerning the further potential of flavonoids in enhancing human health.

The high performance of liquid chromatography(HPLC) has long been an indispensable tool for vigilance and analysis across range disciplines such as pharmaceuticals, environmental monitoring, food safety attributes etc. We will discuss about HPLC method development and validation, types of liquid chromatography methods focusing on proper use of a mobile phase like an eluent selection, how to optimize the conditions as well take it through its various procedures required for approval from regulatory bodies. Strategies to improve method robustness, sensitivity and reproducibility are highlighted. The future breakthroughs in HPLC technology and some innovative trends have also been speculated to limit this fundamental methodology.

Solanum indicum Linn, is commonly known as Indian Nightshade or Poison Berry belongs to the family Solanaceae. This review studied the botanical description, traditional uses of its seeds, its chemical composition, pharmacological properties and modern applications in medicinal system. The plant is rich in alkaloids, steroidal saponins, flavonoids and phenolic acids having diverse pharmacological activities and phytochemical profile. It is used in treatment of various respiratory disorders, inflammation, skin problems and gastrointestinal disease since ancient times. Scientific research in modern times also tested many of the traditional uses revealing anti-inflammatory, antioxidant, antimicrobial activities as well as some cytotoxic and even antidiabetic effects. These pharmacological activities show potential future as uses for organic drugs, natural health products, skincare formulations and agricultural advancements.

To maximize resource usage, minimize disputes, and improve academic experience, professors must schedule teaching activities efficiently. This study provides an optimized automated schedule creation technique. The system generates conflict-free, efficient schedules using evolutionary algorithms and multi-objective optimization. Resource usage, scheduling prob-lems, and faculty/student satisfaction are the goals of the research. The system optimizes scheduling based on room limitations, instructor availability, and student preferences. The project uses system design, model creation, algorithm implementation, and performance analysis to solve the difficult timetable-generating problem. This research should save administrators time, improve academic operations, and improve staff and student academic experiences. Scalability and flexibility allow the system to be used in multiple faculties and incorporate new limits and requirements. This paper presents a complete approach to faculty scheduling, including insights and recommendations for future study and application in educational institutions.

With the increasing concern of environment, the energy-efficiency scheduling of manufacturing industry is becoming urgent and popular. In turning processes, both spindle speed and processing time can affect the final energy consumption and thus the spindle speed and scheduling scheme need to be optimized simultaneously. Since the turning workshop can be regarded as the flexible flow shop, this paper formulates a mixed integer linear programming model for energy-efficient scheduling of flexible flow shop. Accordingly, a new decoding method is developed by considering of the optimization of spindle speed and scheduling scheme simultaneously, and an estimation of distribution algorithm adopting the new decoding method is proposed to solve large-size problems. The parameters of this algorithm are determined by statistical technique with a simplified practical case. In order to validate the proposed method, a case from practical factories is studied, in which the makespan can be shortened by 25.22%, and the consumed energy can be saved by 5.48%. These results demonstrate the effectiveness of the proposed mathematical model and algorithm.

. Manufacturers are increasingly adopting mixed-flow manufacturing models to meet the growing customized, diverse, and dynamic customer demand. In such an environment, material distribution scheduling optimization is vital for smooth operations and is integral to production management. However, manufacturers frequently encounter problems like disordered and delayed material distribution. Traditional scheduling methods suffer from problems like inadequate transparency, delayed decision directives, and suboptimal results, impacting performance. To this end, this study proposes a dynamic material distribution scheduling optimization model and strategy based on digital twin (DT) to address these problems. Firstly, we introduce workstation satisfaction and establish a material distribution path optimization model minimizing total distribution cost while maximizing workstation satisfaction. Subsequently, we present a cloud-edge computing-based decision framework and explain the DT-based material distribution system's components and operation. Furthermore, a dynamic material distribution scheduling optimization mechanism based on DT is designed. By incorporating a savings method and incentive, penalty strategies, improvements are made to the path node selection probabilities and the information pheromone update rules of the traditional ant colony optimization (ACO) algorithm. Finally, a numerical case study, using real data from collaborating enterprises, validates the proposed algorithm and strategy. This research offers valuable insights into logistics management and algorithm design in smart manufacturing environments.

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.

Energy storage systems will play a key role for individual users in the future smart grid. They serve two purposes: (i) handling the intermittent nature of renewable energy resources for a more reliable and efficient system, and (ii) preventing the impact of blackouts on users and allowing for more independence from the grid, while saving money through load-shifting. In this paper we investigate the latter scenario by looking at a neighbourhood of 25 households whose demand is satisfied by one utility company. Assuming the users possess lithium-ion batteries, we answer the question of how each household can make the best use of their individual storage system given a real-time pricing policy. To this end, each user is modelled as a player of a non-cooperative scheduling game. The novelty of the game lies in the advanced battery model, which incorporates charging and discharging characteristics of lithium-ion batteries. The action set for each player comprises day-ahead schedules of their respective battery usage. We analyse different user behavior and are able to obtain a realistic and applicable understanding of the potential of these systems. As a result, we show the correlation between the efficiency of the battery and the outcome of the game.

In recent years, the AHRS has become an important research area. In order to improve the orientation measurement accuracy of AHRS, this paper first expounds the algorithm principle of the AHRS. Then, aiming at the problem of poor stability of the traditional gradient descent method under high dynamics or large magnetic field interference, a gain-scheduled anti-interference AHRS orientation algorithm is designed. By using the switching architecture designed with this algorithm for gain scheduling, it can ensure stable performance while being subjected to apparent acceleration and ferromagnetic interference. Finally, experimental verification is conducted, and the experimental results show that: in the presence of interference, the roll angle error is 0.0350°, the pitch angle error is 0.0277°, and the yaw angle error is 0.9611°, thereby verifying the strong anti-interference performance of the gain-scheduled AHRS orientation algorithm proposed in this paper.

In recent years, the management of health systems is a main concern of governments and decision makers. Home health care is one of the newest methods of providing services to patients in developed societies that can respond to the individual lifestyle of modern age and the increase of life expectancy. The home health care routing and scheduling problem is a generalized version of the vehicle routing problem, which is extended to a complex problem by adding special features and constraints of health care problems. In this problem, there are multiple stakeholders such as nurses for which an increase of their satisfaction level is very important. In this study, a mathematical model is developed to expand traditional home health care routing and scheduling models to downgrading cost aspects by adding the objective of minimizing the difference between the actual and potential skills of the nurses. Downgrading can lead to a dissatisfaction of the nurses. In addition, skillful nurses have higher salaries and high-level services increase equipment costs and need more expensive trainings and nursing certificates. Therefore, downgrading can enforce hidden huge costs to the managers of a company. To solve the bi-objective model, an -constraint based approach is suggested and the model applicability and its ability to solve the problem in various sizes are discussed. A sensitivity analysis on the Epsilon parameter is conducted to analyze the effect of this parameter on the problem. Finally, some managerial insights are presented to help the managers in this field, and some directions for future studies are mentioned as well.

The enormous growth in the penetration of electric vehicles (EVs), has laid the path to advancements in the charging infrastructure. Connectivity between charging stations is an essential prerequisite for future EV adoption to alleviate users’ “range anxiety”. The existing charging stations fail to adopt power provision allocation and scheduling management. To improve the existing charging infrastructure data based on real-time information and availability of reserves at charging stations could be uploaded to the users to help them locate the nearest charging station for an EV. This research article focuses on an a interactive user application developed through SQL and PHP platform to allocate the charging slots based on estimated battery parameters, which uses data communication with charging stations to receive the slot availability information. The proposed server-based real-time forecast charging infrastructure avoids waiting times and its scheduling management efficiently prevents the EV from halting on road due to battery drain out. The proposed model is implemented using a low-cost microcontroller and the system etiquette tested.

Since the 1960s, forest planners have used linear programming models to develop management plans for large, forested areas. Hundreds of academic papers have presented such models, incorporating multiple objectives, a growing diversity of management interventions, and uncertainty, among other things. Three basic ways to formulate these models have been used: Model I, III, and III. We define these models based on the sequence of management unit states represented by the variables. In Model I, variables represent a sequence of states from the beginning of the planning horizon to the end. In Model II, variables represent a sequence of states from one intervention to the next. Finally, in Model III, variables represent a single arc in a management unit’s decision tree, including only a beginning and an ending state. We formulate each type of model for a case study with three increasingly complex scenarios incorporating additional ecosystem services. Our results indicate that, despite requiring more variables and constraints, Model III requires the least time to formulate, largely because it has the least dense parameter matrix. Model II has the shortest solution times, with Model III close behind. Model I requires both the longest formulation and solution times.

Reasonable allocation of production plans and saving the overall electricity cost are crucial for large manufacturing conglomerates, which is an effective way for conglomerates to realize open-source and cost-saving. This paper develops an optimization model of off-site industrial production scheduling for enterprises in response to the problems of high electricity costs due to the irrational allocation of production schedules on the demand side of China's electric power and the difficulty of promoting industrial and commercial distributed photovoltaic (PV) projects in China. The model makes full use of the conditions of different PV resources and different electricity prices in different places to optimize the scheduling of industrial production in different places. The model is embedded with two sub-models of the electricity price prediction model and distributed photovoltaic kWh cost model to complete the model parameters, in which the electricity price prediction model utilizes the LSTM neural network. The integrated model is then solved by the particle swarm algorithm. To verify the effectiveness of the model in solving the problem of off-site production scheduling on the demand side of electricity, the research team researched two off-site pharmaceutical factories belonging to the same large pharmaceutical company. Finally, the research data were substituted into the model for solving, and it was concluded that the optimization model could significantly reduce the cost of electricity consumption of the enterprise by about 7.9 %.

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.

Preventive Maintenance (PM) is a periodic maintenance strategy, which has great results for devices in extending their life, increasing productivity, and most importantly, help avoid unexpected breakdowns and their costly consequence. A preventive maintenance scheduling (PMS) is determining the time for carrying out PM, and it represents a sensitive issue in terms of impact on production if the time for the PM process is not optimally distributed. In this study, hybrid heuristic methods were used to solve the PMS problem, as genetic algorithm and Tabu research were adopted. The optimal solution was reached in a short time compared to previous studies in which optimal methods were used, integer programming and nonlinear integer programming. Also, sensitivity analysis was applied to measure the robustness and strength of the method used, where an optimal solution was obtained for all experiments and in record time. This method can be used for power plants in privet or public sectors, to generate an optimal PMS, to save money, and to avoid water or electricity cuts.

The volatility and uncertainty associated with the high proportion of wind and PV output in the new power system significantly impact power and energy balance, making it challenging to accurately assess the risks related to renewable energy abandonment and supply guarante. Therefore, a probabilistic power and energy balance risk analysis method based on distributed robust optimization is proposed. Firstly, the affine factor and the flexible ramp reserve capacity of thermal power are combined to establish a probabilistic index, which serves to characterize the risk associated with power and energy balance. Drawing upon the principles of conditional value at risk theory, the risk indexes of load shedding power and curtailment power under a certain confidence probability are proposed. Secondly, the probability distribution fuzzy sets of uncertain variables are constructed using the distributionally robust method to measure the Wasserstein distance between different probability distributions. Finally, aiming at minimizing the operation cost of thermal power, the risk cost of power abandonment and the risk cost of load shedding, a distributed robust optimal scheduling model based on flexible ramp reserve of thermal power is established.

Scheduling of real time tasks are very important aspect in systems as processes should complete its task at a specific time. There is a need of high energy efficiency and low response time in large data stream so for this energy efficient resources and optimized frameworks are needed. Both hard real time and mixed critically systems are targeted. Soft deadline can be handled while hard deadlines are difficult to cater. Different algorithms are used to schedule tasks like rate monotonic, earliest deadline first, deadline monotonic etc.

This study explores optimizing Synthetic Aperture Radar (SAR) satellite constellation scheduling for multi-imaging missions in densely targeted areas using an in-house developed Modified Dynamic Programming (MDP) algorithm. By employing Mixed-Integer Linear Programming (MILP) to define the mission planning problem, the research aims to maximize observation of high-value targets within restricted planning horizons. Numerical simulations, covering a wide range of target numbers and satellite configurations, reveal the MDP algorithm’s superior mission allocation efficiency, enhanced success rates, and reduced revisit times, compared to the Greedy algorithm. The findings underscore the MDP algorithm’s improved operational efficiency and planning robustness for complex imaging tasks, demonstrating significant advancements over traditional approaches.

In the past twenty years, the IT industry has moved away from using physical servers for workload management to workloads consolidated via virtualization and, in the next iteration, further consolidated into containers. In the next step, container workloads based on Docker and Podman as underlying container technologies were orchestrated/automated via Kubernetes or OpenShift. On the other hand, high-performance computing (HPC) environments have been lagging in that process, as there’s still much work to figure out how to apply containerization platforms for HPC in real-life scenarios. Kubernetes and OpenShift have many advantages – generally speaking, container technologies use quite a bit less overhead from the computing perspective while providing many benefits in flexibility, modularity, and maintenance. Therefore, they are ideal for tasks requiring a lot of computing power. There are also some tradeoffs regarding the complexity of these two platforms - they’re just not that user-friendly when used by people without years of experience managing them. In this paper, we propose a different architecture based on seamless hardware integration and user-friendly, dynamic workload placement based on real-time performance analysis and prediction coupled with Machine Learning-based scheduling.

Cellular Technology came into existence in Japan in 1979. From that time, we have seen many advances in technology. Currently, most of the person uses either 4G or 5G, among which 5G is a newer technology. 4G network was the first network to use LTE. LTE stands for Long Term Evaluation. Most people get confused between 4G and LTE, they assume both to be the same. In reality, LTE has evolved on the 4G technology. It was first introduced in 2008 to provide higher efficiency and data rates to the cellular network. It was designed to evolve the performance of the networks which includes the evolution of hardware components, optimization of software, power and cost efficiency. This work presents a study on LTE, LTE-A and VoLTE technology. We also discussed about the several packet scheduling algorithms that are being used for transmission of packets. It brings out new opportunities for the researchers to work on increasing the efficiency of those algorithms by modifications.

The fast-paced evolution of artificial intelligence (AI), machine learning (ML), natural language processing (NLP), large language model (LLM) applications, and generative pre-trained transformer (GPT) have set the stage for improved and autonomous project scheduling models. This study demonstrates how project scheduling can be enhanced by employing building information modeling (BIM) to predict reliable schedules for each project element. The research is based on design science research (DSR) methodology and focus group discussion. The proposed system consists of six components: project analyzer, data warehouse, activity identifier and sequencing, activity magnitude and direct cost calculator, activity duration calculator, and schedule analyzer. Unlike other solutions, the proposed solution sequences activities based on an ML model rather than constraint matrices. The proposed solution thus enhances project performance through proactive planning and risk management. Integrating the autonomous project scheduling solution with the other components of an autonomous project management system would surmount schedule challenges and would result in greater cost efficiency and fewer delays.

The advent of deep learning has completely reshaped our world. Now, our daily life is fulfilled with many well-known applications that adopt deep learning techniques, such as self-driving cars and face recognition. Furthermore, robotics developed more forms of technology which share the same principle with face recognition, such as hand pose recognition and fingerprint recognition. Image recognition technology requires a huge database and various learning algorithms, such as convolutional neural network and recurrent neural network, that requires lots of computational power, such as CPUs and GPUs. Thus, clients could not be satisfied with the computational resource of the local machine. The cloud resource platform emerged at a historic moment. Docker containers play a significant role of microservices-based applications in the next generation. However, it could not guarantee the quality of service. From clients’ perspective, they have to balance the budget and quality of experiences (e.g. response time). The budget leans on individual business owners and the required Quality of Experience (QoE) depends on usage scenarios of different applications, for instance, an autonomous vehicle requires real-time response, but, unlocking your smartphone can tolerate delays. Plenty of on-going projects developed user-oriented optimization resource allocation to improve the quality of the service. Considering the users’ specifications, including accelerating the training process and specifying the quality of experience, this thesis proposes two differentiate containers scheduling for deep learning applications: TRADL and DQoES .

Applications in high-performance computing (HPC) may not use all available computational resources, leaving some of them underutilized. By co-scheduling, i.e. running more than one application on the same computational node, it is possible to improve resource utilization and overall throughput. Some applications may have conflicting requirements on resources and co-scheduling may cause performance degradation, so it is important to take it into account in scheduling decisions. In this paper, we formalized co-scheduling problem and proposed multiple scheduling strategies to solve it: an optimal strategy, an online strategy and heuristic strategies. These strategies vary in terms of the optimality of the solution they produce and a priori information about the system they require. We showed theoretically that the online strategy provides schedules with a competitive ratio that has a constant upper limit. This allowed us to solve the co-scheduling problem using heuristic strategies that approximate this online strategy. Numerical simulations showed how heuristic strategies compare to the optimal strategy for different input systems. We proposed a method for measuring input parameters of the model in practice and evaluated this method on HPC benchmark applications. We showed high accuracy of measurement method, which allows to apply proposed scheduling strategies in scheduler implementation.

This paper proposes a Mixed Integer Conic Programming (MICP) model for community microgrids considering the network operational constraints and building thermal dynamics. The proposed multi-objective optimization model optimizes not only the operating cost, including fuel cost, purchasing cost, battery degradation cost, voluntary load shedding cost and the cost associated with customer discomfort due to room temperature deviation from the set point, but also several performance indices, including voltage deviation, network power loss and power factor at the Point of Common Coupling (PCC). In particular, the detailed thermal dynamic model of buildings is integrated into the distribution optimal power flow (D-OPF) model for the optimal operation. The heating, ventilation and air-conditioning (HVAC) systems can be scheduled intelligently to reduce the electricity cost while maintaining the indoor temperature in the comfort range set by customers. Numerical simulation results show the effectiveness of the proposed model and significant savings in electricity cost with network operational constraints satisfied.

Recently, there has been a growing interest in distributed edge computing resource scheduling. For example, application scenarios such as intelligent traffic systems and Internet of Things(IoT) intelligent monitoring require the scheduling and migration of distributed resources. Distributed resource scheduling needs to consider the cost of resource scheduling, with the primary goal of finding the optimal strategy among various feasible solutions. There are different definitions for optimization objectives in different application scenarios, such as cost, transmission delay, energy consumption, etc. Current research mainly considers the optimization problem of local resource scheduling but needs more consideration of global resource scheduling. This paper defines a global resource scheduling problem for distributed edge computing and proves that the problem is NP-Hard. A heuristic solution strategy based on the Ant Colony Algorithm(ACO) was proposed, and Particle Swarm Optimization(PSO) was used to optimize the parameters of the ACO. Finally, an experimental comparative analysis was conducted to demonstrate that the algorithm proposed in this paper has good accuracy and iteration cost performance.

Renewable Energy Communities (RECs) are emerging as an effective concept and model to empower the active participation of citizens on the energy transition, not only as energy consumers, but also as promoters of environmentally friendly energy generation solutions. This paper aims to contribute to the management and optimization of individual and community Distributed Energy Resources (DER). The solution follows a price and source-based REC management program, in which consumers day-ahead flexible loads (Flex Offers) are shifted according to electricity generation availability, prices and personal preferences, to balance the grid and incentivize user participation. The heuristic approach used in the proposed algorithms allows the optimization of energy resources in a distributed edge and fog approach with a low computational overhead. The simulations performed using real world energy consumption and flexibility data of a REC with 50 dwellings show an average cost reduction of 10.6% and an average increase of 11.4% in individual self-consumption. Additionally, the case-study demonstrates promising results regarding grid load balancing and the introduction of intra-community energy trading.

Future cyber-physical systems may extend over broad geographical areas, like cities or regions, thus requiring the deployment of large real-time networks. A strategy to guarantee predictable communication over such networks is to synthesize an offline time-triggered communication schedule. However, this synthesis problem is computationally hard (NP-complete), and existing approaches do not scale satisfactorily to the required network sizes. This article presents a segmented offline synthesis method which substantially reduces this limitation, being able to generate time-triggered schedules for large hybrid (wired and wireless) networks. We also present a series of algorithms and optimizations that increase the performance and compactness of the obtained schedules while solving some of the problems inherent to segmented approaches. We evaluate our approach on a set of realistic large-size multi-hop networks, significantly larger than those considered in the existing literature. The results show that our segmentation reduces the synthesis time up to two orders of magnitude.

We present a generalized state-space model formulation particularly motivated by an online scheduling perspective. Through these proposed generalizations, we enable a natural way to handle routinely encountered disturbances and a rich set of corresponding counter-decisions. Thereby, greatly simplifying and extending the possible application of mathematical programming based online scheduling solutions to diverse application settings.

This paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the Peak Demand Minimization problem and has been previously shown to be NP-hard. Our results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs.

In the past few years, cloud-based additive manufacturing has shown its application and potential in industries. For this reason, when the demand for cloud-based additive products increases, efficient scheduling of related tasks becomes more important to achieve optimized duration. This research proposes a Heuristic Scheduling Algorithm (HSA) for use in Cloud-Based Additive Manufacturing (CBAM) with an approach to Critical Chain Buffer Management (CC/BM). This research aims to schedule and optimize the time in cloud-based additive manufacturing, in addition to the parts production process, it also includes the steps of receiving online orders and informing the manufacturing unit and sending them to the customer. The HSA proposed in this research consists of three phases 1- Buffer sizing, 2- Additive manufacturing and logistics scheduling, and 3- Buffer controlling. To evaluate, the performance of the algorithm is simulated. The finding shows that the proposed HAS can effectively solve the CBAM scheduling problem.

With the rapid development of the Internet of Things, massive amounts of data will be generated at the network edge, resulting in increased latency of the traditional cloud computing model. Cloud service providers deploy edge servers near the users to improve the quality of service. Due to the large scale of networks, the inefficiency of edge server deployment and task scheduling will result in excessive latency and severe workload imbalance among edge servers. In this paper, we propose a Server Deployment and Task Scheduling (SDTS) framework in multi-edge collaborative computing, which can effectively reduce latency and ensure workload balancing. First, a metropolitan area network (MAN) is divided into dense candidate regions (DCRs) based on the density characteristics of mobile end devices, and then servers are deployed independently in each sub-region. Then, a two-step clustering algorithm is designed to deploy servers as close as possible to the mobile devices. Finally, a task scheduling algorithm is presented based on an edge scheduling layer in DCRs, which can leverage collaboration between edge servers to improve the performance of the entire edge computing system. The experimental results based on the Cellular Base Station (CBS) dataset of Shanghai Telecom indicate that the proposed approach outperforms several representative strategies in terms of latency and workload balancing.

Linear programming models have been used in forest management planning since the 1960s. These models have been formulated in three basic ways: Models I, II, and III, which are defined by the sequences of management unit states represented by the variables. In Model I, variables represent sequences of states from the beginning of the planning horizon to the end. In Model II, variables represent sequences of states from one intervention to the next. Finally, in Model III, variables represent a single arc in a management unit’s decision tree, i.e., two states. The objectives of this paper are to clarify the definitions of these model variations and evaluate the advantages and disadvantages of each model. This second objective was achieved by formulating a case study problem using each model type. The case study includes three increasingly complex scenarios, each incorporating additional ecosystem services. Results show that despite having more variables and constraints, Model III requires the least time to formulate due to its less dense parameter matrix. Model II has the shortest solution times, followed closely by Model III, while Model I requires the longest times for both formulation and solution. These results are increasingly apparent in more complex scenarios.

This paper deals with the use of low earth orbit (LEO) satellite links in long-term monitoring of water, ice and snow levels across wide geographic areas, where no other communication links can be applied. Unlike geostationary satellites, LEO satellites do not maintain the same position relative to the ground station, and transmissions need to be scheduled for satellite overfly periods. For our application, the energy consumption optimization is critical, and we develop a learning approach for scheduling the transmission times from the sensors. Our approach is based on online learning, and is applicable to any LEO satellite transmissions.

Abstract: As the policies and regulations currently in place concentrate on environmental protection and greenhouse gas reduction, we are steadily witnessing a shift in the transportation industry towards electromobility. There are, though, several issues that need to be addressed to encourage the adoption of EVs at a larger scale. To this end, we propose a solution capable of addressing multiple EV charging scheduling issues, such as congestion management, scheduling a charging station in advance, and allowing EV drivers to plan optimized long trips using their EVs. The smart charging scheduling system we propose considers a variety of factors such as battery charge level, trip distance, nearby charging stations, other appointments, and average speed. Given the scarcity of data sets required to train the Reinforcement Learning algorithms, the novelty of the recommended solution lies in the scenario simulator, which generates the labelled datasets needed to train the algorithm. Based on the generated scenarios, we created and trained a neural network that uses a history of previous situations to identify the optimal charging station and time interval for recharging. The results are promising and for future work we are planning to train the DQN model using real-world data.

In the manufacturing industry, orders are typically scheduled and delivered through batches, and the probability of machine failure under high-load operation is high. On this basis, we focus on a single machine batch scheduling problem with a maintenance interval (SMBSP-MI). The studied problem is expressed by three-field representation as 1|B,MI|\sum{F_j+\mu}m, and the optimization objective is to minimize total flow time and delivery costs. Firstly, 1|B,MI|\sum{F_j+\mu}m is proved to be NP-hard by Turing reduction. Secondly, shortest processing time (SPT) order is shown the optimal scheduling of SMBSP-MI, and a dynamic programming algorithm based on SPT (DPA-SPT) with the time complexity of O(n^3T_1) is proposed. A small-scale example is designed to verify the feasibility of DPA-SPT. Finally, DPA-SPT is approximated to a fully-polynomial dynamic programming approximation algorithm based on SPT (FDPAA-SPT) by intervals partitioning technique. The proposed FDPAA-SPT runs in O(\frac{n^5}{\varepsilon^2})\ time with the approximation (1+\varepsilon).

In the context of carbon neutrality and carbon peaking, in order to achieve low carbon emissions and promote the efficient utilization of wind energy, hydrogen energy as an important energy carrier is proposed to mix hydrogen and natural gas to form hydrogen enriched compressed natu-ral gas (HCNG). It is also injected into the natural gas pipeline network to realize the transmission and utilization of hydrogen energy. At the same time, the participation of demand response is considered, the load peak and trough period is adjusted, and large-scale consumption of renewa-ble energy and the reduction of carbon emissions are realized. First of all, a fine model of hydro-gen production and hydrogen use equipment is established to analyze the impact of adding hy-drogen mixing on the economy and low-carbon of the system. With green certificates and demand response, the utilization rate of hydrogen energy is improved to further explore the energy utiliza-tion rate and emission reduction capacity of the system. Secondly, on the basis of modeling, the optimal scheduling strategy is proposed with the sum of energy purchase cost, equipment opera-tion cost, carbon emission cost, wind curtailment cost and green certificate income as the lowest objective function. Considering the constraints such as hydrogen blending ratio and flexible load ratio of the pipeline network, a low-carbon economic scheduling model of hydrogen mixed natu-ral gas was established. The model was linearized and solved by using MATLAB and CPLEX solver. By comparing different scenarios, the superiority of the model and the effectiveness of the strategy are verified.

This work addresses the lot-sizing and production scheduling problem of multi-stage multi-product food industrial facilities. More specifically, the production scheduling problem of the semi-continuous yogurt production process, for two large-scale Greek dairy industries, is considered. Production scheduling decisions are taken using two approaches: i) an optimization and ii) a rule-based approach, followed by a comparative study. A MILP model is applied for the optimization of short-term production scheduling of the two industries. Then, the same problems are solved using the commercial scheduling tool ScheduleProTM, which derives scheduling decisions, using simulation-based techniques and empirical rules. It is concluded that both methods, despite having their advantages and disadvantages, are suitable for addressing complex food industrial scheduling problems. The optimization-based approach leads to better results in terms of operating cost reduction. On the other hand, the complexity of the problem and the experience of production engineers and plant operators can significantly impact the quality of the obtained solutions for the rule-based approach.

University course scheduling (UCS) is one of the most important and time-consuming issues that all educational institutions face yearly. Most of the existing techniques to model and solve UCS problems have applied approximate methods, which are different in terms of efficiency, performance, and optimization speed. Accordingly, this research aims to apply an exact optimization method to provide an optimal solution to the course scheduling problem. In other words, in this research, an integer programming model is presented to solve the USC problem. In this model, hard and soft constraints include the facilities of classrooms, courses of different levels and compression of students' curriculum, courses outside the faculty and planning for them, and the limited time allocated to the professors. The objective is to maximize the weighted sum of allocating available times to professors based on their preferences in all periods. To evaluate the presented model's feasibility, it is implemented using the GAMS software. Finally, the presented model is solved in a larger dimension using a real data set from a college in China and compared with the current program in the same college. The obtained results show that considering the mathematical model's constraints and objective function, the faculty courses' timetable is reduced from 4 days a week to 3 working days. Moreover, master courses are planned in two days, and the courses in the educational groups do not interfere with each other. Furthermore, by implementing the proposed model for the real case study, the maximum teaching hours of the professors are significantly reduced. The results demonstrate the efficiency of the proposed model and solution method in terms of optimization speed and solution accuracy.

In recent years, the individualized demand of customers brings small batches and diversification of orders towards enterprises. The application of enabling technologies in factory, such as the Industrial Internet of Things (IIoT) and Cloud Manufacturing (CMfg), enhances the ability of customer requirement automatic elicitation and the manufacturing process control. The job shop scheduling problem with random job arrival time dramatically increases the difficulty in process management. Thus, how to collaboratively schedule the production and logistics resources in the shop floor is very challenging, and it has a fundamental and practical significance of achieving the competitiveness for an enterprise. To address this issue, the real-time model of production and logistics resources is built firstly. Then, the task entropy model is built based on the task information. Finally, the real-time self-adaption collaboration of production and logistics resources is realized. The proposed algorithm is carried out based on a practical case to evaluate its effectiveness. Experimental results show that our proposed algorithm outperforms three existing algorithms.

Being able to complete the production of the product project on time is the prerequisite to win more tasks, many enterprises have begun to study intelligent scheduling algorithms to achieve dynamic control of the total project duration. However, the production operation time of products is highly volatile, and it is impossible to predict the possible operation time of future products. In the actual production environment, we often encounter extreme situations such as mixed production lines, multiple varieties, variable batches, etc. A dynamic optimization CPM model in the ERP/MES system with the attention mechanism (EMA-DCPM) will collect, extract and predict the operation time through artificial intelligence technology, and it can accurately predict the exact operation time of a batch of products that have not yet been produced. Through experiments, our algorithm can realize the production scheduling and get more than 200% better precision than former algorithms and realize dynamic optimization of complex projects.

In this paper, we propose, implement, and test two novel downlink LTE scheduling algorithms. The implementation and testing of these algorithms were in Matlab, and they are based on the use of Reinforcement Learning, more specifically, the Qlearning technique for scheduling two types of users. The first algorithm is called a Collaborative scheduling algorithm, and the second algorithm is called a Competitive scheduling algorithm. The first type of the scheduled users is the Primary Users, and they are the licensed subscribers that pay for their service. The second type of the scheduled users is the Secondary Users, and they could be unlicensed subscribers that dont pay for their service, device to device communications, or sensors. Each user whether it is a primary or secondary is considered as an agent. In the Collaborative scheduling algorithm, the primary user agents will collaborate in order to make a joint scheduling decision about allocating the resource blocks to each one of them, then the secondary user agents will compete among themselves to use the remaining resource blocks. In the Competitive scheduling algorithm, the primary user agents will compete among themselves over the available resources, then the secondary user agents will compete among themselves over the remaining resources. Experimental results show that both scheduling algorithms converged to almost ninety percent utilization of the spectrum, and provided fair shares of the spectrum among users.

Forest planners have traditionally used expected growth and yield coefficients to predict future merchantable timber volumes. However, because climate change affects forest growth, the typical forest planning methods using expected value of forest growth can lead to sub-optimal harvest decisions. We proposed in this paper to formulate the harvest planning with growth uncertainty due to climate change problem as a multistage stochastic optimization problem and use sample average approximation (SAA) as a tool for finding the best set of forest units that should be harvested in the first period even though we have a limited knowledge of what future climate will be. The objective of the harvest planning model is to maximize the expected value of the net present value (NPV) considering the uncertainty in forest growth and thus in revenues from timber harvest. The proposed model was tested on a small forest with 89 stands and the numerical results showed that the approach allows to have superior solutions in terms of net present value and robustness in face of different climate scenarios compared to the approach using the expected growth and yield. The SAA methods requires to generate samples from the distribution of the random parameter. Our results suggested that a sampling scheme that focuses on generating high number of samples in distant future stages is favorable compared to having large sample sizes for the near future stages. Finally, we demonstrated that, depending on the level of forest growth change, ignoring this uncertainty can negatively affect forest resources sustainability.

In this work, an algorithm for the scheduling of household appliances to reduce the energy cost and the peak-power consumption is proposed. The system architecture of a home energy management system (HEMS) is presented to operate the appliances. The dynamics of thermal and non-thermal appliances is represented into state-space model to formulate the scheduling task into a mixed-integer-linear-programming (MILP) optimization problem. Model predictive control (MPC) strategy is used to operate the appliances in real-time. The HEMS schedules the appliances in a dynamic manner without any a priori knowledge of the load-consumption pattern. At the same time, HEMS responds to the real-time electricity market and the external environmental conditions (solar radiation, ambient temperature etc). Simulation results exhibit the benefits of proposed HEMS by showing the reduction of up to 47% in electricity cost and up to 48% in peak power consumption.

Continuous greenhouse gas emissions are causing global warming and impacting the habitats of many animals. Researchers in the field of electric power are making efforts to mitigate this situation. Operating and maintaining the power grid in an economic, low-carbon, and stable is challenging. To address the issue, we propose a grid dispatching technique that combines prediction technology, reinforcement learning, and optimization technology. Prediction technology can forecast future power demand and solar power generation, while reinforcement learning and optimization technology can make charging and discharging decisions for energy storage devices based on current and future grid conditions. In the power system, the aggregation of distributed energy resources increases uncertainty, particularly due to the fluctuating generation of renewable energy. This requires the use of advanced predictive control techniques to ensure long-term economic and decarbonization goals. In this paper, we present a real-time dispatching framework that integrates deep learning-based prediction, reinforcement learning-based decision-making, and stochastic optimization techniques. The framework can rapidly adapt to target uncertainty caused by various factors in real-time data distribution and control processes. The proposed framework achieved global Champion in the NeurIPS Challenge 2022 competition and demonstrated its effectiveness in practical scenarios of intelligent building energy management.

Domain-specific systems-on-chip (DSSoCs) aim to narrow the gap between general-purpose processors and application-specific designs. CPU clusters enable programmability, while hardware accelerators tailored to the target domain minimize task execution times and power consumption. Traditional operating system (OS) schedulers can diminish the potential of DSSoCs as their execution times can be orders of magnitude larger than the task execution time. To address this problem, we propose a dynamic adaptive scheduling (DAS) framework that combines the advantages of a fast, low-overhead scheduler and a sophisticated, high-performance scheduler with a larger overhead. We present a novel runtime classifier that chooses the better scheduler type as a function of the system workload, leading to improved system performance and energy-delay product (EDP). Experiments with five real-world streaming applications indicate that DAS consistently outperforms fast, low-overhead, and slow, sophisticated schedulers. DAS achieves a 1.29x speedup and 45% lower EDP than the sophisticated scheduler under low data rates and a 1.28x speedup and 37% lower EDP than the fast scheduler when the workload complexity increases. Furthermore, we demonstrate that the superior performance of the DAS framework also applies to hardware platforms, with up to a 48% and 52% reduction in execution time and EDP, respectively.

Predictive maintenance (PM) algorithms are widely applied for detecting operational anomalies on industrial processes to trigger maintenance before a possible breakdown; however, much less focus has been devoted to the use of such PM predictions as feedback in automated process control mechanisms. They usually integrate preventive solutions to protect the machines, usually causing downtimes. The premise of this study is to develop a holistic adaptive process scheduling mechanism that incorporates PM analysis as a safety component to optimize the operation mode of an industrial process toward preventing breakdowns while maintaining its availability and operational state, thereby reducing downtimes. As PM is largely a data-driven approach; hence, relies on the setup, we first compare different PM approaches and identify a one-class support vector machine (OCSVM) as the best performing option for the anomaly detection on our setup. Then, we propose a novel pipeline to integrate maintenance predictions into a real-time adaptive process scheduling mechanism. It schedules for the most suitable operation, i.e., optimizing for machine health and process efficiency, according to the abnormal readings. To demonstrate the pipeline on action, we implement our approach on a small-scale conveyor belt system utilizing our Internet of Things (IoT) framework. The results show that our PM-based adaptive process control provides an efficient process with less or no downtime. We also conclude that a PM approach does not provide sufficient efficiency without its integration into an autonomous planning process.

Wireless Sensor Networks (WSNs) has the characteristics of large-scale deployment, flexible networking, and wide application. It is an important part of the wireless communication networks. However, due to limited energy supply, the development of WSN is greatly restricted. Wireless Rechargeable Sensor Networks (WRSNs) transform the distributed energy around the environment into usable electricity through energy collection technology. In this work, a joint optimization strategy is proposed to improve the energy management efficiency for WRSNs. The joint optimization strategy is divided into two phases. In the first phase, we design an Annulus Virtual Force based Particle Swarm Optimization (AVFPSO) algorithm for area coverage planing. It adopts the multi-parameter joint optimization method to improve the efficiency of the algorithm. In the second phase, a Queuing Game-based Energy Supply (QGES) algorithm is designed for energy scheduling. It converts energy supply and consumption into network service. By solving the game equilibrium of the model, the optimal energy distribution strategy can be obtained. The simulation results show that our scheme improves the efficiency of coverage and energy, and extends the lifetime of WSN.

For the task planning problem of the command and control architecture, the existing algorithms have problems such as low efficiency and poor re-planning quality under abnormal conditions. Based on the requirements of the current accusation architecture, this paper constructs a distributed command and control architecture model based on multi-agents, which makes use of the superiority of multi-agents in dealing with complex tasks. The concept of MultiAgents-HTN is proposed under the framework. The original hierarchical task network planning algorithm is optimized, the multi-agent collaboration framework is redefined, and the coordination mechanism of local conflict is designed. Taking the classical resource scheduling problem as the experimental background, the comparison between the proposed algorithm and the classical HTN algorithm is carried out. The experimental results show that the proposed algorithm has higher quality and higher efficiency than the existing algorithm, and the space anomaly is heavy during processing. The planning is more efficient, and the time is more complicated and superior in dealing with the same problem, with good convergence and adaptability. The conclusion proves that the distributed command and control architecture proposed in this paper has high practicability in related fields and can solve the problem of distributed command and control architecture in multi-agent environment.

A field study was conducted at the Eastern Mediterranean Agricultural Research Institute, Adana, Turkey, during the 2022/23 cropping seasons to examine the impact of Mepiquat chloride dosage applied at different intervals to optimize growth, yield characteristics enhancement and improve fiber quality attributes of cotton. The study employed a split-split plot design with three replications. The results revealed that differences among treatments were not statistically significant for most parameters investigated. The observed discrepancies indicated that all treatments tested in 2012 delayed cotton development, whereas in 2023, they led to premium fibers. In 2023, the fiber percentage was highest in the control treatment, and in 2022, it was highest at 400 mL·ha-1. Across all years, the Selin variety exhibited the highest fiber percentage when Mepiquat chloride was applied at the bolling stage. The shoot-root ratio was highest at 400 mL·ha-1 during harvest in 2022 and at 0 mL·ha-1 during the reproductive stage in 2023. Overall, the results demonstrated that the application of Mepiquat chloride altered the physiological characteristics of the cotton plants, leading to bottom-up effects on cotton performance. This implies that the effectiveness of Mepiquat chloride in cotton production to alleviate drought stress is influenced by weather-related conditions.

In this study, a comprehensive review on production scheduling based on reinforcement learning (RL) techniques using bibliometric analysis has been carried out. The aim of this work is, among other things, to point out the growing interest in this domain and to outline the influence of RL as a type of machine learning on production scheduling. To achieve this, the paper explores production scheduling using RL by investigating the descriptive metadata of all pertinent publications contained in the Web of Science database. The study focuses on a wide spectrum of publications spanning the years between 1998 and 2023. The findings and recommendations of this study can serve as new insights for future research endeavors in the realm of production scheduling using RL techniques.

The resource allocation for tasks in heterogeneous distributed system is a well known NP-hard problem. For the sake of making the makespan is minimized, it is hard to distribute the tasks to proper processors. The problem is even more complex and challenging when the processors have unavailable time and the tasks type are various. This paper investigates a resource allocation problem for hybrid tasks comprising both divisible and bag-of-tasks(BoT) in heterogeneous distributed system when the processors has unavailable time. First, the mathematical model, which minimizes the makespan of the hybrid tasks when the processors have unavailable time, is established. Second, we propose a scheduling algorithm referred to as bag-of-tasks allocate-pull and divisible task allocation (BoTAPDTA) algorithm for handling hybrid tasks on heterogeneous distributed systems. In addition, to solving the optimization model efficiently, a generic algorithm(GA) is proposed. For the sake of reducing the search space and solving the optimization model effectively, a two step scheduling algorithm(TSGA), which first allocate bag-of-tasks(BoT) using generic algorithm and then assign divisible task to processors like BoTAPDTA, is designed. Finally, numerical simulation experiments are conducted, and experimental results indicate the effectiveness of the proposed model and algorithm.

We propose a model for medium-term hydropower scheduling (MTHS) with variable head and uncertainty in inflow, reserve capacity, and energy price. With an increase of intermittent energy sources in the generation mix, it is expected that a flexible hydropower producer can obtain added profits by participating in other markets than just the energy market. To capture this added potential the hydropower system should be modeled with a higher level of details. In this context, we apply an algorithm based on stochastic dual dynamic programming (SDDP) to solve the nonconvex MTHS problem, and show that the use of Strengthened Benders (SB) cuts to represent the expected future profit (EFP) function provide accurate scheduling results for slightly nonconvex problems. A method to visualize the EFP function in a dynamic programming setting is provided, serving as a useful tool for a priori inspection of the EFP shape and its nonconvexity.

With an increasing adoption of Battery Electric Bus (BEB) fleets, developing a reliable charging schedule is vital to a successful migration from their fossil fuel counterparts. In this paper, a Simulated Annealing (SA) implementation is developed for a charge scheduling framework for a fixed-schedule fleet of BEBs that utilizes a proportional battery dynamics model, accounts for multiple charger types, allows partial charging, and further considers the total energy consumed by the schedule as well as peak power use. Two generation mechanisms are implemented for the SA algorithm denoted as the "quick" and "heuristic" implementations, respectively. The model validity is demonstrated by utilizing a set of routes sampled from the Utah Transit Authority (UTA) and comparing the results against two other models: the BPAP and the Qin-Modified. The results presented show that both SA techniques offer a means of generating operationally feasible schedules quickly while minimizing the cost of operation and considering battery health.

An algorithm is proposed for discriminating the fatigue state of air traffic controllers based on ap-plying multispeech feature fusion using an FSVM to voice data, and for extracting eye-fatigue-state discrimination features based on PERCLOS eye data. For the speech algorithm and an eye-fatigue index, a new controller fatigue-state evaluation index based on the entropy weight method is proposed based on decision-level fusion of fatigue discrimination results for speech and the eyes. Experimental results show that the fatigue-state recognition accuracy rate was 84.81% for the fatigue state evaluation index, which was 3.36% and 1.86% higher than those for speech and eye assessments, respectively. The comprehensive fatigue evaluation index provides important reference values for controller scheduling and mental-state evaluations.

In the past decade, we have witnessed a dramatically increasing volume of data collected from varied sources. The explosion of data has transformed the world as more information is available for collection and analysis than ever before. To maximize the utilization, various machine and deep learning models have been developed, e.g. CNN [1] and RNN [2], to study data and extract valuable information from different perspectives. While data-driven applications improve countless products, training models for hyperparameter tuning are still time-consuming and resource-intensive. Cloud computing provides infrastructure support for the training of deep learning applications. The cloud service providers, such as Amazon Web Services [3], create an isolated virtual environment (virtual machines and containers) for clients, who share physical resources, e.g., CPU and memory. On the cloud, resource management schemes are implemented to enable better sharing among users and boost the system-wide performance. However, general scheduling approaches, such as spread priority and balanced resource schedulers, do not work well with deep learning workloads. In this project, we propose SpeCon, a novel container scheduler that is optimized for shortlived deep learning applications. Based on virtualized containers, such as Kubernetes [4] and Docker [5], SpeCon analyzes the common characteristics of training processes. We design a suite of algorithms to monitor the progress of the training and speculatively migrate the slow-growing models to release resources for fast-growing ones. Specifically, the extensive experiments demonstrate that SpeCon improves the completion time of an individual job by up to 41.5%, 14.8% system-wide and 24.7% in terms of makespan.

Various factors and constraints should be considered when developing a manufacturing production schedule, and such a schedule is often based on rules. This paper develops a composite dispatching rule based on heuristic rules that comprehensively consider various factors in a semiconductor production line. The composite rule is obtained by exploring various states of a semiconductor production line (machine status, queue size, etc.), where such indicators as makespan and equipment efficiency are used to judge performance. A model of the response surface, as a function of key variables, is then developed to find the optimized parameters of a composite rule for various production states. Further, dynamic scheduling of semiconductor manufacturing is studied based on support vector regression (SVR). This approach dynamically obtains a composite dispatching rule (i.e. parameters of the composite dispatching rule) that can be used to optimize production performance according to real-time production line state. Following optimization, the proposed dynamic scheduling approach is tested in a real semiconductor production line to validate the effectiveness of the proposed composite rule set.

Background: Metabolic flux analysis (MFA) is an indispensable tool in metabolic engineering. The simplest variant of MFA relies on an overdetermined stoichiometric model of the cell’s metabolism under the pseudo-steady state assumption, to evaluate the intracellular flux distribution. Despite its long history, the issue of model error in the overdetermined MFA, particularly misspecifications of the stoichiometric matrix, has not received much attention. Method: We evaluated the performance of statistical tests from linear least square regressions, namely Ramsey RESET test, F-test and Lagrange multiplier test, in detecting model misspecifications in the overdetermined MFA, particularly missing reactions. We further proposed an iterative procedure using the F-test to correct such an issue. Result: Using Chinese hamster ovary and random metabolic networks, we demonstrated that: (1) a statistically significant regression does not guarantee high accuracy of the flux estimates, (2) the removal of a reaction with a low flux magnitude can cause disproportionately large biases in the flux estimates, (3) the F-test could efficiently detect missing reactions, and (4) the proposed iterative procedure could robustly resolve the omission of reactions. Conclusion: Our work demonstrated that statistical analysis and tests could be used to systematically assess, detect and resolve model misspecifications in the overdetermined MFA.

This paper deals with the formulation of a Cobot kinematic model by developing both the direct and inverse kinematics and choosing the noa transformation matrix for defining the end-effector position and orientation with respect to the base frame. These algorithms have been validated via software in Matlab environment and by means of suitable experimental tests, which have been carried out by using a UR5e Cobot. Moreover, a specific industrial application regarding the robotized assembling of a multi-cylinder IC engine, has been designed in terms of layout and corresponding automatic cycle that is intended as a sequence of the robot elementary actions. In particular, the proposed robotized cell is composed by the UR5e Cobot along with its controller and a suitable electropneumatic circuit that includes a PLC with its user interface, which are both governed by means of a specific electronic board and a switch control box. The IC engine in scale of 1:5 and specific parts of the end-effector, which takes the role of vacuum gripper and torque limiting screwdriver, have been designed and manufactured by using a 3D printer.

Amidst the escalating demands for efficient Intelligent Transportation Systems (ITS) management, the significance of accurate Origin-Destination (OD) data prediction has emerged as a paramount concern, given its indispensable role in the ITS domain. This paper introduces a groundbreaking integrated model, creatively fusing the unique strengths of Graph Convolutional Network (GCN), Residual Neural Network (ResNet), and Long Short-Term Memory Network (LSTM) into a single architecture, which we name GraphResLSTM, to exploit road segment average speed data for OD prediction. Compared with conventional road segment traffic volume data, average speed data is more readily available, significantly reducing the data accessibility barrier for OD prediction. We underscore the critical role of selection of key road segments and employs a combination of Entropy Weight Method and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) to identify 41 representative road segments from the experimental road network. In the experimental phase, we simulate 86400000 seconds of traffic conditions, generating a total of 1440000 data records. Utilizing these simulated data, we design and conduct comparative experiments between models as well as data types. The results demonstrate that both the GraphResLSTM model and road segment average speed data outperform other models and data types notably in OD prediction tasks.

The studied solar pot is a recent invention, which gained a utility model protection in 2021 from the Hungarian Intellectual Property Office under patent number 5489. The device is made for environmentally friendly cooking or heating (by utilizing solar energy) of foods and liquids. Its structure is similar to a double pipe heat exchanger, it has an outer mantle and an inner cooking tank. The goals of the paper are proposing a new physically-based mathematical model describing the solar pot and carrying out computer experiments with it, assembling an experimental system of the pot connected with a solar collector and performing measurements on it. Based on the results, the solar pot can successfully be used for cooking or sterilizing foods or liquids during the studied time period, in Hungary.

This paper aims to demonstrate how the detection of communities for epidemiological networks can be used to reduce the dimensionality of optimal control problems. A range of planted partition stochastic blockmodels are generated, where the underlying communities in the model vary in detectability. A high-performance computing workflow is then used to simulate and estimate reduced model dynamics for the networks, which in turn is used to find optimal control solutions.

Pulmonary Embolism (PE) is the obstruction of blood arteries in the lungs by a blood clot. The mortality risk for PE is approximately 30%. Detecting pulmonary embolism in the segmental arteries of the lung is more challenging than in the main arteries and is very prone to being missed. A computer-based approach was created in this work to automatically identify pulmonary embolism in the segmental arteries using computed tomography images. The system's infrastructure includes an enhanced Mask R-CNN deep neural network that has been trained with images containing PE. The network accurately identifies the location of the pulmonary embolism on the computed tomography picture and successfully extracts its borders. The investigation was conducted by generating a local dataset. The study's performance was evaluated using pulmonary embolisms identified manually by the expert radiologist. The sensitivity, specificity, accuracy, dice coefficient, and Jaccard index values for 2130 pictures were 96.4%, 93.5%, 96.1%, 0.96, and 0.90, respectively. The improved Mask R-CNN model has demonstrated superior performance when compared to the traditional Mask R-CNN and U-Net models. This high-performance technology is designed to identify pulmonary embolism and will aid professionals in assessing the size of the embolism.

Estimating the ocean’s subsurface thermohaline information from satellite measurements is essential for understanding ocean dynamics and El Niño phenomenon. This paper proposes an improved double-output Residual Neural Network (DO-ResNet) model to concurrently estimate the ocean subsurface temperature (OST) and ocean subsurface salinity (OSS) in the tropical Western Pacific using multi-source remote sensing data, including sea surface temperature (SST), sea surface salinity (SSS), sea surface height anomaly(SSHA), sea surface wind (SSW), and geographical information (including longitude (LON) and latitude (LAT)). In the model experiment, Argo data were used to train and validate the model, and the root mean square error (RMSE), normalized root mean square error (NRMSE) and coefficient of determination (R²) were employed to evaluate the model's performance. The results showed that the sea surface parameters selected in this study have a positive effect on the estimation process, and the average RMSE and R² values for estimating OST (OSS) by the proposed model are 0.34 °C (0.05 psu) and 0.91 (0.95), respectively. Under the data conditions considered in this study, DO-ResNet demonstrates superior performance relative to the extreme gradient boosting model, random forest model, and artificial neural network model. Additionally, this study evaluates the model’s accuracy by comparing its estimations of OST and OSS across different depths with Argo-derived data, demonstrating the model's ability to effectively capture the most spatial features, and by comparing NRMSE across different depths and seasons, the model displays strong seasonal adaptability. In conclusion, this research introduces a novel artificial intelligence technique for estimating OST and OSS in the tropical Western Pacific Ocean.

This article systematically studied the A-optimal designs of a high-order mixture central polynomial model, which is an advancement of the research results for the A-optimal design of the most recent third-order mixture central polynomial model and a more accurate response surface model. This article is based on the simplex center design, obtaining measurement values at various design points, and verifying them through the A-optimal equivalence theorem. We also compare the A-efficiency of designs through examples, which can be applied to the A-optimal precise design of the fourth-order mixture model.

Refractoriness to antiseizure medications is still a major concern in the pharmacotherapy of epilepsy. For this reason, we decided to evaluate the combination of levetiracetam and cannabidiol, administered at a subthreshold dose, to limit the possible adverse effects of this phytocannabinoid. We administered levetiracetam (300 mg/kg/day, via osmotic minipumps), cannabidiol (120 mg/kg/day, injected once a day subcutaneously), or their combination for one week in epileptic rats. Saline-treated epileptic rats were the control group. Animals were monitored with video electroencephalography the week before and after the treatment. No changes were found in the controls. Levetiracetam did not significantly reduce the total seizure number or the overall seizure duration. Still, the overall number of seizures (p<0.001, Duncan’s new multiple range test) and their total duration (p<0.01) increased in the week following treatment withdrawal. Cannabidiol did not change seizures when administered as a single drug. Instead, levetiracetam combined with cannabidiol resulted in a significant reduction in the overall number and duration of seizures (p<0.05), when comparing values measured during treatment with both pre- and post-treatment values. These findings depended on changes in convulsive seizures, while non-convulsive seizures were stable. These results suggest cannabidiol determined a remarkable potentiation of levetiracetam antiseizure effects at a subthreshold dose.

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.

In order to shorten the detection time and improve the average precision on embedded devices, A lightweight and high accuracy model is proposed for passion fruit in complex environments (backlight, occlusion, overlap, sunny, cloudy, rainy). Firstly, replacing the backbone network of YOLOv5 with a lightweight GhostNet model reduces the number of parameters and computation while improving detection speed. Secondly, a new feature branch is added to the GhostNet network, and the feature fusion layer in the neck network is reconstructed to effectively combine the lower-level and higher-level features, which not only improves the accuracy of the model but also maintains its lightweight. Finally, the knowledge distillation methods are used to transfer the knowledge from the more capable teacher model to the less capable student model, which significantly improving the detection accuracy. The improved model is denoted as G-YOLO-NK. The average accuracy of the G-YOLO-NK network is 96.00%, which is 1.00% higher than the original YOLOv5s model. Furthermore, the improved model size is 7.14MB, reduced to half of the original model, and the real-time detection frame rate is 11.25 FPS on the Jetson Nano. Compared to the state-of-the-art model, the proposed model outperforms them in terms of average precision and detection performance. The present work provides an effective model for real-time detection of passion fruits in complex orchard scenes, which can provide valuable technical support for the development of orchard picking robots and greatly improve the intelligence level of orchards.

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.

Day-ahead forecasting of electricity prices is important in deregulated electricity markets for all the stakeholders: energy wholesalers, traders, retailers, and consumers. Electricity price forecasting is an inherently difficult problem due to its special characteristic of dynamicity and non-stationarity. In this paper, we present a robust price forecasting mechanism that shows resilience towards aggregate demand response effect and provides highly accurate forecasted electricity prices to the stakeholders in a dynamic environment. We employ an ensemble prediction model in which a group of different algorithms participate in predicting the price for each hour of a day. We propose two different strategies, namely, Fixed Weight Method (FWM) and Varying Weight Method (VWM), for selecting each hour's expert algorithm from the set of participating algorithms. In addition, we utilize a carefully engineered set of features selected from a pool of features derived from information such as past electricity price data, weather data, and calendar data. The proposed ensemble model offers better results than both the Pattern Sequence-based Forecasting (PSF) method and our own previous work using Artificial Neural Networks (ANN) alone do on the datasets for New York, Australian, and Spanish electricity markets.

Due to the imbalance between the supply and demand of oxygen, the oxygen system of iron- and steel-making enterprises in China has problems with high oxygen emission and high pressure in the pipelines, resulting in the energy consumption of oxygen production being high. To relieve this problem, using a large-scale iron- and steel-making mill as a case study, the research on demand forecasting and optimal scheduling of the oxygen system was carried out. The ARIMA model and the GABP model are employed to forecast oxygen demand. Based on the forecast results, an optimal scheduling model for the oxygen system was developed to conduct optimal scheduling. The case study shows that based on the oxygen demand forecast and the optimal scheduling, the oxygen emission and the pipeline pressure in the studied iron- and steel-making enterprise can be significantly reduced, thereby achieving considerable energy-saving effects and economic benefits. Specifically, the following conclusions are obtained: (1) For the oxygen demand forecast, the prediction accuracy of the GABP model is better than that of the ARIMA model. The average MAPE of the 12 sets of data of the ARIMA and GABP models are 23.8% and 20.2%, respectively. (2) By comparing the scheduling results and the field data, it is found that after the scheduling, the amount of oxygen emission has decreased by 6.32%, the pipeline pressure has decreased by 0.61%, and the energy consumption of oxygen compression has decreased by 1.6%. Considering both the oxygen emission loss and the energy consumption of oxygen compression, the total power consumption of the oxygen system is reduced by 1.38%, which saves the electricity cost of about 9.03 million RMB per year.

The SK model proposed by Sherrington and Kirkpatrick is an important mean field model for spin glasses. The dependence structure of Hamiltonians of the SK model is considered in this paper. We have investigated the covariance matrix of Hamiltonians of the SK model, and establish a relationship between the rank of the corresponding covariance matrix and the dimension of the space spanned by the Hamiltonians. Finally, we also give an upper bound for the rank of the covariance matrix, which might be the best.

As an important part of urban terminal delivery, automated guided vehicle (AGV) has been widely used in the field of takeout delivery. Due to the real-time generation of takeout orders, the delivery system is required to be extremely dynamic, so the AGV needs to be dynamically scheduled. At the same time, the uncertainty in the delivery process (such as the meal preparation time) further increases the complexity and difficulty of AGV scheduling. Considering the influence of these two factors, the method of embedding stochastic programming model into rolling mechanism is adopted to optimize the AGV delivery routing. Specifically, To handle real-time orders under dynamic demand, an optimization mechanism based on rolling scheduling framework is proposed, which allows the AGV route to be continuously updated. Different from most VRP models, open chain structure is used to describe the dynamic delivery path of AGV. In order to deal with the impact of uncertain meal preparation time on route planning, a stochastic programming model is formulated with the purpose of minimizing the expectation of order timeout rate and the total customer waiting time. In addition, an effective path merging strategy and after-effects strategy are also considered in the model. In order to solve the proposed mathematical programming model, a multi-objective optimization algorithm based on NSGA-III framework is developed. Finally, a series of experimental results demonstrate the effectiveness and superiority of the proposed model and algorithm.

The transportation industry is rapidly transitioning from Internal Combustion Engine (ICE) based vehicles to Electric Vehicles (EVs) to promote clean energy. However, large-scale adoption of EVs can compromise the reliability of the power grids by introducing large uncertainty in the demand. Demand response with a controlled charge scheduling strategy for EVs can mitigate such issues. In this paper, a deep reinforcement learning- based charge scheduling strategy is developed for individual EVs by considering user’s dynamic driving behavior and charging preferences. The temporal dynamics of user’s anxiety about charging the EV battery is rigorously addressed. A dynamic weight allocation technique is applied to continuously tune user’s priority for charging and cost-saving with respect to charging duration. The sequential charging control problem is formulated as a Markov decision process, and an episodic approach to the deep deterministic policy gradient (DDPG) algorithm with target policy smoothing and delayed policy update techniques is applied to develop the optimal charge scheduling strategy. A real-world dataset that captures user’s driving behavior, such as arrival time, departure time, and charging duration, is utilized in this study. The extensive simulation results reveal the effectiveness of the proposed algorithm in minimizing energy cost while satisfying user’s charging requirements.

Project managers should balance a variety of resource elements in building projects while taking into account many major concerns, including time, cost, quality, risk, and the environment. This study presents a framework for resource trade-offs in project scheduling based on the Building Information Modeling (BIM) methodology and metaheuristic algorithms. First, a new metaheuristic algorithm called Fire Hawk Optimizer (FHO) is used. Using project management software and the BIM process, a 3D model of the construction is created. In order to maximize quality while minimizing time, cost, risk, and CO2 in the project under consideration, an optimization problem is created, and the FHO's capability for solving it is assessed. A predefined stopping condition is taken into account while doing 30 independent optimization runs to obtain the statistical metrics, such as the mean, standard deviation, and the required number of objective function evaluations. The results show that the FHO algorithm is capable of producing competitive and exceptional outcomes when it comes to trade-off various resource options in projects.

Currently there are fewer depth models applied to pepper picking detection, while the existing generalized neural networks have problems such as large model parameters, long training time, and low model accuracy.In order to solve the above problems, this paper proposes a Yolo-chili target detection algorithm for chili pepper detection. First, the classical target detection algorithm yolov5 is used as a benchmark model, and an adaptive spatial feature pyramid structure combining the attention mechanism and the idea of multi-scale prediction is introduced to improve the model's detection effect on occluded peppers and small target peppers. Secondly, a three-channel attention mechanism module is introduced to improve the algorithm's long-distance recognition ability and reduce the interference of redundant testers. Finally, the quantized pruning method is used to reduce the model parameters and realize the lightweight processing of the model. Applying the method to the homemade chili pepper dataset, the AP value of chili pepper reaches 93.11%; the accuracy rate is 93.51% and the recall rate is 92.55%.The experimental results show that yolo-chili is able to achieve accurate and real-time pepper detection under complex orchards.

The development of transport infrastructure is a key element of economic growth, social connectivity, and sustainable development. Many countries have historically underinvested in transport infrastructure, necessitating more efficient strategic planning in transport infrastructure investment projects implementation. This article addresses the selecting and scheduling of transport infrastructure projects, specifically within the context of drawing available resources from pre-allocated funds within a multi-annual budget investment program. The current decision-making process is largely based on expert judgment, lacking quantitative decision support methods. The authors propose a genetic algorithm as a decision-support tool that frames the problem as an NP-hard 0-1 multiple knapsack problem. The proposed genetic algorithm is unique for its matrix-encoded chromosomes, specially designed genetic operators, and a customized repair operator, which is implemented to address the large number of invalid chromosomes generated during the GA computation. The goal is to maximize the impact of allocated funds over a seven-year programming period, while respecting constraints specified by the funding authorities. In computational experiments, proposed GA is compared to an exact solution and is proved to be efficient in terms of quality of obtained solutions and computational time, highlighting its potential for enhancing strategic decision-making in transport infrastructure development.

Digitalization plays a crucial role in improving the performance of chemical companies. In this context, different modeling, simulation, and optimization techniques like MILP, discrete-event simulation (DES), and data-driven (DD) models are being used. Due to their heterogeneity, these techniques must be executed individually, and holistic optimization is a manual and time-consuming process. We propose Benders decomposition to combine these techniques into one rigorous optimization procedure. The main idea is that heterogeneous models can simultaneously be optimized as Benders subproblems. We illustrate this concept with the distributed permutation flow shop scheduling problem (DPFSP) and assume that a MILP, DES, and DD model exist for three flow shops. Our approach can compute bounds and report gap information on the optimal makespan for five medium-sized literature instances. The approach is promising because it enables the optimization of heterogeneous models and makes it possible to build optimization capabilities on an existing model and tool landscape in chemical companies.

Geothermal energy, being a clean energy source, has immense potential, and accurate wellbore modeling is crucial for optimizing the drilling process and ensuring safety. This paper presents a novel geothermal wellbore model based on the drift-flux approach, tested under three different temperature and pressure well conditions. The proposed model integrates the conservation equations of mass, momentum, and energy, incorporating the gas-liquid two-phase flow drift-flux model and heat transfer model. Key features include handling heat transfer between the for-mation and the wellbore, addressing the slip relationship between gas and liquid phases, and accounting for wellbore friction. The nonlinear equations are discretized using the finite differ-ence method, and the highly nonlinear system is solved using the Newton-Raphson method. Numerical simulation, validation, and comparison with existing models demonstrate the en-hanced accuracy of this model. In our tests, the model achieved high accuracy in calculating bottom hole pressure and temperature, with Mean Relative Errors (MRE) significantly lower than those of other models. These results offer valuable insights for optimizing drilling parameters and ensuring drilling safety. Comparisons indicate that this approach significantly outperforms others in capturing the complex dynamics of geothermal wellbores, making it a superior tool for geo-thermal energy development.

With the development of deep learning, several Graph Neural Networks (GNN)-based approaches have been utilized for text classification. However, GNNs encounter challenges in capturing contextual text information within a document sequence. To address this, a novel text classification model RB-GAT is proposed by combining RoBERTa-BiGRU embedding and a multi-head Graph ATtention Network (GAT). First, the pre-trained RoBERTa model is exploited to learn word and text embeddings in different contexts. Second, the Bidirectional Gated Recurrent Unit (BiGRU) is employed to capture long-term dependencies and bidirectional sentence information from the text context. Next, the multi-head graph attention network is applied to analyze this information, which serves as a node feature for the document. Finally, the classification results are generated through a Softmax layer. Experimental results on three benchmark datasets demonstrate that our method can achieve an accuracy of 71.48%, 98.45%, and 80.32% on Ohsumed, R8, and MR, which is superior to the existing nine text classification approaches.

Considering characteristics of high river density, special underlying surface in plain river network region, and municipal drainage system function, river network drainage unit model is proposed, which is defined as a region surrounded by main river or embankment. Flood storage variety and control projects regulation of small rivers in each unit is simulated. With drainage catchment as an object, according to its drainage capacity, simplified municipal drainage model was developed. Coupling river network drainage unit model, simplified municipal drainage model and 2D flood routing model, urban flood analysis model for plain tidal river network region was developed, which could be applied to analyzing flood from upstream river, storm surge and local rainfall. Demonstration research was carried out in Puxi flood protected area in Shanghai.

This study addresses the implementation of the International Financial Reporting Standard 9 (IFRS 9) in the European Union as of January 1, 2018, replacing the International Accounting Standard 39 (IAS 39) to introduce a new model for recognizing Loan Loss Provisions (LLP) based on Expected Credit Loss (ECL). This model responds to criticisms of the former Incurred Credit Loss (ICL) system for its inability to reflect credit losses in a timely manner, potentially exacerbating the effects of financial crises (Bushman & Williams, 2015; Gebhardt & Novotny-Farkas, 2011). The study focuses on the effects of adopting the ECL model on the level of Loan Loss Allowances (LLA) in loans, own equity, and the Common Equity Tier 1 (CET1) ratio across 13 Portuguese commercial banks. A mean comparison test is used to evaluate scenarios before and after the application of the ECL model, highlighting the importance of regulator actions and the adequacy of loss recognition policies, including the effects of Regulation (EU) 2017/2395 of December 12. The results obtained demonstrate significant negative impacts on the net values of loans, own equity, and the CET1 ratio upon adopting the IFRS 9 ECL model, due to the widespread increase in LLAs.

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.

This study aims to propose a method for constructing basic digital twin data in South Korea by adhering to international standards and utilizing publicly available data. Specifically, the study focuses on designing and proposing a digital twin data model for buildings, which are the most applicable among the basic digital twin data. To achieve this, the first section provides essential background information, introduces concepts and requirements related to digital twin basic data, and offers a brief overview of CityGML. The second section explains the methodology and data used in this study. The third section presents the main findings: the selection of public data (buildings) for constructing digital twin basic data, the mapping process using CityGML, and the creation of UML diagrams. The fourth section discusses these findings. Finally, the conclusion and suggestions for future research are provided. This approach enhances the accuracy of building-related digital twin data and supports the use of digital twin services in both public and private sectors by enabling various spatial analyses.

Traffic sign detection plays a pivotal role in autonomous driving systems. The intricacy of the detection model necessitates high-performance hardware. Real-world traffic environments exhibit considerable variability and diversity, posing challenges for effective feature extraction by the model. Therefore, it is imperative to develop a detection model that is not only highly accurate but also lightweight. In this paper, we proposed YOLO-ADual, a novel lightweight model. Our method leverages the C3Dual and Adown lightweight modules as replacements for CPS and CBL modules in YOLOv5. The Adown module effectively mitigates feature loss during downsampling while reducing computational costs. Meanwhile, C3Dual optimizes the processing power for kernel feature extraction, enhancing computation efficiency while preserving network depth and feature extraction capability. Furthermore, the inclusion of the CBAM module enables the network to focus on salient information within the image, thus augmenting its feature representation capability. Our proposed algorithm achieves a [email protected] of 70.1% while significantly reducing the number of parameters and computational requirements to 51.83% and 64.73% of the original model, respectively. Compared to various lightweight models, our approach demonstrates competitive performance in terms of both computational efficiency and accuracy.

This systematic literature review explores the burgeoning use of Artificial Intelligence (AI) in manufacturing systems, in line with the principles of Industry 4.0 and the growth of smart factories. In this landscape, AI is crucial in addressing the complexity and dynamism of contemporary manufacturing processes, including machine breakdowns, fluctuating orders and unpredictable job arrivals. This systematic literature review, conducted using the Scopus database and bibliometric tools, pursues two primary objectives. First, it identifies the prevailing trends in solving scheduling problems with AI and identifies the most commonly used AI techniques in the literature. Secondly, it analyses how authors have successfully employed AI to address production scheduling challenges in real-world industrial settings and assesses the benefits obtained by companies. The dynamic nature of manufacturing systems requires adaptive scheduling paradigms. AI, including Particle Swarm Optimization, Neural Networks, and Reinforcement Learning, is applied to optimize production processes, predict machine failures, and achieve substantial benefits. In real-world applications, these AI-driven solutions have led to reduced production costs, enhanced energy efficiency, and more efficient scheduling processes. AI is increasingly recognized as an essential tool in addressing the evolving challenges of modern manufacturing environments.

Wireless sensor networks are attractive largely because they need no wired infrastructure. But precisely this feature makes them energy constrained. Recent studies find that sensing behaviors that are otherwise deemed efficient consume comparable energy with communication. The duty cycle scheduling is perceived as contributing to achieving energy efficiency of sensing. Because of different research assumptions and objectives, various scheduling schemes have various emphases. This paper designed an adaptive sensing scheduling strategy. The objective function of the scheduling strategy includes minimizing average energy expenditure and maximizing sensing coverage (reducing event miss-rate), and it requires relatively loose assumptions. We determine the functional relationship between the variables of the objective function and the step-size parameters of the proposed strategy through the numerical fitting. We found that the objective function aggregated by the fitting functions is a bivariate multi-peak function that favors the Fibonacci tree optimization algorithm. Once the optimization of parameters is done, the strategy can be easily deployed and behaves consistently in the coming hours. We name the proposed strategy as “FTOS”. The experimental results show that the Fibonacci tree optimization algorithm gets a better optimistic effect than the comprehensive learning particle swarm optimization (CLPSO) algorithm and differential evolution (DE) algorithm. The FTOS strategy is superior to the fixed time scheduling strategy in achieving the scheduling objectives. It also outperforms other strategies with the same scheduling objectives such as LDAS, BS, DSS and PECAS.

The critical systems, which the failure and malfunction may result in human, environment and financial severe damages, are essential components in various sectors and particularly in energy domains. Although unwished, integration error problems in supervision of critical systems occurs, incurring significant expenses because of operator’s subjective analysis and on hardware topology failures. In this work, a malleable model design approach is proposed to formulate and solve the integration error problem in the critical systems supervision in terms of reliability. A real Hybrid Power Plant (HPP) case is considered as a requirement for a study case with simulated data. A method framework with informal approach (C4 diagram) and formal approach (Hierarchical Coloured Petri Nets) in radial spectrum is applied to the HPP supervision design. Using formal methods, a formulation and solution to this problem through structured, scalable and compact mathematical representations are possible. This malleable model intends to guarantee functional correctness and then reliability of the plant supervision system based on system software architecture. Outcomes suggest corroboration that the malleable model is appropriate for energy domain, and can be used for other types of critical systems, bringing all the benefits of this methodology to the context in which it will be applied.

We propose a pricing formula for a defaultable zero-coupon bond with imperfect information under a regime-switching model using a structural form of credit risk modelling. While the value of the firm’s equity is observed continuously, we assume that the total value of the firm is only observed at discrete times, such as the dates of the release of the firm’s annual reports, or quarterly reports. This uncertainty about the true value of the firm results in credit spreads that do not approach zero as the debt approaches maturity, which is a problem with many structural models. The firm’s value is typically defined as its equity and debt; however, we consider the asset-to-equity ratio, an accounting ratio used to examine a firm’s financial well-being. A dependent regime-switching process models the components of this ratio, and the Markov chain represents the states of the economy. The main contribution is to study this problem when the dynamics of a firm’s assets have different parameters with regime changes.

Extracorporeal membrane oxygenation (ECMO) is increasingly used in intensive care units; however, ECMO can modify drug pharmacokinetics (PK), leading to underexposure and associated treatment failure. The aim of the present study was to determine the effect of ECMO on the PK of dexmedetomidine (DEX). In vivo rat models were developed, both of which involved a bolus injection of DEX and concentration monitoring. In the in vivo model experiment, rats which underwent ECMO were compared with a control group. PK analysis of in vivo data (noncompartmental analysis and nonlinear mixed-effects modelling) was carried out to determine the effect of ECMO. In vivo PK exploration showed that ECMO induced a decrease in DEX clearance. Because the effect of ECMO on the PK of DEX is not clinically significant, normal DEX dosing for critically ill patients should be effective for patients undergoing ECMO.

By introducing environmental mediator, for avoiding randomness in selecting indicators and subjectivity in deciding interaction path coefficients to reveal interaction mechanism among forest industry, ecology and environmental capacity, structural Pressure–State–Impact–Response (PSIR) and quantitative Structural Equation Modeling (SEM) are utilized with data on thirty–one provinces of China. We can find that: (i) forest industry has a negative influence on ecology, whereas ecology has a positive influence on industry; (ii) the destructive influence that industry has on ecology is much greater than the positive effect ecology has on industry; and (iii) environmental capacity plays a partial mediating role between industry and ecology. According to these results we can conclude that: (i) forest industry and ecology are not in a symbiotic relationship and have not reached a level of ecological security; (ii) the interaction between industry and ecology is in a period of transition from antagonistic to beneficial; and (iii) industry dominates ecology. However, we prospect the following advice: (i) methods of forest industry should be changed; (ii) new modes of industrial integration and circular economy should be developed; and (iii) the ability of the environment to sustain itself should be enhanced. The level of forest ecological security to discuss the symbiotic mechanism of industry and ecology will propose to be measured in future.

The assortment of low-cost 3D printers for “in-practice” use, e.g., for clear aligner therapies, is ever increasing. To address concerns about the accuracy of orthodontic models produced on such printers when cost efficient modes of 3D printing are employed, this study examined the effect of print model body type and print angulation on accuracy. Six printing-configuration groups were included: 2 model types (solid or hollow shell) combined with 3 print angles (0°, 70°, or 90°) with 10 models/group; all models were printed with 100-µm layer thickness using a digital light processing-based 3-dimensional printer. Eleven selected structures and distances were measured on the printed models with a digital microscope and compared to the same measures on a digitized master model. The clinically-acceptability range was set at ±0.25 mm difference from the master model for single tooth measurements (intra-tooth) and ±0.5 mm for cross-arch measurements (inter-tooth). For individual measurements across all models, 98% fell within clinical acceptability. For mean measurements within each model group, only canine height for the shell-0° model had a mean difference (0.26 mm ± 0.03) outside the clinically acceptable range for intra-tooth measurements. Standard deviations for all intra-tooth measurements were within 0.07 mm. While none of the mean inter-tooth measurements exceeded the acceptability range, the standard deviations were larger (0.04 to 0.30 mm). Accuracy of orthodontic models for clear aligner therapies was not impacted beyond the clinically acceptable range when altering model body type and print angulation to improve efficiency of 3D printing. These findings suggest greater flexibility of the practitioner to alter print settings to address time and cost efficiency in various clinical scenarios and still maintain clinically acceptable model accuracy.

Abstract: — management of the Continuous Stirred Tank Reactor (CSTR) operation has proven to be a difficult undertaking due to the complex and ever-changing nature of its behavior, which is both nonlinear and dynamic, which is further compounded by its instability. Attempts have been made to use Proportional-Integral-Derivative (PID) controllers for such processes, but the performance is often poor due to the inherent limitations of the controllers. In contrast, heuristic algorithms have been employed to tune the controllers, but these methods can only provide optimal performance for a restricted range of parameter variations. This paper presents a novel approach that involves using a conventional gain scheduling PID controller in combination with a fuzzy gain scheduling (FGS) controller method to calibrate set-point weighted PID controllers for the CSTR process. The paper outlines the design of the controllers and evaluates their performance by subjecting them to varying input signals within the given bandwidth.

The present era of the Internet of Things (IoT) having intelligent functionalities in solving problems pertaining to realtime mission-critical systems has brought an immense revolution in diverse fields including healthcare and navigation systems. However, to the best of our knowledge, the potential of IoT has not been fully exploited yet in the field of the energy sector. We argue that there is an immense need to shift the traditional mission-critical electric power system architecture to IoT-based fully orchestrated architecture in order to increase efficiency, as billions of investment is reserved for the energy sector globally. Since network orchestration deals with auomating the interaction between multiple components involved to execute a particular service, therefore, scheduling the relevant processes within strict deadlines becomes the core pillar of the architecture. The mission-critical systems with urgent task execution often suffer from issues of missing task deadlines. In this study, we present a novel IoT task orchestration architecture for efficient energy management of a nanogrid system that focuses on minimizing the use of nonrenewable energy resources and maximizing the use of renewable energy resources. Moreover, major components of IoT task orchestration such as task mapping and task scheduling are also enhanced using NLP and PSO optimization modules. The proposed task scheduling algorithm incorporates the optimized surplus time, and efficiently executes the energy management-related tasks contemplating to their types. The study utilizes sensors to obtain data from physical IoT devices, including photovoltaic (PV), Energy Storage System (ESS), and diesel generator (DG). The performance of the proposed model is evaluated using data set of nanogrid houses. The outcomes revealed that IoT-task orchestration has played a pivotal role in efficient energy management for nanogrid mission-critical system. Furthermore, the comparison with state-of-the-art scheduling algorithms showed that the task starvation rate is reduced to 16% and 12% when compared with RR and FEF algorithms, respectively.

In the intersection of the Internet of Things (IoT) and Machine Learning (ML), the choice between high-level and low-level programming libraries presents a significant dilemma for developers, impacting not only the efficiency and effectiveness of ML models but also their environmental footprint. We have proposed a comprehensive framework to aid in this decision-making process, underpinned by a detailed comparative analysis of both types of libraries on one of the key IoT ML task; image classification. We have introduced a novel algorithm designed to calculate the green footprint of ML model training, factoring in execution time, memory utilization, power consumption, and CPU temperature, addressing the urgent need for sustainable ML practices. Through an empirical evaluation of popular libraries such as PyTorch for high-level and Libtorch for low-level development, we have assessed their performance, development efficiency, and hardware compatibility. The culmination of our research is a decision support system that synthesizes the experimental findings to guide developers toward choices that harmonize model performance with environmental sustainability.

The traffic light detection and recognition are crucial for enhancing the security of unmanned systems. This study proposes a YOLOv5-based traffic light detection algorithm to tackle the challenges posed by small targets and complex urban backgrounds. Initially, the mosaic-9 method is employed to enhance the training dataset, thereby boosting the network’s ability to generalize and adapt to real-world scenarios. Furthermore, the network incorporates the Squeezed-and-Excitation (SE) attention mechanism to improve. Moreover, the YOLOv5 algorithm’s loss function has been optimized by substituting it with EIoU_loss, which addresses issues like missed detection and false alarms. Experimental results demonstrate that the model , trained with this enhanced network, achieves a 99.4% mAP on a custom dataset, which is 6.3% higher than the original YOLOv5, while maintaining a detection speed of 74 f/s. Therefore, this algorithm offers higher detection accuracy and effectively meets real-time operational requirements.

CAMx-LPiG (Comprehensive Air Quality Model with Extensions – Linear Plume in Grid) is an online hybrid model, based on the Chemistry and Transport Model (CTM) CAMx, that includes a sub-grid scale module to simulate the dispersion of linear road traffic emissions, called LPiG. LPiG is a plume in grid module specifically developed by extending the capabilities of the Lagrangian puff sub-grid model available in CAMx. The online integration of the local scale model within the Eulerian CTM allows for a multiscale simulation of air quality from the regional scale to the urban scale, preserving a coherent description of the chemical state of the atmosphere at all spatial scales and avoiding any double counting of the emissions simulated by the sub-grid module. In this work the model is presented and evaluated against measured NO2 concentrations for the city of Milan for the month of January 2017. The model is able to introduce road traffic induced gradient in NO2 concentration at sub-grid resolution. Moreover, CAMx-LPiG is shown to reduce the bias compared to CAMx stand-alone simulations.

To address the problems of insufficient semantic fusion between text and questions and the lack of consideration of global semantic information encountered in machine reading comprehension models, we proposed a machine reading comprehension model called BERT_hybrid based on BERT and hybrid attention mechanism. In this model, BERT is utilized to separately map the text and questions into the feature space. Through the integration of Bi-LSTM, attention mechanism, and self-attention mechanism, the proposed model achieves comprehensive semantic fusion between text and questions. The probabilities distribution of answers is computed using Softmax. Experimental results on the public dataset DuReader demonstrate that the proposed model achieves improvements in BLEU-4 and ROUGE-L scores compared to existing models. Furthermore, to validate the effectiveness of the proposed model design, we analyze the factors influencing the model’s performance.

The Asiatic apple leafminer, Phyllonorycter ringoniella (Matsumura), is a significant secondary pest of apple trees in Northeast Asia. To better understand its population dynamics, a population model based on temperature-developmental relationships was constructed. This model includes three sub-models: spring emergence, immature stage transition, and adult oviposition. Field data were collected from sex-pheromone baited traps in apple orchards in Andong, Korea, dur-ing 2015 and 2016 to validate the model. Simulations under six pesticide-natural enemy scenari-os showed that the population size of each generation was best simulated when weighted mor-tality factors for pesticides and natural enemies were applied. Using daily temperature inputs, the model demonstrated that P. ringoniella typically undergoes five generations per year, with peak times predicted within a seven-day margin of field data. Sensitivity analyses revealed that population size was influenced by total fecundity and the larval stage model, but peak times remained consistent despite parameter changes. Higher temperatures led to earlier adult peak dates, especially in summer generations. This model serves as a fundamental tool for estimating population dynamics and abundance changes of P. ringoniella and can guide the timings of pesti-cide application. Further validation is necessary to test the model's efficacy in controlling pests in apple orchards.