26 papers · ranked by Valyu relevance
Thi-Kien Dao, Shu-Chuan Chu, Trong-The Nguyen, Trinh-Dong Nguyen + 2 more
'Vinh-Tiep Nguyen' 'Ernestina Menasalvas'] Node coverage is one of the crucial metrics for wireless sensor networks’ (WSNs’) quality of service, directly affecting the target monitoring area’s monitoring capacity. Pursuit of the optimal node coverage encounters increasing difficulties because of the limited…
Yihui Huang, Jing Zhang, Wei Wei, Tao Qin + 6 more
'Xuemei Luo' 'Jing Yang' 'Mikołaj Leszczuk' 'Szymon Łukasik' 'Szymon Szott'] To address the problems of uneven distribution and low coverage of wireless sensor network (WSN) nodes in random deployment, a node coverage optimization strategy with an improved COOT bird algorithm (COOTCLCO) is proposed. Firstly, the…
Haixu Niu, Yonghai Li, Chunyu Zhang, Tianfei Chen + 3 more
Coverage control is a fundamental and critical issue in plentiful wireless sensor network (WSN) applications. Aiming at the high-dimensional optimization problem of sensor node deployment and the complexity of the monitoring area, an orthogonal learning multi-strategy bald eagle search (OLMBES) algorithm is proposed to…
Mohammadjavad Abbasi, Muhammad Shafie Bin Abd Latiff, Hassan Chizari
Wireless sensor networks (WSNs) include sensor nodes in which each node is able to monitor the physical area and send collected information to the base station for further analysis. The important key of WSNs is detection and coverage of target area which is provided by random deployment. This paper reviews and…
Fei Gao, Meizhen Wang, Xuejun Liu, Ziran Wang + 1 more
Effective video monitoring systems require optimization of camera and road network coverage, to exploit fully the hardware and software solutions in smart city traffic applications. Monitoring requirements have grown increasingly diverse as scenes are becoming increasingly complex, thereby transforming the camera and…
Prateek Kapadia
A wireless network's design must include the optimization of the area of coverage of its wireless transmitters - mobile and base stations in cellular networks, wireless access points in WLANs, or nodes on a transmit schedule in a wireless ad-hoc network. Typically, the coverage optimization for the common channels is…
Vahab Akbarzadeh, Julien-Charles Lévesque, Christian Gagné, Marc Parizeau
'Marc Parizeau'] We are proposing an adaptation of the gradient descent method to optimize the position and orientation of sensors for the sensor placement problem. The novelty of the proposed method lies in the combination of gradient descent optimization with a realistic model, which considers both the topography of…
Seong Jun Kim, Sung Ha Kang, Haomin Zhou
We propose a method to optimally position a sensor system, which consists of multiple sensors, each has limited range and viewing angle, and they may fail with a certain failure rate. The goal is to find the optimal locations as well as the viewing directions of all the sensors and achieve the maximal surveillance of…
Robert J. M. Eveleigh, Sarah J. Reiling, J. Hector Galvez, Mathieu Bourgey + 2 more
Advances in DNA sequencing have transformed genomics, enabling comprehensive insights into human genetic variation. While short-read sequencing (SRS) remains dominant due to its high accuracy and affordability, its limitations in complex genomic regions have spurred the adoption of long-read sequencing (LRS) platforms…
Zeyu Sun, Xiaofei Xing, Ben Yan, Zhiguo Lv
The non-consecutive coverage problem for the target nodes in Sensor Networks could lead to the coverage blind area and a large amount of redundant data, which causes the bottleneck phenomenon for the communication link. A novel Coverage Control Algorithm for Moving Target Nodes Based on Sensing Probability Model…
Shirantha Welikala, Christos G. Cassandras
Problems using Submodularity, Curvature, and Greedy Algorithms Authors: ['Shirantha Welikala' 'Christos G. Cassandras'] Abstract— We consider a class of multi-agent optimal coverage problems where the goal is to determine the optimal placement of a group of agents in a given mission space such that they maximize a…
Konstantin Weise, Nikola Mikic, Fang Cao, Eric T. Wong + 3 more
Tumor Treating Fields (TTFields) provide a non-invasive treatment option for newly diagnosed glioblastoma. While optimization of electrode placement is important to increase treatment efficacy, clinical therapy planning is done using an undisclosed and proprietary software (NovoTAL®), which is clinically unvalidated.…
Ge Liu, Brandon Carter, Trenton Bricken, Siddhartha Jain + 3 more
We present a combinatorial machine learning method to evaluate and optimize peptide vaccine formulations, and we find for SARS-CoV-2 that it provides superior predicted display of viral epitopes by MHC class I and MHC class II molecules over populations when compared to other candidate vaccines. Our method is robust to…
Dominik Krupke
Coverage path planning is a fundamental challenge in robotics, with diverse applications in aerial surveillance, manufacturing, cleaning, inspection, agriculture, and more. The main objective is to devise a trajectory for an agent that efficiently covers a given area, while minimizing time or energy consumption.…
Authors not listed
Graph Neural Networks (GNNs) are powerful tools for molecular property prediction, but they are not magic. When applied to molecules unlike their training data, they produce unreliable predictions that are difficult to detect. The Applicability Domain (AD) concept addresses this by defining regions of chemical space…
D. Nashtaali, S.A. Motahari, B.H. Khalaj
Lander-Waterman’s coverage bound establishes the total number of reads required to cover the whole genome of size G bases. In fact, their bound is a direct consequence of the well-known solution to the coupon collector’s problem which proves that for such genome, the total number of bases to be sequenced should be O (G…
Meng Jia, Troy Sorensen, Dorit Hammerling
We propose a generic, modular framework to optimize the placement of continuous monitoring sensors on oil and gas sites aiming to maximize the methane emissions detection efficiency. Our proposed framework substantially expands the problem scale compared to previous related studies and can be adapted for different…
Sariel Har-Peled, Jiaqi Cheng
We revisit the problem of computing an optimal partial cover of points by intervals. We show that the greedy algorithm computes a permutation Π = π1, π2, . . . of the intervals that is 3/4 competitive for any prefix of k intervals. That is, for any k, the intervals π1 ∪ · · · ∪ πk covers at least 3/4-fraction of the…
Authors not listed
Monolayer graphene is a suitable active material for several electronics and sensor applications, for which large-area individual sheets are necessary on insulating substrates. Chemical vapor deposition (CVD) enables the synthesis of large-area graphene of high quality on metallic supports. However, graphene grown in…
Marek Wiewiórka, Agnieszka Szmurło, Wiktor Kuśmirek, Tomasz Gambin
Depth of coverage calculation is an important and computationally intensive preprocessing step in a variety of next generation sequencing pipelines, including the analyses of RNA-seq data, detection of copy number variants, or quality control procedures. Building upon big data technologies, we have developed…
Sudarshan Vijay, Hendrik Heenen, Aayush Singh, Karen Chan + 1 more
Kinetic models parameterised by ab-initio calculations have led to significant improvements in understanding chemical reactions in heterogeneous catalysis. These studies have been facilitated by implementations which determine steady-state coverages and rates of mean-field micro-kinetic models. As implemented in the…
Giovanni Birolo, Andrea Telatin
Many genomics applications requires the calculation of nucleotide coverage of a reference or counting how many reads maps in a reference region. Here we present BamToCov, a suite of tools for rapid and flexible coverage calculations relying on a memory efficient algorithm and designed for flexible integration in…
Lloyd Sanders
Herein we extend the work from Patel et al. (1) to find the approximate, optimal distribution of vaccinations of a virus spreading on a network with the use of Genetic Algorithms (GAs). We couch our investigation in an online social network, a Facebook graph of ~4000 nodes. Within this framework we investigate the…
Authors not listed
This work focuses on the impact of lateral interactions on the thermophysical properties of adsorbates. We present different parameterizations for coverage-dependent enthalpy, entropy, and heat capacity in a mean-field microkinetic model. These models are tested against two systems, CO/Pt(111) and CO/Co(0001), using…
Riley Hickman, Priyansh Parakh, Austin Cheng, Qianxiang Ai + 3 more
Experiment planning algorithms are a required component of autonomous platforms for scientific discovery. Selecting a suitable optimization algorithm for a novel application is an important yet difficult choice a researcher has to make based on past empirical performance on similar tasks. To facilitate the evaluation…
Riley Hickman, Matteo Aldeghi, Alán Aspuru-Guzik
Model-based optimization strategies, such as Bayesian optimization (BO), have been deployed across the natural sciences in design and discovery campaigns due to their sample efficiency and flexibility. The combination of such strategies with automated laboratory equipment and/or high-performance computing in a…