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

Research on feature mining algorithm and disease diagnosis of pulse signal based on piezoelectric sensor

Informatics in Medicine Unlocked 2021年 26卷

作者： Lin, Fan Zhang, Jincheng Wang, Zhongmin Zhang, Xiaokang Yao, Ruiling Li, Yan School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an 710121 Shaanxi China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications Xi'an 710121 Shaanxi China

The human pulse contains various information reflecting the internal environment of the human body. However, the classical method of pulse diagnosis in traditional Chinese medicine (TCM) has the disadvantages of relying too much on the doctor's experience and the diagnosis result is too subjective. Based on the principle of TCM pulse diagnosis, the use of photoelectric sensors to collect the pulse signals of multiple healthy people and patients with chronic diseases, and organize the detailed pulse information into a data set and analyze it with algorithms, is a solution to overcome this problem through modern technology. However, this method is still difficult to understand the patient's physiological condition in detail, and it is also difficult to explain the internal connection between abnormal pulse conditions and their physiological conditions. In the experiment, after denoising, smoothing, and eliminating the baseline drift of the subjects' pulse data, we designed two algorithms to describe the difference between the two-dimensional images of the pulse data of normal people and patients with chronic diseases. The specific feature values obtained are converted into a multi-dimensional array and trained in a support vector machine (SVM) classifier. The classification accuracy is higher than the basic temporal features. Experimental results show that it is feasible to use specific feature mining algorithms for disease detection. Through analysis, this paper found the pathological characteristics reflected in the two-dimensional pulse image, discovered the internal connection between the pulse waveform characteristics of the human body and the disease, and tried to describe it through algorithms, trying to establish a method for detecting specific diseases using photoelectric signals. © 2021 The Authors

关键词： Pathological feature mining Physiological signal feature Pulse diagnosis Pulse wave analysis

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Multi-sensor data Consistency Algorithm Based on Node Credibility 15th

An Adaptive Multi-sensor Data Consistency Algorithm Based on...

引用

15th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2019, co-located with the 5th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2019

作者： Chen, Yanping Ma, Xiao Xia, Hong Wang, Zhongmin Yv, Zhong School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an University of Posts and Telecommunications Xi’an710121 China School of Communication and Information Engineering Xi’an University of Posts and Telecommunications Xi’an710121 China

ISBN: (纸本)9783030325909

By using the principle of sensor data consistency and combining the kalman filter algorithm with the bayesian algorithm, the accuracy of the algorithm is significantly improved under the condition of large data volume and complex system. An adaptive multi-sensor data consistency algorithm based on node credibility proposes the internal correlation between the sensor credibility and the data values it provides, and the final data fusion results are obtained by fusion of the optimized data through the sensor credibility. The advantages of this algorithm include: (1) the data is optimized by kalman filter, which reduces the influence of the data provided by the sensor with low reliability on the fusion result;(2) bayesian algorithm is adopted to calculate the correct probability of data values and the reliability of the sensor, which overcomes the inherent uncertainty of the sensor and improves the accuracy of data fusion. The results show that compared with the traditional data consistency algorithm, this algorithm can further improve the accuracy of fusion results and reduce the position error. © 2020, Springer Nature Switzerland AG.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Research on Web Service Clustering Method Based on Word Embedding and Topic Model 15th

Research on Web Service Clustering Method Based on Word Embe...

引用

作者： Chen, Yanping Wang, Xin Xia, Hong Wang, Zhongmin Yv, Zhong School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an University of Posts and Telecommunications Xi’an710121 China School of Communication and Information Engineering Xi’an University of Posts and Telecommunications Xi’an710121 China

ISBN: (纸本)9783030325909

Because of the short length of documents describing Web services on the Internet, the traditional modeling method is not ideal, which affects the clustering effect of Web services. To this end, we propose a word-embedded topic model, which can effectively solve the problem of data sparsity. A method based on embedded words and topic models. Firstly, Wikipedia is used as an external corpus to extend API service document, and LF-LDA model is used to model its topic distribution. The corpus data is extracted from Wikipedia by wikiextractor, and the corpus is trained with Word2vec tool. The data comes from its word vector model. Use the trained Wikipedia Word Vector Model to extend API service description documents. In the extended API service documents, LF-LDA topic modeling technology is used to mine the implicit topic information and determine the optimal number of topics, so as to accurately measure the semantic similarity between API service documents. Finally, K-means algorithm is used to cluster Web services, and the validity of this method is verified by the real data of API services on the basis of programmability. The experimental results show that this method has better accuracy, recall rate and F value than the traditional Web service clustering method based on topic model algorithm. © 2020, Springer Nature Switzerland AG.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Ranking enhanced dialogue generation

arXiv

引用

arXiv 2020年

作者： Hao, Changying Pang, Liang Lan, Yanyan Sun, Fei Guo, Jiafeng Cheng, Xueqi CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Alibaba Group Beijing China

How to effectively utilize the dialogue history is a crucial problem in multi-turn dialogue generation. Previous works usually employ various neural network architectures (e.g., recurrent neural networks, attention mechanisms, and hierarchical structures) to model the history. However, a recent empirical study by Sankar et al. has shown that these architectures lack the ability of understanding and modeling the dynamics of the dialogue history. For example, the widely used architectures are insensitive to perturbations of the dialogue history, such as words shuffling, utterances missing, and utterances reordering. To tackle this problem, we propose a Ranking Enhanced Dialogue generation framework in this paper. Despite the traditional representation encoder and response generation modules, an additional ranking module is introduced to model the ranking relation between the former utterance and consecutive utterances. Specifically, the former utterance and consecutive utterances are treated as query and corresponding documents, and both local and global ranking losses are designed in the learning process. In this way, the dynamics in the dialogue history can be explicitly captured. To evaluate our proposed models, we conduct extensive experiments on three public datasets, i.e., bAbI, PersonaChat, and JDC. Experimental results show that our models produce better responses in terms of both quantitative measures and human judgments, as compared with the state-of-the-art dialogue generation models. Furthermore, we give some detailed experimental analysis to show where and how the improvements come from. Copyright © 2020, The Authors. All rights reserved.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

SSM-DTA: Breaking the Barriers of data Scarcity in Drug-Target Affinity Prediction

arXiv

引用

arXiv 2022年

作者： Pei, Qizhi Wu, Lijun Zhu, Jinhua Xia, Yingce Xie, Shufang Qin, Tao Liu, Haiguang Liu, Tie-Yan Yan, Rui Gaoling School of Artificial Intelligence Renmin University of China No.59 Zhong Guan Cun Avenue Haidian District Beijing100872 China Microsoft Research AI4Science No.5 Dan Ling Street Haidian District Beijing100080 China CAS Key Laboratory of GIPAS EEIS Department University of Science and Technology of China No.96 JinZhai Road Baohe District Anhui Province Hefei230026 China Engineering Research Center of Next-Generation Intelligent Search and Recommendation Ministry of Education China Beijing Key Laboratory of Big Data Management and Analysis Methods China

Accurate prediction of Drug-Target Affinity (DTA) is of vital importance in early-stage drug discovery, facilitating the identification of drugs that can effectively interact with specific targets and regulate their activities. While wet experiments remain the most reliable method, they are time-consuming and resource-intensive, resulting in limited data availability that poses challenges for deep learning approaches. Existing methods have primarily focused on developing techniques based on the available DTA data, without adequately addressing the data scarcity issue. To overcome this challenge, we present the SSM-DTA framework, which incorporates three simple yet highly effective strategies: (1) A multi-task training approach that combines DTA prediction with masked language modeling (MLM) using paired drug-target data. (2) A semi-supervised training method that leverages large-scale unpaired molecules and proteins to enhance drug and target representations. This approach differs from previous methods that only employed molecules or proteins in pre-training. (3) The integration of a lightweight cross-attention module to improve the interaction between drugs and targets, further enhancing prediction accuracy. Through extensive experiments on benchmark datasets such as BindingDB, DAVIS, and KIBA, we demonstrate the superior performance of our framework. Additionally, we conduct case studies on specific drug-target binding activities, virtual screening experiments, drug feature visualizations, and real-world applications, all of which showcase the significant potential of our work. In conclusion, our proposed SSM-DTA framework addresses the data limitation challenge in DTA prediction and yields promising results, paving the way for more efficient and accurate drug discovery processes. Our code is available at https://***/QizhiPei/SSM-DTA. Copyright © 2022, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

FAST Observations of Four Comets to Search for the Molecular Line Emissions between 1.0 and 1.5 GHz Frequencies

arXiv

引用

arXiv 2024年

作者： Chen, Long-Fei Tsai, Chao-Wei Li, Jian-Yang Yang, Bin Li, Di Duan, Yan Hsia, Chih-Hao Pan, Zhichen Qian, Lei Quan, Donghui Jiang, Xue-Jian Li, Xiaohu Zhao, Ruining Zuo, Pei School of Physics and Electronic Science Guizhou Normal University Guiyang550025 China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guiyang550025 China Research Center for Astronomical Computing Zhejiang Laboratory Hangzhou311100 China National Astronomical Observatories Chinese Academy of Sciences Beijing100101 China Institute for Frontiers in Astronomy and Astrophysics Beijing Normal University Beijing102206 China Key Laboratory of Radio Astronomy and Technology Chinese Academy of Sciences A20 Datun Road Chaoyang District Beijing100101 China School of Atmospheric Sciences Sun Yat-sen University Guangdong Zhuhai China Núcleo de Astronomía Facultad de Ingenieríay Ciencias Universidad Diego Portales Chile Department of Astronomy College of Physics and Electronic Engineering Qilu Normal University 2 Wenbo Road Zhangqiu District Jinan250200 China Department of Electronic and Optical Engineering Space Engineering University Beijing China Laboratory for Space Research Faculty of Science The University of Hong Kong Hong Kong Xinjiang Astronomical Observatory Chinese Academy of Sciences No. 150 Science 1-Street Urumqi830011 China CAS Key Laboratory of Optical Astronomy National Astronomical Observatories Chinese Academy of Sciences Beijing100101 China School of Astronomy and Space Sciences University of Chinese Academy of Sciences Beijing100049 China

We used the Five-hundred-meter Aperture Spherical radio Telescope (FAST) to search for the molecular emissions in the L-band between 1.0 and 1.5 GHz toward four comets, C/2020 F3 (NEOWISE), C/2020 R4 (ATLAS), C/2021 A1 (Leonard), and 67P/Churyumov-Gerasimenko during or after their perihelion passages. Thousands of molecular transition lines fall in this low-frequency range, many attributed to complex organic or prebiotic molecules. We conducted a blind search for the possible molecular lines in this frequency range in those comets and could not identify clear signals of molecular emissions in the data. Although several molecules have been detected at high frequencies of great than 100 GHz in comets, our results confirm that it is challenging to detect molecular transitions in the L-band frequency ranges. The non-detection of L-band molecular lines in the cometary environment could rule out the possibility of unusually strong lines, which could be caused by the masers or non-LTE effects. Although the line strengths are predicted to be weak, for FAST, using the ultra-wide bandwidth receiver and improving the radio frequency interference environments would enhance the detectability of those molecular transitions at low frequencies in the future. Copyright © 2024, The Authors. All rights reserved.

关键词： Molecules

来源：评论

学校读者我要写书评

暂无评论

Kinase-substrate Edge Biomarkers Provide a More Accurate Prognostic Prediction in ER-negative Breast Cancer

引用

Genomics, Proteomics & Bioinformatics 2020年第5期18卷 525-538页

作者： Yidi Sun Chen Li Shichao Pang Qianlan Yao Luonan Chen Yixue Li Rong Zeng CAS Key Laboratory of Systems Biology CAS Center for Excellence in Molecular Cell ScienceInstitute of Biochemistry and Cell BiologyShanghai Institutes for Biological SciencesChinese Academy of SciencesShanghai 200031China University of Chinese Academy of Sciences Shanghai 200031China Deptartment of Statistics School of Mathematical SciencesShanghai Jiao Tong UniversityShanghai 200240China School of Life Sciences and Biotechnology Shanghai Jiao Tong UniversityShanghai 200240China Department of Life Sciences ShanghaiTech UniversityShanghai 201210China CAS Center for Excellence in Animal Evolution and Genetics Chinese Academy of SciencesKunming 650223China Bio-Med Big Data Center Key Laboratory of Computational BiologyCAS-MPG Partner Institute for Computational BiologyShanghai Institute of Nutrition and HealthShanghai Institutes for Biological SciencesChinese Academy of SciencesShanghai 200031China Collaborative Innovation Center for Genetics and Development Fudan UniversityShanghai 200032China Shanghai Center for Bioinformation Technology Shanghai Academy of Science&TechnologyShanghai 201203China Center for Single-Cell Omics School of Public HealthShanghai Jiao Tong University School of MedicineShanghai 200025China

The estrogen receptor(ER)-negative breast cancer subtype is aggressive with few treatment options *** identify specific prognostic factors for ER-negative breast cancer,this study included 705,729 and 1034 breast invasive cancer patients from the Surveillance,Epidemiology,and End Results(SEER)and The Cancer Genome Atlas(TCGA)databases,*** identify key differential kinase-substrate node and edge biomarkers between ER-negative and ERpositive breast cancer patients,we adopted a network-based method using correlation coefficients between molecular pairs in the kinase regulatory *** analysis of the clinical and molecular data revealed the significant prognostic power of kinase-substrate node and edge features for both subtypes of breast *** promising kinase-substrate edge features,CSNK1A1-NFATC3 and SRC-OCLN,were identified for more accurate prognostic prediction in ERnegative breast cancer patients.

关键词： ER-negative breast cancer Edge biomarkers Kinase Substrate Prognostic prediction

来源：评论

学校读者我要写书评

暂无评论

MoCA: Incorporating multi-stage domain pretraining and cross-guided multimodal attention for Textbook Question Answering

arXiv

引用

arXiv 2021年

作者： Xu, Fangzhi Lin, Qika Liu, Jun Zhang, Lingling Zhao, Tianzhe Chai, Qi Pan, Yudai Department of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D Xi'an Jiaotong University China

Textbook Question Answering (TQA) is a complex multimodal task to infer answers given large context descriptions and abundant diagrams. Compared with Visual Question Answering(VQA), TQA contains a large number of uncommon terminologies and various diagram inputs. It brings new challenges to the representation capability of language model for domain-specific spans. And it also pushes the multimodal fusion to a more complex level. To tackle the above issues, we propose a novel model named MoCA, which incorporates multi-stage domain pretraining and multimodal cross attention for the TQA task. Firstly, we introduce a multi-stage domain pretraining module to conduct unsupervised post-pretraining with the span mask strategy and supervised pre-finetune. Especially for domain post-pretraining, we propose a heuristic generation algorithm to employ the terminology corpus. Secondly, to fully consider the rich inputs of context and diagrams, we propose cross-guided multimodal attention to update the features of text, question diagram and instructional diagram based on a progressive strategy. Further, a dual gating mechanism is adopted to improve the model ensemble. The experimental results show the superiority of our model, which outperforms the state-of-the-art methods by 2.21% and 2.43% for validation and test split respectively. Copyright © 2021, The Authors. All rights reserved.

关键词： Textbooks

来源：评论

学校读者我要写书评

暂无评论

Respiratory Sound Classification Based on BiGRU-Attention network with XGBoost

Respiratory Sound Classification Based on BiGRU-Attention Ne...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xuesong Zhao Yanbo Shao Juanyun Mai Airu Yin Sihan Xu College of Computer Science Nankai University Tianjin China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China KLMDASR Tianjin China

ISBN: (数字)9781728162157

ISBN: (纸本)9781728162164

In recent years, the mortality rate of respiratory diseases ranks high among the major diseases. Early detection of respiratory diseases is a key factor in reducing the mortality rate and curing diseases. In this paper, we propose the BiGRU Attention-XGBoost model to classify respiratory sounds, in order to assist doctors in the early diagnosis of respiratory diseases. Specifically, we first extract two sets of features, i.e., the time domain and spectral features to encode respiratory sounds. Then, we apply the Gradient Boosting Decision Tree algorithm to select important features for classification. Based on the temporal characteristics of respiratory sounds, we design the BiGRU Attention-XGBoost model to classify them. Finally, to enlarge the training dataset and address the problem of data imbalance, we also implement Griffifin-Lim and WORLD Vocoder, two data augmentation methods. Extensive experiments show the superiority of the proposed model compared to seven state-of the-art models in terms of classification accuracy and Fl-score.

关键词： Feature extraction Mathematical model Hidden Markov models Training Mel frequency cepstral coefficient Time-domain analysis Logic gates

来源：评论

学校读者我要写书评

暂无评论

UPPRESSO: Untraceable and Unlinkable Privacy-PREserving Single Sign-On Services

arXiv

引用

arXiv 2021年

作者： Guo, Chengqian Lin, Jingqiang Cai, Quanwei Wang, Wei Li, Fengjun Wang, Qiongxiao Jing, Jiwu Zhao, Bin State Key Laboratory of Information Security Institute of Information Engineering CAS China Data Assurance and Communication Security Research Center CAS China School of Cyber Security University of Science and Technology of China China School of Cyber Security University of Chinese Academy of Sciences China University of Kansas United States *** Silicon Valley R&D Center China

Single sign-on (SSO) allows a user to maintain only the credential at the identity provider (IdP), to login to numerous RPs. However, SSO introduces extra privacy threats, compared with traditional authentication mechanisms, as (a) the IdP could track all RPs which a user is visiting, and (b) collusive RPs could learn a user's online profile by linking his identities across these RPs. This paper proposes a privacy-preserving SSO system, called UPPRESSO, to protect a user's login activities against both the curious IdP and collusive RPs. We analyze the identity dilemma between the security requirements and these privacy concerns, and convert the SSO privacy problems into an identity transformation challenge. In each login instance, an ephemeral pseudo-identity (denoted as P IDRP ) of the RP, is firstly negotiated between the user and the RP. P IDRP is sent to the IdP and designated in the identity token, so the IdP is not aware of the visited RP. Meanwhile, P IDRP is used by the IdP to transform the permanent user identity IDU into an ephemeral user pseudo-identity (denoted as P IDU ) in the identity token. On receiving the identity token, the RP transforms P IDU into a permanent account (denoted as Acct) of the user, by an ephemeral trapdoor in the negotiation. Given a user, the account at each RP is unique and different from IDU, so collusive RPs cannot link his identities across these RPs. We build the UPPRESSO prototype on top of MITREid Connect, an open-source implementation of OIDC. The extensive evaluation shows that UPPRESSO fulfills the requirements of both security and privacy and introduces reasonable overheads. Copyright © 2021, The Authors. All rights reserved.

关键词： Privacy-preserving techniques

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：