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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

141 篇 会议
89 篇 期刊文献

馆藏范围

230 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

141 篇 工学
- 106 篇 计算机科学与技术...
- 95 篇 软件工程
- 44 篇 信息与通信工程
- 19 篇 控制科学与工程
- 19 篇 生物工程
- 14 篇 电气工程
- 9 篇 机械工程
- 9 篇 电子科学与技术（可...
- 8 篇 交通运输工程
- 8 篇 网络空间安全
- 6 篇 安全科学与工程
- 5 篇 光学工程
- 5 篇 仪器科学与技术
- 5 篇 化学工程与技术
- 4 篇 动力工程及工程热...
- 4 篇 环境科学与工程（可...
- 4 篇 生物医学工程（可授...
79 篇 理学
- 55 篇 数学
- 30 篇 统计学（可授理学、...
- 22 篇 生物学
- 12 篇 物理学
- 10 篇 系统科学
- 6 篇 化学
- 3 篇 地球物理学
45 篇 管理学
- 25 篇 图书情报与档案管...
- 23 篇 管理科学与工程(可...
- 10 篇 工商管理
5 篇 法学
- 5 篇 社会学
4 篇 医学
- 4 篇 临床医学
3 篇 经济学
- 3 篇 应用经济学
1 篇 教育学
1 篇 农学
1 篇 军事学

主题

13 篇 feature extracti...
8 篇 task analysis
8 篇 semantics
8 篇 privacy
8 篇 training
7 篇 conferences
7 篇 data mining
6 篇 deep learning
6 篇 neural networks
6 篇 optimization
6 篇 forecasting
5 篇 telecommunicatio...
5 篇 computational mo...
5 篇 machine learning
5 篇 heuristic algori...
4 篇 power demand
4 篇 big data
4 篇 schedules
4 篇 costs
4 篇 security

机构

58 篇 school of comput...
41 篇 jiangsu key labo...
36 篇 jiangsu key labo...
29 篇 jiangsu key labo...
16 篇 jiangsu key labo...
11 篇 nanjing universi...
9 篇 nanjing universi...
9 篇 school of comput...
9 篇 school of comput...
8 篇 nanjing universi...
8 篇 state grid jiang...
7 篇 school of comput...
6 篇 college of compu...
6 篇 jiangsu key labo...
5 篇 nanjing universi...
4 篇 jiangsu key lab ...
4 篇 wireless communi...
4 篇 university of ch...
4 篇 faculty intellig...
4 篇 key laboratory o...

作者

37 篇 xu xiaolong
27 篇 xiaolong xu
15 篇 liu bin
9 篇 chen ke-jia
8 篇 jia xu
7 篇 yun li
7 篇 xu jia
7 篇 lijie xu
7 篇 bin liu
6 篇 lei wang
6 篇 li yun
6 篇 zou zhiqiang
6 篇 chen xingguo
6 篇 lejun gong
5 篇 xu lijie
5 篇 wang lei
5 篇 chen yunfang
5 篇 liu linfeng
5 篇 tao li
5 篇 yang geng

语言

228 篇 英文
2 篇 其他
1 篇 中文

检索条件"机构=Jiangsu Key Laboratory of Big Data Security AND Intelligent Processing Nanjing"

共 230 条记录，以下是81-90 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Semi-supervised Deep Closest Point Method for Point Cloud Registration

Semi-supervised Deep Closest Point Method for Point Cloud Re...

引用

2021 International Conference on Robotics Automation and intelligent Control, ICRAIC 2021

作者： Wu, Yong Shen, Lingfeng Li, Ping Jiangsu Power Transmission and Transformation Co. Ltd. Nanjing211106 China College of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China

Point cloud registration is one of the key issues in fields that need 3D scenes with global vision, including 3D scene reconstruction in robot technology, high-accuracy 3D map reconstruction in automatic driving, 3D reconstruction of real-time monitoring underground tunnel. Recently, point cloud registration methods based on deep neural networks have made great progress by learning from a large amount of well-aligned point cloud pairs. However, these large-scale labelled samples are usually difficult to obtain in the real-world applications such as visual simultaneous location and mapping of mobile robots which obtains unlabelled scene images in real time. To solve this problem, we propose a deep point cloud registration method based on the semi-supervised learning. Specifically, for the problem of less supervised data, we use Iterative Closest Point (ICP) algorithm to generate pseudo labels for the point cloud samples with unknown rigid transformations, effectively increasing the number of supervised data;in order to amend the pseudo labels, we design an alternating optimization algorithm to jointly learn the pseudo labels and deep point cloud registration model. The deep point cloud registration model and ICP are used alternately to continuously improve the precision of pseudo labels and the performance of the deep model. Experimental results show that this method can still obtain a reliable point cloud registration model even when just observing a small amount of point cloud samples with ground truth labels. © 2022 Institute of Physics Publishing. All rights reserved.

关键词： Surface measurement

来源：评论

学校读者我要写书评

暂无评论

A Point Cloud Registration Method for Substations Based on an Improved SAC-IA Algorithm

A Point Cloud Registration Method for Substations Based on a...

引用

2023 China Automation Congress, CAC 2023

作者： Wang, Lei Chen, Yiping Zong, Haonan Wang, Lulu Yin, Jun School of Computer Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China School of Internet of Things Nanjing University of Posts and Telecommunications Nanjing210023 China

ISBN: (纸本)9798350303759

This paper proposes a point cloud registration method for substations based on an improved SAC-IA algorithm. This method optimizes the SAC-IA algorithm by filtering the randomly selected point pairs to ensure that the triangles formed by the selected points in the model and scene point clouds have certain similarities. Furthermore, the registration error judgment of the SAC-IA algorithm has been improved. In addition to using the Euclidean distance between the registered model and scene point clouds as the judgment standard, this method also considers the SHOT difference and average curvature difference. Successful registration is only considered when all three standards are satisfied. The experimental research shows that the time performance of this method is twice as high as that of the traditional SAC-IA algorithm on average, and the recognition accuracy is improved in the recognition results. © 2023 IEEE.

关键词： Electric substations

来源：评论

学校读者我要写书评

暂无评论

A Social-Aware Mode Selection Algorithm for D2D Communications

A Social-Aware Mode Selection Algorithm for D2D Communicatio...

引用

International Conference on Communications, Signal processing, and Systems, CSPS 2018

作者： Lu, Wei-feng Lin, Wei-jun Chen, Si-guang Yang, Li-jun School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China College of IoT Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing210023 China

ISBN: (纸本)9789811362637

Aiming at mode selection in D2D communication, a mode selection strategy based on social-aware was proposed. In addition to physical connection status, users’ social relationships also served as an observation element. Through relationship between users, the closeness of user relationship can be judged, and then through users’ reference, the similarity between users can be obtained. In this way, by combining physical connection with social relationships, users’ aggregate utility was acquired. According to the physical connection quality and the social relationship strength, taking maximizing users’ aggregate utility as the goal, a random algorithm was designed to match users. Simulation results show that mode selection based on social perception can effectively improve users’ aggregate utility. © 2019, Springer Nature Singapore Pte Ltd.

关键词： Aggregates

来源：评论

学校读者我要写书评

暂无评论

Complex Substation Scene Segmentation Method Based on Optimized Straight Line Detection

Complex Substation Scene Segmentation Method Based on Optimi...

引用

2023 China Automation Congress, CAC 2023

作者： Wang, Lei Huang, Wei Chen, Yiping Chen, Hao Liu, Chuang Yin, Jun School of Computer Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China School of Internet of Things Nanjing University of Posts and Telecommunications Nanjing210023 China

ISBN: (纸本)9798350303759

This paper proposes a scene segmentation method based on optimized line detection to address the difficulty of segmenting spatially independent equipment in complex substation scenes. The method first employs the RANSAC method to simulate the ground plane and extract the ground point cloud. Then, it projects the 3D point cloud scene onto a 2D plane to obtain a 2D image of the substation. Straight line segments of the power line are extracted from the image using the edge detection algorithm and an improved line detection algorithm. The straight line segments that do not belong to the power line are filtered out using the surrounding features of the 3D point corresponding to the 2D point on the line. The power line's straight line segment is extended using the region-growing algorithm. Finally, the power line clustering is completed using European clustering based on the three-dimensional coordinates of the two ends of the power line, thereby completing the scene segmentation. Experimental results show that the proposed method can effectively segment substation equipment. Compared to traditional segmentation methods, this method has an average power line identification accuracy of 14% higher. © 2023 IEEE.

关键词： Edge detection

来源：评论

学校读者我要写书评

暂无评论

Temporal data fusion at the edge

Temporal data fusion at the edge

引用

2019 IEEE International Conferences on Ubiquitous Computing and Communications and data Science and Computational Intelligence and Smart Computing, Networking and Services, IUCC/DSCI/SmartCNS 2019

作者： Yang, Linfu Liu, Bin School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Jiangsu Key Lab of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728152097

As an enabler technique, data fusion has gained great attention in the context of Internet of things (IoT). In traditional settings, data fusion is done at the cloud server. So the data to be fused should be transferred from the sensor nodes to the cloud server before data fusion. Such an application mode of data fusion inherits disturbing concerns from the cloud computing framework, e.g., privacy-leaking, large latency between data capture and computation, excessive ingress bandwidth consumption. We take into account how to do temporal data fusion at the edge to bypass the above issues. We present a Gaussian process based temporal data fusion (GPTDF) method targeted for the problem of sequential online prediction at the edge. The GPTDF method fits the edge computing framework and thus inherits desirable properties from edge computing, such as privacy-preserving, low latency between data capture and computation, and tiny bandwidth consumption. Through a real-data experiment using archived traffic datasets from the Caltrans Performance Measurement System (PeMS), we demonstrate that the application of GPTDF can provide more timely and accurate real-time predictions at the network edge. © 2019 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

CROA: A content-based recommendation optimization algorithm for personalized knowledge services 21

CROA: A content-based recommendation optimization algorithm ...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Sun, Xiao Xu, Xiaolong Xia, Fei Jiangsu Key Laboratory Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Information and communication Branch State Grid Jiangsu Electric Power Company Nanjing China

ISBN: (纸本)9781728120584

Information explosion is a typical feature of the big data. Learners can easily find a wide variety of knowledge information online. However, the expansion of information also makes it difficult for learners to retrieve the information they want and fall into the problem of knowledge overload. In order to solve this problem effectively, we propose a content-based recommendation optimization algorithm for personalized knowledge services (CROA). First, the feature vector model is established, where each item information is represented by specific words and key information is highlighted by weighting. Second, a dynamic user vector model is then established to capture the latest preference information of the user. Finally, the feature vector model is combined with the multi-user comparison results thereby obtaining a list of recommendations. Experimental results indicate that CROA outstands in knowledge recommendation mechanism and can also alleviate knowledge overload. © 2019 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Path Planning based on Reinforcement Learning with Improved APF model for Synergistic Multi-UAVs 26

Path Planning based on Reinforcement Learning with Improved ...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Ding, Qun Xu, Xiaolong Gui, Wenming Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing210023 China Nanjing University of Posts and Telecommunications School of Computer Science Nanjing210023 China Jinling Institute of Technology School of Computer Science Nanjing211169 China

ISBN: (纸本)9798350331684

As the emerging technology of Unmanned Aerial Vehicles (UAVs) becomes mature, UAVs are widely used in environmental monitoring, communication and other fields. In view of this, this paper analyzed the task of synergistic multi-UAVs exploration of unknown environments, and proposed a path planning method for them based on reinforcement learning. Firstly, the path planning task of the UAVs was divided into two parts: the path travel strategy module and the information exploration strategy module. Models of the two modules were based on the Deep Deterministic Policy Gradient algorithm (DDPG), and an improved Artificial Potential Field (APF) force traction mechanism was introduced in the path travel strategy module. Its aim was to assist in guiding the generation of UAV flight path trajectories. Also it could enhance the learning capability of the model. The path travel strategy module would generate the complete flight path of the whole cluster in a distributed manner. A series of temporary target points provided by the information exploration strategy module helped. In maps with 21.5%, 25.3% and 29.6% of obstacles, multi-UAVs could achieve 84.2%, 76.7% and 69.9% of environmental exploration by the designed method. Compared with the APF method, the A star method and the Breath First Search (BFS) method, the proposed method is not only able to plan feasible paths in a more complex map model, but also the curvature of the planned paths is smoother, thus achieving the goal of reducing the energy cost of UAVs. © 2023 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

An optimal profit route planning scheme based on ACO-OPP 21

An optimal profit route planning scheme based on ACO-OPP

引用

作者： Qiu, Yuhua Xu, Xiaolong Xia, Fei Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Information and communication Branch State Grid Jiangsu Electric Power Company Nanjing China

ISBN: (纸本)9781728120584

Taxi plays an important role of urban public transportation system. However, without appropriate route planning scheme, taxi drivers can only choose to wait or seek passengers in the absence of orders, leading to wasting a lot of time and fuel. In this paper, an optimal profit route planning scheme for taxi drivers with Ant Colony Optimization Algorithm based on Optimal Profit Points (ACO-OPP) is proposed. First, the taxi trajectory data are preprocessed and the pick-up and drop-off points are extracted to obtain high-quality data;second, the data spatiotemporal distribution is analyzed to plan a more appropriate and rational route;the clustering algorithm is used to obtain the optimal profit points to increase the occupancy rate of taxis;then, ACO-OPP is utilized to plan the profit routes for each taxi. A series of experiments are implemented based on the real taxi trajectory dataset to test and compare the performance of the simulated annealing algorithm, the genetic algorithm, the ant colony algorithm and ACO-OPP on the optimal route length and the profitability with the unit time profit function. The experimental results show that ACO-OPP has the shortest optimal route length and the best profit per unit time. © 2019 IEEE.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

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

引用

15th International Conference on intelligent Computing, ICIC 2019

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

ISBN: (数字)9783030269692

ISBN: (纸本)9783030269685

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

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

Risk evaluation of financial websites based on structure mining

Risk evaluation of financial websites based on structure min...

引用

International Conference on Applications and Techniques in Cyber security and Intelligence, ATCSI 2017

作者： Li, Huakang Dai, Yuhao Jin, Xu Sun, Guozi Li, Tao Xu, Zheng Jiangsu Key Lab of Big Data and Security and Intelligent Processing School of Computer Science and Technology School of Software Nanjing University of Posts and Telecommunications Nanjing China The Third Research Institute of the Ministry of Public Security Shanghai China

ISBN: (纸本)9783319670706

With the development of network communication and security authentication technologies, Internet finance, a new financial business model which allows customers to achieve online financing, payment, investment and lending, becomes more and more popular. Risk of internet finance is much higher than that of traditional financial system because of the rapid fund flowing, lack of personal credit audit, deficiency of standard network operation and imperfect of information security. Current risk control of Internet finance mainly contains network security, financial self-discipline, investor education and governmental regulatory. In this paper, we propose a risk evaluation method based on structure mining for financial website after analyzing a large number of Internet financial sites. The kernel functions algorithm of natural language syntax tree is introduced to classify the security level of website. While the URL is considered as a long sentence and the path segments are defined as keywords. The experimental results demonstrate that the structure mining method can simply evaluate the risk of Internet financial website to achieve acceptable accuracy. © 2018, Springer International Publishing AG.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共23页 << < 5 6 7 8 9 10 11 12 13 14 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：