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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

324 篇 会议
154 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

163 篇 工学
- 88 篇 计算机科学与技术...
- 50 篇 电气工程
- 49 篇 软件工程
- 32 篇 电子科学与技术（可...
- 16 篇 船舶与海洋工程
- 14 篇 信息与通信工程
- 14 篇 控制科学与工程
- 5 篇 机械工程
- 3 篇 光学工程
- 3 篇 仪器科学与技术
- 3 篇 材料科学与工程（可...
- 3 篇 化学工程与技术
- 3 篇 网络空间安全
- 2 篇 交通运输工程
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
126 篇 理学
- 67 篇 物理学
- 66 篇 数学
- 9 篇 统计学（可授理学、...
- 8 篇 天文学
- 8 篇 系统科学
- 3 篇 化学
- 1 篇 地球物理学
- 1 篇 生物学
17 篇 管理学
- 13 篇 管理科学与工程(可...
- 4 篇 工商管理
- 4 篇 图书情报与档案管...
2 篇 经济学
- 2 篇 应用经济学
2 篇 法学
- 2 篇 法学
1 篇 教育学
- 1 篇 教育学
1 篇 医学

主题

82 篇 mathematics
73 篇 computer science
23 篇 educational inst...
14 篇 data mining
14 篇 mathematical mod...
13 篇 algorithm design...
13 篇 humans
12 篇 computational mo...
12 篇 control systems
12 篇 testing
12 篇 equations
11 篇 application soft...
11 篇 neural networks
10 篇 internet
10 篇 clustering algor...
9 篇 statistics
9 篇 computational in...
9 篇 costs
8 篇 parallel process...
8 篇 databases

机构

15 篇 dep. math. compu...
8 篇 drug discovery p...
8 篇 inst. of math. &...
7 篇 comput. sci. tel...
6 篇 coll. of math. &...
6 篇 dept. of math. s...
5 篇 dept. of comput....
5 篇 dept. of math. &...
5 篇 dept. of math. &...
5 篇 dept. of math. &...
4 篇 dept. of comput....
4 篇 dept. of math. s...
4 篇 comput. sci. tel...
4 篇 centre for math....
4 篇 dept. of appl. m...
4 篇 dept. of math. a...
4 篇 div. of math. & ...
4 篇 argonne national...
4 篇 dept. of math. &...
4 篇 sch. of comput. ...

作者

10 篇 m. randic
7 篇 alan p. kozikows...
7 篇 harn l
7 篇 n. trinajstic
5 篇 jinhu lu
5 篇 mohamed-slim alo...
5 篇 milan randic
4 篇 chen zhi-zhong
4 篇 shen xj
4 篇 subhash c. basak
4 篇 s. nikolic
3 篇 wen jianjun
3 篇 sakata shojiro
3 篇 jiang tao
3 篇 a.y. cairns
3 篇 s.s.-t. yau
3 篇 toptsis a.a.
3 篇 cox w
3 篇 stephan reiff-ma...
3 篇 lin guohui

语言

429 篇 英文
44 篇 其他
5 篇 中文

检索条件"机构=Sci. Comput. & Comput. Math. Program"

共 478 条记录，以下是331-340 订阅

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

详细简洁

排序：

Petri Net Modeling for Production Logistics Process

Petri Net Modeling for Production Logistics Process

引用

International Conference on comput.tional Intelligence and Software Engineering (CiSE)

作者： Yongyao Li Xiaoming Wang Coll. of Math. & Comput. Sci. Fujian Normal Univ. Fuzhou China Dept. of Inf. CPTF Optronics Co. Ltd. Fuzhou China

Time delay is introduced into coloured Petri net, then the fixed time delay coloured Petri net is established. This kind of Petri net model can describe actual behavior of dynamic system. Utilizing the model, the modeling method for production logistics process is posed, and an actual model about task control process of overhead crane and smelting furnace is established. It is showed that the method is feasible and convenient to modeling.

关键词： Production Logistics Delay effects math.matical model Petri nets Educational institutions math.matics comput.r sci.nce Process control Cranes

来源：评论

学校读者我要写书评

暂无评论

Techniques for improving comput.r-assisted communication for physically impaired non-vocal people through using prestored extended texts

Techniques for improving computer-assisted communication for...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： N. Alm J.L. Arnott A.F. Newell Microcentre Department of Mathematics and Computer Science Dundee University Dundee UK University of Dundee Dundee Dundee GB Dept. of Math. & Comput. Sci. Dundee Univ. UK

The problems faced by people whose physical impairments include the inability to communicate through speech are demonstrated by the fact that, even with current technology, speech rates achievable using speech output devices typically vary between 2-10 words per minute. We have been investigating ways in which the communication system itself could take on many of the cognitive and manipulative tasks required to locate and produce suitable prestored texts for the user. The storage and retrieval methods we have investigated include a text database with items indexed semantically and pragmatically, logging conversational paths for reuse, hypertext, and fuzzy information retrieval. The ultimate goal of this work is a communication system which will allow a severely impaired nonvocal person to make a significantly better conversational impact than is possible with present systems.< >

关键词： Speech Information retrieval Databases

来源：评论

学校读者我要写书评

暂无评论

Genetic micro-rollback self-recovery synthesis

Genetic micro-rollback self-recovery synthesis

引用

Congress on Evolutionary comput.tion

作者： K. Sookhanaphibarn C. Lursinsap Dept. of Math. & Comput. Sci. Chulalongkorn Univ. Bangkok Thailand Advanced Virtual and Intelligent Computing Laboratory Department of Mathematics and Computer Science Chulalongkom University Bangkok Thailand

Self-recovery micro-rollback synthesis (SMS) has currently become an important issue in high level synthesis. The problem of SMS combines the problem of functional unit scheduling and assignment with the problem of checkpoint insertion and microprogram optimization. It has been shown that these problems are NP-complete. The most studied problem is functional unit scheduling and assignment. Several heuristic techniques, including as soon as possible (ASAP), as last as possible (ALAP), integer programming, spring elasticity model, graph based mobility model, and genetic algorithm, are proposed. However, there are few studies on self-recovery micro-rollback synthesis and the technique of solution space searching by genetic algorithm has not been attempted. We study the feasibility of the genetic algorithm for the problem of SMS constrained on: the number of functional units, control steps, number of checkpoints, and the functional unit areas.

关键词： High level synthesis Circuit faults Genetic algorithms Space technology Very large scale integration Algorithm design and analysis Laboratories math.matics comput.r sci.nce Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network

Solving the traveling salesman problem with a distributed br...

引用

International Symposium on Parallel Processing

作者： S. Tschoke R. Lubling B. Monien Department of Mathematics and Computer Science University of Paderborn Paderborn Germany Universitat Paderborn Paderborn Nordrhein-Westfalen DE Dept. of Math. & Comput. Sci. Paderborn Univ. Germany

This paper is the first to present a parallelization of a highly efficient best-first branch-and-bound algorithm to solve large symmetric traveling salesman problems on a massively parallel comput.r containing 1024 processors. The underlying sequential branch-and-bound algorithm is based on 1-tree relaxation. The parallelization of the branch-and-bound algorithm is fully distributed. Every processor performs the same sequential algorithm but on a different part of the solution tree. To distribute subproblems among the processors we use a new direct-neighbor dynamic load-balancing strategy. The general principle can be applied to all other branch-and-bound algorithms leading to an "automatic" parallelization. At present we can efficiently solve traveling salesman problems up to a size of 318 cities on networks of up to 1024 transputers. On hard problems we achieve an almost linear speed-up.< >

关键词： Traveling salesman problems Concurrent comput.ng Military comput.ng math.matics comput.r sci.nce Electronic mail comput.r networks Distributed comput.ng Artificial intelligence Humans

来源：评论

学校读者我要写书评

暂无评论

A parallel local-search algorithm for the k-partitioning problem

A parallel local-search algorithm for the k-partitioning pro...

引用

Annual Hawaii International Conference on System sci.nces (HICSS)

作者： R. Diekmann R. Luling B. Monien C. Spraner Department of Mathematics and Computer Science University of Paderborn Paderborn Germany Universitat Paderborn Paderborn Nordrhein-Westfalen DE Dept. of Math. & Comput. Sci. Paderborn Univ. Germany

Presents a new algorithm for the k-partitioning problem which achieves an improved solution quality compared to known heuristics. We apply the principle of so-called "helpful sets", which has been shown to be very efficient for graph bisection, to the direct k-partitioning problem. The principle is extended in several ways. We introduce a new abstraction technique which shrinks the graph during runtime in a dynamic way, leading to shorter comput.tion times and improved solution qualities. The use of stochastic methods provides further improvements in terms of solution quality. Additionally, we present a parallel implementation of the new heuristic. The parallel algorithm delivers the same solution quality as the sequential one, while providing reasonable parallel efficiency on moderately sized MIMD systems. All results are verified by experiments for various graphs and processor numbers.< >

关键词： Partitioning algorithms math.matics comput.r sci.nce Runtime Stochastic processes Humans Parallel architectures Multiprocessor interconnection networks Parallel processing Solid modeling

来源：评论

学校读者我要写书评

暂无评论

Adding momentum to human abilities: lessons from research into comput.r-based systems for people with physical impairments

Adding momentum to human abilities: lessons from research in...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： N. Alm A. McKinlay A.F. Newell J.L. Amott MicroCentre Department of Mathematics and Computer Science University of Dundee Dundee UK University of Dundee Dundee Dundee GB Dept. of Math. & Comput. Sci. Dundee Univ. UK

The goal of developing completely autonomous systems, which exhibit complex behaviour and which are robust in their encounters with the real world, is an ambitious one which may not be realised totally. However, powerful and useful systems can be developed which, although requiring continuous human intervention, magnify human abilities significantly. One area in which we might look to find guidelines for following this approach to augmenting human abilities is in the development of technical systems to assist people with physical and mental impairments. Research in this area is producing a number of examples of human-machine symbiosis which are instructive. A number of such prototype systems are described.< >

关键词： Humans Robustness Control systems Physics comput.ng Telecommunication control math.matics comput.r sci.nce Guidelines Man machine systems Symbiosis

来源：评论

学校读者我要写书评

暂无评论

A Study of Factors that Lead Development Teams to Incur Technical Debt in Software Projects

A Study of Factors that Lead Development Teams to Incur Tech...

引用

Euromicro Conference on Software Engineering and Advanced Applications (SEAA)

作者： Nicolli Rios Rodrigo Oliveira Spinola Manoel G. de Mendonça Neto Carolyn Seaman Dept. of Comput. Sci. Fed. Univ. of Bahia Salvador Salvador Brazil Grad. Program in Syst. & Comput. Salvador Univ. Salvador Salvador Brazil University of Maryland Baltimore Baltimore MD US

Context: Several technical debt (TD) management strategies have been proposed, but considering actions that could prevent the insertion of TD in the first place is not yet a common practice. This is a point that deserves investigation because it is expected that TD prevention could be sometimes "cheaper" than TD repayment. Besides, TD prevention also helps other TD management activities, especially in catching inexperienced developers' 'not-so-good' solutions. Thus, while TD management is an important topic, it is also worthwhile to understand the motivations and factors that could lead development teams to incur different types of debt. Objective: To identify causes that lead to the occurrence of TD, investigate if these causes occur in isolation or in combination, understand if TD can be prevented, and investigate, in terms of effort, if it is better to prevent debt, or incur it and pay it off later. Method: An interview based case study was performed with software practitioners. The results were formulated based on a synthesis of the text fragments coded for each response. Results: We identified 57 causes that lead a development team to incur debt. For the majority of TD types, these causes occur in combination. It was also indicated that debt can be prevented, and it is better to work on prevention activities than to pay off debt later. Conclusion: Results allowed us to identify 57 causes that lead a development team to incur debt. These causes mostly occur in combination, not in isolation. It was also indicated that debt can be prevented, and it would be better to work on prevention activities than to pay off debt later.

关键词： Interviews Software Lead Organizations Time division multiplexing comput.r architecture Documentation

来源：评论

学校读者我要写书评

暂无评论

A comparative evaluation of sorted priority algorithms and class based queuing using simulation

A comparative evaluation of sorted priority algorithms and c...

引用

Annual Symposium on Simulation

作者： P. Csallinan M. Witwit F. Ball Sch. of Comput. & Math. Sci. Oxford Brookes Univ. UK Distributed Systems Research Group School of Computing and Mathematical Sciences Oxford Brookes University Oxford UK

This paper present results from a simulation study aimed at evaluating the comparative performance of two resource control mechanisms viz. weighted fair queueing (WFQ) and class based queueing (CBQ). The purpose of this work is to assess their relative suitability for supporting multiservice in future packet switched networks. The experiment described in this paper compares their respective response time delay characteristics when each is presented with identical traffic profiles.

关键词： Traffic control Delay Quality of service comput.tional modeling Switches Telecommunication traffic Distributed comput.ng Read only memory Communication networks Resource management

来源：评论

学校读者我要写书评

暂无评论

Learning orthographic transformations for object recognition

Learning orthographic transformations for object recognition

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： G. Bebis M. Georgiopoulos S. Bhatia Dept. of Math. & Comput. Sci. Missouri Univ. St. Louis MO USA Department of Mathematics & Computer Science University of Missouri Saint Louis MO USA

Considers the problem of learning to predict the correct pose of a 3D object, assuming orthographic projection and 3D linear transformations. A neural network is trained to learn the desired mapping. First, we consider the problem of predicting all possible views that an object can produce. This is performed by representing the object with a small number of reference views and using algebraic functions of views to construct the space of all possible views that the object can produce. Fundamental to this procedure is a methodology based on singular value decomposition and interval arithmetic for estimating of the ranges of values that the parameters of algebraic functions can assume. Then, a neural network is trained using a number of views (training views) which are generated by sampling the space of views of the object. During learning, a training view is presented to the inputs of the network which is required to respond at its outputs with the parameters of the algebraic functions used to generate the view from the reference views. Compared to similar approaches in the literature, the proposed approach has the advantage that it does not require the 3D models of the objects or a large number of views, it is extendible to other types of projections, and it is more practical for object recognition.

关键词： Object recognition Neural networks math.matics comput.r sci.nce comput.r graphics Singular value decomposition Arithmetic Data preprocessing Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

OSCAR on Debian: the EDF experience

OSCAR on Debian: the EDF experience

引用

IEEE International Symposium on High Performance comput.ng Systems and Applications (HPCS)

作者： G. Valley J.-Y. Berthou H. Prisker D. Leprince Comput. Sci. & Math. Div. Oak Ridge Nat. Lab. TN USA EDF Research and Development Clamart France EDFR&D Clamart France

Linux clusters are now an interesting solution to execute numerical simulations. But cluster use implies problems of deployment, because of their distributed architecture. In the past, each company developed its own solution based on various tools. Today, software suites like OSCAR are available and can be freely used. But such solutions may not be adapted to the current comput.ng architecture of companies. For example, the current solution deployed inside a company may be based on a Linux distribution not supported by a software suite like OSCAR. Nevertheless, the use of a software suite like OSCAR is very interesting for companies that are not specialized in cluster management. This paper presents the OSCAR port to the Debian distribution in the context of the numerical simulation platform deployed at Electricite de France (Electricity of France).

关键词： Linux comput.r architecture Packaging Numerical simulation Government comput.r sci.nce Research and development Production High performance comput.ng File servers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共48页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：