104 research outputs found
How People Perceive The Dynamic Zero-COVID Policy: A Retrospective Analysis From The Perspective of Appraisal Theory
The Dynamic Zero-COVID Policy in China spanned three years and diverse
emotional responses have been observed at different times. In this paper, we
retrospectively analyzed public sentiments and perceptions of the policy,
especially regarding how they evolved over time, and how they related to
people's lived experiences. Through sentiment analysis of 2,358 collected Weibo
posts, we identified four representative points, i.e., policy initialization,
sharp sentiment change, lowest sentiment score, and policy termination, for an
in-depth discourse analysis through the lens of appraisal theory. In the end,
we reflected on the evolving public sentiments toward the Dynamic Zero-COVID
Policy and proposed implications for effective epidemic prevention and control
measures for future crises
Radiation Measurements and Data Analysis of Turbulent Premixed Lean Flame
An accurate understanding of the radiation transfer in turbulent premixed lean flame is critical for improving energy efficiencies and reducing emissions such as nitric oxide and soot. Radiation measurement is an effective and nonintrusive way to study the radiation properties of turbulent premixed lean flames. In this study, a high-speed infrared camera was utilized to measure the planar radiation from turbulent premixed lean flames under different conditions. Time-dependent flame images were acquired and radiation statistics were calculated and compared to investigate the effects of equivalence ratio, heat release rate, hydrogen pilot flame rate, and co-flow rate on the radiation intensity of the flames. Results show that radiation intensity increases with equivalence ratio and heat release rate. However, changes of hydrogen pilot flame rate and co-flow rate have little impact on the radiation intensity. These experimental data are essential for the study of turbulent premixed lean flames and the calibration of the empirical relations in the simulation models
Modular Frame Method Plugging in Fuyu Problem Well for Treatment Application
In Fuyu oil field wells spit mudstone serious, sloughing, lost the problems on the top of the fish, take relief well construction method, using new drilling trajectory, through reservoir perforated interval as China Unicom media, from and old wells trajectory formed a U-shaped connecting device, eventually set up a China Unicom, so as to implement to new wells trajectory cement injection to sealed wells eyes return channel to. The technology to solve casing fault at the lower part of the fish top completely lost without channel, shallow mudstone strata serious collapse and leakage, et in sleeve and a lot of spit mudstone and operation cannot on the lower part of wellbore and reservoir were blocked. In the communication of the trajectory of the new and old wells by chemical plugging agent and augmented injection provided measures of pressure, relative effective reduces the invalid diversion effect, improve good communication relationship between new and old wells eyes and Unicom performance, finally realizes the effective sealing effect. In the field application, it has achieved good results, effectively blocking the difficult wells, and provides a new method for the safety management of Fuyu oilfield
Local Conditional Neural Fields for Versatile and Generalizable Large-Scale Reconstructions in Computational Imaging
Deep learning has transformed computational imaging, but traditional
pixel-based representations limit their ability to capture continuous,
multiscale details of objects. Here we introduce a novel Local Conditional
Neural Fields (LCNF) framework, leveraging a continuous implicit neural
representation to address this limitation. LCNF enables flexible object
representation and facilitates the reconstruction of multiscale information. We
demonstrate the capabilities of LCNF in solving the highly ill-posed inverse
problem in Fourier ptychographic microscopy (FPM) with multiplexed
measurements, achieving robust, scalable, and generalizable large-scale phase
retrieval. Unlike traditional neural fields frameworks, LCNF incorporates a
local conditional representation that promotes model generalization, learning
multiscale information, and efficient processing of large-scale imaging data.
By combining an encoder and a decoder conditioned on a learned latent vector,
LCNF achieves versatile continuous-domain super-resolution image
reconstruction. We demonstrate accurate reconstruction of wide field-of-view,
high-resolution phase images using only a few multiplexed measurements. LCNF
robustly captures the continuous object priors and eliminates various phase
artifacts, even when it is trained on imperfect datasets. The framework
exhibits strong generalization, reconstructing diverse objects even with
limited training data. Furthermore, LCNF can be trained on a physics simulator
using natural images and successfully applied to experimental measurements on
biological samples. Our results highlight the potential of LCNF for solving
large-scale inverse problems in computational imaging, with broad applicability
in various deep-learning-based techniques
SegmentAnything helps microscopy images based automatic and quantitative organoid detection and analysis
Organoids are self-organized 3D cell clusters that closely mimic the
architecture and function of in vivo tissues and organs. Quantification of
organoid morphology helps in studying organ development, drug discovery, and
toxicity assessment. Recent microscopy techniques provide a potent tool to
acquire organoid morphology features, but manual image analysis remains a labor
and time-intensive process. Thus, this paper proposes a comprehensive pipeline
for microscopy analysis that leverages the SegmentAnything to precisely
demarcate individual organoids. Additionally, we introduce a set of
morphological properties, including perimeter, area, radius, non-smoothness,
and non-circularity, allowing researchers to analyze the organoid structures
quantitatively and automatically. To validate the effectiveness of our
approach, we conducted tests on bright-field images of human induced
pluripotent stem cells (iPSCs) derived neural-epithelial (NE) organoids. The
results obtained from our automatic pipeline closely align with manual organoid
detection and measurement, showcasing the capability of our proposed method in
accelerating organoids morphology analysis.Comment: submitted to SPIE: Medical Imaging 202
-Puzzle: A Cost-Efficient Testbed for Benchmarking Reinforcement Learning Algorithms in Generative Language Model
Recent advances in reinforcement learning (RL) algorithms aim to enhance the
performance of language models at scale. Yet, there is a noticeable absence of
a cost-effective and standardized testbed tailored to evaluating and comparing
these algorithms. To bridge this gap, we present a generalized version of the
24-Puzzle: the -Puzzle, which challenges language models to reach a
target value with integers. We evaluate the effectiveness of
established RL algorithms such as Proximal Policy Optimization (PPO), alongside
novel approaches like Identity Policy Optimization (IPO) and Direct Policy
Optimization (DPO).Comment: 8 page
Expedited Training of Visual Conditioned Language Generation via Redundancy Reduction
In this paper, we introduce , a streamlined
framework designed for the pre-training of visually conditioned language
generation models with high computational demands, utilizing frozen pre-trained
large language models (LLMs). The conventional approach in vision-language
pre-training (VLP) typically involves a two-stage optimization process: an
initial resource-intensive phase dedicated to general-purpose vision-language
representation learning, focused on extracting and consolidating relevant
visual features. This is followed by a subsequent phase that emphasizes
end-to-end alignment between visual and linguistic modalities. Our novel
one-stage, single-loss framework bypasses the computationally demanding first
training stage by gradually merging similar visual tokens during training,
while avoiding model collapse caused by single-stage training of BLIP-2 type
models. The gradual merging process effectively condenses visual information
while preserving semantic richness, resulting in rapid convergence without
compromising performance. Our experimental findings demonstrate that our
approach accelerates the training of vision-language models by a factor of 5
without a noticeable impact on overall performance. Furthermore, we illustrate
that our models significantly narrow the performance gap to current
vision-language models using only 1/10 of the data. Finally, we showcase how
our image-text models can seamlessly adapt to video-conditioned language
generation tasks through novel soft attentive temporal token contextualizing
modules. Code is available at \url{https://github.com/yiren-jian/EVLGen}
Understanding the Dynamics of DNNs Using Graph Modularity
There are good arguments to support the claim that deep neural networks
(DNNs) capture better feature representations than the previous hand-crafted
feature engineering, which leads to a significant performance improvement. In
this paper, we move a tiny step towards understanding the dynamics of feature
representations over layers. Specifically, we model the process of class
separation of intermediate representations in pre-trained DNNs as the evolution
of communities in dynamic graphs. Then, we introduce modularity, a generic
metric in graph theory, to quantify the evolution of communities. In the
preliminary experiment, we find that modularity roughly tends to increase as
the layer goes deeper and the degradation and plateau arise when the model
complexity is great relative to the dataset. Through an asymptotic analysis, we
prove that modularity can be broadly used for different applications. For
example, modularity provides new insights to quantify the difference between
feature representations. More crucially, we demonstrate that the degradation
and plateau in modularity curves represent redundant layers in DNNs and can be
pruned with minimal impact on performance, which provides theoretical guidance
for layer pruning. Our code is available at
https://github.com/yaolu-zjut/Dynamic-Graphs-Construction.Comment: Accepted by ECCV 202
- …