Search for: All records

Let P(k) denote the largest size of a non-collinear point set in the plane admitting at most k distinct angles. We prove P(2) = P(3) = 5, and we characterize the optimal sets. We also leverage results from Fleischmann et al. [Disc. Comput. Geom. (2023)] to provide the general bounds k+2 ≤ P(k) ≤ 6k, although the upper bound may be improved pending progress toward the Strong Dirac Conjecture. We conjecture that the lower bound is tight, providing infinite families of configurations meeting the bound and ruling out several classes of potential counterexamples. 

Abstract We consider the simultaneous propagation of two contagions over a social network. We assume a threshold model for the propagation of the two contagions and use the formal framework of discrete dynamical systems. In particular, we study an optimization problem where the goal is to minimize the total number of new infections subject to a budget constraint on the total number of available vaccinations for the contagions. While this problem has been considered in the literature for a single contagion, our work considers the simultaneous propagation of two contagions. This optimization problem is NP-hard. We present two main solution approaches for the problem, namely an integer linear programming (ILP) formulation to obtain optimal solutions and a heuristic based on a generalization of the set cover problem. We carry out a comprehensive experimental evaluation of our solution approaches using many real-world networks. The experimental results show that our heuristic algorithm produces solutions that are close to the optimal solution and runs several orders of magnitude faster than the ILP-based approach for obtaining optimal solutions. We also carry out sensitivity studies of our heuristic algorithm. 

We consider the simultaneous propagation of two contagions over a social network. We assume a threshold model for the propagation of the two contagions and use the formal framework of discrete dynamical systems. In particular, we study an optimization problem where the goal is to minimize the total number of new infections subject to a budget constraint on the total number of available vaccinations for the contagions. While this problem has been considered in the literature for a single contagion, our work considers the simultaneous propagation of two contagions. This optimization problem is NP-hard. We present two main solution approaches for the problem, namely an integer linear programming (ILP) formulation to obtain optimal solutions and a heuristic based on a generalization of the set cover problem. We carry out a comprehensive experimental evaluation of our solution approaches using many real-world networks. The experimental results show that our heuristic algorithm produces solutions that are close to the optimal solution and runs several orders of magnitude faster than the ILP-based approach for obtaining optimal solutions. We also carry out sensitivity studies of our heuristic algorithm. 

Spatially synthesizing stiff and elastic domains from a single monomer forms robust synthetic plastics. 

Image‐based machine learning tools are an ascendant ‘big data’ research avenue. Citizen science platforms, like iNaturalist, and museum‐led initiatives provide researchers with an abundance of data and knowledge to extract. These include extraction of metadata, species identification, and phenomic data. Ecological and evolutionary biologists are increasingly using complex, multi‐step processes on data. These processes often include machine learning techniques, often built by others, that are difficult to reuse by other members in a collaboration.

We present a conceptual workflow model for machine learning applications using image data to extract biological knowledge in the emerging field of imageomics. We derive an implementation of this conceptual workflow for a specific imageomics application that adheres to FAIR principles as a formal workflow definition that allows fully automated and reproducible execution, and consists of reusable workflow components.

We outline technologies and best practices for creating an automated, reusable and modular workflow, and we show how they promote the reuse of machine learning models and their adaptation for new research questions. This conceptual workflow can be adapted: it can be semi‐automated, contain different components than those presented here, or have parallel components for comparative studies.

We encourage researchers—both computer scientists and biologists—to build upon this conceptual workflow that combines machine learning tools on image data to answer novel scientific questions in their respective fields.

 

Networkrepresentationsofsocio-physicalsystemsareubiquitous,examplesbeingsocial(media)networks and infrastructurenetworkslikepowertransmissionandwatersystems.Themanysoftwaretoolsthatanalyze and visualizenetworks,andcarryoutsimulationsonthem,requiredifferentgraphformats.Consequently, it isimportanttodevelopsoftwareforconvertinggraphsthatarerepresentedinagivensourceformatintoa required representationinadestinationformat.Fornetwork-basedcomputations,graphconversionisakey capability thatfacilitatesinteroperabilityamongsoftwaretools.Thispaperdescribessuchasystemcalled GraphTrans to convertgraphsamongdifferentformats.Thissystemispartofanewcyberinfrastructure for networksciencecalled net.science. Wepresentthe GraphTrans system designandimplementation, results fromaperformanceevaluation,andacasestudytodemonstrateitsutility.