Drive-by sensing, using vehicles as mobile sensors to collect environmental data, offers high spatiotemporal resolution monitoring. In drive-by sensing tasks, urban areas with intense human activity or pollution – termed high-priority hotspots – demand frequent sensing for adequate data collection. However, prior studies rarely address optimizing vehicle selection to enhance hotspot coverage frequency while maintaining non-hotspot coverage. This study formalized this problem as the Maximal Hotspot Regular Coverage Problem and proposed an Adaptive Level-Aware Vehicle Selection algorithm. Using air pollution hotspot sensing in Beijing as an empirical case, results show the advantage of the proposed algorithm over other baselines: Random selection (RS), Non-hotspot Greedy Adding and Multi-type hotspot Greedy MaxMin, covering 29.99% of hotspots and 77.08% non-hotspot zones with 1000 sensors on average. The spatial distribution of covered area and statistical distribution of average visits per hour reveals a large spatial range and high revisit times of the method, and its advantage over baselines in a hybrid sensing scenario is also proven (with 54.18% daily average coverage among all zones and 31.22% on hotspots). This study provides a method to advance the coverage of hotspots in single-type and hybrid sensing scenarios, inspiring a future extension of optimization based on the proposed algorithm.

Recent advancements in single-cell sequencing technologies enable the measurement of multiple modalities in individual cells, offering insights into the transcriptome and regulome in various biological systems and human diseases in an unprecedented resolution. However, effectively using these ultra-high-dimensional and large-scale multiomic data to understand gene regulation remains challenging. Inspired by the success of adapting large language models into the genomics field, we develop scMBERT, a BERT framework-based pre-trained deep learning model using single-cell multiomic data. We showed that scMBERT increases model flexibility and performance in downstream tasks like cell type annotation and batch-effect correction, demonstrating the potential of leveraging multiomic data to improve single-cell genomic data analyses.

Matching molecular analogues is a computational chemistry and bioinformatics research issue which is used to identify molecules that are structurally or functionally similar to a target molecule. Recent studies on matching analogous molecules have predominantly concentrated on enhancing effectiveness, often sidelining computational efficiency, particularly in contexts of low computational resources. This oversight poses challenges in many real applications (e.g., drug discovery, catalyst generation and so forth). To tackle this issue, we propose a general strategy named MapLE, aiming to promptly match analogous molecules with low computational resources by multi-metrics evaluation. Experimental evaluation conducted on a public biomolecular dataset validates the excellent and efficient performance of the proposed strategy.

MOTIVATION: Narrative visualization for scientific data explorations can help users better understand the domain knowledge, because narrative visualizations often present a sequence of facts and observations linked together by a unifying theme or argument. Narrative visualization in immersive environments can provide users with an intuitive experience to interactively explore the scientific data, because immersive environments provide a brand new strategy for interactive scientific data visualization and exploration. However, it is challenging to develop narrative scientific visualization in immersive environments. In this paper, we propose an immersive narrative visualization tool to create and customize scientific data explorations for ordinary users with little knowledge about programming on scientific visualization, They are allowed to define POIs (point of interests) conveniently by the handler of an immersive device. RESULTS: Automatic exploration animations with narrative annotations can be generated by the gradual transitions between consecutive POI pairs. Besides, interactive slicing can be also controlled by device handler. Evaluations including user study and case study are designed and conducted to show the usability and effectiveness of the proposed tool. AVAILABILITY: Related information can be accessed at: https://dabigtou.github.io/richenliu/.

Abstract Multiuser can collaboratively complete complex visualization tasks that cannot be completed by a single user. Although multiuser collaboration system has made great progress, there are many challenges in the collaborative visualization of 3D volumetric scientific data due to the difficulties in multiuser collaboration, and collaborative slice analysis. This article proposes a client‐server based collaborative visualization system, which consists of a 3D volume explorer and a 2D slice analyzer, to help domain experts to fully utilize their background domain knowledge to illustrate different parts of the data. For example, the brain surgeon expert, pulmonologist, and cardiologist can visualize and analyze the different subsets of the volumetric scientific data, that is, the corresponding subvolumes of the brain, heart, lungs, and blood vessels. It also allows taking full advantage of the hardware resources, because all the computation intensive tasks especially for the whole data rendering can be allocated to the powerful server while the light‐weight tasks can be allocated to the portable clients. Besides, we design a seed point tracing algorithm based on flood fill algorithm to illustrate the slice more efficiently. We evaluate the system by collecting the feedback from domain experts and the people who are unfamiliar with data computation or visualization. The evaluation shows that the 3D volume explorer and the 2D slice analyzer are capable of supporting peer‐expert discussion and medical case teaching, respectively.

In this paper, we propose a thresholding method utilizing the mutual relation between the two used features, which should be both robust and of low correlation. The mutual relation is exploited through a histogram subtraction transformation, which tries to reduce only the background part of each of the histograms for the features so that we can easily differentiate between the background part and the target part. A speedup scheme that requires prior knowledge to exclude the possible local minimum(s) is also presented. To sufficiently validate the effectiveness of our histogram subtraction transformation, the two developed thresholding methods are applied to shadow detection and vegetation detection and compared with some state-of-the-art methods in both fields. The comparative results on multiple data sets indicate that with the thresholds automatically provided by the proposed thresholding methods, even the simple binarization methods can obtain good detection results.