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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,900 篇 会议
225 篇 期刊文献
173 册 图书
3 篇 学位论文

馆藏范围

11,301 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

6,667 篇 工学
- 6,100 篇 计算机科学与技术...
- 2,907 篇 软件工程
- 1,183 篇 电气工程
- 1,066 篇 信息与通信工程
- 481 篇 电子科学与技术（可...
- 359 篇 控制科学与工程
- 176 篇 仪器科学与技术
- 152 篇 机械工程
- 116 篇 动力工程及工程热...
- 112 篇 生物医学工程（可授...
- 101 篇 生物工程
- 87 篇 光学工程
- 86 篇 建筑学
- 68 篇 土木工程
- 68 篇 网络空间安全
- 65 篇 化学工程与技术
- 59 篇 材料科学与工程（可...
- 58 篇 安全科学与工程
1,464 篇 理学
- 974 篇 数学
- 310 篇 物理学
- 156 篇 系统科学
- 139 篇 统计学（可授理学、...
- 135 篇 生物学
- 83 篇 化学
897 篇 管理学
- 647 篇 管理科学与工程(可...
- 306 篇 图书情报与档案管...
- 289 篇 工商管理
144 篇 医学
- 120 篇 临床医学
- 62 篇 基础医学(可授医学...
62 篇 经济学
- 62 篇 应用经济学
56 篇 法学
34 篇 农学
26 篇 教育学
18 篇 文学
11 篇 军事学

主题

1,461 篇 parallel process...
582 篇 computer archite...
568 篇 distributed comp...
536 篇 application soft...
529 篇 computational mo...
528 篇 concurrent compu...
347 篇 hardware
318 篇 graphics process...
308 篇 parallel program...
307 篇 graphics process...
306 篇 scalability
304 篇 computer science
285 篇 runtime
262 篇 big data
261 篇 parallel process...
259 篇 optimization
230 篇 processor schedu...
226 篇 throughput
218 篇 resource managem...
206 篇 bandwidth

机构

31 篇 national laborat...
23 篇 science and tech...
21 篇 department of co...
19 篇 national laborat...
18 篇 university of ch...
18 篇 institute of com...
17 篇 school of comput...
16 篇 school of comput...
15 篇 college of compu...
15 篇 georgia inst tec...
15 篇 barcelona superc...
15 篇 intel corporatio...
14 篇 school of comput...
14 篇 chinese acad sci...
14 篇 department of co...
13 篇 tsinghua univ de...
13 篇 ibm thomas j. wa...
13 篇 cent s univ sch ...
13 篇 college of compu...
13 篇 ohio state univ ...

作者

22 篇 jack dongarra
16 篇 badia rosa m.
16 篇 liu jie
16 篇 a. choudhary
15 篇 wang guojun
15 篇 yijie wang
15 篇 kurt rothermel
14 篇 anon
13 篇 jun wang
13 篇 koldehofe boris
13 篇 mencagli gabriel...
13 篇 prodan radu
13 篇 wang yijie
13 篇 hai jin
12 篇 dongsheng li
12 篇 zomaya albert y.
12 篇 navaux philippe ...
12 篇 yong dou
11 篇 fahringer thomas
11 篇 fernandes luiz g...

语言

11,175 篇 英文
92 篇 其他
36 篇 中文
2 篇 俄文
2 篇 土耳其文
1 篇 德文

检索条件"任意字段=International Conference on Parallel and Distributed Processing Techniques and Applications"

共 11301 条记录，以下是4711-4720 订阅

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

详细简洁

排序：

Succinct representations in collaborative filtering: A case study using wavelet tree on 1,000 cores 20

Succinct representations in collaborative filtering: A case ...

引用

20th international conference on parallel and distributed Computing, applications and Technologies, PDCAT 2019

作者： Peng, Xiangjun Wang, Qingfeng Sun, Xu Gong, Chunye Wang, Yaohua User-Centric Computing Group University of Nottingham Ningbo China China Department of Computer Science and Technology National University of Defense Technology China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology China

ISBN: (纸本)9781728126166

User-Item (U-I) matrix has been used as the dominant data infrastructure of Collaborative Filtering (CF). To reduce space consumption in runtime and storage, caused by data sparsity and growing need to accommodate side information in CF design, one needs to go beyond the U-I Matrix. In this paper, we took a case study of Succinct Representations in Collaborative Filtering, rather than using a U-I Matrix. Our key insight is to introduce Succinct Data Structures as a new infrastructure of CF. Towards this, we implemented a User-based K-Nearest-Neighbor CF prototype via Wavelet Tree, by first designing a Accessible Compressed Documents (ACD) to compress U-I data in Wavelet Tree, which is efficient in both storage and runtime. Then, we showed that ACD can be applied to develop an efficient intersection algorithm without decompression, by taking advantage of ACD's characteristics. We evaluated our design on 1,000 cores of Tianhe-II supercomputer, with one of the largest public data set ml-20m. The results showed that our prototype could achieve 3.7 minutes on average to deliver the results. © 2019 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Flexible I/O support for reconfigurable grid environments 1

引用

12th international Euro-Par conference on parallel processing

作者： Hermanns, Marc-Andre Berrendorf, Rudolf Birkner, Marcel Seidel, Jan Res Ctr Julich Cent Inst Appl Math D-52425 Julich Germany Univ Appl Sci Dept Comp Sci D-53754 St Augustin Germany

ISBN: (数字)9783540377849

ISBN: (纸本)3540377832

With growing computational power of current supercomputers, scientific computing applications can work on larger problems. The corresponding increase in dataset size is often correlated to an increase in needed storage for the results. Current storage area networks (SANS) balance I/O load on multiple disks using high speed networks, but are integrated on the operating system level, demanding administrative intervention if the usage topology changes. While this is practical for single sites or fairly static grid environments, it is hard to extend to a user defined per-job basis. Reconfigurable grid environments, where computing and storage resources are coupled on a per-job basis, need a more flexible approach for parallel I/O on remote locations. This paper gives a detailed overview of the abilities of the transparent remote access provided by TUNNELFS, a part of the VIOLA parallel I/O project. We show how TUNNELFS manages flexible and transparent access to remote I/O resources in a reconfigurable grid environment, supporting the definition of the amount and location of persistent storage services on a per-job basis.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Multiprocessing Performance Analysis Using Numerical Integration techniques

Multiprocessing Performance Analysis Using Numerical Integra...

引用

2024 international conference on Computing, Communication, Cybersecurity and AI

作者： Yadav, Kartikey Kothari, Soham Prajapat, Shaligram Int Inst Profess Studies DAVV Indore India

ISBN: (纸本)9783031744426;9783031744433

Weddle's rule is one of the best for high-order numerical integration solving techniques. For better accuracy, more step sizes are used to compute the end result, but this leads to an increased number of computations. parallel and multicore computations help us better enhance this computation. To maximize the performance ofWeddle's rule on contemporary processors, this research will investigate the role of multiprocessing. Utilizing multiprocessing and parallel computing techniques can significantly enhance the efficiency, accuracy, and scalability of these computations. In theory, this should reduce the computation time of the integration process as the workload is divided among multiple processors, resulting in better performance. Despite the theoretical promise of reduced computation times through multiprocessing, practical applications often reveal a discrepancy between expected and actual performance gains. This study analyzes the time consumed in computation over the number of processors (1 to 12) and the number of subintervals used in computation during the execution of the integration process. Also, the machine learning technique Gradient Descent can be used to predict time consumption using features like time taken, input size, and number of processors. The model has a 95% accuracy.

关键词： Numerical integration Weddle's rule Gradient descent Multi processing Multi-core performance

来源：评论

学校读者我要写书评

暂无评论

Adaptively Approximate techniques in distributed Architectures 41

Adaptively Approximate Techniques in Distributed Architectur...

引用

41st international conference on Current Trends in Theory and Practice of Computer Science ((SOFSEM)

作者： Catania, Barbara Guerrini, Giovanna Univ Genoa I-16126 Genoa Italy

ISBN: (纸本)9783662460788;9783662460771

The wealth of information generated by users interacting with the network and its applications is often under-utilized due to complications in accessing heterogeneous and dynamic data and in retrieving relevant information from sources having possibly unknown formats and structures. processing complex requests on such information sources is, thus, costly, though not guaranteeing user satisfaction. In such environments, requests are often relaxed and query processing is forced to be adaptive and approximate, either to cope with limited processing resources (QoS-oriented techniques), possibly at the price of sacrificing result quality, or to cope with limited data knowledge and data heterogeneity (QoD-oriented techniques), with the aim of improving the quality of results. While both kinds of approximation techniques have been proposed, most adaptive solutions are QoS-oriented. Additionally, techniques which apply a QoD-oriented approximation in a QoD-oriented adaptive way (called ASAP - Approximate Search with Adaptive processing - techniques), though demonstrated potentially useful in getting the right compromise between precise and approximate computations, have been largely neglected. In this paper, we first motivate the problem and provide a taxonomy for classifying approximate and adaptive techniques according to the dimensions pointed out above. Then, we show, through some concrete examples, the benefits of using ASAP techniques in two different contexts.

关键词： query processing approximate technique adaptive technique Quality of Data Quality of Service

来源：评论

学校读者我要写书评

暂无评论

distributed Vertex-Cut Partitioning

Distributed Vertex-Cut Partitioning

引用

14th IFIP WG 6.1 international conference on distributed applications and Interoperable Systems (DAIS)

作者： Rahimian, Fatemeh Payberah, Amir H. Girdzijauskas, Sarunas Haridi, Seif Swedish Inst Comp Sci Stockholm Sweden Royal Inst Technol KTH Stockholm Sweden

ISBN: (纸本)9783662433522;9783662433515

Graph processing has become an integral part of big data analytics. With the ever increasing size of the graphs, one needs to partition them into smaller clusters, which can be managed and processed more easily on multiple machines in a distributed fashion. While there exist numerous solutions for edge-cut partitioning of graphs, very little effort has been made for vertex-cut partitioning. This is in spite of the fact that vertex-cuts are proved significantly more effective than edge-cuts for processing most real world graphs. In this paper we present JA-BEJA- VC, a parallel and distributed algorithm for vertex-cut partitioning of large graphs. In a nutshell, JA-BE-JA-VC is a local search algorithm that iteratively improves upon an initial random assignment of edges to partitions. We propose several heuristics for this optimization and study their impact on the final partitioning. Moreover, we employ simulated annealing technique to escape local optima. We evaluate our solution on various graphs and with variety of settings, and compare it against two state-of-the-art solutions. We show that JA-BE-JA-VC outperforms the existing solutions in that it not only creates partitions of any requested size, but also requires a vertex-cut that is better than its counterparts and more than 70% better than random partitioning.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Digital Image Watermarking using DWT and Encryption with RGB Pixel Shuffling and PWP techniques 3

Digital Image Watermarking using DWT and Encryption with RGB...

引用

3rd IEEE international conference on Intelligent Technologies, CONIT 2023

作者： Kumar, Archek Praveen Kumar, A Kiran Malla Reddy University Department of CSE India Malla Reddy University Department of AI&ML India

ISBN: (纸本)9798350338607

Images are the most common word for every individual. Almost every area deals with image processing. Especially in security and military applications image processing is used. One the major stem of image processing is image watermarking and image cryptography. This research involves both watermarking and cryptography. The wavelets are a big family in which symlett wavelets are used. This paper deals with watermarking as well as encryption which uses Discrete Wavelet Transform (DWT), RGB (RED, GREEN, BLUE) pixel shuffling and parallel Whirlpool Algorithm (PWP) techniques. A color image is processed where RGB pixels which are shuffled according to the procedure which does not affect the intensity, while retrieving back the original information. techniques like De-noising, segmentation, smoothening and sharpening used for pre-processing the image. The different variants of DWT are considered to obtain proper watermarking. Watermarking with cryptography is the unique concept for proper security. The results were promising to obtain perfect security © 2023 IEEE.

关键词： Discrete wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Task Scheduling for Heterogeneous Computing using a Predict Cost Matrix 19

Task Scheduling for Heterogeneous Computing using a Predict ...

引用

48th international conference on parallel processing (ICPP)

作者： Djigal, Hamza Feng, Jun Lu, Jiamin Coll Comp & Informat Nanjing Peoples R China

ISBN: (纸本)9781450371964

This paper presents a list-based scheduling algorithm called Predict Priority Task Scheduling (PPTS) for heterogeneous computing. The main goal is to minimize the scheduling length by introducing a lookahead feature in the two phases of the PPTS algorithm, namely the task prioritizing phase and the processor selection phase. Existing list scheduling algorithms, such as PEFT and Lookahead have introduced this feature only in the processor selection phase. The novelty of the PPTS algorithm is its ability to look ahead not only in the processor selection phase but also in the task prioritizing phase, without increasing the time complexity. This is achieved based on a predict cost matrix (PCM), which determines the two phases of the proposed algorithm while minimizing the scheduling length and maintaining the same complexity of the existing related algorithms. The experiments based on real applications show that PPTS algorithm outperforms the existing related algorithms in terms of scheduling length ratio.

关键词： distributed Computing Application Scheduling Task Graph List-Scheduling

来源：评论

学校读者我要写书评

暂无评论

POI: Skew-Aware parallel Race Detection 18

POI: Skew-Aware Parallel Race Detection

引用

18th IEEE international Working conference on Source Code Analysis and Manipulation (SCAM)

作者： Sakurai, Yoshitaka Arahori, Yoshitaka Gondow, Katsuhiko Tokyo Inst Technol Tokyo Japan

ISBN: (纸本)9781538682906

Multithreaded programs are prone to dataraces. Dataraces are known to be hard to detect and reproduce by manual effort, although they often have detrimental effects on program reliability. Automated techniques are thus demanded for detecting dataraces efficiently and precisely. There have been proposed a lot of datarace detectors so far, among which dynamic ones are promising because of their precision. However, existing dynamic race detectors incur high race-checking overheads. Even a state-of-the-art dynamic race detector, called parallel FastTrack, fails to efficiently detect races under certain conditions, despite its attempt to parallelize race detection for efficiency. In this paper, we propose an efficient and precise parallel race detector. For our proposal, we first experimentally reveal that the load-distribution policy of parallel FastTrack tends to skew race-checking loads to a few detection threads. We then present a simple but effective technique, called POI, for balancing race-checking loads among detection threads. POI takes race-checking loads of each detection thread into account and reduces the load skew by making each detection thread manage almost the same number of memory addresses to be checked. Experiments on several real multithreaded data-processing applications show that POI succeeded in reducing, on average, about 37% of race detection overheads, which the load-distribution policy of parallel FastTrack would impose.

关键词： concurrency datarace race detection dynamic analysis parallelization

来源：评论

学校读者我要写书评

暂无评论

Biometric Security using EEG Signal processing - Acquisition, Representation and Classification Approaches

Biometric Security using EEG Signal Processing - Acquisition...

引用

2022 IEEE international conference on distributed Computing and Electrical Circuits and Electronics, ICDCECE 2022

作者： Biradar, Shashank D. Nalbalwar, Sanjay L. Deosarkar, Shankar B. Dbatu Dept. of E&tc Engineering 402104 India Vpkbiet 413133 India

ISBN: (纸本)9781665483162

Authentication and security issues are rapidly increasing with the development of new coding techniques and network interfacing. Biometric security has shown a promising performance for security mechanism compared to key based security mechanisms. Biometric security system operates on physiological and neurological inputs and their behavioral characteristic. In Biometric security system, forging and synthetic false inputs limits its application and reduces the reliability. Inputs such as face, iris, voice etc., are highly vulnerable to such attack. Biological signaling observes a higher reliability in providing security. Electroencephalogram (EEG) has gained a large interest in recent past for biometric security provisioning. This paper outlines a brief review on the recent development in the area of provisioning security using EEG signal for biometric security. Various approaches of EEG interface for biometric security, classification and its applications were reviewed. © 2022 IEEE.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

FastDCF: A Partial Index Based distributed and Scalable Near-Miss Code Clone Detection Approach for Very Large Code Repositories 22nd

FastDCF: A Partial Index Based Distributed and Scalable Near...

引用

22nd international conference on parallel and distributed Computing, applications and Technologies (PDCAT 2021)

作者： Yang, Liming Ren, Yi Guan, Jianbo Li, Bao Ma, Jun Han, Peng Tan, Yusong Natl Univ Def Technol Changsha Peoples R China CS&S Informat Syst Engn Co Ltd Beijing Peoples R China

ISBN: (纸本)9783030967727;9783030967710

Despite a number of techniques have been proposed over the years to detect clones for improving software maintenance, reusability or security, there is still a lack of language agnostic approaches with code granularity flexibility for near-miss clone detection in big code in scale. However, it is challenging to detect near-miss clones in big code since it requires more computing and memory resources as the scale of the source code increases. In this paper, we present FastDCF, a fast and scalable distributed clone finder, which is partial index based and optimized with multithreading strategy. Furthermore, it overcomes single node CPU and memory resource limitation with MapReduce and HDFS by scalable distributed parallelization, which further improves the efficiency. It cannot only detect Type-1 and Type-2 clones but also can discover the most computationally expensive Type-3 clones for large repositories. Meanwhile, it works for both function and file granularities. And it supports many different programming languages. Experimental results show that FastDCF detects clones in 250 million lines of code within 24 min, which is more efficient compared to existing clone detection techniques, with recall and precision comparable to state-of-the-art approaches. With BigCloneBench, a recent and widely used benchmark, FastDCF achieves both high recall and precision, which is competitive with other existing tools.

关键词： Clone detection distributed algorithm Large scale code analysis Efficiency and scalability Language agnostic Multiple granularities

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 468 469 470 471 472 473 474 475 476 477 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：