Abstract

The Robotic Mobile Fulfillment System (RMFS) is an automated technology to fulfill various types of orders (e.g., vehicle assembly) in modern warehouses or factories. In particular, battery-equipped mobile robots move racks that contain various components (Stock Keeping Unit) by visiting replenishment or picking stations to complete orders. We formulate the preliminary system model to optimize the order throughput and energy consumption of mobile robots, which consists of (i) rack allocation, (ii) task allocation, and (iii) route routing.

Abstract

No Results Found

Abstract

No Results Found

Abstract

This paper explores how real-world geopolitics can influence financial decision-making in virtual environments. The study primarily focuses on trading dynamics in a pandemic simulation game. The players manage resources and trade with each other to save their population. We compared two groups: one playing with made-up country names (control) and another with real country names (test). The players were not permitted to communicate outside of the resources the game provides and were finally ranked based on the number of months survived and trade volume. Our findings reveal two distinct player archetypes, one focusing on maximising trade volume and a second focusing on resource conservation. Real country names compared to color-coded labels seem to delay the perception of competition and reduce overall trade volume, suggesting increased immersion and a more conservative approach towards resource management. Observations from gameplay footage reveal instances of potential bias, with players forming diplomatic ties based on national identities. The data collected suggests that real-world geopolitics can influence financial behaviour in virtual environments as hypothesised. It also explores virtual environments to study how political narratives and dynamics affect human decision-making. The findings offer practical insights for game developers regarding fostering player engagement, mitigating bias, and creating fair economies. While parallels with real-world resource trading and allocation during pandemics were noted, further analysis would be required to explore these connections.

Abstract

In this paper, we present a deterministic -round algorithm for the 2-ruling set problem in the sublinear Massively Parallel Computation (MPC) model. This improves upon the fastest known deterministic 2-ruling set algorithm for this model, which is the -round algorithm by Giliberti and Parsaeian (PODC 2024). Our result is obtained by derandomizing the “sample-and-gather” approach of Kothapalli, Pai, and Pemmaraju (FSTTCS 2020). The “sample-and-gather” approach involves making random sampling decisions, not just for the current iteration, but a batch of future iterations. Thus, derandomizing this approach requires the “fixing” of randomness for a batch of future iterations. We further extend our results to show that a β -ruling set for β ≥ 2 can be obtained in deterministic rounds in the sublinear MPC model. Additionally, we present a deterministic β -ruling set algorithms for sparse graphs (i.e., bounded arboricity graphs) where β ≥ 2, which runs in rounds for arboricity-λ graphs in the sublinear MPC model

Abstract

Reconfiguring two shortest paths in a graph means modifying one shortest path to the other by changing one vertex at a time so that all the intermediate paths are also shortest paths. This problem has several natural applications, namely: (a) repaving road networks, (b) rerouting data packets in a synchronous multiprocessing setting, (c) the shipping container stowage problem, and (d) the train marshalling problem. When modelled as graph problems, (a) is the most general case while (b), (c), (d) are restrictions to different graph classes. We show that (a) does not admit polynomial-time algorithms (assuming ), even for relaxed variants of the problem (assuming ). For (b), (c), (d), we present polynomial-time algorithms to solve the respective problems. We also generalize the problem to when at most k (for a fixed integer ) contiguous vertices on a shortest path can be changed at a time.

Abstract

Image Attribution seeks to reveal the importance of image regions in the classifier’s final decision. Of the various ways to tackle this problem, the optimization based perspective is particularly intuitive: It applies the attribution as a mask on the image and reduces the attribution task to a loss, that can be optimized using gradient descent. Previous work has considered the goal as searching for the single best mask. Under this setup, however, there is a tendency towards trivial solutions of large masks with reduced discernment of the relative importances of regions. This has typically required auxiliary loss terms to control the area of the mask, however, their strength relative to the primary loss needs to be tuned. We challenge this necessity, by re-imagining attribution as an ordering of pixels according to importance. This ordering may be interpreted as a schedule which determines which locations get seen earlier and which later, allowing us to create a trajectory of masks from completely OFF to completely ON. We optimize through this sequence of masks of “all” areas and not just a single mask as in previous methods. We explore this setting, which we dub Saliency-as-Schedule (SaS), and demonstrate its effectiveness through experiments in a variety of settings, involving multiple datasets and CNN architectures. Further, we also propose a novel attribution task, feature saliency, where we use SaS to rate the influence of image regions on the intermediate feature maps of a CNN, and not just the class logit. Our findings suggest that SaS is a promising direction for the attribution problem. Our code will be available at https://github.com/tumbleweed/SaliencyasSchedule

Abstract

Image Attribution is the task of ascribing importance to regions of the input, for the final decision of a classifier. Many methods for attribution exist, and a recent development has been to use the image at multiple scales to improve the performance of some lightweight attribution methods. These gains have been demonstrated for methods that require a single or multiple but independent forward passes through the network; however, they haven’t been explored in the context of optimization-based attribution (OA) methods. As compared to other techniques, like CAMs or axiomatic methods, OA is attractive as it lends a natural formulation of the task without the need for any heuristic rules. However, the iterative way of solving the optimization problem presents challenges to straightforward utilization of multiple scales. We investigate this scenario and develop a novel 2-step approach that first discovers promising areas across scales and locations from the input and then runs Optimization based Attribution on them. We find that while a naive incorporation of image crops is unsuccessful, this 2-stage pipeline leads to improvements in performance. We provide qualitative and quantitative evidence for this and investigate the reasons for the improvement via multiple ablation experiments.

Abstract

In the present era, the increasing number of network devices and ubiquitous computing leads to the flow of enormous amounts of data traffic, including sensitive and confidential information, on the internet and carrying out commercial and banking transactions online. This gives cybercriminals an opportunity to launch an attack like phishing to steal confidential information from the user and gain unauthorized access. This can be mitigated by the help of an intelligent machine learningbased phishing detection system, which can detect potential phishing attacks and take appropriate action. In this paper, we have addressed this major cyber issue and proposed a machine learning-based phishing detection scheme (in short, EM-PAD), which is trained on a benchmark dataset and evaluated on standard metrics: F1-score and Accuracy. The proposed model is compared with different existing schemes based on Accuracy, indicating that it has outperformed them with remarkable results

Abstract

In the realm of smart city surveillance, consumer electronics (CE) devices communicate through vulnerable wireless channels, posing significant security risks. To ensure secure and uninterrupted services for residents, continuous monitoring is imperative. Existing authentication methods for CE in smart cities authenticate users/devices at the onset of a communication session, assuming they remain authenticated throughout. However, temporary access by an attacker to the user's or CE device can lead to impersonation. To mitigate this security threat, we propose a continuous authentication (CA) protocol utilizing vector similarity search (VSS), which has emerged as a novel approach to enhance security and privacy in CE deployed within smart city surveillance systems. Through the employment of VSS techniques and secure communication via session key establishment, the proposed scheme continuously monitors user behavior and verifies legitimacy, ensuring seamless operation and protection against a myriad of potential threats. This innovative framework enhances the resilience of smart city infrastructures against unauthorized access, data tampering, data poisoning attacks, and other malicious activities.