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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

159 篇 会议
2 册 图书
2 篇 期刊文献

馆藏范围

163 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

89 篇 工学
- 73 篇 计算机科学与技术...
- 59 篇 软件工程
- 11 篇 建筑学
- 10 篇 机械工程
- 9 篇 土木工程
- 8 篇 电子科学与技术（可...
- 7 篇 光学工程
- 6 篇 信息与通信工程
- 5 篇 仪器科学与技术
- 5 篇 控制科学与工程
- 4 篇 农业工程
- 3 篇 材料科学与工程（可...
- 3 篇 生物医学工程（可授...
- 3 篇 生物工程
- 3 篇 安全科学与工程
- 2 篇 力学（可授工学、理...
- 2 篇 动力工程及工程热...
- 2 篇 电气工程
- 2 篇 航空宇航科学与技...
48 篇 理学
- 32 篇 数学
- 13 篇 物理学
- 4 篇 系统科学
- 4 篇 统计学（可授理学、...
- 3 篇 生物学
- 2 篇 地球物理学
12 篇 管理学
- 6 篇 管理科学与工程(可...
- 4 篇 图书情报与档案管...
10 篇 艺术学
- 9 篇 设计学（可授艺术学...
- 4 篇 美术学
4 篇 农学
- 4 篇 作物学
2 篇 医学
1 篇 法学

主题

18 篇 solid modeling
17 篇 computer aided d...
16 篇 rendering (compu...
13 篇 graphics process...
13 篇 three dimensiona...
10 篇 design automatio...
10 篇 mathematical mod...
9 篇 equations
8 篇 computational mo...
8 篇 visualization
8 篇 algorithm design...
7 篇 optimization
7 篇 image color anal...
7 篇 shape
7 篇 geometry
6 篇 interpolation
5 篇 model checking
5 篇 vectors
5 篇 computer graphic...
4 篇 buildings

机构

12 篇 tsinghua nationa...
11 篇 department of co...
11 篇 school of softwa...
9 篇 state key labora...
9 篇 key laboratory f...
7 篇 state key lab. o...
4 篇 state key labora...
3 篇 college of scien...
3 篇 school of comput...
3 篇 program of compu...
3 篇 school of comput...
2 篇 institute of mat...
2 篇 state key labora...
2 篇 liama/nlpr insti...
2 篇 school of comput...
2 篇 school of comput...
2 篇 college of compu...
2 篇 department of co...
2 篇 school of softwa...
2 篇 school of comput...

作者

6 篇 qunsheng peng
5 篇 peng qunsheng
3 篇 wang bin
3 篇 hai lin
3 篇 xueying qin
3 篇 junhai yong
3 篇 zhang hui
3 篇 qin xueying
2 篇 bin wang
2 篇 hoyano akira
2 篇 vardi moshe y.
2 篇 tao tao
2 篇 chen xiaowu
2 篇 bin pan
2 篇 li zongmin
2 篇 li chen
2 篇 pratt kevin b.
2 篇 he fazhi
2 篇 chen li
2 篇 meng xiangxu

语言

162 篇 英文
1 篇 中文

检索条件"任意字段=12th International Conference on Computer-Aided Design and Computer Graphics, CAD/Graphics 2011"

共 163 条记录，以下是141-150 订阅

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

详细简洁

排序：

Achieving scalability in parallel reachability analysis of very large circuits 12th

Achieving scalability in parallel reachability analysis of v...

引用

12th international conference on computer aided Verification, CAV 2000

作者： Heyman, Tamir Geist, Danny Grumberg, Orna Schuster, Assaf Computer Science Department Technion Haifa Israel IBM Haifa Research Laboratories Haifa Israel

ISBN: (纸本)3540677704

this paper presents a scalable method for parallel symbolic reachability analysis on a distributed-memory environment of workstations. Our method makes use of an adaptive partitioning algorithm which achieves high reduction of space requirements. the memory balance is maintained by dynamically repartitioning the state space throughout the computation. A compact BDD representation allows coordination by shipping BDDs from one machine to another, where different variable orders are allowed. the algorithm uses a distributed termination protocol with none of the memory modules preserving a complete image of the set of reachable states. No external storage is used on the disk;rather, we make use of the network which is much faster. We implemented our method on a standard, loosely-connected environment of workstations, using a high-performance model checker. Our initial performance evaluation using several large circuits shows that our method can handle models that are too large to fit in the memory of a single node. the efficiency of the partitioning algorithm is linear in the number of workstations employed, with a 40-60% efficiency. A corresponding decrease of space requirements is measured throughout the reachability analysis. Our results show that the relatively-slow network does not become a bottleneck, and that computation time is kept reasonably small. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Prioritized traversal: Efficient reachability analysis for verification and falsification 12th

Prioritized traversal: Efficient reachability analysis for v...

引用

12th international conference on computer aided Verification, CAV 2000

作者： Fraer, Ranan Kamhi, Gila Ziv, Barukh Vardi, Moshe Y. Fix, Limor Logic and Validation Technology Intel Corporation Haifa Israel Dept. of Computer Science Rice University United States

ISBN: (纸本)3540677704

Our experience with semi-exhaustive verification shows a severe degradation in usability for the corner-case bugs, where the tuning effort becomes much higher and recovery from dead-ends is more and more difficult. Moreover, when there are no bugs at all, shifting semi-exhaustive traversal to exhaustive traversal is very expensive, if not impossible. this makes the output of semi-exhaustive verification on non-buggy designs very ambiguous. Furthermore, since after the design fixes each falsification task needs to converge to full verification, there is a strong need for an algorithm that can handle efficiently both verification and falsification. We address these shortcomings with an enhanced reachability algorithm that is more robust in detecting corner-case bugs and that can potentially converge to exhaustive reachability. Our approach is similar to that of Cabodi et al. in partitioning the frontiers during the traversal, but differs in two respects. First, our partitioning algorithm trades quality for time resulting in a significantly faster traversal. Second, the subfrontiers are processed according to some priority function resulting in a mixed BFS/DFS traversal. It is this last feature that makes our algorithm suitable for both falsification and verification. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Edge detection

来源：评论

学校读者我要写书评

暂无评论

Boolean satisfiability with transitivity constraints 12th

Boolean satisfiability with transitivity constraints

引用

12th international conference on computer aided Verification, CAV 2000

作者： Bryant, Randal E. Velev, Miroslav N. Computer Science Carnegie Mellon University PittsburghPA United States Electrical and Computer Engineering Carnegie Mellon University PittsburghPA United States

ISBN: (纸本)3540677704

We consider a variant of the Boolean satisfiability problem where a subset Ε of the propositional variables appearing in formula Fsat encode a symmetric, transitive, binary relation over N elements. Each of these relational variables, ei,j, for 1 ≤ i i andj. the task is to either find a satisfying assignment to Fsat that also satisfies all transitivity constraints over the relational variables (e.g., e1,2 ^ e2,3 ⇒ e1,3), or to prove that no such assignment exists. Solving this satisfiability problem is the final and most difficult step in our decision procedure for a logic of equality with uninterpreted functions. this procedure forms the core of our tool for verifying pipelined microprocessors. To use a conventional Boolean satisfiability checker, we augment the set of clauses expressing Fsat with clauses expressing the transitivity constraints. We consider methods to reduce the number of such clauses based on the sparse structure of the relational variables. To use Ordered Binary Decision Diagrams (OBDDs), we show that for some sets Ε, the OBDD representation of the transitivity constraints has exponential size for all possible variable orderings. By considering only those relational variables that occur in the OBDD representation of Fsat, our experiments show that we can readily construct an OBDD representation of the relevant transitivity constraints and thus solve the constrained satisfiability problem. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Visual language of Transcending Dimensionality Mix-dimensionality graphics applying in Visual Communication design

Visual language of Transcending Dimensionality Mix-dimension...

引用

2011 IEEE 12th international conference on computer-aided Industrial design & Conceptual design

作者： Ning Shaoqiang School of design Guangxi Normal University Guilin,China Hou Qing School of design Guangxi Normal University Guilin,China

Mix-dimensionality graphics can be considered as a visual language of transcending *** a new graphic form,it offers unique effect of spatial which excites both vision and *** article aims to make reader understand Mix-dimensionality graphics systemically and profoundly by introducing and analyzing *** examples of Mix-dimensionality graphics applying will be adopted and *** of this,exploring Mix-dimensionality graphics will extend the expression of Visual Communication design.

关键词： Mix-dimensionality graphics Visual language Dimensionality Applying

来源：评论

学校读者我要写书评

暂无评论

Schematic-driven physical verification: Fully automated solution for analog IC design

Schematic-driven physical verification: Fully automated solu...

引用

25th IEEE international System-on-Chip conference, SOCC 2012

作者： Arafa, Ahmed Wagieh, Hend Fathy, Rami Ferguson, John Morgan, Doug Anis, Mohab H. Dessouky, Mohamed Mentor Graphics Corporation United States ON Semiconductor Corp United States American University in Cairo Egypt

ISBN: (纸本)9781467312950

designing ICs (integrated circuits) is inherently a complex task involving human expertise as well as aids intended to accelerate the process. A fundamental requirement for design success is a clear strategy that coordinates the entire design flow from specifications to a marketable product. Modem VLSI (very large scale integration) IC designs, especially analog/mixed signal LSIs, must meet various design and electrical constraints such as IR-drop, cross-talk, low power and low voltage design. this complexity poses several physical design challenges for specific analog structures such as device symmetry, net matching and more. therefore it is essential to have some form of communication between the front-end designers (schematic and transistor level) and the physical layout engineers. the current process involves the front-end designer placing the design constraints in the form of annotations on the schematic netlist. these annotations are then passed to the layout team for manual implementation followed by visual verification only. this paper explores a new methodology providing a fully automated cad flow that captures the designer's intent from the schematic netlist, links these annotations to the proper devices or nets on the physical layout level, then runs verification checks using the Calibre R tool suite. Several applications can be used with the proposed flow, in this work we will present an application specifically for capturing design constraints related to physical layout recommendations, tested on Opamp circuit. © 2012 IEEE.

关键词： computer aided design

来源：评论

学校读者我要写书评

暂无评论

Efficient detection of global properties in distributed systems using partial-order methods

Efficient detection of global properties in distributed syst...

引用

12th international conference on computer aided Verification, CAV 2000

作者： Stoller, Scott D. Unnikrishnan, Leena Liu, Yanhong A. Computer Science Dept Indiana University BloomingtonIN47405-7104 United States

ISBN: (纸本)3540677704

A new approach is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss ɸ (read "possibly ɸ"), meaning the system could have passed through a global state satisfying predicate ɸ, or Def ɸ (read "definitely ɸ"), meaning the system definitely passed through a global state satisfying ɸ. Detection can be done easily by straightforward state-space search;this is essentially what Cooper and Marzullo proposed. We show that the persistent-set technique, a well-known partial-order method for optimizing state-space search, provides efficient detection. this approach achieves the same worst-case asymptotic time complexity as two special- purpose detection algorithms of Garg and Waldecker that detect Poss ɸ and Def ɸ for a restricted but important class of predicates. For Poss ɸ, our approach applies to arbitrary predicates and thus is more general than Garg and Waldecker’s algorithm. We apply our algorithm for Poss ɸ to two examples, achieving a speedup of over 700 in one example and over 70 in the other, compared to unoptimized state-space search. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Combining decision diagrams and SAT procedures for efficient symbolic model checking 12th

Combining decision diagrams and SAT procedures for efficient...

引用

12th international conference on computer aided Verification, CAV 2000

作者： Williams, Poul F. Biere, Armin Clarke, Edmund M. Gupta, Anubhav Department of Information Technology Technical University of Denmark LyngbyDK-2800 Denmark Department of Computer Science Institute of Computer Systems ETH Zentrum Zürich8092 Switzerland School of Computer Science Carnegie Mellon University PittsburghPA15213 United States

ISBN: (纸本)3540677704

In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Diagrams (BDDs), the traditionally used canonical representation. the method is based on standard fixed point algorithms, combined with BDDs and SAT-solvers to perform satisfiability checking. As a result we are able to model check systems for which standard BDD-based methods fail. For example, we model check a liveness property of a 256 bit shift-and-add multiplier and we are able to find a previously undetected bug in the specification of a 16 bit multiplier. As opposed to Bounded Model Checking (BMC) our method is complete in practice. Our technique is based on a quantification procedure that allows us to eliminate quantifiers in Quantified Boolean Formulas (QBF). the basic step of this procedure is the up-one operation for BEDs. In addition we list a number of important optimizations to reduce the number of basic steps. In particular the optimization rule of quantification-by-substitution turned out to be very useful: Ǝx: g ^ (x ⇔ f) ≡ g[f / x]. the rule is used (1) during fixed point iterations, (2) for deciding whether an initial set of states is a subset of another set of states, and finally (3) for iterative squaring. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Binary decision diagrams

来源：评论

学校读者我要写书评

暂无评论

How to Tap in Graphic design in the Potential of Visual

How to Tap in Graphic Design in The Potential of Visual

引用

2011 IEEE 12th international conference on computer-aided Industrial design & Conceptual design

作者： Linghong YE Art and design Institute Zhejiang University of Science and Technology Hangzhou.China

＜正＞the paper gradually discusses how to use the potential of combining the visual graphic design and research learning mode to develop graphic comments polysemy of poster and future to develop poster design ability by proposing issues such as why accurate full of images designed,issue analysis-factors may influence create thingking ability development,solutions- how to create graphic design thinking *** most important issue to connect three keywords of "visual potential"、"Characteristics of visual experience thinking"and "design" is to improve graphic *** the key to develop creative simple graphics can show rich in content,then all viewers will have a wealth of associations around the *** comprehensive analysis of the ideographic graphics,original graphics,graphic aesthetic, simple graphics,graphics layout and graphics of the symbolic links and other relevant factors,in particular,to improve the graphical impact,the proposed new perspective.

关键词： graphic design visual potential physiological and psychological

来源：评论

学校读者我要写书评

暂无评论

Teaching Innovation for computer-aided design in Visual Communication design

Teaching Innovation for Computer-aided design in Visual Comm...

引用

2011 IEEE 12th international conference on computer-aided Industrial design & Conceptual design

作者： CHEN Shouming Communication design Apartment of College of Arts design Zhongkai University of Agriculture and Engineering Guangzhou,P.R.China

there are two central components of professional teaching in visual communication *** is to inspire students' creative thinking;the other is to guide students how to transform the nonrepresentational creative concepts into visual *** part two,teaching of graphic softwares (computer-aided design) plays a key *** softwares in visual communication design have Photoshop,CorelDRAW, Illustrator,*** of this topic include:analysis of cad teaching situation in visual communication design,summarize cad teaching problem of the relevant visual communication design subject,Re-examine the cad teaching,focus on the relationship between graphic softwares teaching and visual communication design courses,complement of theory and practice of teaching each other to explore innovative teaching for computer-aided design in visual communication design.

关键词： cad Teaching Visual communication design Innovation

来源：评论

学校读者我要写书评

暂无评论

Quadtree and associative relationship based numerical scheme for automatic printed-circuit pattern editing subsystem

Quadtree and associative relationship based numerical scheme...

引用

international conference on cad Systems in Microelectronics (cadSM)

作者： Roman Panchak Oleksandr Frider Dmitro Poluektov Department of CAD/CAM Lviv Polytechnic National University Lviv Ukraine Department of CAD/CAM (CAD/CAM Department Lviv Polytechnic National University 12 S. Bandery Str. 79013 UKRAINE

the automated printed-circuit pattern editing subsystem numerical scheme is addressed in this paper. Scheme implementation is based on planar graph and quadtree construction with database combination, gives ability to... 详细信息

ISBN: (纸本)9789531841306

关键词： computer aided manufacturing cadCAM Circuit topology graphics Wires Neck Costs Spatial databases Fabrication Routing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共17页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：