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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,801 篇 会议
355 册 图书
80 篇 期刊文献
1 篇 学位论文

馆藏范围

5,233 篇 电子文献
4 种 纸本馆藏

日期分布

学科分类号

3,596 篇 工学
- 3,093 篇 计算机科学与技术...
- 2,589 篇 软件工程
- 586 篇 信息与通信工程
- 437 篇 控制科学与工程
- 343 篇 电气工程
- 230 篇 机械工程
- 200 篇 电子科学与技术（可...
- 194 篇 生物工程
- 142 篇 安全科学与工程
- 137 篇 生物医学工程（可授...
- 107 篇 建筑学
- 100 篇 动力工程及工程热...
- 94 篇 土木工程
- 83 篇 交通运输工程
- 82 篇 仪器科学与技术
- 82 篇 材料科学与工程（可...
994 篇 理学
- 559 篇 数学
- 219 篇 生物学
- 172 篇 系统科学
- 170 篇 物理学
- 152 篇 统计学（可授理学、...
- 77 篇 化学
803 篇 管理学
- 569 篇 管理科学与工程(可...
- 302 篇 工商管理
- 290 篇 图书情报与档案管...
143 篇 医学
- 120 篇 临床医学
- 110 篇 基础医学(可授医学...
129 篇 教育学
- 126 篇 教育学
111 篇 经济学
- 111 篇 应用经济学
108 篇 法学
- 79 篇 社会学
41 篇 农学
11 篇 军事学
8 篇 文学
2 篇 艺术学

主题

374 篇 software enginee...
224 篇 software
175 篇 artificial intel...
154 篇 computer archite...
143 篇 information syst...
143 篇 application soft...
130 篇 computer communi...
114 篇 computer science
110 篇 software enginee...
109 篇 hardware
109 篇 computer softwar...
102 篇 real-time system...
94 篇 control systems
90 篇 computer aided s...
74 篇 software systems
72 篇 computational mo...
72 篇 software design
71 篇 software archite...
61 篇 software testing
61 篇 logics and meani...

机构

21 篇 college of compu...
10 篇 school of softwa...
9 篇 univ york dept c...
9 篇 dublin city univ...
8 篇 department of co...
8 篇 state key labora...
7 篇 school of comput...
7 篇 faculty of compu...
6 篇 school of comput...
6 篇 school of comput...
6 篇 shanghai key lab...
6 篇 college of compu...
6 篇 university of ne...
6 篇 faculty of compu...
6 篇 carleton univ de...
6 篇 univ haifa dept ...
6 篇 school of inform...
5 篇 univ chinese aca...
5 篇 hebrew universit...
5 篇 nanjing univ sta...

作者

14 篇 kupferman orna
14 篇 labiche yvan
12 篇 david lo
8 篇 mylopoulos john
8 篇 yilmaz murat
8 篇 reinhartz-berger...
8 篇 xin xia
8 篇 paige richard f.
7 篇 o'connor rory v.
7 篇 vardi moshe y.
7 篇 clarke paul m.
7 篇 biffl stefan
7 篇 briand lionel c.
7 篇 exman iaakov
7 篇 sturm arnon
6 篇 katz guy
6 篇 maoz shahar
6 篇 sulaiman shahida
6 篇 lakhmi c. jain
5 篇 bernady o. apduh...

语言

5,054 篇 英文
155 篇 其他
40 篇 中文
2 篇 德文
2 篇 俄文
1 篇 西班牙文

检索条件"任意字段=5th Israel Conference on Computer Systems and Software Engineering"

共 5237 条记录，以下是4341-4350 订阅

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

详细简洁

排序：

Using the SPARK toolset for showing the absence of run-time errors in safety-critical software 6th

引用

6th Ada-Europe International conference on Reliable software Technologies, Ada-Europe 2001

作者： Foulger, Darren King, Steve BAE SYSTEMS Brough East Yorkshire United Kingdom Department of Computer Science University of York Heslington YorkYO10 5DD United Kingdom

ISBN: (纸本)3540421238

this paper reports the results of a study into the effectiveness of the SPARK toolset for showing the absence of run-time errors in safety-critical Ada software. In particular, the toolset is examined to determine how effective it is in finding run-time errors in a SPARK program, and how much of the process of proving freedom from run-time errors can be performed automatically. the study identifies areas where automatic run-time checks are not so effective and, where possible, gives recommendations about the design of the software so that the toolset is as effective as possible in automatically proving absence of run-time errors. the results will be of interest to anyone contemplating the use of the SPARK toolset for ensuring the absence of run-time errors, both as guidance in planning the effort required, and for practical advice on making the best use of the toolset. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Safety engineering

来源：评论

学校读者我要写书评

暂无评论

Real time cryptanalysis of A5/1 on a PC 7th

Real time cryptanalysis of A5/1 on a PC

引用

7th International Workshop on Fast software Encryption, FSE 2000

作者： Biryukov, Alex Shamir, Adi Wagner, David Computer Science department The Weizmann Institute Rehovot76100 Israel Computer Science department University of California BerkeleyCA94720 United States

ISBN: (纸本)9783540447061

A5/1 is the strong version of the encryption algorithm used by about 130 million GSM customers in Europe to protect the over- the-air privacy of their cellular voice and data communication. the best published attacks against it require between 240 and 245 steps. this le- vel of security makes it vulnerable to hardware-based attacks by large organizations, but not to software-based attacks on multiple targets by hackers. In this paper we describe new attacks on A5/1, which are based on subtle flaws in the tap structure of the registers, their noninvertible clocking mechanism, and their frequent resets. After a 248 parallelizable data preparation stage (which has to be carried out only once), the actual attacks can be carried out in real time on a single PC. the first attack requires the output of the A5/1 algorithm during the first two minutes of the conversation, and computes the key in about one second. the second attack requires the output of the A5/1 algo- rithm during about two seconds of the conversation, and computes the key in several minutes. the two attacks are related, but use different types of time-memory tradeoffs. the attacks were verified with actual implementations, except for the preprocessing stage which was extensively sampled rather than completely executed. REMARK: We based our attack on the version of the algorithm which was derived by reverse engineering an actual GSM telephone and published at http://***. We would like to thank the GSM organization for graciously conffirming to us the correctness of this un-official description. In addition, we would like to stress that this paper considers the narrow issue of the cryptographic strength of A5/1, and not the broader issue of the practical security of fielded GSM systems, about which we make no claims. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

Personal secure booting 1

引用

6th Australasian conference on Information Security and Privacy, ACISP 2001

作者： Itoi, Naomaru Arbaugh, William A. Pollack, Samuela J. Reeves, Daniel M. Center for Information Technology Integration University of Michigan United States Department of Computer Science University of Maryland College Park United States Electrical Engineering and Computer Science Department University of Michigan United States

ISBN: (数字)9783540477198

ISBN: (纸本)3540423001

With the majority of security breaches coming from inside of organizations, and with the number of public computing sites, where users do not know the system administrators, increasing, it is dangerous to blindly trust system administrators to manage computers appropriately. However, most current security systems are vulnerable to malicious software modification by administrators. To solve this problem, we have developed a system called sAEGIS, which embraces a smartcard as personal secure storage for computer component hashes, and uses the hashes in a secure booting process to ensure the integrity of the computer components. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Smart cards

来源：评论

学校读者我要写书评

暂无评论

Coverage metrics for temporal logic model checking

引用

7th International conference on Tools and Algorithms for the Construction and Analysis of systems, TACAS 2001 Held as Part of the Joint European conferences on theory and Practice of software, ETAPS 2001

作者： Chockler, Hana Kupferman, Orna Vardi, Moshe Y. Hebrew University School of Engineering and Computer Science Jerusalem91904 Israel Rice University Department of Computer Science HoustonTX77251-1892 United States

ISBN: (纸本)3540418652

In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complete the specification is, and whether it really covers all the behaviors of the system. In this paper we study coverage metrics for model *** metrics are based on modifications we apply to the system in order to check which parts of it were actually relevant for the verification process to succeed. We introduce two principles that we believe should be part of any coverage metric for model checking: a distinction between state-based and logicbased coverage, and a distinction between the system and its environment. We suggest several coverage metrics that apply these principles, and we describe two algorithms for finding the uncovered parts of the system under these definitions. the first algorithm is a symbolic implementation of a naive algorithm that model checks many variants of the original system. the second algorithm improves the naive algorithm by exploiting overlaps in the variants. We also suggest a few helpful outputs to the user, once the uncovered parts are found. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Shared virtual memory clusters with next-generation interconnection networks and wide compute nodes 8th

引用

8th International conference on High Performance Computing, HiPC 2001

作者： Gibson, Courtney R. Bilas, Angelos Department of Electrical and Computer Engineering University of Toronto TorontoONM5S 3G4 Canada

ISBN: (纸本)3540430091

Recently much effort has been spent on providing a shared address space abstraction on clusters of small-scale symmetric multiprocessors. However, advances in technology will soon make it possible to construct these clusters with larger-scale cc-NUMA nodes, connected with non-coherent networks that offer latencies and bandwidth comparable to interconnection networks used in hardware cache-coherent systems. the shared memory abstraction can be provided on these systems in software across nodes and in hardware within nodes. In this work we investigate this approach to building future software shared memory clusters. We use an existing, large-scale hardware cache- coherent system with 64 processors to emulate a future cluster. We present results for both 32- and 64-processor system configurations. We quantify the effects of faster interconnects and wide, NUMA nodes on system design and identify the areas where more research is required for future SVM clusters. We find that current SVM protocols can only partially take advantage of faster interconnects and they need to be adjusted to the new system features. In particular, unlike in today's clusters that employ SMP nodes, improving intra-node synchronization and data placement are key issues for future clusters. Data wait time and synchronization costs are not major issues, when not affected by the cost of page invalidations. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Interconnection networks (circuit switching)

来源：评论

学校读者我要写书评

暂无评论

A UML-based approach to system testing 4th

引用

4th International conference on Unified Modeling Language, UML 2001

作者： Briand, Lionel Labiche, Yvan Software Quality Engineering Laboratory Systems and Computer Engineering Department Carleton University 125 Colonel By Drive OttawaK1S 5B6 Canada

ISBN: (纸本)9783540426677

System testing is concerned with testing an entire system based on its specifications. In the context of object-oriented, UML development, this means that system test requirements are derived from UML analysis artifacts such as use cases, their corresponding sequence and collaboration diagrams, class diagrams, and possibly the use of the Object Constraint Language across all these artifacts. Our goal is to support the derivation of test requirements, which will be transformed into test cases, test oracles, and test drivers once we have detailed design information. Another important issue we address is the one of testability. Testability requirements (or rules) need to be imposed on UML artifacts so as to be able to support system testing efficiently. those testability requirements result from a trade-off between analysis and design overhead and improved testability. the potential for automation is also an overriding concern all across our work as the ultimate goal is to fully support testing activities with high-capability tools. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Branch, cut, and price: Sequential and parallel 5th

引用

5th International conference on Mobile Agents, MA 2001

作者： Ladányi, Laszlo Ralphs, Ted K. Trotter, Leslie E. Department of Mathematical Sciences IBM T. J. Watson Research Center Yorktown HeightsNY10598 United States Department of Industrial and Manufacturing Systems Engineering Lehigh University BethlehemPA18017 United States School of OR and IE Cornell University IthacaNY14853 United States

ISBN: (纸本)3540428771

Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generated dynamically throughout the search tree. the ability to handle constantly changing sets of cuts and variables allows these algorithms to undertake the solution of very large-scale DOPs;however, it also leads to interesting implementational challenges. these lecture notes, based on our experience over the last six years with implementing a generic framework for BCP called SYMPHONY (Single- or Multi-Process Optimization over Networks), address these challenges. they are an attempt to summarize some of what we and others have learned about implementing BCP, both sequential and parallel, and to provide a useful reference for those who wish to use BCP techniques in their own research. SYMPHONY, the software from which we have drawn most of our experience, is a powerful, state-of-the-art library that implements the generic framework of a BCP algorithm. the library’s modular design makes it easy to use in a variety of problem settings and on a variety of hardware platforms. All library subroutines are generic—their implementation does not depend on the problem-setting. To develop a full-scale BCP algorithm, the user has only to specify a few problem-specific methods such as cut generation. the vast majority of the computation takes place within a "black box," of which the user need have no knowledge. Within the black box, SYMPHONY performs all the normal functions of branch and cut—tree management, LP solution, cut pool management, as well as inter-process communication (if parallelism is used). Source code and documentation for SYMPHONY are available at http://***/SYMPHONY. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

An application of genetic algorithms to course scheduling at the United States army war college 14th

引用

14th International conference on Industrial and engineering Applications of Artificial Intelligence and Expert systems, IEA/AIE 2001

作者： Donlon, James J. Knowledge Engineering Group United States Army War College 650 Wright Avenue CarlislePA17013 United States

ISBN: (纸本)3540422196

Genetic algorithms can be applied with great success on a wide range of problems, including scheduling problems. this paper presents an application of genetic algorithms to a complex scheduling problem, wherein student demand for courses and scheduling constraints inform the production of a course schedule. the scheduler is currently in use in a decision support system at the U.S. Army War College, and has produced excellent results for two academic years. the problem domain and software solution are described, and the representations and algorithms used by the scheduler are presented. Empirical observations about the scheduler’s performance and problem-solving characteristics are also presented. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Renewal of the causes by observed effects by means of fuzzy relations matrix and genetic algorithm

Renewal of the causes by observed effects by means of fuzzy ...

引用

conference of the North American Fuzzy Information Processing Society - NAFIPS

作者： A. Rotshtein H. Rakytyanska Industrial Engineering and Management Department Jerusalem College of Technology Jerusalem Israel Applied Mathematics and Computerized Systems Department Vinnitsa State Technical University Vinnitsa Ukraine

Application of inverse logical inference in diagnostic expert systems is considered. Diagnosis decision finding requires fuzzy logical equation system solutions. the genetic algorithm for optimization based on crossover, mutation and selection of the initial set of chromosomes is proposed for fuzzy logical equation system solving. computer simulation illustrates the algorithm efficiency. the suggested genetic algorithm can find application in expert systems for technical and medical diagnosis and quality control.

关键词： Application software Diagnostic expert systems Fuzzy logic Fuzzy systems Equations Genetic algorithms Genetic mutations Biological cells Fuzzy sets computer simulation

来源：评论

学校读者我要写书评

暂无评论

Agent-enhanced dynamic service level agreement in future network environments 4th

Agent-enhanced dynamic service level agreement in future net...

引用

4th IFIP/IEEE International conference on Management of Multimedia Networks and Services, MMNS 2001

作者： Chieng, David Marshall, Alan Ho, Ivan Parr, Gerard Advanced Telecommunication Systems Laboratory School of Electrical and Electronic Engineering The Queen’s University of Belfast Ashby Bld Stranmillis Road BelfastBT9 5AH United Kingdom Telecommunication and Distributed Systems Group School of Information and Software Engineering University of Ulster at Coleraine ColeraineBT52 1SA United Kingdom

ISBN: (纸本)9783540455080

Current network infrastructures are experiencing rapid transformation from providing mere connectivity, to a wider range of flexible network services with Quality of Service (QoS). We propose an agent-enhanced system that facilitates dynamic Service Level Agreement (SLA) activities, such as end-to-end QoS specifications and service price negotiations in such an environment. A prototype system consisting of real-time Java-based agents that interacts with a simulated network was developed to demonstrate scenarios and enable analysis. the studies show that this form of dynamic SLA negotiation introduces many innovative ways on how network services can be provisioned. this paper also highlights the effects of implementing dynamic connection bandwidth pricing on traffic load and network provider’s revenues. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 431 432 433 434 435 436 437 438 439 440 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：