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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,394 篇 会议
133 篇 期刊文献
76 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

309 篇 linear programmi...
251 篇 programming
187 篇 dynamic programm...
142 篇 computer program...
118 篇 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,496 篇 英文
79 篇 其他
26 篇 中文
5 篇 葡萄牙文
2 篇 俄文
1 篇 西班牙文

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

共 3603 条记录，以下是1631-1640 订阅

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

详细简洁

排序：

Binary linear programming-based release planning for multi-tenant business SaaS

Binary linear programming-based release planning for multi-t...

引用

2014 7th international C conference on Computer Science and Software Engineering, C3S2E 2014

作者： Alrashoud, Mubarak Ahmed, Lubaid Abhari, Abdolreza Department of Computer Science Ryerson University 350 Victoria Street Toronto ON M5B 2K3 Canada

ISBN: (纸本)9781450327121

In multi-tenant Software as a Service (SaaS) business software, the degree of tenants' satisfaction is a significant indicator of the success of the SaaS system. Tenants' satisfaction can be achieved by continuously fulfilling their evolving needs. Usually, SaaS providers frequently deliver new releases of the application. Each release contains new or enhanced features. However, SaaS providers have limited resources, which makes it difficult to them to incorporate all of the tenants' requests in the next release. therefore, some requirements shall be postponed to later releases. In order to achieve the highest possible level of tenets' satisfaction, SaaS providers shall include the most common requirements in the next release, which guarantee the satisfaction of highest possible number of tenants with less effort. Additionally, tenants' priorities and preferences about the requirements must be considered. Besides maximizing tenants' satisfaction, it is crucial to meet different types of constraints such as resource, technical, and contractual constraints. this paper identifies the factors that govern the release planning process for multi-tenant business software, which are contractual constraints, commonality of requirements, tenants' preferences and decision weights, risk, technical constraints. the first two factors are suggested by this paper, while the remaining factors are inherited from the traditional release planning process. Moreover, this paper proposes a framework that deals with the uniqueness of the release planning process in multi-tenant SaaS system. In this framework, Binary Linear programming (BLP) is employed to optimize the selection process of the requirements that will be implemented in the next release. An experiments section is provided to illustrate the degree of satisfaction that can be achieved using the proposed framework. © 2014 ACM.

关键词： Requirements engineering

来源：评论

学校读者我要写书评

暂无评论

Real-Time Implementation of an Artificial Stereo Audio Extension Method

Real-Time Implementation of an Artificial Stereo Audio Exten...

引用

international conference on Signal Processing, Image Processing and Pattern Recognition (SIP)

作者： Seok Hee Jeong Chan Jun Chun Nam In Park Hong Kook Kim School of Information and Communications Gwangju Institute of Science and Technology (GIST) Gwangju Korea Digital Technology and Biometry Division National Forensic Service (NFS) Wonju Korea Dept. of Electrical and Computer Engineering City University of New York NY USA

ISBN: (纸本)9781479977703

In this paper, we address the issue of the real-time implementation of an artificial stereo audio extension method that provides stereophonic audio from a mono audio source. First, the floating-point arithmetic programming of the method is performed. then, the computationally complex parts of the floating-point operations are converted into fixed-point operations to allow them to operate in real time. the performance of a real-time implementation is evaluated by measuring the processing time and root mean square (RMS) value. Consequently, it is shown that partial fixed-point arithmetic programming reduces the processing time by 48.7%, with an RMS value of-90.50 dB, compared to the floating-point arithmetic programming.

关键词： Real-time systems programming Floating-point arithmetic Fixed-point arithmetic Hidden Markov models Time measurement Speech

来源：评论

学校读者我要写书评

暂无评论

Enhancing the source code quality of customized systems with the aid of the CodeAnalyzer 14

Enhancing the source code quality of customized systems with...

引用

7th Euro American conference on Telematics and Information Systems, EATIS 2014

作者： Antildes, Wendell Sampaio, Marcolino Silva, Israel Antonio Pinto Neto, Alberto Costa Universidade Federal de Sergipe São Cristóvão Brazil

ISBN: (纸本)9781450324359

Software Systems usually demand product customization for each client, frequently involving the creation of new components and changes to existing ones, possibly causing maintenance and evolution problems. One of the major challenges is to keep source code quality of the customized code. this is specially diçult because the revision process of the customized code can not be automated by existent tools. these tools are known as static analyzers and are important to automate the inspection of source code. However, the main Java language static analyzers lack exibility, which makes the use of these tools impractical in some projects. Moreover, each o them has a different focus, which leads developers to use more than one. this paper presents a new tool (CodeAnalyzer) that integrates the main Java language analyzers, providing more exibility and solving some of those problems. It is briey compared with Sonar and SQE. © 2014 ACM.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Cartesian Ant programming with adaptive node replacements

Cartesian Ant Programming with adaptive node replacements

引用

IEEE international Workshop on Computational Intelligence & Applications (IWCIA)

作者： Akira Hara Jun-ichi Kushida Keita Fukuhara Tetsuyuki Takahama Graduate School of Information Sciences Hiroshima City University Asaminami-ku Hiroshima Japan Faculty of Information Sciences Hiroshima City University

Ant Colony Optimization (ACO) is a swarm-based search method. Multiple ant agents search various solutions and their searches focus on around good solutions by positive feedback mechanism based on pheromone communication. ACO is effective for combinatorial optimization problems. the attempt of applying ACO to automatic programming has been studied in recent years. As one of the attempts, we have previously proposed Cartesian Ant programming (CAP) as an ant-based automatic programming method. Cartesian Genetic programming (CGP) is well-known as an evolutionary optimization method for graph-structural programs. CAP combines graph representations in CGP with pheromone communication in ACO. the connections of program primitives, terminal and functional symbols, can be optimized by ants. CAP showed better performance than CGP. However, quantities of respective symbols are limited due to the fixed assignments of functional symbols to nodes. therefore, if the number of given nodes is not enough for representing program, the search performance becomes poor. In this paper, to solve the problem, we propose CAP with adaptive node replacements. this method finds unnecessary nodes which are not used for representing programs. then, new functional symbols, which seems to be useful for constructing good programs, are assigned to the nodes. By this method, given nodes can be utilized efficiently. In order to examine the effectiveness of our method, we apply it to a symbolic regression problem. CAP with adaptive node replacements showed better results than conventional methods, CGP and CAP.

关键词： Cities and towns Equations Automatic programming Linear programming Optimization Genetic programming

来源：评论

学校读者我要写书评

暂无评论

Transition-Sensitive Distances 7

Transition-Sensitive Distances

引用

7th international conference on Similarity Search and Applications (SISAP)

作者： Yoshida, Kaoru Sony Comp Sci Labs Inc Shinagawa Ku Tokyo 1410022 Japan

ISBN: (纸本)9783319119885;9783319119878

In information retrieval and classification, the relevance of the obtained result and the efficiency of the computational process are strongly influenced by the distance measure used for data comparison. Conventional distance measures, including Hamming distance (HD) and Levenshtein distance (LD), count merely the number of mismatches (or modifications). Given a query, samples mapped at the same distance have the same number of mismatches, but the distribution of the mismatches might be different, either disperse or blocked, so that other measures must be cascaded for further differentiation of the samples. Here we present a new type of distances, called transition-sensitive distances, which count, in addition to the number of mismatches, the cost of transitions between positionally adjacent match-mismatch pairs, as part of the distance. the cost of transitions that reflects the dispersion of mismatches can be integrated into conventional distance measures. We introduce transition-sensitive variants of LD and HD, referred to as TLD and thD. It is shown that while TLD and thD hold properties of the metric similarly as LD and HD, they function as more strict distance measures in similarity search applications than LD and HD, respectively.

关键词： Transition-sensitive Distance Transition-sensitive Levenshtein Distance Transition-sensitive Hamming Distance distance measure metric string matching pattern matching dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Constructive method for appropriate membership function integrating fuzzy entropy with smoothing function into interval estimation

Constructive method for appropriate membership function inte...

引用

international Symposium on Soft Computing and Intelligent Systems (SCIS)

作者： Takashi Hasuike Hideki Katagiri Hiroe Tsubaki Graduate School of Information Science and Technology Osaka University Japan Osaka Japan Graduate School of Engineering Hiroshima University Japan Hiroshima Japan Department of Data Science The Institute of Statistical Mathematics Japan Tokyo Japan

this paper develops a constructing approach of a membership function to integrate the fuzzy Shannon entropy with a smoothing function into intervals set by the heuristic method based on the human cognitive behavior and subjectivity under a given probability density function. It is important to set a membership function appropriately in decision making. therefore, the main parts of our proposed approach are to give membership values a decision maker confidently set, and to obtain the others by solving a nonlinear mathematical programming problem objectively. It is difficult to solve the problem efficiently using previous constructing approaches. In this paper, performing deterministic equivalent transformations to the initial problem using nonlinear programming, an efficient algorithm to obtain the optimal condition of each membership value is developed.

关键词： Nickel Entropy Smoothing methods Mathematical programming Estimation Probability density function Mathematical model

来源：评论

学校读者我要写书评

暂无评论

the Application of Mobile Cloud in Heterogeneous Data Storage in Web of things System

The Application of Mobile Cloud in Heterogeneous Data Storag...

引用

international conference on Intelligent Computation Technology and Automation, ICICTA

作者： Zhao Yan Beijing Polytechnic Beijing China

ISBN: (纸本)9781479966370

With the further development of Internet of things technology, due to the increasing data and poor expansibility of the traditional storage architecture, it will become increasingly complex and lead to high energy consumption. Different from the traditional storage system, the distributed cloud storage system can realize the storage of massive information, the management of files with large scale, and provide high query efficiency. this paper firstly presents the current problems lying in the heterogeneous data processing, then the cloud storage architecture and MapReduce programming model are introduced for the Classify MapReduce algorithm proposition. Finally, considering the processing methods of distributed computing and cloud computing models, advantages and disadvantages of MapReduce programming model, and the characteristics of heterogeneous data in IoT system, this paper proposes a parallel storage algorithm, Classify MapReduce, which is composed of three systemic functions: Classify function, Map function and Reduce function. Our experiment shows that it classifies the original heterogeneous data flow according to the data type to realize parallel processing, which greatly improves the storage and access efficiency.

关键词： Classification algorithms Cloud computing Distributed databases Servers programming Algorithm design and analysis Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Hemispheric lateralization of sentence intonation in left handed subjects with typical and atypical language lateralization: An fMRI study

Hemispheric lateralization of sentence intonation in left ha...

引用

7th international conference on Speech Prosody, SP 2014

作者： Varga, Eszter Schnell, Zsuzsanna Perlaki, Gábor Orsi, Gergely Aradi, Mihály Auer, Tibor John, Flóra Dóczi, Tamás Komoly, Sámuel Kovács, Norbert Schwarcz, Attila Tényi, Tamás Herold, Róbert Janszky, József Horváth, Réka Department of Neurology University of Pécs Pécs Hungary Pécs Diagnostic Centre Pécs Hungary MTA-PTE Clinical Neuroscience MR Research Group Pécs Hungary MRC Cognition and Brain Sciences Unit Cambridge United Kingdom Department of Psychiatry and Psychotherapy University of Pécs Pécs Hungary Department of Neurosurgery University of Pecs Pécs Hungary Department of Linguistics and Institute of Psychology University of Pécs Hungary

Prosody (as the melody of speech) is an important component of human social interactions. More specifically, linguistic prosody conveys meaning of speech through syllable, word, or sentence level stress and intonation. In the modern neuroimaging era the hemispheric representation of sentence intonation is widely investigated. Most of these studies suggest bilateral activations predominantly in the perisylvian language areas and in the subdominant homologues. However, there are some inconsistencies about the hemispheric representation and lateralization of linguistic prosody. these inconsistencies could be due to the lack of attention on the language lateralization of the subjects. the present study aims to investigate the hemispheric representation and lateralization of linguistic prosody with a sentence intonation task in two groups of left handed subjects with typical and atypical language lateralization. functional MRI was used to test the assumption that - according to the functional lateralization hypothesis - the representation of sentence intonation is predominantly lateralized within the language dominant hemisphere and the lateralization of sentence intonation is associated with language lateralization in both groups. Left handers were examined to create two groups of subjects with typical and atypical language lateralization. In all, 32 healthy subjects were evaluated with a standard verbal fluency task with fMRI in order to assess functional hemispheric language lateralization. In our final investigation the atypical group consisted of 8 subjects with right hemispheric language dominance (LI0.2). Sentence intonation task was utilized to test linguistic prosody skills with fMRI. 49 pairs of sentences (18 pairs of neutral-neutral sentences, 10 pairs of interrogativeinterrogative sentences, and 1 pair of interrogative-neutral sentence) were presented with an event-related design. Sentences were matched in terms of syntactic structure, semantic complexity and

关键词： Chemical activation

来源：评论

学校读者我要写书评

暂无评论

A Preliminary Analysis on BLMAB-Based Approximate Optimization Support for Multi Agent Simulations on Multi-core and GPU-Based Computing Environment

A Preliminary Analysis on BLMAB-Based Approximate Optimizati...

引用

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

作者： Yoshihito Sano Yoshiaki Kadono Naoki Fukuta Graduate School of Informatics Shizuoka University Shizuoka Japan

there are strong demands to utilize multi-core computing resources effectively for large-scale and highly detailed multi-agent simulations. We have proposed a framework to assist parameter tuning process of multi-core programming for simulation developers to utilize many parallel cores in their simulation programs efficiently. However, due to its massive computation costs, it is not easy task to seek the sufficient compilation and execution parameters and analyze their performance characteristics for various execution settings. In this paper, we present a preliminary analysis of parameter optimization based on BLMAB by utilizing our framework. We show how our BLMAB-based approach can effectively be used on the parameter optimization process.

关键词： Optimization Computational modeling Tuning Graphics processing units Runtime programming Multicore processing

来源：评论

学校读者我要写书评

暂无评论

QoS-Aware Service Composition in Mobile Environments

QoS-Aware Service Composition in Mobile Environments

引用

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

作者： Nguyen Cao Hong Ngoc Donghui Lin Takao Nakaguchi Toru Ishida Department of Social Informatics Kyoto University Sakyo-Ku Kyoto Japan

Service composition involves combining many existing services to solve a complex task in the service-oriented environment. Due to the progress in modern smart devices, mobile devices can now act as service providers. the mobility of mobile service providers and the dynamism of the mobile environment are unique features. As a result, there are two issues with service composition in mobile environments: (1) how to use the mobility of devices as an non-functional Quality of Service (QoS) criterion, and (2) how to deal with the dynamism of the mobile environment to realize the optimal service composition. In order to deal with above issues, we proposed a QoS-aware service composition model for service composition in mobile environments considering the feature of mobility in the mobile environment. Moreover, we proposed an adaptive approach called k-neighbor. the main idea of k-neighbor approach is to decompose the composite service into smaller elementary composite services then to set up a solution plan for those elementary composite services based on the available provider set. the evaluation shows that the way of decomposing a composite service adapts to different dynamism of the environment.

关键词： Mobile communication Quality of service Availability Mobile handsets Adaptation models Linear programming Sensors

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共361页 << < 160 161 162 163 164 165 166 167 168 169 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：