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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,924 篇 会议
149 篇 期刊文献
10 册 图书

馆藏范围

2,083 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,313 篇 工学
- 1,193 篇 计算机科学与技术...
- 870 篇 软件工程
- 227 篇 信息与通信工程
- 174 篇 控制科学与工程
- 134 篇 电气工程
- 79 篇 电子科学与技术（可...
- 73 篇 生物医学工程（可授...
- 72 篇 生物工程
- 40 篇 建筑学
- 36 篇 动力工程及工程热...
- 35 篇 机械工程
- 35 篇 光学工程
- 29 篇 仪器科学与技术
- 29 篇 化学工程与技术
- 27 篇 力学（可授工学、理...
- 27 篇 土木工程
499 篇 理学
- 378 篇 数学
- 102 篇 物理学
- 78 篇 统计学（可授理学、...
- 75 篇 生物学
- 26 篇 化学
- 22 篇 系统科学
278 篇 管理学
- 169 篇 图书情报与档案管...
- 124 篇 管理科学与工程(可...
- 89 篇 工商管理
66 篇 教育学
- 64 篇 教育学
63 篇 医学
- 61 篇 临床医学
- 34 篇 基础医学(可授医学...
- 24 篇 药学(可授医学、理...
29 篇 法学
- 24 篇 社会学
18 篇 经济学
9 篇 农学
3 篇 军事学
1 篇 文学
1 篇 艺术学

主题

91 篇 mobile computing
72 篇 distributed comp...
69 篇 computer science
54 篇 grid computing
47 篇 application soft...
40 篇 concurrent compu...
39 篇 computational mo...
36 篇 computer network...
34 篇 computer archite...
32 篇 cloud computing
29 篇 virtual reality
29 篇 ubiquitous compu...
27 篇 internet
26 篇 costs
25 篇 laboratories
23 篇 peer to peer com...
23 篇 middleware
20 篇 parallel process...
20 篇 processor schedu...
20 篇 hardware

机构

20 篇 the hong kong po...
18 篇 hong kong polyte...
18 篇 department of co...
15 篇 school of comput...
15 篇 school of comput...
12 篇 institute of com...
12 篇 department of co...
10 篇 nit calicut
10 篇 depauw universit...
10 篇 national institu...
9 篇 school of comput...
8 篇 college of compu...
7 篇 school of comput...
7 篇 school of comput...
6 篇 university of lo...
6 篇 pablo de olavide...
6 篇 department of co...
6 篇 college of compu...
6 篇 department of co...
6 篇 school of comput...

作者

25 篇 hong va leong
18 篇 leong hong va
15 篇 alvin chan
13 篇 hong jiman
11 篇 hung chih-cheng
11 篇 chan alvin t.s.
10 篇 liu ling
10 篇 gloria childress...
10 篇 george roussos
8 篇 umesh bellur
8 篇 song enmin
7 篇 rajiv ramnath
7 篇 pu calton
7 篇 si antonio
7 篇 ahamed sheikh iq...
7 篇 chandran priya
6 篇 federico divina
6 篇 sheikh iqbal aha...
6 篇 madhu kumar s.d.
6 篇 raúl giráldez ro...

语言

2,037 篇 英文
41 篇 其他
3 篇 中文
2 篇 葡萄牙文

检索条件"任意字段=Applied Computing 2004 - Proceedings of the 2004 ACM Symposium on Applied Computing"

共 2083 条记录，以下是1441-1450 订阅

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

详细简洁

排序：

Dynamic Euler Diagram Drawing

Dynamic Euler Diagram Drawing

引用

IEEE symposium on Visual Languages and Human Centric computing (VL/HCC)

作者： P. Rodgers P. Mutton J. Flower Computing Laboratory University of Kent UK Visual Modelling Group University of Brighton UK

In this paper we describe a method to lay out a graph enhanced Euler diagram so that it looks similar to a previously drawn graph enhanced Euler diagram. This task is nontrivial when the underlying structures of the diagrams differ. In particular, if a structural change is made to an existing drawn diagram, our work enables the presentation of the new diagram with minor disruption to the user's mental map. As the new diagram can be generated from an abstract representation, its initial embedding may be very different from that of the original. We have developed comparison measures for Euler diagrams, integrated into a multicriteria optimizer, and applied a force model for associated graphs that attempts to move nodes towards their positions in the original layout. To further enhance the usability of the system, the transition between diagrams can be animated

关键词： Laboratories Force measurement Position measurement Usability Animation Data structures Humans Writing Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A component-based programming model for autonomic applications

A component-based programming model for autonomic applicatio...

引用

International Conference on Autonomic computing (ICAC)

作者： Hua Liu M. Parashar S. Hariri The Applied Software Systems Laboratory Department of Electrical and Computer Engineering Rutgers University Piscataway NJ USA Department of Electrical and Computer Engineering University of Arizona Tucson AZ USA

The emergence of pervasive wide-area distributed computing environments, such as pervasive information systems and computational grids, has enabled new generations of applications that are based on seamless access, aggregation and interaction. However, the inherent complexity, heterogeneity and dynamism of these systems require a change in how the applications are developed and managed. In this paper we present a component-based programming framework to support the development of autonomic self-managed applications. The framework enables the development of autonomic components and the formulation of autonomic applications as the dynamic composition and management of autonomic components. The operation of the proposed framework is illustrated using a forest fire application.

关键词： Grid computing Distributed computing Pervasive computing Crisis management Application software Management information systems Mesh generation Disaster management Programming profession Fires

来源：评论

学校读者我要写书评

暂无评论

3rd International Conference on Artificial Immune Systems, ICARIS 2004

引用

3rd International Conference on Artificial Immune Systems, ICARIS 2004

ISBN: (纸本)3540230971

The proceedings contain 35 papers. The special focus in this conference is on Applications of Artificial Immune Systems (Technical Stream), Conceptual, Formal, and Theoretical Frameworks (Conceptual Stream). The topics include: Negative selection algorithm for aircraft fault detection;a hierarchical immune network applied to gene expression data;artificial immune regulation (AIR) for model-based fault diagnosis;optimal circuit design using immune algorithm;towards a conceptual framework for artificial immune systems;immunologic responses manipulation of AIS agents;optima, extrema, and artificial immune systems;an immuno control framework for decentralized mechatronic control;AIS based robot navigation in a rescue scenario;reactive immune network based mobile robot navigation;a fractal immune network;a user profiling model based on a self-organising term network;towards danger theory based artificial APC model;online negative databases;definition of MHC supertypes through clustering of MHC peptide binding repertoires;prediction of continuous B-cell epitopes in antigenic sequences using physico-chemical properties;integration of immune models using petri nets;MHC class I epitope binding prediction trained on small data sets;convergence analysis of a multiobjective artificial immune system algorithm;a comparison of immune and neural computing for two real-life tasks of pattern recognition;an artificial immune system based visual analysis model and its real-time terrain surveillance application;exploring the capability of immune algorithms;exploiting immunological properties for ubiquitous computing systems;a robust immune based approach to the iterated prisoner's dilemma;artificial innate immune system;immune system approaches to intrusion detection - a review;multimodal search with immune based genetic programming and an artificial immune system for misbehavior detection in mobile ad-hoc networks with virtual thymus, clustering, danger signal, and memory detectors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A high-throughput computing environment for job shop scheduling (JSP) genetic algorithms

A high-throughput computing environment for job shop schedul...

引用

Congress on Evolutionary Computation

作者： P. Walsh P. Fenton Department of Maths & Computing Cork Institute of Technology Ireland

Genetic algorithms (GAs) have long been applied to tackling scheduling problems, particularly JSP, with varying degrees of success. However despite advances in GA theory, GAs remain a computationally expensive method of approaching scheduling problems (Wall, 1996). In particular for practical scheduling problems, such as those outlined in Madureira et al. (2001) and Noivo and Ramalhinho-Lourenco, GAs require extensive resources. We propose a grid based high-throughput computing framework that utilises spare computing capacity, which is distributed across a network, to address real scheduling problems. We use Web services as a gateway to this high-throughput computing environment.

关键词： Job shop scheduling Genetic algorithms Processor scheduling Encoding Scheduling algorithm Content addressable storage Computer networks Distributed computing Grid computing Manufacturing

来源：评论

学校读者我要写书评

暂无评论

Introduction from the session chair advances in web computing

Introduction from the session chair advances in web computin...

引用

EUROMICRO Conference

作者： K. Klockner Fraunhofer-Institute of Applied Information Technology Sankt Augustin Germany

Presents the introductory welcome message from the conference proceedings. May include the conference officer(s) offer(s) congratulations to all involved with the conference event and publication of the proceedings re...

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Split-combination Method for Merging Inconsistent Possibilistic Knowledge Bases 9

A Split-combination Method for Merging Inconsistent Possibil...

引用

9th International Conference on Principles of Knowledge Representation and Reasoning, KR 2004

作者： Qi, Guilin Liu, Weiru Glass, David H. School of Computer Science Queen's University Belfast BelfastBT7 1NN United Kingdom School of Computing and Mathematics University of Ulster Co.AntrimBT37 0QB United Kingdom

ISBN: (纸本)1577351991

In this paper, a new method for merging multiple inconsistent knowledge bases in the framework of possibilistic logic is presented. We divide the fusion process into two steps: one is called the splitting step and the other is called the combination step. Given several inconsistent possibilistic knowledge bases (i.e. the union of these possibilistic bases is inconsistent), we split each of them into two subbases according to the upper free degree of their union, such that one subbase contains formulas whose necessity degrees are less than the upper free degree and the other contains formulas whose necessity degrees are greater than the upper free degree. In the second step, we combine the former using the maximum (or more generally, T-conorm) combination mode, while combining the latter using the minimum (or more generally, T-norm) combination mode. The union of the possibilistic bases obtained by the second step is taken as the final result of the combination of the possibilistic bases that we want to merge. We prove that when the possibilistic bases are consistent with each other, the result of our new combination method is equivalent to that of the minimum (T-norm) based combination mode. However, when the sources are inconsistent with each other, the result of our combination mode is better than that obtained by using the maximum (T-conorm) based mode. An alternative approach to splitting the possibilistic bases is introduced in the last section. The combination mode obtained by this splitting method can be applied to combine knowledge bases which are flat, i.e., without any priority between their elements. Copyright © 2004, American Association for Artificial Intelligence (***). All rights reserved.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Parallel implementation of the treecode Ewald method

Parallel implementation of the treecode Ewald method

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： D. Liu Z.-H. Duan R. Krasny J. Zhu Department of Computer Science University of Akron Akron OH USA University of Akron Akron OH US Department of Mathematics University of Michigan Ann Arbor MI USA Department of Theoretical and Applied Mathematics University of Akron Akron OH USA

Summary form only given. Here, we discuss an efficient parallel implementation of the treecode Ewald method for fast evaluation of long-range Coulomb interactions in a periodic system for molecular dynamics simulations. The parallelization is based on an adaptive decomposition scheme using the Morton order of the particles. This decomposition scheme takes advantage of the data locality and involves minimum changes to the original sequential code. The message passing interface (MPI) is used for interprocessor communications, making the code portable to a variety of parallel computing platforms. We also discuss communication and performance models for our parallel algorithm. The predicted communication time and parallel performance from these models match the measured results well. Timing results obtained using a system of water molecules on the IA32 Cluster at the Ohio Supercomputer Center demonstrate high speedup and efficiency of the parallel treecode Ewald method.

关键词： Computational modeling Biological system modeling Computational efficiency Mathematics Computer simulation Biology computing Biological information theory Costs Clustering algorithms Computer science

来源：评论

学校读者我要写书评

暂无评论

Bit noise from an optical logic gate with laser diodes

Bit noise from an optical logic gate with laser diodes

引用

Conference on Fluctuations and Noise in Photonics and Quantum Optics II

作者： González-Marcos, AP Martín-Pereda, JA Hurtado, A Univ Politecn Madrid ETS Ingn Telecomun E-28040 Madrid Spain

ISBN: (纸本)0819453919

Output bits from an optical logic cell present noise due to the type of technique used to obtain the Boolean functions of two input data bits. We have simulated the behavior of an optically programmable logic cell working with Fabry Perot-laser diodes of the same type employed in optical communications (1550nm) but working here as amplifiers. We will report in this paper a study of the bit noise generated from the optical non-linearity process allowing the Boolean function operation of two optical input data signals. Two types of optical logic cells will be analyzed. Firstly, a classical "on-off" behavior, with transmission operation of LD amplifier and, secondly, a more complicated configuration with two LD amplifiers, one working on transmission and the other one in reflection mode. This last configuration has nonlinear behavior emulating SEED-like properties. In both cases, depending on the value of a "1" input data signals to be processed, a different logic function can be obtained. Also a CW signal, known as control signal, may be apply to fix the type of logic function. The signal to noise ratio will be analyzed for different parameters, as wavelength signals and the hysteresis cycles regions associated to the device, in relation with the signals power level applied. With this study we will try to obtain a better understanding of the possible effects present on an optical logic gate with Laser Diodes.

关键词： optical-noise semiconductor-lasers optical-bistability optical computing logic cell

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms design for disk partial covering problem

Approximation algorithms design for disk partial covering pr...

引用

International symposium on Parallel Architectures, Algorithms and Networks (ISPAN)

作者： Bin Xiao Jiannong Cao Qingfeng Zhuge Yi He E.H.-M. Sha Department of Computing Hong Kong Polytechnic University Hong Kong China Department of Computer Science University of Texas Dallas Richardson TX USA

Mobile servers are established to provide services for mobile nodes in an anticipated area. If the distribution of mobile nodes can be foreseen, the location of mobile servers becomes critical to the QoS of wireless systems. Under resource and topology constraints, it is very difficult to figure out a solution, or unable to cover all given mobile nodes within limited number of mobile servers. In this paper, we study the issue of the partial covering problem such that part of mobile nodes to be covered. Several approximation algorithms are proposed to cover the maximum number of elements. For real time systems, such as the battlefield communication system, the proposed algorithms with polynomial-time complexity can be efficiently applied. The algorithm complexity analysis illustrates the improvement made by our algorithms. The experimental results show that the performance of our algorithms is much better than other existing 3-approximation algorithm for the robust k-center problem.

关键词： Approximation algorithms Algorithm design and analysis Polynomials Heuristic algorithms Mobile computing Mobile communication Extraterrestrial measurements Helium Computer science Topology

来源：评论

学校读者我要写书评

暂无评论

A basis-independent algorithm to design fast parallel multipliers over GF(2/sup m/)

A basis-independent algorithm to design fast parallel multip...

引用

International Conference on Information Technology: Coding and computing (ITCC)

作者： M. Elia M. Leone C.so Duca degli Abbruzzi 24 Politecnico di Turino Torino Italy Telecom Italia Laboratory Torino Italy

We present a general algorithm to design fast parallel multipliers in any basis over GF(2/sup m/), avoiding any basis-dependent procedure or "ad hoc" optimization, as usually proposed in literature. Although the total number of gates is not guaranteed to be the absolute minimum, the algorithm is aimed at minimizing the number of XOR gates, reaching the minimum for the AND gate number. For the sake of comparison, lower and upper bounds to space and time complexities have been explicitly evaluated. As a significant example, for several in of practical interest, the algorithm has been applied to Gaussian normal basis parallel multipliers.

关键词： Algorithm design and analysis Gaussian processes Circuits Space technology Design optimization Upper bound Signal processing Galois fields Telecommunication computing Cryptography

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共209页 << < 141 142 143 144 145 146 147 148 149 150 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：