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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,310 篇 会议
252 篇 期刊文献
187 册 图书
2 篇 学位论文

馆藏范围

10,751 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

4,861 篇 工学
- 4,309 篇 计算机科学与技术...
- 3,041 篇 软件工程
- 722 篇 电气工程
- 684 篇 信息与通信工程
- 521 篇 控制科学与工程
- 375 篇 电子科学与技术（可...
- 162 篇 机械工程
- 147 篇 动力工程及工程热...
- 98 篇 网络空间安全
- 97 篇 生物工程
- 91 篇 安全科学与工程
- 86 篇 仪器科学与技术
- 79 篇 建筑学
- 71 篇 土木工程
- 71 篇 生物医学工程（可授...
- 64 篇 化学工程与技术
- 57 篇 材料科学与工程（可...
- 54 篇 力学（可授工学、理...
- 54 篇 光学工程
1,331 篇 理学
- 955 篇 数学
- 213 篇 系统科学
- 163 篇 统计学（可授理学、...
- 156 篇 物理学
- 120 篇 生物学
- 67 篇 化学
1,047 篇 管理学
- 827 篇 管理科学与工程(可...
- 409 篇 工商管理
- 253 篇 图书情报与档案管...
120 篇 经济学
- 120 篇 应用经济学
71 篇 法学
- 58 篇 社会学
45 篇 教育学
40 篇 医学
26 篇 农学
14 篇 文学
9 篇 军事学
2 篇 艺术学

主题

1,688 篇 application soft...
899 篇 distributed comp...
876 篇 computer archite...
873 篇 computer science
849 篇 hardware
728 篇 concurrent compu...
668 篇 parallel process...
559 篇 software enginee...
559 篇 computational mo...
446 篇 real time system...
345 篇 runtime
326 篇 costs
324 篇 software systems
319 篇 processor schedu...
317 篇 fault tolerance
315 篇 resource managem...
292 篇 software
289 篇 operating system...
287 篇 scalability
283 篇 bandwidth

机构

35 篇 school of comput...
23 篇 ibm thomas j. wa...
22 篇 department of co...
21 篇 school of softwa...
20 篇 college of compu...
20 篇 school of electr...
19 篇 state key labora...
19 篇 department of el...
19 篇 department of co...
18 篇 department of co...
16 篇 school of comput...
15 篇 department of el...
15 篇 department of co...
15 篇 department of co...
15 篇 department of co...
14 篇 department of el...
14 篇 beijing jiaotong...
13 篇 department of co...
13 篇 school of comput...
13 篇 institute of inf...

作者

20 篇 m. takizawa
20 篇 rajkumar buyya
20 篇 k.h. kim
18 篇 dhabaleswar k. p...
18 篇 jack dongarra
17 篇 m. kandemir
17 篇 h.j. siegel
16 篇 a. choudhary
14 篇 m. parashar
14 篇 howard jay siege...
13 篇 l.r. welch
13 篇 parashar manish
13 篇 gao guang r.
12 篇 dongarra jack
12 篇 h. casanova
12 篇 hari subramoni
12 篇 welch lonnie r.
12 篇 xiao qin
12 篇 maciejewski anth...
11 篇 jun wang

语言

10,619 篇 英文
96 篇 其他
34 篇 中文
1 篇 西班牙文
1 篇 法文
1 篇 葡萄牙文

检索条件"任意字段=International Symposium on Software Engineering for Parallel and Distributed Systems"

共 10751 条记录，以下是851-860 订阅

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

详细简洁

排序：

ZeroCAN: Anomaly-Based Zero-Day Attack Detection in Vehicular CAN Bus Networks 33

ZeroCAN: Anomaly-Based Zero-Day Attack Detection in Vehicula...

引用

33rd Euromicro international Conference on parallel, distributed, and Network-Based Processing, PDP 2025

作者： Rendel, Jonathan Balte, William Kurunathan, Harrison Ali, Hazem Ismail Roque, Alexandre Dos Santos Morais, Wagner Ourique De Fazeli, Mahdi Halmstad Sweden Polytechnic Institute of Porto CISTER/ISEP Portugal Federal University of Rio Grande do Sul - UFRGS Graduate Program of Electrical Engineering Porto Alegre Brazil

ISBN: (纸本)9798331524937

Zero-day attacks present a significant security threat to vehicular networks, exploiting vulnerabilities at both software and hardware levels within such systems that remain undiscovered. Mitigating these threats is essential to ensuring the safety and security of vehicular systems. Support Vector Machine (SVM) is a good candidate for anomaly detection of zero-day attacks within vehicular networks because it can handle highdimensional data and effectively distinguish between normal and abnormal patterns in complex and dynamic environments. A trained SVM on the normal operation data of in-vehicular network can identify flag deviations, thus making it effective in the detection of any previously unknown attack patterns, which is a common behaviour of zero-day attacks. In this paper, we introduce an anomaly detection method called "ZeroCAN"which models the behaviour of every single electronic control unit on the network with a separate SVM and a set of high-level features that capture the timing and data payload aspects of CANbus traffic. This approach achieves an anomaly detection rate of over 99% and a false positive rate below 0.01% during normal operation in most cases. © 2025 IEEE.

关键词： Anomaly detection CAN bus IDS Feature engineering Zero-day

来源：评论

学校读者我要写书评

暂无评论

HRaft: Adaptive Erasure Coded Data Maintenance for Consensus in distributed Networks

HRaft: Adaptive Erasure Coded Data Maintenance for Consensus...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Yulei Jia Guangping Xu Chi Wan Sung Salwa Mostafa Yulei Wu School of Computer Science and Engineering Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin China Department of Electrical Engineering City University of Hong Kong Hong Kong SAR China College of Engineering Mathematics and Physical Sciences University of Exeter Exeter UK

distributed data services usually rely on consensus protocols like Paxos and Raft to provide fault-tolerance and data consistency across global and local-distributed data centers. Erasure coding replication has appealing storage and network cost saving compared with full copy replication, which helps consensus protocols achieve low latency, high fault tolerance, and high throughput for data access. Applying erasure coding in consensus protocols directly will degrade the liveness level when the number of failure servers reaches a certain level. To address the challenge, CRaft just stores full copy replication instead of erasure coding replication when the number of failed servers reaches a certain threshold. In such situation, CRaft will be downgraded sharply to the same storage and network costs as Raft. To overcome the shortcoming of CRaft, we propose a protocol, called HRaft, which can adapt the placement of data blocks in order to always have enough blocks to recover the stored value when servers fail. By replenishing some coded blocks in healthy servers instead of full copy replication, it can avoid switching to the full replication when a certain threshold on the number of failures is reached. We designed and implemented a key-value (KV) storage prototype to validate the proposed protocol and evaluate its performance. The experimental results show HRaft can significantly reduce storage and network costs and improve write performance while keeping the liveness level compared to CRaft.

关键词： Fault tolerance Costs System performance Fault tolerant systems distributed databases Switches Throughput

来源：评论

学校读者我要写书评

暂无评论

A Priority Aware Free Viewpoint Video Transmit Scheme Based on QUIC

A Priority Aware Free Viewpoint Video Transmit Scheme Based ...

引用

IEEE international symposium on Broadband Multimedia systems and Broadcasting (BMSB)

作者： Junyi Lu Bingcong Lu Jun Xu Li Song Wenjun Zhang SJTU-ParisTech Elite Institute of Technology Shanghai Jiao Tong University Department of Electronic Engineering Shanghai Jiao Tong University

ISBN: (数字)9798350364262

ISBN: (纸本)9798350364279

Theadvent of Free Viewpoint Video (FVV) marks a significant evolution in internet video services, moving from traditional formats to more interactive and immersive experiences. Current free viewpoint video transmission systems face several challenges, including insufficient scalability in high-concurrency scenarios and additional response delays during interaction. To address these issues, we propose an innovative distributed viewpoint system solution that effectively resolves problems related to delay and scalability. At the transmission stage, we employ the QUIC protocol as the foundational transport protocol and introduce background streams as a strategy for viewpoint switching. By implementing a priority-sensitive scheduler, our system is able to maintain a high Quality of Experience (QoE) even in environments with weak network conditions. Through a series of simulation experiments, we have validated the efficiency and practicality of our system: our system is able to maintain an improvement of $3.49 \%-13.84 \%$ in PSNR. Overall, this research provides an effective solution for multi-stream parallel transmission applications such as free viewpoint video and 360 -degree video

关键词： Transport protocols Technological innovation Scalability Switches Streaming media Media Delays

来源：评论

学校读者我要写书评

暂无评论

Towards Faster Fully Homomorphic Encryption Implementation with Integer and Floating-point Computing Power of GPUs

Towards Faster Fully Homomorphic Encryption Implementation w...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Guang Fan Fangyu Zheng Lipeng Wan Lili Gao Yuan Zhao Jiankuo Dong Yixuan Song Yuewu Wang Jingqiang Lin State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Data Assurance and Communication Security Research Center Chinese Academy of Sciences Beijing China School of Cryptography University of Chinese Academy of Sciences Beijing China Department of Computer and Software Nanjing University of Information Science and Technology Nanjing China Ant Group Hangzhou China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Cyber Security University of Science and Technology of China Hefei China

Fully Homomorphic Encryption (FHE) allows computations on encrypted data without knowledge of the plaintext message and currently has been the focus of both academia and industry. However, the performance issue hinders its large-scale application, highlighting the urgent requirements of high-performance FHE *** noticing the tremendous potential of GPUs in the field of cryptographic acceleration, this paper comprehensively investigates how to convert the available computing resources residing in GPUs into FHE workhorses, and implement a full set of low-level and middle-level FHE primitives based on two arithmetic units (i.e., INT32 and FP64 units) with three types of data precision (i.e., INT32, INT64 and FP64). This paper gives a comprehensive evaluation and comparison based on each road-map. Our implementations of fundamental functions outperform the implementations on the same platform by 1.7× to 16.7×. Taking CKKS FHE schemes as a case study, our implementation of homomorphic multiplication achieves 3.2× speedup over the state-of-the-art GPU-based implementation, even considering the difference of platforms. The detailed evaluation and comparison of this paper would offer a vital reference for the follow-up work to choose appropriate underlying arithmetic units and important primitive optimizations in GPU-based FHE implementations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Timing Analysis of Asynchronized distributed Cause-Effect Chains 27

Timing Analysis of Asynchronized Distributed Cause-Effect Ch...

引用

30th IEEE international symposium on software Reliability engineering (ISSRE)

作者： Gunzel, Mario Chen, Kuan-Hsun Ueter, Niklas von der Brueggen, Georg Duerr, Marco Chen, Jian-Jia Tech Univ Dortmund Dept Comp Sci Dortmund Germany

ISBN: (纸本)9781665403863

Real-time systems require the formal guarantee of timing-constraints, not only for the individual tasks but also for the data-propagation paths. A cause-effect chain describes the data flow among multiple tasks, e.g., from sensors to actuators, independent from the priority order of the tasks. In this paper, we provide an end-to-end timing-analysis for cause-effect chains on asynchronized distributed systems with periodic task activations, considering the maximum reaction time (duration of data processing) and the maximum data age (worst-case data freshness). On one local electronic control unit (ECU), we present how to compute the exact local (worst-case) end-to-end latencies when the execution time of the periodic tasks is fixed. We further extend our analysis to globally asynchronized systems by combining the local results. Throughout synthesized data based on an automotive benchmark as well as on randomized parameters, we show that our analytical results improve the state-of-the-art for periodic task activations.

关键词： Real-Time systems Embedded Control systems Cause-effect Chains End-to-end Timing Analysis distributed systems

来源：评论

学校读者我要写书评

暂无评论

NFT Content Data Placement Strategy in P2P Storage Network for Permissioned Blockchain 27

NFT Content Data Placement Strategy in P2P Storage Network f...

引用

27th IEEE international Conference on parallel and distributed systems, ICPADS 2021

作者： Li, Wenquan Feng, Siqi Jin, Fuqi Kong, Lanju Li, Qingzhong School of Software Shandong University Jinan China School of Software Shandong University Research Center Dareway Software Co. Ltd Key Laboratory of Shandong Province for Software Engineering Jinan250101 China

ISBN: (纸本)9781665408783

Non-Fungible Token (NFT) has garnered remarkable attention to decentralized digital asset management. Permissionless blockchains store NFT content data leveraging P2P storage networks, in which data resource flows subject to financial incentives. For permissioned blockchains, without incentives, the placement of content data to the storage network requires a sound strategy, including the placement process and the replica location strategy, to avoid problems such as communication cost excess and storage unfairness, which greatly limit the service efficiency and sustainability of the storage network. Therefore, in this paper, we propose a new collaboration model between blockchain and the P2P storage network for issuing a new NFT, in which blockchain can complete the placement process and promote rational data distribution in the P2P storage network. Our proposed replica location strategy mainly considers three factors: storage fairness, service efficiency, and business load. Through theoretical analysis and experiments, it is proved that our replica location strategy has a better performance in both fairness and efficiency. © 2021 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Development and Application Mode Design of Complex Ship Numerical Simulation System Based on SaaS

Development and Application Mode Design of Complex Ship Nume...

引用

international symposium on distributed Computing and Applications to Business, engineering and Science (DCABES)

作者： Ji Zhao Cheng Cheng School of IoT Engineering WuXi City College of Vocational Technology Wuxi China China Ship Scientific Research Center Wuxi China

ISBN: (纸本)9781665454636

The current numerical simulation system is developing in the direction of large-scale, complex and service-oriented because of the high integration of numerical simulation technology development and equipment research. However, the numerical simulation research of the three important links of prediction, evaluation and optimization for the ship general performance is highly dependent on foreign commercial software. It is urgent to integrate multidisciplinary fusion methods and data knowledge engineering to implement independent research and development of numerical simulation systems. In order to remodel the research and development mode of ship general performance, the experience and lessons in the development of industrial software are summarized in this paper. The research and development concept of numerical simulation system for ship general performance including “crowd-innovation and sharing”, knowledge collaborative application, and intelligent are proposed to improve ship R & D capability.

关键词： Knowledge engineering Technological innovation Shipbuilding industry software as a service systems architecture Numerical simulation Numerical models

来源：评论

学校读者我要写书评

暂无评论

New Algorithms for distributed Fair k-Center Clustering: Almost Accurate as Sequential Algorithms 24

New Algorithms for Distributed Fair k-Center Clustering: Alm...

引用

Proceedings of the 23rd international Conference on Autonomous Agents and Multiagent systems

作者： Xiaoliang Wu Qilong Feng Ziyun Huang Jinhui Xu Jianxin Wang School of Computer Science and Engineering Central South University & Xiangjiang Laboratory Changsha China Department of Computer Science and Software Engineering Penn State Erie The Behrend College Erie PA USA Department of Computer Science and Engineering State University of New York at Buffalo Buffalo NY USA Hunan Provincial Key Lab on Bioinformatics Central South University & Xiangjiang Laboratory Changsha China

ISBN: (纸本)9798400704864

Fair clustering problems have been paid lots of attention recently. In this paper, we study the k-Center problem under the group fairness and data summarization fairness constraints, denoted as Group Fair k-Center (GFkC) and Data Summarization Fair k-Center (DSFkC), respectively, in the massively parallel computational (MPC) distributed model. The previous best results for the above two problems in the MPC model are a 9-approximation with violation 7 (WWW 2022) and a (17+ε)-approximation without fairness violation (ICML 2020), respectively. In this paper, we obtain a (3+ε)-approximation with violation 1 for the GFkC problem in the MPC model, which is almost as accurate as the best known approximation ratio 3 with violation 1 for the sequential algorithm of the GFkC problem. Moreover, for the DSFkC problem in the MPC model, we obtain a (4+ε)-approximation without fairness violation, which is very close to the best known approximation ratio 3 for the sequential algorithm of the DSFkC problem. Empirical experiments show that our distributed algorithms perform better than existing state-of-the-art distributed methods for the above two problems.

关键词： clustering fairness machine learning

来源：评论

学校读者我要写书评

暂无评论

Verifying the Correctness of distributed systems via Mergeable parallelism 7th

Verifying the Correctness of Distributed Systems via Merg...

引用

7th international symposium on Dependable software engineering: Theories, Tools, and Applications, SETTA 2021

作者： Long, Teng Ren, Xingtao Wang, Qing Wang, Chao School of Information Engineering China University of Geosciences Beijing100083 China Centre for Research and Innovation in Software Engineering School of Computer and Information Science Southwest University Chongqing China

ISBN: (纸本)9783030912642

distributed systems are the most basic elements of establishing services that deal with a large number of terminals (including clients and servers). Message passing is one of the communication methods in distributed systems. Verification of asynchronous distributed systems is valuable and challenging because of unpredictable interleavings and possible network faults. Asynchronous mode has better performance than the synchronous one, but asynchronous completion makes the task of specifying correct behaviors more difficult. In this paper, we propose a simple procedure for verifying the safety properties of asynchronous programs that satisfies the assumption of mergeable parallelism. And we characterize inference rules to describe the sequence combination that satisfies the conditions of the receiving operations. The program’s execution can be reduced to executions with sets of fixed order. A proof is provided to show its soundness. The correctness of the mergeable message passing programs could be verified by a state-of-the-art verification framework. It can be used in various message passing cases. © 2021, Springer Nature Switzerland AG.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Accelerating zk-SNARK with Group and Zone Optimization on GPU

Accelerating zk-SNARK with Group and Zone Optimization on GP...

引用

international Conference on parallel and distributed systems (ICPADS)

作者： Runnan Shen Liang Wang Haotian Luo Rui Yang Jinqian Yang Jinquan Wang Qiancheng Sun Limin Xiao Jin Dong State Key Laboratory of Complex Key Software Environment Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China Shen Yuan Honors College Beihang University Beijing China Beijing Academy of Blockchain and Edge Computing (BABEC) Beijing China

Zero-knowledge proof (ZKP) is a popular cryptographic strategy for building a trusted environment, which can be applied to blockchain, electronic voting, and other scenarios. However, ZKP involves a number of computationally intensive operations that limit its widespread adoption in time-sensitive practical applications. The multi-scalar multiplication (MSM) dominates the computations and takes over 70% of the total computation time. This paper proposes a GPU-based acceleration method for ZKP by designing several optimization techniques for MSM. First, this paper constructs a formal mathematical formula of the Pippenger algorithm, which provides a theoretical optimization framework for MSM. Second, by parallelizing the prefix sum, the time complexity of the bucket reduction part of MSM is reduced from $\mathcal{O}\left( {3 \times {2^C}} \right)$ to $\mathcal{O}\left( {2 \times {2^C}} \right)$. Finally, this paper also analyzes the influence of group size on the final calculation time under different data scales and gives a suitable range of group sizes. Compared to the state-of-the-art method, our method can achieve 1.01× to 1.12× for throughput.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 82 83 84 85 86 87 88 89 90 91 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：