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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

158 篇 会议
123 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

175 篇 工学
- 128 篇 计算机科学与技术...
- 114 篇 软件工程
- 51 篇 信息与通信工程
- 27 篇 生物工程
- 21 篇 控制科学与工程
- 20 篇 电气工程
- 12 篇 电子科学与技术（可...
- 9 篇 机械工程
- 9 篇 网络空间安全
- 8 篇 化学工程与技术
- 8 篇 交通运输工程
- 7 篇 光学工程
- 7 篇 安全科学与工程
- 5 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 4 篇 建筑学
- 4 篇 环境科学与工程（可...
- 4 篇 生物医学工程（可授...
98 篇 理学
- 61 篇 数学
- 30 篇 生物学
- 30 篇 统计学（可授理学、...
- 17 篇 物理学
- 9 篇 化学
- 9 篇 系统科学
58 篇 管理学
- 32 篇 图书情报与档案管...
- 28 篇 管理科学与工程(可...
- 10 篇 工商管理
6 篇 法学
- 6 篇 社会学
5 篇 医学
- 4 篇 基础医学(可授医学...
4 篇 经济学
- 4 篇 应用经济学
1 篇 农学
1 篇 军事学

主题

15 篇 feature extracti...
11 篇 semantics
9 篇 machine learning
9 篇 training
8 篇 conferences
8 篇 task analysis
7 篇 data mining
7 篇 privacy
6 篇 deep learning
6 篇 neural networks
6 篇 optimization
6 篇 forecasting
5 篇 power demand
5 篇 anomaly detectio...
5 篇 computational mo...
5 篇 data models
5 篇 heuristic algori...
4 篇 telecommunicatio...
4 篇 contrastive lear...
4 篇 schedules

机构

59 篇 school of comput...
39 篇 jiangsu key labo...
37 篇 jiangsu key labo...
30 篇 jiangsu key labo...
16 篇 jiangsu key labo...
15 篇 school of cyber ...
11 篇 nanjing universi...
11 篇 school of comput...
9 篇 nanjing universi...
9 篇 school of comput...
9 篇 peng cheng labor...
8 篇 nanjing universi...
8 篇 key laboratory o...
8 篇 state grid jiang...
7 篇 key lab. of inte...
7 篇 school of comput...
7 篇 school of comput...
7 篇 school of comput...
6 篇 key laboratory o...
6 篇 college of compu...

作者

36 篇 xu xiaolong
26 篇 xiaolong xu
16 篇 huang qingming
16 篇 xu qianqian
15 篇 liu bin
11 篇 yang zhiyong
10 篇 cao xiaochun
9 篇 chen ke-jia
8 篇 jia xu
8 篇 yun li
7 篇 zou zhiqiang
7 篇 xu jia
7 篇 lejun gong
7 篇 lijie xu
7 篇 bin liu
6 篇 lei wang
6 篇 li yun
6 篇 chen xingguo
6 篇 bao shilong
5 篇 xu lijie

语言

271 篇 英文
9 篇 其他
2 篇 中文

检索条件"机构=Jiangsu Key Laboratory for Big Data Security and Intelligent Processing"

共 281 条记录，以下是151-160 订阅

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

详细简洁

排序：

KCPMA: k-degree Contact Pattern Mining Algorithms for Moving Objects

KCPMA: k-degree Contact Pattern Mining Algorithms for Moving...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： You Chen Hua Dai Mingfeng Jiang Qu Lu Pengyue Li Bohan Li Geng Yang Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China Nanjing University of Aeronautics and Astronautics Nanjing China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

During infectious disease outbreaks, tracking contacted objects is important for suppressing the spread of the virus and using trajectories of moving objects to discover contacted objects is one of effective approaches. Existing algorithms focus on individual contact event discovery but lack the ability to obtain the k-degree contact events. In this paper, we propose efficient k-degree contact pattern mining algorithms that are capable of mining k-degree contact events. The definition of k-degree contact event is first formulated. Based on the definition, a sliding window-based baseline k-degree contact pattern mining algorithm (KCPMA) is presented. To improve the mining efficiency, the sample-point checking strategy and R-tree index are adopted and the optimized mining algorithm (KCPMA+) is proposed. Comprehensive experiments on real datasets demonstrate that the proposed algorithms are effective and efficient in mining k-degree contact events.

关键词： Costs Infectious diseases Federated learning Computer viruses Trajectory Indexes data mining

来源：评论

学校读者我要写书评

暂无评论

Scheduling Rechargeable UAVs for Long Time Barrier Coverage

Scheduling Rechargeable UAVs for Long Time Barrier Coverage

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Zhouqing Han Xiaojun Zhu Lijie Xu Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications China

ISBN: (数字)9781728190747

ISBN: (纸本)9781728183824

We consider barrier coverage applications where a set of UAVs are deployed to monitor whether intruders pass through a line, i.e., the barrier. Due to limited energy supply of UAVs, a charging pile is used to recharge UAVs. The problem is to place UAVs on top of the barrier and schedule them to the charging pile such that the barrier is seamlessly covered and the total number of UAVs is minimized. We decompose the problem into subproblems by dividing the barrier into disjoint subsegments and covering each subsegment independently. We prove a theoretical lower bound on the minimum number of UAVs required to cover the barrier forever. We then propose two scheduling strategies. In the first strategy, only fully recharged backup UAVs will be scheduled to take over UAVs running out of energy. If there are enough UAVs, this strategy can cover the barrier forever. The second strategy is proposed to deal with the situation that the number of UAVs is insufficient. Under the strategy, if no backup UAV is fully recharged, the one with the most battery energy will be selected to take over the monitoring task. When the number of UAVs is insufficient, the barrier can still be covered for a long time. We analytically derive the number of UAVs required by the first strategy, and the monitoring duration of the second strategy in case of insufficient UAVs. Simulations verify the effectiveness of the proposed solutions.

关键词： Schedules Conferences Force Batteries Task analysis Monitoring

来源：评论

学校读者我要写书评

暂无评论

Indoor Navigation Mechanism based on 5G network for Large Parking Garage

Indoor Navigation Mechanism based on 5G network for Large Pa...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Xiaolong Xu Qun Ding Licheng Lin School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

With the increase of car ownership in China, the problem of difficult parking in cities has become more and more serious. In large parking garage, finding an ideal parking space has become a daily problem for people; especially during the peak usage period of parking garage, a large number of vehicles will be driven into the parking garage, which will bring congestion, and at the same time, the demand of a large number of users in the area will lead to network congestion under 4G network, and users cannot access the network to check and find parking spaces. Therefore, this paper proposes a global optimal navigation mechanism with 5G network based on the above mentioned problems by analyzing the congestion situation during the peak usage of the parking garage. This mechanism uses an optimal parking space selection model and a global optimal scheduling model that can avoid congestion. Based on the model proposed in this paper, we construct a navigation planning system based on mobile, front-end and back-end. With the ultra-low latency, ultrahigh transmission efficiency and reliability of 5G network, the mobile port can select the optimal parking space according to the user's preference, and the back-end can show the parking space and congestion in the parking garage in real time according to the actual situation of the parking garage. Finally, the performance of the model and system proposed in this paper is verified through experiments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Impact of Feature Selection Methods on data Classification for IDS

Impact of Feature Selection Methods on Data Classification f...

引用

International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC

作者： Shuai Jiang Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

The rapid increase of data has led to many security issues. Various new technologies and other sub-disciplines have been introduced into the research of intrusion detection system (IDS), which has become a hot topic in the current field of security. However, IDS utilizing traditional machine learning technology suffers from relatively low detection rate, large computational overhead, and high false positive rate, due to the large amount of redundancy and high correlation of network traffic data. Therefore, we select random forest (RF) to handle the classification of the network traffic data, and try the classic feature selection algorithms Extra-Trees (ET) and Chi-square (CHI) to reduce the detection time and improve the efficiency of IDS. The experimental results based on the NSL-KDD dataset indicate that ET-RF and CHI-RF outstand in accuracy and computational overhead. Meanwhile, RF with ET outperforms that with CHI.

关键词： Feature extraction Classification algorithms Intrusion detection Telecommunication traffic Support vector machines Random forests

来源：评论

学校读者我要写书评

暂无评论

HERMES: Pedestrian Real-Time Offline Positioning and Moving Trajectory Tracking System Based on MEMS Sensors

HERMES: Pedestrian Real-Time Offline Positioning and Moving ...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Xinxin Liu Xiaolong Xu 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

ISBN: (纸本)9781728105499;9781728105482

With the development of positioning technology, sensor-based positioning has become the most commonly used positioning method because it is more low-cost and efficient with the popularity of smart phones. In this paper, we construct a pedestrian real-time offline positioning and moving trajectory tracking system (HERMES) which only relies on the sensors inside smart phones. In HERMES, based on Pedestrian Dead Reckoning (PDR) model, a stable and accurate pedestrian gait recognition is achieved through the rare double sliding window, the pedestrian step length is estimated in real time by a training pedestrian step length model, and the pedestrian real-time course angle is available through orientation sensor inside smart phones. Thus, if given a pedestrian's initial position, the system can implement the real-time offline pedestrian positioning and moving trajectory tracking. Experiments show the pedestrian gait recognition algorithm implemented in this paper has a high accuracy and the positioning effect is satisfactory. The moving trajectory tracked by the HERMES has a small deviation from the experimenter's actual trajectory.

关键词： Acceleration Real-time systems Gait recognition Smart phones Estimation Trajectory tracking Legged locomotion

来源：评论

学校读者我要写书评

暂无评论

ConvTrans-TPS: A Convolutional Transformer Model for Disk Failure Prediction in Large-Scale Network Storage Systems

ConvTrans-TPS: A Convolutional Transformer Model for Disk Fa...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Shicheng Xu Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

Disk failure is one of the most important reliability problems in large-scale network storage systems. Disk failure may lead to serious data loss and even disastrous consequences if the missing data cannot be recovered. Therefore, predicting disk failures is an important means of ensuring storage security in network storage systems. However, since the fault data in the fast degradation stage is smaller than the healthy data in the normal state, the mixture of healthy data and faulty data leads to extremely unbalanced data, which brings great challenges to finding hidden fault information, thus making fault prediction more accurate. Aiming at the above problems, a convolutional transformer model ConvTrans-TPS model for disk failure prediction in large-scale network storage systems is proposed. The ConvTrans-TPS model acquires dependencies between long-term sequence data through transformers and uses convolutional projections for attention computation to enhance attention to local contextual information. data augmentation to predict failures in the next 7 days. Validated by the analysis on the Backblaze dataset, the F1 is 0.96 and the Matthews correlation coefficient (MCC) is 0.92. Compared with the popular CNN-LSTM model in recent years, our proposed method improves F1 and MCC by 4% and 5%, respectively, improving the prediction accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

BLRGCN: A dynamic traffic flow prediction model based on spatiotemporal graph convolutional network

BLRGCN: A dynamic traffic flow prediction model based on spa...

引用

IEEE International Conference on data Mining Workshops (ICDM Workshops)

作者： Qiuhao Shi Xiaolong Xu Xuanyan Liu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

Because of the complex topology of urban road and the dynamic changes of traffic information over time, how to accurately and efficiently predict traffic flow has become a difficult problem. In order to capture spatiotemporal dependence at the same time, in this paper we propose BLRGCN, a dynamic traffic flow prediction model based on spatiotemporal graph convolutional network. This model improves the performance of bidirectional long short-term memory network (Bi-LSTM) by using residual network (ResNet), which can directly connect the input short to the output of nonlinear layer, and then combines the improved Bi-LSTM with graph convolutional neural network (GCN). BLRGCN model uses graphs to construct the network information of urban roads. In the graph, nodes express roads and edges express relationship between roads. The attributes of nodes describe traffic information on roads. We use GCN to extract the topological features of road network to capture spatial dependence. Besides, the BLRGCN model uses Bi-LSTM to obtain the information of the whole input sequence and extract the dynamic change characteristics of traffic data on the road to capture the temporal dependence. Compared with other methods on two traffic datasets, BLRGCN model has improved RMSE index by 0.53%-37.03% and 23.69%-43.83% respectively. The MAE index was improved by 34.89%-37.78% and 7.80%-51.88%, the accuracy index was improved by 0.19%-82.53% and 4.55%- 10.45%, the R2 index was improved by 0.24%-25.65% and 16.67%-29.94%, and the var index is improved by 0.25%-24.24% and 16.99%-30.39% respectively, which indicates that BLRGCN model has good prediction performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Network data Classification Mechanism for Intrusion Detection System

Network Data Classification Mechanism for Intrusion Detectio...

引用

International Conference on Computer Supported Cooperative Work in Design

Intrusion detection system (IDS), as a network security device, monitors network data in real time and responds actively when it detects suspicious transmissions. However, suffered from the large amount of redundancy and high correlation of network data, the traditional IDS have defects in low detection rate and high computational overhead. In this paper, we propose a network data classification mechanism (CPEL). data preprocessing of network traffic data is first performed using correlation-based feature selection (CFS) and principal component analysis (PCA). CFS selects the best features in the data, PCA to dimensionality reduction and denoising. Then, we use multiple classifiers to perform anomaly detection, and select the best three classifiers according to the classification effect. On this basis, we use the majority vote as the ensemble learning (EL) method of combination rules to further improve the performance of the classifier. Experimental results on the benchmark NSL-KDD and WSN-DS datasets indicate that this mechanism outperforms a single algorithm in accuracy and detection rate. In the meantime, computational overhead is remarkably reduced.

关键词： Dimensionality reduction Wireless sensor networks Redundancy Intrusion detection Telecommunication traffic Feature extraction Real-time systems

来源：评论

学校读者我要写书评

暂无评论

FP-WDDQN: An improved deep reinforcement learning algorithm for adaptive traffic signal control

FP-WDDQN: An improved deep reinforcement learning algorithm ...

引用

IEEE International Conference on data Mining Workshops (ICDM Workshops)

作者： Xiao Zhang Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

Current adaptive traffic signal control methods based on centralized deep reinforcement learning are not applicable in large-scale adaptive traffic control environment. The scalability problem is overcome by assigning global control to each local RL agent through multi-intelligence reinforcement learning, but the environment now becomes partially visible ami non-stationarity from the perspective of each local agent due to limited communication between agents. In this paper, we propose a multi-agent framework called Forgetful Priority Weighed Double Deep Q-learning (FP-WDDQN). We firstly extend Weighted Double Deep Q-Learning(WDDQN) to the multi agent domain, so as to reduce the error caused by the algorithm's underestimation of the target network and get more accurate Q-value. Then we propose a new algorithm based on Forgetful Experience Mechanism(FEM) and Priority Experience Replay Mechanism(PERM). This mechanism makes WDDQN choose experience based on Temporal Difference (TD) error and Identify the importance of experience with FEM. It makes WDDQN preferentially select experience with high TD-error in the process of sampling and training its network based on FEM and TD-error, which improved the model training efficiency and stabilized the learning process. In this paper, we construct an urban traffic network with seven intersections in the simulation platform called Simulation of Urban MObility(SUMO), and the proposed FP-WDDQN is compared against Independent Double Deep Q-learning(IDDQN), WDDQN and Multi-agent Advantage Actor Critic (MA2C) under the condition of simulating the traffic dynamics of peak hours. Experiment shows FP-WDDQN has better performance than other algorithms in vehicle speed, intersection delay and intersection waiting queue length.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Flight Path Optimization for UAVs to Provide Location Service to Ground Targets

Flight Path Optimization for UAVs to Provide Location Servic...

引用

IEEE Conference on Wireless Communications and Networking

作者： Youpeng Wang Xiaojun Zhu Lijie Xu College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications China

ISBN: (数字)9781728131061

ISBN: (纸本)9781728131078

We consider using UAVs to provide location service to ground targets. UAVs fly over the target area and broadcast their locations periodically via wireless signals. When a UAV flies along a straight line, a target will observe the strongest signal when the UAV is at the closest location, based on which it can infer its location. The problem is to minimize the flight length subject to the constraint that the transmission range of a UAV is limited and all targets in the area should be located. We formulate the problem and give an optimal flight path to cover a square with side length no greater than a certain value. In the general case when the given area cannot be covered by the square, we propose to divide UAVs into two groups, whose flight paths are either parallel or orthogonal. We conduct simulations to compare our approach with existing approaches. Results verify the superiority of our approach in terms of flight length and localization error.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共29页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：