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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,671 篇 会议
196 篇 期刊文献
27 册 图书

馆藏范围

4,894 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,500 篇 工学
- 2,386 篇 计算机科学与技术...
- 1,468 篇 软件工程
- 420 篇 信息与通信工程
- 386 篇 电气工程
- 193 篇 控制科学与工程
- 159 篇 电子科学与技术（可...
- 75 篇 网络空间安全
- 33 篇 材料科学与工程（可...
- 33 篇 生物医学工程（可授...
- 26 篇 机械工程
- 26 篇 安全科学与工程
- 21 篇 光学工程
- 21 篇 动力工程及工程热...
- 21 篇 生物工程
- 20 篇 建筑学
- 19 篇 土木工程
- 17 篇 力学（可授工学、理...
- 17 篇 环境科学与工程（可...
- 15 篇 交通运输工程
792 篇 理学
- 669 篇 数学
- 103 篇 统计学（可授理学、...
- 89 篇 系统科学
- 66 篇 物理学
- 29 篇 生物学
- 19 篇 化学
451 篇 管理学
- 322 篇 管理科学与工程(可...
- 229 篇 工商管理
- 153 篇 图书情报与档案管...
51 篇 经济学
- 51 篇 应用经济学
18 篇 法学
- 17 篇 社会学
15 篇 医学
9 篇 教育学
9 篇 农学
5 篇 文学
4 篇 军事学

主题

564 篇 distributed comp...
540 篇 computer science
491 篇 parallel process...
484 篇 concurrent compu...
410 篇 parallel process...
378 篇 application soft...
343 篇 distributed data...
335 篇 distributed comp...
312 篇 databases
289 篇 computer archite...
248 篇 database systems
222 篇 computational mo...
220 篇 delay
215 篇 hardware
211 篇 costs
188 篇 processor schedu...
172 篇 protocols
169 篇 computer network...
162 篇 large-scale syst...
152 篇 parallel program...

机构

20 篇 ibm thomas j. wa...
11 篇 department of co...
10 篇 department of co...
8 篇 school of comput...
8 篇 department of co...
8 篇 department of co...
7 篇 ieee
7 篇 department of co...
7 篇 department of ee...
7 篇 department of co...
7 篇 college of compu...
7 篇 hewlett packard ...
7 篇 northwestern uni...
6 篇 department of co...
6 篇 syracuse univ sy...
6 篇 department of co...
6 篇 department of co...
6 篇 lawrence berkele...
6 篇 college of compu...
6 篇 univ of californ...

作者

20 篇 a. choudhary
16 篇 a. boukerche
10 篇 s.k. das
10 篇 boukerche azzedi...
10 篇 choudhary a
10 篇 li keqin
9 篇 j. saltz
9 篇 sun xian-he
9 篇 choudhary alok
9 篇 k. schwan
9 篇 das sajal k.
8 篇 l.r. welch
8 篇 a. makinouchi
8 篇 chen haibo
8 篇 anon
8 篇 a.a. chien
7 篇 c. katsinis
7 篇 t. kurc
7 篇 d.k. panda
7 篇 keqin li

语言

4,844 篇 英文
48 篇 其他
2 篇 中文

检索条件"任意字段=Proceedings International Symposium on Databases in Parallel and Distributed Systems"

共 4894 条记录，以下是361-370 订阅

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

详细简洁

排序：

Hybrid-RC: Flexible Erasure Codes with Optimized Recovery Performance and Low Storage Overhead 36

Hybrid-RC: Flexible Erasure Codes with Optimized Recovery Pe...

引用

36th IEEE symposium on Reliable distributed systems (SRDS)

作者： Ye, Liuqing Feng, Dan Hu, Yuchong Liu, Qing Huazhong Univ Sci & Technol Wuhan Natl Lab Optoelect Key Lab Informat Storage Syst Sch Comp Sci & TechnolMinist Educ China Wuhan Hubei Peoples R China

ISBN: (纸本)9781538616796

Erasure codes are widely used in practical storage systems to prevent disk failure and data loss. However, these codes require excessive disk I/Os and network traffic for recovering unavailable data. As a result, the recovery performance of erasure codes is suboptimal. Among all erasure codes, Minimum Storage Regenerating (MSR) codes can achieve optimal repair bandwidth under the minimum storage during recovery, but some open issues remain to be addressed before applying them in real systems. In this paper, we present Hybrid Regenerating Codes (HybridRC), a new set of erasure codes with optimized recovery performance and low storage overhead. The codes utilize the superiority of MSR codes to compute a subset of data blocks while some other parity blocks are used for reliability maintenance. As a result, our design is near-optimal with respect to storage and network traffic. We show that Hybrid-RC reduces the reconstruction cost by up to 21% compared to the Local Reconstruction Codes (LRC) with the same storage overhead. Most importantly, in Hybrid-RC, each block contributes only half the amount of data when processing a single block failure. Therefore, the number of I/Os consumed per block is reduced by 50%, which is of great help to balance the network load and reduce the latency.

关键词： Maintenance engineering Reliability Encoding Bandwidth distributed databases Galois fields Systematics

来源：评论

学校读者我要写书评

暂无评论

proceedings of the Dateso 2017 Workshop on databases, Texts Specifications, and Objects, DATESO 2017

Proceedings of the Dateso 2017 Workshop on Databases, Texts ...

引用

17th Annual international Workshop on databases, Texts, Specifications, and Objects, DATESO 2017

ISBN: (纸本)9788001061381

The proceedings contain 6 papers. The topics discussed include: impact of user’s emotion on software adaptation;experiences with data lineage metadata storing in relational and graph database;parallel itemset mining algorithms – an overview;framework and automated prioritization procedure for model-based testing of automotive distributed systems;model transformations via XSLT;and analyzing musical pieces using *** tools.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Shared Memory Method ForEnhancingThe HTNGH AlgorithmPerformance: Proposed Method 17

A Shared Memory Method ForEnhancingThe HTNGH AlgorithmPerfor...

引用

international Conference on Future Networks and distributed systems (ICFNDS)

作者： Abu-Hashem, Muhannad A. Uliyan, Diaa M. Abuarqoub, Abdelrahman Middle East Univ Fac Informat Technol Amman Jordan

ISBN: (纸本)9781450348447

In bioinformatics, pair-wise alignment plays a significant role insequence comparison by rating the similarities and distances between protein, DeoxyriboNucleic Acid (DNA), and RiboNucleic Acid (RNA)sequences. Sequence comparison considered as a key stone in building distance matrices. Due to the rapid growth of molecular databases, the need for faster sequence comparison and alignment has become anecessity. High performance computing impacthas increased in the last decade through providing many high performance architectures and tools. In this paper we present a parallel shared memory design for a dynamic programming algorithm named Hash Table-N-Gram-Hirschberg (HT-NGH) an extension of Hashing-N-Gram-Hirschberg (HNGH) and N-Gram-Hirschberg (NGH) algorithm, to speed up the sequence alignment construction process. The focus of the proposed method ison the transformation phase of HT-NGH algorithm since it takes10% of HT-NGH overall run time. The experimental evaluation of the proposed parallel designshows an enhancement in the execution time and speedup without sacrificing the accuracy. However,the decomposition method might slightly slowdown the proposed algorithm due to the differences in performance between the processing units.

关键词： Shared-Memory parallel design High-performance computing Sequence Alignment pair-wise alignment distance matrix construction

来源：评论

学校读者我要写书评

暂无评论

NICE: Network-Integrated Cluster-Efficient Storage 17

NICE: Network-Integrated Cluster-Efficient Storage

引用

26th ACM international symposium on High-Performance parallel and distributed Computing (HPDC)

作者： Al-Kiswany, Samer Yang, Suli Arpaci-Dusseau, Andrea C. Arpaci-Dusseau, Remzi H. Univ Waterloo Waterloo ON Canada Univ Wisconsin Madison WI 53706 USA

ISBN: (纸本)9781450346993

We present NICE, a key-value storage system design that leverages new software-defined network capabilities to build cluster-based network-efficient storage system. NICE presents novel techniques to co-design network routing and multicast with storage replication, consistency, and load balancing to achieve higher efficiency, performance, and scalability. We implement the NICEKV prototype. NICEKV follows the NICE approach in designing four essential network-centric storage mechanisms: request routing, replication, consistency, and load balancing. Our evaluation shows that the proposed approach brings significant performance gains compared to the current key-value systems design: up to 7x put/get performance improvement, up to 2 x reduction in network load, 3x to 9x load reduction on the storage nodes, and the elimination of scalability bottlenecks present in current designs.

关键词： Key-value storage software-defined networks network-system co-design distributed storage

来源：评论

学校读者我要写书评

暂无评论

proceedings - 2017 IEEE 31st international parallel and distributed Processing symposium Workshops, IPDPSW 2017

Proceedings - 2017 IEEE 31st International Parallel and Dist...

引用

31st IEEE international parallel and distributed Processing symposium Workshops, IPDPSW 2017

ISBN: (纸本)9781538634080

The proceedings contain 173 papers. The topics discussed include: portable implementation of advanced driver-assistance algorithms on heterogeneous architectures;improving CPU performance through dynamic GPU access throttling in CPU-GPU heterogeneous processors;alternative processor within threshold: flexible scheduling on heterogeneous systems;preemptive resource management for dynamically arriving tasks in an oversubscribed heterogeneous computing system;modeling of applications and hardware to explore task mapping and scheduling strategies on a heterogeneous micro-server system;consumer-and-provider-oriented efficient IaaS resource allocation;a pipelined and scalable dataflow implementation of convolutional neural networks on FPGA;on-chip memory based binarized convolutional deep neural network applying batch normalization free technique on an FPGA;automatic flow selection and quality-of-result estimation for FPGA placement;exploiting decoupled OpenCL work-items with data dependencies on FPGAs: a case study;ReEP: a toolset for generation and programming of reconfigurable datapaths for event processing;a generic approach to the development of coprocessors for elliptic curve cryptosystems;a hardware acceleration for surface EMG non-negative matrix factorization;and on-FPGA real-time processing of biological signals from high-density MEAs: a design space exploration.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Formalizing Data Management systems: a Case Study of Syndicate Protocol

Formalizing Data Management Systems: a Case Study of Syndica...

引用

international Conference on Computational Science and Computational Intelligence (CSCI)

作者： Wang, Chun-Kun Xu, Hao Univ N Carolina Dept Comp Sci Chapel Hill NC 27599 USA Univ N Carolina Data Intens Cyber Environm Ctr Chapel Hill NC 27599 USA

ISBN: (纸本)9781538626528

The large volume of data delivers valuable insights to many fields. A variety of big data database options have emerged for the purpose of data management. Many legacy data management systems, however, are written without formalization. Syndicate is served as a distributed file system that builds a coherent storage abstraction from already-deployed commodity components, including cloud storage and dataset providers. Through Syndicate, users can define their own provider-agnostic storage functionality to access different databases. Syndicate that fully decouples applications from underlying components generalizes the use of data management systems. It is also driving the need for further specification to guarantee the consistency and the correctness, such as functional requirements, data consistency, access control, and fault tolerance. In this paper, we take initial steps to formalize the Syndicate protocols with the goal of providing a general solution by using formal methods to improve the quality of data management systems.

关键词： distributed file system Concurrent/parallel program pi-calculus

来源：评论

学校读者我要写书评

暂无评论

A Practical Framework for Privacy-Preserving NoSQL databases 36

A Practical Framework for Privacy-Preserving NoSQL Databases

引用

36th IEEE symposium on Reliable distributed systems (SRDS)

作者： Macedo, Ricardo Paulo, Joao Pontes, Rogerio Portela, Bernardo Oliveira, Tiago Matos, Miguel Oliveira, Rui INESC TEC HASLab High Assurance Software Lab Oporto Portugal Univ Minho Oporto Portugal FCUP Oporto Portugal Univ Lisbon INESC ID IST Lisbon Portugal

ISBN: (纸本)9781538616796

Cloud infrastructures provide database services as cost-efficient and scalable solutions for storing and processing large amounts of data. To maximize performance, these services require users to trust sensitive information to the cloud provider, which raises privacy and legal concerns. This represents a major obstacle to the adoption of the cloud computing paradigm. Recent work addressed this issue by extending databases to compute over encrypted data. However, these approaches usually support a single and strict combination of cryptographic techniques invariably making them application specific. To assess and broaden the applicability of cryptographic techniques in secure cloud storage and processing, these techniques need to be thoroughly evaluated in a modular and configurable database environment. This is even more noticeable for NoSQL data stores where data privacy is still mostly overlooked. In this paper, we present a generic NoSQL framework and a set of libraries supporting data processing cryptographic techniques that can be used with existing NoSQL engines and composed to meet the privacy and performance requirements of different applications. This is achieved through a modular and extensible design that enables data processing over multiple cryptographic techniques applied on the same database. For each technique, we provide an overview of its security model, along with an extensive set of experiments. The framework is evaluated with the YCSB benchmark, where we assess the practicality and performance tradeoffs for different combinations of cryptographic techniques. The results for a set of macro experiments show that the average overhead in NoSQL operations performance is below 15%, when comparing our system with a baseline database without privacy guarantees.

关键词： cryptotechnique Privacy Database Modularity Cloud Computing Data privacy Sensitive data EXPANDABLE

来源：评论

学校读者我要写书评

暂无评论

knor: A NUMA-Optimized In-Memory, distributed and Semi-External-Memory k-means Library 17

knor: A NUMA-Optimized In-Memory, Distributed and Semi-Exter...

引用

26th ACM international symposium on High-Performance parallel and distributed Computing (HPDC)

作者： Mhembere, Disa Zheng, Da Priebe, Carey E. Vogelstein, Joshua T. Burns, Randal Johns Hopkins Univ Dept Comp Sci Baltimore MD 21218 USA Johns Hopkins Univ Dept Appl Math & Stat Baltimore MD USA Johns Hopkins Univ Dept Biomed Engn Inst Computat Med Baltimore MD USA

ISBN: (纸本)9781450346993

k-means is one of the most influential and utilized machine learning algorithms. Its computation limits the performance and scalability of many statistical analysis and machine learning tasks. We rethink and optimize k-means in terms of modern NUMA architectures to develop a novel parallelization scheme that delays and minimizes synchronization barriers. The k-means NUMA Optimized Routine (knor) library has (i) in-memory (knori), (ii) distributed memory (knord), and (ii) semi-external memory (knors) modules that radically improve the performance of k-means for varying memory and hardware budgets. knori boosts performance for single machine datasets by an order of magnitude or more. knors improves the scalability of k-means on a memory budget using SSDs. knors scales to billions of points on a single machine, using a fraction of the resources that distributed in-memory systems require. knord retains knori's performance characteristics, while scaling in-memory through distributed computation in the cloud. knor modifies Elkan's triangle inequality pruning algorithm such that we utilize it on billion-point datasets without the significant memory overhead of the original algorithm. We demonstrate knor outperforms distributed commercial products like H2O, Turi (formerly Dato, GraphLab) and Spark's MLlib by more than an order of magnitude for datasets of 10(7) to 10(9) points.

关键词： NUMA k-means semi-external memory cloud clustering parallel

来源：评论

学校读者我要写书评

暂无评论

proceedings of the IEEE symposium on Reliable distributed systems

Proceedings of the IEEE Symposium on Reliable Distributed Sy...

引用

36th IEEE international symposium on Reliable distributed systems, SRDS 2017

ISBN: (纸本)9781538616796

The proceedings contain 33 papers. The topics discussed include: on availability for blockchain-based systems;a horizontally scalable and reliable architecture for location-based publish-subscribe;automated fine tuning of probabilistic self-stabilizing algorithms;reconfiguring parallel state machine replication;a statistical framework on software aging modeling with continuous-time hidden Markov model;hybrid-RC: flexible erasure codes with optimized recovery performance and low storage overhead;correlation-aware stripe organization for efficient writes in erasure-coded storage systems;optimal storage under unsynchronized mobile byzantine faults;pulp: achieving privacy and utility trade-off in user mobility data;CausalSpartan: causal consistency for distributed data stores using hybrid logical Clocks;DottedDB: anti-entropy without Merkle trees, deletes without tombstones;optimal cyber-defense strategies for advanced persistent threats: a game theoretical analysis;AutoFlowLeaker: circumventing web censorship through automation services;optimal network reconfiguration for software defined networks using shuffle-based online MTD;a greedy-based method for modified condition/decision coverage testing criterion;performance modeling of PBFT consensus process for permissioned blockchain network (hyperledger fabric);and detecting TCP-Based DDoS attacks in Baidu cloud computing data centers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

proceedings - 2017 IEEE/ACM 21st international symposium on distributed Simulation and Real Time Applications, DS-RT 2017

Proceedings - 2017 IEEE/ACM 21st International Symposium on ...

引用

21st IEEE/ACM international symposium on distributed Simulation and Real Time Applications, DS-RT 2017

ISBN: (纸本)9781538640289

The proceedings contain 33 papers. The topics discussed include: parallel sort-based matching for data distribution management on shared-memory multiprocessors;an efficient energy-driven scheduling of DVFS-multicore systems with a hierarchy of shared memories;a non-blocking global virtual time algorithm with logarithmic number of memory operations;automated memoization: automatically identifying memoization units in simulation parameter studies;HOLEG: a simulator for evaluating resilient energy networks based on the holon analogy;ORCHESTRA: an asynchronous wait-free distributed GVT algorithm;toward a formalism to study the scheduling of cyber-physical systems simulations;an HLA-based BPMN extension for the specification of business process collaborations;on the execution control of HLA federations using the SISO space reference FOM;formal and simulation-based timing analysis of industrial-Ethernet Sercos III over TSN;device to device communication in mobile delay tolerant networks;the quest for scalability and accuracy: multi-level simulation of the Internet of Things;FeatureSim: feature-driven simulation for exploratory analysis with agent-based models;agent-based decentralized traffic signal timing;dynamically distributed network control for message dissemination in ITS;and integration of Omnet++ simulator with Matlab for realizing an adaptive beamforming system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共490页 << < 33 34 35 36 37 38 39 40 41 42 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：