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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

343 篇 会议
202 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

382 篇 工学
- 236 篇 计算机科学与技术...
- 172 篇 软件工程
- 80 篇 信息与通信工程
- 75 篇 控制科学与工程
- 42 篇 电子科学与技术（可...
- 37 篇 电气工程
- 34 篇 机械工程
- 31 篇 交通运输工程
- 28 篇 生物工程
- 16 篇 安全科学与工程
- 15 篇 仪器科学与技术
- 15 篇 化学工程与技术
- 14 篇 光学工程
- 14 篇 生物医学工程（可授...
- 12 篇 网络空间安全
- 10 篇 动力工程及工程热...
- 8 篇 材料科学与工程（可...
178 篇 理学
- 122 篇 数学
- 38 篇 系统科学
- 31 篇 生物学
- 26 篇 统计学（可授理学、...
- 23 篇 物理学
- 12 篇 化学
108 篇 管理学
- 66 篇 管理科学与工程(可...
- 50 篇 图书情报与档案管...
- 26 篇 工商管理
21 篇 法学
- 19 篇 社会学
10 篇 医学
- 8 篇 基础医学(可授医学...
- 8 篇 临床医学
7 篇 经济学
- 7 篇 应用经济学
3 篇 农学
2 篇 文学

主题

24 篇 petri nets
20 篇 feature extracti...
14 篇 web services
14 篇 training
10 篇 roads
10 篇 data mining
9 篇 support vector m...
9 篇 optimization
9 篇 graph neural net...
9 篇 algorithm design...
9 篇 synchronization
9 篇 mathematical mod...
8 篇 conferences
8 篇 throughput
8 篇 laboratories
8 篇 schedules
8 篇 wireless sensor ...
8 篇 computational mo...
8 篇 rough set theory
7 篇 semantics

机构

121 篇 key laboratory o...
73 篇 department of co...
71 篇 the key laborato...
55 篇 key laboratory o...
32 篇 key laboratory o...
18 篇 department of el...
14 篇 department of co...
14 篇 department of co...
14 篇 shanghai artific...
13 篇 the key laborato...
13 篇 department of el...
11 篇 key laboratory o...
11 篇 school of softwa...
10 篇 the key laborato...
10 篇 ieee
9 篇 key laboratory o...
9 篇 school of electr...
9 篇 moe key laborato...
8 篇 institute of int...
8 篇 college of infor...

作者

35 篇 changjun jiang
34 篇 zhou mengchu
31 篇 jiang changjun
23 篇 mengchu zhou
21 篇 cheng wang
20 篇 zhao junqiao
18 篇 ye chen
17 篇 ding zhijun
16 篇 wang hanli
15 篇 yan chungang
15 篇 wang cheng
15 篇 miao duoqian
15 篇 chungang yan
13 篇 liu xiwei
13 篇 fuqiang liu
12 篇 xiwei liu
12 篇 xiang-yang li
11 篇 zhijun ding
11 篇 liu guanjun
10 篇 yaying zhang

语言

514 篇 英文
23 篇 中文
12 篇 其他

检索条件"机构=Key Laboratory of the MoE for Embedded System and Service Computing"

共 546 条记录，以下是491-500 订阅

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

详细简洁

排序：

KNOB particle swarm optimizer 1

引用

1st International Conference on Advances in Swarm Intelligence, ICSI 2010

作者： Zhang, Junqi Liu, Kun Tan, Ying Key Laboratory of Embedded System and Service Computing Department of Computer Science and Technology Tongji University Shanghai 200092 China Department of Machine Intelligence School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

ISBN: (数字)9783642134951

ISBN: (纸本)3642134947

It is not trivial to tune the swarm behavior just by parameter setting because of the randomness, complexity and dynamic involved in particle swarm optimizer (PSO). Hundreds of variants in the literature of last decade, brought various mechanism or ideas, sometimes also from outside of the traditional metaheuristics field, to tune the swarm behavior. While, in the same time, additional parameters have to be afforded. This paper proposes a new mechanism, named KNOB, to directly tune the swarm behavior through parameter setting of PSO. KNOB is defined as the first principal component of the statistical probability sequence of exploration and exploitation allocation along the search process. The using of the KNOB to tune PSO by parameter setting is realized through a statistical mapping, between the parameter set and the KNOB, learned by a radial basis function neural network (RBFNN) simulation model. In this way, KNOB provides an easy way to tune PSO directly by its parameter setting. A simple application of KNOB to promote is presented to verify the mechanism of KNOB. © 2010 Springer-Verlag.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Study and implementation of agent-based grid resource monitoring model

Study and implementation of agent-based grid resource monito...

引用

2nd International Conference on Information Science and Engineering, ICISE2010

作者： Ming, Liu Zhang, Junqi Wang, Yu Li, Jie Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

ISBN: (纸本)9781424480968

Grid is a promising infrastructure which enables scientists and engineers to access geographically distributed resources. Grid computing is a new technology which focuses on aggregating various kinds of resource (e.g., processor cycles, disk storage, and contents) into one computing platform. The realization of grid computing requires a resource agent to manage and monitor available resources. Based on study of past models, this paper presents a new agent-based resource monitoring model whose main feature is multi-layered monitoring architecture, which enhances the ability to monitor related resource efficiently. In the meantime, the new model has been implemented in the development of a resource monitoring module integrated within a academic grid project. © 2010 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Reliable Web services Selection Using a Heuristic Algorithm

Reliable Web Services Selection Using a Heuristic Algorithm

引用

The Ninth International Conference on Grid and Cloud computing(第九届网格与云计算国际学术会议 GCC 2010)

作者： Hongjie Shen Zhijun Ding Hongzhong Chen The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

Web services composition (WSC) is the key techniques in its application. Dynamically selecting reliable Web services (WSs) becomes crucial to users. In fact, most works regard a Web service (WS) as the basic unit and selection with end-to-end, and as more and more WSs become available, the WSs selection problem is a complex NP-hard optimization problem. So, in this paper, the WSs consist of the operations and the WSs selection problem is formalized as a finite state machine process and we proposed a backward algorithm to create the WSC tree (WSCT). Then, we proposed a heuristic algorithm to complete the selection of WSs based on the WSCT. The results of experiment show our proposed heuristic algorithm is effective.

关键词： Web services composition heuristic algorithm service selection reliability

来源：评论

学校读者我要写书评

暂无评论

Incremental Sensor Node Deployment for Low Cost and Highly Available WSNs

Incremental Sensor Node Deployment for Low Cost and Highly A...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Safwan Al-Omari Weisong Shi Jordan University of Science and Technology Jordan Key Laboratory of Embedded System and Service Computing University of Tongji China

We attack the sensor network deployment problem. We define the deployment problem as the problem of deciding how many sensor nodes should be deployed in the sensor field over how many phases during its lifetime. We target the optimal deployment strategy that meets user-defined availability requirement with minimum total cost taking into consideration node failures and changing field trip to sensor node cost ratio. We model WSN availability and total cost as functions of the deployment plan, then, we formalize the deployment problem as a 2D optimization problem. Our modeling enables us to explore cost-benefit tradeoffs, we believe, this is a solid step toward bringing cost as an explicit dimension in the design space of WSN protocols. We compare the performance of the optimized solution (denoted as pro-active) to more ad-hoc solutions: on-demand and at-front. The former strategy schedules future deployments only on demand. The latter strategy deploys all nodes at front with no later field trips. Using extensive simulations, we show that proactive outperforms at-front and on-demand in terms of total cost per availability unit in all application scenarios. For example, using pro-active costs $7 compared to $40 and $280 per total uptime in case of on-demand and at-front, respectively.

关键词： Availability Wireless sensor networks Equations Optimization Mathematical model Business Exponential distribution

来源：评论

学校读者我要写书评

暂无评论

Biped robot walking using central pattern generator and genetic algorithm

Biped robot walking using central pattern generator and gene...

引用

IASTED International Conference on Robotics, Robo 2010

作者： Liu, Chengju Chen, Qijun Wang, Danwei School of Electronics and Information Engineering Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China School of Electrical and Electronic Engineering Nanyang Technological University Singapore Singapore

ISBN: (纸本)9780889868595

Central pattern generator (CPG) plays an important role in rhythmic activities of animals and this mechanism is an important inspiration source for the motion control of legged robots. In this paper, by using CPGs and function mapping mechanism, a high-efficiency distributed CPG control network is constructed to realize the locomotion control of biped NAO robot. To realize stable and coordinated locomotion, the parameters of the CPG network are evolved by multi-object genetic algorithm (MOGA). Simulations with Webots validate the feasibility and efficiency of the presented CPG-based control method.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Quantized H2 Filtering for Markovian Jump Linear systems over Networks with Non-accessible Mode Information

Quantized H2 Filtering for Markovian Jump Linear Systems ove...

引用

The 8th World Congress on Intelligent Control and Automation(第八届智能控制与自动化世界大会 WCICA 2010)

作者： Tao Liu Qijun Chen Hao Zhang Department of Electronics and Information Engineering Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China

This paper is concerned with the problems of quantized *** for discrete-time Markovian jump linear systems over networks with non-accessible mode information. The quantizer considered here is logarithmic quantizer. In this paper, a linear time-invariant mode-independent quantized *** is designed such *** error system is stochastically stable. *** conditions for the existence of *** is given in terms of linear matrix inequalities. A numerical example is provided to demonstrate the effectiveness of the proposed approach.

关键词： Quantization Bismuth Linear matrix inequalities Symmetric matrices Linear systems Upper bound Networked control systems

来源：评论

学校读者我要写书评

暂无评论

Study and implementation of agent-based grid resource monitoring model

Study and implementation of agent-based grid resource monito...

引用

International Conference on Information Science and Engineering (ICISE)

作者： Liu Ming Junqi Zhang Yu Wang Jie Li Department of Computer Science and Technology The Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China

ISBN: (纸本)9781424476169

关键词： Monitoring Computational modeling Databases Grid computing Automation Resource management XML

来源：评论

学校读者我要写书评

暂无评论

Multicast capacity scaling for cognitive networks: General extended primary network

Multicast capacity scaling for cognitive networks: General e...

引用

2010 IEEE 7th International Conference on Mobile Adhoc and Sensor systems, MASS 2010

作者： Wang, Cheng Li, Xiang-Yang Tang, Shaojie Jiang, Changjun Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States

ISBN: (纸本)9781424474882

We study the capacity scaling laws for the cognitive network that consists of the primary hybrid network (PhN) and secondary ad hoc network (SaN). PhN is further comprised of an ad hoc network and a base station based (BS-based) network. SaN and PhN are overlapping in the same deployment region, operate on the same spectrum, but are independent with each other in terms of communication requirements. The primary users (PUs), i.e., the ad hoc nodes in PhN, have the priority to access the spectrum. The secondary users (SUs), i.e., the ad hoc nodes in SaN, are equipped with cognitive radios, and have the functionalities to sense the idle spectrum and obtain the necessary information of primary nodes in PhN. We assume that PhN adopts one out of three classical types of strategies, i.e., pure ad hoc strategy, BS-based strategy, and hybrid strategy. We aim to directly derive multicast capacity for SaN to unify the unicast and broadcast capacity under two basic principles: (1) The throughput for PhN cannot be undermined in order sense due to the presence of SaN. (2) The protocol adopted by PhN does not alter in the interest of SaN, anyway. Depending on which type of strategy is adopted in PhN, we design the optimal-throughput strategy for SaN. We show that there exists a threshold of the density of SUs according to the density of PUs beyond which it can be proven that: (1) when PhN adopts the pure ad hoc strategy or hybrid strategy, SaN can achieve the multicast capacity of the same order as it is stand-alone;(2) when PhN adopts the BS-based strategy, SaN can asymptotically achieve the multicast capacity of the same order as if PhN were absent, if some conditions of the relations among the number of SUs, PUs, the destinations of each multicast sessions in SaN, and the base stations in PhN hold. ©2010 IEEE.

关键词： Base stations

来源：评论

学校读者我要写书评

暂无评论

Constructing Prioritized Interaction Test Suite with Interaction Relationship

Constructing Prioritized Interaction Test Suite with Interac...

引用

International Workshop on Education Technology and Computer Science, ETCS

作者： Jianjun Yuan Zuowen Jiang The Key Laboratory of Embedded System and Service Department of Computer Science and Technology Computing Ministry of Education of China University of Tongji Shanghai China

ISBN: (纸本)9781424463886;9780769539874

Interaction testing has addressed some issues on how to select a small subset of test cases. In many systems where interaction testing is needed, the entire test suite is not executed because of time or budget constraints. It is important to prioritize the test cases in these situations. On the other hand, there are not always interactions among any factors in real systems. Moreover, some factors may need N-way (N>2) testing since there is a closer relationship among them. We present a model for prioritized interaction testing with interaction relationship and propose a greedy algorithm for generating variable strength covering arrays with bias.

关键词： system testing Software testing Computer science education Greedy algorithms Costs Educational technology Computer science Laboratories embedded system embedded computing

来源：评论

学校读者我要写书评

暂无评论

Detecting and resolving mismatches between pairs of services

Detecting and resolving mismatches between pairs of services

引用

International Conference on Computer Science and Information Technology (CSIT)

作者： Tao Liu Guosun Zeng Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China Tongji University Shanghai Shanghai CN

Facing changing environments and evolving business, service composition happens all time. However, services do not always interact properly because of mismatches between their interfaces. In this paper, we use labelled interface automata, an extension of interface automata, to illustrate mismatching interfaces and resolution approaches. We model service interfaces with labelled interface automata and propose a theorem for mismatch detecting. Then we characterize mismatches between pairs of interfaces by identifying and classifying them into six basic scenarios, and illustrate the resolution approach of mismatches. Our method formalizes the interface adaptation problem and provides convenience to detect mismatches and build adaptors for service interactions.

关键词： Automata Software

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共55页 << < 46 47 48 49 50 51 52 53 54 55 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：