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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

768 篇 会议
27 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

384 篇 工学
- 362 篇 计算机科学与技术...
- 194 篇 软件工程
- 59 篇 信息与通信工程
- 51 篇 电气工程
- 27 篇 电子科学与技术（可...
- 18 篇 控制科学与工程
- 13 篇 材料科学与工程（可...
- 7 篇 安全科学与工程
- 7 篇 网络空间安全
- 4 篇 生物医学工程（可授...
- 3 篇 光学工程
- 3 篇 动力工程及工程热...
- 3 篇 生物工程
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 冶金工程
- 2 篇 土木工程
- 2 篇 交通运输工程
101 篇 理学
- 95 篇 数学
- 18 篇 统计学（可授理学、...
- 8 篇 系统科学
- 5 篇 物理学
- 4 篇 生物学
72 篇 管理学
- 51 篇 管理科学与工程(可...
- 38 篇 工商管理
- 24 篇 图书情报与档案管...
8 篇 经济学
- 8 篇 应用经济学
7 篇 医学
- 7 篇 临床医学
- 2 篇 基础医学(可授医学...
3 篇 法学
- 3 篇 社会学
1 篇 教育学
1 篇 文学
1 篇 农学
1 篇 军事学

主题

121 篇 computer science
94 篇 concurrent compu...
94 篇 distributed comp...
83 篇 distributed data...
79 篇 parallel process...
78 篇 application soft...
76 篇 databases
74 篇 database systems
73 篇 parallel process...
55 篇 delay
53 篇 distributed comp...
52 篇 processor schedu...
45 篇 computer archite...
43 篇 transaction data...
41 篇 algorithm design...
40 篇 costs
39 篇 relational datab...
35 篇 protocols
34 篇 computational mo...
33 篇 hardware

机构

6 篇 ibm thomas j. wa...
5 篇 ieee
4 篇 school of comput...
4 篇 department of co...
4 篇 department of co...
3 篇 center for paral...
3 篇 department of co...
3 篇 lip ens-lyon lyo...
3 篇 department of co...
2 篇 department of co...
2 篇 institute of inf...
2 篇 department of co...
2 篇 institute of inf...
2 篇 computer systems...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of el...
2 篇 department of co...
2 篇 school of comput...

作者

7 篇 a. choudhary
6 篇 a. boukerche
5 篇 j. saltz
4 篇 s.k. das
4 篇 t. kurc
4 篇 a. el abbadi
3 篇 a. rau-chaplin
3 篇 o. wolfson
3 篇 f. dehne
3 篇 p.s. yu
3 篇 a. singh
3 篇 casanova henri
3 篇 c. liu
3 篇 a. bar-noy
3 篇 s. kipnis
3 篇 g. gupta
3 篇 d. agrawal
3 篇 x. shen
2 篇 grove matthew
2 篇 a. burger

语言

794 篇 英文
2 篇 其他

检索条件"任意字段=Proceedings of the first international symposium on Databases in parallel and distributed systems"

共 796 条记录，以下是171-180 订阅

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

详细简洁

排序：

A search method for reducing local cost in distributed constraint optimization problem

A search method for reducing local cost in distributed const...

引用

3rd IASTED international Conference on Advances in Computer Science and Technology, ACST 2007

作者： Noto, Masato Hashimoto, Daiki Matsuda, Mitsutoshi Kanagawa University Yokohama 221-8686 Japan

ISBN: (纸本)9780889866560

A distributed constraint optimization problem (DCOP) distributes the variables and constraints among intelligent agents to enable it to be treated as a constraint satisfaction problem. In this paper, we propose a search method based on the asynchronous distributed optimization (Adopt) algorithm that has been proposed for DCOP. Adopt is a complete method based on a depth-first-search, and operates asynchronously to find the optimal solution for the overall cost. We propose a distributed search method that builds on the merits of Adopt by considering the local load of each agent as opposed to overall optimization. The effect of the proposal was evaluated in simulations.

关键词： Intelligent agents

来源：评论

学校读者我要写书评

暂无评论

parallel CBIR System for Efficient Hyperspectral Image Retrieval from Heterogeneous Networks of Workstations

Parallel CBIR System for Efficient Hyperspectral Image Retri...

引用

9th international symposium on Symbolic and Numeric Algorithms for Scientific Computing

作者： Plaza, Antonio Plaza, Javier Paz, Abel Blazquez, Soraya Univ Extremadura Dept Technol Comp & Commun Polytech Sch Caceres E-10071 Caceres Spain

ISBN: (纸本)9780769530789

The purpose of content-based image retrieval (CBIR) is to retrieve, from real data stored in a database, information that is relevant to a query In remote sensing applications, the wealth of spectral information provided by last-generation (hyperspectral) instruments has quickly introduced the need for parallel CBIR systems able to effectively retrieve features of interest from ever-growing data archives. To address this need, this paper develops a new parallel CBIR system which has been specifically designed to be run on heterogeneous networks of computers (HNOCs). These platforms have soon become a standard computing architecture in remote sensing missions due to the distributed nature of data repositories. The proposed heterogeneous system first extracts an image feature vector able to characterize image content with sub-pixel precision, and then uses the obtained feature as a search reference. The system is validated using a complex hyperspectral image database, and implemented on several networks of workstations at University of Maryland.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

Generating efficient distributed deadlock avoidance controllers

Generating efficient distributed deadlock avoidance controll...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Sánchez, César Sipma, Henny B. Manna, Zohar Stanford University Computer Science Department Stanford CA 94305 United States

ISBN: (纸本)1424409101

General solutions to deadlock avoidance in distributed systems are considered impractical due to the high communication overhead. In previous work we showed that practical solutions exist when all possible sequences of resource requests are known a priori in the form of call graphs;in this case protocols can be constructed that involve no communication. These run-time protocols make use of annotations of the call graph that are computed statically based on the structure of the call graph. If the annotations are acyclic, then deadlocks are unreachable. This paper focuses on the computation of these annotations. We first show that our algorithm for computing acyclic annotations is complete: every optimal annotation can be generated. We then show that, given a cyclic annotation and a fixed set of resources, checking whether deadlocks are reachable is NP-complete. Finally, we consider the problem of computing minimal annotations that satisfy given constraints on the number of available resources. We show that the problem is NP-complete in the general case, but that it can be solved in polynomial time if the only restrictions are that the number of certain resources is 1, that is, these resources are binary semaphores. ©2007 IEEE.

关键词： Computer system recovery

来源：评论

学校读者我要写书评

暂无评论

A novel fault-tolerant parallel algorithm

引用

7th international symposium on Advanced parallel Processing Technologies

作者： Wang, Panfeng Du, Yunfei Fu, Hongyi Zhou, Haifang Yang, Xuejun Yang, Wenjing Natl Univ Def Technol Natl Lab Paralleling & Distributed Proc Coll Comp Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9783540768364

The mean-time-between-failure of current high-performance computer systems is much shorter than the running times of many computational applications, whereas those applications are the main workload for those systems. Currently, checkpoint/restart is the most commonly used scheme for such applications to tolerate hardware failures. But this scheme has its performance limitation when the number of processors becomes much larger. In this paper, we propose a novel fault-tolerant parallel algorithm FPAPR. first, we introduce the basic idea of FPAPR. Second, we specify the details of how to implement a FPAPR program by using two NPB kernels as examples. Third, we theoretically analyze the overhead of FPAPR, and find out that the overhead of FPAPR decreases with the increase of the number of processors. At last, the experimental results on a 512-CPU cluster show the overhead introduced by the algorithm is very small.

关键词： high-performance computing fault tolerance parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

Semantics driven dynamic partial-order reduction of MPI-based parallel programs

Semantics driven dynamic partial-order reduction of MPI-base...

引用

2007 ACM international symposium on Software Testing and Analysis, ISSTA'07 and PADTAD-V Workshop

作者： Palmer, Robert Gopalakrishnan, Ganesh Kirby, Robert M. School of Computing University of Utah Salt Lake City UT 84112 United States

ISBN: (纸本)159593748X

Most distributed parallel programs in the high performance computing (HPC) arena are written using the MPI library. There is growing interest in using model checking for debugging these MPI programs. In this context, partial-order reduction has considerable potential for containing state explosion, given the distributed memory nature of MPI programs. This potential is largely unmet. In this paper, we first define the formal semantics for a non-trivial subset of MPI. We then prove independence theorems based on theformal semantics, paving the way to a semantically clear and general partial-order reduction approach for MPI. Our work describes, for the first time, the exact dependencies between MPI non-blocking send operations and their tests for completion, namely wait and test. We also offer a cleaner solution than in previous works for MPI wildcard receives,a proper handling of which requires knowledge of the future course of computations. We show that Flanagan and Godefroid's dynamic patial-order reduction algorithm offers a natural way to handle the need for future information. Our initial experimental results are encouraging. Copyright 2007 ACM.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

international symposium on Fundamentals of Software Engineering: international symposium, FSEN 2007, proceedings

International Symposium on Fundamentals of Software Engineer...

引用

2nd IPM international symposium on Fundamentals of Software Engineering, FSEN 2007

ISBN: (纸本)9783540756972

The proceedings contain 32 papers. The topics discussed include: finite abstract models for deterministic transition systems: fair parallel composition and refinement-preserving logic;slicing abstractions;formalizing compatibility and substitutability in communication protocols using I/O-constraint automata;is your security protocol on time?;adapting the UPPAAL model of a distributed lift system;zone-based universality analysis for single-clock timed automata;compositional semantics of system-level designs written in SystemC;reusing requirements: the need for extended variability models;test selection criteria for quantifier-free first-order specifications;formal testing of systems presenting soft and hard deadlines;automatic composition of stateless components: a logical reasoning approach;and a model of component-based programming.

关键词： Technical presentations

来源：评论

学校读者我要写书评

暂无评论

parallel XML processing by work stealing

Parallel XML processing by work stealing

引用

16th international symposium on High Performance distributed Computing 2007, HPDC'07 and Co-Located Workshops

作者： Lu, Wei Gannon, Dennis Indiana University 150 S. Woodlawn Ave. Bloomington IN 47405

ISBN: (纸本)159593717X

A language for semi-structured documents, XML has emerged as the core of the web services architecture, and is playing crucial roles in messaging systems, databases, and document processing. However, the processing of XML documents has been regarded as the performance bottleneck in most systems and applications. On the other side, the multicore processor, emerged as a solution for the clock-speed limitation of the modern CPUs, has been growingly prevalent. Leveraging the parallelism provided by the multicorere source to speedup the software execution is becoming the trend of the software development. In this paper, we present a parallel processing model for the XML document. The model is not designed just for a specific XML processing task, instead, it is a general model, by which we are able to explore various parallel XML document processing. The kernel of the model is a stealing-based dynamic load-balancing mechanism, called ThreadCrew, by which multiple threads are able to process the disjointed parts of the XML document in parallel with balanced load distribution. The model also provides a novel mechanism to trace the stealing actions, thus the equivalent sequential result can be gotten by gluing the multiple parallel-running results together. To show the feasibility and effectiveness of our approaches, we present our C# implementation of parallel XML serialization in this paper. Our empirical study shows our parallel XML serialization algorithm can improved the XML serializing performance significantly on a multicore machine. Copyright 2007 ACM.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Adaptive scheduling with parallelism feedback

Adaptive scheduling with parallelism feedback

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Agrawal, Kunal He, Yuxiong Hsu, Wen-Jing Leiserson, Charles E. Massachusetts Institute of Technology 32 Vassar Street Cambridge MA 02139 United States Nanyang Technological University Nanyang Avenue 639798 Singapore Singapore

ISBN: (纸本)1424409101

Multiprocessor scheduling in a shared multiprogramming environment can be structured as two-level scheduling, where a kernel-level job scheduler allots processors to jobs and a user-level thread scheduler schedules the work of a job on the allotted processors. In this context, the number of processors allotted to a particular job may vary during the job's execution, and the thread scheduler must adapt to these changes in processor resources. For overall system efficiency, the thread scheduler should also provide parallelism feedback to the job scheduler to avoid allotting a job more processors than it can use productively. This paper provides an overview of several adaptive thread schedulers we have developed that provide provably good history-based feedback about the job's parallelism without knowing the future of the job. These thread schedulers complete the job in near-optimal time while guaranteeing low waste. We have analyzed these thread schedulers under stringent adversarial conditions, showing that the thread schedulers are robust to various system environments and allocation policies. To analyze the thread schedulers under this adversarial model, we have developed a new technique, called trim analysis, which can be used to show that the thread scheduler provides good behavior on the vast majority of time steps, and performs poorly on only a few. When our thread schedulers are used with dynamic equipartitioning and other related job scheduling algorithms, they are O(1)-competitive against an optimal offline scheduling algorithm with respect to both mean response time and makespan for batched jobs and nonbatched jobs, respectively. Our algorithms are the first nonclairvoyant scheduling algorithms to offer such guarantees.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Prepositions and conjunctions in a natural language interfaces to databases

Prepositions and conjunctions in a natural language interfac...

引用

5th international symposium on parallel and distributed Processing and Applications, ISPA 2007 international Workshops: SSDSN, UPWN, WISH, SGC, ParDMCom, HiPCoMB, and IST-AWSN

作者： González B., J. Javier Pazos R., Rodolfo A. Gelbukh, Alexander Sidorov, Grigori Fraire H., Hector Cruz C., I. Cristina Instituto Tecnológico de Ciudad Madero Mexico Mexico Centro de Investigación en Computación

ISBN: (纸本)9783540747666

This paper present the treatment of prepositions and conj unctions in natural language interfaces to databases (NLIDB) that allows better translation of queries expressed in natural language into formal languages. Prepositions and conjunctions weren't sufficiently studied for their usage in NLIDBs, because most of the NLIDBs just look for keywords in the sentences and focus their analysis on nouns and verbs getting rid of auxiliary words in the query. This paper shows that prepositions and conjunctions can be represented as operations using formal set theory. Additionally, since prepositions and conjunctions keep their meaning in any context, their treatment is domain independent. In our experiments we used Spanish language. We validate our approach using two databases;Northwind and Pubsof SQL Server, with a corpus of 198 different queries for the first one and 70 queries for the second one. The 84% of queries were translated correctly for the database Northwind and 80% for Pubs. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

distributed multi-lingual content based text mining DML - CBTM

Distributed multi-lingual content based text mining DML - CB...

引用

3rd IASTED international Conference on Advances in Computer Science and Technology, ACST 2007

作者： Chitrakala, S. Manjula, D. Department of Computer Science and Engineering Easwari Engineering College Ramapuram Anna University Chennai Tamil Nadu India Department of Computer Science and Engineering College of Engineering Guindy Anna University Chennai Tamil Nadu India

ISBN: (纸本)9780889866560

With the explosion in information over the internet, extracting knowledge from media-based data in the form of images, audio streams and videos replacing textual ones is getting more complex. So a comprehensive methodology covering all forms of data are needed which is able to provide the contents of the data in a short period of time. Text mining tools and algorithms are becoming increasingly popular with many of the books, texts and documentation getting converted to soft-copy versions and being made globally accessible. Though this trend is predominantly in English language, the need has arisen for such an approach for other languages too, as many of the ancient and out-of-print texts in different languages are getting 'softer' versions for preserving and extraction of Information and Knowledge. In the context of Indian languages this need is more pronounced as many texts in different languages, scripts, different material forms ranging from palm leaves to stone cutting and dialects are available having wealth of information in variety of disciplines. In this paper, we propose a novel contentbased approach and demonstrate for textual data in the first instance, to be termed as CBTM (Content-Based Text-Mining) for knowledge discovery of multilingual texts. The proposed methodology employs a content based approach using keywords and patterns stored in the form of gif strings so that extensions to other forms of data are possible. Potential applications of this approach in a distributed environment are also highlighted. We have used the advertisements in newspapers for demonstrating the system.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：