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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

672 篇 会议
290 篇 期刊文献
19 册 图书

馆藏范围

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

日期分布

学科分类号

595 篇 工学
- 427 篇 计算机科学与技术...
- 345 篇 软件工程
- 130 篇 信息与通信工程
- 85 篇 电气工程
- 71 篇 电子科学与技术（可...
- 66 篇 控制科学与工程
- 41 篇 光学工程
- 38 篇 生物工程
- 35 篇 机械工程
- 33 篇 生物医学工程（可授...
- 22 篇 仪器科学与技术
- 22 篇 动力工程及工程热...
- 21 篇 土木工程
- 20 篇 建筑学
- 19 篇 网络空间安全
- 17 篇 安全科学与工程
- 16 篇 交通运输工程
- 15 篇 环境科学与工程（可...
218 篇 理学
- 109 篇 数学
- 50 篇 物理学
- 48 篇 生物学
- 28 篇 统计学（可授理学、...
- 23 篇 系统科学
152 篇 管理学
- 94 篇 管理科学与工程(可...
- 64 篇 图书情报与档案管...
- 48 篇 工商管理
39 篇 医学
- 36 篇 临床医学
- 29 篇 基础医学(可授医学...
- 16 篇 药学(可授医学、理...
24 篇 法学
15 篇 经济学
- 15 篇 应用经济学
5 篇 教育学
5 篇 农学
3 篇 军事学
2 篇 文学
1 篇 哲学

主题

49 篇 software enginee...
34 篇 computer science
30 篇 software
21 篇 computer archite...
20 篇 semantics
20 篇 protocols
19 篇 context
18 篇 computational mo...
18 篇 unified modeling...
17 篇 application soft...
17 篇 monitoring
16 篇 runtime
16 篇 data mining
16 篇 wireless sensor ...
16 篇 software testing
16 篇 artificial intel...
16 篇 testing
15 篇 java
14 篇 software systems
14 篇 wireless communi...

机构

17 篇 software systems...
15 篇 school of comput...
15 篇 alibaba group
9 篇 college of compu...
9 篇 shandong provinc...
9 篇 school of comput...
8 篇 school of softwa...
8 篇 school of comput...
8 篇 key laboratory o...
7 篇 software enginee...
7 篇 peking universit...
6 篇 kingdee research...
6 篇 faculty of elect...
6 篇 shandong branch ...
6 篇 state key labora...
6 篇 department of co...
6 篇 service oriented...
5 篇 institute of com...
5 篇 automated softwa...
5 篇 national enginee...

作者

12 篇 sheldon s. willi...
12 篇 padma iyenghar
11 篇 elke pulvermuell...
10 篇 vahid garousi
10 篇 ghasem mirjalily
9 篇 zündorf albert
9 篇 andrade rossana ...
9 篇 liming zhu
9 篇 zhang haijun
9 篇 clemens westerka...
8 篇 lu qinghua
8 篇 juergen wuebbelm...
8 篇 zhang liang-jie
7 篇 xu xiwei
7 篇 zhu liming
7 篇 qinghua lu
6 篇 len bass
6 篇 ladan tahvildari
6 篇 kaklamani dimitr...
6 篇 jamshidi p.

语言

930 篇 英文
39 篇 其他
13 篇 中文
1 篇 德文

检索条件"机构=Research Group on Computer Networks and Software Engineering"

共 981 条记录，以下是691-700 订阅

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

详细简洁

排序：

BiO4SeL: A Bio-Inspired routing algorithm for Sensor Network Lifetime Optimization

BiO4SeL: A Bio-Inspired routing algorithm for Sensor Network...

引用

International Conference on Telecommunications (ICT)

作者： Levi Bayde Ribeiro Miguel Franklin de Castro Group of Computer Networks Software Engineering and Systems (GREat) Computer Science Department Federal University of Ceara Brazil

Sensors are emerging devices on a world leading to ubiquity and pervasiveness. For the sake of users' convenience, the organization of these sensors in operational networks must be done in an autonomic and self-sustained way. This paper proposes BiO4SeL (Bio-Inspired Optimization for Sensor Network Lifetime), a biologically-inspired routing algorithm for sensor networks where the main goal is autonomy, while aiming to optimize the sensor networks' lifetime, i.e., the maximization of the full coverage duration. BiO4SeL is based on Swarm Intelligence, more specifically on Ant Colonies. Results show that BiO4SeL achieves its objectives when compared with similar approaches: ARAMA (Ant-based Routing Algorithm for Manets) and AODV (Ad-hoc On-demand Distance Vector).

关键词： Routing Biosensors Intelligent sensors Particle swarm optimization Batteries Ant colony optimization Pervasive computing Temperature sensors Monitoring software algorithms

来源：评论

学校读者我要写书评

暂无评论

Hybrid neural system for gas turbine diagnostics: An optimization strategy

引用

ASME Turbo Expo 2010: Power for Land, Sea, and Air, GT 2010

作者： Matuck, Gustavo Ravanhani Barbosa, João Roberto Bringhenti, Cleverson Lima, Isaias Instituto Tecnológico de AeronáUtica ITA Gas Turbine Group 12228-900 - São José dos Campos - SP Brazil Universidade Federal de Itajubá UNIFEI Computer Networks and Software Engineering Group 37500-903 - Itajubá - MG Brazil

ISBN: (纸本)9780791843987

New health monitoring strategies were developed in the last decade aiming at improvement of gas turbines safety and reliability. Real time methodologies have been considered of major concern for safe operation at least cost. This paper describes a hybrid system approach for turboshaft faults diagnosis, using data obtained from a tuned high fidelity gas turbine simulator program, including those for multiple faults deteriorated performance. Kohonen neural network was used to analyze similarity together with an optimization strategy to reduce the volume of data used in the diagnostics phase. A Multi-Layer Perceptron (MLP) was used for training and validation. The MLP and Kohonen networks were tested for several configurations, in order to improve diagnosis. The hybrid system was also tested with noise-contaminated data and it was verified the capability of the neural approach to detect and isolate multiple faults better than the MLP alone. The results showed that the optimization strategy reduced significantly the database patterns and improved the learning process, demonstrating high precision to diagnose gas turbine operation problems. The reliability of the proposed system is explained both qualitatively and quantitatively. Copyright © 2010 by ASME.

关键词： Gas turbines

来源：评论

学校读者我要写书评

暂无评论

A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms

A new taxonomy of sublinear right-to-left scanning keyword p...

引用

作者： Cleophas, Loek Watson, Bruce W. Zwaan, Gerard FASTAR Research Group Department of Computer Science University of Pretoria Pretoria 0002 South Africa Software Engineering and Technology Group Department of Mathematics and Computer Science Eindhoven University of Technology P.O. Box 513 NL-5600 MB Eindhoven Netherlands

A new taxonomy of sublinear (multiple) keyword pattern matching algorithms is presented. Based on an earlier taxonomy by the second and third authors, this new taxonomy includes not only suffix-based algorithms, but also factor- and factor-oracle-based algorithms. In particular, we show how suffix-based (Commentz-Walter like), factor- and factor-oracle-based sublinear keyword pattern matching algorithms can be seen as instantiations of a general sublinear algorithm skeleton. During processing, such algorithms shift or jump through the text in a forward or left-to-right direction, and read backward or right-to-left starting from positions in the text, i.e. they read suffixes of certain prefixes of the text. They use finite automata for efficient computation of string membership in a certain language. In addition, we show shift functions defined for the suffix-based algorithms to be reusable for factor- and factor-oracle-based algorithms. The taxonomy is based on deriving the algorithms from a common starting point by adding algorithm and problem details, to arrive at efficient or well-known algorithms. Such a presentation provides correctness arguments for the algorithms as well as clarity on how the algorithms are related to one another. In addition, it is helpful in the construction of a toolkit of the algorithms. © 2010 Elsevier B.V.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

On instance-model querying and meta-model transformation

On instance-model querying and meta-model transformation

引用

作者： Nguyen, Viet Cuong Qafmolla, Xhevi Department of Computer Science and Engineering Software Engineering Research Group Czech Technical University in Prague Karlovo náměstí 13 121 35 Prague 2 Czech Republic

ISBN: (纸本)9789881701282

In today's market environment, change is an integral part of all projects. As such, its proper management is a crucial task when it comes to reducing both time and cost of development. The classical modeling approach can improve the situation up to a proper extent but it is not enough, because the process is usually variable and complex. Therefore it is necessary to introduce different level of abstractions for modeling. Each of these levels should serve at a certain phase for a certain purpose in the process. In the early stages several elements are grouped together and aggregated at the higher level, in an abstract model. Throughout time, granularity becomes smaller while understanding of the concepts becomes clearer and clearer and we need to see already working prototypes. In this situation, the approaches on instance- and meta-modeling techniques promise to bring productivity and efficiency to the process. This paper outlines practices from both approaches. We introduce the approach of using Object Constraint Language (OCL) with a Domain Specific Language (DSL) for instance-level model querying, illustrating this method with some examples. We analyze OCL from the broad perspective discussing its advantages and pointing out some its limitations. Moving to a higher level of abstraction, we also present the usage of Kermeta - an extension to the meta-data language with an action language for specifying semantics and behavior of meta-models. We show how Kermeta provides the possibility of automated meta-model transformations.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Chamaeleon — Exploiting multiple channels to mitigate interference

Chamaeleon — Exploiting multiple channels to mitigate inter...

引用

International Conference on Networked Sensing Systems (INSS)

作者： Venkatraman Iyer Matthias Woehrle Koen Langendoen Embedded Software group Delft University of Technnology Netherlands Computer Engineering and Networks Laboratory ETH Zurich Switzerland

Due to their embedding into an unknown environment, wireless sensor networks are susceptible to adverse environmental conditions. A prime example is external interference, typically caused by 802.11, electric devices or co-located sensor networks, which can drastically influence communication. However, radios on sensor nodes provide multiple channels, which can help to alleviate interference problems on a particular channel. In this work, we introduce Chamaeleon, a novel lean, cross-layer protocol extension that helps to overcome external interference problems. Chamaeleon switches an affected set of nodes to a new channel based on key network parameters e.g., packet loss and channel backoffs. Initial simulation-based experiments show that Chamaeleon effectively handles the jamming of isolated channels.

关键词： Pediatrics Interference Switches Wireless sensor networks Media Access Protocol Routing

来源：评论

学校读者我要写书评

暂无评论

Complexity Reduction of the Best Multiple Spanning Tree Algorithm

Complexity Reduction of the Best Multiple Spanning Tree Algo...

引用

2010 2nd International Conference on Education Technology and computer(第二届IEEE教育技术与计算机国际会议 ICETC 2010)

作者： F.Akhavan Sigari Ghasem Mirjalily Reza Saadat Faculty of Electrical and Computer Engineering Computer and Communication Networks Research Group (CCNRG) Yazd UniversityYazd Iran

Spanning Tree Protocol (STP) is an IEEE approved standard that provides path redundancy while preventing undesirable loops in the Ethernet *** uses a single tree for the entire network which may result in inefficient bandwidth allocation since the non-spanning-tree links will not carry traffic at *** a solution,the IEEE 802.1s working group has introduced a Multiple Spanning Tree Protocol (MSTP) that allows a switch to participate in multiple spanning trees,one tree per group of *** our previous work,we introduced a graph theoretic approach named Best Multiple Spanning Tree (BMST) algorithm for ranking all of the possible solutions for selection of the proper trees in a network running MSTP and for finding the best solution based on load balancing on links and ***,BMST algorithm can find the best answer for small networks,but its complexity is too large in large scale *** this paper,we propose a simple approach named Multiple Best Spanning Tree (MBST) to reduce the computational complexity of the BMST.

关键词： Ethernet Network Multiple Spanning Tree Load Balancing

来源：评论

学校读者我要写书评

暂无评论

Efficient identification of synchronous machine parameters through the finite elements method

Efficient identification of synchronous machine parameters t...

引用

7th Mediterranean Conference and Exhibition on Power Generation, Transmission, Distribution and Energy Conversion, MedPower 2010

作者： Singh, Bharat Kyriakides, Elias Michaelides, Alex M. Department of Electrical and Computer Engineering KIOS Research Center for Intelligent Systems and Networks University of Cyprus Nicosia-1678 Cyprus ElectroMagnetic Valley Ltd. Cyprus and Cobham Technical Services/Vector Fields Software United Kingdom

ISBN: (纸本)9781849193191

This work proposes a methodology to identify the parameters of a synchronous machine based on the finite element method (FEM). Several offline real-time tests to identify SM parameters are reproduced on a digital platform of a FEM based solver. The proposed methodology is divided into three basic steps: creation of the basic physical geometry of the synchronous machine, development and execution of parameter estimation tests on the digital platform, and post-processing to calculate the parameters from the test results. Simulations are shown for a salient-pole synchronous machine. The proposed method is envisioned to replace the real-time offline tests.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Analysis and simulation of a router-assisted congestion control mechanism

Analysis and simulation of a router-assisted congestion cont...

引用

作者： Almeida, Antonio Department of Electrical and Computer Engineering Instituto Superior T'ecnico Portugal Networks and Multimedia research group Instituto de Telecomunicações Torre Norte 10.10 Av. Rovisco Pais Lisbon Portugal

We present a congestion control algorithm for the Internet and assess its stability. The algorithm has low operation complexity and exercises control over sources without keeping per-flow information. Given the lack of support for explicit-rate feedback in the Internet, we discuss an implementation where feedback is based on explicit binary indications. We assess the stability through a discrete-time model and present simulation results showing the efficacy of the algorithm. The obtained results indicate that when the algorithm is used to control sources that support explicit binary feedback, its stability is not affected and its performance is close to that obtained with sources that support explicit-rate feedback. Copyright © 2010 The Institute of Electronics, Information and Communication Engineers.

关键词： Stability

来源：评论

学校读者我要写书评

暂无评论

Alerts analysis and visualization in network-based intrusion detection systems

Alerts analysis and visualization in network-based intrusion...

引用

IEEE International Conference on Social Computing

作者： Yang, Li Gasior, Wade Katipally, Rajeshwar Cui, Xiaohui Department of Computer Science and Engineering Univeristy of Tennessee at Chattanooga Chattanooga TN 37403 United States Applied Software Engineering Research Group Computational Sciences and Engineering Division Oak Ridge National Laboratory Oak Ridge TN 37831 United States

ISBN: (纸本)9780769542119

The alerts produced by network-based intrusion detection systems, e.g. Snort, can be difficult for network administrators to efficiently review and respond to due to the enormous number of alerts generated in a short time frame. This work describes how the visualization of raw IDS alert data assists network administrators in understanding the current state of a network and quickens the process of reviewing and responding to intrusion attempts. The project presented in this work consists of three primary components. The first component provides a visual mapping of the network topology that allows the end-user to easily browse clustered alerts. The second component is based on the flocking behavior of birds such that birds tend to follow other birds with similar behaviors. This component allows the enduser to see the clustering process and provides an efficient means for reviewing alert data. The third component discovers and visualizes patterns of multistage attacks by profiling the attacker's behaviors. © 2010 IEEE.

关键词： Birds

来源：评论

学校读者我要写书评

暂无评论

Dynamic Balanced Spanning Tree (DBST) for data aggregation in Wireless Sensor networks

Dynamic Balanced Spanning Tree (DBST) for data aggregation i...

引用

International Symposium on Telecommunications, IST

作者： Avid Avokh Ghasem Mirjalily Faculty of Electrical and Computer Engineering Computer and Communication Networks Research Group CCNRG Yazd University Yazd Iran

Data gathering is one of the most popular energy-efficient routing protocols in Wireless Sensor networks (WSNs). In this research, we introduce a Dynamic Balanced Spanning Tree (DBST) for data aggregation in WSNs which considers several criteria to balance the energy consumption between sensor nodes. A cost function is presented which can follow the conditions of network. It considers various factors such as distance, residual energy, and node weight and also controls the trade-off between these factors. DBST not only minimizes the maximum energy consumption among the sensor nodes, but also can balance the traffic load in the network by dynamic design of the routing tree. DBST is equipped with a root selection mechanism which only needs localized information and considers both distance and residual energy criteria. In this way, the role of the root is distributed among the nods fairly. Furthermore, it guarantees that critical nodes are not selected as root node. DBST also uses a discrete first order radio model which is adaptable to the limitation of Sensor hardware platforms. Our extensive experiments demonstrate efficiency of the proposed DBST in balancing the traffic loads in the network.

关键词： Wireless sensor networks Energy consumption Heuristic algorithms Routing Relays Clustering algorithms Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共99页 << < 66 67 68 69 70 71 72 73 74 75 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：