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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
91 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

58 篇 school of comput...
40 篇 jiangsu key labo...
36 篇 jiangsu key labo...
30 篇 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 篇 college of compu...
7 篇 school of comput...
6 篇 jiangsu key labo...
5 篇 university of ch...
5 篇 nanjing universi...
4 篇 jiangsu key lab ...
4 篇 wireless communi...
4 篇 faculty intellig...
4 篇 key laboratory o...

作者

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

语言

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

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

共 232 条记录，以下是91-100 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Estimating Power Consumption of Containers and Virtual Machines in data Centers

Estimating Power Consumption of Containers and Virtual Machi...

引用

IEEE International Conference on Cluster Computing

作者： Xusheng Zhang Ziyu Shen Bin Xia Zheng Liu Yun Li Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications

ISBN: (数字)9781728166773

ISBN: (纸本)9781728166780

Virtualization technologies provide solutions of cloud computing. Virtual resource scheduling is a crucial task in data centers, and the power consumption of virtual resources is a critical foundation of virtualization scheduling. Containers are the smallest unit of virtual resource scheduling and migration. Although many effective models for estimating power consumption of virtual machines (VM) have been proposed, few power estimation models of containers have been put forth. In this paper, we offer a fast-training piecewise regression model based on decision tree to build a VM power estimation model and estimate the containers' power by treating the container as a group of processes on the VM. In our model, we characterize the nonlinear relationship between power and features and realize the effective estimation of the containers on the VM. We evaluate the proposed model on 13 workloads in PARSEC and compare it with several models. The experimental results prove the effectiveness of our proposed model on most workloads. Moreover, the estimated power of the containers is in line with expectations.

关键词： Power demand Processor scheduling Estimation Containers Virtual machining data models Virtualization

来源：评论

学校读者我要写书评

暂无评论

Bidirectional LSTM-CRF for biomedical named entity recognition 14

Bidirectional LSTM-CRF for biomedical named entity recogniti...

引用

14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2018

作者： Yang, Xuemin Gao, Zhihong Li, Yongmin Pan, Chuandi Yang, Ronggen Gong, Lejun Yang, Geng Jiangsu Key Laboratory of Big Data Security Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210003 China Zhejiang Engineering Research Center of Intelligence Medicine Wenzhou325035 China Faculty Intelligent Science and Control Engineering Jinling Institute of Technology Nanjing211169 China

ISBN: (纸本)9781538680971

Bio-medical entity recognition extracts significant entities, for instance cells, proteins and genes, which is an arduous task in an automatic system that mine knowledge in bioinformatics texts. In this thesis, we utilized a bidirectional long short-term memory (Bi-LSTM) combined with conditional random fields (CRFs) approach to automatically obtain word representation, obliterated the need for a marvelous number of feature engineering tasks. The consequences of this experiment represent the word representation method can effectually acquire potential semantic information. Without relying on any artificial features, the result on the test dataset obtained 76.81 % F-score. Therefore, the proposed method is expected to advance biomedical text mining in bioinformatics entity recognition. © 2018 IEEE.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

An attribute reduction framework for inconsistent decision tables from view of the boundary region

An attribute reduction framework for inconsistent decision t...

引用

2016 International Conference on Machine Learning and Cybernetics, ICMLC 2016

作者： Qian, Jin Chang, Yu-Hui Lv, Ping Key Laboratory of Cloud Computing and Intelligent Information Processing of Changzhou City Jiangsu University of Technology Changzhou213015 China Jiangsu Key Laboratory of Big Data Analysis Technology/B-DAT Nanjing University of Information Science and Technology Nanjing China

ISBN: (纸本)9781509003891

Attribute reduction is one of the key issues for data preprocess in data mining. Many heuristic attribute reduction algorithms based on discernibility matrix have been proposed for inconsistent decision tables. However, these methods are usually computationally time-consuming. To address this issue, the derived consistent decision tables are defined for different definitions of relative reducts. The computations for different reducts of the original inconsistent decision tables are converted into the computations for their corresponding reducts of the derived consistent datasets. The relative discernibility object pair and the more optimal relative discernibility degree from view of the boundary region are designed to accelerate the attribute reduction process. An efficient attribute reduction framework using relative discernibility degree is proposed for large datasets. Experimental results show that our attribute reduction algorithms are effective and feasible for large inconsistent datasets. © 2016 IEEE.

关键词： Decision tables

来源：评论

学校读者我要写书评

暂无评论

On link formation in heterogeneous information networks: A view based on multi-Label learning 9

On link formation in heterogeneous information networks: A v...

引用

9th IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2017

作者： Chen, Ke-Jia Xue, Shijun Li, Yun Liu, Bin Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing Jiangsu210023 China College of Computer Science Nanjing University of Posts and Telecommunications Nanjing Jiangsu210023 China Center for the Neural Basis of Cognition Carnegie Mellon University PittsburghPA15213 United States

ISBN: (纸本)9781450349932

This paper studies the problem of relationship prediction in heterogeneous information networks. Our goal is not only to predict links/relationships more accurately but also to provide more viable paths to facilitate the formation of new links/relationships. A relationship prediction method based on multi-label learning named ML3P is proposed. In ML3P, each meta-path between nodes is regarded as a type of relationship and is given a label. Under the framework of multi-label learning, any potential relationship including the target relationship can be predicted. The results of comparative experiments in DBLP and Twitter datasets show that ML3P better uses heterogeneous information in supervised learning process and thus achieves better performance. Moreover, our method can output the correlation between relationships. © 2017 Association for Computing Machinery.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A relation prediction method based on PU learning

A relation prediction method based on PU learning

引用

International Conference on intelligent System and Knowledge Engineering, ISKE

作者： Gao-Jing Peng Ke-Jia Chen Shijun Xue Bin Liu Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing Jiangsu China

This paper studies relation prediction in heterogeneous information networks under PU learning context. One of the challenges of this problem is the imbalance of data number between the positive set P (the set of node pairs with the target relation) and the unlabeled set U (the set of node pairs without the target relation). We propose a K-means and voting mechanism based technique SemiPUclus to extract the reliable negative set RN from U under a new relation prediction framework PURP. The experimental results show that PURP achieves better performance than comparative methods in DBLP co-authorship network data.

关键词： Reliability Artificial neural networks Clustering algorithms Algorithm design and analysis Prediction methods Sun

来源：评论

学校读者我要写书评

暂无评论

Robustness May be at Odds with Stability in Adversarial Training based Feature Selection?

Robustness May be at Odds with Stability in Adversarial Trai...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yue Liu Yun Li Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

As an important stage in machine learning pipeline, feature selection techniques are mainly used to improve the generalization performance and training efficiency of machine learning model, but few works have focused on the robustness of machine learning models from the perspective of feature selection when dealing with adversarial attacks. In this paper, we propose the adversarial training (AT) based feature selection framework, i.e. AT based feature selection, to improve the robustness of machine learning model built on the feature selection result, which is inspired by using adversarial training to improve the robustness of deep learning model. AT based feature selection framework is the combination of adversarial training with some traditional feature selection algorithm, which can be divided into AT in-processing and AT post-processing feature selection. On the other hand, stability is also a very important property for feature selection. Then we experimentally analyze the relationship between robustness and stability of AT based feature selection, especially theoretically analyze the stability of $\ell_processing$ regularized AT in-processing feature selection algorithm in two different adversarial training forms. Our experimental results on benchmark data sets show that AT based feature selection algorithm is effective to improve the robustness of machine learning model, however, obtain lower stability than corresponding feature selection model without AT.

关键词： Training Deep learning Machine learning algorithms Pipelines Benchmark testing Feature extraction Stability analysis

来源：评论

学校读者我要写书评

暂无评论

MDPFL:A Multiple Differential Privacy Protection Method based on Federated Learning

MDPFL:A Multiple Differential Privacy Protection Method base...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Xinyu Liu Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

With the continuous development of artificial intelligence technology, machine learning in distributed network systems, such as IoVflntemet of Vehicles), will inevitably lead to privacy leakage. At present, there are lots of problems in federated learning, differential privacy and other machine learning privacy protection schemes, such as high loss of availability and the need of a fully trusted third-party server. In order to solve these problems, we propose MDPFL(Multiple Differential Privacy based on Federated Learning) algorithm. The algorithm combines with the differential privacy model in each stage of federated learning to solve the problem of curious third-party data collectors obtaining users’ original data in the process of machine learning. Meanwhile, the algorithm does not adopt a decentralized machine learning scheme directly, but uses a double noise adding mode with the existence of the third-party data collectors. We use Laplacian mechanism in the central server and GRR mechanism in local clients to ensure the goal of stability of the effect of the machine ¡earning model. The algorithm is compared with FedAvg, CDP, LDP algorithm in accuracy and loss rate which based on EMNIST data sets. In different global sensitivities, the model training effect is consistent with FedAvg algorithm while comparing with LDP algorithm, the speed of model convergence is improved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modeling Disease Progression via Weakly Supervised Temporal Multitask Matrix Completion

Modeling Disease Progression via Weakly Supervised Temporal ...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Lingsheng Wang Lei Xu Ping Li Siming Zha Lei Chen Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (数字)9781728185262

ISBN: (纸本)9781728185279

Alzheimer's disease (AD) is one of the most common neurodegenerative diseases. Understanding AD progression can empower the patients in taking proactive care. Mini Mental State Examination (MMSE) and AD Assessment Scale Cognitive subscale (ADAS-Cog) are two prevailing clinical measures designed to evaluate the AD progression. In this paper, we propose a weakly supervised Temporal Multitask Matrix Completion (TMMC) framework, which combines a novel transductive multitask feature selection scheme, to simultaneously predict AD progression measured by MMSE and ADAS-Cog, and identify related biomarkers trackable of AD progression. Specifically, by treating the prediction of cognitive scores at each time point as a regression task, we first formulate AD progression problem as a standard Multitask Matrix Completion (MMC) model. Secondly, considering the limited number of samples available in this study, we introduce a transductive feature selection scheme to jointly select the task-shared features for multiple time points and the task-specific features for different time points, and thus alleviate the over-fitting defect caused by Small-Sample-Size issue. Thirdly, aiming at the small change of cognitive scores between successive time points for a patient, we employ a temporal regularization scheme to capture the temporal smoothness of cognitive scores. Furthermore, we design an efficient optimization algorithm based on Alternative Minimization and Difference of Convex Programming techniques to solve the proposed TMMC framework. Finally, the extensive experiments performed on real-world Alzheimer's disease dataset demonstrate the effectiveness of our TMMC framework.

关键词： Predictive models Biomarkers Programming Feature extraction Task analysis Standards Diseases

来源：评论

学校读者我要写书评

暂无评论

SNNLog: A Log Parsing Scheme with Siamese Network and Fixed Depth Tree in Networks

SNNLog: A Log Parsing Scheme with Siamese Network and Fixed ...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Lei Sun Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

Syslog records critical information of network when the system is running, and has been used to help practitioners carry out various network maintenance and operation activities. Because of abundance of syslog, automated log analysis technology is needed to complete the above activities. Usually, log parsing is an important part of log analysis. Previous log parsing methods have good achievements, but they heavily rely on well-designed regular expressions and ignore semantic information of log. To solve these problems, we propose a novel log parsing method SNNLog, which uses Siamese Network to assess the similarity between log messages, and the similarity is used for the subsequent parsing. In addition, after parsing, SNNLog merges log similar events, reducing the misjudgment rate caused by non-numeric token variables at the beginning of messages. We evaluated on five publicly accessible log datasets and the results show that compared with SOTA algorithms such as LogMine, Spell, Drain and MoLFI, SNNLog has an F1-score of 0.999 on five datasets, and parsing accuracy of four datasets is the highest.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共24页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：