The National Cancer Institute (NCI) supports numerous research consortia that rely on imaging technologies to study cancerous tissues. To foster collaboration and innovation in this field, the Image Analysis Working G...
详细信息
The National Cancer Institute (NCI) supports numerous research consortia that rely on imaging technologies to study cancerous tissues. To foster collaboration and innovation in this field, the Image Analysis Working Group (IAWG) was created in 2019. As multiplexed imaging techniques grow in scale and complexity, more advanced computational methods are required beyond traditional approaches like segmentation and pixel intensity quantification. In 2022, the IAWG held a virtual hackathon focused on addressing challenges in analyzing complex, high-dimensional datasets from fixed cancer tissues. The hackathon addressed key challenges in three areas: (1) cell type classification and assessment, (2) spatial data visualization and translation, and (3) scaling image analysis for large, multi-terabyte datasets. Participants explored the limitations of current automated analysis tools, developed potential solutions, and made significant progress during the hackathon. Here we provide a summary of the efforts and resultant resources and highlight remaining challenges facing the research community as emerging technologies are integrated into diverse imaging modalities and data analysis platforms.
Clustering is the discovery of latent group structure in data and is a fundamental problem in artificial intelligence,and a vital procedure in data-driven scientific research over all ***,existing methods have various...
详细信息
Clustering is the discovery of latent group structure in data and is a fundamental problem in artificial intelligence,and a vital procedure in data-driven scientific research over all ***,existing methods have various limitations,especially we ak cognitive interpretability and poor computational scalability,when it comes to clustering massive datasets that are increasingly available in all ***,by simulating the multi-scale cognitive observation process of humans,we design a scalable algorithm to detect clusters hierarchically hidden in massive *** observation scale changes,following the Weber-Fechner law to capture the gradually emerging meaningful grouping *** validated our approach in real datasets with up to a billion records and 2000 dimensions,including taxi trajectories,single-cell gene expressions,face images,computer logs and *** approach outperformed popular methods in usability,efficiency,effectiveness and robustness across different domains.
Connected and automated vehicle (CAV) technology is providing urban transportation managers tremendous opportunities for better operation of urban mobility systems. However, there are significant challenges in real-ti...
详细信息
Connected and automated vehicle (CAV) technology is providing urban transportation managers tremendous opportunities for better operation of urban mobility systems. However, there are significant challenges in real-time implementation as the computational time of the corresponding operations optimization model increases exponentially with increasing vehicle numbers. Following the companion paper (Chen et al. 2021), which proposes a novel automated traffic control scheme for isolated intersections, this study proposes a network-level, real-time traffic control framework for CAVs on grid networks. The proposed framework integrates a rhythmic control method with an online routing algorithm to realize collision-free control of all CAVs on a network and achieve superior performance in average vehicle delay, network traffic throughput, and computational scalability. Specifically, we construct a preset network rhythm that all CAVs can follow to move on the network and avoid collisions at all intersections. Based on the network rhythm, we then formulate online routing for the CAVs as a mixed integer linear program, which optimizes the entry times of CAVs at all entrances of the network and their time-space routings in real time. We provide a suffi-cient condition that the linear programming relaxation of the online routing model yields an optimal integer solution. Extensive numerical tests are conducted to show the performance of the proposed operations management framework under various scenarios. It is illustrated that the framework is capable of achieving negligible delays and increased network throughput. Furthermore, the computational time results are also promising. The CPU time for solving a collision-free control optimization problem with 2,000 vehicles is only 0.3 second on an ordinary personal computer.
This paper proposes an efficient computation-aware mode decision and search point (SP) allocation algorithm for spatial and quality scalabilities in Scalable Video Coding. In our proposal, a linear model is derived to...
详细信息
This paper proposes an efficient computation-aware mode decision and search point (SP) allocation algorithm for spatial and quality scalabilities in Scalable Video Coding. In our proposal, a linear model is derived to allocate the computation for macroblocks in enhancement layers by using the rate distortion costs of the base layer. In addition, an adaptive SP decision algorithm is proposed to decide the number of SPs for motion estimation under the constraint of the allocated computation. Experiment results demonstrate that the proposed algorithm allocates the computation resource efficiently and outperforms other works in rate distortion performance under the same computational availability constraint.
Abstract: This paper presents a parallel implementation of the wave hydrodynamics model and the modern SWAN wind-wave model. The results of the parameterization of the vertical turbulent exchange using filtered expedi...
详细信息
This research focuses on the evolving dynamics of the power grid, where traditional synchronous generators are being replaced by non-synchronous power electronic converter (PEC)-interfaced renewable energy sources. Th...
详细信息
暂无评论