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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

6,218 篇 期刊文献
4,778 篇 会议
5 册 图书

馆藏范围

11,001 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

7,484 篇 工学
- 4,545 篇 计算机科学与技术...
- 3,801 篇 软件工程
- 1,604 篇 信息与通信工程
- 928 篇 电气工程
- 855 篇 控制科学与工程
- 773 篇 生物工程
- 772 篇 化学工程与技术
- 744 篇 电子科学与技术（可...
- 554 篇 光学工程
- 531 篇 生物医学工程（可授...
- 519 篇 机械工程
- 368 篇 材料科学与工程（可...
- 357 篇 仪器科学与技术
- 315 篇 动力工程及工程热...
- 294 篇 交通运输工程
- 232 篇 建筑学
- 227 篇 土木工程
4,379 篇 理学
- 2,086 篇 数学
- 1,294 篇 物理学
- 964 篇 生物学
- 682 篇 统计学（可授理学、...
- 627 篇 化学
- 313 篇 系统科学
1,926 篇 管理学
- 1,116 篇 管理科学与工程(可...
- 884 篇 图书情报与档案管...
- 364 篇 工商管理
538 篇 医学
- 438 篇 临床医学
- 324 篇 基础医学(可授医学...
- 220 篇 药学(可授医学、理...
276 篇 法学
- 229 篇 社会学
248 篇 农学
159 篇 经济学
88 篇 教育学
33 篇 军事学
30 篇 文学
17 篇 艺术学
1 篇 哲学
1 篇 历史学

主题

261 篇 semantics
223 篇 feature extracti...
208 篇 deep learning
162 篇 data mining
135 篇 computational mo...
127 篇 training
125 篇 machine learning
114 篇 convolution
113 篇 knowledge engine...
101 篇 neural networks
99 篇 predictive model...
98 篇 image segmentati...
94 篇 computer science
91 篇 data models
90 篇 object detection
88 篇 reinforcement le...
88 篇 accuracy
83 篇 optimization
82 篇 laboratories
77 篇 educational inst...

机构

394 篇 college of compu...
306 篇 university of ch...
256 篇 key laboratory o...
174 篇 iccub universita...
173 篇 infn sezione di ...
171 篇 department of ph...
166 篇 school of inform...
160 篇 infn sezione di ...
158 篇 horia hulubei na...
152 篇 h.h. wills physi...
151 篇 yandex school of...
147 篇 van swinderen in...
138 篇 universiteit maa...
124 篇 massachusetts in...
116 篇 national researc...
113 篇 warsaw
113 篇 university of ci...
113 篇 university of ma...
112 篇 université clerm...
111 篇 lpnhe sorbonne u...

作者

117 篇 beiter a.
117 篇 arzymatov k.
116 篇 barter w.
114 篇 brundu d.
110 篇 bellee v.
102 篇 bowcock t.j.v.
102 篇 casse g.
101 篇 bobulska d.
100 篇 blake t.
99 篇 borsato m.
99 篇 betancourt c.
99 篇 belin s.
96 篇 afsharnia h.
94 篇 belavin v.
92 篇 bediaga i.
90 篇 cali s.
86 篇 amato s.
85 篇 baryshnikov f.
83 篇 bjørn m.
77 篇 niyato dusit

语言

10,217 篇 英文
516 篇 其他
268 篇 中文
2 篇 德文
2 篇 法文
1 篇 荷兰文

检索条件"机构=Data Engineering and Knowledge Engineering Key Laboratory"

共 11001 条记录，以下是4881-4890 订阅

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

详细简洁

排序：

A Distinguisher for RNGs with LFSR Post-processing 16th

A Distinguisher for RNGs with LFSR Post-processing

引用

16th International Conference on Information Security and Cryptology, Inscrypt 2020

作者： Wu, Xinying Ma, Yuan Chen, Tianyu Lv, Na State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing China Data Assurance and Communications Security Research Center Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783030718510

Random number generator (RNG) is a fundamental element in modern cryptography. If the quality of the outputs generated by RNGs is not as well as expected, the cryptographic applications which use the random number service are vulnerable to security threats. In reality, the entropy source of RNGs could be impressible by the changes of environmental factors, resulting in defects in the generated data, such as poor statistical properties. Thus, RNG is generally designed with a preset post-processing module to improve the quality of the output sequences. Linear feedback shift register (LFSR) is one of the frequently used methods for post-processing thanks to the characteristic of simplicity and no reduction in output throughput. However, we point out that even if the statistical properties of the outputs of the entropy source are extremely poor, the sequences processed by LFSR can still pass the statistical test. This undoubtedly increases the security risks in the usage of RNGs. In this work, we propose a distinguisher for the RNGs with LFSR post-processing for the first time. The distinguisher can be used to detect the RNGs with LFSR post processing, and we theoretically prove the sequences before processing can be recovered. On this basis, we design a new statistical test via combining the distinguisher with the Frequency Test in the NIST test suite. The experimental results show that if the sequence is biased before being processed by LFSR, our proposed method can detect it, but the NIST SP 800-22 Test Suite cannot. © 2021, Springer Nature Switzerland AG.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

HOUGH-DCT Based Robust Watermarking for Medical Image 1

引用

12th International Symposium on Cyberspace Safety and Security, CSS 2020

作者： Mo, Ruiqi Liu, Jing Li, Jingbing Wang, Yulin Zhou, Jingjun School of Information and Communication Engineering Hainan University Haikou570228 China State Key Laboratory of Marine Resource Utilization in the South China Sea Hainan University Haikou570228 China Research Center for Healthcare Data Science Zhejiang Lab Zhejiang Hangzhou China

ISBN: (数字)9783030736712

ISBN: (纸本)9783030736705

The patients’ case files may be maliciously tampered with during network transmission. Once the patients’ medical record information is altered by criminals, serious medical accidents will occur. To solve the problem of information leakage, a robust medical image watermarking algorithm based on Hough transform and discrete cosine transform (HOUGH-DCT) is proposed. This method combines the feature vector of medical image, cryptography, hash function and zero watermark technology, and it makes up for the shortcoming that the traditional digital watermark method cannot protect the medical image. It has strong robustness and invisibility which can protect the patient's private information and medical image data security at the same time. Experimental results show that the algorithm can embed the watermark information at a faster speed without changing the medical image information and extract the watermark safely with better invisibility and robustness. © 2021, Springer Nature Switzerland AG.

关键词： Discrete cosine transforms

来源：评论

学校读者我要写书评

暂无评论

An Omnidirectional Antenna with Wide Bandwidth and High Gain for WiFi-5 and WiFi-6 Applications 3

An Omnidirectional Antenna with Wide Bandwidth and High Gain...

引用

3rd IEEE International Conference on Electronic Information and Communication Technology, ICEICT 2020

作者： Yang, Baifa Huang, Haixuan Feng, Botao Deng, Li College of Electronics and Information Engineering Shenzhen University Shenzhen518060 China College of Big Data and Internet Shenzhen Technology University Shenzhen518118 China Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing100876 China

ISBN: (纸本)9781728190457

This paper proposes an omni-directional printed antenna with broadband and high gain for WiFi-5 and WiFi-6 applications. In order to achieve stable omnidirectional gain, both of the ground plane and the radiating elements are arranged on the same side of the printed circuit board (PCB) substrate. Over the whole working frequency band, selecting the left end of the PCB board to supply power helps to achieve good radiation pattern in the H-plane. Simulated results exhibit that a relative bandwidth of 8% (5.15-7.125 GHz) is obtained. The corresponding gain ranges from 5.14 to 7.74 dBi in the operating band, which is about 4 dBi larger than that of the conventional omnidirectional antennas. © 2020 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

An attack-aware shipping enterprise cybersecurity framework based on deep learning 11

An attack-aware shipping enterprise cybersecurity framework ...

引用

11th International Conference on Information Systems and Computing Technology, ISCTech 2023

作者： Wu, Zhongdai Wang, Junxiang Shi, Qiangqiang Zhang, Jinxu Liu, Jin Zhang, Xiliang Shanghai Ship and Shipping Research Institute State Key Laboratory of Maritime Technology and Safety Shanghai China Cosco Shipping Technology CO. Ltd Cloud Compute Data Center Shanghai China Shanghai Maritime University College of Information Engineering Shanghai China

ISBN: (纸本)9798350342406

Digitalization of shipping aims to enhance shipping efficiency, safety, and sustainability through advanced technology. However, fully digitalized shipping relies heavily on the integration of various communication devices, which exposes shipping enterprises to increasing cyber risks, such as DDoS attacks, malware attacks, and data leakage threats. Unlike ground networks, shipping networks have high latency and low bandwidth, making traditional methods less accurate and challenging to meet the network protection requirements of shipping enterprises. In contrast, deep learning (DL)-based methods can effectively identify and respond to new types of shipping network attacks by simulating human expert decision-making. Therefore, In this paper, we propose a DL-based security framework that integrates attack type awareness to enhance the network security protection capability of shipping enterprises. The proposed framework performs real-time monitoring and analysis of network data to identify various types of network attacks and take corresponding defense measures timely. This framework was implemented and tested in COSCO Shipping Group, effectively improving the overall network security protection capability. © 2023 IEEE.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

SLBCNN: A Improved Deep Learning Model for Few-Shot Charge Prediction 8

SLBCNN: A Improved Deep Learning Model for Few-Shot Charge P...

引用

8th International Conference on Identification, Information and knowledge in the Internet of Things, IIKI 2019

作者： Li, Xue Rao, Yuan Wang, Wanzhen Feng, Cong Research Institute of Xi’an Jiaotong University Shenzhen China Lab of Social Intelligence and Complex Data Precessiong School of Software Engineering Xi’an Jiao Tong University Xi’an China Shaanxi Joint Key Laboratory for Artifact Intelligence Xi’an Jiaotong University Xi’an China

Traditional prediction methods of legal judgment rarely work well on few-shot charge prediction task, which is intended to predict possible crimes, laws and terms according to a given few-shot case description. A major challenge in developing an efficient few-shot charge prediction algorithm is how to effectively use all available features contained in the typical cases. To this end, we proposed a novel few-shot charge prediction method based on deep learning framework, named Semi-supervised Learning with BERT-text-Convolutional neural network (i.e. SLBCNN), which utilizes the Attribute-Tri-Training method to extract the features from the few-shot case data. Experiments on three datasets of Criminal-S, Criminal-M, and Criminal-L demonstrate that SLBCNN achieves the state-of-the-art performance, boosting the F1 by 5.2%, 4.2%, and 1.5%, respectively. © 2020 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/)

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

On promise problem of the Generalized Shortest Vector Problem 1

引用

作者： Wang, Wenwen Lv, Kewei State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Data Assurance Communication Security Research Center Chinese Academy of Sciences Beijing100093 China University of Chinese Academy Sciences Beijing100049 China

ISBN: (数字)9783319298146

ISBN: (纸本)9783319298139

In 2009, Bl¨omer and Naewe proposed the Generalized Shortest Vector Problem (GSVP). We initiate the study of the promise problem (GAPSAM) for GSVP. It is a promise problem associated with estimating the subspace avoiding minimum. We show GAPSAMc·n lies in coNP, where c is a constant. Furthermore, we study relationships between GAPSAM of a lattice and the nth successive minimum, the shortest basis, and the shortest vector in the dual of the saturated sublattice, and obtain new transference theorems for GAPSAM. Then, using the new transference theorems, we give various deterministic polynomial time reductions among the promise problems for some lattice problems. We also show GAPSAMγ can be reduced to the promise problem associated to the Closest Vector Problem (GAPCVPγ) under a deterministic polynomial time rank-preserving reduction. © Springer International Publishing Switzerland 2016.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

Hybrid Parameter Update: Alleviating Imbalance Impacts for Distributed Deep Learning

Hybrid Parameter Update: Alleviating Imbalance Impacts for D...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Hongliang Li Dong Xu Zhewen Xu Xiang Li College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Changchun China

Nowadays, data parallelism has been widely applied to train large datasets on distributed deep learning clusters, but it has suffered from costly global parameter updates at batch barriers. Performance imbalance among worker instances, introduced by uneven workload partitioning or biased resource allocation, can cause straggly workers, which can lead to severe impacts on both training speed and result accuracy. This paper studies the issue focusing on the tradeoff between training speed and result accuracy. We propose Cooperate Grouping Parallel (CGP), a hybrid parameter update solution that allows the flexibility of both synchronous and asynchronous update schemes. We introduce a novel Cooperate Worker Grouping Problem (CWGP) that seeks a task grouping configuration that leads to maximum model accuracy and holds customized training speed guarantees. We propose an evolution-based Pareto local searching algorithm to compute efficient worker grouping configurations. Comprehensive evaluation results are presented to demonstrate the effectiveness of CGP under both persistent and fluctuant imbalances. The proposed method alleviates the imbalance impacts without introducing extra adjustment over-heads.

关键词： Training Deep learning Computational modeling Focusing Distributed databases Parallel processing Resource management

来源：评论

学校读者我要写书评

暂无评论

Dynamic Variable Ordering Based Concurrent Search for Distributed CSPs

Dynamic Variable Ordering Based Concurrent Search for Distri...

引用

IFIP International Conference on Network and Parallel Computing Workshops (NPC Workshops)

作者： Chunhui LIU Jigui SUN Jian GAO College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China

Concurrent search is an efficient technique for solving distributed constraint satisfaction problems (DisCSPs). dynamic variable ordering (DVO) impacts performance of search greatly. In this paper, we present a distributed dynamic variable ordering based concurrent search algorithm, in which domain sizes of variables are calculated approximately during search. Experiments on randomly generated DisCSPs demonstrate that the proposed algorithm improves concurrent search drastically.

关键词： Parallel processing Educational institutions Computer science Educational technology Laboratories Computer networks Concurrent computing Distributed computing knowledge engineering Computer science education

来源：评论

学校读者我要写书评

暂无评论

Reducing Fault-tolerant Overhead for Distributed Stream Processing with Approximate Backup

Reducing Fault-tolerant Overhead for Distributed Stream Proc...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Yuan Zhuang Xiaohui Wei Hongliang Li Mingkai Hou Yundi Wang College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Changchun China

ISBN: (数字)9781728166070

ISBN: (纸本)9781728166087

The stream processing model continuously processes online data in an on-pass fashion that can be more vulnerable to failures than other offline-data processing schemes. Checkpoint-based fault-tolerant methods have been widely used to enhance the reliability of stream processing systems. To ensure exact data recoveries upon failures, full-backup mechanisms are used to store a complete copy of data, which introduces substantial runtime overhead and increases output latency. In the meantime, a wide range of online processing applications prefer quick-and-dirty results with a slight degradation inaccuracy to delayed exact results. This paper introduces a novel approximate fault-tolerant problem (OAFP) with the objective of reducing the failure-free fault-tolerant overhead and ensuring user-defiled output accuracy requirement upon failure at the same time. We present an approximate fault-tolerant scheme based on sampling backup mechanism and study the trade-off between fault-tolerant overhead and output accuracy in stream processing systems. We proposed two algorithms to compute backup plans for both single-node failure and correlated failure scenarios. Extensive experiments with different types of stream topologies are conducted on our simulator to verify the correctness and effectiveness of our approach. We prove our solution guarantees the output accuracy requirement with minimum FT latency for directed acyclic graph (DAG) stream topologies with single-node failures.

关键词： Task analysis Fault tolerance Fault tolerant systems Topology Checkpointing Computational modeling data models

来源：评论

学校读者我要写书评

暂无评论

Low-access repair of Reed-Solomon codes in rack-aware storage

Low-access repair of Reed-Solomon codes in rack-aware storag...

引用

2023 IEEE International Symposium on Information Theory, ISIT 2023

作者： Wang, Jiaojiao Chen, Zitan Tsinghua-Berkeley Shenzhen Institute Tsinghua Shenzhen International Graduate School The Data Science and Information Technology Research Center Shenzhen China The Chinese Univ of Hong Kong The School of Science and Engineering The Guangdong Provincial Key Laboratory of Future Networks of Intelligence Shenzhen China

ISBN: (纸本)9781665475549

We study the problem of repairing Reed-Solomon codes with low-access complexity in the rack-aware storage model that allows collective information processing in the nodes that share the same rack. Building on recent work of the access complexity for the rack-aware storage model, we derive a lower bound on the amount of information accessed for repairing multiple failed nodes within a single rack from any number of helper racks. Further, we construct a family of Reed-Solomon codes that only require accessing a relatively small number of symbols to repair failed nodes in a single rack. In particular, for certain code parameters, our construction attains the bound on the access complexity with equality and thus has optimal access. © 2023 IEEE.

关键词： Reed-Solomon codes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 485 486 487 488 489 490 491 492 493 494 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：