检索结果-内蒙古大学图书馆

Ginsenoside compound-K attenuates OVX-induced osteoporosis via the suppression of RANKL-induced osteoclastogenesis and oxidative stress

引用

Natural Products and Bioprospecting 2023年第1期13卷 159-170页

作者： Lingli Ding Zhao Gao Siluo Wu Chen Chen Yamei Liu Min Wang Yage Zhang Ling Li Hong Zou Guoping Zhao Shengnan Qin Liangliang Xu Key Laboratory of Orthopaedics and Traumatology Lingnan Medical Research CenterThe First Affiliated Hospital of Guangzhou University of Chinese MedicineGuangzhou University of Chinese MedicineGuangzhouChina Er Sha Sports Training Center of Guangdong Province GuangzhouChina School of Basic Medical Science Guangzhou University of Chinese MedicineGuangzhouChina Engineering Laboratory for Nutrition Shanghai Institute of Nutrition and HealthChinese Academy of SciencesShanghaiChina Master Lab for Innovative Application of Nature Products National Center of Technology Innovation for Synthetic BiologyTianjin Institute of Industrial BiotechnologyChinese Academy of SciencesTianjinChina CAS Key Laboratory of Quantitative Engineering Biology Shenzhen Institute of Synthetic BiologyShenzhen Institute of Advanced TechnologyChinese Academy of SciencesShenzhenChina CAS-Key Laboratory of Synthetic Biology CAS Center for Excellence in Molecular Plant SciencesShanghai Institute of Plant Physiology and EcologyChinese Academy of SciencesShanghaiChina Bio-Med Big Data Center Shanghai Institute of Nutrition and HealthChinese Academy of SciencesShanghaiChina State Key Laboratory of Genetic Engineering Department of Microbiology and ImmunologySchool of Life SciencesFudan UniversityShanghaiChina Department of Microbiology The Chinese University of Hong KongHong KongChina Department of Orthopaedics Guangzhou Institute of Traumatic SurgeryGuangzhou Red Cross HospitalMedical CollegeJinan UniversityGuangzhouChina

Osteoporosis(OP),a systemic and chronic bone disease,is distinguished by low bone mass and destruction of bone *** Compound-K(CK),one of the metabolites of ginsenoside Rb1,has anti-aging,anti-inflammatory,anti-cancer,and hypolipidemic *** have demonstrated CK could promote osteogenesis and fracture healing in our previous ***,the contribution of CK to osteoporosis has not been *** the present study,we investigated the effect of CK on osteoclastogenesis and ovariectomy(OVX)-induced *** results showed that CK inhibited receptor activator for nuclear factor-κB ligand(RANKL)-mediated osteoclast differentiation and reactive oxygen species(ROS)activity by inhibiting the phosphorylation of NF-κB p65 and oxidative stress in RAW264.7 *** addition,we also demonstrated that CK could inhibit bone resorption using bone marrow-derived ***,we demonstrated that CK attenuated bone loss by suppressing the activity of osteoclast and alleviating oxidative stress in *** together,these results showed CK could inhibit osteoclastogenesis and prevent OVX-induced bone loss by inhibiting NF-κB signaling pathway.

关键词： Ginsenoside CK NF-κB signaling pathway Osteoporosis Oxidative stress

来源：评论

学校读者我要写书评

暂无评论

CDDSA: Contrastive Domain Disentanglement and Style Augmentation for Generalizable Medical Image Segmentation

arXiv

引用

arXiv 2022年

作者： Gu, Ran Wang, Guotai Lu, Jiangshan Zhang, Jingyang Lei, Wenhui Chen, Yinan Liao, Wenjun Zhang, Shichuan Li, Kang Metaxas, Dimitris N. Zhang, Shaoting School of Mechanical and Electrical Engineering University of Electronic Science and Technology of China Chengdu China School of Biomedical Engineering Shanghai Jiao Tong University Shanghai China School of Biomedical Engineering ShanghaiTech University Shanghai China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Sensetime Research Shanghai China Department of Radiation Oncology Sichuan Cancer Hospital and Institute University of Electronic Science and Technology of China Chengdu China West China Hospital-SenseTime Joint Lab West China Biomedical Big Data Center Sichuan University Chengdu China Department of Computer Science Rutgers University PiscatawayNJ08854 United States Shanghai AI Lab Shanghai China

Generalization to previously unseen images with potential domain shifts and different styles is essential for clinically applicable medical image segmentation, and the ability to disentangle domain-specific and domain-invariant features is key for achieving Domain Generalization (DG). However, existing DG methods can hardly achieve effective disentanglement to get high generalizability. To deal with this problem, we propose an efficient Contrastive Domain Disentanglement and Style Augmentation (CDDSA) framework for generalizable medical image segmentation. First, a disentangle network is proposed to decompose an image into a domain-invariant anatomical representation and a domain-specific style code, where the former is sent to a segmentation model that is not affected by the domain shift, and the disentangle network is regularized by a decoder that combines the anatomical and style codes to reconstruct the input image. Second, to achieve better disentanglement, a contrastive loss is proposed to encourage the style codes from the same domain and different domains to be compact and divergent, respectively. Thirdly, to further improve generalizability, we propose a style augmentation method based on the disentanglement representation to synthesize images in various unseen styles with shared anatomical structures. Our method was validated on a public multi-site fundus image dataset for optic cup and disc segmentation and an in-house multi-site Nasopharyngeal Carcinoma Magnetic Resonance Image (NPC-MRI) dataset for nasopharynx Gross Tumor Volume (GTVnx) segmentation. Experimental results showed that the proposed CDDSA achieved remarkable generalizability across different domains, and it outperformed several state-of-the-art methods in domain-generalizable segmentation. Code is available at https://***/Hilab-git/DAG4MIA. © 2022, CC BY.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Incomplete data management： a survey

引用

Frontiers of Computer science 2018年第1期12卷 4-25页

作者： Xiaoye MIAO Yunjun GAO Su GUO Wanqi LIU College of Computer Science Zhejiang University Hangzhou 310027 China The Key Lab of Big Data Intelligent Computing of Zhejiang Province Zhejiang University Hangzhou 310027 China

Incomplete data accompanies our life processes and covers almost all fields of scientific studies, as a result of delivery failure, no power of battery, accidental loss, etc. However, how to model, index, and query incomplete data in- curs big challenges. For example, the queries struggling with incomplete data usually have dissatisfying query results due to the improper incompleteness handling methods. In this pa- per, we systematically review the management of incomplete data, including modelling, indexing, querying, and handling methods in terms of incomplete data. We also overview sev- eral application scenarios of incomplete data, and summa- rize the existing systems related to incomplete data. It is our hope that this survey could provide insights to the database community on how incomplete data is managed, and inspire database researchers to develop more advanced processing techniques and tools to cope with the issues resulting from incomplete data in the real world.

关键词： incomplete data query processing indexing,application system

来源：评论

学校读者我要写书评

暂无评论

Provable approximations for constrained p regression

arXiv

引用

arXiv 2019年

作者： Jubran, Ibrahim Cohn, David Feldman, Dan Robotics and Big Data Lab Department of Computer Science University of Haifa Haifa Israel

The p linear regression problem is to minimize f(x) = ||Ax - b||p over x ϵ Rd, where A ϵ Rn×d, b 2 Rn, and p > 0. To avoid overfitting and bound ||x||2, the constrained p regression minimizes f(x) over every unit vector x ϵ Rd. This makes the problem non-convex even for the simplest case d = p = 2. Instead, ridge regression is used to minimize the Lagrange form f(x)+λjjxjj2 over x 2 Rd, which yields a convex problem in the price of calibrating the regularization parameter λ > 0. We provide the first provable constant factor approximation algorithm that solves the constrained p regression directly, for every constant p;d λ 1. Using core-sets, its running time is O(n log n) including extensions for streaming and distributed (big) data. In polynomial time, it can handle outliers, p 2 (0;1) and minimize f(x) over every x and permutation of rows in A. Experimental results are also provided, including open source and comparison to existing software. Copyright © 2019, The Authors. All rights reserved.

关键词： Regression analysis

来源：评论

学校读者我要写书评

暂无评论

Deep Fashion3D: A dataset and benchmark for 3D garment reconstruction from single images

arXiv

引用

arXiv 2020年

作者： Zhu, Heming Cao, Yu Jin, Hang Chen, Weikai Du, Dong Wang, Zhangye Cui, Shuguang Han, Xiaoguang Chinese University of Hong Kong Shenzhen Shenzhen Research Institute of Big Data State Key Lab of CAD&CG Zhejiang University Xidian University Tencent America University of Science and Technology of China

High-fidelity clothing reconstruction is the key to achieving photorealism in a wide range of applications including human digitization, virtual try-on, etc. Recent advances in learning-based approaches have accomplished unprecedented accuracy in recovering unclothed human shape and pose from single images, thanks to the availability of powerful statistical models, e.g. SMPL [38], learned from a large number of body scans. In contrast, modeling and recovering clothed human and 3D garments remains notoriously difficult, mostly due to the lack of large-scale clothing models available for the research community. We propose to fill this gap by introducing Deep Fashion3D, the largest collection to date of 3D garment models, with the goal of establishing a novel benchmark and dataset for the evaluation of image-based garment reconstruction systems. Deep Fashion3D contains 2078 models reconstructed from real garments, which covers 10 different categories and 563 garment instances. It provides rich annotations including 3D feature lines, 3D body pose and the corresponded multi-view real images. In addition, each garment is randomly posed to enhance the variety of real clothing deformations. To demonstrate the advantage of Deep Fashion3D, we propose a novel baseline approach for single-view garment reconstruction, which leverages the merits of both mesh and implicit representations. A novel adaptable template is proposed to enable the learning of all types of clothing in a single network. Extensive experiments have been conducted on the proposed dataset to verify its significance and usefulness. We will make Deep Fashion3D publicly available upon publication. Copyright © 2020, The Authors. All rights reserved.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Tight sensitivity bounds for smaller coresets

arXiv

引用

arXiv 2019年

作者： Maalouf, Alaa Statman, Adiel Feldman, Dan Robotics and Big Data Lab Department of Computer Science University of Haifa Haifa Israel

An ϵ-coreset for Least-Mean-Squares (LMS) of a matrix A ϵ n×dis a small weighted subset of its rows that approximates the sum of squared distances from its rows to every affine k-dimensional subspace of d, up to a factor of 1±ϵ. Such coresets are useful for hyper-parameter tuning and solving many least-mean-squares problems such as low-rank approximation (k-SVD), k-PCA, Lassso/Ridge/Linear regression and many more. Coresets are also useful for handling streaming, dynamic and distributed big data in parallel. With high probability, non-uniform sampling based on upper bounds on what is known as importance or sensitivity of each row in A yields a coreset. The size of the (sampled) coreset is then near-linear in the total sum of these sensitivity bounds. We provide algorithms that compute provably tight bounds for the sensitivity of each input row. It is based on two ingredients: (i) iterative algorithm that computes the exact sensitivity of each point up to arbitrary small precision for (non-affine) k-subspaces, and (ii) a general reduction of independent interest from computing sensitivity for the family of affine k-subspaces in dto (non-affine) (k + 1)- subspaces in d+1. Experimental results on real-world datasets, including the English Wikipedia documentsterm matrix, show that our bounds provide significantly smaller and data-dependent coresets also in practice. Full open source is also provided. Copyright © 2019, The Authors. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

CBLNER: A Multi-models Biomedical Named Entity Recognition System Based on Machine Learning 1

引用

15th International Conference on Intelligent Computing, ICIC 2019

作者： Lejun, Gong Xiaolin, Liu Xuemin, Yang Lipeng, Zhang Yao, Jia Ronggen, Yang Jiangsu Key Lab of Big Data Security and Intelligent Processing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Faculty Intelligent Science and Control Engineering Jinling Institute of Technology Nanjing211169 China

ISBN: (数字)9783030269692

ISBN: (纸本)9783030269685

Biomedical named entities is fundamental recognition task in biomedical text mining. This paper developed a system for identifying biomedical entities with four models including CRF, LSTM, Bi-LSTM and BiLSTM-CRF. The system achieved the following performance in test data Genia V3.02: CRF with an F score of 75.91%, LSTM with an F score of 71.69%, BiLSTM with a F score of 74.37%, BiLSTM-CRF with a F score of 76.81%. Experimental results show the performance of BiLSTM-CRF model is better than other three models. Compared with CRF model, Bi-LSTM-CRF model has better recognition effect for biological entities in long text and entities that modified by modifiers. Therefore, CBLNER system lays a foundation for further relationship and event extraction, and could also provide reference for entity recognition research in other fields. © 2019, Springer Nature Switzerland AG.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

Detach and Enhance: Learning Disentangled Cross-modal Latent Representation for Efficient Face-Voice Association and Matching

Detach and Enhance: Learning Disentangled Cross-modal Latent...

引用

IEEE International Conference on data Mining (ICDM)

作者： Zhenning Yu Xin Liu Yiu-Ming Cheung Minghang Zhu Xing Xu Nannan Wang Taihao Li Dept. of Comput. Sci. & Fujian Key Lab. of Big Data Intelligence and Security Huaqiao University Xiamen China Zhejiang Lab Hangzhou China Dept. of Comput. Sci. and Institute of Research and Continuing Education HK Baptist University Hong Kong SAR China Xiamen Key Lab. of Computer Vision and Pattern Recognition Huaqiao University Xiamen China Dept. of Computer Sci. and Eng. University of Electronic Science and Technology of China Chengdu China State Key Lab. of Integrated Services Networks & School of Telecommun. Eng. Xidian University Xi’an China

Many researches in cognitive science have shown that humans often perform face-voice association for various perception tasks, and some recent data mining works have been designed in emulating such ability intelligently. Nevertheless, most methods often suffer from the degraded performance when there exist semantically irrelevant interference factors across different modalities. To alleviate this concern, this paper presents an efficient Disentangled Cross-modal Latent Representation (DCLR) method to adaptively detach the discriminative feature attributes and enhance the face-voice association. To be specific, the proposed DCLR framework consists of two-stage cross-modal disentangling process. First, the former stage employs the supervised contrastive learning to push the representations of face-voice data from the same person closer while pulling those representations of different person away. Then, the latter stage freezes all the parameters of the former stage, and further innovates a multi-layer orthogonal decoupling scheme to learn the disentangled latent representations, while filtering out the modality-dependent irrelevant factors. Besides, the cross-modal reconstruction loss is further utilized to narrow down the semantic gap between heterogeneous feature expressions. Through the joint exploitation of the above, the proposed framework can well associate the face-voice data to benefit various kinds of cross-modal perception tasks. Extensive experiments verify the superiorities of the proposed face-voice association framework and show its competitive performances.

关键词： Representation learning Filtering Semantics Interference data models Cognitive science data mining

来源：评论

学校读者我要写书评

暂无评论

VulDeeLocator: A deep learning-based fine-grained vulnerability detector

arXiv

引用

arXiv 2020年

作者： Li, Zhen Zou, Deqing Xu, Shouhuai Chen, Zhaoxuan Zhu, Yawei Jin, Hai The National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Big Data Security Engineering Research Center School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China School of Cyber Security and Computer Hebei University Baoding071002 China The Department of Computer Science University of Colorado Colorado Springs CO80918 United States University of Texas San Antonio United States

Automatically detecting software vulnerabilities is an important problem that has attracted much attention from the academic research community. However, existing vulnerability detectors still cannot achieve the vulnerability detection capability and the locating precision that would warrant their adoption for real-world use. In this paper, we present a vulnerability detector that can simultaneously achieve a high detection capability and a high locating precision, dubbed Vulnerability Deep learning-based Locator (VulDeeLocator). In the course of designing VulDeeLocator, we encounter difficulties including how to accommodate semantic relations between the definitions of types as well as macros and their uses across files, how to accommodate accurate control flows and variable define-use relations, and how to achieve high locating precision. We solve these difficulties by using two innovative ideas: (i) leveraging intermediate code to accommodate extra semantic information, and (ii) using the notion of granularity refinement to pin down locations of vulnerabilities. When applied to 200 files randomly selected from three real-world software products, VulDeeLocator detects 18 confirmed vulnerabilities (i.e., true-positives). Among them, 16 vulnerabilities correspond to known vulnerabilities;the other two are not reported in the National Vulnerability database (NVD) but have been "silently" patched by the vendor of Libav when releasing newer versions. Copyright © 2020, The Authors. All rights reserved.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Fast and accurate least-mean-squares solvers

arXiv

引用

arXiv 2019年

作者： Maalouf, Alaa Jubran, Ibrahim Feldman, Dan The Robotics and Big Data Lab Department of Computer Science University of Haifa Haifa Israel

Least-mean squares (LMS) solvers such as Linear / Ridge / Lasso-Regression, SVD and Elastic-Net not only solve fundamental machine learning problems, but are also the building blocks in a variety of other methods, such as decision trees and matrix factorizations. We suggest an algorithm that gets a finite set of n d-dimensional real vectors and returns a weighted subset of d + 1 vectors whose sum is exactly the same. The proof in Caratheodory's Theorem (1907) computes such a subset in O(n2d2) time and thus not used in practice. Our algorithm computes this subset in O(nd) time, using O(log n) calls to Caratheodory's construction on small but "smart" subsets. This is based on a novel paradigm of fusion between different data summarization techniques, known as sketches and coresets. As an example application, we show how it can be used to boost the performance of existing LMS solvers, such as those in scikit-learn library, up to x100. Generalization for streaming and distributed (big) data is trivial. Extensive experimental results and complete open source code are also provided. Copyright © 2019, The Authors. All rights reserved.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：