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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

608 篇 会议
9 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

341 篇 工学
- 332 篇 计算机科学与技术...
- 204 篇 软件工程
- 122 篇 信息与通信工程
- 34 篇 电气工程
- 25 篇 控制科学与工程
- 24 篇 电子科学与技术（可...
- 8 篇 动力工程及工程热...
- 8 篇 测绘科学与技术
- 7 篇 机械工程
- 7 篇 建筑学
- 6 篇 生物工程
- 5 篇 光学工程
- 5 篇 安全科学与工程
- 3 篇 力学（可授工学、理...
- 3 篇 土木工程
- 3 篇 生物医学工程（可授...
- 2 篇 仪器科学与技术
109 篇 理学
- 90 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 9 篇 物理学
- 9 篇 生物学
- 5 篇 化学
- 2 篇 大气科学
- 2 篇 地球物理学
76 篇 管理学
- 51 篇 管理科学与工程(可...
- 43 篇 工商管理
- 27 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
4 篇 医学
- 4 篇 临床医学
2 篇 法学
1 篇 教育学
1 篇 农学

主题

174 篇 distributed comp...
111 篇 computer network...
100 篇 software enginee...
93 篇 artificial intel...
73 篇 concurrent compu...
55 篇 computer science
47 篇 grid computing
47 篇 distributed comp...
45 篇 peer to peer com...
39 篇 application soft...
31 篇 parallel process...
31 篇 wireless sensor ...
30 篇 network topology
29 篇 parallel process...
29 篇 delay
28 篇 costs
25 篇 algorithm design...
25 篇 large-scale syst...
24 篇 protocols
23 篇 resource managem...

机构

3 篇 department of co...
3 篇 department of co...
3 篇 school of inform...
3 篇 national laborat...
3 篇 institute of com...
3 篇 school of comput...
3 篇 school of comput...
2 篇 univ sci & techn...
2 篇 huazhong univ sc...
2 篇 department of co...
2 篇 univ adelaide sc...
2 篇 school of comput...
2 篇 univ technol syd...
2 篇 department of co...
2 篇 school of manage...
2 篇 sharif universit...
2 篇 school of comput...
2 篇 lab. com. phys. ...
2 篇 natl univ def te...
2 篇 school of comput...

作者

4 篇 xicheng lu
4 篇 aaron harwood
4 篇 nong xiao
3 篇 shietung peng
3 篇 hong chen
3 篇 rui chu
3 篇 wenhong wei
3 篇 yongxuan lai
3 篇 huanguo zhang
3 篇 engelmann christ...
3 篇 gerald kunzmann
3 篇 wenjun xiao
2 篇 nandi asoke k.
2 篇 xing-ming li
2 篇 choi k.
2 篇 ling zhang
2 篇 wu cheng
2 篇 lo re giuseppe
2 篇 kodama eiichiro
2 篇 brzezinski krzys...

语言

620 篇 英文

检索条件"任意字段=IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2007"

共 620 条记录，以下是411-420 订阅

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

详细简洁

排序：

Comparative evaluation of the non-contiguous processor allocation strategies based on a real workload and a stochastic workload on multicomputers

Comparative evaluation of the non-contiguous processor alloc...

引用

international conference on parallel and distributed Systems (ICPADS)

作者： S. Bani-Mohammad M. Ould-Khaoua I. Ababneh Lewis M. Mackenzie Computing Science Glasgow University Glasgow UK Computing Science Al al-Bayt University Mafraq Jordan

The performance study of the existing noncontiguous processor allocation strategies has been traditionally carried out by means of simulation based on a stochastic workload model to generate a stream of incoming jobs that are submitted to and run on a given message passing parallel machine for a period of time. To validate the performance of the existing allocation algorithms, there has been need to evaluate the algorithms' performance based on a real workload trace. In this study, we evaluate the performance of several well-known processor allocation and job scheduling strategies based on a real workload trace and compare the results against those obtained from using a stochastic workload. Our results reveal that the conclusions reached on the relative performance merits of the allocation strategies when a real workload trace is used are in general compatible with those obtained when a stochastic workload is used.

关键词： Stochastic processes Concurrent computing Processor scheduling parallel machines Exponential distribution Computational modeling Message passing Network topology Multiprocessor interconnection networks Shape

来源：评论

学校读者我要写书评

暂无评论

A Quick Algorithm for computing Core Based on the Positive Region

A Quick Algorithm for Computing Core Based on the Positive R...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Wei-Dong Cai Zhang-Yan Xu Wei Song Bing-Ru Yang School of Information Engineering University of Science and Technology Beijing Beijing China School of Information Science and Engineering University of Ji'nan Jinan China Department of computer Guangxi Normal University Guilin China

Some scholars provided the discernibility matrix based on the positive region. The time complexity of the algorithm for computing core with this discernibility matrix is O(|CparU| 2 ). For cutting down the time complexity of the algorithm, the definition of simplified discernibility matrix based on the positive region and the corresponding definition of the core are provided. At the same time, it is proved that this core is equivalent to the core based on the positive region. Since the partition of U/C is the key process for computing simplified discernibility matrix, a quick algorithm for computing U/C is designed with the idea of radix sorting. Its time complexity is O(|CparU|). On this condition, a new algorithm for computing core based on the positive region is designed with the simplified discernibility. Its time complexity is cut down to max{O(|CparU' pos parU/C|), O(|CparU|)}.

关键词： Partitioning algorithms Decision making Artificial intelligence distributed computing Partial response channels Algorithm design and analysis Computer networks Concurrent computing Sorting Set theory

来源：评论

学校读者我要写书评

暂无评论

A (t, n)-Threshold Verified Multi-secret Sharing Scheme Based on ECDLP

A (t, n)-Threshold Verified Multi-secret Sharing Scheme Base...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Ruanhua Shi Hong Zhong Liusheng Huang Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei China Department of Computer Science and Technology University of Science and Technology Hefei China

In this article, we propose a (t,n) threshold verifiable multi-secret sharing scheme, in which to reconstruct t secrets needs to solve t simultaneous equations. The analysis results show that our scheme is as easy as Yang's scheme [8] in the secret reconstruction and requires less public values than Chien's [7] and Yang's schemes. Furthermore, the shares in our scheme can be verified their validity with t public values based on ECDLP, and there are two verified forms: one is computationally secure as Feldman 's scheme [12] and other is unconditionally secure as Pedersen's scheme [13]. In addition, for the main computation: a i,1 P 1 + a i,2 P 2 + hellip + a i,t P t in our scheme, we present a new method based on the signed factorial expansion and implement it, the results show that it is more efficient than the current public methods. Thus our scheme is a secure and efficient (t,n) threshold verified multi-secret sharing scheme.

关键词： Elliptic curve cryptography Equations Artificial intelligence distributed computing Elliptic curves Public key cryptography Software engineering Laboratories Intelligent networks Computer networks

来源：评论

学校读者我要写书评

暂无评论

Spaces: Support for Decoupled Communication in Wide-Area parallel Applications

Spaces: Support for Decoupled Communication in Wide-Area Par...

引用

international conference on Grid and Cooperative computing (GCC)

作者： Philip Chan David Abramson MESSAGE Laboratory Faculty of Information Technology Monash University Caulfield VIC Australia

Wide-area distributed systems like computational grids are emergent infrastructures for high-performance parallel applications. On these systems, communication mechanisms have to deal with many issues, including: private networks, heterogeneity, dynamic resource availability, and transient link failures. To address this, we present pi-spaces, a shared space abstraction of typed pipe objects. These objects, called pi-channels, are asynchronous pipes that combine streaming and persistence for efficient communication while supporting spatial and temporal decoupling. This feature allows pi-channels to be written even in the absence (or failure) of the reader. In this paper, we present the design of pi-Space runtime system and provide some throughput evaluation results with our experimental prototype.

关键词： Grid computing Concurrent computing distributed computing Telecommunication network reliability Delay Bandwidth Laboratories Information technology Australia Availability

来源：评论

学校读者我要写书评

暂无评论

Multi-view Face Detection Based on the Enhanced AdaBoost Using Walsh Features

Multi-view Face Detection Based on the Enhanced AdaBoost Usi...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Yunyang Yan Zhibo Guo Jingyu Yang Department of Computer Engineer Huaiyin Institute of Technology Huaian Jiangsu China School of Computer Science and Technology Nanjing University of Science and Technology of PLA Nanjing Jiangsu China

A novel face detection algorithm is proposed in this paper to improve the training speed and detection performance. Firstly, we used Walsh features instead of Haar-like features in the AdaBoost algorithm. Walsh features have less redundancy than Haar-like features due to its orthogonal specialty. Then, we defined a kind of week classifiers with dual-threshold to speedup training process and increase accuracy. Furthermore, during training, dual-threshold of every classifier is adoptively adjusted to separate the face and non-face as far as possible. Experimental results on MIT+CMU frontal face set and CMU profile face set demonstrated that the proposed technique can achieve better results on the detection speed and accuracy than the corresponding method.

关键词： Face detection Detectors distributed computing Solid modeling Deformable models Software engineering Artificial intelligence Computer science Computer networks Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Efficient Modular Exponentiation with Three-Moduli (2^{n}±1,2^{n}+3)

Efficient Modular Exponentiation with Three-Moduli (2^{n}±1...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Bangju Wang Huanguo Zhang Yuhua Wang School of Computer Wuhan University of China Wuhan China

Modular exponentiation is the basic computation for most public key cryptosystems and digital signal processing. A new signed binary representation (SBR) of operand is presented, which has less weight than NAF when modulus is one of moduli (2 n plusmn1,2 n +3). The speed of modular squaring with three-moduli (2 n plusmn1,2 n +3) can be improved using the new SBR by reducing partial products and carries. Based on the result, the speed of computation of modular exponentiation using the new SBR may double that of NAF method for some exponents. According to theoretical analyses and experiment comparing to the other methods mentioned in this paper, the new SBR could improve the speed of modular exponentiation efficiently. Moreover, the SBR of integer can be widely used in secure communication and DSP system.

关键词： Arithmetic distributed computing Digital signal processing Computer networks Concurrent computing Public key cryptography Signal processing algorithms Algorithm design and analysis Software engineering Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A New Data Protecting Scheme Based on TPM

A New Data Protecting Scheme Based on TPM

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Mingdi Xu Jian He Bo Zhang Huanguo Zhang School of Computer State Key Laboratory of Software Engineering Wuhan University of China China Informationization Construction Teaching and Research Section Commanding Communications Academy Computer Faculty Working Office Electronic Information Department Hubei Water Resource Technical College

Trusted platform model (TPM) is special-purpose integrated circuits built into a variety of platforms to enable strong user authentication and machine attestation-essential to prevent inappropriate access to confidential and sensitive information and to protect against compromised networks. As a necessary component for multifarious platforms, storage device keeps on a mass of data including confidential and secretive information. How to ensure data not to be accessed by unauthorized users effectively, and to guarantee information to be in safe and secure state? Aiming at these problems, we put forward a novel scheme for protecting data on personal computer platform. By combing trusted computing platform, we propose a secure and reliable model for user authentication and data encryption. The model uses storage protocol to establish a password system to encrypt data, and uses TPM to authenticate different users. We also implement this model by adding it into trusted computing platform. The enhanced platform can not only encrypt data per sector drastically, but also exclude those who can't be authenticated. Some external software attacks and physical theft also cut no ice.

关键词： Protection Data security Cryptography Secure storage distributed computing Protocols Software engineering Computer networks Concurrent computing Authentication

来源：评论

学校读者我要写书评

暂无评论

Privacy Preserving Set Intersection Protocol Secure against Malicious Behaviors

Privacy Preserving Set Intersection Protocol Secure against ...

引用

IEEE international conference on parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Yingpeng Sang Hong Shen School of Computer Science University of Adelaide Adelaide SA Australia

When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper, we address the privacy preserving set intersection (PPSI) problem, in which each of the N parties learns no elements other than the intersection of their N private datasets. We propose an efficient protocol in the malicious model, where the adversary may control arbitrary number of parties and execute the protocol for its own benefit. A related work in [12] has a correctness probability of ( v;1)ldquo (f is the size of the encryption scheme's plaintext space), a computation complexity of' 0(N2 S2lgf) (S is the size of each party's data set). Our PPSI protocol in the malicious model has a correctness probability iquest/C a/-1)JV~1 plusmnmiddotd achieves a computation cost of 0{c2S2lgM) (c is the number of malicious parties and c < N eurordquo I).

关键词： Polynomials Cryptographic protocols Data privacy Neural networks Costs Computational efficiency Security Circuits Positron emission tomography distributed computing

来源：评论

学校读者我要写书评

暂无评论

Scheduling Divisible Loads on Bus networks with Start-Up Costs by Utilizing Multiple Data Transfer Streams: PORI

Scheduling Divisible Loads on Bus Networks with Start-Up Cos...

引用

international conference on parallel Processing (ICPP)

作者： Jie Hu Raymond Klefstad Department of Electrical Engineering and Computer Science University of California Irvine CA USA

The problem of scheduling divisible loads on a distributed bus network with start-up costs is considered. In this paper, we present a novel algorithm to obtain one-round installment load distribution solutions by utilizing multiple data transfer streams. We demonstrate how our proposed algorithm works by means of multiple illustrative examples. We compare the makespan generated by our proposed algorithm with the others in difference cases. We conclude that our proposed algorithm can generate better makespans than others. The analysis provides deeper understanding of scheduling divisible loads in the more realistic model, which will allow us to design more efficient algorithms.

关键词： Costs Processor scheduling distributed computing Grid computing Load modeling Scheduling algorithm Clustering algorithms Algorithm design and analysis Concurrent computing Computational modeling

来源：评论

学校读者我要写书评

暂无评论

An Efficient Hybrid P2P Incentive Scheme

An Efficient Hybrid P2P Incentive Scheme

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Zhitao Guan Muhammad Hanif Durad Yuanda Cao Liehuang Zhu School of Computer Science and Technology Beijing Institute of Technology China School of Software Beijing Institute of Technology China

P2P systems have suffered a lot from free riding problem i.e. some participants consume more resources than they contribute. In order to deal with this problem efficiently, an incentive model based on peer credit has been proposed. Each peer in this model is a credit entity. Through introducing reward method to the model, peers will allocate resources according to the credits of requesting peers to maximize their own credits. A backtracking algorithm has been suggested to solve the issue of maximizing credit rewards. To avoid inflation of the credit, attenuation method is introduced. The scheme how to apply the credit model in hybrid P2P networks has also been elaborated in this work. The experimental results show that the model can effectively control free riding and improve efficiency of the system.

关键词： Incentive schemes Feedback Peer to peer computing Software engineering Artificial intelligence distributed computing Computer science Resource management Attenuation Game theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共62页 << < 38 39 40 41 42 43 44 45 46 47 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：