1,494 research outputs found

    Puerarin mitigates acute liver injury in septic rats by regulating proinflammatory factors and oxidative stress levels

    Get PDF
    Purpose: To determine the protective effect of puerarin against acute liver injury in septic rats, and the mechanism involved.Methods: Eighty-seven Sprague-Dawley (SD) rats were assigned to control, sepsis and puerarin groups (each having 29 rats). Serum levels of NF-kB, TNF-α, IL-1 β, IL-6, ALT and AST were assayed. Liver lesions and levels of NO, SOD, iNOS and malondialdehyde (MDA) were measured using standard procedures.Results: Compared with the control group, the levels of NF-kB, TNF-α, IL-1β, IL-6, AST, ALT, NO, MDA and iNOS significantly increased in the sepsis group, while SOD level decreased significantly. In contrast, there were marked decreases in NF-kB, TNF-α, IL-1β, AST, ALT, NO, MDA and iNOS in puerarin group, relative to the sepsis group, while SOD expression level was significantly increased (p <0.05). The level of p-p38 in liver of septic rats was up-regulated, relative to control rats, while Nrf2 significantly decreased (p < 0.05). The expression level of p-p38 in the puerarin group was significantly decreased, relative to the sepsis group, while the expression level of Nrf2 significantly increased (p < 0.05).Conclusion: Puerarin mitigates acute liver injury in septic rats by inhibiting NF-kB and p38 signaling pathway, down-regulating proinflammatory factors, and suppressing oxidative stress. Thus, puerarin may be developed for use in the treatment liver injury

    Domain Transfer Learning for Object and Action Recognition

    Get PDF
    Visual recognition has always been a fundamental problem in computer vision. Its task is to learn visual categories using labeled training data and then identify unlabeled new instances of those categories. However, due to the large variations in visual data, visual recognition is still a challenging problem. Handling the variations in captured images is important for real-world applications where unconstrained data acquisition scenarios are widely prevalent. In this dissertation, we first address the variations between training and testing data. Particularly, for cross-domain object recognition, we propose a Grassmann manifold-based domain adaptation approach to model the domain shift using the geodesic connecting the source and target domains. We further measure the distance between two data points from different domains by integrating the distance of their projections through all the intermediate subspaces along the geodesic. Our proposed approach that exploits all the intermediate subspaces along the geodesic produces a more accurate metric. For cross-view action recognition, we present two effective approaches to learn transferable dictionaries and view-invariant sparse representations. In the first approach, we learn a set of transferable dictionaries where each dictionary corresponds to one camera view. The set of dictionaries is learned simultaneously from sets of correspondence videos taken at different views with the aim of encouraging each video in the set to have the same sparse representation. In the second approach, we relaxes this constraint by encouraging correspondence videos to have similar sparse representations. In addition, we learn a common dictionary that is incoherent to view-specific dictionaries for cross-view action recognition. The set of view-specific dictionaries is learned for specific views while the common dictionary is shared across different views. In this way, we can align view-specific features in the sparse feature spaces spanned by the view-specific dictionary set and transfer the view-shared features in the sparse feature space spanned by the common dictionary. In order to handle the more general variations in captured images, we also exploit the semantic information to learn discriminative feature representations for visual recognition. Class labels are often organized in a hierarchical taxonomy based on their semantic meanings. We propose a novel multi-layer hierarchical dictionary learning framework for region tagging. Specifically, we learn a node-specific dictionary for each semantic label in the taxonomy and preserve the hierarchial semantic structure in the relationship among these node-dictionaries. Our approach can also transfer knowledge from semantic label at higher levels to help learn the classifiers for semantic labels at lower levels. Moreover, we exploit the semantic attributes for boosting the performance of visual recognition. We encode objects or actions based on attributes that describe them as high-level concepts. We consider two types of attributes. One type of attributes is generated by humans, while the second type is data-driven attributes extracted from data using dictionary learning methods. Attribute-based representation may exhibit variations due to noisy and redundant attributes. We propose a discriminative and compact attribute-based representation by selecting a subset of discriminative attributes from a large attribute set. Three attribute selection criteria are proposed and formulated as a submodular optimization problem. A greedy optimization algorithm is presented and its solution is guaranteed to be at least (1-1/e)-approximation to the optimum

    Differential Modulation for Short Packet Transmission in URLLC

    Full text link
    One key feature of ultra-reliable low-latency communications (URLLC) in 5G is to support short packet transmission (SPT). However, the pilot overhead in SPT for channel estimation is relatively high, especially in high Doppler environments. In this paper, we advocate the adoption of differential modulation to support ultra-low latency services, which can ease the channel estimation burden and reduce the power and bandwidth overhead incurred in traditional coherent modulation schemes. Specifically, we consider a multi-connectivity (MC) scheme employing differential modulation to enable URLLC services. The popular selection combining and maximal ratio combining schemes are respectively applied to explore the diversity gain in the MC scheme. A first-order autoregressive model is further utilized to characterize the time-varying nature of the channel. Theoretically, the maximum achievable rate and minimum achievable block error rate under ergodic fading channels with PSK inputs and perfect CSI are first derived by using the non-asymptotic information-theoretic bounds. The performance of SPT with differential modulation and MC schemes is then analysed by characterizing the effect of differential modulation and time-varying channels as a reduction in the effective SNR. Simulation results show that differential modulation does offer a significant advantage over the pilot-assisted coherent scheme for SPT, especially in high Doppler environments.Comment: 15 pages, 9 figure

    K-means Clustering Based Feature Consistency Alignment for Label-free Model Evaluation

    Full text link
    The label-free model evaluation aims to predict the model performance on various test sets without relying on ground truths. The main challenge of this task is the absence of labels in the test data, unlike in classical supervised model evaluation. This paper presents our solutions for the 1st DataCV Challenge of the Visual Dataset Understanding workshop at CVPR 2023. Firstly, we propose a novel method called K-means Clustering Based Feature Consistency Alignment (KCFCA), which is tailored to handle the distribution shifts of various datasets. KCFCA utilizes the K-means algorithm to cluster labeled training sets and unlabeled test sets, and then aligns the cluster centers with feature consistency. Secondly, we develop a dynamic regression model to capture the relationship between the shifts in distribution and model accuracy. Thirdly, we design an algorithm to discover the outlier model factors, eliminate the outlier models, and combine the strengths of multiple autoeval models. On the DataCV Challenge leaderboard, our approach secured 2nd place with an RMSE of 6.8526. Our method significantly improved over the best baseline method by 36\% (6.8526 vs. 10.7378). Furthermore, our method achieves a relatively more robust and optimal single model performance on the validation dataset.Comment: Accepted by CVPR 2023 worksho
    • …
    corecore