Search Results (383)

In this paper, we present a unique method to determine the level of bot contamination of web-based user agents. It is common practice for bots and robotic agents to masquerade as human-like to avoid content and performance limitations. This paper continues our previous work, using over 600 million web log entries collected from over 4000 domains to derive and generalize how the prominence of specific web browser versions progresses over time, assuming genuine human agency. Here, we introduce a parametric model capable of reproducing this progression in a tunable way. This simulation allows us to tag human-generated traffic in our data accurately. Along with the highest confidence self-tagged bot traffic, we train a Transformer-based classifier that can determine the bot contamination—a botness metric of user-agents without prior labels. Unlike traditional syntactic or rule-based filters, our model learns temporal patterns of raw and heuristic-derived features, capturing nuanced shifts in request volume, response ratios, content targeting, and entropy-based indicators over time. This rolling window-based pre-classification of traffic allows content providers to bin streams according to their bot infusion levels and direct them to several specifically tuned filtering pipelines, given the current load levels and available free resources. We also show that aggregated traffic data from multiple sources can enhance our model’s accuracy and can be further tailored to regional characteristics using localized metadata from standard web server logs. Our ability to adjust the heuristics to geographical or use case specifics makes our method robust and flexible. Our evaluation highlights that 65% of unclassified traffic is bot-based, underscoring the urgency of robust detection systems. We also propose practical methods for independent or third-party verification and further classification by abusiveness. Full article

Open-plan offices have established themselves as economically efficient working environments and promote communication. Zoned lighting concepts have proven to be particularly energy-efficient and are determined by the respective occupancy profile. Due to their size, open-plan offices usually have very different levels of daylight availability depending on their position in the room, which affects the light doses per workstation. It is unclear what influence the distribution of users in the room has on the respective target values. This study therefore examines the effects of a variation in the spatial distribution of users in a real open-plan office regarding the three target values of communication distances, daily light doses, and artificial light energy requirements. Statistical methods are used to examine how a user distribution optimized for one target variable affects the other target variables. Since optimizing user distribution is an NP-hard combinatorial problem, heuristic methods are used. The results show that optimized user distribution improves only one target variable. There are no consistently strong correlations between the optimization of communication distances, energy savings, and achievable daily light doses. The work thus contributes to the holistic design of sustainable, user-centered working environments. This research is an example of a living lab case study with optimization-based modeling, emphasizing its exploratory nature rather than controlled experimental inference. Full article

Efficient scheduling in materials manufacturing environment plays a crucial role in minimizing idle time, increasing throughput, and making better use of limited resources. This paper introduces a Genetic Algorithm enhanced with Guided Mutation (GA-GM) to address resource-constrained scheduling challenges in fabrication workflows such as composite forming, thermal processing, and experimental materials analysis. The algorithm refines operation sequences by resolving conflicts arising from shared machinery and limited material availability. Experimental comparisons with traditional heuristics confirm that GA-GM delivers reduced processing durations and improved resource efficiency. Full article

Clinical guidelines, which represent the normative process models for healthcare organizations, are typically available in a textual, unstructured form. This issue hampers the application of classical conformance-checking algorithms to the medical domain, which take in input of a formalized and computer-interpretable description of the process. In this paper, (i) we propose overcoming this problem by taking advantage of a Large Language Model (LLM), in order to extract normative rules from textual guidelines; (ii) we then check and quantify the conformance of the patient event log with respect to such rules. Additionally, (iii) we adopt the approach as a means for evaluating the quality of the models mined by different process discovery algorithms from the event log, by comparing their conformance to the rules. We have tested our work in the domain of stroke. As regards conformance checking, we have proved the compliance of four Northern Italy hospitals to a general rule for diagnosis timing and to two rules that refer to thrombolysis treatment, and have identified some issues related to other rules, which involve the availability of magnetic resonance instruments. As regards process model discovery evaluation, we have assessed the superiority of Heuristic Miner with respect to other mining algorithms on our dataset. It is worth noting that the easy extraction of rules in our LLM-assisted approach would make it quickly applicable to other fields as well. Full article

By 2023, deforestation in the Cerrado biome surpassed 50% of its original area, primarily due to the conversion of native vegetation to pasture and agricultural land. In addition to anthropogenic pressure, climate change has intensified hydrological stress by reducing precipitation and decreasing river flows, thereby threatening water security, quality, and availability in that biome. The Annual Water Yield (AWY) model from the InVEST platform provides a tool to assess ecosystem services by estimating the balance between precipitation and evapotranspiration (ET). In this study, we applied the AWY model to the Urucuia River Basin, analyzing water yield trends from 1991 to 2020. We evaluated climate variables, land use dynamics, and river discharge data and validated the model validation using observed stream flow data. Although the model exhibited low performance in simulating observed streamflow (NSE = −0.14), scenario analyses under reduced precipitation and increased evapotranspiration (ET) revealed consistent water yield responses to climatic variability, supporting the model’s heuristic value for assessing the relative impacts of land use and climate change. The effects of deforestation on estimated water yield were limited, as land use changes resulted in only moderate shifts in basin-wide ET. This was primarily due to the offsetting effects of land conversion: while the replacement of savannas with pasture reduced ET, the expansion of agricultural areas increased it, leading to a net balancing effect. Nevertheless, other ecosystem services—such as water quality, soil erosion, and hydrological regulation—may have been affected, threatening long-term regional sustainability. Trend analysis showed a significant decline in river discharge, likely driven by the expansion of irrigated agriculture, particularly center pivot systems, despite the absence of significant trends in precipitation or ET. Full article

In multi-project environments characterized by resource constraints and high uncertainty, traditional scheduling approaches often fail to respond effectively to dynamic project conditions. Fixed activity durations and rigid resource allocations limit adaptability, leading to inefficiencies and delays. To address this, the paper proposes a novel heuristic-based scheduling method that compresses and decompresses activity durations dynamically within the context of multi-project scheduling under uncertainty and resource flexibility—while preserving resource and precedence feasibility. The technique integrates Critical Path Method (CPM) calculations with heuristic rules to identify candidate activities whose durations can be reduced or extended based on slack availability and resource effort profiles. The objective is to enhance scheduling flexibility, improve resource utilization, and better align project execution with organizational priorities and sustainability goals. Validated through a case study at an automotive company in Portugal, the method demonstrates its practical effectiveness in recalibrating schedules and balancing resource loads. This contribution offers a timely and necessary innovation for companies aiming to enhance responsiveness and competitiveness in increasingly complex project landscapes. It provides an actionable framework for dynamic schedule adjustment in multi-project environments, helping companies to respond more effectively to uncertainty and resource fluctuations. Importantly, the proposed approach also supports sustainability objectives in new product development and supply chain operations. For practitioners, the method offers a responsive and sustainable planning tool that supports real-time adjustments in project portfolios, enhancing resource visibility and execution resilience. For researchers, the study contributes a reproducible, Python-based implementation grounded in Design Science Research (DSR), addressing gaps in stochastic multi-project scheduling and sustainability-aware planning. Full article

Economic dispatch using wind power plants plays a role in reducing the price of electricity production by dispatching power among different generating units for thermal and wind power plants, and supplying load demand while meeting the power system equality and inequality constraints. Adding wind power plants to the economic dispatch model can significantly reduce electricity production costs and reduce carbon dioxide emissions. In this paper, fuel cost and emission minimization are considered as the objective function of the economic dispatch problem, taking into account transmission loss using the B matrix. The quadratic model of the fuel cost and emission criterion functions is modeled without considering a valve-point loading effect. The real power generation limits for both wind and conventional generating units are considered. In addition, a closed-form expression based on the incomplete gamma function is provided to define the impact of wind power, which includes the cost of wind energy, including overestimation and underestimation of available wind power using a Weibull-based probability density function. In this research work, Lagrange’s algorithm is proposed to solve the Wind–Thermal Economic Emission Dispatch (WTEED) problem. The developed Lagrange classical optimization algorithm for the WTEED problem is validated using the IEEE test systems with 6-, 10-, and 40-generation unit systems. The proposed Lagrange optimization method for WTEED problem solutions demonstrates a notable improvement in both economic and environmental performance compared to other heuristic optimization methods reported in the literature. Specifically, the fuel cost was reduced by an average of 4.27% in the IEEE 6-unit system, indicating more economical power dispatch. Additionally, the emission cost was lowered by an average 22% in the IEEE 40-unit system, reflecting better environmental compliance and sustainability. These results highlight the effectiveness of the proposed approach in achieving a balanced trade-off between cost minimization and emission reduction, outperforming several existing heuristic techniques such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Differential Evolution (DE) under similar test conditions. The research findings report that the proposed Lagrange classical method is efficient and accurate for the convex wind–thermal economic emission dispatch problem. Full article

In this paper, we develop a dynamic pricing mechanism for a meal delivery platform that offers multiple transportation modes for order deliveries. We consider orders from heterogeneous customers who select their preferred delivery mode based on individual generalized cost (GC) functions, where GC captures the trade-off between price and delivery latency for each transportation option. Given the logistics of the underlying transportation network, the platform can utilize a pricing mechanism to guide customer choices toward delivery modes that optimize resource allocation across available transportation modalities. By accounting for variability in the latency and cost of modalities, such pricing aligns customer preferences with the platform’s operational objectives and enhances overall satisfaction. Due to the computational complexity of finding the optimal policy, we adopt a deep reinforcement learning (DRL) approach to design the pricing mechanism. Our numerical results demonstrate up to $143\%$ higher profits compared to heuristic pricing strategies, highlighting the potential of DRL-based dynamic pricing to improve profitability, resource efficiency, and service quality in on-demand delivery services. Full article

The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications. In recent years, several heuristic and exact approaches have been proposed to tackle this problem. In this paper, we present a mixed-integer linear program not previously applied to this problem, and we solve it with an open-source solver. Computational results for the benchmark instances commonly adopted in the literature of the problem are reported. The results indicate that the approach we propose obtains results aligned with those of the much more sophisticated approaches available, notwithstanding it being much simpler to implement. During the experimental campaign, six instances were closed for the first time, with nine improved best-known lower bounds and sixteen improved best-known upper bounds over a total of two hundred thirty instances considered. Full article

Demand Side Management (DSM) plays a crucial role in modern energy systems, enabling more efficient use of energy resources and contributing to the sustainability of the power grid. This study examines DSM strategies within a multi-environment context encompassing residential, commercial, and industrial sectors, with a focus on diverse appliance types that exhibit distinct operational characteristics and user preferences. Initially, a single-objective optimization approach using Genetic Algorithms (GAs) is employed to minimize the total energy cost under a real Time-of-Use (ToU) pricing scheme. This heuristic method allows for the effective scheduling of appliance operations while factoring in their unique characteristics such as power consumption, usage duration, and user-defined operational flexibility. This study extends the optimization problem to a multi-objective framework that incorporates the minimization of CO₂ emissions under a real annual energy mix while also accounting for user discomfort. The Non-dominated Sorting Genetic Algorithm II (NSGA-II) is utilized for this purpose, providing a Pareto-optimal set of solutions that balances these competing objectives. The inclusion of multiple objectives ensures a comprehensive assessment of DSM strategies, aiming to reduce environmental impact and enhance user satisfaction. Additionally, this study monitors the Peak-to-Average Ratio (PAR) to evaluate the impact of DSM strategies on load balancing and grid stability. It also analyzes the impact of considering different periods of the year with the associated ToU hourly schedule and CO₂ emissions hourly profile. A key innovation of this research is the integration of detailed, category-specific metrics that enable the disaggregation of costs, emissions, and user discomfort across residential, commercial, and industrial appliances. This granularity enables stakeholders to implement tailored strategies that align with specific operational goals and regulatory compliance. Also, the emphasis on a user discomfort indicator allows us to explore the flexibility available in such DSM mechanisms. The results demonstrate the effectiveness of the proposed multi-objective optimization approach in achieving significant cost savings that may reach 20% for industrial applications, while the order of magnitude of the trade-offs involved in terms of emissions reduction, improvement in discomfort, and PAR reduction is quantified for different frameworks. The outcomes not only underscore the efficacy of applying advanced optimization frameworks to real-world problems but also point to pathways for future research in smart energy management. This comprehensive analysis highlights the potential of advanced DSM techniques to enhance the sustainability and resilience of energy systems while also offering valuable policy implications. Full article

Workflow scheduling in cloud computing is attracting increasing attention. Cloud computing can assign tasks to available virtual machine resources in cloud data centers according to scheduling strategies, providing a powerful computing platform for the execution of workflow tasks. However, developing effective workflow scheduling algorithms to find optimal or near-optimal task-to-VM allocation solutions that meet users’ specific QoS requirements still remains an open area of research. In this paper, we propose a hybrid QoS-aware workflow scheduling algorithm named HLWOA to address the problem of simultaneously minimizing the completion time and execution cost of workflow scheduling in cloud computing. First, the workflow scheduling problem in cloud computing is modeled as a multi-objective optimization problem. Then, based on the heterogeneous earliest finish time (HEFT) heuristic optimization algorithm, tasks are reverse topologically sorted and assigned to virtual machines with the earliest finish time to construct an initial workflow task scheduling sequence. Furthermore, an improved Whale Optimization Algorithm (WOA) based on Lévy flight is proposed. The output solution of HEFT is used as one of the initial population solutions in WOA to accelerate the convergence speed of the algorithm. Subsequently, a Lévy flight search strategy is introduced in the iterative optimization phase to avoid the algorithm falling into local optimal solutions. The proposed HLWOA is evaluated on the WorkflowSim platform using real-world scientific workflows (Cybershake and Montage) with different task scales (100 and 1000). Experimental results demonstrate that HLWOA outperforms HEFT, HEPGA, and standard WOA in both makespan and cost, with normalized fitness values consistently ranking first. Full article

Traffic crashes and congestion generate high social and economic costs, yet traditional traffic monitoring methods, such as police patrols, fixed cameras, and helicopters, are costly, labor-intensive, and limited in spatial coverage. This paper presents a novel Drone Routing and Scheduling with Flexible Multiple Visits (DRSFMV) framework, an optimization model for planning drone-based highway monitoring under realistic operational constraints, including battery limits, variable monitoring durations, recharging at a depot, and target-specific inter-visit time limits. A mixed-integer nonlinear programming (MINLP) model and a linearized version (MILP) are presented to solve the problem. Due to the NP-hard nature of the underlying problem structure, a heuristic solver, Hexaly, is also used. A case study using real traffic census data from three Southern California counties tests the models across various network sizes and configurations. The MILP solves small and medium instances efficiently, and Hexaly produces high-quality solutions for large-scale networks. Results show clear trade-offs between drone availability and time-slot flexibility, and demonstrate that stricter revisit constraints raise operational cost. Full article

Emergency material scheduling (EMS) is a core component of post-disaster emergency response, with its efficiency directly impacting rescue effectiveness and the satisfaction of affected populations. However, due to severe road damage, limited availability of resources, and logistical challenges after disasters, current EMS practices often suffer from uneven resource distribution. To address these issues, this paper proposes a priority-based, multi-stage EMS approach with drone coordination. First, we construct a three-level EMS network “storage warehouses–transit centers–disaster areas” by integrating the advantages of large-scale transportation via trains and the flexible delivery capabilities of drones. Second, considering multiple constraints, such as the priority level of disaster areas, drone flight range, transport capacity, and inventory capacities at each node, we formulate a bilevel mixed-integer nonlinear programming model. Third, given the NP-hard nature of the problem, we design a hybrid algorithm—the Tabu Genetic Algorithm combined with Branch and Bound (TGA-BB), which integrates the global search capability of genetic algorithms, the precise solution mechanism of branch and bound, and the local search avoidance features of Tabu search. A stage-adjustment operator is also introduced to better adapt the algorithm to multi-stage scheduling requirements. Finally, we designed eight instances of varying scales to systematically evaluate the performance of the stage-adjustment operator and the Tabu search mechanism within TGA-BB. Comparative experiments were conducted against several traditional heuristic algorithms. The experimental results show that TGA-BB outperformed the other algorithms across all eight test cases, in terms of both average response time and average runtime. Specifically, in Instance 7, TGA-BB reduced the average response time by approximately 52.37% compared to TGA-Particle Swarm Optimization (TGA-PSO), and in Instance 2, it shortened the average runtime by about 97.95% compared to TGA-Simulated Annealing (TGA-SA).These results fully validate the superior solution accuracy and computational efficiency of TGA-BB in drone-coordinated, multi-stage EMS. Full article

Incremental energy demand, environmental constraints, restrictions in the availability of energy resources, economic conditions, and political impact prompt the power sector toward deregulation. In addition to these impediments, electric power competition for power quality, reliability, availability, and cost forces utilities to maximize utilization of the existing infrastructure by flowing power on transmission lines near to their thermal limits. All these factors introduce problems related to power network stability, reliability, quality, congestion management, and security in restructured power systems. To overcome these problems, power-electronics-based FACTS devices are one of the beneficial solutions at present. In this review paper, the significant role of FACTS devices in restructured power networks and their technical benefits against various power system problems such as load frequency control, voltage stability, and congestion management will be presented. In addition, an extensive discussion about the comparison between different FACTS devices (series, shunt, and their combination) and comparison between various optimization techniques (classical, analytical, hybrid, and meta-heuristics) that support FACTS devices to achieve their respective benefits is presented in this paper. Generally, it is concluded that third-generation FACTS controllers are more popular to mitigate various power system problems (i.e., load frequency control, voltage stability, and congestion management). Moreover, a combination of multiple FACTS devices, with or without energy storage devices, is more beneficial compared to their individual usage. However, this is not commonly adopted in small power systems due to high installation or maintenance costs. Therefore, there is a trade-off between the selection and cost of FACTS devices to minimize the power system problems. Likewise, meta-heuristics and hybrid optimization techniques are commonly adopted to optimize FACTS devices due to their fast convergence, robustness, higher accuracy, and flexibility. Full article

Pedestrian detection systems are widely used in safety-critical domains such as autonomous driving, where deep neural networks accurately perceive individuals and distinguish them from other objects. However, their vulnerability to backdoor attacks remains understudied. Existing backdoor attacks, relying on unnatural digital perturbations or explicit patches, are difficult to deploy stealthily in the physical world. In this paper, we propose a novel backdoor attack method that leverages real-world occlusions (e.g., backpacks) as natural triggers for the first time. We design a dynamically optimized heuristic-based strategy to adaptively adjust the trigger’s position and size for diverse occlusion scenarios, and develop three model-independent trigger embedding mechanisms for attack implementation. We conduct extensive experiments on two different pedestrian detection models using publicly available datasets. The results demonstrate that while maintaining baseline performance, the backdoored models achieve average attack success rates of 75.1% on KITTI and 97.1% on CityPersons datasets, respectively. Physical tests verify that pedestrians wearing backpack triggers could successfully evade detection under varying shooting distances of iPhone cameras, though the attack failed when pedestrians rotated by 90°, confirming the practical feasibility of our method. Through ablation studies, we further investigate the impact of key parameters such as trigger patterns and poisoning rates on attack effectiveness. Finally, we evaluate the defense resistance capability of our proposed method. This study reveals that common occlusion phenomena can serve as backdoor carriers, providing critical insights for designing physically robust pedestrian detection systems. Full article