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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

237 篇 会议
72 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

170 篇 工学
- 153 篇 计算机科学与技术...
- 122 篇 软件工程
- 20 篇 信息与通信工程
- 20 篇 生物工程
- 18 篇 控制科学与工程
- 13 篇 机械工程
- 12 篇 电子科学与技术（可...
- 10 篇 电气工程
- 7 篇 动力工程及工程热...
- 7 篇 化学工程与技术
- 7 篇 生物医学工程（可授...
- 4 篇 力学（可授工学、理...
- 3 篇 材料科学与工程（可...
- 3 篇 交通运输工程
- 3 篇 网络空间安全
76 篇 理学
- 43 篇 数学
- 21 篇 生物学
- 10 篇 化学
- 9 篇 物理学
- 7 篇 统计学（可授理学、...
- 4 篇 系统科学
53 篇 管理学
- 33 篇 管理科学与工程(可...
- 21 篇 图书情报与档案管...
- 14 篇 工商管理
5 篇 医学
- 4 篇 基础医学(可授医学...
- 4 篇 临床医学
- 3 篇 药学(可授医学、理...
4 篇 经济学
- 4 篇 应用经济学
4 篇 法学
- 4 篇 社会学
3 篇 教育学
- 3 篇 教育学
2 篇 农学

主题

30 篇 distributed comp...
25 篇 concurrent compu...
21 篇 laboratories
13 篇 parallel process...
10 篇 application soft...
10 篇 data mining
10 篇 computational mo...
9 篇 computer science
9 篇 grid computing
9 篇 accuracy
8 篇 routing
8 篇 kernel
8 篇 data models
7 篇 java
6 篇 runtime
6 篇 scheduling algor...
6 篇 computer archite...
6 篇 neural networks
6 篇 contracts
6 篇 algorithm design...

机构

21 篇 national key lab...
15 篇 college of compu...
13 篇 national laborat...
12 篇 national laborat...
11 篇 shanghai key lab...
11 篇 national key lab...
10 篇 national key lab...
8 篇 john von neumann...
7 篇 science and tech...
7 篇 laboratory of di...
6 篇 parallel and dis...
6 篇 national univers...
6 篇 laboratory of pa...
6 篇 mta sztaki labor...
5 篇 key laboratory o...
5 篇 óbuda university...
5 篇 parallel and dis...
5 篇 department of co...
5 篇 institute of par...
5 篇 mta sztaki/labor...

作者

20 篇 li kuan-ching
20 篇 yang chao-tung
15 篇 li dongsheng
11 篇 huaimin wang
10 篇 dongsheng li
10 篇 chen haibo
10 篇 v. chaudhary
9 篇 gang yin
9 篇 dou yong
9 篇 ji wang
9 篇 tao wang
8 篇 wang yijie
8 篇 zang binyu
7 篇 guan haibing
7 篇 lai zhiquan
7 篇 qiao peng
7 篇 huang zhen
7 篇 yue yu
6 篇 yijie wang
6 篇 s. roy

语言

301 篇 英文
5 篇 其他
5 篇 中文

检索条件"机构=Parallel Distributed Computing Laboratory"

共 311 条记录，以下是71-80 订阅

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

详细简洁

排序：

A framework for constructing peer-to-peer overlay networks in java 09

A framework for constructing peer-to-peer overlay networks i...

引用

7th International Conference on Principles and Practice of Programming in Java, PPPJ 2009

作者： Rui, Shen Ji, Wang Shengdong, Zhang Siqi, Shen Pei, Fan National Laboratory for Parallel and Distributed Processing Changsha 410073 China School of Computing University of Leeds Leeds LS2 9JT United Kingdom

ISBN: (纸本)9781605585987

Peer-to-peer emerges as a better way for building applications on the Internet that require high scalability and availability. Peer-to-peer systems are usually organized into structured overlay networks, which provide key-based routing capabilities to eliminate flooding in unstructured ones. Many overlay network protocols have been proposed to organize peers into various topologies with emphasis on different networking properties. However, applications are often stuck to a specific peer-to-peer overlay network implementation, because different overlay implementations usually provide very different interfaces and messaging mechanisms. In this paper, we present a framework for constructing peer-to-peer overlay networks in Java. First, networking is abstracted by the interfaces that use URIs to uniformly address peers on different underlying or overlay networks. Then, asynchronous and synchronous messaging support is built upon these interfaces. Finally, overlay networking interfaces are sketched to handle specific issues in overlay networks. We have constructed several overlay networks in this framework, and built peer-to-peer applications which are independent of overlay implementations. Copyright 2009 ACM.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

Concurrent and consistent virtual machine introspection with hardware transactional memory

Concurrent and consistent virtual machine introspection with...

引用

20th IEEE International Symposium on High Performance Computer Architecture, HPCA 2014

作者： Liu, Yutao Xia, Yubin Guan, Haibing Zang, Binyu Chen, Haibo Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781479930975

Virtual machine introspection, which provides tamperresistant, high-fidelity 'out of the box' monitoring of virtual machines, has many prominent security applications including VM-based intrusion detection, malware analysis and memory forensic analysis. However, prior approaches are either intrusive in stopping the world to avoid race conditions between introspection tools and the guest VM, or providing no guarantee of getting a consistent state of the guest VM. Further, there is currently no effective means for timely examining the VM states in question. In this paper, we propose a novel approach, called TxIntro, which retrofits hardware transactional memory (HTM) for concurrent, timely and consistent introspection of guest VMs. Specifically, TxIntro leverages the strong atomicity of HTM to actively monitor updates to critical kernel data structures. Then TxIntro can mount introspection to timely detect malicious tampering. To avoid fetching inconsistent kernel states for introspection, TxIntro uses HTM to add related synchronization states into the read set of the monitoring core and thus can easily detect potential inflight concurrent kernel updates. We have implemented and evaluated TxIntro based on Xen VMM on a commodity Intel Haswell machine that provides restricted transactional memory (RTM) support. To demonstrate the effectiveness of TxIntro, we implemented a set of kernel rootkit detectors using TxIntro. Evaluation results show that TxIntro is effective in detecting these rootkits, and is efficient in adding negligible performance overhead. © 2014 IEEE.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Exploiting contention and congestion aware switch allocation in network-on-chips 17

Exploiting contention and congestion aware switch allocation...

引用

50th ACM Turing Conference - China, ACM TUR-C 2017

作者： Li, Cunlu Dongy, Dezun Liao, Xiangke National Laboratory for Parallel and Distributed Processing Collaborative Innovation Center of High Performance Computing College of Computer National University of Defense Technology Changsha Hunan410073 China

ISBN: (纸本)9781450348737

Network-on-chip system plays an important role to improve the performance of chip multiprocessor systems. As the complexity of the network increases, congestion problem has become the major performance bottleneck and seriously influence the performance of NoCs. Prior works have focused on designing effective routing algorithm based on collecting congestion and contention information to load balance the traffic. However, most prior works do not consider balancing the traffic load during switch allocation. Due to the lack of congestion information in switch allocation stage, switch allocator performs allocation only based on packet requests and thus aggravates the congestion in the ports of switch. In this paper, we propose to add the congestion and contention information into the switch allocation process and design an efficient on-chip switching strategy which utilizes the contention and congestion information to load balance the traffic and achieve efficient switch allocation. To further enhance the performance of our design, we carefully design our switch allocation strategy to balance the trade-off between traffic load balance and the matching efficiency in switch allocation. We evaluate our design under synthetic traffic and trace of parsec benchmarks. Our evaluations show this mechanism achieves optimal latency compared to best previous switch allocation strategies. © 2017 ACM.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Bipartite-oriented distributed graph partitioning for big learning 14

Bipartite-oriented distributed graph partitioning for big le...

引用

5th ACM Asia-Pacific Workshop on Systems, APSYS 2014

作者： Chen, Rong Shi, Jiaxin Zang, Binyu Guan, Haibing Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781450330244

Many machine learning and data mining (MLDM) problems like recommendation, topic modeling and medical diagnosis can be modeled as computing on bipartite graphs. However, most distributed graph-parallel systems are oblivious to the unique characteristics in such graphs and existing online graph partitioning algorithms usually causes excessive replication of vertices as well as significant pressure on network communication. This article identifies the challenges and opportunities of partitioning bipartite graphs for distributed MLDM processing and proposes BiGraph, a set of bipartite-oriented graph partitioning algorithms. BiGraph leverages observations such as the skewed distribution of vertices, discriminated computation load and imbalanced data sizes between the two subsets of vertices to derive a set of optimal graph partition algorithms that result in minimal vertex replication and network communication. BiGraph has been implemented on PowerGraph and is shown to have a performance boost up to 17.75X (from 1.38X) for four typical MLDM algorithms, due to reducing up to 62% vertex replication, and up to 96% network traffic. © 2014 ACM.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

DMSA: Decentralized and Multi-keyword Selective Data Sharing and Acquisition 22

DMSA: Decentralized and Multi-keyword Selective Data Sharing...

引用

22nd IEEE International Symposium on parallel and distributed Processing with Applications, ISPA 2024

作者： Lin, Moheng Shi, Peichang Fu, Xiang Jiang, Feng Yi, Guodong National University of Defense Technology National Key Laboratory of Parallel and Distributed Computing College of Computer Science Changsha410073 China Xiangjiang Lab Changsha410073 China

ISBN: (纸本)9798331509712

Blockchain technology has been extensively uti-lized in decentralized data-sharing applications, with the immutability of blockchain providing a witness for the circulation of data. However, current blockchain data-sharing solutions still fail to address the simultaneous screening needs of both the sender and receiver with multi-keywords. Without the capability to support bilateral simultaneous filtering, the disclosure of reasons for matching failures could inadvertently expose sensitive user data. Therefore, the challenge lies in enabling ciphertexts with multiple keywords and receivers with multiple interests to achieve mutual and simultaneous matching. Based on the technical foundations of SE (Searchable Encryption), MABE (Multi-Attribute Based Encryption), and polynomial fitting, this paper proposes a scheme called DMSA (Decentralized and Multi-keyword selective Sharing and selective Acquisition). This scheme can satisfy soundness, enabling ciphertexts carrying multiple keywords and receivers representing multiple interests to match each other simultaneously. We conducted a security analysis that confirms the security of DMSA against chosen-plaintext attacks. Our experimental results demonstrate a significant efficiency improvement, with a 67% increase over single-keyword data-sharing schemes and a 16% enhancement compared to the existing multi-keyword data-sharing solution. © 2024 IEEE.

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

A Java graphical user interface for large-scale scientific computations in distributed systems 4

A Java graphical user interface for large-scale scientific c...

引用

4th International Conference/Exhibition on High Performance computing in the Asia-Pacific Region, HPC-Asia 2000

作者： Shen, X. Thiruvathukal, G. Liao, W. Choudhary, A. Singh, A. Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University EvanstonIL60208 United States School of Computing Telecommunications and Information Sciences JHPC Laboratory DePaul University United States

ISBN: (纸本)0769505902

Large-scale scientific applications present great challenges to computational scientists in terms of obtaining high performance and in managing large datasets. These applications (most of which are simulations) may employ multiple techniques and resources in a heterogeneously distributed environment. Effective working in such an environment is crucial for modern large-scale simulations. In this paper, we present an integrated Java graphical user interface (IJ-GUI) that provides a control platform for managing complex programs and their large datasets easily. As far as performance is concerned, we present and evaluate our initial implementation of two optimization schemes: data replication and data prediction. Data replication can take advantage of 'temporal locality' by caching the remote datasets on local disks;data prediction, on the other hand, provides prefetch hints based on the datasets' past activities that are kept in databases. We first introduce the data contiguity concept in such an environment that guides data prediction. The relationship between the two approaches is discussed. © 2000 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Towards an agent oriented programming language with caste and scenario mechanisms

Towards an agent oriented programming language with caste an...

引用

4th International Conference on Autonomous Agents and Multi agent Systems, AAMAS 05

作者： Wang, Ji Shen, Rui Zhu, Hong National Laboratory for Parallel and Distributed Processing Changsha 410073 China Department of Computing Oxford Brookes University Oxford OX33 1HX United Kingdom

The paper presents an agent-oriented programming language SLABSp. It provides caste and scenario mechanisms in a coherent way to support the caste-centric methodology of agent-oriented software development. It uses caste as a modular facility to organize agents into castes and to represent their structure and behavior characteristics. SLABSp also uses scenarios to define agents' behaviors in the context of environment situations. In the paper, the implementation of the language is briefly described. An example of the program is given to illustrate its programming style. Copyright 2005 ACM.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

The visual query language for an object-oriented knowledge-based system

The visual query language for an object-oriented knowledge-b...

引用

1999 International Symposium on Database Applications in Non-Traditional Environments, DANTE 1999

作者： Xu, Ming Wang, Yong-Jun Wang, Yi-Jie Zhang, Kang Zhang, Yanchim National Laboratory for Parallel and Distributed Processing Changsha Hunan410073 China Dept.of Computing Mac Quart e University Sydney Australia University of Southern Queensland Depi of Mathematics and Computing Toowoomba Australia

ISBN: (纸本)0769504965

The user interface of the object-oriented knowledge-based system CAOBS/v1.2 is a visual query subsystem consisting of a flexible visual query language (VKQL), and a knowledge base browser/*** the visual language, the user can express query requirements by constructing query *** absorbs the key features of some existing visual query languages, and adds more advanced *** paper presents the design and implementation of VKQL and compares VKQL with other similar query languages. © 2000 IEEE.

关键词： Knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

CCN hotspot cache placement strategy based on genetic algorithm 10th

CCN hotspot cache placement strategy based on genetic algori...

引用

10th International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage, SpaCCS 2017

作者： Wu, Hongjia Wang, Nao Wang, Gaocai School of Computer and Electronic Information Guangxi University NanningGuangxi533004 China Guangxi Colleges and University Key Laboratory of Parallel and Distributed Computing Technology Nanning530004 China

ISBN: (纸本)9783319723945

Content-centric networks provide effective support for content services through a caching mechanism, so the caching of the placement strategy has become a hot research. In this paper, the problem of content placement in CCN is taken as the starting point, focusing on the allocation of caching resources for district partitioning according to the number of users given the content of predictable hotspots. When the hot topic breaks out, the first to the user from the content of the nearest as the goal, from the user’s point of view as its characteristics, nested using improved genetic algorithms to select hotspot cache placement points, and a CCN hotspot cache placement strategy based on genetic algorithm is proposed. In the simulation experiment, the cache placement strategy proposed in this paper is compared with other traditional strategies in network performance. The simulation results show that the strategy can effectively reduce the access hops and average access latency, reduce the server load and improve the user satisfaction. © Springer International Publishing AG 2017.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Enhancing Resolution of Inferring Hi-C Data Integrating U-Net and ResNet Networks 23rd

Enhancing Resolution of Inferring Hi-C Data Integrating U-Ne...

引用

23rd International Conference on parallel and distributed computing, Applications, and Technologies, PDCAT 2022

作者： Zhao, Fengjiao Li, Na Zhong, Cheng School of Computer Electronics and Information Guangxi University Guangxi Nanning530004 China Key Laboratory of Parallel and Distributed Computing Technology in Guangxi Universities Guangxi Nanning530004 China

ISBN: (纸本)9783031299261

The Hi-C data is the basis of three-dimensional chromosome structure reconstruction. In this paper, a method integrating U-Net and ResNET network is proposed to infer high resolution Hi-C data from existing low-resolution Hi-C data. Firstly, the U-Net is used as the backbone network to make full use of the shallow layer details and deep layer essential features of Hi-C data. Secondly, the residual module is introduced into the coding path and decoding path of the network to increase the depth of the model and prevent network degradation. Finally, the down sampling is used to reduce the calculation amount to decrease the required running time for the network model. The experimental results on real datasets showed that the proposed method had better performance than existing methods, and the inferred high resolution Hi-C data was closer to the real Hi-C data. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Chromosomes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：