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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

724 篇 会议
362 篇 期刊文献
15 册 图书

馆藏范围

1,101 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

641 篇 工学
- 461 篇 计算机科学与技术...
- 385 篇 软件工程
- 122 篇 信息与通信工程
- 115 篇 控制科学与工程
- 57 篇 电气工程
- 44 篇 电子科学与技术（可...
- 43 篇 机械工程
- 38 篇 生物工程
- 29 篇 仪器科学与技术
- 27 篇 生物医学工程（可授...
- 25 篇 光学工程
- 21 篇 安全科学与工程
- 20 篇 动力工程及工程热...
- 18 篇 土木工程
- 17 篇 化学工程与技术
- 15 篇 航空宇航科学与技...
283 篇 理学
- 159 篇 数学
- 57 篇 系统科学
- 50 篇 统计学（可授理学、...
- 49 篇 物理学
- 48 篇 生物学
- 21 篇 化学
182 篇 管理学
- 114 篇 管理科学与工程(可...
- 77 篇 图书情报与档案管...
- 57 篇 工商管理
33 篇 医学
- 29 篇 临床医学
- 26 篇 基础医学(可授医学...
- 15 篇 药学(可授医学、理...
22 篇 经济学
- 22 篇 应用经济学
18 篇 教育学
- 18 篇 教育学
17 篇 法学
8 篇 农学
3 篇 艺术学
2 篇 文学
1 篇 军事学

主题

83 篇 laboratories
72 篇 computer science
64 篇 software enginee...
45 篇 application soft...
42 篇 grid computing
33 篇 software systems
33 篇 quality of servi...
32 篇 resource managem...
32 篇 computational mo...
29 篇 systems engineer...
29 篇 software quality
26 篇 costs
26 篇 distributed comp...
25 篇 cloud computing
25 篇 unified modeling...
24 篇 software testing
21 篇 computer archite...
20 篇 processor schedu...
20 篇 semantics
19 篇 data mining

机构

31 篇 beijing key labo...
28 篇 state key labora...
26 篇 grid computing a...
22 篇 school of electr...
22 篇 seventh research...
21 篇 software enginee...
20 篇 state key labora...
19 篇 college of compu...
17 篇 key laboratory o...
16 篇 software enginee...
15 篇 college of compu...
14 篇 jiangsu institut...
14 篇 zhongguancun lab...
12 篇 school of comput...
11 篇 state key labora...
11 篇 state key labora...
9 篇 cloud computing ...
9 篇 zhengzhou univer...
9 篇 decision systems...
9 篇 university of ch...

作者

47 篇 rajkumar buyya
35 篇 junping du
34 篇 yingmin jia
24 篇 fashan yu
20 篇 buyya rajkumar
18 篇 ismail leila
13 篇 m. parashar
13 篇 materwala huned
13 篇 labiche yvan
12 篇 l.c. briand
12 篇 veera boonjing
11 篇 y. labiche
10 篇 cheng betty h. c...
10 篇 p.k. mckinley
10 篇 parashar manish
10 篇 jianwei niu
9 篇 baowen xu
9 篇 sarun intakosum
9 篇 xinjun mao
9 篇 selamat ali

语言

1,059 篇 英文
28 篇 其他
12 篇 中文
2 篇 日文

检索条件"机构=Software Quality Engineering Laboratory Systems and Computer Engineering"

共 1101 条记录，以下是951-960 订阅

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

详细简洁

排序：

Predictors of success in diagrammatic problem solving

Predictors of success in diagrammatic problem solving

引用

3rd International Conference on Diagrammatic Representation and Inference, Diagrams 2004

作者： Yoon, Daesub Narayanan, N. Hari Intelligent and Interactive Systems Laboratory Department of Computer Science and Software Engineering Auburn University AuburnAL36849 United States

ISBN: (纸本)354021268X

We conducted an eye-tracking study of mechanical problem solving from cross-sectional diagrams of devices. Response time, accuracy and eye movement data were collected and analyzed for 72 problem-solving episodes (9 subjects solving 8 problems each). Results indicate that longer response times and visually attending to more components of a device do not necessarily lead to increased accuracy. However, more focus shifts, visually attending to components in the order of causal propagation, and longer durations of visual attention allocated to critical components of the devices appear to be characteristics that separate successful problem solvers from unsuccessful ones. These findings throw light on effective diagrammatic reasoning strategies, provide empirical support to a cognitive model of comprehension, and suggest ideas for the design of information displays that support causal reasoning. © 2004, Springer-Verlag Berlin Heidelberg, All rights Reserved.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Transformations for write-all-with-collision model

引用

7th International Conference on Principles of Distributed systems, OPODIS 2003

作者： Kulkarni, Sandeep S. Arumugam, Mahesh Umamaheswaran Software Engineering and Network Systems Laboratory Department of Computer Science and Engineering Michigan State University East LansingMI48824 United States

ISBN: (纸本)3540226672

In this paper, we consider a new atomicity model, write all with collision (WAC), and compare it with existing models considered in the literature. This model captures the computations in sensor networks. We show that it is possible to transform a program from WAC model into a program in read/write model, and vice versa. Further, we show that the transformation from WAC model to read/write model is stabilization preserving, and the transformation from read/write model to WAC model is stabilization preserving for timed systems. In the transformation from read/write model to WAC model, if the system is untimed (asynchronous) and processes are deterministic then under reasonable assumptions, we show that (1) the resulting program in WAC model can allow at most one process to execute, and (2) the resulting program in WAC model cannot be stabilizing. In other words, if a deterministic program cannot read then it is important that it can tell time. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Stabilization

来源：评论

学校读者我要写书评

暂无评论

Understanding the behavior and performance of non-blocking communications in MPI

引用

10th International European Conference on Parallel Processing, Euro-Par 2004

作者： Saif, Taher Parashar, Manish The Applied Software Systems Laboratory Department of Electrical and Computer Engineering Rutgers University PiscatawayNJ08854 United States

ISBN: (纸本)3540229248

The behavior and performance of MPI non-blocking message passing operations are sensitive to implementation specifics as they are heavily dependant on available system level buffers. In this paper we investigate the behavior of non-blocking communication primitives provided by popular MPI implementations and propose strategies for these primitives than can reduce processor synchronization overheads. We also demonstrate the improvements in the performance of a parallel Structured Adaptive Mesh Refinement (SAMR) application using these strategies. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Modular monadic program slicing

Modular monadic program slicing

引用

Proceedings of the 28th Annual International computer software and Applications Conference, COMPSAC 2004

作者： Zhang, Yingzhou Xu, Baowen Shi, Liang Li, Bixin Yang, Hongji Jiangsu Institute of Software Quality Nanjing 210096 China State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 China School of Computing De Montfort University United Kingdom Department of Computer Science and Engineering Southeast University Nanjing 210096 China

Program slicing is widely used in applications such as program comprehension, software testing, debugging, measurement, and re-engineering. This paper proposes a new approach for program slicing, called modular monadic slicing, basing on modular monadic semantics of the program analysed. We abstract the computation of program slicing as a language-independence entity: slice monad transformer. On the basis of this, we present and illustrate modular monadic dynamic and static slice algorithm in detail. We conclude that modular monadic slicing has excellent flexibility and reusability properties comparing with the existing program slicing algorithms. It computes program slices on abstract syntax directly without intermediate structures such as dependence graphs. © 2004 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A controlled experiment on the impact of the object constraint language in UML-based maintenance

A controlled experiment on the impact of the object constrai...

引用

International Conference on software Maintenance (ICSM)

作者： L.C. Briand Y. Labiche H.D. Yan M. Di Penta Software Quality Engineering Laboratory Systems and Computer Engineering Department Carleton University Ottawa ONT Canada Research Centre on Software Technology Department of Engineering University of Sannio Benevento Italy

The object constraint language (OCL) was introduced as part of the Unified Modeling Language (UML). Its main purpose is to make UML models more precise by providing a constraint language. For example, operation contracts and statechart guard conditions can be precisely defined using OCL. There has been an ongoing debate on the usefulness of using OCL in UML-based development, questioning whether the additional effort and formality were worth the benefit. This work presents the results of a controlled experiment that investigates the impact of using OCL on model comprehension and maintainability. Current results show that, once past an initial learning curve, significant benefits can be obtained by using OCL in combination with UML diagrams.

关键词： Unified modeling language software engineering software quality systems engineering and theory Text analysis Laboratories Drives Contracts Logic Cost benefit analysis

来源：评论

学校读者我要写书评

暂无评论

A market-based scheduler for JXTA-based peer-to-peer computing system

A market-based scheduler for JXTA-based peer-to-peer computi...

引用

International Conference on Computational Science and its Applications, ICCSA 2004

作者： Ping, Tan Tien Sodhy, Gian Chand Yong, Chan Huah Haron, Fazilah Buyya, Rajkumar School of Computer Science Universiti Sains Malaysia Penang11800 Malaysia Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)3540220607

Peer-to-Peer (P2P) computing is said to be the next wave of computing after client-server and web-based computing. It provides an opportunity to harness a lot of idle peer-resources such as desktop computers across the Internet, for solving large-scale computing applications. Each peer is autonomous and it needs incentive for sustained contribution of its resources to P2P applications. In addition, a flexible and efficient job scheduling is needed to harvest the idle computing power as cheaply and economically as possible. This paper introduces an economic based job scheduler for mapping jobs to resources in P2P computing environment. The scheduler has been implemented with the Compute Power Market (CPM) system developed using Sun JXTA P2P technology. Our scheduler can be configured depending on users’ quality of service requirements such as the deadline and budget constraints. Our scheduler follows a hierarchy scheme. The design allows multiple consumers and multiple providers to schedule and run jobs. To allow wider support for a wide variety of applications, the system is designed to allow easy ‘plug in’ of user applications. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Personal computers

来源：评论

学校读者我要写书评

暂无评论

TRAP/J: Transparent generation of adaptable java programs

引用

On the Move to Meaningful Internet systems 2004: International Conference on Cooperative Information systems, CoopIS 2004, International Conference on Distributed Objects and Applications, DOA 2004 and International Conference on Ontologies, Databases and Applications of Semantics, ODBASE 2004

作者： Masoud Sadjadi, S. McKinley, Philip K. Cheng, Betty H. C. Kurt Stirewalt, R.E. School of Computer Science Florida International University MiamiFL33199 United States Software Engineering and Network Systems Laboratory Department of Computer Science and Engineering Michigan State University East LansingMI48824 United States

ISBN: (纸本)3540236627

This paper describes TRAP/J, a software tool that enables new adaptable behavior to be added to existing Java applications transparently (that is, without modifying the application source code and without extending the JVM). The generation process combines behavioral reflection and aspect-oriented programming to achieve this goal. Specifically, TRAP/J enables the developer to select, at compile time, a subset of classes in the existing program that are to be adaptable at run time. TRAP/J then generates specific aspects and reflective classes associated with the selected classes, producing an adapt-ready program. As the program executes, new behavior can be introduced via interfaces to the adaptable classes. A case study is presented in which TRAP/J is used to introduce adaptive behavior to an existing audio-streaming application, enabling it to operate effectively in a lossy wireless network by detecting and responding to changing network conditions. © Springer-Verlag Berlin Heidelberg 2004.

关键词： quality of service

来源：评论

学校读者我要写书评

暂无评论

A complexity measure for Ontology based on UML

A complexity measure for Ontology based on UML

引用

Proceedings - 10th IEEE International Workshop on Future Trends of Distributed Computing systems

作者： Kang, Dazhou Xu, Baowen Lu, Jianjiang Chu, William C. Dept. of Comp. Sci. and Engineering Southeast University Nanjing 210096 China Jiangsu Inst. of Software Quality Nanjing 210096 China State Key Laboratory of Software Wuhan University Wuhan 430072 China Department of Computer Science TungHai University Taiwan

ISBN: (纸本)0769521185

UML is a good tool to represent ontologies. When using UML for Ontology development, one of the principal goals is to assure the quality of ontologies. UML class diagrams provide a static modeling capability that is well suited for representing ontologies, so the structural complexity of a UML class diagram is one of the most important measures to evaluate the quality of the ontologies. This paper uses weighted class dependence graphs to represent a given class diagrams, and then presents a structure complexity measure for the UML class diagrams based on entropy distance. It considers complexity of both classes and relationships between the classes, and presents rules for transforming complexity value of classes and different lands of relations into a weighted class dependence graphs. This method can measure the structure complexity of class diagrams objectively.

关键词： computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Automated synthesis of multitolerance

Automated synthesis of multitolerance

引用

International Conference on Dependable systems and Networks (DSN)

作者： S.S. Kulkarni A. Ebnenasir Software Engineering and Network Systems Laboratory Department of Computer Science and Engineering Michigan State University East Lansing MI USA

We concentrate on automated synthesis of multitolerant programs, i.e., programs that tolerate multiple classes of faults and provide a (possibly) different level of fault-tolerance to each class. We consider three levels of fault-tolerance: (1) failsafe, where in the presence of faults, the synthesized program guarantees safety, (2) nonmasking, where in the presence of faults, the synthesized program recovers to states from where its safety and liveness are satisfied, and (3) masking where in the presence of faults the synthesized program satisfies safety and recovers to states from where its safety and liveness are satisfied. We focus on the automated synthesis of finite-state multitolerant programs in high atomicity model where the program can read and write all its variables in an atomic step. We show that if one needs to add failsafe (respectively, nonmasking) fault-tolerance to one class of faults and masking fault-tolerance to another class of faults then such addition can be done in polynomial time in the state space of the fault-intolerant program. However, if one needs to add failsafe fault-tolerance to one class of faults and nonmasking fault-tolerance to another class of faults then the resulting problem is NP-complete. We find this result to be counterintuitive since adding failsafe and nonmasking fault-tolerance to the same class of faults (which is equivalent to adding masking fault-tolerance to that class of faults) can be done in polynomial time, whereas adding failsafe fault-tolerance to one class of faults and nonmasking fault-tolerance to a different class of faults is NP-complete.

关键词： Fault tolerance Safety Fault tolerant systems Network synthesis Polynomials software engineering Laboratories computer science State-space methods engineering profession

来源：评论

学校读者我要写书评

暂无评论

A distributed approach to topology-aware overlay path monitoring

A distributed approach to topology-aware overlay path monito...

引用

International Conference on Distributed Computing systems

作者： C. Tang P.K. McKinley Software Engineering and Network Systems Laboratory Department of Computer Science and Engineering Michigan State University East Lansing MI USA

Path probing is essential to maintain an efficient overlay network topology. However, the cost of complete probing can be as high as O(n/sup 2/), which is prohibitive in large-scale overlay networks. Recently we proposed a method that trades probing overhead for inference accuracy in sparse networks such as the Internet. The method uses physical path information to infer path quality for all of the n/spl times/(n-1) overlay paths, while actually probing only a subset of the paths. We propose and evaluate a distributed approach to implement this method. We describe a minimum diameter, link-stress bounded overlay spanning tree, which is used to collect and disseminate path quality information. All nodes in the tree collaborate to infer the quality of all paths. Simulation results show this approach can achieve a high-level of inference accuracy while reducing probing overhead and balancing link stress on the spanning tree.

关键词： Peer to peer computing Network topology Stress Probes IP networks Routing Bandwidth Delay computerized monitoring software engineering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共111页 << < 92 93 94 95 96 97 98 99 100 101 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：