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

arXiv 2022年

作者： Wang, Ye Ma, Rui Ma, Xiaoqing Cui, Honghua Xiao, Yubin Wu, Xuan Zhou, You School of Computer Science and Technology Jilin University Jilin Province Changchun130012 China School of Artificial Intelligence Jilin University Jilin Province Changchun130012 China Second Hospital of Jilin University Jilin Province Changchun130041 China Engineering Research Center of Knowledge-Driven Human-Machine Intelligence MOE Jilin Province Changchun130012 China

Fine-grained classification and counting of bone marrow erythroid cells are vital for evaluating the health status and formulating therapeutic schedules for leukemia or hematopathy. Due to the subtle visual differences between different types of erythroid cells, it is challenging to apply existing image-based deep learning models for fine-grained erythroid cell classification. Moreover, there is no large open-source datasets on erythroid cells to support the model training. In this paper, we introduce BMEC (Bone Morrow Erythroid Cells), the first large fine-grained image dataset of erythroid cells, to facilitate more deep learning research on erythroid cells. BMEC contains 5,666 images of individual erythroid cells, each of which is extracted from the bone marrow erythroid cell smears and professionally annotated to one of the four types of erythroid cells. To distinguish the erythroid cells, one key indicator is the cell shape which is closely related to the cell growth and maturation. Therefore, we design a novel shape-aware image classification network for fine-grained erythroid cell classification. The shape feature is extracted from the shape mask image and aggregated to the raw image feature with a shape attention module. With the shape-attended image feature, our network achieved superior classification performance (81.12% top-1 accuracy) on the BMEC dataset comparing to the baseline methods. Ablation studies also demonstrate the effectiveness of incorporating the shape information for the fine-grained cell classification. To further verify the generalizability of our method, we tested our network on two additional public white blood cells (WBC) datasets and the results show our shape-aware method can generally outperform recent state-of-the-art works on classifying the WBC. The code and BMEC dataset can be found on https://***/wangye8899/BMEC. Copyright © 2022, The Authors. All rights reserved.

关键词： Bone

来源：评论

学校读者我要写书评

暂无评论

Finding optimal tangent points for reducing distortions of hard-label attacks 21

Finding optimal tangent points for reducing distortions of h...

引用

Proceedings of the 35th International Conference on Neural Information Processing Systems

作者： Chen Ma Xiangyu Guo Li Chen Jun-Hai Yong Yisen Wang School of Software BNRist Tsinghua University Beijing China Department of Computer Science and Engineering University at Buffalo Buffalo NY Key Lab. of Machine Perception School of Artificial Intelligence Peking University Beijing China and Institute for Artificial Intelligence Peking University Beijing China

ISBN: (纸本)9781713845393

One major problem in black-box adversarial attacks is the high query complexity in the hard-label attack setting, where only the top-1 predicted label is available. In this paper, we propose a novel geometric-based approach called Tangent Attack (TA), which identifies an optimal tangent point of a virtual hemisphere located on the decision boundary to reduce the distortion of the attack. Assuming the decision boundary is locally flat, we theoretically prove that the minimum ℓ2 distortion can be obtained by reaching the decision boundary along the tangent line passing through such tangent point in each iteration. To improve the robustness of our method, we further propose a generalized method which replaces the hemisphere with a semi-ellipsoid to adapt to curved decision boundaries. Our approach is free of pre-training. Extensive experiments conducted on the ImageNet and CIFAR-10 datasets demonstrate that our approach can consume only a small number of queries to achieve the low-magnitude distortion.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Multi-Query Oriented Continuous Subgraph Matching

Efficient Multi-Query Oriented Continuous Subgraph Matching

引用

International Conference on Data engineering

作者： Ziyi Ma Jianye Yang Xu Zhou Guoqing Xiao Jianhua Wang Liang Yang Kenli Li Xuemin Lin School of Artificial Intelligence Hebei University of Technology China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University China Cyberspace Institute of Advanced Technology Guangzhou University China Department of New Networks PengCheng Laboratory China College of Computer Science and Electronic Engineering Hunan University China Shenzhen Research Institute Hunan University China Antai College of Economics and Management Shanghai Jiao Tong University China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Continuous subgraph matching (CSM) is a critical task for analyzing dynamic graphs and has a wide range of applications, such as merchant fraud detection, cyber-attack hunting, and rumor detection. Although many efficient CSM algorithms have been recently proposed, they are mainly designed to process a single query. However, in some application scenarios, multi-query oriented continuous subgraph matching (MQCSM) may be of more interest. To our knowledge, the two existing solutions to MQCSM are outdated due to unsatisfactory performance. In this paper, we propose MQ-Match, an efficient approach to MQCSM. First, we design a compact yet effective index structure CCG, which maintains the local matching result of vertices in the data graph using a directed graph. The directed edges in CCG can be utilized as an effective pruning rule for the subsequent incremental matching algorithm when expanding a partial match. Then, we develop a computation sharing incremental matching algorithm. In specific, a set of matching trees is constructed based on the depth-first search trees of the query graphs. By utilizing CCG, we conduct subgraph matching for the matching tree to collect the incremental matches for the query graphs, where the common structures of query graphs are matched only once. Extensive experiments show that MQ-Match can achieve 3.1x-7071.4x speedup over the competitors, and consumes much less memory under the majority of the experiment settings.

关键词： Heuristic algorithms Memory management Directed graphs Data engineering Fraud Computational efficiency Indexes

来源：评论

学校读者我要写书评

暂无评论

Deep learning-based detection of incisal translucency patterns

引用

Journal of Prosthetic Dentistry 2025年

作者： Shetty, Sthithika Gali, Sivaranjani R, Venkatesh MS, Jeswin MN, Thippeswamy Postgraduate student Department of Prosthodontics and Crown & Bridge Faculty of Dental Sciences M.S. Ramaiah University of Applied Sciences Bangalore India Head Department of Prosthodontics and Crown & Bridge Faculty of Dental Sciences M.S. Ramaiah University of Applied Sciences Bangalore India Graduate student Department of Computer Science & Engineering (Artificial Intelligence & Machine Learning) Ramaiah Institute of Technology Bangalore India Principal Dr. Ambedkar Institute of Technology Bangalore India

Statement of problem: The evaluation of incisal translucency in anterior teeth greatly influences esthetic treatment outcomes. This evaluation is mostly subjective and often overlooked among dental professionals. The application of artificial intelligence-based models to detect the incisal translucency of anterior teeth may be of value to dentists in their restorative dental practice, but studies are lacking. Purpose: The purpose of this study was to assess the accuracy of deep learning models in predicting the translucency patterns of anterior teeth. Material and methods: Approximately 240 Joint Photographic Experts Group (JPEG) images of anterior teeth from participants over 18 years were collected using a smartphone. These images were resized to 224×224 pixels and classified by the presence or absence of translucency. Augmentation techniques enhanced the training dataset, and a 3-model deep learning approach was used: YOLOv5 detected central incisors, Vision Transformers (ViT) identified translucency, and U-Net segmented the translucent areas. The images were split 80 to 20 for training and testing, with performance evaluated using accuracy, precision, recall, F1 score, confusion matrix, and dice scores. Results: YOLOv5 achieved a precision of 1.00 at a confidence threshold of 0.910. The ViT system showed an accuracy of 91.66%, with 58 of 64 images predicting correctly with an F1 score of 94.83%. U-Net segmentation after training with annotated images achieved an accuracy of 91% with a dice score of 0.948. Conclusions: The integration of YOLOv5 for detection, ViT for classification, and U-Net for segmentation demonstrates a comprehensive approach to addressing the classification of incisal translucencies. By leveraging the strengths of deep learning models, high accuracy and precision can be achieved in detecting the incisal translucency patterns of anterior teeth. © 2025 Editorial Council for The Journal of Prosthetic Dentistry

关键词：

来源：评论

学校读者我要写书评

暂无评论

Even order contributions to relative energies vanish for antisymmetric perturbations

arXiv

引用

arXiv 2023年

作者： von Lilienfeld, O. Anatole Domenichini, Giorgio Vector Institute for Artificial Intelligence TorontoONM5S 1M1 Canada Departments of Chemistry Materials Science and Engineering and Physics University of Toronto St. George Campus TorontoON Canada Machine Learning Group Technische Universität Berlin Institute for the Foundations of Learning and Data Berlin10587 Germany University of Vienna Faculty of Physics Kolingasse 14-16 ViennaAT-1090 Austria University of Vienna Vienna Doctoral School in Physics Boltzmanngasse 5 ViennaAT-1090 Austria

We show that even order contributions to energy differences between any two iso-electronic compounds vanish when using perturbation theory around an averaged electronic reference Hamiltonian. This finding generalizes the previously introduced alchemical chirality concept [von Rudorff, von Lilienfeld, Science Advances, 7 2021] by lifting the symmetry requirements for transmutating atoms in the iso-electronic reference system. The leading order term corresponds to twice the Hellmann-Feynman derivative evaluated using the electron density of the averaged Hamiltonian. Analogous analysis reveals Mel Levy's formula for relative energies [J. Chem. Phys. 70, 1573 (1979)] to include the first order contribution while overestimating the higher odd order energy contributions by a factor linearly increasing in order. Using density functional theory, we illustrate the predictive power of the leading order term for estimating relative energies among diatomics in the charge-neutral iso-electronic 14 proton series N2, CO, BF, BeNe, LiNa, HeMg, HAl, and the united atom, Si. The framework's potential for the simultaneous exploration of multiple dimensions in chemical space is demonstrated for toluene by evaluating relative energies between all the possible 35 antisymmetric BN doped isomers (dubbed "alchemical diastereomers"). Based solely on toluene's electron density, necessary to evaluate all the respective Hellmann-Feynman derivatives, mean absolute errors of predicted total potential energy differences between the alchemical diastereomers are on the scale of mHa. © 2023, CC0.

关键词： Carrier concentration

来源：评论

学校读者我要写书评

暂无评论

Joint Parking and Power Management for Electric Vehicle Edge Computing: A Bilevel Optimization Approach

Joint Parking and Power Management for Electric Vehicle Edge...

引用

International Wireless Communications and Mobile Computing Conference, IWCMC

作者： Xumin Huang Weifeng Zhong Jiangtian Nie Jiawen Kang Zehui Xiong Yuan Wu Mohsen Guizani School of Automation Guangdong University of Technology Guangzhou China State Key Laboratory of Internet of Things for Smart City University of Macau Macau China School of Computer Science and Engineering Nanyang Technological University Singapore Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Department of Computer and Information Science University of Macau Macau China Machine Learning Department Mohamed Bin Zayed University of Artificial Intelligence Abu Dhabi UAE

With the vehicle-to-grid and computing capabilities, a parked electric vehicle (EV) has a dual role, namely being an energy prosumer as well as a computing node for accommodating computation-offloading services. This dual-role feature of EVs yields a new computing paradigm named Electric Vehicle Edge Computing (EVEC). To ease the implementation of EVEC, we propose a fine-grained EV management approach to jointly provide parking guidance for EVs and control their charging/discharging power in parking lots. We formulate a bilevel optimization problem where the top-level problem optimizes the matching between EVs and parking lots from the perspective of computation offloading, and the bottom-level problem optimizes the control of EV charging/discharging power from the view of power networks. We transform the bilevel optimization problem into a single-level form, which is a nonconvex mixed-integer nonlinear programming problem, and we further tackle it by linearization techniques. Finally, we provide numerical results to demonstrate the efficiency and effectiveness of our approach.

关键词： Wireless communication Vehicle-to-grid Systematics Power system management Computational modeling Transforms Relaxation methods

来源：评论

学校读者我要写书评

暂无评论

Age Detection based on Facial Features Using Support Vector machine

Age Detection based on Facial Features Using Support Vector ...

引用

Knowledge engineering and Communication Systems (ICKECS), International Conference on

作者： Jayaprada S. Hiremath Shantala S. Hiremath Sujith Kumar Elukoti Hebbare Shantakumar B. Patil Mrutyunjaya S. Hiremath Computer Science and Engineering Research Scholar at VTU Belgaum India Specialist in Image Processing Tata Elxsi Limited Bangalore India Principal Engineer (Artificial intelligence / Machine learning) VVDN Technologies Pvt. Ltd. Bangalore India Department of Image Processing eMath Technology Pvt. Ltd. Bangalore India Computer Science and Engineering Sai Vidya Institute of Technology Bengaluru India

Face aging has been studied for decades. Determining age from a facial shot is key to our technique for diagnosing abnormal behavior. Security monitoring, forensics, biometrics, and Human-computer Interface (HCI) use facial age estimates. We only look at adults 1–75 in the UTK Face database, which covers 0 to 116 years. The database contains 23,708 face photos with age, gender, and ethnicity annotations. In work, preprocessing, feature extraction, feature selection, and age categorization are involved. Preprocessing adjusts images. computer vision uses Local Binary Pattern (LBP) and Histogram of Oriented Gradient (HOG) as visual descriptors, whereas fscmrmr is utilized for classification. Support Vector machines (SVM) improve classification accuracy in highdimensional areas. The chosen characteristics are concatenated and passed to a multiclass SVM classifier to classify the images with 95.69% success.

关键词： Support vector machines Training Human computer interaction Visualization Databases Transfer learning Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Parts2Words: learning Joint Embedding of Point Clouds and Texts by Bidirectional Matching between Parts and Words

arXiv

引用

arXiv 2021年

作者： Tang, Chuan Yang, Xi Wu, Bojian Han, Zhizhong Chang, Yi School of Artificial Intelligence Jilin University China Zhejiang University China The Department of Computer Science Wayne State University United States Engineering Research Center of Knowledge-Driven Human-Machine Intelligence MoE China

Shape-Text matching is an important task of high-level shape understanding. Current methods mainly represent a 3D shape as multiple 2D rendered views, which obviously can not be understood well due to the structural ambiguity caused by self-occlusion in the limited number of views. To resolve this issue, we directly represent 3D shapes as point clouds, and propose to learn joint embedding of point clouds and texts by bidirectional matching between parts from shapes and words from texts. Specifically, we first segment the point clouds into parts, and then leverage optimal transport method to match parts and words in an optimized feature space, where each part is represented by aggregating features of all points within it and each word is abstracted by its contextual information. We optimize the feature space in order to enlarge the similarities between the paired training samples, while simultaneously maximizing the margin between the unpaired ones. Experiments demonstrate that our method achieves a significant improvement in accuracy over the SOTAs on multi-modal retrieval tasks under the Text2Shape dataset. Codes are available at here. Copyright © 2021, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

A BERT-Based Pre-Training Model for Solving Math Application Problems

A BERT-Based Pre-Training Model for Solving Math Application...

引用

Intelligent Education and Intelligent Research (IEIR), International Conference on

作者： Yuhao Jia Pingheng Wang Zhen Zhang Chi Cheng Zhifei Li Xinguo Yu Faculty of Artificial Intelligence in Education Central China Normal University Wuhan China School of Sports Engineering and Information Technology Wuhan Sports University Wuhan China School of Information Management Wuhan University Wuhan China National Engineering Research Center for E-Learning Central China Normal University Wuhan China School of Computer Science and Information Engineering Hubei University Wuhan China

ISBN: (纸本)9798350345636

Solving the math application problem is hot research in intelligence education. An increasing number of research scholars are using pre-trained models to tackle machine solution problems. Noteworthily, the semantic relationships required in the machine solution task are for describing math problems, while those of the BERT model with pre-training weights are of general significance, which will cause a mismatched word vector representation. To solve this problem, we proposed a self-supervised pre-training method based on loss priority. We use the input data from the downstream task datasets to fine-tune the existing BERT model so that the dynamic word vector it obtained can better match the downstream tasks. And the size of the loss value of each data batch in each round of training will be recorded to decide which data should be trained in the next round, so that the model has a faster convergence speed. Furthermore, considering that in large-scale mathematics application problems, some problems have almost the same forms of solution. We proposed a machine solution model training algorithm based on the analogy of the same problem type. Extensive experiments on two well-known datasets show the superiority of our proposed algorithms compared to other state-of-the-art algorithms.

关键词： Training Bit error rate Semantics Mathematical models Data models Task analysis Convergence

来源：评论

学校读者我要写书评

暂无评论

Uncertainty Quantification of the Virial Black Hole Mass with Conformal Prediction

arXiv

引用

arXiv 2023年

作者： Yong, Suk Yee Ong, Cheng Soon Australia Astrophysics and Space Technologies Research Centre Macquarie University SydneyNSW2109 Australia School of Mathematical and Physical Sciences Macquarie University SydneyNSW2109 Australia Faculty of Science and Engineering Macquarie University SydneyNSW2109 Australia Machine Learning and Artificial Intelligence Future Science Platform CSIRO Australia Data61 CSIRO CanberraACT2601 Australia School of Computing The Australian National University CanberraACT2601 Australia

Precise measurements of the black hole mass are essential to gain insight on the black hole and host galaxy co-evolution. A direct measure of the black hole mass is often restricted to nearest galaxies and instead, an indirect method using the single-epoch virial black hole mass estimation is used for objects at high redshifts. However, this method is subjected to biases and uncertainties as it is reliant on the scaling relation from a small sample of local active galactic nuclei. In this study, we propose the application of conformalised quantile regression (CQR) to quantify the uncertainties of the black hole predictions in a machine learning setting. We compare CQR with various prediction interval techniques and demonstrated that CQR can provide a more useful prediction interval indicator. In contrast to baseline approaches for prediction interval estimation, we show that the CQR method provides prediction intervals that adjust to the black hole mass and its related properties. That is it yields a tighter constraint on the prediction interval (hence more certain) for a larger black hole mass, and accordingly, bright and broad spectral line width source. Using a combination of neural network model and CQR framework, the recovered virial black hole mass predictions and uncertainties are comparable to those measured from the Sloan Digital Sky Survey. The code is publicly available at https://***/yongsukyee/uncertain_blackholemass. Copyright © 2023, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：