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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,295 篇 工学
- 1,181 篇 计算机科学与技术...
- 861 篇 软件工程
- 225 篇 信息与通信工程
- 169 篇 控制科学与工程
- 129 篇 电气工程
- 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
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 篇 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
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,065 篇 英文
9 篇 其他
3 篇 中文
2 篇 葡萄牙文

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

共 2079 条记录，以下是311-320 订阅

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

详细简洁

排序：

Adding Approximate Counters 16

Adding Approximate Counters

引用

21st acm SIGPLAN symposium on Principles and Practice of Parallel Programming (PPoPP)

作者： Steele, Guy L., Jr. Tristan, Jean-Baptiste Oracle Labs Burlington MA 01803 USA

ISBN: (纸本)9781450340922

We describe a general framework for adding the values of two approximate counters to produce a new approximate counter value whose expected estimated value is equal to the sum of the expected estimated values of the given approximate counters. (To the best of our knowledge, this is the first published description of any algorithm for adding two approximate counters.) We then work out implementation details for five different kinds of approximate counter and provide optimized pseudocode. For three of them, we present proofs that the variance of a counter value produced by adding two counter values in this way is bounded, and in fact is no worse, or not much worse, than the variance of the value of a single counter to which the same total number of increment operations have been applied. Addition of approximate counters is useful in massively parallel divide-and-conquer algorithms that use a distributed representation for large arrays of counters. We describe two machine-learning algorithms for topic modeling that use millions of integer counters, and confirm that replacing the integer counters with approximate counters is effective, speeding up a GPU-based implementation by over 65% and a CPU-based by nearly 50%, as well as reducing memory requirements, without degrading their statistical effectiveness.

关键词： approximate counters distributed computing divide and conquer multithreading parallel computing statistical counters

来源：评论

学校读者我要写书评

暂无评论

I-RAID: A novel redundant storage architecture for improving reliability, performance, and life-span of solid-state disk systems 16

I-RAID: A novel redundant storage architecture for improving...

引用

31st Annual acm symposium on applied computing, SAC 2016

作者： Wang, Mingyang Hu, Yiming Department of Electrical Engineering and Computing Systems University of Cincinnati CincinnatiOH45221 United States

ISBN: (纸本)9781450337397

Solid State Disks (SSDs) are becoming increasingly popular in enterprise applications where high performance and high reliability are paramount. Although SSDs have very low read access time, their write performance is often less ideal. In addition, SSDs face some unique reliability challenges, including write-endurance, readdisturb and write-disturb. Even repeatedly reading from an SSD may cause data corruption because the read voltage may stress neighboring memory cells. As NAND continues to scale, it becomes more challenging for cells to store data reliably because read-disturb and write-disturb exacerbate. While a strong ECC (Error Correction Code) scheme can be very effective to protect young flash blocks, it may not be sufficient for aged blocks. Recently, non-volatile memory (NVM) such as phase-change memory (PCM) are receiving surge of research interests, as it overshadows flash memory by providing in-place update and even better performance and reliability. Due to the cost and manufacturability difficulties, hybrid data storage systems which combine both flash memory and NVM are under investigation extensively. Previous studies have shown that using traditional RAID-5 algorithms directly on SSDs may lead to many pitfalls. They introduce some huge performance penalty and other reliability issues. We propose a novel solution called i-RAID (internal RAID) that introduces RAID-like parity-based redundancy while avoiding many of its problems. Unlike traditional disk drives, SSDs cannot perform in-place updates. We view this unique characteristic as an opportunity instead of a hurdle. The out-of-place update feature means that old data will not be over-written by the new data, which allows us to design some fundamentally new algorithms that defer the computing and updating of parity blocks until the garbage collection time, thereby significantly reducing the overhead and possibly increasing the life-time of SSDs. Our algorithms also dynamically and selectively con

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Design of Approximate Redundant Binary Multipliers

Design of Approximate Redundant Binary Multipliers

引用

IEEE/acm International symposium on Nanoscale Architectures (NANOARCH)

作者： Cao, Tian Liu, Weiqiang Wang, Chenghua Cui, Xioping Lombardi, Fabrizio Nanjing Univ Aeronaut & Astronaut Coll Elect & Informat Engn Nanjing 211106 Jiangsu Peoples R China Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA

ISBN: (纸本)9781450343305

Approximate or inexact computing is an attractive design methodology for low power design and is achieved by relaxing the requirement of accuracy. This paper proposes the first approximate design of Redundant Binary (RB) multipliers. An approximate Booth encoder and an approximate RB compressor are proposed and analyzed. RB multipliers are proposed based on the proposed approximate Booth encoder and approximate RB compressor. A regular RB partial product array is also applied in the approximate RB multiplier by eliminating the last Error Correcting Word (ECW). The error analysis is performed by considering the approximate factor as related to the inexact bit width of the RB multipliers. Simulation results for delay, area and power consumption at 45nm CMOS technology are provided. The proposed designs are compared with previous approximate Normal Binary (NB) Booth multipliers;the comparison results show that the proposed designs are better than existing approximate NB Booth multipliers when considering both the Power-Delay Product (PDP) and the Normalized Mean Error Distance (NMED).

关键词： multiplier approximate computing redundant binary Booth encoder low power

来源：评论

学校读者我要写书评

暂无评论

Ubiquitous computing: Gestures interaction applied the learning disabilities in process literacy 16

Ubiquitous computing: Gestures interaction applied the learn...

引用

22nd Brazilian symposium on Multimedia and the Web, WebMedia 2016

作者： Oliveira, Danielle Teixeira Carvalho, Marla Dore Paixão, Tuane Lisboa Silva Universidade do Estado da Bahia-UNEB Salvador - Ba Brazil

ISBN: (纸本)9781450345125

This article uses the interaction of gestures and learning concept with mobility or mobile learning (M-Learning) to propose a mobile platform based on manipulation gestures focusing on benefit children in the literacy process in early childhood education to submit a learning disability. Based on ubiquitous computing and better usability, the objective is to make children can learn while playing through the manipulation of objects in touchscreen. © 2016 acm.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Design Challenges and Methodologies in 3D Integration for Neuromorphic computing Systems 17

Design Challenges and Methodologies in 3D Integration for Ne...

引用

17th International symposium on Quality Electronic Design (ISQED)

作者： Ehsan, M. Amimul An, Hongyu Zhou, Zhen Yi, Yang Univ Kansas Dept Elect Engn & Comp Sci Lawrence KS 66045 USA Intel Corp 3600 Juliette Ln Santa Clara CA 95054 USA

ISBN: (纸本)9781509012138

Neuromorphic computing is an emerging technology that describes the biological neural systems and implementation of its electrical model in complementary metal oxide semiconductor (CMOS) VLSI systems. As the neural networks are wire dominated complicated system with myriad interconnected elements, it requires massively parallel processing for the computational task. However, the hardware implementation experiences some critical challenges and unsurmountable obstacles by using 2D planar circuits. Therefore, the potential three dimensional integration technology can be applied in hardware implementation of neuromorphic computing that provides a sustainable and promising alternative to the existing conventional integrated circuit (IC) technology by allowing vertical stacking of dies. 3D hardware interconnection between the neural layers not only offer high device interconnection density with greater reduction in parasitic, it also provides improved channel bandwidth using fast and energy efficient links with excellent distribution and communication among the neuron layers. Beyond these opportunities, it needs a thorough investigation to explore all the design issues and critical challenges for successful implementation of 3D neuromorphic computation for high performance application. In this work, we studied the design challenges of the 3D integration technology for neuromorphic computing systems, and possible ways to overcome the limitation of well-connected synaptic system.

关键词： Neuromorphic computing Three Dimensional Integrated Circuit CMOS Modeling and Simulations

来源：评论

学校读者我要写书评

暂无评论

Rewriting modulo symmetric monoidal structure 16

Rewriting modulo symmetric monoidal structure

引用

31st Annual acm-IEEE symposium on Logic in Computer Science (LICS)

作者： Bonchi, Filippo Gadducci, Fabio Kissinger, Aleks Sobocinski, Pawel Zanasi, Fabio CNR ENS Lyon I-00185 Rome Italy Univ Pisa I-56100 Pisa Italy Radboud Univ Nijmegen Nijmegen Netherlands Univ Southampton Southampton SO9 5NH Hants England

ISBN: (纸本)9781450343916

String diagrams are a powerful and intuitive graphical syntax for terms of symmetric monoidal categories (SMCs). They find many applications in computer science and are becoming increasingly relevant in other fields such as physics and control theory. An important role in many such approaches is played by equational theories of diagrams, typically oriented and applied as rewrite rules. This paper lays a comprehensive foundation for this form of rewriting. We interpret diagrams combinatorially as typed hypergraphs and establish the precise correspondence between diagram rewriting modulo the laws of SMCs on the one hand and double pushout (DPO) rewriting of hypergraphs, subject to a soundness condition called convexity, on the other. This result rests on a more general characterisation theorem in which we show that typed hypergraph DPO rewriting amounts to diagram rewriting modulo the laws of SMCs with a chosen special Frobenius structure. We illustrate our approach with a proof of termination for the theory of non-commutative bimonoids

关键词： Syntactics Algebra Computer science Quantum mechanics Mathematical model Quantum computing

来源：评论

学校读者我要写书评

暂无评论

Differences in the learning principles dominating student-student vs. Student-instructor interactions while working on programming tasks 16

Differences in the learning principles dominating student-st...

引用

47th acm Technical symposium on computing Science Education, SIGCSE 2016

作者： Gaspar, Alessio Torsella, Joni Honken, Nora Sohoni, Sohum Arnold, Colin Department of Computer Science and Engineering University of South Florida United States Department of Engineering Education University of Cincinnati United States School of Computing Informatics and Decision Systems Engineering Arizona State University United States

ISBN: (纸本)9781450338561

Peer learning principles have been successfully applied to novice programmers. Pedagogies such as Pair Programming, Peer Testing, Peer review of code or tests, or, more generally Peer Instruction, have repeatedly demonstrated their effectiveness in improving both individual performance and retention rates. This paper proposes to supplement the existing literature by investigating how students interact with one another during collaborative programming tasks. More specifically, we are interested in comparing the learning principles used during student-student interactions with those used during studentinstructor or student-teaching assistant dialogs. Students in online and face to face courses, who worked collaboratively on programming assignments, were surveyed to gain an understanding of the frequency with which they engaged in specific activities. These that are representative of the learning principles that have been supported by research to promote learning. Results suggest that some learning principles, may be absent from student-student interactions. We discuss how the success of collaborative programming pedagogies put into question the role of these principles and whether they may contribute to further improve peer-based approaches.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths 16

A Deterministic Almost-Tight Distributed Algorithm for Appro...

引用

48th Annual acm SIGACT symposium on Theory of computing (STOC)

作者： Henzinger, Monika Krinninger, Sebastian Nanongkai, Danupon Univ Vienna Fac Comp Sci Vienna Austria Max Planck Inst Informat Saarbrucken Germany KTH Royal Inst Technol Stockholm Sweden Simons Inst Theory Comp Berkeley CA USA Univ Vienna Vienna Austria

ISBN: (纸本)9781450341325

We present a deterministic (1+o(1))-approximation o(n(1/2+o)(1) vertical bar D1+o(1))-time algorithm for solving the single-source shortest paths problem on distributed weighted networks (the CONGEST model);here n is the number of nodes in the network and D is its (hop) diameter. This is the first non-trivial deterministic algorithm for this problem. It also improves (i) the running time of the randomized (1+0(1))-approximation (O) over tilde (n(1/2)D(1/4) D)-time algorithm of Nanongkai [STOC 2014] by a factor of as large as n(1/8), and (ii) the O(epsilon(-1)- log epsilon(-1)) - approximation factor of Lenzen and Patt-Shamir's (O) over tilde (n(1/2+epsilon) + D)-time algorithm [STOC 2013] within the same running time. Our running time matches the known time lower bound of Omega (n(1/2)/log n + D) [Das Sarma et al., STOC 2011] modulo some lower-order terms, thus essentially settling the status of this problem which was raised at least a decade ago [Elkin, SIGACT News 2004]. It also implies a (2 + o(1))-approximation O(n(1/2+o(1)) D1+o(1))-time algorithm for approximating a network's weighted diameter which almost matches the lower bound by Holzer et al. [PODC 2012]. In achieving this result, we develop two techniques which might be of independent interest and useful in other settings: (i) a deterministic process that replaces the "hitting set argument" commonly used for shortest paths computation in var- ious settings, and (ii) a simple, deterministic, construction of an (n(o(1)), o(1))-hop set of size O(n(1+o(1))). We combine these techniques with many distributed algorithmic techniques, some of which from problems that are not directly related to shortest paths, e.g. ruling sets [26], source detection [39], and partial distance estimation [38]. Our hop set construction also leads to single-source shortest paths algorithms in two other settings: (i) a (1 + o(1))-approximation O(n(1+o(1)))-time algorithm on congested cliques, and (ii) a (1 + o(1))-approximation O(n(o

关键词： Distributed computing shortest paths derandomization

来源：评论

学校读者我要写书评

暂无评论

Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields 27

Efficient quantum algorithms for computing class groups and ...

引用

27th Annual acm-SIAM symposium on Discrete Algorithms, SODA 2016

作者： Biasse, Jean-François Song, Fang Department of Mathematics and Statistics University of South Florida United States Department of Combinatorics Optimization and Institute for Quantum Computing University of Waterloo Canada

ISBN: (纸本)9781510819672

This paper gives polynomial time quantum algorithms for computing the ideal class group (CGP) under the Generalized Riemann Hypothesis and solving the principal ideal problem (PIP) in number fields of arbitrary degree. These are are fundamental problems in number theory and they are connected to many unproven conjectures in both analytic and algebraic number theory. Previously the best known algorithms by Hallgren [20] only allowed to solve these problems in quantum polynomial time for number fields of constant degree. In a recent breakthrough, Eisentrager et al. [11] showed how to compute the unit group in arbitrary fields, thus opening the way to the resolution of CGP and PIP in the general case. For example, Biasse and Song [3] pointed out how to directly apply this result to solve PIP in classes of cyclotomic fields of arbitrary degree. The methods we introduce in this paper run in quantum polynomial time in arbitrary classes of number fields. They can be applied to solve other problems in computational number theory as well including computing the ray class group and solving relative norm equations. They are also useful for ongoing cryptanalysis of cryptographic schemes based on ideal lattices [5, 10]. Our algorithms generalize the quantum algorithm for computing the (ordinary) unit group [11]. We first show that CGP and PIP reduce naturally to the computation of S-unit groups, which is another fundamental problem in number theory. Then we show an efficient quantum reduction from computing 5-units to the continuous hidden subgroup problem introduced in [11]. This step is our main technical contribution, which involves careful analysis of the metrical properties of lattices to prove the correctness of the reduction. In addition, we show how to convert the output into an exact compact representation, which is convenient for further algebraic manipulations.

关键词： Number theory

来源：评论

学校读者我要写书评

暂无评论

Message from the symposium chairs

Proceedings of the ACM Symposium on Applied Computing

引用

proceedings of the acm symposium on applied computing 2016年 4-08-April-2016卷

作者： Ossowski, Sascha Buttazzo, Giorgio Bechini, Alessio

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：