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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,396 篇 会议
133 篇 期刊文献
76 册 图书

馆藏范围

3,603 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

2,402 篇 工学
- 1,899 篇 计算机科学与技术...
- 1,155 篇 软件工程
- 418 篇 电气工程
- 270 篇 控制科学与工程
- 199 篇 信息与通信工程
- 128 篇 机械工程
- 72 篇 石油与天然气工程
- 64 篇 生物医学工程（可授...
- 59 篇 电子科学与技术（可...
- 56 篇 材料科学与工程（可...
- 56 篇 交通运输工程
- 51 篇 生物工程
- 45 篇 化学工程与技术
- 41 篇 动力工程及工程热...
- 38 篇 土木工程
- 35 篇 仪器科学与技术
- 34 篇 冶金工程
676 篇 理学
- 485 篇 数学
- 106 篇 物理学
- 85 篇 系统科学
- 80 篇 统计学（可授理学、...
- 74 篇 生物学
- 51 篇 化学
403 篇 管理学
- 338 篇 管理科学与工程(可...
- 149 篇 工商管理
- 81 篇 图书情报与档案管...
105 篇 教育学
- 103 篇 教育学
71 篇 医学
- 46 篇 临床医学
- 36 篇 基础医学(可授医学...
64 篇 经济学
- 64 篇 应用经济学
40 篇 法学
22 篇 文学
12 篇 农学
9 篇 艺术学
3 篇 军事学

主题

309 篇 linear programmi...
251 篇 programming
187 篇 dynamic programm...
142 篇 computer program...
119 篇 integer programm...
116 篇 optimization
109 篇 logic programmin...
87 篇 genetic programm...
82 篇 functional progr...
73 篇 computational mo...
68 篇 object oriented ...
66 篇 programming prof...
65 篇 parallel program...
56 篇 software enginee...
54 篇 costs
49 篇 mathematical mod...
48 篇 computer program...
46 篇 heuristic algori...
42 篇 artificial intel...
41 篇 computer science

机构

9 篇 univ london impe...
7 篇 inesc tec porto
6 篇 feup porto
6 篇 russian acad sci...
5 篇 c mast ubi covil...
4 篇 univ leicester l...
4 篇 vienna univ tech...
4 篇 institute of fun...
4 篇 chinese acad sci...
4 篇 university of am...
4 篇 univ nottingham ...
4 篇 beijing universi...
3 篇 weizmann inst sc...
3 篇 univ nottingham ...
3 篇 delft center for...
3 篇 international is...
3 篇 international bu...
3 篇 department of co...
3 篇 school of comput...
3 篇 univ cyprus dept...

作者

8 篇 catalao joao p. ...
7 篇 musirin ismail
5 篇 weiss gera
5 篇 marron assaf
4 篇 hirschfeld rober...
4 篇 ghani n
4 篇 katz guy
4 篇 saraswat vijay
4 篇 xiong rui
4 篇 funabiki nobuo
4 篇 fitiwi desta z.
4 篇 shi yong
4 篇 boercsoek josef
4 篇 jagadeesan radha
4 篇 gupta vineet
4 篇 michael n. young
4 篇 pesant gilles
4 篇 harel david
3 篇 muggleton stephe...
3 篇 faisal a. aldo

语言

3,494 篇 英文
82 篇 其他
26 篇 中文
5 篇 葡萄牙文
2 篇 俄文
1 篇 西班牙文

检索条件"任意字段=7th International Conference on Functional Programming"

共 3605 条记录，以下是1661-1670 订阅

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

详细简洁

排序：

the Differences between Self-Organized Group and Designated Group for Cooperative Learning

The Differences between Self-Organized Group and Designated ...

引用

IEEE international conference on Ubi-Media Computing

作者： Jian Wei Li Yao Tien Wang Yi Chun Chang Dept. Information and Communication Engineering Chaoyang University of Technology Taichung City Taiwan Dept. Computer Science and Information Engineering Hungkuang University Taichung City Taiwan

the literatures have indicated that cooperative learning facilitates enhancing learning performance, which focuses on (1) the interaction and the collaboration between grouping members, and (2) one member helping other members to be successful. the literatures have shown that the grouping organization is a critical issue for promoting learning achievement in cooperative learning. To evaluate the differences between the self-organized groups and the designated groups, this paper has conducted a serial of experiments and assessments to study the differences of learning performance, participation and satisfaction degree. In the self-organized groups the grouping members are decided by the grouping members, whereas the grouping members in the designated group are composited of the considering conditions. the experiment have demonstrated that the learning achievement of the designated group is high than the self-organized group. For the participation and the satisfaction degree of the curriculum, the self-organized group is high than the designated group.

关键词： Educational institutions Organizations Collaborative work Cities and towns Collaboration programming

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Dynamic VM Consolidation in Cloud Data Centers Using Ant Colony System

Energy-Aware Dynamic VM Consolidation in Cloud Data Centers ...

引用

IEEE international conference on Cloud Computing, CLOUD

作者： Fahimeh Farahnakian Adnan Ashraf Pasi Liljeberg Tapio Pahikkala Juha Plosila Ivan Porres Hannu Tenhunen Department of Information Technology University of Turku Turku Finland Abo Akademi Abo FI Department of Information Technologies Abo Akademi University Turku Finland

As the scale of a cloud data center becomes larger and larger, the energy consumption of the data center also grows rapidly. Dynamic consolidation of Virtual Machines (VMs) presents a significant opportunity to save energy by turning off unused Physical Machines (PMs) in data centers. In this paper, we present a distributed controller to perform dynamic VM consolidation to improve the resource utilizations of PMs and to reduce their energy consumption. Moreover, we use the ant colony system to find a near-optimal VM placement solution based on the specified objective function. Experimental results on the real workload traces from more than a thousand PlanetLab VMs show that the proposed approach reduces energy consumption and maintains required performance levels in a large-scale data center.

关键词： Optimization Resource management Heuristic algorithms Vectors Energy consumption Linear programming Servers

来源：评论

学校读者我要写书评

暂无评论

Campus parking space allocation distribution using pattern search and particle swarm pattern search algorithms

Campus parking space allocation distribution using pattern s...

引用

international Symposium on Soft Computing and Intelligent Systems (SCIS)

作者： Aderemi O. Adewumi Luke O. Joel Babatunde A. Sawyerr The School of Mathematics Statistics & Computer Science University of KwaZulu-Natal Durban South Afirca

the problem of inadequate allocation of car parking spaces to users in the campus environment is a major concern for planning managers and traffic engineers. Parking users could prefer either reserved spaces or unreserved spaces. this makes the campus parking manager to be faced with two basic problems which are: the problem of allocating the actual number of available reserved spaces to users without any conflict over the same parking space, and the problem of determining the number of parking permit to be issued for parking lot with unreserved spaces. Hence, this paper investigates the use of two heuristic algorithms, Pattern search(PS) algorithm and Particle swarm pattern search (PSwarm) algorithm, on the model for allocating car parking spaces in the university environment with an improvement in the constraints. the results obtained shows that the hybrid algorithm, particle swarm pattern search, outperforms the pattern search algorithm.

关键词： Mathematical model Buildings Equations Resource management Educational institutions Linear programming Particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

Solving the longest overlap region problem for noncoding DNA sequences with GPU

Solving the longest overlap region problem for noncoding DNA...

引用

international conference on BioMedical Engineering and Informatics (BMEI)

作者： YuKun Zhong JianBiao Lin BaoQiu Wang Chen Tao Che Nian Xie Wen Computer Science and Engineering Department Sichuan University Penshan China

ISBN: (纸本)9781479958399

Early hardware limitations of GPU (lack of synchronization primitives and limited memory caching mechanisms) can make GPU-based computation inefficient. Now Bio-technologies bring more chances to Bioinformatics and Biological Engineering. Our paper introduces a way to solve the longest overlap region of non-coding DNA sequences on using the Compute Unified Device Architecture (CUDA) platform Intel(R) Core(TM) i3-3110m quad-core. Compared to standard CPU implementation, CUDA performance proves the method of the longest overlap region recognition of noncoding DNA is an efficient approach to high-performance bioinformatics applications. Studies show the fact that efficiency of GPU performance is more than 20 times speedup than that of CPU serial implementation. We believe our method gives a cost-efficient solution to the bioinformatics community for solving longest overlap region recognition problem and other related fields.

关键词： Graphics processing units Arrays DNA Instruction sets Indexes Bioinformatics programming

来源：评论

学校读者我要写书评

暂无评论

A multi-objectively-optimized graph-based segmentation method for breast ultrasound image

A multi-objectively-optimized graph-based segmentation metho...

引用

international conference on BioMedical Engineering and Informatics (BMEI)

作者： Qiangzhi Zhang Xia Zhao Qinghua Huang School of Electronic and Information Engineering South China University of Technology Guangzhou Guangdong PR China

ISBN: (纸本)9781479958399

Segmentation of medical image, as the most essential and important step in the computer-aided diagnosis system, can greatly influence the system performance. Better segmentation to a great extent means better performance. Among many proposed segmentation algorithms, graph-based segmentation has become a hot one in the past few years because of the simple structure and rich theories. After the robust graph-based segmentation method (RGB) was introduced in 2010, a parameter-automatically-optimized robust graph-based segmentation method (PAORGB) was presented in 2013 as well, to optimize the two key parameters of RGB utilizing the particle swarm optimization algorithm (PSO). However, single-objectively-optimized PAORGB cannot well guarantee the global optimization. therefore, this paper continues the work of PAORGB and proposes a multi-objectively-optimized robust graph-based segmentation method (MOORGB) to further improve the performance of RGB. Experimental results have shown that MOORGB can get better segmentation results from breast ultrasound images compared to PAORGB.

关键词： Image segmentation Linear programming Breast tumors Ultrasonic imaging Robustness

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Workflows in Multi-cloud Marketplaces

Data-Driven Workflows in Multi-cloud Marketplaces

引用

IEEE international conference on Cloud Computing, CLOUD

作者： Javier Diaz Montes Mengsong Zou Rahul Singh Shu Tao Manish Parashar Rutgers The State University of New Jersey New Brunswick NJ US Rutgers Discovery Informatics Institute Rutgers University USA BM T. J. Watson Research Center USA

Cloud computing is emerging as a viable platform for scientific exploration. the ideas of on-demand access to resources, "unlimited" resources as well as interesting pricing models are making scientist to move their workflows into cloud computing. However, the amount of services and different pricing models offered by the providers often overwhelm users when deciding which option is best for them. Moreover, interoperability across providers remains an open topic that forces users to develop specific solutions for each provider. In this paper, we present a service framework that enables the autonomic execution of dynamic workflows in multi-cloud environments. It also allows users to customize scheduling policies to use those resources that best fit their needs. To demonstrate the benefits of this framework, we study the execution of a real scientific workflow, with data dependencies across stages, in a multi-cloud federation using different policies and objective functions.

关键词： Cloud computing Computational modeling Scheduling Pricing Linear programming Schedules Optimization

来源：评论

学校读者我要写书评

暂无评论

Harmonic elimination in cascade multilevel inverters using Firefly algorithm

Harmonic elimination in cascade multilevel inverters using F...

引用

international conference on Circuit, Power and Computing Technologies (ICCPCT)

作者： N. Karthik R. Arul Department of Electrical & Electronics Engg. Hindustan University Chennai Tamilnadu India Department of Electrical & Electronics Engg. ARM College of Engineering & Technology Maraimalainagar Tamilnadu India

In this paper a new method has been proposed to select optimal switching angles based on Firefly algorithm. the resultant equations for the computation of output voltage total harmonic distortion (thD) of a multilevel inverter are used as the objective function. this objective function is used to minimize the thD in the output voltage of a multilevel inverter. While minimizing the objective function, the selective harmonics such as the 5th, 7th, 11th and 13th can be controlled by using the Firefly algorithm. the simulations are performed for an 11 level cascaded multilevel inverter with equal and nonequal dc sources to show the validity of the proposed method. the results show that the proposed firefly algorithm can eliminate selective harmonics in the output voltage of a multilevel inverter.

关键词： Inverters Harmonic analysis Switches Linear programming Switching circuits Equations Modulation

来源：评论

学校读者我要写书评

暂无评论

Application of Secure Multi-party Computation in Linear programming

Application of Secure Multi-party Computation in Linear Prog...

引用

2014 IEEE 7th Joint international Information Technology and Artificial Intelligence conference

作者： Fu Zu-feng Wang Hai-ying Wu Yong-wu School of electronics and information engineering Anshun University

the existing solution to the privacy preserving linear programming, can leak the user’s private data when the data is much less. In this paper, the secure multiparty computation is generalized to the problem of privacy-preserving linear programming, and we present a computing protocol of privacy-preserving linear programming. the protocol is applied to consider the problem of linear programming with less and vertically distributed data, not only the maximum value of the original linear programming can be calculated in the case having optimal solution, but also the private data of all participants can be protected in the calculation.

关键词： secure multiparty computation privacy preserving linear programming cryptography

来源：评论

学校读者我要写书评

暂无评论

A feasibility study on programmer specific instruction set processors

A feasibility study on programmer specific instruction set p...

引用

international conference on Information and Automation for Sustainability (ICIAfS)

作者： T.M.R.L.B. Abeysinghe N. Hassan R.G. Ragel Department of Statistics and Computer Science University of Peradeniya Peradeniya Sri Lanka

ASIPs are designed in order to execute instructions of a particular domain of applications. the designing of ASIPs addresses the major challenges faced by a system on chip such as size, cost, performance and energy consumption. the higher the number of similar instructions within the domain to be mapped the lesser the energy consumption, the smaller the size and the higher the performance of the ASIP. thus, designing processors for domains with more similar programs would overcome these issues. this paper describes the investigation of whether the domains of programmer specific programs have any significance like application specific program domains and thus, whether the approach of designing processors known as Programmer Specific Instruction Set Processors is worthwhile. We performed the evaluation at the instruction level by using four different measures to obtain the similarity of programs: (1) by the existence of each instruction, (2) by the frequency of each instruction, (3) by two consecutive instruction patterns and (4) by three consecutive instruction patterns of application specific and programmer specific programs. We found that although programmer specific instructions show some impact on the similarity measures, they are much smaller and therefore insignificant compared to the impact from application specific programs.

关键词： Program processors Frequency measurement Assembly Vectors Energy consumption Buildings programming

来源：评论

学校读者我要写书评

暂无评论

Improved Heuristics with Data Rounding for Combinatorial Food Packing Problems

Improved Heuristics with Data Rounding for Combinatorial Foo...

引用

IEEE international conference on Service-Oriented Computing and Applications (SOCA)

作者： Yoshiyuki Karuno Kenju Tateishi Department of Mechanical and System Engineering Kyoto Institute of Technology Kyoto Japan Graduate School of Science and Technology Kyoto Institute of Technology Kyoto Japan

Given a set I = {i | i = 1, 2, . . . , n} of current n items (for example, n green peppers) with their weights w i and priorities r i , a lexicographic bi-criteria combinatorial food packing problem asks to find a subset I' (⊆ I) so that the total weight Σ i∈I' w i is no less than a specified target bound b for each package, and it is minimized as the primary objective, and further the total priority Σ i∈I' r i is maximized as the second objective. the problem has been known to be NP-hard, while it can be solved exactly in O(nb) time if all the input data are assumed to be integral. For a given real ε > 0, an O(n 2 /ε) time heuristic algorithm with a data rounding technique has been designed and the heuristic total weight has been shown to be at most (2+ε) times the optimal total weight. In this paper, a modification of the data rounding heuristic is proposed, and it is shown that the proposed modification delivers a heuristic solution such that the total weight is at most (1 + ε) times the optimum.

关键词： Heuristic algorithms Vectors Dynamic programming Time complexity Algorithm design and analysis Electronic mail Optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共361页 << < 163 164 165 166 167 168 169 170 171 172 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：