Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2024
Mining Interesting Sequential Patterns using a Novel Balanced Utility Measure
AbstractHigh utility sequential pattern (HUSP) mining (HUSM) is an emerging task in data mining. The goal is to identify sequential patterns in a quantitative sequence database that have high importance, as measured by a utility function. Nevertheless, a ...
- research-articleDecember 2023
On the upper bounds of (1,0)-super solutions for the regular balanced random (k,2s)-SAT problem
Frontiers of Computer Science: Selected Publications from Chinese Universities (FCS), Volume 18, Issue 4https://doi.org/10.1007/s11704-023-2752-2AbstractThis paper explores the conditions which make a regular balanced random (k,2s)-CNF formula (1,0)-unsatisfiable with high probability. The conditions also make a random instance of the regular balanced (k − 1,2(k − 1)s)-SAT problem unsatisfiable ...
- research-articleOctober 2023
Managing Edge Offloading for Stochastic Workloads with Deadlines
MSWiM '23: Proceedings of the Int'l ACM Conference on Modeling Analysis and Simulation of Wireless and Mobile SystemsPages 99–108https://doi.org/10.1145/3616388.3617515Increasing demand for computationally intensive jobs on mobile devices is driving interest in computation offloading to the edge/cloud servers. This paper presents a comprehensive framework for managing offloading of stochastic and heterogeneous user(s)-...
- research-articleAugust 2023
HUSP-SP: Faster Utility Mining on Sequence Data
ACM Transactions on Knowledge Discovery from Data (TKDD), Volume 18, Issue 1Article No.: 5, Pages 1–21https://doi.org/10.1145/3597935High-utility sequential pattern mining (HUSPM) has emerged as an important topic due to its wide application and considerable popularity. However, due to the combinatorial explosion of the search space when the HUSPM problem encounters a low-utility ...
-
- research-articleNovember 2022
A New Upper Bound on Cache Hit Probability for Non-Anticipative Caching Policies
ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS), Volume 7, Issue 2-4Article No.: 5, Pages 1–24https://doi.org/10.1145/3547332Caching systems have long been crucial for improving the performance of a wide variety of network and web-based online applications. In such systems, end-to-end application performance heavily depends on the fraction of objects transferred from the cache, ...
- research-articleJanuary 2022
Revisiting and Improving Upper Bounds for Identifying Codes
SIAM Journal on Discrete Mathematics (SIDMA), Volume 36, Issue 4Pages 2619–2634https://doi.org/10.1137/22M148999XAn identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighborhoods within $C$. These codes have been widely studied for over two decades. We give an improvement over all the best ...
- research-articleJanuary 2021
A new algorithm for solving uncapacitated transportation problem with interval-defined demands and suppliers capacities
- Zeinul Abdeen M. Silmi Juman,
- Mahmoud Masoud,
- Mohammed Elhenawy,
- Hanif Bhuiyan,
- Md Mostafizur Rahman Komol,
- Olga Battaïa
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology (JIFS), Volume 41, Issue 1Pages 625–637https://doi.org/10.3233/JIFS-202436The uncapacitated transportation problem (UTP) deals with minimizing the transportation costs related to the delivery of a homogeneous product from multi-suppliers to multi-consumers. The application of the UTP can be extended to other areas of ...
- research-articleJanuary 2021
Minimizing the number of robots required for a Robotic Process Automation (RPA) problem
Procedia Computer Science (PROCS), Volume 192, Issue CPages 2689–2698https://doi.org/10.1016/j.procs.2021.09.039AbstractRobotic Process Automation (RPA) is used in various fields of human activity in order to implement faster and more secure processes through a reduction in the risks or errors but also an increase in the productivity rates. The increase of its use ...
- research-articleJuly 2020
Optimal content placement for cache‐enabled IoT networks with local channel state information based joint transmission
IET Communications (CMU2), Volume 14, Issue 15Pages 2628–2638https://doi.org/10.1049/iet-com.2020.0167The large amount of devices deployed for the Internet of Things (IoT) cause a tremendous traffic burden on the cloud server. Caching content at the edge of IoT networks is a promising technology to alleviate the traffic load. However, how to further ...
- research-articleJanuary 2020
An Upper Bound on Error Probability in Communication Systems with Single-User Reception Based on Order Statistics
Automation and Remote Control (ARCO), Volume 81, Issue 1Pages 107–117https://doi.org/10.1134/S0005117920010099AbstractThe model of a channel that describes the transmission of information in communication systems with a single-user receiver based on order statistics is considered. The transmission of information through such a channel using a linear block code is ...
- research-articleJanuary 2019
On upper and lower bounds of identifying code set for soccer ball graph with application to satellite deployment
ICDCN '19: Proceedings of the 20th International Conference on Distributed Computing and NetworkingPages 307–316https://doi.org/10.1145/3288599.3288632We study a monitoring problem on the surface of the earth for significant environmental, social/political and extreme events using satellites as sensors. We assume that the surface of the earth is divided into a set of regions, where a region may be a ...
- research-articleDecember 2018
Exact WCRT Analysis for Message-Processing Tasks on Gateway-Integrated In-Vehicle CAN Clusters
ACM Transactions on Embedded Computing Systems (TECS), Volume 17, Issue 6Article No.: 95, Pages 1–29https://doi.org/10.1145/3284178A typical automotive integrated architecture is a controller area network (CAN) cluster integrated by a central gateway. This study proposes a novel and exact worst-case response time (WCRT) analysis method for message-processing tasks in the gateway. ...
- research-articleOctober 2018
Performance of two‐way AF relaying with energy harvesting over Nakagami‐m fading channels
IET Communications (CMU2), Volume 12, Issue 20Pages 2592–2599https://doi.org/10.1049/iet-com.2018.5090In this study, the authors consider a two‐way amplify‐and‐forward communication system over Nakagami‐m fading environments, where an intermediate relay node harvests energy from its surrounding radio frequency environment using an energy harvesting ...
- research-articleJune 2018
Bounding the menu-size of approximately optimal auctions via optimal-transport duality
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingPages 123–131https://doi.org/10.1145/3188745.3188786The question of the minimum menu-size for approximate (i.e., up-to-ε) Bayesian revenue maximization when selling two goods to an additive risk-neutral quasilinear buyer was introduced by Hart and Nisan [2013], who give an upper bound of O(1/ε4) for this ...
- research-articleJune 2018
Improving the adaptive event detection algorithm of Nyström and Holmquist for noisy data
ETVIS '18: Proceedings of the 3rd Workshop on Eye Tracking and VisualizationArticle No.: 8, Pages 1–5https://doi.org/10.1145/3205929.3205938Detecting eye tracking events such as fixations and saccades is one of the first important steps in eye tracking research. The adaptive algorithm by Nyström and Holmqvist [2010] estimates thresholds by computing a "peak velocity detection threshold" (PT)...
- research-articleJune 2018
Joint multicast beamforming and user scheduling in large‐scale antenna systems
IET Communications (CMU2), Volume 12, Issue 11Pages 1307–1314https://doi.org/10.1049/iet-com.2017.0634The joint multicast beamforming and user scheduling problem is studied, with the objective of minimising total transmitting power across multiple channels by jointly assigning each user to appropriate channel and designing multicast beamformer for each ...
- research-articleJuly 2017
Efficient SimRank-Based Similarity Join
ACM Transactions on Database Systems (TODS), Volume 42, Issue 3Article No.: 16, Pages 1–37https://doi.org/10.1145/3083899Graphs have been widely used to model complex data in many real-world applications. Answering vertex join queries over large graphs is meaningful and interesting, which can benefit friend recommendation in social networks and link prediction, and so on. ...
- research-articleApril 2017
Improving capacity for physical network coding with lattice strategies in two‐way fading channels
IET Communications (CMU2), Volume 11, Issue 7Pages 1123–1131https://doi.org/10.1049/iet-com.2016.1262In this study, the capacity problem in a two‐way fading channel is considered. The authors propose amplify‐and‐forward with lattice codes (AF&LC), exploiting a modulo operation at the relay. Without destroying the construct of codebook, the modulo ...
- research-articleApril 2017
Upper bound computation for buffer backlog on AFDX networks with multiple priority virtual links
SAC '17: Proceedings of the Symposium on Applied ComputingPages 586–593https://doi.org/10.1145/3019612.3019729In recent avionics systems, AFDX (Avionics Full Duplex Switched Ethernet) is the network used to replace the previously deployed point-to-point networks. In AFDX networks, nodes are not synchronized and therefore data contention repeatedly occurs at the ...