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

arXiv 2023年

作者： Ji, Qiu Zhang, Xiaoping Ye, Yuxin Qi, Guilin Li, Jiaye Li, Site Ren, Jianjie Lu, Songtao School of Modern Posts Institute of Modern Posts Nanjing University of Posts and Telecommunications Nanjing China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China National Data Center ofTraditional Chinese MedicineChina Academy of ChineseMedical Sciences Beijing100700 China College of Computer Science and Technology Jilin University Changchun130012 China School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing China School of Mathematics Southeast University Nanjing China Chien-Shiung Wu College Southeast University Nanjing China

Ontology revision aims to seamlessly incorporate a new ontology into an existing ontology and plays a crucial role in tasks such as ontology evolution, ontology maintenance, and ontology alignment. Similar to repair single ontologies, resolving logical incoherence in the task of ontology revision is also important and meaningful, because incoherence is a main potential factor to cause inconsistency and reasoning with an inconsistent ontology will obtain meaningless answers. To deal with this problem, various ontology revision approaches have been proposed to define revision operators and design ranking strategies for axioms in an ontology. However, they rarely consider axiom semantics which provides important information to differentiate axioms. In addition, pre-trained models can be utilized to encode axiom semantics, and have been widely applied in many natural language processing tasks and ontology-related ones in recent years. Therefore, in this paper, we study how to apply pre-trained models to revise ontologies. We first define four scoring functions to rank axioms based on a pre-trained model by considering various information from an ontology. Based on the functions, an ontology revision algorithm is then proposed to deal with unsatisfiable concepts at once. To improve efficiency, an adapted revision algorithm is designed to deal with unsatisfiable concepts group by group. We conduct experiments over 19 ontology pairs and compare our algorithms and scoring functions with existing ones. According to the experiments, our algorithms could achieve promising performance. The adapted revision algorithm could improve the efficiency largely, and at most about 90% of the time could be saved for some ontology pairs. Some of our scoring functions like reliableOnt cos could help a revision algorithm obtain better results in many cases, especially for those challenging ontology pairs like OM8. We also provide discussion about the overall experimental results and guidelin

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Deleterious Non-Synonymous Single Nucleotide Polymorphism Predictions on Human Transcription Factors

引用

IEEE/ACM Transactions on Computational Biology and Bioinformatics 2020年第1期17卷 327-333页

作者： Wong, Ka-Chun Yan, Shankai Lin, Qiuzhen Li, Xiangtao Peng, Chengbin Department of Computer Science City University of Hong Kong Kowloon Tong Hong Kong College of Computer Science and Software Engineering Shenzhen University Shenzhen Guangdong518060 China Department of Computer Science and Information Technology Northeast Normal University Changchun Jilin130117 China Ningbo Institute of Industrial Technology Chinese Academy of Sciences Ningbo Zhejiang315211 China

Transcription factors (TFs) are the major components of human gene regulation. In particular, they bind onto specific DNA sequences and regulate neighborhood genes in different tissues at different developmental stages. Non-synonymous single nucleotide polymorphisms on its protein-coding sequences could result in undesired consequences in human. Therefore, it is necessary to develop methods for predicting any abnormality among those non-synonymous single nucleotide polymorphisms. To address it, we have developed and compared different strategies to predict deleterious non-synonymous single nucleotide polymorphisms (also known as missense mutations) on the protein-coding sequences of human TFs. Taking advantage of evolutionary conservation signals, we have developed and compared different classifiers with different feature sets as computed from different evolutionarily related sequence collections. The results indicate that the classic ensemble algorithm, Adaboost with decision stumps, with orthologous sequence collection, has performed the best (namely, TFmedic). We have further compared TFmedic with other state-of-the-arts methods (i.e., PolyPhen-2 and SIFT) on PolyPhen-2's own datasets, demonstrating that TFmedic can outperform the others. As applications, we have further applied TFmedic to all possible missense mutations on all human transcription factors;the proteome-wide results reveal interesting insights, consistent with the existing physiochemical knowledge. A case study with the actual 3D structure is conducted, revealing how TFmedic can be contributed to protein-DNA binding complex studies. © 2004-2012 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Contrastive Fusion of Generative and Discriminative Lesion Maps for Weakly Supervised Medical Image Segmentation

SSRN

引用

SSRN 2023年

作者： Du, Wei Huo, Yongkang Tang, Shiyi Chen, Liang Li, Ying Li, Gaoyang Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China College of Engineering Shantou University Shantou515063 China Translational Medical Center for Stem Cell Therapy Institute for Regenerative Medicine Shanghai East Hospital Bioinformatics Department School of Life Sciences and Technology Tongji University Shanghai200092 China

Medical image segmentation is a crucial computer-aided diagnosis (CAD) procedure in various clinical applications. However, most existing methods rely on pixel-level annotations, which are costly and time-consuming. We propose a novel contrastive fusion model of generative and discriminative lesion maps for weakly supervised medical image segmentation to address this limitation. The generative lesion map is generated by a lesion region-guided cycle-consistent adversarial network (CCANet), and the discriminative lesion map is produced by a class-aware-based discriminative lesion localization network (DLLNet). CCANet and DLLNet share weights at the encoder layer, which contains skip connections and channel attention modules to enhance feature embedding. In order to fully utilize and integrate the generative and discriminative lesion maps, and improve the segmentation accuracy, we design a fusion method based on contrastive loss to jointly train CCANet and DLLNet. The final lesion segmentation result is obtained by applying dense conditional random fields (Dense CRF) to the fused lesion map. Extensive experiments on three benchmark medical image datasets show that our model outperforms the state-of-the-art methods on weakly supervised medical image segmentation, especially in datasets with few samples, validating the proposed model's good generalization ability and robustness in various medical image segmentation scenarios. The source code and experiment datasets are available on GitHub: https://***/mlcb-jlu/GDC4MedSeg. © 2023, The Authors. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Improving Generalization of Neural Vehicle Routing Problem Solvers Through the Lens of Model architecture

arXiv

引用

arXiv 2024年

作者： Xiao, Yubin Wang, Di Wu, Xuan Wu, Yuesong Li, Boyang Du, Wei Wang, Liupu Zhou, You Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639956 Singapore WeBank-NTU Joint Research Institute on Fintech Nanyang Technological University 639956 Singapore College of Computing and Data Science Nanyang Technological University 639956 Singapore

Neural models produce promising results when solving Vehicle Routing Problems (VRPs), but may often fall short in generalization. Recent attempts to enhance model generalization often incur unnecessarily large training cost or cannot be directly applied to other models solving different VRP variants. To address these issues, we take a novel perspective on model architecture in this study. Specifically, we propose a plug-and-play Entropy-based Scaling Factor (ESF) and a Distribution-Specific (DS) decoder to enhance the size and distribution generalization, respectively. ESF adjusts the attention weight pattern of the model towards familiar ones discovered during training when solving VRPs of varying sizes. The DS decoder explicitly models VRPs of multiple training distribution patterns through multiple auxiliary light decoders, expanding the model representation space to encompass a broader range of distributional scenarios. We conduct extensive experiments on both synthetic and widely recognized real-world benchmarking datasets and compare the performance with seven baseline models. The results demonstrate the effectiveness of using ESF and DS decoder to obtain a more generalizable model and showcase their applicability to solve different VRP variants, i.e., travelling salesman problem and capacitated VRP. Notably, our proposed generic components require minimal computational resources, and can be effortlessly integrated into conventional generalization strategies to further elevate model generalization. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

The Spatiotemporal Traffic Accident Risk Analysis in Urban Traffic Network 9th

The Spatiotemporal Traffic Accident Risk Analysis in Urban T...

引用

9th International Conference on Mobile Wireless Middleware, Operating Systems and Applications, MOBILWARE 2020

作者： Zhang, Chijun jin, Jing Huang, Qiuyang Du, Zhanwei Yuan, Zhilu Tang, Shengjun Liu, Yang School of Management Science and Information Engineering Jilin University of Finance and Economics Changchun130117 China Jilin Province Key Laboratory of Fintech Jilin University of Finance and Economics Changchun130117 China College of Computer Science and Technology Jilin University Changchun130012 China Research Institute for Smart Cities and Shenzhen Key Laboratory of Spatial Information Smart Sensing and Services School of Architecture and Urban Planning Shenzhen University Shenzhen China Jilin Big Data Research Center for Business Jilin University of Finance and Economics Changchun130117 China

ISBN: (纸本)9783030622046

Traffic accidents seriously threaten people’s lives and property all over the world. Therefore, it is of great significance to human society to have a long-term traffic accidents data with detail temporal and geographic information in a specific space, which can be used for traffic accident hotspots identification to reduce the incidence of traffic accidents. Here, we obtain a one-year dataset of traffic accidents of the city center in changchun, Northeast China, in 2017. In this paper, we analyze the risk of traffic accident in urban area, and then discover the characteristics of traffic accidents at the temporal and spatial aspect. We construct a traffic network, which takes crossings as nodes and road sections as edges and weighted by the total number of traffic accidents. In addition, we integrate road structure data and meteorological data to explore the characteristics of the traffic network. © 2020, ICST institute for computer sciences, Social Informatics and Telecommunications engineering.

关键词： Risk analysis

来源：评论

学校读者我要写书评

暂无评论

Mid-Infrared Chalcogenide Slot Waveguide Plasmonic Resonator Sensor Embedded with AU Nanorods for Surface-Enhanced Infrared Absorption Spectroscopy

SSRN

引用

SSRN 2022年

作者： Zheng, Chuantao Pi, Mingquan Min, Yuting Zhao, Huan Peng, Zihang Ji, Jialin Huang, Yijun Song, Fang Liang, Lei Zhang, Yu Wang, Yiding Tittel, Frank K. State Key Laboratory of Integrated Optoelectronics College of Electronic Science and Engineering Jilin University 2699 Qianjin Street Changchun130012 China State Key Laboratory of Luminescence and Applications Changchun Institute of Optics Fine Mechanics and Physics Chinese Academy of Sciences Changchun130033 China Department of Electrical and Computer Engineering Rice University 6100 Main Street HoustonTX77005 United States

The problem of a traditional waveguide plasmonic resonator sensor is that part of the near-field intensity enhanced area is confined in the waveguide dielectric layer, which decreases the interaction effect between light and analyte. In order to solve this problem, a novel mid-infrared (MIR) chalcogenide (ChG) slot waveguide plasmonic resonator (SWGPR) sensor embedded with Au nanorods was proposed, where Au nanorods were used as antenna for enhancing mode coupling with the waveguide through resonance at the absorption wavelength of the analyte. The antenna parameters were optimized to make the resonance wavelength align with the absorption wavelength of the analyte. The proposed waveguide structure provides a sufficient sensing area and increases the electric field enhancement factor to > 6400. Polymethyl methacrylate (PMMA) and styrene were adopted as the analyte for sensing performance evaluation. The normalized absorption reaches 23.31 when the maximum extinction coefficient of PMMA is 0.08, which is at least 7 times higher than other silicon-on-insulator (SOI) waveguide plasmonic resonator sensors. The proposed waveguide structure provides a new idea for the design of other waveguide plasmonic resonator sensors with high sensing performance and has the potential for biochemical sensing. © 2022, The Authors. All rights reserved.

关键词： Nanorods

来源：评论

学校读者我要写书评

暂无评论

Simulation and Field Testing of Multiple Vehicles Collision Avoidance Algorithms

引用

IEEE/CAA Journal of Automatica Sinica 2020年第4期7卷 1045-1063页

作者： Chaoyue Zu Chao Yang Jian Wang Wenbin Gao Dongpu Cao Fei-Yue Wang the College of Computer Science and Technology Jilin UniversityChangchun 130012China Jiangsu XCMG Construction Machinery Research Institute Ltd. Xuzhou 221004China the College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of EducationJilin UniversityChangchun 130012 Chongqing Xibu Automobile Proving Ground Management Co.Ltd. Chongqing 404100China the State Grid JIBEI Electric Power Company Limited Management Training Center China the Advanced Vehicle Engineering Center Cranfield UniversityCranfield MK430ALUK the State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190China

A global planning algorithm for intelligent vehicles is designed based on the A* algorithm, which provides intelligent vehicles with a global path towards their destinations. A distributed real-time multiple vehicle collision avoidance(MVCA)algorithm is proposed by extending the reciprocal n-body collision avoidance method. MVCA enables the intelligent vehicles to choose their destinations and control inputs independently,without needing to negotiate with each other or with the coordinator. Compared to the centralized trajectory-planning algorithm, MVCA reduces computation costs and greatly improves the robustness of the system. Because the destination of each intelligent vehicle can be regarded as private, which can be protected by MVCA, at the same time MVCA can provide a real-time trajectory planning for intelligent vehicles. Therefore,MVCA can better improve the safety of intelligent vehicles. The simulation was conducted in MATLAB, including crossroads scene simulation and circular exchange position simulation. The results show that MVCA behaves safely and reliably. The effects of latency and packet loss on MVCA are also statistically investigated through theoretically formulating broadcasting process based on one-dimensional Markov chain. The results uncover that the tolerant delay should not exceed the half of deciding cycle of trajectory planning, and shortening the sending interval could alleviate the negative effects caused by the packet loss to an extent. The cases of short delay(< 100100 ms) and low packet loss(< 5%) can bring little influence to those trajectory planning algorithms that only depend on V2 V to sense the context, but the unpredictable collision may occur if the delay and packet loss are further worsened. The MVCA was also tested by a real intelligent vehicle, the test results prove the operability of MVCA.

关键词： Collision avoidance intelligent vehicles intervehicle communication simulation testing trajectory planning

来源：评论

学校读者我要写书评

暂无评论

Lightweight Pixel Difference Networks for Efficient Visual Representation Learning

arXiv

引用

arXiv 2024年

作者： Su, Zhuo Zhang, Jiehua Wang, Longguang Zhang, Hua Liu, Zhen Pietikäinen, Matti Liu, Li The College of Computer Science Nankai University Tianjin300071 China University of Oulu Oulu90570 Finland The Aviation University of Air Force Jilin Changchun130012 China The Institute of Information Engineering Chinese Academy of Sciences Beijing100045 China The College of Electronic Science and Technology Nation University of Defense Technology Hunan Changsha410000 China The Center for Machine Vision and Signal Analysis University of Oulu Oulu90014 Finland

Recently, there have been tremendous efforts in developing lightweight Deep Neural Networks (DNNs) with satisfactory accuracy, which can enable the ubiquitous deployment of DNNs in edge devices. The core challenge of developing compact and efficient DNNs lies in how to balance the competing goals of achieving high accuracy and high efficiency. In this paper we propose two novel types of convolutions, dubbed Pixel Difference Convolution (PDC) and Binary PDC (Bi-PDC) which enjoy the following benefits: capturing higher-order local differential information, computationally efficient, and able to be integrated with existing DNNs. With PDC and Bi-PDC, we further present two lightweight deep networks named Pixel Difference Networks (PiDiNet) and Binary PiDiNet (Bi-PiDiNet) respectively to learn highly efficient yet more accurate representations for visual tasks including edge detection and object recognition. Extensive experiments on popular datasets (BSDS500, ImageNet, LFW, YTF, etc.) show that PiDiNet and Bi-PiDiNet achieve the best accuracy-efficiency trade-off. For edge detection, PiDiNet is the first network that can be trained without ImageNet, and can achieve the human-level performance on BSDS500 at 100 FPS and with Copyright © 2024, The Authors. All rights reserved.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Digital Twin-Assisted Space-Air-Ground Integrated Multi-Access Edge Computing for Low-Altitude Economy: An Online Decentralized Optimization Approach

arXiv

引用

arXiv 2024年

作者： He, Long Sun, Geng Sun, Zemin Wang, Jiacheng Du, Hongyang Niyato, Dusit Liu, Jiangchuan Leung, Victor C.M. College of Computer Science and Technology Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Department of Electrical and Electronic Engineering University of Hong Kong Pok Fu Lam Hong Kong School of Computing Science Simon Fraser University BurnabyBCV5A 1S6 Canada R&D Department Jiangxing Intelligence Inc. Nanjing210000 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518115 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering The University of British Columbia VancouverV6T 1Z4 Canada

The emergence of space-air-ground integrated multi-access edge computing (SAGIMEC) networks opens a significant opportunity for the rapidly growing low altitude economy (LAE), facilitating the development of various applications by offering efficient communication and computing services. However, the heterogeneous nature of SAGIMEC networks, coupled with the stringent computational and communication requirements of diverse applications in the LAE, introduces considerable challenges in integrating SAGIMEC into the LAE. In this work, we first present a digital twin-assisted SAGIMEC paradigm for LAE, where digital twin enables reliable network monitoring and management, while SAGIMEC provides efficient computing offloading services for Internet of Things sensor devices (ISDs). Then, a joint satellite selection, computation offloading, communication resource allocation, computation resource allocation and UAV trajectory control optimization problem (JSC4OP) is formulated to maximize the quality of service (QoS) of ISDs. Given the complexity of JSC4OP, we propose an online decentralized optimization approach (ODOA) to address the problem. Specifically, JSC4OP is first transformed into a real-time decision-making optimization problem (RDOP) by leveraging Lyapunov optimization. Then, to solve the RDOP, we introduce an online learning-based latency prediction method to predict the uncertain system environment and a game theoretic decision-making method to make real-time decisions. Finally, theoretical analysis confirms the effectiveness of the ODOA, while the simulation results demonstrate that the proposed ODOA outperforms other alternative approaches in terms of overall system performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Transition between radial and toroidal orders in a trimer-based magnetic metasurface

引用

Physical Review Applied 2023年第4期20卷 044024-044024页

作者： Vladimir R. Tuz Andrey B. Evlyukhin Volodymyr I. Fesenko State Key Laboratory of Integrated Optoelectronics College of Electronic Science and Engineering International Center of Future Science Jilin University 2699 Qianjin St. Changchun 130012 China School of Radiophysics Biomedical Electronics and Computer Systems V. N. Karazin Kharkiv National University 4 Svobody Sq. Kharkiv 61022 Ukraine Institute of Quantum Optics Leibniz Universität Hannover Hannover 30167 Germany Institute of Radio Astronomy of National Academy of Sciences of Ukraine 4 Mystetstv St. Kharkiv 61002 Ukraine

The change in the arrangement of magnetic dipole moments in a magnetic metasurface, due to the influence of an external static magnetic field, is discussed. Each meta-atom of the metasurface is composed of three identical disk-shaped resonators (trimer) made of magnetically saturated ferrite. To provide physical insight, full-wave numerical simulations of the near fields and transmission characteristics of the metasurface are complemented by the theoretical description based on the multipole decomposition method. With these methods, the study of eigenmodes and scattering conditions of a single magnetic resonator, trimer, and their array forming the metasurface is performed. It is found that the magnetic dipole-based collective hybrid mode of the trimer can be gradually transformed from the radial (pseudomonopole) to azimuthal (toroidal) order and vice versa by varying the bias magnetic field strength. This is because the magnetic dipole moment of each individual disk constituting the trimer undergoes rotation as the bias magnetic field strength changes. This transition between two orders is accompanied by various patterns of localization of the electric field inside the meta-atoms. Due to the unique field configuration of these modes, the proposed metasurface can be considered for designing magnetic field sensors and nonreciprocal devices.

关键词： Faraday effect Magnetic order Metasurfaces Mie scattering Non-reciprocal propagation Ferrites Optical microcavities Magnetic moment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：