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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

639 篇 会议
12 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

519 篇 工学
- 494 篇 计算机科学与技术...
- 349 篇 软件工程
- 94 篇 信息与通信工程
- 45 篇 电气工程
- 42 篇 控制科学与工程
- 18 篇 电子科学与技术（可...
- 8 篇 机械工程
- 8 篇 生物工程
- 6 篇 动力工程及工程热...
- 6 篇 生物医学工程（可授...
- 4 篇 仪器科学与技术
- 4 篇 建筑学
- 4 篇 测绘科学与技术
- 4 篇 安全科学与工程
- 3 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 光学工程
118 篇 理学
- 92 篇 数学
- 15 篇 统计学（可授理学、...
- 12 篇 物理学
- 11 篇 生物学
- 6 篇 系统科学
- 4 篇 化学
- 2 篇 大气科学
- 2 篇 地质学
68 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 工商管理
- 20 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 医学
1 篇 农学

主题

45 篇 distributed comp...
32 篇 parallel process...
26 篇 distributed comp...
24 篇 parallel computi...
17 篇 optimization
15 篇 parallel process...
14 篇 cloud computing
13 篇 parallel program...
12 篇 gpu
11 篇 distributed syst...
10 篇 parallel algorit...
10 篇 fault tolerance
9 篇 big data
9 篇 resource managem...
9 篇 data mining
9 篇 protocols
9 篇 distributed data...
8 篇 computational mo...
8 篇 high performance...
8 篇 scheduling

机构

7 篇 kyoto inst techn...
5 篇 univ comp studie...
4 篇 kyoto inst techn...
4 篇 college of compu...
3 篇 kyoto inst techn...
3 篇 natl taipei univ...
3 篇 kyoto coll grad ...
3 篇 chinese acad sci...
3 篇 natl univ def te...
3 篇 chulalongkorn un...
3 篇 science and tech...
2 篇 vienna universit...
2 篇 a*star institute...
2 篇 soochow univ sch...
2 篇 natl taipei univ...
2 篇 univ puerto rico...
2 篇 tu münchen garch...
2 篇 fukuoka inst tec...
2 篇 department of co...
2 篇 washington univ ...

作者

5 篇 hochin teruhisa
5 篇 toporkov victor
5 篇 yemelyanov dmitr...
4 篇 nomiya hiroki
4 篇 gonzalez teofilo...
3 篇 cong guojing
3 篇 michael alexande...
3 篇 kawamura takao
3 篇 chang yang-lang
3 篇 senivongse twitt...
3 篇 alexandru costan
3 篇 liu jie
3 篇 shibayama kiyosh...
3 篇 hirata hiroaki
3 篇 stephen l. scott
3 篇 nunome atsushi
3 篇 sugahara kazunor...
3 篇 xiaorong li
3 篇 mario cannataro
3 篇 sha edwin h.-m.

语言

640 篇 英文
20 篇 其他

检索条件"任意字段=18th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 660 条记录，以下是371-380 订阅

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

详细简洁

排序：

High speed eigenvalue solver on the Cell cluster system for controlling nuclear fusion plasma

High speed eigenvalue solver on the Cell cluster system for ...

引用

18th Euromicro international conference on parallel, distributed and Network-Based Processing (PDP)

作者： Kushdia, Noriyuki Takemiya, Hiroshi Tokuda, Shinji Japan Atom Energy Agcy Ctr Computat Sci & E Syst Tokyo Japan Japan Atom Energy Agcy Div Adv Plasma Res Ibaraki Japan

ISBN: (纸本)9780769539393

In this study, we developed a high speed eigenvalue solver that is the necessity of plasma stability analysis system for international thermo-nuclear Experimental Reactor (ITER) on Cell cluster system. Our stability analysis system is developed in order to prevent damages to the ITER from plasma disruption. MARG2D, which is the main part of the system, analyzes the state of plasma with the measured conditions instantaneously. According to our estimation, the most time consuming part of MARG2D is eigensolver and we must solve resulted eigensystem whose dimension is hundred thousand within a second. However, current massively parallel processor (MPP) type supercomputer is not applicable for such instantaneous calculation, because the overhead of network communication becomes dominant. therefore, we employ Cell cluster system, whose processor has higher performance than MPP's, because we can obtain sufficient processing power with small number of processors. Furthermore, we developed novel eigenvalue solver with the consideration of hierarchical architecture of Cell cluster: Inter processor, intra processor, and SIMD parallelism. Finally, we succeeded to solve the block tridiagonal Hermitian matrix, which had 1024 diagonal blocks and the size of each block was 128 x 128 within a second.

关键词： PowerXCell8i Cell cluster Eigensolver Preconditioned Conjugate Gradient Method parallel computing Plasma stability analysis

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Localization Strategy for Island Model Genetic Algorithm 18

Performance Analysis of Localization Strategy for Island Mod...

引用

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

作者： Gozali, Alfian Akbar Fujimura, Shigeru Waseda Univ Grad Sch IPS Wakamatsu Ku Fukuoka 8080135 Japan

ISBN: (纸本)9781509055043

Genetic algorithm (GA) is one of the standard solutions to solve many optimization problems. One of a GA type used for solving a case is island model GA (IMGA). Localization strategy is a brand-new feature for IMGA to better preserves its diversity. In the previous research, localization strategy could carry out 3SAT problem almost perfectly. In this study, the proposed feature is aimed to solve real parameter single objective computationally expensive optimization problems. Differ with an issue in previous research which has a prior knowledge and binary, the computationally expensive optimization has not any prior knowledge and floating type problem. therefore, the localization strategy and its GA cores must adapt. the primary goal of this research is to analyze further the localization strategy for IMGA's performance. the experiments show that the new feature is successfully modified to meet the new requirement. Localization strategy for IMGA can solve all computationally expensive functions consistently. Moreover, this new feature could make IMGA reaches leading ratio 0.47 among other current solvers.

关键词： genetic algorithms island model genetic algorithm localization strategy computationally expensive optimization

来源：评论

学校读者我要写书评

暂无评论

A Modification of Retake Detection Using Simple Signature and LCS Algorithm 18

A Modification of Retake Detection Using Simple Signature an...

引用

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

作者： Putpuek, Narongsak Cooharojananone, Nagul Satoh, Shin'ichi Rajabhat Rajanagarindra Univ Fac Sci & Technol Dept Informat Technol Chachoengsao 24000 Thailand Chulalongkorn Univ Fac Sci Dept Math & Comp Sci Bangkok 10330 Thailand Natl Inst Informat Chiyoda Ku 2-1-2 Hitotsubashi Tokyo 1018430 Japan

ISBN: (纸本)9781509055043

Rushes videos consist of two types of content: the useless content and the redundant content (retakes). then, automatic retake detection is more challenging due to the difficulty of eliminating repetitive takes, that are usually have different lengths and motion patterns. To overcome this challenge, previous approaches represent video segments using a longer string which is converted from SIFT matching, or a combination of different features. However, these require a large computational time and do not assist in improving a performance. In this work, we introduce a simple signature (global feature) to represent video segments because of its simplicity and effectiveness. the similarity between each pair of signature sequences was determined by using the Longest Common Subsequence algorithm (LCS). A simple retake detection was then used to detect a retake. this proposed was applied to the TRECVID BBC Rushed 2007 and 2008. the results showed that using a simple signature provides a high degree of accuracy, and reduces a computation time in feature extraction and LCS matching.

关键词： Rushes video Simple signature LCS Retake detection

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Delayed-Committing Transactional Memory 18

Performance Evaluation of Delayed-Committing Transactional M...

引用

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

作者： Ichii, Sekai Hayashi, Shohei Nunome, Atsushi Hirata, Hiroaki Shibayama, Kiyoshi Kyoto Inst Technol Grad Sch Informat Sci Kyoto Japan Kyoto Inst Technol Fac Informat & Human Sci Kyoto Japan Fujitsu Corp Ltd Tokyo Japan Kyoto Coll Grad Studies Informat Kyoto Japan

ISBN: (纸本)9781509055043

Transactional memory (TM) is promising to make parallel programming easier. Many hardware implementations of transactional memory (HTM) have been proposed to improve the performance, but they still suffer from some overheads when a transaction either commits or aborts. So we have been developing a novel new HTM design, called Delayed-Committing TM (DCTM), which enables transactions of arbitrary size to commit or abort in a fixed number of cycles-typically, one. In this paper, we analyze the performance of our DCTM system in detail. Simulation results show that the performance of our DCTM system is as much as 35.7% better than the performance of a conventional HTM system, which has almost no overhead when a transaction aborts but detects conflict and publishes speculatively modified data when a transaction commits. Furthermore, we can expect to improve performance more by increasing the bandwidth of the common bus connecting processing nodes with each other.

关键词： hardware transactional memory cache coherency shared-memory multiprocessor parallel architecture

来源：评论

学校读者我要写书评

暂无评论

A new lower bound of privacy budget for distributed differential privacy 18

A new lower bound of privacy budget for distributed differen...

引用

18th international conference on parallel and distributed computing, Applications and Technologies, PDCAT 2017

作者： Shen, Hong Lu, Zhigang School of Computer Science University of Adelaide Adelaide Australia School of Data and Computer Science Sun Yat-sen University Guangzhou China

ISBN: (纸本)9781538631515

distributed data aggregation via summation (counting) helped us to learn the insights behind the raw data. However, such computing suffered from a high privacy risk of malicious collusion attacks. that is, the colluding adversaries infer a victim's privacy from the gaps between the aggregation outputs and their source data. Among the solutions against such collusion attacks, distributed Differential Privacy (DDP) shows a significant effect of privacy preservation. Specifically, a DDP scheme guarantees the global differential privacy (the presence or absence of any data curator barely impacts the aggregation outputs) by ensuring local differential privacy at the end of each data curator. To guarantee an overall privacy performance of a distributed data aggregation system against malicious collusion attacks, part of the existing work on such DDP scheme aim to provide an estimated lower bound of privacy budget for the global differential privacy. However, there are two main problems: low data utility from using a large global function sensitivity;unknown privacy guarantee when the aggregation sensitivity of the whole system is less than the sum of the data curator's aggregation sensitivity. To address these problems while ensuring distributed differential privacy, we provide a new lower bound of privacy budget, which works with an unconditional aggregation sensitivity of the whole distributed system. Moreover, we study the performance of our privacy bound in different scenarios of data updates. Both theoretical and experimental evaluations show that our privacy bound offers better global privacy performance than the existing work. © 2017 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Data Dependency based parallel Simulation of Wireless Networks 15

Data Dependency based Parallel Simulation of Wireless Networ...

引用

18th ACM international conference on Modelling, Analysis and Simulation of Wireless and Mobile systems (MSWiM)

作者： Stoffers, Mirko Sehy, Torsten Gross, James Wehrle, Klaus Rhein Westfal TH Aachen Commun & Distributed Syst Aachen Germany KTH Royal Inst Technol Sch Elect Engn Stockholm Sweden

ISBN: (纸本)9781450337625

Simulation of wireless systems is highly complex and can only be efficient if the simulation is executed in parallel. To this end, independent events have to be identified to enable their simultaneous execution. Hence, the number of events identified as independent needs to be maximized in order to increase the level of parallelism. Traditionally, dependencies are determined only by time and location of events: If two events take place on the same simulation entity, they must be simulated in timestamp order. Our approach to overcome this limitation is to also investigate data-dependencies between events. this enables event reordering and parallelization even for events at the same simulation entity. To this end, we design the simulation language PSimLa, which aids this process. In this paper, we discuss the PSimLa design and compiler as well as our data-dependency analysis approach in detail and present case studies of wireless network models, speeded up by a factor of 10 on 12 cores where time-based parallelization only achieves a 1.6x speedup.

关键词： parallel simulation Static code analysis Data dependencies

来源：评论

学校读者我要写书评

暂无评论

Price Evaluation Model in Second-hand Car System based on BP Neural Network theory 18

Price Evaluation Model in Second-hand Car System based on BP...

引用

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

作者： Sun, Ning Bai, Hongxi Geng, Yuxia Shi, Huizhu Hohai Univ Dept IoT Engn Changzhou Peoples R China

ISBN: (纸本)9781509055043

With the rapid growth of the number of private cars and the development of the second-hand car market, second-hand cars have become the main choice when people buy cars. the online second-hand car platform provides both buyers and sellers the chance of online P2P trade. In such systems, the accuracy of second-hand car price evaluation largely determines whether the seller and the buyer can get more efficient trading experience. In this paper, the price evaluation model based on big data analysis is proposed, which takes advantage of widely circulated vehicle data and a large number of vehicle transaction data to analyze the price data for each type of vehicles by using the optimized BP neural network algorithm. It aims to establish a second-hand car price evaluation model to get the price that best matches the car. In this paper, the optimized BP neural network algorithm is used to select the optimal number of hidden neurons in BP neural network, which improves the convergence speed of the network topology and the accuracy of the prediction model. through the sampling simulation experiments, the fitting curve of the prediction price is compared with the real transaction price derived from the optimized model. As a result, the fitting of the optimized model is better as well as the accuracy is higher.

关键词： second-hand car price evaluation BP neural network hidden neuron big data

来源：评论

学校读者我要写书评

暂无评论

A Fundamental Study on Adaptive Surrogate-assisted. Evolutionary Computation Using Rank Correlation 18

A Fundamental Study on Adaptive Surrogate-assisted. Evolutio...

引用

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

作者： Kuwahata, Yudai Kushida, Jun-ichi Ono, Satoshi Kagoshima Univ Grad Sch Sci & Engn Dept Informat Sci & Biomed Engn Kagoshima 8900065 Japan Hiroshima City Univ Grad Sch Informat Sci Dept Intelligent Syst Hiroshima 7313194 Japan

ISBN: (纸本)9781509055043

Surrogate-Assisted Evolutionary Computation (SAEC) has widely applied to approximate an objective function. However, SAEC may potentially also reduce the processing time of inexpensive optimization problems wherein solutions are evaluated within a few seconds or minutes. To achieve this, the approximation model of a fitness function should be iterated as few times as possible during optimization. this paper proposes an adaptive SAEC algorithm using the rank correlations between the actually evaluated and approximately evaluated values of the objective function. these correlations are then used to adaptively switch the approximation and actual evaluation phases, reducing the number of runs required to learn the approximation model. It was confirmed experimentally that the proposed method could successfully reduce the processing time in some benchmark functions even under inexpensive scenario.

关键词： Estimation Field programmable gate arrays OFDM Modulation Filtration Clocks Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Quality Model for Assessing Object-Oriented Design Patterns Under Development 18

Quality Model for Assessing Object-Oriented Design Patterns ...

引用

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

作者： Pattiyanon, Charnon Senivongse, Twittie Chulalongkorn Univ Fac Engn Dept Comp Engn Software Engn Program Bangkok Thailand

ISBN: (纸本)9781509055043

Object-oriented design patterns are used to solve recurring problems in the design of object-oriented software. the success of existing design patterns encourages researchers and practitioners to propose new design patterns especially for solving recurring design problems in specific domains. Assessing the quality of the design patterns being developed is an important task for a design pattern developer to determine which parts of the patterns need improvement. this paper presents a hierarchical quality model for object-oriented design patterns under development. the model focuses on two quality attributes, i.e. Embedded Knowledge and Pattern Language quality, of the object-oriented design patterns. the model relates several properties of the design pattern descriptions, i.e. usefulness, completeness, consistency, and understandability, to the two quality attributes. Four quality metrics are proposed to quantitatively measure those properties of the design pattern descriptions. In an evaluation, we obtain a satisfactory result as the proposed quality assessment model can be used to complement other existing design pattern evaluation methods.

关键词： quality model design pattern object-oriented software design quality metric quality attribute

来源：评论

学校读者我要写书评

暂无评论

A parallel random number generator for shared memory architecture machines using OpenMP

A parallel random number generator for shared memory archite...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Ahmed, Sayed Karim, Lutful Eskicioglu, Rasit Department of Computer Science University of Manitoba Canada

the fields of probability and statistics are built over the abstract concepts of probability space and random variables. this has given rise to elegant and powerful mathematical theory but exact implementation of these concepts on conventional computers seems impossible. Finding high-quality and efficient algorithms for random number generation on parallel computers is even more difficult. One of the reasons good parallel random number generators are so hard to create is that any small correlations that exist in the sequential generator may be amplified by the method used to distribute the sequence among the processors, producing stronger correlations in the subsequences on each processor. Inter-processor correlations may also be introduced. Also, the method to specify the seeds for each processor is greatly important, since any correlations between the seeds on the different processors could produce strong inter-processor correlations. However, we found the random number generator by L'Ecuyer based on the combination of four linear congruential generators is a good example for both sequential and parallel implementations. It has a large domain and inherently parallel property where each processor is assigned to generate one or more sequences independently and our parallel implementation generates the same random number sequence as the sequential implementation. We mainly present the issues related to the parallel implementation of this algorithm using a shared memory workstations with OpenMP. In the implementation, multiple virtual generators work in parallel. Our solution is scalable with the number of processors and provides locality. It also maintains all properties of its sequential implementation with significant absolute and relative speedup, and significant efficiency and iso-efficiency.

关键词： Random number generation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 34 35 36 37 38 39 40 41 42 43 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：