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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

518 篇 会议
28 篇 期刊文献
13 册 图书

馆藏范围

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

日期分布

学科分类号

443 篇 工学
- 386 篇 计算机科学与技术...
- 246 篇 软件工程
- 90 篇 信息与通信工程
- 47 篇 控制科学与工程
- 37 篇 电气工程
- 32 篇 安全科学与工程
- 21 篇 生物工程
- 17 篇 电子科学与技术（可...
- 17 篇 网络空间安全
- 14 篇 交通运输工程
- 14 篇 生物医学工程（可授...
- 13 篇 动力工程及工程热...
- 12 篇 仪器科学与技术
- 12 篇 建筑学
- 11 篇 机械工程
- 10 篇 土木工程
- 9 篇 光学工程
- 9 篇 化学工程与技术
128 篇 理学
- 67 篇 数学
- 37 篇 物理学
- 22 篇 生物学
- 13 篇 系统科学
- 13 篇 统计学（可授理学、...
67 篇 管理学
- 38 篇 管理科学与工程(可...
- 29 篇 图书情报与档案管...
- 21 篇 工商管理
22 篇 医学
- 20 篇 临床医学
- 12 篇 基础医学(可授医学...
- 9 篇 公共卫生与预防医...
16 篇 法学
- 12 篇 社会学
9 篇 经济学
7 篇 教育学
3 篇 农学
3 篇 军事学
1 篇 文学
1 篇 艺术学

主题

42 篇 security
20 篇 network security
17 篇 privacy
14 篇 cryptography
12 篇 access control
10 篇 computer archite...
9 篇 data privacy
8 篇 computer securit...
8 篇 machine learning
7 篇 internet of thin...
7 篇 computer communi...
7 篇 authentication
7 篇 cybersecurity
6 篇 cyber security
6 篇 security systems
6 篇 computers
6 篇 semantics
6 篇 biometrics
6 篇 correlation
6 篇 cryptology

机构

4 篇 school of comput...
3 篇 tu wien austria
3 篇 city graduate sc...
3 篇 faculty of compu...
3 篇 department of co...
3 篇 faculty of infor...
3 篇 department of el...
3 篇 department of co...
3 篇 hamburg universi...
2 篇 school of comput...
2 篇 huazhong univ sc...
2 篇 state grid gansu...
2 篇 institute for in...
2 篇 ut san antonio u...
2 篇 lanzhou city uni...
2 篇 department of co...
2 篇 cispa helmholtz ...
2 篇 school of electr...
2 篇 nanchang institu...
2 篇 carleton univ sc...

作者

5 篇 goyal s.b.
4 篇 susilo willy
4 篇 rajawat anand si...
4 篇 zhou jianying
3 篇 nakauchi shigeki
3 篇 meadows catherin...
3 篇 pais alwyn rosha...
3 篇 kotenko igor
3 篇 joaquin garcia-a...
3 篇 saeed khalid
3 篇 matthews suzanne...
2 篇 adetoye adedayo
2 篇 meseguer josé
2 篇 abadi m
2 篇 cardelli l
2 篇 minematsu kazuhi...
2 篇 nora cuppens-bou...
2 篇 marek pawlicki
2 篇 sarigiannidis pa...
2 篇 xiang yang

语言

528 篇 英文
25 篇 其他
6 篇 中文

检索条件"任意字段=5th European Symposium on Research in Computer Security"

共 559 条记录，以下是101-110 订阅

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

详细简洁

排序：

Approximate Convolutional Neural Networks Based on Dynamic Binding Windows

Approximate Convolutional Neural Networks Based on Dynamic B...

引用

CSI symposium on Real-Time and Embedded Systems and Technologies (RTEST)

作者： Morteza Adelkhani Mehdi Sedighi Computer Engineering Amirkabir University of Technology Tehran Iran

ISBN: (数字)9798331529284

ISBN: (纸本)9798331529291

the rapid growth of applications focused on handling amounts of data has increased the demand, for computational power especially in areas such as machine learning and graph analysis within big data frameworks. While these applications have traditionally been run on data centers, they now encounter issues concerning security and quick access to data leading to a shift towards embedded systems with processing capacity. To tackle this challenge, we suggest a strategy to improve the efficiency of Convolutional Neural Networks (CNNs) on embedded systems through hardware-driven computing. Our innovative method, "Dynamic Binding Window" adjusts calculation precision dynamically within convolution layers based on feature map windows and layer positions reducing burden and energy usage without compromising accuracy. Our research demonstrates that this approach effectively overcomes the constraints of embedded systems allowing for real-time processing on devices. Comparative evaluations indicate enhancements in processing speed and energy efficiency showcasing the impact of our approach in fields, like autonomous vehicles that rely on swift and precise image analysis.

关键词： Data centers Embedded systems Image analysis Machine learning Cyber-physical systems Real-time systems Energy efficiency Convolutional neural networks security Vehicle dynamics

来源：评论

学校读者我要写书评

暂无评论

Implementing GDPR in Social Networks Using Trust and Context 5th

Implementing GDPR in Social Networks Using Trust and Context

引用

5th International symposium on Cyber security Cryptography and Machine Learning (CSCML)

作者： Voloch, Nadav Gudes, Ehud Gal-Oz, Nurit Ben Gurion Univ Negev POB 653 IL-8410501 Beer Sheva Israel Sapir Acad Coll IL-79165 Sderot Israel

ISBN: (纸本)9783030780869;9783030780852

the GDPR (General Data Protection Regulation) is a regulation for data protection and privacy for citizens of the EU. It also addresses the export of personal data outside the EU, thus creating a regulation the affects most, as all, of the commercial companies, government institutions, and other sectors that maintain personal information of their customers or audiences. Social Networks are, of course, major interested parties both for the GDPR since their core definitions involve both private user's information, and data ownership issues. thus, there is an urgent need for a sustainable and reliable privacy model for these networks, that does not currently exist. In our previous research we have devised a comprehensive Trust-based model for security in Social Networks, that uses Trust, Access Control and Flow Control. In this paper we use this model, and add an element of context to it, for creating an implementation in Social Networks, that will better enforce the GDPR and rights management regulations.

关键词： GDPR Social networks security Flow control Access control Trust

来源：评论

学校读者我要写书评

暂无评论

Bestie: Very Practical Searchable Encryption with Forward and Backward security 26th

Bestie: Very Practical Searchable Encryption with Forward an...

引用

26th european symposium on research in computer security (ESORICS) / 16th Data Privacy Management International Workshop (DPM) / 5th International Workshop on Cryptocurrencies and Blockchain Technology (CBT)

作者： Chen, Tianyang Xu, Peng Wang, Wei Zheng, Yubo Susilo, Willy Jin, Hai Huazhong Univ Sci & Technol Natl Engn Res Ctr Big Data Technol & Syst Hubei Engn Res Ctr Big Data Secur Sch Cyber Sci & EngnServ Comp Technol & Syst Lab Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Sch Comp Sci & Technol Cyber Phys Social Syst Lab Wuhan 430074 Peoples R China Univ Wollongong Sch Comp & Informat Technol Inst Cybersecur & Cryptol Wollongong NSW Australia

ISBN: (纸本)9783030884284;9783030884277

Dynamic searchable symmetric-key encryption (DSSE) is a promising crypto-tool that enables secure keyword searching over dynamically added or deleted ciphertexts. Currently, many works on DSSE devote their efforts to obtaining forward and backward security and practical performance. However, it is still challenging to design a single DSSE scheme that simultaneously achieves this security, high performance, and real deletion. Note that real deletion is a critical feature to guarantee the right of the user to be forgotten stipulated by GDPR. Due to this fact, we propose a new forward-and-backward secure DSSE scheme named Bestie. To achieve high search performance, Bestie takes the traditional hash and pseudorandom functions and symmetric-key encryption as building blocks and supports parallel keyword search. Bestie also achieves non-interactive real deletion for avoiding the client to do a cleanup process. this feature not only guarantees the above GDPR rule but also makes Bestie more suitable for managing large-scale data. Bestie also saves the client's computation and communication costs. Finally, we experimentally compare Bestie with five previous well-known works and show that Bestie is much better in most respects. For example, Bestie requires approximately 3.66 microseconds to find a matching ciphertext. In contrast, Bestie has search performance at least 2 times faster than both Mitra* (CCS'18) and Dianada (CCS'17), 1,032x faster than Fides (CCS'17), and 38,332x faster than Janus++ (CCS'18), respectively. Compared with Mitra (CCS'18), Bestie saves at least 80% client time cost during a search.

关键词： Dynamic searchable symmetric-key encryption Forward and backward security High performance Real deletion

来源：评论

学校读者我要写书评

暂无评论

International Workshop on Cyber Range Technologies and Applications (CACOE 2020) 5

International Workshop on Cyber Range Technologies and Appli...

引用

5th IEEE european symposium on security and Privacy Workshops, Euro S and PW 2020

作者： Leitner, Maria Sommestad, Teodor Center for Digital Safety Security AIT Austrian Institute of Technology Vienna Austria C4ISR Swedish Defence Research Agency FOI Linköping Sweden

来源：评论

学校读者我要写书评

暂无评论

Effective Enumeration of Infinitely Many Programs that Evade Formal Malware Analysis 1

引用

5th International symposium on Cyber security Cryptography and Machine Learning (CSCML)

作者： Liagkou, Vasiliki Nastou, Panagiotis E. Spirakis, Paul Stamatiou, Yannis C. Univ Patras Campus Comp Technol Inst & Press Diophantus Patras 26504 Greece Univ Liverpool Dept Comp Sci Liverpool England Univ Patras Comp Engn & Informat Dept Patras 26504 Greece Univ Patras Dept Business Adm Patras 26504 Greece Univ Ioannina Dept Informat & Telecommun Koatakioi Arta 47100 Greece Univ Aegean Dept Math Appl Math & Math Modeling Lab Samos Greece

ISBN: (数字)9783030780869

ISBN: (纸本)9783030780869;9783030780852

the formal study of computer malware was initiated in the seminal work of Fred Cohen in the mid 80s who applied elements of the theory of Computation in the investigation of the theoretical limits of using the Turing Machine formal model of computation in detecting viruses. Cohen gave a simple but realistic, formal, definition of the characteristic actions of a computer virus as a Turing Machine that replicates itself and then proved that constructing a Turing Machine that recognizes viruses (i.e. Turing Machines that act like viruses) is impossible, by reducing the Halting Problem, which is undecidable, to the problem of recognizing a computer virus. In this paper we complement Cohen's approach along similar lines, based on Recursion Function theory and the theory of Computation. More specifically, after providing a simple generalization of Cohen's definition of a computer virus, we show that the malware/non-malware classification problem is undecidable under this new definition. Moreover, we show that to any formal system, there correspond infinitely many, effectively constructible, programs for which no proof can be produced by the formal system that they are either malware or non-malware programs. In other words, given any formal system, one can provide a procedure that generates, systematically, an infinite number of impossible to classify, within the formal system, programs.

关键词： Malware detection Information systems security Impossibility results Recursive function theory theory of computation Turing machines

来源：评论

学校读者我要写书评

暂无评论

Edge Partitions of Complete Geometric Graphs 38

Edge Partitions of Complete Geometric Graphs

引用

38th International symposium on Computational Geometry, SoCG 2022

作者： Aichholzer, Oswin Obenaus, Johannes Orthaber, Joachim Paul, Rosna Schnider, Patrick Steiner, Raphael Taubner, Tim Vogtenhuber, Birgit Institute of Software Technology Technische Universität Graz Austria Department of Computer Science Freie Universität Berlin Germany Department of Mathematical Sciences University of Copenhagen Denmark Department of Computer Science ETH Zürich Switzerland

ISBN: (纸本)9783959772273

In this paper, we disprove the long-standing conjecture that any complete geometric graph on 2n vertices can be partitioned into n plane spanning trees. Our construction is based on so-called bumpy wheel sets. We fully characterize which bumpy wheels can and in particular which cannot be partitioned into plane spanning trees (or even into arbitrary plane subgraphs). Furthermore, we show a sufficient condition for generalized wheels to not admit a partition into plane spanning trees, and give a complete characterization when they admit a partition into plane spanning double stars. Finally, we initiate the study of partitions into beyond planar subgraphs, namely into k-planar and k-quasi-planar subgraphs and obtain first bounds on the number of subgraphs required in this setting. © Oswin Aichholzer, Johannes Obenaus, Joachim Orthaber, Rosna Paul, Patrick Schnider, Raphael Steiner, Tim Taubner, and Birgit Vogtenhuber;licensed under Creative Commons License CC-BY 4.0

关键词： Wheels

来源：评论

学校读者我要写书评

暂无评论

Multi-modal cooperative awareness of connected and automated vehicles in smart cities 5

Multi-modal cooperative awareness of connected and automated...

引用

5th IEEE International Conference on Smart Internet of things, SmartIoT 2021

作者： Piperigkos, Nikos Lalos, Aris S. Berberidis, Kostas Computer Engineering and Informatics Department University of Patras Greece Industrial Systems Institute Athena Research Center Patras Greece

ISBN: (纸本)9781665445115

Cooperative autonomous driving in 5G and smart cities environment is expected to further improve safety, security and efficiency of transportation systems. To this end, involved vehicles is imperative to have accurate knowledge of both their own and neighboring vehicles’ location, a task known as cooperative awareness. In this paper, we have formulated two novel distributed localization and tracking schemes, based on Gradient Descent and Extended Kalman Filter algorithms, to cope with erroneous GPS location. Sensor-rich vehicles exploit Vehicle-to-Vehicle communications and a multitude of integrated sensors, like LIDAR and Cameras, to generate and fuse heterogeneous data. Each vehicle interacts only with its own connected neighboring vehicles, formulating individual star topologies. Extensive simulation studies using CARLA autonomous driving simulator, verify the significant reduction of GPS error achieved by the two methods in various experimental conditions. Distributed tracking proves to be much superior than Gradient descent algorithm, both in the case of self (58% reduction of GPS error) and neighboring vehicles location estimation (38% reduction of average GPS error). © 2021 IEEE.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

MTD: Run-time System Call Mapping Randomization 5

MTD: Run-time System Call Mapping Randomization

引用

5th International symposium on computer Science and Intelligent Controls (ISCSIC)

作者： Masumoto, Takeshi Oo, Wai Kyi Kyi Koide, Hiroshi Kyushu Univ Grad Sch Informat Sci & Elect Engn Fukuoka 8190385 Japan Kyushu Univ Res Inst Informat Technol Fukuoka 8190385 Japan

ISBN: (纸本)9781665416276

the purpose of our research is to provide defense against code injection attacks on the system. Code injection attack is one of the most dangerous attacks to a system, which can even give an attacker a chance to fully compromise the system by executing arbitrary code. Moving Target Defense (MTD) can protect the system from attacks by dynamically changing the target area of attacks including vulnerability as well as reduce the reachability of attacks. System call randomization is an MTD technique that disables code injection attacks by randomizing the mapping between system call numbers and the functions called by them. the purpose of system call randomization is to limit the processing and resources that the injected program can perform and access. As system calls are the only way for user applications to access system resources, randomizing system calls can give attackers more difficulty to achieve their goals, even if they can inject the program. Existing system call randomization techniques once performed randomization before loading the program, however, such methods only once in advance have no effect when information about randomization is disclosed to attackers. In this paper, we propose a method of re-randomizing multiple times at runtime to solve this problem. We implemented a script that directly edits the ELF executable format. In fact, as a result of running the script on a small program, we succeeded in generating a new executable file to which the method is applied. Our experiments show that run-time system call randomization is effective against code injection attacks, and this technique may also be applied to existing compiled programs.

关键词： information security Moving Target Defense system call randomization code injection attack

来源：评论

学校读者我要写书评

暂无评论

Trust and Verify: A Complexity-Based IoT Behavioral Enforcement Method 5th

Trust <i>and</i> Verify: A Complexity-Based IoT Behavioral E...

引用

5th International symposium on Cyber security Cryptography and Machine Learning (CSCML)

作者： Haefner, Kyle Ray, Indrakshi Colorado State Univ Ft Collins CO 80523 USA

ISBN: (纸本)9783030780869;9783030780852

In an Internet of things (IoT) environment, devices may become compromised by cyber or physical attacks causing security and privacy breaches. When a device is compromised, its network behavior changes. In an IoT environment where there is insufficient attack data available and the data is unlabeled, novelty detection algorithms may be used to detect outliers. A novelty threshold determines whether the network flow is an outlier. In an IoT environment, we have different types of devices, some more complex than others. Simple devices have more predictable network behavior than complex ones. this work introduces a novel access control method for IoT devices by tuning novelty detection algorithm hyper-parameters based on a device's network complexity. this method relies only on network flow characteristics and is accomplished in an autonomous fashion requiring no labeled data. By analyzing connection based parameters and variance of each device's network traffic, we develop a formalized measurement of complexity for each device. We show that this complexitymeasure is positively correlated to how accurately a device can be modeled by a novelty detection algorithm. We then use this complexity metric to tune the hyper-parameters of the algorithm specific to each device. We propose an enforcement architecture based on Software Defined Networking (SDN) that uses the complexity of the device to define the precision of the decision boundary of the novelty algorithm.

关键词： IoT security Unsupervised machine learning Access control

来源：评论

学校读者我要写书评

暂无评论

thermal Management in Large Data Centres: security threats and Mitigation 1

引用

8th International symposium on security in Computing and Communications, SSCC 2020

作者： Saridou, Betty Bendiab, Gueltoum Shiaeles, Stavros N. Papadopoulos, Basil K. Democritus University of Thrace Xanthi Greece Cyber Security Research Group University of Portsmouth Portsmouth United Kingdom

ISBN: (数字)9789811604225

ISBN: (纸本)9789811604218

Data centres are experiencing significant growth in their scale, especially, with the ever-increasing demand for cloud and IoT services. However, this rapid growth has raised numerous security issues and vulnerabilities;new types of strategic cyber-attacks are aimed at specific physical components of data centres that keep them operating. Attacks against temperature monitoring and cooling systems of data centres, also known as thermal attacks, can cause a complete meltdown and are generally considered difficult to address. In this paper, we focus on this issue by analysing the potential security threats to these systems and their impact on the overall data centre safety and performance. We also present current thermal anomaly detection methods and their limitations. Finally, we propose a hybrid method to prevent thermal attacks, that uses multi-variant anomaly detection and a fuzzy-based health factor to enhance data centre thermal awareness and security. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共56页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：