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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,307 篇 工学
- 1,192 篇 计算机科学与技术...
- 869 篇 软件工程
- 227 篇 信息与通信工程
- 175 篇 控制科学与工程
- 129 篇 电气工程
- 79 篇 电子科学与技术（可...
- 73 篇 生物医学工程（可授...
- 72 篇 生物工程
- 40 篇 建筑学
- 36 篇 动力工程及工程热...
- 35 篇 机械工程
- 35 篇 光学工程
- 29 篇 仪器科学与技术
- 29 篇 化学工程与技术
- 27 篇 力学（可授工学、理...
- 27 篇 土木工程
500 篇 理学
- 378 篇 数学
- 102 篇 物理学
- 78 篇 统计学（可授理学、...
- 75 篇 生物学
- 26 篇 化学
- 23 篇 系统科学
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
53 篇 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 篇 hardware
20 篇 delay

机构

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,026 篇 英文
46 篇 其他
3 篇 中文
2 篇 葡萄牙文

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

共 2077 条记录，以下是1651-1660 订阅

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

详细简洁

排序：

Texture based segmentation: automatic selection of co-occurrence matrices

Texture based segmentation: automatic selection of co-occurr...

引用

International Conference on Pattern Recognition

作者： R. Zwiggelaar School of Computing Sciences University of East Anglia Norwich UK

Texture is one of the least understood areas in computer vision. One of the major short-comings of texture segmentation approaches has been the ad-hoc selection of the set of feature vectors. We present an approach to qualitatively select a sub-set of a large (in principle infinite) set of co-occurrence matrices. A transportation measure is used to determine the difference between co-occurrence matrices resulting from various textures. This results in an ordered set of matrices, of which the resulting segmentation performance is directly related to the transportation measure. By combining segmentation results from various matrices, the overall performance improves only when the matrices enhance different image areas. The most probable candidates for this can be obtained by using the same transportation measure applied to n dimensional co-occurrence data. Again, this results in an ordered set. Texture segmentation results indicate a monotone increase in performance when adding subsequent matrices results from the ordered set.

关键词： Transportation Image segmentation Computer vision Cost function Application software Data mining Testing Pattern recognition Size measurement Linear programming

来源：评论

学校读者我要写书评

暂无评论

A naiive bayes learning based website reconfiguration system

A naiive bayes learning based website reconfiguration system

引用

International Conference on Machine Learning and Applications (ICMLA)

作者： Jia Li Huiqing Li Xiumei Jia Department of Computing Science University of Alberta Canada Department of Computer Science University of Kent UK

ISBN: (纸本)0780388232

The continuous and sharp growth of web sites in terms of size and complexity has made improving the website organization to facilitate users' navigation something of an emergency. To address this problem, in this paper we propose a website reconfiguration system using the machine learning approach. First, a Naive Bayes Classifier is trained and then applied to identify each page in a web site as important or unimportant in terms of fulfilling visitors' information needs. For those important pages, we check the reasonableness of their locations, which is measured by the average number of hops needed to reach them during visitor sessions. Those important but difficult reach pages are considered for reconfiguration, which is done by either automatically moving them to some level closer to the visitors' starting point, making it easier for users to access them, or presenting webmasters with a list of suggestions. We also propose a formula to evaluate the "global structure" of a web site, and use it to examine the effect of our system on improving website design.

关键词： Web server Navigation Web pages Web sites Data mining Web page design

来源：评论

学校读者我要写书评

暂无评论

Critical vector learning to construct RBF classifiers

Critical vector learning to construct RBF classifiers

引用

International Conference on Pattern Recognition

作者： D. Shi G.S. Ng J. Gao D.S. Yeung School of Computer Engineering Nanyang Technological University Singapore School of Mathematics Statistics and Computer Science University of New England Australia Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong China

Sensitivity is initially investigated for the construction of a network prior to its design. Sensitivity analysis applied to network pruning seems particularly useful and valuable when network training involves a large amount of redundant data. This paper proposes a novel learning algorithm for the construction of radial basis function (RBF) classifiers using sensitive vectors (SenV), to which the output is the most sensitive. In training, the number of hidden neurons and the centers of their radial basis functions are determined by the maximization of the output's sensitivity to the training data. In classification, the minimal number of such hidden neurons with the maximal sensitivity is the most generalizable to unknown data. Our experimental results suggest that our proposed methodology outperforms classical RBF classifiers constructed by clustering.

关键词： Sensitivity analysis Neurons Radial basis function networks Computer networks Support vector machines Design engineering Mathematics Statistics Computer science Variable speed drives

来源：评论

学校读者我要写书评

暂无评论

Meanshift clustering for DNA microarray analysis

Meanshift clustering for DNA microarray analysis

引用

proceedings of the IEEE Computational Systems Bioinformatics Conference, CSB

作者： D. Barash D. Comaniciu Department of Computer Science Ben-Gurion University of the Negev Beersheba Israel Integrated Data Systems Department Siemens AG Corporate Research and Development Princeton NJ USA

Meanshift clustering is a well established algorithm that has been applied successfully in image processing and computer vision. Cluster centers are derived by local mode seeking identifying maxima in the normalized density of the data set. Recently, quantum clustering that highly resembles mean shift clustering has been proposed for analyzing microarray expression data. Quantum clustering is based on physical intuition derived from quantum mechanics. By an iterative process using a gradient descent procedure, the potential energy V belonging to the Hamiltonian of the time-independent Schrodinger equation develops minima that are identified with cluster centers. The analogies between the wavefunction in quantum clustering and the multivariate kernel density estimator in meanshift clustering are leading to closely related formulations. However, the approach towards the minima of the potential in quantum clustering needs to be performed unrelatedly to the formulation, by gradient descent steps. In contrast, in meanshift clustering the approach towards the maxima of the normalized density is performed by the meanshift vector that is derived by the formulation of the methodology. It points towards the direction of the maximum increase in the underlying density. Based on these observations, we propose implementing meanshift clustering to improve the efficiency of local mode seeking in analyzing expression data.

关键词： DNA Data analysis Quantum mechanics Kernel Clustering methods Quantum computing Potential energy Computer science Data systems Educational institutions

来源：评论

学校读者我要写书评

暂无评论

A new task scheduling method for distributed programs which require memory management in grids

A new task scheduling method for distributed programs which ...

引用

Workshops on Applications and the Internet (SAINT)

作者： H. Koide Y. Oie Department of Artificial Intelligence Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Fukuoka Japan Department of Computer Science and Electronics Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Fukuoka Japan

In the grid applications, it is very likely that object oriented languages, like Java and Ruby, are employed as well as large-scale semi-structured data like XML. However, their inherent dynamic memory management has to suspend the execution of all the tasks running on processors when it is invoked. This adversely affects the grid computing severely unless the task scheduling system can avoid it with some special mechanism. We propose a new task scheduling method, referenced to as CP/MM, which can efficiently schedule tasks for applications requiring memory management. The underlying concept is to consider the cost due to memory management when the task scheduling system allocates ready coarse grain tasks, or macro-tasks, to processors. We have developed three task scheduling modules including an implementation of CP/MM into a task scheduling system is implemented on Java RMI (remote method invocation) communication infrastructure. Moreover, we evaluate the fundamental performance of CP/MM in two ways. The first is the performance evaluation of CP/MM which is applied to a small but practical test application program on a PC cluster. The second is the performance evaluation for test programs which have many tasks with complicated dependency relations on the test bed system consisting of computers on our two campuses located at a distance of approximately 32 km. These experimental results show that CP/MM can successfully prevent high priority macro-tasks from being affected by the garbage collection arising from the memory management, so that CP/MM can efficiently schedule distributed programs whose critical paths are relatively long.

关键词： Memory management Processor scheduling Grid computing Large-scale systems Computer networks Java Application software Computer science XML Data engineering

来源：评论

学校读者我要写书评

暂无评论

An agent-based framework for adaptive M-learning 2004

引用

proceedings of the 17th international conference on Innovations in applied artificial intelligence

作者： Larbi Esmahi Elarbi Badidi Center for Computing and Information System Athabasca University Athabasca Alberta Canada Département de Biochimie Université de Montréal C.P. Succursale Centreville Montréal Québec Canada

ISBN: (纸本)9783540220077

This paper describes a multiagent system for delivering adaptive m-learning services. It provides a discussion of many questions related to adaptivity and mobility in e-learning: course content adaptation, wireless access to learning services using PDA, and openness to external learning resources (learning object repositories). The paper provides a short overview of some related works and provides a detailed description of the architecture and components of the proposed multiagent framework.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-level decomposition approach to translational symmetry problems of several dimensions

Multi-level decomposition approach to translational symmetry...

引用

Antennas and Propagation Society International symposium

作者： R.W. Kindt J.L. Volakis ElectroScience Laboratory Ohio State Uinversity Columbus OH USA

Summary form only given. Finite antenna arrays consisting of regularly-spaced, arbitrarily-shaped and identical elements exhibit translational symmetry. This property can easily be exploited in conventional planar (2D) arrays, and the concept can also be applied to structures of higher dimensionality. The rigorous analysis of complex antenna elements in a finite array has been successfully carried out using the finite element-boundary integral (FE-BI) method along with a decomposition approach. In these techniques, complicated and distributed systems are modelled by decomposing the structures into like blocks, where possible, for storage and computational savings. This approach is quite efficient in most regards and when applied to finite array problems, we refer to it as the array decomposition method (ADM). It is quite successful for smaller arrays, but results in a linear increase of matrix storage for increasingly large array problems. To counter the storage problem, the approach was extended to include far-zone decomposition via the fast multipole method (FMM) (Kindt, R. and Volakis, J.L., Radio Science, 2003). This newer approach limits the near-zone interaction storage of array systems to a small number of terms. This combination of simultaneous near-zone and far-zone decompositions, the array decomposition-fast multipole method (AD-FMM), results in fixed near-zone matrix storage, and overall storage requirements of O(N) for any sized array with a system with a total of N degrees of freedom. The effectiveness of this approach for several interesting problem types is discussed.

关键词： Matrix decomposition Antenna arrays Transmission line matrix methods Acceleration Frequency selective surfaces Tiles Finite element methods Integral equations Distributed computing Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

A first look at the performance of autonomous mobile agents in dynamic networks

A first look at the performance of autonomous mobile agents ...

引用

Annual Hawaii International Conference on System Sciences (HICSS)

作者： C. Erfurth A. Dohler W. Rossak Computer Science Department Friedrich-Schiller-Universitat Jena Jena Germany Industrial Engineering Department University of Applied Sciences Jena Germany

Mobile agents can be seen as a new paradigm for distributed computing. At Friedrich Schiller University, we have developed our own mobile agent system, called Tracy. Tracy is implemented in Java 2. One characteristic of mobile agents is their autonomy and pro-activity. We designed a framework on top of Tracy to support our research in this domain. Our framework consists of three modules. The map module collects information on the available network of agent servers (agencies). By this means, a mobile agent is able to locate services within the network. Furthermore, the framework provides a route planning module and an optimization module, which minimizes network load respectively transmission time. These modules support a fast and efficient navigation through the network, which is an environment with an inherently dynamical behavior. The basis for this project is the Tracy domain service, which is a hierarchical arrangement of agent servers that groups agencies into a federation of networked local clusters, so called domains. The focus of the paper is to evaluate the basic concepts and the actual modules of this framework. We made some measurements to characterize the modules' quality and to identify problems. Furthermore, we take a first look at the possible performance enhancement of mobile agents which are using the framework.

关键词： Mobile agents Intelligent networks Java Network servers Middleware Peer to peer computing Costs Computer science Navigation Industrial engineering

来源：评论

学校读者我要写书评

暂无评论

An efficient method to find area clusters with constraints using grid index structure

An efficient method to find area clusters with constraints u...

引用

International Working Conference on Scientific and Statistical Database Management

作者： Kwang-Su Yang Ruixin Yang Jiang Tang M. Kafatos Center for Earth Observing and Space Research (CEOSR) School of Computational Sciences George Mason University Fairfax VA USA

This work presents an efficient method to find area clusters satisfying certain constraints. The method uses a grid index structure to find them by examining five cell, 8-connected neighborhood. The hierarchical clustering technique is applied for preprocessing the grid with similar value distribution into the same clusters. This preprocessing helps reduce the computational time and eliminate the possible outlier grid cells. The constraints are average value range, minimum area size and minimum missing data ratio. The method is implemented for a remote sensing data, MOD08/spl ***/M3, which is MODIS (MODerate resolution Imaging Spectroradiometer) level 3 monthly atmospheric product.

关键词： Geoscience Grid computing Remote sensing Image resolution Spectroradiometers Satellites Spatial resolution Clustering algorithms Databases Conference management

来源：评论

学校读者我要写书评

暂无评论

Behavior descriptions of mobile agents for Web services integration

Behavior descriptions of mobile agents for Web services inte...

引用

IEEE International Conference on Web Services (ICWS)

作者： F. Ishikawa Y. Tahara N. Yoshioka S. Honiden Graduate School of Information Science and Technology University of Tokyo Japan National Institute of Informatics (NII) Japan National Instituite of Informatics University of Tokyo Japan

Web services technology for interoperability, dynamic discovery and integration of distributed components is to be applied in various environments, such as networks of relatively narrow and unstable wireless connections. However, in such environments it is necessary to deal with resource limitation. Our work adopts mobile agent technology in response to this problem and presents a mobile agent framework for Web Services integration. This framework utilizes BPEL (Business Process Execution Language for Web Services) for description of the integration logic, and provides declarative descriptions for physical behaviors (migration and cloning). This facilitates addition or change of physical behaviors according to the environmental conditions while preserving the integration logic. This paper especially focuses on formal definition and discussion of our framework.

关键词： Mobile agents Web services Cloning Informatics Logic Information science Simple object access protocol Mobile communication Mobile computing Computational modeling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 162 163 164 165 166 167 168 169 170 171 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：