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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,295 篇 工学
- 1,184 篇 计算机科学与技术...
- 861 篇 软件工程
- 225 篇 信息与通信工程
- 169 篇 控制科学与工程
- 128 篇 电气工程
- 77 篇 电子科学与技术（可...
- 73 篇 生物医学工程（可授...
- 72 篇 生物工程
- 40 篇 建筑学
- 36 篇 动力工程及工程热...
- 35 篇 机械工程
- 34 篇 光学工程
- 29 篇 仪器科学与技术
- 29 篇 化学工程与技术
- 27 篇 力学（可授工学、理...
- 27 篇 土木工程
498 篇 理学
- 377 篇 数学
- 100 篇 物理学
- 77 篇 统计学（可授理学、...
- 75 篇 生物学
- 26 篇 化学
- 23 篇 系统科学
276 篇 管理学
- 168 篇 图书情报与档案管...
- 123 篇 管理科学与工程(可...
- 88 篇 工商管理
66 篇 教育学
- 64 篇 教育学
63 篇 医学
- 61 篇 临床医学
- 34 篇 基础医学(可授医学...
- 24 篇 药学(可授医学、理...
28 篇 法学
- 23 篇 社会学
18 篇 经济学
9 篇 农学
3 篇 军事学
1 篇 文学
1 篇 艺术学

主题

91 篇 mobile computing
73 篇 distributed comp...
70 篇 computer science
52 篇 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
12 篇 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,067 篇 英文
6 篇 其他
3 篇 中文
2 篇 葡萄牙文

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

共 2078 条记录，以下是1951-1960 订阅

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

详细简洁

排序：

A computational technique for interactive needle insertions in 3D nonlinear material

A computational technique for interactive needle insertions ...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： H.-W. Nienhuys A.F. van der Stappen Institute of Information and Computing Sciences University of Utrecht Utrecht Netherlands

We present a computational method for simulating needle insertions interactively in both 2D and 3D models of soft tissue. The approach is based on the Finite Element Method (FEM) and uses quasi-static stick-slip friction for needle/tissue interactions. The FEM equations are solved using an iterative method, and the mesh is refined adaptively near the needle trajectory. The boundary formed by the needle surface is not represented explicitly in the mesh, but its geometry is accounted for in the friction forces. This has the advantage that we can use a simple and therefore fast refinement scheme that is guaranteed to keep the mesh quality at the initial level. This approach can also be applied to the 3D situation as well as to nonlinear geometry and material models. We present results of computational experiments of the 2D simulation, and show promising samples of the 3D implementation.

关键词： Needles Computational modeling Friction Geometry Biological materials Biological tissues Finite element methods Nonlinear equations Iterative methods Solid modeling

来源：评论

学校读者我要写书评

暂无评论

In-line service measurements: an IPv6-based framework for traffic evaluation and network operations

In-line service measurements: an IPv6-based framework for tr...

引用

IEEE symposium on Network Operations and Management

作者： D.P. Pezaros D. Hutchison J.S. Sventek F.J. Garcia R.D. Gardner Computing Department Lancaster University Lancaster UK Agilenl Laborarories Scotland Agilenl Technologies Edinburgh UK Agilent Laboratories Scotland Agilent Technologies Edinburgh UK Department of Computing Science Univeristy of Glasgow Glasgow UK

The ability to measure, monitor and control the service quality experienced by network traffic is becoming increasingly important as multiple traffic types are aggregated onto IP networks. Assessing the real-time performance of the application flows is an essential requirement for network operations and service management, as well as for identifying how the different traffic types and transports interact and behave, when they are carried over the end-to-end Internet infrastructure. This paper introduces a novel measurement technique for assessing the performance of IPv6 network flows. By exploiting IPv6 extension headers, measurement triggers and the instantaneous measurement indications are carried in the same packets as the payload data itself. providing a high level of probability that the behaviour of the real user traffic flows is being observed. The measurement mechanism is applied at the network layer and provides for a generic technique able to measure any type of traffic without depending on particular transports or on specific measurement architectures. A prototype implementation of this technique is also described and evaluated by measuring performance properties of application flows over different-capacity IPv6 environments. End-to-end delay and jitter of video streams have been measured, as well as the goodput for services operating on top of reliable transport. This measurement technique can be the basis for low-overhead, scalable, transparent and reliable measurement of individual and aggregate network flows, and can be dynamically deployed where and when required in a multi-service IP environment.

关键词： Telecommunication traffic Communication system traffic control Particle measurements IP networks Measurement techniques Monitoring Web and internet services Payloads Prototypes Delay

来源：评论

学校读者我要写书评

暂无评论

Applying the conjugate gradient method for text document categorization

Applying the conjugate gradient method for text document cat...

引用

International Conference on Pattern Recognition

作者： V. Tam R. Setiono A. Santoso Department of Electrical and Electronic Engineering The University of Hong Kong Pokfulam Hong Kong Hong Kong China School of Computing The National University of Singapore Singapore

We investigate the effectiveness of two different methods to solve the linear least squares fit (LLSF) problem for document categorization. The first method is the singular value decomposition (SVD) method that has been previously used to solve the document categorization problem. The second method is the conjugate gradient (CG) method that is one of the most effective algorithms for solving a linear equation problem. However, up to our knowledge, the CG method has never been applied to handle the document classification problem. Therefore, we compare the effectiveness of these two LLSF methods to categorize text documents. In addition, we examine the effect of using different term weighting schemes on their performance for document classification. Lastly, we compare the performance of the LLSF classifiers against the neighborhood-based Dt-kNN classifier, our best variant of the kNN classifier integrated with a dynamic threshold scheme, on the Reuters 21578 dataset. Besides being the first proposal to use the CG method for document classification, our work opens up many exciting directions for future investigation.

关键词： Gradient methods Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Reflections for quantum query algorithms 11

Reflections for quantum query algorithms

引用

Annual acm-Society for Industrial and applied Mathmatics symposium on Discrete Algorithms

作者： Ben W. Reichardt School of Computer Science and Institute for Quantum Computing University of Waterloo

ISBN: (纸本)9780898719932

We show that any boolean function can be evaluated optimally by a quantum query algorithm that alternates a certain fixed, input-independent reflection with a second reflection that coherently queries the input string. Originally introduced for solving the unstructured search problem, this two-reflections structure is therefore a universal feature of quantum algorithms. Our proof goes via the general adversary bound, a semi-definite program (SDP) that lower-bounds the quantum query complexity of a function. By a quantum algorithm for evaluating span programs, this lower bound is known to be tight up to a sub-logarithmic factor. The extra factor comes from converting a continuous-time query algorithm into a discrete-query algorithm. We give a direct and simplified quantum algorithm based on the dual SDP, with a boundederror query complexity that matches the general adversary bound. Therefore, the general adversary lower bound is tight; it is in fact an SDP for quantum query complexity. This implies that the quantum query complexity of the composition f o (g,..., g) of two boolean functions f and g matches the product of the query complexities of f and g, without a logarithmic factor for error reduction. It efficiently characterizes the quantum query complexity of a read-once formula over any finite gate set. It further shows that span programs are equivalent to quantum query algorithms.

关键词： quanta Boolean functions algorithms Reflection Service Discovery Protocol input string

来源：评论

学校读者我要写书评

暂无评论

New Approximation Algorithms for Minimum Enclosing Convex Shapes 11

New Approximation Algorithms for Minimum Enclosing Convex Sh...

引用

Annual acm-Society for Industrial and applied Mathmatics symposium on Discrete Algorithms

作者： Ankan Saha S. V. N. Vishwanathan Xinhua Zhang Department of Computer Science University of Chicago Departments of Statistics and Computer Science Purdue University Department of of Computing Science University of Alberta

ISBN: (纸本)9780898719932

Given n points in a d dimensional Euclidean space, the Minimum Enclosing Ball (MEB) problem is to find the ball with the smallest radius which contains all n points. We give two approximation algorithms for producing an enclosing ball whose radius is at most ε away from the optimum. The first requires O(ndL/ε~(1/2)) effort, where L is a constant that depends on the scaling of the data. The second is a O~*(ndQ/ε~(1/2)) approximation algorithm, where Q is an upper bound on the norm of the points. This is in contrast with coresets based algorithms which yield a O(nd/ε) greedy algorithm. Finding the Minimum Enclosing Convex Polytope (MECP) is a related problem wherein a convex polytope of a fixed shape is given and the aim is to find the smallest magnification of the polytope which encloses the given points. For this problem we present O(mndL/ε) and O~*(mndQ/ε) approximation algorithms, where m is the number of faces of the polytope. Our algorithms borrow heavily from convex duality and recently developed techniques in non-smooth optimization, and are in contrast with existing methods which rely on geometric arguments. In particular, we specialize the excessive gap framework of Nesterov [19] to obtain our results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On pruning the discrete cosine and sine transforms

On pruning the discrete cosine and sine transforms

引用

Mediterranean Electrotechnical Conference (MELECON)

作者： R. Stasinski Department of Electronics and Telecommunications Poznań University of Technology Poznan Poland

In the paper it is shown that a limited set of output discrete cosine transform (DCT) samples can be computed by a modified real-valued output-pruned FFT algorithm for appropriately permuted data samples. The same is true for the discrete sine transform (DST). Analogously, when computing data contribution from few DCT or DST samples the input-pruned FFT algorithm for inverse FFT can be applied, the input-pruned algorithms for the inverse DCT or DST are obtained. The algorithms are very efficient, their complexities are O(NlogK), where N is the transform size, and K is a divisor of N equal to or greater than the number of computed transform samples, which is less than the number of computed transform samples, which is less than O(NlogN) for the full DCT or DST algorithm. The algorithms are easy to implement, too.

关键词： Discrete transforms Discrete cosine transforms Signal processing algorithms Image coding Appropriate technology Paper technology Telecommunication computing Digital signal processing Image processing Speech analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Analyses of several realistic exposure scenarios near cellular base stations

Analyses of several realistic exposure scenarios near cellul...

引用

International Zurich symposium on Electromagnetic Compatibility (EMC Zurich)

作者： R. Zaridze D. Kakulia G. Kajaia D. Mazmanov L. Manukyan N. Jejelava T. Gogua Laboratory of Applied Electrodynamics Tbilisi State University Tbilisi Georgia

This paper contains the results of computer simulations performed for several realistic scenarios of electromagnetic (EM) field evaluation near the cellular base station (CBS) and some analysis of obtained results. The motivation of this study is exposure assessment of EM energy on biological objects. There are scenarios of field distribution indoors, near the hill, obstacle like a wall and finally the field distribution inside the human body is computed. These scenarios are general and frequently encountering in practice inside space covered by wireless networks. Using the reasonable computational resources and keeping the accuracy of the solution acceptable for problems involving the electrically large objects the method of auxiliary sources (MAS) (R. Zaridze et al., 2002) (D. Kakulia et al., 2004) is used to simulate the EM field for the cases mentioned above

关键词： Base stations Biology computing Computer simulation Performance evaluation Electromagnetic fields Electromagnetic analysis Performance analysis Humans Distributed computing Wireless networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 192 193 194 195 196 197 198 199 200 201 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：