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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,699 篇 会议
48 册 图书
25 篇 期刊文献

馆藏范围

1,772 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,366 篇 工学
- 1,236 篇 计算机科学与技术...
- 550 篇 软件工程
- 241 篇 信息与通信工程
- 219 篇 电气工程
- 74 篇 控制科学与工程
- 50 篇 电子科学与技术（可...
- 43 篇 生物工程
- 34 篇 机械工程
- 26 篇 动力工程及工程热...
- 22 篇 仪器科学与技术
- 21 篇 力学（可授工学、理...
- 20 篇 建筑学
- 19 篇 土木工程
- 18 篇 生物医学工程（可授...
- 15 篇 材料科学与工程（可...
- 15 篇 安全科学与工程
- 14 篇 化学工程与技术
- 13 篇 石油与天然气工程
329 篇 理学
- 227 篇 数学
- 55 篇 物理学
- 51 篇 生物学
- 29 篇 系统科学
- 28 篇 统计学（可授理学、...
- 20 篇 化学
213 篇 管理学
- 157 篇 管理科学与工程(可...
- 66 篇 图书情报与档案管...
- 49 篇 工商管理
71 篇 医学
- 62 篇 临床医学
15 篇 法学
- 13 篇 社会学
14 篇 经济学
- 14 篇 应用经济学
9 篇 文学
8 篇 教育学
6 篇 农学
1 篇 军事学

主题

109 篇 distributed comp...
79 篇 parallel process...
76 篇 distributed comp...
62 篇 cloud computing
51 篇 parallel computi...
44 篇 computational mo...
41 篇 parallel program...
39 篇 computer archite...
35 篇 distributed data...
34 篇 fault tolerance
29 篇 concurrent compu...
29 篇 middleware
28 篇 parallel algorit...
28 篇 mapreduce
28 篇 parallel process...
26 篇 resource managem...
25 篇 application soft...
25 篇 big data
24 篇 wireless sensor ...
24 篇 protocols

机构

14 篇 saint petersburg...
7 篇 chinese acad sci...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
5 篇 plekhanov russia...
4 篇 saint petersburg...
4 篇 harbin inst tech...
4 篇 meshcheryakov la...
4 篇 centre for distr...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 st petersburg st...
4 篇 science and tech...
3 篇 huazhong univ sc...
3 篇 joint institute ...
3 篇 king saud univer...
3 篇 department of co...
3 篇 university of el...

作者

17 篇 zomaya albert y.
11 篇 shen hong
10 篇 bogdanov alexand...
9 篇 korkhov vladimir
8 篇 degtyarev alexan...
8 篇 albert y. zomaya
6 篇 li y
6 篇 taheri javid
5 篇 dustdar schahram
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 kutovskiy nikola...
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 sousa leonel
5 篇 gankevich ivan
5 篇 rothermel kurt
4 篇 jerzy waśniewski
4 篇 leung k.

语言

1,731 篇 英文
18 篇 中文
15 篇 其他
9 篇 俄文

检索条件"任意字段=9th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1772 条记录，以下是691-700 订阅

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

详细简洁

排序：

Exploring Molecular distributed Detection

Exploring Molecular Distributed Detection

引用

IEEE international conference on Nano/Molecular Medicine and Engineering

作者： Uri Rogers Min-Sung Koh School of Computing and Engineering Sciences Eastern Washington University Cheney WA 99004

ISBN: (纸本)9781467396738

Chemical-exchange provides a fundamental mechanism by which microorganisms and biological cells communicate. Using this concept and the idea of biological sized nanomachines, this paper explores the detection of a undesired biological agent in a distributed setting. distributed in the sense that the system information is dispersed across the nanomachines, each possessing limited communication capabilities. To study this problem, the molecular distributed detection system is divided into four major components. the first is the biological agent itself. the second is a collection of autonomous nano-sized sensors, capable of observing the environment, and releasing a certain type of communication molecule directly related to that observation. the third is an aqueous molecular transmission channel under drift, modeled using Brownian motion. the fourth is a fusion stage that collects the communication molecules and fuses this information to determine if a biological agent is present or not. Using this framework, we explore biological agent detection performance using optimal and suboptimal fusion rules in a parallel topology for diverse potential applications.

关键词： Brownian Motion Molecular Communication Molecular distributed Detection

来源：评论

学校读者我要写书评

暂无评论

NNB: An efficient nearest neighbor search method for hierarchical clustering on large datasets

NNB: An efficient nearest neighbor search method for hierarc...

引用

international conference on Semantic computing

作者： Wei Zhang Gongxuan Zhang Yongli Wang Zhaomeng Zhu Tao Li School of Computer Science and Technology Huaiyin Normal University Huaian China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China

ISBN: (纸本)9781479979363

Nearest neighbor search is a key technique used in hierarchical clustering. the time complexity of standard agglomerative hierarchical clustering is O(n 3 ), while the time complexity of more advanced hierarchical clustering algorithms (such as nearest neighbor chain) is O(n 2 ). this paper presents a new nearest neighbor search method called nearest neighbor boundary(NNB), which first divides a large dataset into independent subsets and then finds nearest neighbor of each point in the subsets. When NNB is used, the time complexity of hierarchical clustering can be reduced to O(n log 2 n). Based on NNB, we propose a fast hierarchical clustering algorithm called nearest-neighbor boundary clustering(NBC), and the proposed algorithm can also be adapted to the parallel and distributed computing frameworks. the experimental results demonstrate that our proposal algorithm is practical for large datasets.

关键词： Hierarchical clustering MapReduce nearest neighbor boundary parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Scaling HabaneroUPC++ on Heterogeneous Supercomputers

Scaling HabaneroUPC++ on Heterogeneous Supercomputers

引用

international conference on Partitioned Global Address Space Programming Models (PGAS)

作者： Vivek Kumar Max Grossman Hongzhang Shan Vivek Sarkar Rice University Lawrence Berkeley National Laboratory

Accelerators/co-processors have made their way into supercomputing systems. these modern heterogeneous systems feature multiple layers of memory hierarchies, and produce a high degree of thread-level parallelism. To ensure that current and future applications perform well on these systems, it is important that users be able to cleanly express the various types of parallelism found in their applications while trusting that expertly-implemented runtime libraries will schedule this parallelism in a way that efficiently utilizes the memory hierarchies and computational resources of their system. In this poster we present our work-in-progress, a distributed, heterogeneous programming model in HabaneroUPC++, which aims to target distributed, heterogeneous systems with multi-layered memory hierarchies through a distributed data-driven programming model that integrates all memory layers together through data-flow programming.

关键词： Programming Computational modeling Electronics packaging Graphics processing units Yttrium Supercomputers parallel processing

来源：评论

学校读者我要写书评

暂无评论

Large Scale distributed Localization Based on RSS and Mass-Spring Model

Large Scale Distributed Localization Based on RSS and Mass-S...

引用

international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Bart Praats Rafael Berkvens Glenn Ergeerts Maarten Weyn MOSAIC FTI University of Antwerp Antwerp Belgium

ISBN: (纸本)9781467394741

Large scale localization has gained interest in the last few years together with wireless sensor networks. applications such as a swarm of drones or a sensor network to control an environment already exist but do not cover scales up to thousands of nodes. In this paper, a method for large scale distributed localization is developed based on existing technologies including received signal strength and mass-spring model (MSM). First, we created a theoretical model based on specific indoor and outdoor tests. Based on this model, a scaled up simulation was done using an MSM-based algorithm. Using this simulation, an average error of up to 7.66 m could be achieved in a field of 100 m by 100 m.

关键词： Databases Computational modeling Wireless sensor networks Radio frequency Receiving antennas Wrist

来源：评论

学校读者我要写书评

暂无评论

An explicit integrity verification scheme for cloud distributed systems

An explicit integrity verification scheme for cloud distribu...

引用

international conference on (ISCO) Intelligent Systems and Control

作者： N. Shanmugakani R. Chinnaa M. E-Computer Science & Engineering KLN College of Information Technology Madurai India M.E -Pervasive Computing Technology I-Grandee Software Technologies Madurai India

Cloud computing encourages the prototype for data service outsourcing, where data owners can avoid cost usage by storing their data in cloud storage centers. the ultimate problem of cloud computing technology is that, the service providers have to protect the user data and services. Secured systems should consider Confidentiality, Availability and Integrity as their primary option. the user encrypts their information to achieve the first one. the second one is achieved in convenient deployment scheme. Last but not the least is integrity. To provide integrity, lots of techniques were discovered, but still the goal is not achieved. In this paper, we propose a novel scheme to achieve integrity goals and we explore how to ensure the integrity and correctness of data storage in cloud computing. the Unique feature of this scheme is finding out which data portion is modified or attacked by the malicious user. In our scheme, there is no need for third-party authority (TPA) and cloud service provider communication in verification. Compared with the existing scheme, it takes the advantage of huge data support and high performance with a simple and easily approachable technique.

关键词： Cryptography Computers Servers Instruments distributed databases Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Two Class Fisher's Linear Discriminant Analysis Using MapReduce

Two Class Fisher's Linear Discriminant Analysis Using MapRed...

引用

international conference on Computer Modeling and Simulation, UKSIM

作者： Prajesh P. Anchalia Kaushik Roy Kunal Roy Department Of CSE R V College Of Engineering Bangalore India Department Of CSE Global Academy of Technology Bangalore India

ISBN: (纸本)9781479987146

Information explosion propelled by the exponential growth in digitised data is an unstoppable reality. To be able to extract relevant and useful knowledge from this voluminous data in order to make well-informed decision is a competitive advantage in the information age. However, the attempts to transform raw data into valuable knowledge face both data and computational intensive challenges. As a result, parallel and distributed computing is often strongly sought after to alleviate these challenges. While there are many distributed computing technologies being proposed over the years, MapReduce has gained an immense amount of interest in recent years due to its simplicity and superb scalability at low cost. In this paper we implement the fisher linear discriminant technique to reduce dimensionality and remove the so-called "noisy" data values from a given data set and project the data values in the direction of largest variance. Few of Fisher linear discriminant analysis' applications are Life Sciences, Face Recognition, Music and Speech classification. We implement the Fisher Linear Discriminant on a distributed computing environment and we conclude that it outperforms the sequential implementation.

关键词： Data mining distributed databases Data models Algorithm design and analysis Support vector machines Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Unraveling the security puzzle: A distributed framework to build trust in FPGAs 9th

Unraveling the security puzzle: A distributed framework to b...

引用

9th international conference on Network and System Security, NSS 2015

作者： Shila, Devu Manikantan Venugopalan, Vivek Patterson, Cameron D. United Technologies Research Center 411 Silver Lane E HartfordCT United States Bradley Department of ECE Virginia Tech BlacksburgVA United States

ISBN: (纸本)9783319256443

Extensive use of third party IP cores (e.g., HDL, netlist) and open source tools in the FPGA application design and development process in conjunction with the inadequate bitstream protection measures have raised crucial security concerns in the past for reconfigurable hardware systems. Designing high fidelity and secure methodologies for FPGAs are still infancy and in particular, there are almost no concrete methods/techniques that can ensure trust in FPGA applications not entirely designed and/or developed in a trusted environment. this work strongly suggests the need for an anomaly detection capability within the FPGAs that can continuously monitor the behavior of the underlying FPGA IP cores and the communication activities of IP cores with other IP cores or peripherals for any abnormalities. To capture this need, we propose a technique called FIDelity Enhancing Security (FIDES) methodology for FPGAs that uses a combination of access control policies and behavior learning techniques for anomaly detection. FIDES essentially comprises of two components: (i) Trusted Wrappers, a layer of monitors with sensing capabilities distributed across the FPGA fabric;these wrappers embed the output of each IP core i with a tag τi according to the pre-defined security policy Π and also verifies the embeddings of each input to the IP core to detect any violation of policies. the use of tagging and tracking enables us to capture the normal interactions of each IP core with its environment (e.g., other IP cores, memory, OS or I/O ports). Trusted Wrappers also monitors the statistical properties exhibited by each IP core module on execution such as power consumption, number of clock cycles and timing variations to detect any anomalous operations;(ii) a Trusted Anchor that monitors the communication between the IP cores and the peripherals with regard to the centralized security policies Ψ as well as the statistical properties produced by the peripherals. To thwart an adversary from

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Adaptation of technology MPI and OpenMP to search for the generators polynomials 9

Adaptation of technology MPI and OpenMP to search for the ge...

引用

9th international Forum on Strategic Technology (IFOST)

作者： Evgeniy, Mytsko Andrey, Malchukov FSAEI HE NR Tomsk Polytech Univ Dept Comp Engn Tomsk Russia

ISBN: (纸本)9781479960620

the paper describes the usage of technologies of parallel and distributed computing OpenMP and MPI to find generator polynomials which is quite a tedious task. the description of the generator polynomials search algorithm which are constructed on the basis of codes more efficient than codes Bose-Chaudhuri - Hocquenghem. the algorithm of generator polynomials search was considered and analyzed in terms of the possibility of using technologies of parallel and distributed computing. the computer program of the generator polynomials search with the technology of parallel and distributed computing OpenMP and MPI was described. As input parameters, the values of : m - length of the information block of messages and t - the multiplicity of correctable errors. Computer experiment was delivered to compare the performance of software implementations with and without the application of the above technologies. Results supplied by the computer experiment to study the performance of sequential and parallelized implementations of the generator polynomials search algorithm showed that the use of technology in conjunction with MPI and OpenMP greatly accelerates generator polynomials search. thus, using 20 cores of Intel XEON 5150 processor for averaging the acceleration input parameters studied (m from 8 to 24, and t = 4) was 2231 %.

关键词： generator polynomial distributed computing search algorithm error-correcting code cores supercomputer

来源：评论

学校读者我要写书评

暂无评论

HYPERGRAPH MODEL OF HIERARCHICAL CLIENT-SERVER ARCHITECTURE FOR distributed computing

HYPERGRAPH MODEL OF HIERARCHICAL CLIENT-SERVER ARCHITECTURE ...

引用

international conference on Application of Information and Communication technologies

作者： V.M. Glushan P.V. Lavrik M.V. Rybalchenko South Federal University (SGU) Taganrog Russia

ISBN: (纸本)9781467368575

the work offers to use distributed computing on client-server architecture to solve high dimensional tasks. VLSI topological layout design problem is employed as a high dimensional task. Simulation modelling shows that the hierarchical architecture allows reducing the design time by an order of magnitude compared to parallel-serial client-server architecture.

关键词： Client-server architecture hypergraph simulation model distributed computing

来源：评论

学校读者我要写书评

暂无评论

High performance CDR processing with MapReduce

High performance CDR processing with MapReduce

引用

international conference on Telecommunication Systems, Services, and applications (TSSA)

作者： Mulya Agung A. Imam Kistijantoro School of Electrical Engineering and Informatics Institut Teknologi Bandung Indonesia

A Call Detail Record (CDR) is a data record produced by telecommunication equipment consisting of detail of call transaction logs. It contains valuable information for many purposes of several domains such as billing, fraud detection and analytical purposes. However, in the real world, these needs face a big data challenge. Billions CDRs are generated every day and the processing systems are expected to deliver results in a timely manner. In our case, the system also has constraint that is running in limited computation resources. We found that our current production system was not enough to meet these needs. We had successfully analyzed the current system bottleneck and found the root cause. Based on this analysis, we designed and implemented a better performance system which is based on MapReduce and running on Hadoop cluster. this paper presents the analysis of previous system and the design and implementation of new system, called MS2. In this paper, we also provide empirical evidence demonstrating the efficiency and linearity of MS2. In a test case of telecommunication mediation system, our test has shown that MS2 reduces overhead by 44% and speedup performance by nearly twice compared to previous system. From benchmarking with several related technologies in large scale data processing, MS2 is also shown to perform better in case of CDR batch processing. Running on a cluster consists of eight core CPU and two conventional disks, MS2 is able to process 67,000 CDRs/second.

关键词： Mediation Java Message systems parallel processing Servers Containers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共178页 << < 66 67 68 69 70 71 72 73 74 75 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：