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

arXiv 2021年

作者： Zheng, Yizhen Jin, Ming Pan, Shirui Li, Yuan-Fang Peng, Hao Li, Ming Li, Zhao Department of Data Science and AI Faculty of IT Monash University ClaytonVIC3800 Australia School of Information and Communication Technology Griffith University Australia SouthportQLD4222 Australia Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China Key Laboratory of Intelligent Education Technology Application of Zhejiang Province Zhejiang Normal University Jinhua321004 China Alibaba Group Hangzhou311100 China

Graph representation learning (GRL) is critical for graph-structured data analysis. However, most of the existing graph neural networks (GNNs) heavily rely on labeling information, which is normally expensive to obtain in the real world. Although some existing works aim to effectively learn graph representations in an unsupervised manner, they suffer from certain limitations, such as the heavy reliance on monotone contrastiveness and limited scalability. To overcome the aforementioned problems, in light of the recent advancements in graph contrastive learning, we introduce a novel self-supervised graph representation learning algorithm via Graph Contrastive Adjusted Zooming, namely G-Zoom, to learn node representations by leveraging the proposed adjusted zooming scheme. Specifically, this mechanism enables G-Zoom to explore and extract self-supervision signals from a graph from multiple scales: micro (i.e., node-level), meso (i.e., neighborhood-level), and macro (i.e., subgraph-level). Firstly, we generate two augmented views of the input graph via two different graph augmentations. Then, we establish three different contrastiveness on the above three scales progressively, from node, neighboring, to subgraph level, where we maximize the agreement between graph representations across scales. While we can extract valuable clues from a given graph on the micro and macro perspectives, the neighboring-level contrastiveness offers G-Zoom the capability of a customizable option based on our adjusted zooming scheme to manually choose an optimal viewpoint that lies between the micro and macro perspectives to better understand the graph data. Additionally, to make our model scalable to large graphs, we employ a parallel graph diffusion approach to decouple model training from the graph size. We have conducted extensive experiments on real-world datasets, and the results demonstrate that our proposed model outperforms state-of-the-art methods consistently. © 2021, CC BY.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Self-to-self transitions in open quantum systems:the origin and solutions

Self-to-self transitions in open quantum systems:the origin ...

引用

第三十九届中国控制会议

作者： Fang Gao Yaoxiong Wang Qing Gao Dewen Cao Feng Shuang College of Electrical Engineering Guangxi University Institute of Intelligent Machines Chinese Academy of Sciences School of Automation Science and Electrical Engineering Beihang University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University University Key Laboratory of Intelligent Perception and Computing of Anhui Province Anqing Normal University

The information of quantum pathways can be extracted in the framework of the Hamiltonianencoding and Observable-decoding *** closed quantum systems,only off-diagonal elements of the Hamiltonian in the Hilbert space is required to be encoded to obtain the desired *** open quantum systems,environment-related terms will appear in the diagonal elements of the Hamiltonian in the Liouville *** diagonal encodings have to be performed to differentiate different pathways,which will lead to self-to-self transitions and inconsistency of pathway amplitudes with Dyson *** this work,a well-designed transformation is proposed to avoid the counterintuitive transitions and the inconsistency,with or without control *** simulations show that the method are consistent with Dyson expansion.

关键词： Self-to-self transitions in open quantum systems:the origin and solutions origin

来源：评论

学校读者我要写书评

暂无评论

Study of Star/Galaxy Classification Based on the XGBoost Algorithm

引用

Chinese Astronomy and Astrophysics 2019年第4期43卷 539-548页

作者： Chao, Li Wen-hui, Zhang Ji-ming, Lin College of Information and Communication Engineering Guilin University of Electronic Technology Guilin 541004 Key Laboratory of Cognitive Radio and Information Processing the Ministry of Education Guilin University of Electronic Technology Guilin 541004 Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guilin 541004 Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems Guilin University of Electronic Technology Guilin 541004

Machine learning has achieved great success in many areas today. The lifting algorithm has a strong ability to adapt to various scenarios with a high accuracy, and has played a great role in many fields. But in astronomy, the application of lifting algorithms is still rare. In response to the low classification accuracy of the dark star/galaxy source set in the Sloan Digital Sky Survey (SDSS), a new research result of machine learning, eXtreme Gradient Boosting (XGBoost), has been introduced. The complete photometric data set is obtained from the SDSS-DR7, and divided into a bright source set and a dark source set according to the star magnitude. Firstly, the ten-fold cross-validation method is used for the bright source set and the dark source set respectively, and the XGBoost algorithm is used to establish the star/galaxy classification model. Then, the grid search and other methods are used to adjust the XGBoost parameters. Finally, based on the galaxy classification accuracy and other indicators, the classification results are analyzed, by comparing with the models of function tree (FT), Adaptive boosting (Adaboost), Random Forest (RF), Gradient Boosting Decision Tree (GBDT), Stacked Denoising AutoEncoders (SDAE), and Deep Belief Nets (DBN). The experimental results show that, the XGBoost improves the classification accuracy of galaxies in the dark source classification by nearly 10% as compared to the function tree algorithm, and improves the classification accuracy of sources with the darkest magnitudes in the dark source set by nearly 5% as compared to the function tree algorithm. Compared with other traditional machine learning algorithms and deep neural networks, the XGBoost also has different degrees of improvement. © 2019

关键词： Stars: fundamental parameters—galaxies: fundamental parameters—techniques: photometric—methods: data analysis

来源：评论

学校读者我要写书评

暂无评论

Private STaaS with OpenStack Cinder Volumes for Hybrid/Multi-cloud

Private STaaS with OpenStack Cinder Volumes for Hybrid/Multi...

引用

International Conference on Advances in computing and Communication Engineering (ICACCE)

作者： Sudheendra Harwalkar Dinkar Sitaram Shivangi Jadon Dhanaraj V Kidiyoor Ornella D'souza Center for Cloud Computing and Big Data PES University Bangalore India student from BMSCE working at CCBD as an intern

ISBN: (数字)9781728132501

ISBN: (纸本)9781728132518

Storage as a Service (STaaS) is in a very advanced stage and 80-90% of the users trust and use public cloud storage. However, enterprises and communities are still skeptical and are concerned with data safety and theft, and are investing to build their own private storage system, where cost of storage space is not the most important concern. This limits resource (compute and network) scale at the peak on demand in hybrid/multi-cloud environment as one cannot keep buying and upgrading computing hardware resources to support peak workloads in private cloud [9]. There are commercial solutions offered by few public cloud service providers/brokers to maintain the data in a private cloud in a hybrid environment, but this may have vendor/broker lock-in and portability/migration issues. In this paper, we explore OpenStack cloud for private Storage as a Service in hybrid/multi-cloud environment and demonstrate with our framework (middleware), which is built upon OpenStack [16], an open source cloud and by leveraging existing OpenStack functionalities.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-based Revocable Certificateless Signature Scheme for IoT Device

引用

International Journal of Network Security 2021年第6期23卷 1012-1027页

作者： Chen, Yushuang Zheng, Dong Guo, Rui Zhang, Yinghui Tao, Xiaoling School of Cyberspace Security Xi’an University of Posts and Telecommunications Xi’an710121 China State Key Laboratory of Integrated Services Networks Xidian University Xi’an710071 China National Engineering Laboratory for Wireless Security Xi’an University of Posts and Telecommunications Guilin University of Electronic Technology Guilin541004 China Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guilin541004 China

With the rapid development of Internet of Things (IoT) technology, completing a transaction with intelligent devices has been an essential communication mode in our daily life. Generally, lightweight smart devices conduct transactions relying on the third-party payment platform, which takes several inherent challenges of mutual distrust, data authentication and low efficiency in the IoT environment. To mitigate these issues, in this paper, we design a paring-free revocable certificateless signature (CLS) scheme with high efficiency based on the blockchain technique. Our scheme is a viable approach to enhance the performance without bilinear parings operation in the IoT lightweight equipment. And there are two different address lists stored in the blockchain to record the secret and public transaction data, respectively. According to this method, not only can the key management of the user be implemented in an efficient solution, but also enables the public verification to be performed transparently between the two parties. Furthermore, with the help of cloud server, it generates a time key for the user to accomplish revocation with low computation cost. We also make an analysis on the security to demonstrate that our proposal is existential unforgeability against adaptive chosen message attacks (EUF-CMA) under the elliptic curve discrete logarithm (ECDL) problem. Finally, the performance comparison indicates that our protocol is better than other related schemes. © 2021. International Journal of Network Security. All Rights Reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Remote sensing of cyanobacterial blooms in inland waters: present knowledge and future challenges

引用

Science Bulletin 2019年第20期64卷 1540-1556页

作者： Kun Shi Yunlin Zhang Boqiang Qin Botian Zhou Taihu Laboratory for Lake Ecosystem Research State Key Laboratory of Lake Science and EnvironmentNanjing Institute of Geography and LimnologyChinese Academy ofSciencesNanjing210008China University of Chinese Academy of Sciences Beijing100049China Center for Excellence in Tibetan Plateau Earth Sciences Chinese Academy of SciencesBeijing100101China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing400714China

Timely monitoring, detection and quantification of cyanobacterial blooms are especially important for controlling public health risks and understanding aquatic ecosystem dynamics. Due to the advantages of simultaneous data acquisition over large geographical areas and high temporal coverage, remote sensing strongly facilitates cyanobacterial bloom monitoring in inland waters. We provide a comprehensive review regarding cyanobacterial bloom remote sensing in inland waters including cyanobacterial optical characteristics, operational remote sensing algorithms of chlorophyll, phycocyanin and cyanobacterial bloom areas, and satellite imaging applications. We conclude that there have many significant progresses in the remote sensing algorithm of cyanobacterial pigments over the past 30 years. The band ratio algorithms in the red and near-infrared(NIR) spectral regions have great potential for the remote estimation of chlorophyll a in eutrophic and hypereutrophic inland waters, and the floating algae index(FAI) is the most widely used spectral index for detecting dense cyanobacterial blooms. Landsat, MODIS(Moderate Resolution Imaging Spectroradiometer) and MERIS(MEdium Resolution Imaging Spectrometer) are the most widely used products for monitoring the spatial and temporal dynamics of cyanobacteria in inland waters due to the appropriate temporal, spatial and spectral resolutions. Future work should primarily focus on the development of universal algorithms, remote retrievals of cyanobacterial blooms in oligotrophic waters, and the algorithm applicability to mapping phycocyanin at a large spatial-temporal scale. The applications of satellite images will greatly improve our understanding of the driving mechanism of cyanobacterial blooms by combining numerical and ecosystem dynamics models.

关键词： Cyanobacterial blooms Inland waters Bio-optical properties Satellite MODIS

来源：评论

学校读者我要写书评

暂无评论

Investigating 16 Open Clusters in the Kepler/K2 - Gaia DR3 field. I. Membership, Binary, and Rotation

arXiv

引用

arXiv 2023年

作者： Long, Liu Bi, Shaolan Zhang, Jinghua Zhang, Xianfei Zhang, Liyun Ge, Zhishuai Li, Tanda Chen, Xunzhou Li, YaGuang Ye, LiFei Sun, TianCheng Zhou, JianZhao Institute for Frontiers in Astronomy and Astrophysics Beijing Normal University Beijing102206 China Department of Astronomy Beijing Normal University Beijing100875 China South-Western Institute for Astronomy Research Yunnan University Chenggong District Kunming650500 China College of Physics Guizhou University Guiyang550025 China State Key Laboratory of Public Big Data Guizhou University Guiyang550025 China Beijing Planetarium Beijing Academy of Science and Technology Beijing100044 China Research Center for Intelligent Computing Platforms Zhejiang Laboratory Hangzhou311100 China School of Physics University of Sydney NSW2006 Australia Stellar Astrophysics Centre Department of Physics and Astronomy Aarhus University Ny Munkegade 120 Aarhus CDK-8000 Denmark

Using data from the Gaia data Release 3 (Gaia DR3) and Kepler/K2, we present a catalog of 16 open clusters with ages ranging from 4 to 4000 Myr, which provides detailed information on membership, binary systems, and rotation. We assess the memberships in 5D phase space, and estimate the basic parameters of each cluster. Among the 20,160 members, there are 4,381 stars identified as binary candidates and 49 stars as blue straggler stars. The fraction of binaries vary in each cluster, and the range between 9% to 44%. We obtain the rotation periods of 5,467 members, of which 4,304 are determined in this work. To establish a benchmark for the rotation-age-color relation, we construct color-period diagrams. We find that the rotational features of binaries are similar to that of single stars, while features for binaries are more scattered in the rotation period. Moreover, the morphology of the color-period relationship is already established for Upper Scorpius at the age of 19 Myr, and some stars of varying spectral types (i.e. FG-, K-, and M-type) show different spin-down rates after the age of ∼ 110 Myr. By incorporating the effects of stalled spin-down into our analysis, we develop an empirical rotation-age-color relation, which is valid with ages between 700 - 4000 Myr and colors corresponding to a range of 0.5 BP − GRP)0 Copyright © 2023, The Authors. All rights reserved.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Unlocking the Secrets Behind Advanced Artificial Intelligence Language Models in Deidentifying Chinese-English Mixed Clinical Text: Development and Validation Study

引用

Journal of Medical Internet Research 2024年第1期26卷 e48443页

作者： Lee, You-Qian Chen, Ching-Tai Chen, Chien-Chang Lee, Chung-Hong Chen, Peitsz Wu, Chi-Shin Dai, Hong-Jie Dialogue System Technical Department Asustek Computer Inc Taipei Taiwan Intelligent System Laboratory Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Bioinformatics and Medical Engineering Asia University Taichung Taiwan Center for Precision Health Research Asia University Taichung Taiwan Electromagnetic Sensing Control and AI Computing System Laboratory Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Knowledge Discovery and Data Mining Lab Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Chemical Engineering Feng Chia University Taichung Taiwan National Center for Geriatrics and Welfare Research National Health Research Institutes Zhunan Taiwan National Institute of Cancer Research National Health Research Institutes Tainan Taiwan School of Post-Baccalaureate Medicine College of Medicine Kaohsiung Medical University Kaohsiung Taiwan Center for Big Data Research Kaohsiung Medical University Kaohsiung Taiwan

Background: The widespread use of electronic health records in the clinical and biomedical fields makes the removal of protected health information (PHI) essential to maintain privacy. However, a significant portion of information is recorded in unstructured textual forms, posing a challenge for deidentification. In multilingual countries, medical records could be written in a mixture of more than one language, referred to as code mixing. Most current clinical natural language processing techniques are designed for monolingual text, and there is a need to address the deidentification of code-mixed text. Objective: The aim of this study was to investigate the effectiveness and underlying mechanism of fine-tuned pretrained language models (PLMs) in identifying PHI in the code-mixed context. Additionally, we aimed to evaluate the potential of prompting large language models (LLMs) for recognizing PHI in a zero-shot manner. Methods: We compiled the first clinical code-mixed deidentification data set consisting of text written in Chinese and English. We explored the effectiveness of fine-tuned PLMs for recognizing PHI in code-mixed content, with a focus on whether PLMs exploit naming regularity and mention coverage to achieve superior performance, by probing the developed models’ outputs to examine their decision-making process. Furthermore, we investigated the potential of prompt-based in-context learning of LLMs for recognizing PHI in code-mixed text. Results: The developed methods were evaluated on a code-mixed deidentification corpus of 1700 discharge summaries. We observed that different PHI types had preferences in their occurrences within the different types of language-mixed sentences, and PLMs could effectively recognize PHI by exploiting the learned name regularity. However, the models may exhibit suboptimal results when regularity is weak or mentions contain unknown words that the representations cannot generate well. We also found that the availability of cod

关键词： ChatGPT code mixing deidentification electronic health record large language model pretrained language model

来源：评论

学校读者我要写书评

暂无评论

A Deep Concept-aware Model for predicting and explaining restaurant future status

A Deep Concept-aware Model for predicting and explaining res...

引用

IEEE International Conference on Web Services (ICWS)

作者： Hao Liao Xiaojie Zhang Xin Li Mingyang Zhou Alexandre Vidmer Rui Mao Guangdong Province Key Laboratory of Popular High Performance Computers College of Computer Science and Software Engineering Shenzhen University Guangdong Province Engineering Center of China-made High Performance Data Computing System Shenzhen City Key Laboratory of Service Computing and Application Shenzhen China Institute of Big Data Intelligent Management and Decision Shenzhen University Shenzhen China

ISBN: (数字)9781728187860

ISBN: (纸本)9781728187877

Nowadays, with the development of web services, the survival of online service has captured public attention significantly. Future prediction of business is crucial to the shopkeepers. Predicting how the business will develop and explaining what key factors are leading to it are two most important tasks. Existing literatures usually tackle only one of these two tasks, ignoring that they are two closely related tasks and complement each other. In this paper, we propose a review-based neural model, named Deep Concept-aware Model (DCA), to predict restaurants' future status and provide explainable sentences simultaneously in an end2end framework. Specifically, we use co-attention to select concepts and implement prediction and explanation tasks through Factorization Machine and Gated Recurrent Unit, respectively. We conduct extensive experiments on three Chinese cities' datasets. The proposed joint model outperforms the state-of-the-art baseline methods for both prediction (average 40.96% improvement in AUC) and explanation (average 9.72% improvement in BLEU and 86.05% in Precision metric of ROUGE).

关键词： Web services Urban areas Predictive models Prediction algorithms data models Task analysis Business

来源：评论

学校读者我要写书评

暂无评论

Convergence Analysis of an SLF-NMU Algorithm for Non-negative Latent Factor Analysis on a High-Dimensional and Sparse Matrix

Convergence Analysis of an SLF-NMU Algorithm for Non-negativ...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Zhigang Liu Xin Luo Chongqing Engineering Research Center of Big Data Application for Smart Cities and Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China

Non-negative latent factor (NLF) models have been frequently applied to information extraction, pattern recognition, and community detection. An NLF model can well represent a high-dimensional and sparse (HiDS) matrix of non-negative data and efficiently acquire useful knowledge from it. A single latent factor-dependent, non-negative and multiplicative update (SLF-NMU) algorithm is highly efficient to build NLF model. However, its convergence ability on such a matrix is still unveiled in theory. This paper presents the convergence property of an SLF-NMU algorithm. We theoretically prove that it can guarantee its convergence to a Karush-Kuhn-Tucher (KKT) stationary point. Empirical studies on two HiDS matrices from practical applications indicate that an SLF-NMU algorithm make an NLF model to converge at a relatively steady state.

关键词： Sparse matrices Convergence Computational modeling Analytical models Linear programming data models Technological innovation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：