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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Approximating Fixation Probabilities in the Generalized Moran Process 12

Approximating Fixation Probabilities in the Generalized Mora...

引用

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

作者： Josep Diaz Leslie Ann Goldberg George B. Mertzios David Richerby Maria Serna Paul G. Spirakis Departament de Llenguatges i Sistemes Informatics Universitat Politecnica de Catalunya Department of Computer Science University of Liverpool School of Engineering and Computing Sciences Durham University Department of Computer Engineering and Informatics University of Patras

ISBN: (纸本)9781611972108

We consider the Moran process, as generalized by Lieberman, Hauert and Nowak (Nature, 433:312-316, 2005). A population resides on the vertices of a finite, connected, undirected graph and, at each time step, an individual is chosen at random with probability proportional to its assigned "fitness" value. It reproduces, placing a copy of itself on a neighbouring vertex chosen uniformly at random, replacing the individual that was there. The initial population consists of a single mutant of fitness r ＞ 0 placed uniformly at random, with every other vertex occupied by an individual of fitness 1. The main quantities of interest are the probabilities that the descendants of the initial mutant come to occupy the whole graph (fixation) and that they die out (extinction); almost surely, these are the only possibilities. In general, exact computation of these quantities by standard Markov chain techniques requires solving a system of linear equations of size exponential in the order of the graph so is not feasible. We show that, with high probability, the number of steps needed to reach fixation or extinction is bounded by a polynomial in the number of vertices in the graph. This bound allows us to construct fully polynomial randomized approximation schemes (FPRAS) for the probability of fixation (when r ＞ 1) and of extinction (for all r ＞ 0).

关键词： Evolutionary dynamics Markov-chain Monte Carlo Approximation algorithm Approximation algorithms Probability Fixation fixation Markov chain monte carlo methods vertex head Random Linear system of equations Polynomial Line graph Markov chain

来源：评论

学校读者我要写书评

暂无评论

A logarithmic approximation for unsplittable flow on line graphs 09

A logarithmic approximation for unsplittable flow on line gr...

引用

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

作者： Nikhil Bansal Zachary Friggstad Rohit Khandekar Mohammad R. Salavatipour IBM T.J.Watson research center Department of Computing Science University of Alberta

ISBN: (纸本)9780898716740

We consider the unsplittable flow problem on a line. In this problem, we are given a set of n tasks, each specified by a start time s_i, an end time t_i, a demand d_i > 0, and a profit p_i > 0. A task, if accepted, requires d_i units of "bandwidth" from time s_i to t_i and accrues a profit of p_i. For every time t, we are also specified the available bandwidth c_t, and the goal is to find a subset of tasks with maximum profit subject to the bandwidth constraints. In this paper, we present the first polynomial-time O(log n)-approximation algorithm for this problem. No polynomial-time o(n)-approximation was known prior to this work. Previous results for this problem were known only in more restrictive settings, in particular, either if the given instance satisfies the so-called "no-bottleneck" assumption: max d_i ≤ min c_t, or else if the ratio of the maximum to the minimum demands and ratio of the maximum to the minimum capacities are polynomially (or quasi-polynomially) bounded in n. Our result, on the other hand, does not require any of these assumptions. Our algorithm is based on a combination of dynamic programming and rounding a natural linear programming relaxation for the problem. While there is an Ω(n) integrality gap known for this LP relaxation, our key idea is to exploit certain structural properties of the problem to show that instances that are bad for the LP can in fact be handled using dynamic programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PowerFITS: Reduce Dynamic and Static I-Cache Power Using Application Specific Instruction Set Synthesis

PowerFITS: Reduce Dynamic and Static I-Cache Power Using App...

引用

IEEE International symposium on Performance Analysis of Systems and Software

作者： A.C. Cheng G.S. Tyson T.N. Mudge Advanced Computer Architecture Laboratory University of Michigan Ann Arbor MI USA Department of Computer Science Florida State University Tallahassee FL USA

Power consumption, performance, area, and cost are critical concerns in designing microprocessors for embedded systems such as portable handheld computing and personal telecommunication devices. In previous work [A. Cheng et al., (2004)], we introduced the concept of framework-based instruction-set tuning synthesis (FITS), which is a new instruction synthesis paradigm that falls between a general-purpose embedded processor and a synthesized application specific processor (ASP). We address these design constraints through FITS by improving the code density. A FITS processor improves code density by tailoring the instruction set to the requirement of a target application to reduce the code size. This is achieved by replacing the fixed instruction and register decoding of general purpose embedded processor with programmable decoders that can achieve ASP performance, low power consumption, and compact chip area with the fabrication advantages of a mass produced single chip solution to amortize the cost. Instruction cache has been recognized as one of the most predominant source of power dissipation in a microprocessor. For instance, in Intel's StrongARMprocessor, 27% of total chip power loss goes into the instruction cache [J. Montanaro et al., (1996)]. In this paper, we demonstrate how FITS can be applied to improve the instruction cache power efficiency. Experimental results show that our synthesized instruction sets result in significant power reduction in the instruction cache compared to ARM instructions. For 21 benchmarks from the MiBench suite [M. Guthaus et al., (2001)], our simulation results indicate on average: a 49.4% saving for switching power; a 43.9% saving for internal power; a 14.9% saving for leakage power; a 46.6% saving for total cache power with up to 60.3% saving for peak power

关键词： Application specific processors Energy consumption Costs Microprocessors Decoding Embedded system Embedded computing Portable computers Handheld computers Telecommunication computing

来源：评论

学校读者我要写书评

暂无评论

Integrating web services and agent technology for E-learning course content maintenance 2004

引用

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

作者： Fuhua Lin Lawrence Poon Center for Computing and Information Systems Athabasca University Athabasca Alberta

ISBN: (纸本)9783540220077

This paper describes an integrated system using autonomous agents and Web Services to maintain Web-based course materials. The system is to monitor the Web-based course materials and report its findings. A couple of agents are deployed in a distributed educational environment. One of the agents called Web Monitoring Agent is mainly responsible for detecting web hyperlink status and content changes. If it discovers that the content of the course materials of a particular course has significantly been updated or modified, it will trigger a Notification Agent to send out a message to the students taking the course, or to whosoever interested to receive the message. If the Web Monitoring Agent discovers broken hyperlinks, it will trigger the Notification Agent to send out a message to the course instructor to remedy the situations. The model and approach proposed can be generalized and used in Web-based information resources management systems.

关键词： E-learning

来源：评论

学校读者我要写书评

暂无评论

computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks 04

Computing maximally separated sets in the plane and independ...

引用

proceedings of the fifteenth annual acm-SIAM symposium on Discrete algorithms

作者： Pankaj K. Agarwal Mark Overmars Micha Sharir Duke University Durham NC Utrecht University the Netherlands Tel Aviv University Tel Aviv Israel

ISBN: (纸本)9780898715583

Let S be a set of n points in R2. Given an integer 1 ≤ k ≤ n, we wish to find a maximally separated subset I ⊆ S of size k; this is a subset for which the minimum among the (k2) pairwise distances between its points is as large as possible. The decision problem associated with this problem is to determine whether there exists I ⊆ S, |I| = k, so that all (k2) pairwise distances in I are at least 2, say. This problem can also be formulated in terms of disk-intersection graphs: Let D be the set of unit disks centered at the points of S. The disk-intersection graph G of D connects pairs of disks by an edge if they have nonempty intersection. I is then the set of centers of disks that form an independent set in the graph G. This problem is known to be NP-Complete if k is part of the *** this paper we first present a linear-time approximation algorithm for any constant k. Next we give O(n4/3polylog(n)) exact algorithms for the cases k = 3 and k = 4. We also present a simpler nO(√k)-time algorithm (as compared with the recent algorithm in [5]) for arbitrary values of k.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A framework for balancing control flow and predication 30

A framework for balancing control flow and predication

引用

proceedings of the 30th annual acm/IEEE international symposium on Microarchitecture

作者： David I. August Wen-mei W. Hwu Scott A. Mahlke Center for Reliable and High-Performance Computing University of Illinois Urbana-Champaign IL Hewlett-Packard Laboratories Hewlett-Packard Palo Alto CA

ISBN: (纸本)9780818679773

Predicated execution is a promising architectural feature for exploiting instruction-level parallelism in the presence of control flow. Compiling for predicated execution involves converting program control flow into conditional, or predicated, instructions. This process is known as if-conversion. In order to effectively apply if-conversion, one must address two major issues: what should be if-converted and when the if-conversion should be applied. A compiler's use of predication as a representation is most effective when large amounts of code are if-converted and if-conversion is performed early in the compilation procedure. On the other hand the final code generated for a processor with predicated execution requires a delicate balance between control flow and predication to achieve efficient execution. The appropriate balance is tightly coupled with scheduling decisions and detailed processor characteristics. This paper presents an effective compilation framework that allows the compiler to maximize the benefits of predication as a compiler representation while delaying the final balancing of control flow and predication to schedule time.

关键词： program control flow compiler schedule time conditional instructions scheduling decisions if-conversion instruction-level parallelism predicated execution predicated instructions optimising compilers parallel architecture

来源：评论

学校读者我要写书评

暂无评论

View management for virtual and augmented reality 01

View management for virtual and augmented reality

引用

proceedings of the 14th annual acm symposium on User interface software and technology

作者： Blaine Bell Steven Feiner Tobias Höllerer 500 W 120th St. Columbia University New York NY

ISBN: (纸本)9781581134384

We describe a view-management component for interactive 3D user interfaces. By view management, we mean maintaining visual constraints on the projections of objects on the view plane, such as locating related objects near each other, or preventing objects from occluding each other. Our view-management component accomplishes this by modifying selected object properties, including position, size, and transparency, which are tagged to indicate their constraints. For example, some objects may have geometric properties that are determined entirely by a physical simulation and which cannot be modified, while other objects may be annotations whose position and size are *** introduce algorithms that use upright rectangular extents to represent on the view plane a dynamic and efficient approximation of the occupied space containing the projections of visible portions of 3D objects, as well as the unoccupied space in which objects can be placed to avoid occlusion. Layout decisions from previous frames are taken into account to reduce visual discontinuities. We present augmented reality and virtual reality examples to which we have applied our approach, including a dynamically labeled and annotated environment.

关键词： wearable computing view management virtual environments labeling environment management annotation augmented reality

来源：评论

学校读者我要写书评

暂无评论

The implementation of an algorithm in Macsyma: computing the formal solutions of differential systems in the neighborhood of regular singular point 90

The implementation of an algorithm in Macsyma: computing the...

引用

proceedings of the international symposium on Symbolic and algebraic computation

作者： G. Chen I. Gil

ISBN: (纸本)9780201548921

We discuss in this paper the problems arised in the implementation in Macsyma of a direct algorithm for computing the formal solutions of differential systems in the neighborhood of regular singular *** differential system to be considered is of the form xh dy/dx = A(x) y (1) with A(x) = A0 + A1 + … is an n by n matrices of formal *** paper deals with system of the form (1) with h = 1. Another paper [3] has considered the systems with h > 1. So these two papers give complete consideration of systems in the form (1) in a neighborhood of both regular and irregular singular point without reducing the systems to super-irreducible forms, i.e. without knowing (for h > 1) a singular point is regular or *** first step in the algorithm is to transform the leading matrix A0 to its Jordan form, for which we can use the algorithm in [1][11] that computes at first the Frobenius form and then reduces it to its Jordan form. The reduction from the Frobenius matrix to its Jordan matrix is based on a theorem in Wilkinson [13] which reduces each companion matrix to its Jordan matrix. One of the important aspects is that we don't compute the eigenvalues of the matrix but just keep them as the roots of some corresponding polynomials, i.e. they are looked as algebraic *** simple case in the computations is that when the eigenvalues of the leading matrix A0 have no integer differences, which is called the generic *** formal solutions of the differential system can be obtained by solving a linear system of the form A X - X B = C with A and B in Jordan form. The implementation of this resolution is immediate. Hence this gives the fundamental system of formal solutions *** the general case, we should determine at first the integer differences of the eigenvalues of the matrix A0. A classical method is applied and implemented in Macsyma for our situation. Then we search for some transformations to reduce the differential system to the generic ***

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic multidimensional memory partitioning for FPGA-based accelerators (abstract only) 13

Automatic multidimensional memory partitioning for FPGA-base...

引用

proceedings of the acm/SIGDA international symposium on Field programmable gate arrays

作者： Yuxin Wang Peng Li Peng Zhang Chen Zhang Jason Cong Center for Energy-Efficient Computing and Applications Computer Science Department Peking University Beijing China Computer Science Department University of California Los Angeles Los Angeles USA Computer Science Department University of California Los Angeles and UCLA/PKU Joint Research Institute Los Angeles USA

ISBN: (纸本)9781450318877

With the increase of data processing throughput in reconfigurable computing, data parallelism is now crucial for the performance of FPGA-based accelerators. However, most of the data parallelism optimizations are still performed manually by experienced hardware designers. Memory partitioning is widely adopted to efficiently increase the memory bandwidth by using multiple memory banks and reducing data access conflict. Previous methods for memory partitioning mainly focused on one-dimensional arrays. As a consequence, designers must flatten a multidimensional array to fit those methodologies, but it makes the partition related to the dimensional width of the array. In this work we propose an automatic memory partitioning scheme for multidimensional arrays to provide high data throughput of on-chip memories for the loop pipelining in high-level synthesis. Linear transformation is applied to optimize the layout of the data elements in the memory banks, with the partition unrelated to the dimensional width. Two transformation vectors are used to map the original data element onto different banks and different inner bank offsets. The vector for the optimal bank mapping is decided by non-conflict access constraint. In addition, a memory padding technique is proposed to find a vector for inner bank offset with a trade-off between practicality and optimality. We use six benchmarks with different access patterns to prove our idea. Compared to the previous one-dimensional partitioning work, the experimental results show that our approach saves up to 21% of block RAMs, 19% in slices, and 46% in DSPs.

关键词： high-level synthesis memory partitioning memory padding

来源：评论

学校读者我要写书评

暂无评论

DMS/spl reg/: program transformations for practical scalable software evolution

DMS/spl reg/: program transformations for practical scalable...

引用

International Conference on Software Engineering (ICSE)

作者： I.D. Baxter C. Pidgeon M. Mehlich Semantic Designs Inc. USA

While a number of research systems have demonstrated the potential value of program transformations, very few of these systems have made it into practice. The core technology for such systems is well understood; what remains is integration and more importantly, the problem of handling the scale of the applications to be processed. This paper describes DMS, a practical, commercial program analysis and transformation system, and sketches a variety of tasks to which it has been applied, from redocumenting to large-scale system migration. Its success derives partly from a vision of design maintenance and the construction of infrastructure that appears necessary to support that vision. DMS handles program scale by careful space management, computational scale via parallelism and knowledge acquisition scale via domains.

关键词： Software tools Java Space technology Large-scale systems Knowledge management Concurrent computing Parallel processing Knowledge acquisition Software maintenance Paper technology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 199 200 201 202 203 204 205 206 207 208 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：