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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1521-1530 订阅

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

详细简洁

排序：

ACT: an adaptive CORBA template to support unanticipated adaptation

ACT: an adaptive CORBA template to support unanticipated ada...

引用

International Conference on Distributed computing Systems

作者： S.M. Sadjadi P.K. McKinley Software Engineering and Network Systems Laboratory Michigan State University East Lansing MI USA

We propose an Adaptive CORBA Template (ACT), which enables run-time improvements to CORBA applications in response to unanticipated changes in either their functional requirements or their execution environments. ACT enhances CORBA applications by transparently weaving adaptive code into their object request brokers (ORBs) at run time. The woven code intercepts and adapts the requests, replies, and exceptions that pass through the ORBs. Specifically, ACT can be used to develop an object-oriented framework in any language that supports dynamic loading of code and can be applied to any CORBA ORB that supports portable interceptors. Moreover, ACT can be used to support interoperation among otherwise incompatible adaptive CORBA frameworks. To evaluate the performance and functionality of ACT, we implemented a prototype in Java. Our experimental results show that the overhead introduced by the ACT infrastructure is negligible, while the adaptations offered are highly flexible.

关键词： Adaptive coding Java Quality of service Fault tolerance Application software Middleware Distributed computing Software engineering Computer science Runtime

来源：评论

学校读者我要写书评

暂无评论

Image segmentation by tree pruning

Image segmentation by tree pruning

引用

Brazilian symposium on Computer Graphics and Image Processing (SIBGRAPI)

作者： A.X. Falcao F.P.G. Bergo P.A.V. Miranda Institute of Computing State University of Campinas Sao Paulo Brazil

The image foresting transform (IFT) has been proposed for the design of image operators based on connectivity. The IFT reduces image processing problems into a minimum-cost path forest problem in a graph derived from the image. It has been successfully used for image filtering, segmentation, and analysis. In this work, we propose a novel image operator which solves segmentation by pruning trees of the forest. First, an IFT is applied to create an optimum-path forest whose roots are pixels selected inside a desired object. In this forest, the background consists of a few subtrees rooted at pixels on the object's boundary. These boundary pixels are identified and their subtrees are eliminated, such that the remaining forest defines the object. The tree pruning is an effective alternative to situations where image segmentation methods based on competing seeds fail. We present an interactive implementation of the tree-pruning technique, show several examples and discuss some experiments toward fully automatic segmentation.

关键词： Image segmentation Pixel Image processing Image analysis Tree graphs Topology Geophysics computing Filtering Application software Computer graphics

来源：评论

学校读者我要写书评

暂无评论

Rudder: a rule-based multi-agent infrastructure for supporting autonomic Grid applications

Rudder: a rule-based multi-agent infrastructure for supporti...

引用

International Conference on Autonomic computing (ICAC)

作者： Zhen Li M. Parashar The Applied Software Systems Laboratory Rutgers University Piscataway NJ USA

The emerging pervasive information and computational Grid is enabling a new generation of autonomic applications that continuously interact with their environments and with each other to monitor, adapt and optimize their execution. However, supporting these context-aware self-managing applications in widely distributed, heterogeneous and highly dynamic Grid environments requires suitable and effective coordination middleware services. The article presents the architecture and operation of Rudder, a rule-based adaptive multi-agent infrastructure for supporting autonomic applications in pervasive Grid environments. Specifically, Rudder enables dynamic composition and coordination of autonomic components to manage changing application requirements and system context. The design builds on three basic concepts: (1) software agents that dynamically define, deploy and execute rules to achieve self-behaviors, operating within flexible organizational structures while being situated in the dynamic pervasive Grid environments; (2) composition rules dynamically enabling application workflows, which can be executed using autonomic components; (3) a decentralized reactive tuple-space can scalably support agent coordination, execution of composition rules and creation of application workflows in Grid environments. The operation of Rudder is illustrated using an autonomic oil reservoir optimization application.

关键词： Application software Grid computing Pervasive computing Mesh generation Monitoring Context-aware services Middleware Computer architecture Software agents Petroleum

来源：评论

学校读者我要写书评

暂无评论

A dynamically tuned sorting library 04

A dynamically tuned sorting library

引用

International symposium on Code Generation and Optimization (CGO)

作者： X. Li M.J. Garzaran D. Padua University of Illinois Urbana-Champaign USA

ISBN: (纸本)9780769521022

Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that delivers the best performance. In the past, empirical search has been applied almost exclusively to scientific problems. In this paper, we discuss the application of empirical search to sorting, which is one of the best understood symbolic computing problems. When contrasted with the dense numerical computations of ATLAS, FFTW, and SPIRAL, sorting presents a new challenge, namely that the relative performance of the algorithms depend not only on the characteristics of the target machine and the size of the input data but also on the distribution of values in the input data set. Empirical search is applied in the study reported here as part of a sorting library generator. The resulting routines dynamically adapt to the characteristics of the input data by selecting the best sorting algorithm from a small set of alternatives. To generate the run time selection mechanism our generator makes use of machine learning to predict the best algorithm as a function of the characteristics of the input data set and the performance of the different algorithms on the target machine. This prediction is based on the data obtained through empirical search at installation time. Our results show that our approach is quite effective. When sorting data inputs of 12M keys with various standard deviations, our adaptive approach selected the best algorithm for all the input data sets and all platforms that we tried in our experiments. The wrong decision could have introduced a performance degradation of up to 133%, with an average value of 44%.

关键词： Sorting Libraries Signal processing algorithms Spirals Machine learning algorithms Character generation Polarization Distributed computing Machine learning Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

Unified selectable fixed-coefficient recursive structures for computing DCT, IMDCT and subband synthesis filtering

Unified selectable fixed-coefficient recursive structures fo...

引用

IEEE International symposium on Circuits and Systems (ISCAS)

作者： Zhan-Yuan Cheng Che-Hong Chen Bin-Da Liu Jar-Ferr Yang Department of Electrical Engineering National Cheng Kung University Tainan Taiwan

ISBN: (纸本)078038251X

In this paper, a unified fixed-coefficient recursive structure for computing the general length discrete transforms is proposed. After the regular data preprocessing, the general discrete transforms are simplified and converted into the simpler DCT, which is realized in a second-order infinite-impulse responses (IIR) filter. The proposed recursive structure only requires half the recursive cycles and also achieves more accurate results than the existing ones. Furthermore, the proposed algorithm can be applied to many popular transforms, such as subband synthesis filtering, inverse modified discrete cosine transform (IMDCT) and all discrete cosine transform (DCT) types. The proposed structure is extremely regular and more suitable for VLSI implementation.

关键词： Discrete cosine transforms IIR filters Discrete transforms Filtering algorithms Very large scale integration Multimedia systems Computer architecture Data preprocessing Multimedia communication MPEG 4 Standard

来源：评论

学校读者我要写书评

暂无评论

Percolation search in power law networks: making unstructured peer-to-peer networks scalable

Percolation search in power law networks: making unstructure...

引用

International Conference on Peer-to-Peer computing

作者： N. Sarshar P.O. Boykin V.P. Roychowdhury Department of Electrical Engineering UCLA USA

We introduce a scalable searching protocol for locating and retrieving content in random networks with power-law (PL) and heavy-tailed degree distributions. The proposed algorithm is capable of finding any content in the network with probability one in time O(logN), with a total traffic that provably scales sub-linearly with the network size, N. Unlike other proposed solutions, there is no need to assume that the network has multiple copies of contents; the protocol finds all contents reliably, even if every node in the network starts with a unique content. The scaling behavior of the size of the giant connected component of a random graph with heavy tailed degree distributions under bond percolation is at the heart of our results. The percolation search algorithm can be directly applied to make unstructured peer-to-peer (P2P) networks, such as Gnutella, Limewire and other file-sharing systems (which naturally display heavy-tailed degree distributions and scale-free network structures), scalable. For example, simulations of the protocol on the limewire crawl number 5 network, consisting of over 65,000 links and 10,000 nodes, shows that even for this snapshot network, the traffic can be reduced by a factor of at least 100, and yet achieve a hit-rate greater than 90%.

关键词： Intelligent networks Peer to peer computing Protocols Telecommunication traffic Computer networks Content based retrieval Bonding Heart Displays Computer simulation

来源：评论

学校读者我要写书评

暂无评论

Electrical performance simulation of inhomogeneous multilayer LTCC structure by hybrid method

Electrical performance simulation of inhomogeneous multilaye...

引用

Electronics Packaging Technology Conference (EPTC)

作者： Enxiao Liu Er-ping Li Le-wei Li Institute of High Performance Computing Singapore Department of Electrical and Computer Engineering National University of Singapore Singapore

ISBN: (纸本)0780388216

A new hybrid finite-difference time-domain and mixed-potential integral equation method (hybrid FDTD-MPIE) is developed for the modeling of multilayer planar structures with locally inhomogeneous objects. By using equivalence principle, the original problem can be decomposed into external and internal problems. The FDTD method is applied to solve the internal problem, which contains the locally inhomogeneous dielectric objects. Conversely, the frequency domain MPIE method is employed to address the external problem of the global multilayered planar structure. The FDTD model and the MPIE model are coupled together by enforcing the continuity of tangential fields on the equivalent surface. Both the direct and iterative method is demonstrated in This work to solve the integral-differential problem. In addition, the DCIM method is applied to improve the computational efficiency. Numerical results are presented to validate the proposed hybrid FDTD-MPIE method.

关键词： Nonhomogeneous media Finite difference methods Time domain analysis Integral equations Millimeter wave technology Space technology Iterative methods Electromagnetic modeling Computational modeling High performance computing

来源：评论

学校读者我要写书评

暂无评论

Mutation-based exploration of a method for verifying concurrent Java components

Mutation-based exploration of a method for verifying concurr...

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： B. Long R. Duke D. Goldson P. Strooper L. Wildman School of Information Technology and Elec. Eng. University of Queensland Brisbane QLD Australia

Summary form only given. The Java programming language supports concurrency. Concurrent programs are harder to verify than their sequential counterparts due to their inherent nondeterminism and a number of specific concurrency problems such as interference and deadlock. In previous work, we proposed a method for verifying concurrent Java components based on a mix of code inspection, static analysis tools, and the ConAn testing tool. The method was derived from an analysis of concurrency failures in Java components, but was not applied in practice. In this paper, we explore the method by applying it to an implementation of the well-known readers-writers problem and a number of mutants of that implementation. We only apply it to a single, well-known example, and so we do not attempt to draw any general conclusions about the applicability or effectiveness of the method. However, the exploration does point out several strengths and weaknesses in the method, which enable us to fine-tune the method before we carry out a more formal evaluation on other, more realistic components.

关键词： Java Concurrent computing Yarn Australia Interference System recovery Inspection Testing Failure analysis Application software

来源：评论

学校读者我要写书评

暂无评论

Dynamic update of shortest path tree in OSPF

Dynamic update of shortest path tree in OSPF

引用

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

作者： Bin Xiao Jiannong Cao Qingfeng Zhuge Zili Shao 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

The shortest path tree (SPT) construction is a critical issue to the high performance routing in an interior network using link state protocols, such as open shortest path first (OSPF) and IS-IS. In this paper, we propose a new efficient algorithm for dynamic SPT update to avoid the disadvantages (e.g. redundant computation) caused by static SPT update algorithms. The new algorithm is based on the understanding of the update procedure to reduce redundancy. Only significant elements that contribute to the construction of new SPT from the old one are focused on. The efficiency of our algorithm is improved because it only pay attention to the edges really count for the update process. The running time for the proposed algorithm is maximum reduced, which is shown through experimental results. Furthermore, our algorithm can be easily generalized to solve the SPT updating problem in a graph with negative weight edges and applied to the scenario of multiple edge weight changes.

关键词： Routing protocols Heuristic algorithms Computer networks Network topology Computer science IP networks Costs Delay Buildings Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

Efficient decentralized power control via a compensation mechanism

Efficient decentralized power control via a compensation mec...

引用

IEEE Princeton Section Sarnoff symposium

作者： V. Rodriguez ECE Department Polytechnic University Brooklyn NY USA

A "mechanism" is a set of procedures and rules intended to lead selfish entities to a desirable outcome, "on their own". This work applies a relatively simple mechanism, available in the economics literature, to achieve an efficient decentralized allocation of power among data-transmitting terminals. The resulting operating point is "efficient", because terminals end up "fairly" compensating each other for the interference each one causes. The same ideas can be fruitfully applied in more general networks, and outside the engineering context.

关键词： Power control Interference Power generation economics Distributed control Centralized control Communication system control Peer to peer computing Power engineering and energy Context Computer networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共209页 << < 149 150 151 152 153 154 155 156 157 158 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：