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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

282,603 篇 会议
17,623 册 图书

馆藏范围

299,995 篇 电子文献
263 种 纸本馆藏

日期分布

学科分类号

281,828 篇 工学
- 277,751 篇 计算机科学与技术...
- 67,717 篇 软件工程
- 14,895 篇 信息与通信工程
- 8,439 篇 电气工程
- 8,089 篇 控制科学与工程
- 4,688 篇 生物医学工程（可授...
- 974 篇 生物工程
- 827 篇 光学工程
- 606 篇 机械工程
- 568 篇 仪器科学与技术
- 494 篇 测绘科学与技术
- 492 篇 交通运输工程
35,837 篇 理学
- 28,677 篇 数学
- 5,532 篇 生物学
- 1,683 篇 物理学
- 1,126 篇 统计学（可授理学、...
- 517 篇 系统科学
- 482 篇 化学
30,399 篇 医学
- 22,124 篇 临床医学
- 9,245 篇 特种医学
- 3,035 篇 基础医学(可授医学...
- 1,217 篇 医学技术（可授医学...
10,775 篇 管理学
- 6,492 篇 管理科学与工程(可...
- 3,323 篇 图书情报与档案管...
- 1,770 篇 工商管理
- 743 篇 公共管理
4,314 篇 教育学
- 4,041 篇 教育学
2,337 篇 法学
- 1,997 篇 社会学
1,680 篇 文学
- 1,179 篇 新闻传播学
- 526 篇 外国语言文学
467 篇 艺术学
372 篇 经济学
149 篇 农学
98 篇 历史学
65 篇 哲学
24 篇 军事学

主题

10,830 篇 artificial intel...
4,631 篇 computer communi...
3,945 篇 deep learning
3,861 篇 information syst...
3,741 篇 computers
3,637 篇 software enginee...
3,332 篇 machine learning
3,243 篇 algorithm analys...
3,223 篇 semantics
2,288 篇 information stor...
2,190 篇 pattern recognit...
1,834 篇 neural networks
1,820 篇 user interfaces ...
1,820 篇 image processing...
1,805 篇 database managem...
1,794 篇 logics and meani...
1,777 篇 mathematical log...
1,770 篇 cryptography
1,757 篇 software enginee...
1,707 篇 data mining and ...

机构

651 篇 univ chinese aca...
541 篇 carnegie mellon ...
403 篇 univ chinese aca...
359 篇 univ calif berke...
353 篇 shanghai jiao to...
318 篇 stanford univ st...
307 篇 chinese acad sci...
288 篇 shanghai jiao to...
285 篇 inria
248 篇 tech univ munich...
241 篇 tech univ darmst...
225 篇 swiss fed inst t...
212 篇 univ waterloo wa...
207 篇 nanjing univ sta...
203 篇 tsinghua univ pe...
199 篇 ist austria klos...
198 篇 natl univ singap...
186 篇 mit cambridge ma...
185 篇 univ maryland co...
183 篇 chinese acad sci...

作者

212 篇 shen dinggang
104 篇 navab nassir
98 篇 zhang lei
94 篇 wang wei
92 篇 susilo willy
85 篇 liu yang
83 篇 rueckert daniel
81 篇 wang lei
81 篇 wang xin
76 篇 auer soeren
66 篇 golland polina
64 篇 weske mathias
61 篇 zhang yong
54 篇 liu wei
52 篇 zhang li
51 篇 zhou jie
49 篇 jiang xiaoyi
47 篇 zhang tao
47 篇 zhang yu
47 篇 ishai yuval

语言

298,284 篇 英文
1,937 篇 中文
1 篇 加泰罗尼亚文
1 篇 法文

检索条件"丛书名=Lecture notes in computer science,"

共 300226 条记录，以下是4761-4770 订阅

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

详细简洁

排序：

Noise Robustness of a Multiparty Quantum Summation Protocol 24th

Noise Robustness of a Multiparty Quantum Summation Protocol

引用

24th International Conference on Computational science (ICCS)

作者： Rodriguez-Otero, Anton Neumann, Niels M. P. van Der Schoot, Ward Wezeman, Robert Netherlands Org Appl Sci Res The Hague Netherlands

ISBN: (纸本)9783031637773;9783031637780

Connecting quantum computers to a quantum network opens a wide array of new applications, such as securely performing computations on distributed data sets. Near-term quantum networks are noisy, however, and hence correctness and security of protocols are not guaranteed. To study the impact of noise, we consider a multiparty summation protocol with imperfect shared entangled states. We study analytically the impact of both depolarising and dephasing noise on this protocol and the noise patterns arising in the probability distributions. We conclude by eliminating the need for a trusted third party in the protocol using Shamir's secret sharing.

关键词： Distributed Quantum Computing Noisy Quantum Communication Multi-Party Computation Shamir Secret Sharing

来源：评论

学校读者我要写书评

暂无评论

Cross-Layer Profiling of IoTBench 1

引用

15th BenchCouncil International Symposium on Benchmarking, Measuring and Optimizing (Bench)

作者： Zhang, Fan Wang, Chenxi Luo, Chunjie Wang, Lei Chinese Acad Sci Inst Comp Technol Beijing 100190 Peoples R China Univ Chinese Acad Sci Sch Comp Sci & Technol Beijing 100049 Peoples R China Int Open Benchmark Council BenchCouncil Beijing Peoples R China

ISBN: (数字)9789819703166

ISBN: (纸本)9789819703159;9789819703166

The rapid expansion of the Internet of Things (IoT) industry highlights the significance of workload characterization when evaluating microprocessors tailored for IoT applications. The streamlined yet comprehensive system stack of an IoT system is highly suitable for synergistic software and hardware co-design. This stack comprises various layers, including programming languages, frameworks, runtime environments, instruction set architectures (ISA), operating systems (OS), and microarchitecture. These layers can be bucketed into three primary categories: the intermediate representation (IR) layer, the ISA layer, and the microarchitecture layer. Consequently, conducting cross-layer workload characterization constitutes the initial stride in IoT design, especially in co-design. In this paper, we use a cross-layer profiling methodology to conduct an exhaustive analysis of IoTBench-an IoT workload benchmark. Each layer's key metrics, including instruction, data, and branch locality, were meticulously examined. Experimental evaluations were performed on both ARM and X86 architectures. Our findings revealed general patterns in how IoTBench's metrics fluctuate with different input data. Additionally, we noted that the same metrics could demonstrate varied characteristics across different layers, suggesting that isolated layer analysis might yield incomplete conclusions. Besides, our cross-layer profiling disclosed that the convolution task, characterized by deeply nested loops, significantly amplified branch locality at the microarchitecture layer on the ARM platform. Interestingly, optimization with the GNU C++ compiler (G++), intended to boost performance, had a counterproductive effect, exacerbating the branch locality issue and resulting in performance degradation.

关键词： IoT Benchmark Cross-layer profiling

来源：评论

学校读者我要写书评

暂无评论

Improving the Rectangle Attack on GIFT-64 30th

Improving the Rectangle Attack on GIFT-64

引用

30th Annual International Research Conference on Selected Areas in Cryptography (SAC)

作者： Chen, Yincen Zhang, Nana Liang, Xuanyu Song, Ling Yang, Qianqian Feng, Zhuohui Jinan Univ Coll Cyber Secur Guangzhou 510632 Peoples R China Chinese Acad Sci Inst Informat Engn Key Lab Cyberspace Secur Def Beijing 100093 Peoples R China Univ Chinese Acad Sci Sch Cyber Secur Beijing Peoples R China

ISBN: (纸本)9783031533679;9783031533686

GIFT is a family of lightweight block ciphers based on SPN structure and composed of two versions named GIFT-64 and GIFT-128. In this paper, we reevaluate the security of GIFT-64 against the rectangle attack under the related-key setting. Investigating the previous rectangle key recovery attack on GIFT-64, we obtain the core idea of improving the attack-trading off the time complexity of each attack phase. We flexibly guess part of the involved subkey bits to balance the time cost of each phase so that the overall time complexity of the attack is reduced. Moreover, the reused subkey bits are identified according to the linear key schedule of GIFT-64 and bring additional advantages for our attacks. Furthermore, we incorporate the above ideas and propose a dedicated MILP model for finding the best rectangle key recovery attack on GIFT-64. As a result, we get the improved rectangle attacks on 26-round GIFT-64, which are the best attacks on it in terms of time complexity so far.

关键词： symmetric cryptography GIFT-64 rectangle attack key recovery attack related-key scenario key guessing strategy

来源：评论

学校读者我要写书评

暂无评论

Global Sensitivity Analysis of Thrombus Formation in the Left Atrial Appendage of Atrial Fibrillation Patients 14th

Global Sensitivity Analysis of Thrombus Formation in the Lef...

引用

14th International Workshop on Statistical Atlases and Computational Modelling of the Heart (STACOM)

作者： Smine, Zineb Melidoro, Paolo Qureshi, Ahmed Longobardi, Stefano Williams, Steven E. Aslanidi, Oleg De Vecchi, Adelaide Kings Coll London Sch Biomed Engn & Imaging Sci London England

ISBN: (纸本)9783031524479;9783031524486

Atrial Fibrillation (AF) is the most common type of cardiac arrhythmia. Most AF-related thrombi originate within the left atrial appendage (LAA). This study investigated the key factors influencing thrombus formation in the LAA using global sensitivity analysis (GSA) based on computational fluid dynamics (CFD) simulations. GSA was conducted to assess the effects of four physiological input parameters: initial thrombin location within the LAA, fibrinogen (Fg) concentration in the blood, sensitivity to activated protein C (K3 constant), and inlet velocity. A total of 160 CFD simulations were performed using a 2D idealized left atrial geometry with the most common LAA morphologies: Cactus (CA), Chickenwing (CW), Windsock (WS), and Broccoli (BR). The area under the curve (AUC) of fibrin, which is a precursor of thrombus formation, was computed in the LAA to quantify net fibrin formation over time. Gaussian Process Emulators (GPE) were trained using the simulations' results to predict the Sobol indices from the input parameters. Fg concentration, initial thrombin location, and their interaction exhibited the largest Sobol indices in all LAA morphologies, impacting both average and maximum AUC. Inlet velocity affected the average AUC in BR, and its interaction with the initial thrombus location was significant for this morphology. Additionally, K3 contributed to the output variance in CW and BR. These findings emphasize the overall significance of Fg concentration and initial thrombin location, along with their interaction, in thrombus formation. The impacts of inlet velocity and K3 concentration appear to be morphology-specific. The distinct values obtained from maximum and average fibrin AUC provide complementary insights into thrombus formation.

关键词： Atrial Fibrillation Left atrial appendage Global sensitivity analysis Computational fluid dynamics Ischaemic stroke

来源：评论

学校读者我要写书评

暂无评论

A New Blockage Detection Approach for 6G THz Systems 23rd

A New Blockage Detection Approach for 6G THz Systems

引用

23rd International Conference on Next Generation Wired/Wireless Networks and Systems (NEW2AN) / 16th Conference on Internet of Things and Smart Spaces (RuSMART)

作者： Khakimov, Abdukodir Prikhodko, Anatoliy Mokrov, Evgeny Begishev, Vyacheslav Shurakov, Alexander Gol'tsman, Gregory Moscow Pedag State Univ Moscow Russia Natl Res Univ Higher Sch Econ Moscow Russia Peoples Friendship Univ Russia RUDN Univ Moscow Russia

ISBN: (纸本)9783031609930;9783031609947

Blockage detection is a critical functionality for the air interface in modern 5G and future 6G systems operating in millimeter wave (mmWave, 30-300 GHz) and terahertz (0.3-3 THz) frequency bands. In operational systems, blockage has to be detected prior to its occurrence to allow for time to take some actions to avoid the loss of connectivity, e.g., switching over to the back-up link. However, up to date, most of the proposed approaches are reactive detecting blockage only when it already started. In this paper, by utilizing the special signal oscillations occurring just prior to the blockage, we propose a new method for proactive blockage detection. The proposed approach is based on a periodogram of the received signal that can be estimated efficiently using modern signal processing techniques. We then proceed comparing the proposed approach to reactive and proactive methods reported to date using the blockage detection probability as the metric of interest. Our results illustrate that the proposed approach allows to detect blockage with probability one, at least few tens of milliseconds prior to the actual blockage time instant.

关键词： Proactive blockage detection Terahertz Spectral methods

来源：评论

学校读者我要写书评

暂无评论

Recursion-Theoretic Alternation 20th

Recursion-Theoretic Alternation

引用

20th Conference on Computability in Europe (CiE)

作者： Skapinakis, Eduardo NOVA Sch Sci & Technol NOVA FCT Ctr Math & Applicat NOVA Math Setubal Portugal Univ Tubingen Carl Friedrich von Weizsacker Zentrum Tubingen Germany

ISBN: (纸本)9783031643088;9783031643095

We introduce four recursion schemes, which, operating on a tree-like data structure, capture different models of computation based on alternating bounded quantifiers. By encoding inputs as paths, we recover and expand characterizations of complexity classes between deterministic linear time and polynomial space;by encoding them as balanced trees, we recover characterizations of alternating logarithmic time and polylogarithmic space. We propose recursion-theoretic characterizations of logarithmic and polylogarithmic time, as defined via Turing machines with random access to the input, and show that the classes of functions obtained capture, at least, the desired classes, and, at most, their alternating versions. Should the proposed characterizations be precise, we show that characterizations of linear and polynomially bounded alternating classes can be adapted to alternating classes with logarithmic and polylogarithmic resource bounds, simply by changing the way in which inputs are encoded. We discuss how, from these characterizations, some open problems in complexity theory can be obtained from known results by making alterations to recursion schemes.

关键词： Alternation Implicit complexity Logarithmic resources Tree recursion

来源：评论

学校读者我要写书评

暂无评论

Exploring Self-competition as a Viable Motivation to Promote Physical Activity 1

引用

19th International Conference on Persuasive Technology (PERSUASIVE)

作者： Hyypio, Henna Giri, Sarthak Oinas-Kukkonen, Harri Univ Oulu Oulu Adv Res Serv & Informat Syst Oulu 90570 Finland

ISBN: (数字)9783031582264

ISBN: (纸本)9783031582257;9783031582264

Persuasive systems design encompasses a wide range of concepts that may help users be motivated to achieve the targeted goal or behavior change. This study evaluates contemporary applications that seek to promote physical activity and finds that, although there are different implementations of competition-related features, they are not designed for individuals motivated by self-competition, a type of competition that allows individuals to compete against themselves to beat their own personal best performance. Furthermore, it explores how the psychological construct of competitive orientation can be used as a basis for personalizing persuasive systems. The paper then conceptualizes the design features of a system that addresses and caters to the self-competitive orientation of a user.

关键词： Persuasive Systems Design Behavior Change Support Systems Competition Strategy Self-Competition Competitive Orientation Personalization

来源：评论

学校读者我要写书评

暂无评论

Exploiting Layerwise Feature Representation Similarity For Backdoor Defence in Federated Learning 29th

Exploiting Layerwise Feature Representation Similarity For B...

引用

29th European Symposium on Research in computer Security (ESORICS)

作者： Walter, Kane Nepal, Surya Kanhere, Salil Univ New South Wales Kensington NSW 2033 Australia CSIRO Data61 Marsfield NSW 2122 Australia

ISBN: (纸本)9783031709029;9783031709036

Federated learning is an emerging paradigm for distributed machine learning that enables clients to collaboratively train models while maintaining data privacy. However, this approach introduces vulnerabilities, notably the risk of backdoor attacks where compromised models may perform normally on clean data but maliciously on poisoned inputs. A range of defences has been proposed in the literature based on robust aggregation, differential privacy or certified robustness and clustering/trust score-based approaches. In this work, we introduce FedAvgCKA, a novel defence mechanism that leverages the learned representations of neural networks to distinguish between benign and malicious submissions from clients. We demonstrate the effectiveness of FedAvgCKA across various federated learning scenarios and datasets, showcasing its ability to maintain high main task accuracy and significantly reduce backdoor attack success rates even in non-iid settings.

关键词： federated learning backdoor attack centered kernel alignment

来源：评论

学校读者我要写书评

暂无评论

HiFi-WaveGAN: Generative Adversarial Network with Auxiliary Spectrogram-Phase Loss for High-Fidelity Singing Voice Generation 18th

HiFi-WaveGAN: Generative Adversarial Network with Auxiliary ...

引用

18th International Conference on Neural Networks (ISNN)

作者： Wang, Chunhui Zeng, Chang Chen, Jun Xue, Ouyang Geely Hangzhou Peoples R China Natl Inst Informat Tokyo Japan Tsinghua Univ Shenzhen Int Grad Sch Beijing Peoples R China Yunnan Univ Sch Informat Sci & Engn Kunming Peoples R China

ISBN: (纸本)9789819743988;9789819743995

Entertainment-oriented singing voice synthesis (SVS) requires a vocoder to generate high-fidelity (e.g. 48 kHz) audio. However, most text-to-speech (TTS) vocoders cannot reconstruct the waveform well in this scenario. In this paper, we propose HiFi-WaveGAN to synthesize the 48 kHz high-quality singing voices in real-time. Specifically, it consists of an Extended WaveNet that served as a generator, a multi-period discriminator proposed in HiFiGAN, and a multi-resolution spectrogram discriminator borrowed from UnivNet. To better reconstruct the high-frequency part from the full-band mel-spectrogram, we incorporate a pulse extractor to generate the constraint for the synthesized waveform. Additionally, an auxiliary spectrogram-phase loss is utilized to approximate the real distribution further. The experimental results (Demo page: https://***/hifi-wavegan/) show that our proposed HiFi-WaveGAN obtains 4.23 in the mean opinion score (MOS) metric for the 48 kHz SVS task, significantly outperforming other neural vocoders.

关键词： Generative adversarial networkvocoder High-fidelity Singing voice generation

来源：评论

学校读者我要写书评

暂无评论

Tabulation with Zippers 17th

Tabulation with Zippers

引用

17th International Symposium on Functional and Logic Programming (FLOPS)

作者： Viera, Marcos Pardo, Alberto Saraiva, Joao Univ Republica Inst Comp Montevideo Uruguay Univ Minho Dept Informat Braga Portugal Univ Minho INESC TEC HASLab Braga Portugal

ISBN: (纸本)9789819722990;9789819723003

Tabulation is a well-known technique for improving the efficiency of recursive functions with redundant function calls. A key point in the application of this technique is to identify a suitable representation for the table. In this paper, we propose the use of zippers as tables in the tabulation process. Our approach relies on a generic function zipWithZipper, that makes strong use of lazy evaluation to traverse two zippers in a circular manner. The technique turns out to be particularly efficient when the arguments to recursive calls are closely situated within the function domain. For example, in the case of natural numbers this means function calls on fairly contiguous values. Likewise, when dealing with tree structures, it means functions calls on immediate sub-trees and parent nodes. This results in a concise and efficient zipper-based embedding of attribute grammars.

关键词： Zipper Tabulation Generics Attribute Grammars

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 473 474 475 476 477 478 479 480 481 482 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：