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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

115 篇 期刊文献
113 篇 会议

馆藏范围

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

日期分布

学科分类号

197 篇 工学
- 142 篇 计算机科学与技术...
- 67 篇 电气工程
- 21 篇 信息与通信工程
- 14 篇 控制科学与工程
- 14 篇 软件工程
- 9 篇 电子科学与技术（可...
- 5 篇 机械工程
- 5 篇 仪器科学与技术
- 4 篇 生物工程
- 2 篇 力学（可授工学、理...
- 2 篇 动力工程及工程热...
- 2 篇 化学工程与技术
- 2 篇 石油与天然气工程
- 1 篇 材料科学与工程（可...
- 1 篇 测绘科学与技术
- 1 篇 矿业工程
- 1 篇 轻工技术与工程
- 1 篇 交通运输工程
82 篇 理学
- 57 篇 数学
- 20 篇 物理学
- 5 篇 系统科学
- 4 篇 生物学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
- 1 篇 地球物理学
- 1 篇 地质学
13 篇 管理学
- 13 篇 管理科学与工程(可...
3 篇 农学
- 2 篇 作物学
1 篇 经济学
- 1 篇 理论经济学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学

主题

228 篇 deterministic al...
20 篇 randomized algor...
19 篇 algorithms
15 篇 distributed algo...
8 篇 stochastic proce...
7 篇 lower bound
7 篇 optimisation
7 篇 deterministic
6 篇 runtime
6 篇 computational co...
6 篇 deterministic al...
5 篇 network topology
5 篇 optimization
5 篇 computational mo...
5 篇 stochastic algor...
5 篇 probability
5 篇 stochastic analy...
5 篇 approximate comp...
4 篇 parallel algorit...
4 篇 graph algorithms

机构

3 篇 indian inst tech...
3 篇 univ liverpool d...
3 篇 nanyang technol ...
2 篇 it univ copenhag...
2 篇 tel aviv univers...
2 篇 dhirubhai ambani...
2 篇 university of li...
2 篇 univ granada dep...
2 篇 univ hong kong d...
2 篇 microsoft res re...
2 篇 univ wroclaw wro...
2 篇 cheriton school ...
2 篇 univ politecn va...
2 篇 indian inst tech...
2 篇 computer science...
2 篇 univ granada dep...
2 篇 mit 77 massachus...
2 篇 univ chinese aca...
2 篇 univ salerno dip...
2 篇 indian inst tech...

作者

9 篇 kowalski dariusz...
5 篇 cano andres
5 篇 gomez-olmedo man...
4 篇 moral serafin
4 篇 de marco gianluc...
3 篇 gorain barun
3 篇 jurdzinski tomas...
3 篇 moses william k....
3 篇 ruzic milan
2 篇 moran feldman
2 篇 aaron bernstein
2 篇 pandit supantha
2 篇 lopez pedro
2 篇 bhattacharya adr...
2 篇 mondal kaushik
2 篇 buchbinder niv
2 篇 dimov ivan t.
2 篇 garg mohit
2 篇 gomez crispin
2 篇 feldman moran

语言

216 篇 英文
11 篇 其他
1 篇 荷兰文

检索条件"主题词=deterministic algorithms"

共 228 条记录，以下是161-170 订阅

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

详细简洁

排序：

Binary Probability Trees for Bayesian Networks Inference

引用

10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

作者： Cano, Andres Gomez-Olmedo, Manuel Moral, Serafin Univ Granada Dept Comp Sci & Artificial Intelligence E-18071 Granada Spain

ISBN: (纸本)9783642029059

The present paper introduces a new kind of representation for the potentials in a Bayesian network: Binary Probability Trees. They allow to represent finer grain context-specific independences than those which can be encoded with probability trees. This enhanced capability leads to more efficient inference algorithms in some types of Bayesian networks. The paper explains how to build a binary tree from a given potential with a similar procedure to the one employed for probability trees. It also offers a way of pruning a binary tree if exact inference cannot be performed with exact trees, and provides detailed algorithms for performing directly with binary trees the basic operations on potentials (restriction, combination and marginalization). Finally, some experiments are shown that use binary trees with the variable elimination algorithm to compare the performance with standard probability trees.

关键词： Bayesian networks inference approximate computation variable elimination algorithm deterministic algorithms probability trees

来源：评论

学校读者我要写书评

暂无评论

Learning of Fuzzy Cognitive Maps for modelling Gene Regulatory Networks through Big Bang-Big Crunch Algorithm

Learning of Fuzzy Cognitive Maps for modelling Gene Regulato...

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： Acampora, Giovanni Vitiello, Autilia Nottingham Trent Univ Sch Sci & Technol Nottingham NG11 8NS England Univ Salerno Dept Comp Sci I-84084 Salerno Italy

ISBN: (纸本)9781467374286

Inferring Gene Regulatory Networks (GRNs) from expression data is one of the most challenging topic in computational biology. Indeed, the reasoning about GRN behaviours is a crucial biological task useful to provide an significant support for the identification of genetic diseases and the estimation of the effects of medications. Over years, several approaches have been applied to infer GRNs, most of them are based on deterministic and crisp-based algorithms. However, the intrinsic imprecise nature of the gene regulation makes these approaches as inefficient and characterized by a low accuracy. Starting from this consideration, in this work, we propose to use Fuzzy Cognitive Maps to model the complex behaviour of GRNs and to learn FCMs models of GRNs by means of an innovative evolutionary algorithm: the Big Bang-Big Crunch algorithm. As shown through a statistical comparison, the proposed approach outperforms other evolutionary learning methods in inferring GRNs representing, as a consequence, a breakthrough approach in this fascinating and challenging domain.

关键词： biology computing diseases evolutionary computation fuzzy set theory genetics learning (artificial intelligence) statistical analysis GRN big bang-big crunch algorithm computational biology crisp-based algorithms deterministic algorithms evolutionary learning methods fuzzy cognitive maps learning gene regulation gene regulatory networks genetic diseases statistical comparison Computational modeling Fuzzy cognitive maps Gene expression Proteins Sociology Time series analysis

来源：评论

学校读者我要写书评

暂无评论

Hybrid hierarchical optical cross-connect node and network applications

Hybrid hierarchical optical cross-connect node and network a...

引用

Asia-Pacific Optical and Wireless Communications Conference (APOC 2003)

作者： Wang, T Izmailov, R Kukita, S Emura, K NEC Labs Amer Princeton NJ 08540 USA

ISBN: (纸本)0819451762

Hybrid hierarchical optical cross-connects enhance the performance/cost ratio of optical networks by providing transparent (optical) switching of sets of wavelengths (wavebands) in addition to opaque (electrical) switching of individual wavelengths. As the network bandwidth is getting cheaper, and performance bottleneck is moving to switching nodes, these systems provide an attractive scalable solution for next generation optical networks. We describe key technological components (including flexible non-uniform wavebands) of hybrid hierarchical optical cross-connects and discuss their performance/cost implications.

关键词： optical cross connects optical switching node waveband switching wavelength demultiplexing wavelength multiplexing tunable optical filters de-aggregator aggregator control plane GMPLS routing optimization methods deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

MODELING AND ANALYSIS OF STEPPING STONE ATTACKS

MODELING AND ANALYSIS OF STEPPING STONE ATTACKS

引用

Winter Simulation Conference

作者： Nicol, David M. Mallapura, Vikas Univ Illinois Dept Elect & Comp Engn 619 South Wright St Urbana IL 61801 USA Univ Illinois Dept Comp Sci Urbana IL 61801 USA

ISBN: (纸本)9781479974863

Computer exploits often involve an attacker being able to compromise a sequence of hosts, creating a chain of "stepping stones" from his source to ultimate target. Stepping stones are usually necessary to access well-protected resources, and also serve to mask the attacker's location. This paper describes means of constructing models of networks and the access control mechanisms they employ to approach the problem of finding which stepping stone paths are easiest for an attacker to find. While the simplest formulation of the problem can be addressed with deterministic shortest-path algorithms, we argue that consideration of what and how an attacker may (or may not) launch from a compromised host pushes one towards solutions based on Monte Carlo sampling. We describe the sampling algorithm and some preliminary results obtained using it.

关键词： Monte Carlo methods authorisation deterministic algorithms sampling methods Monte Carlo sampling algorithm access control mechanism computer exploits deterministic shortest-path algorithm stepping stone attacks Authentication Computational modeling Computers Databases Image edge detection Measurement Standards

来源：评论

学校读者我要写书评

暂无评论

XORAdap: A HoL-blocking aware adaptive routing algorithm 23

XORAdap: A HoL-blocking aware adaptive routing algorithm

引用

23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

作者： Penaranda, Roberto Gomez, Crispin Engracia Gomez, Maria Lopez, Pedro Univ Politecn Valencia Valencia Spain

ISBN: (纸本)9781479984909

Routing is a key parameter in the design of the interconnection network of large parallel computers. Depending on the number of routing options available for each packet, routing algorithms can be deterministic (one available path) or adaptive (several ones). Adaptive routing usually outperforms deterministic routing but it also may increase the Head-of-Line blocking effect. Usually, adaptive routing uses virtual channels to provide routing flexibility and to guarantee deadlock freedom. On the other hand, deterministic routing is simpler and therefore it has lower routing delay. In this paper, we take the challenge of developing new routing algorithms for direct topologies that exploit virtual channels in an efficient way combining the good properties of both routing algorithms types: flexibility and reduced HoL blocking. To do that, this paper proposes several hybrid (combination of adaptivity and determinism) simple mechanisms to perform an efficient distribution of packets among virtual channels based on their destination. The resulting routing mechanisms are able to adapt to the different traffic patterns to obtain the best performance while keeping the simplicity of routing.

关键词： Direct topologies Head of line blocking adaptive algorithms deterministic algorithms Network routing deterministic algorithms virtual channels Routing algorithms Adaptive algorithms traffic patterns Interconnection networks parametric design Packet Self tuning

来源：评论

学校读者我要写书评

暂无评论

Computing Static Schedule for the Hosts in a Real-Time Distributed System with Component Based Applications 9

Computing Static Schedule for the Hosts in a Real-Time Distr...

引用

9th Int Conf Ind Information Syst (ICIIS2014)

作者： Canute, Julius Kumar, Atul IIIT Bangalore Karnataka India Siemens Corp Res & Technol Bangalore Karnataka India ABB Corp Res Bangalore Karnataka India

ISBN: (纸本)9781479964994

We consider cyclic real-time applications built using nearly autonomous components. These components can run on any of the available hosts subject to certain constraints. The hosts in the system are allowed to be heterogeneous and they can have different cycle times for real time execution. Given a set of component based applications and a set of available hosts, we propose a solution for the problem of finding an optimum deployment. The deployment problem can be reduced to the problem of finding feasible static schedules for each host in the system that satisfy the real-time periodic execution requirements of all the applications. We propose a deterministic algorithm for finding static schedules for all the hosts in the system. The approach models the possible partial schedules at each step as nodes in a virtual tree. A breadth first traversal is conducted to construct the tree and complete the schedule. A node is removed from the tree if it cannot lead to a correct schedule. If more than one solutions are possible then the 'best' solution is selected based on the optimization criteria.

关键词： distributed processing object-oriented programming optimisation trees (mathematics) breadth first traversal component based applications cyclic real-time applications deployment problem deterministic algorithm nearly autonomous components optimization criteria partial schedules real time execution real-time distributed system static schedule computation virtual tree Complexity theory Electronic mail Optimization Real-time systems Resource management Schedules Software optimal criterion deterministic algorithms real-time systems hosts electronic mail Distributed processing Complexity theory object oriented programming management of resources computer software time cycles Real time

来源：评论

学校读者我要写书评

暂无评论

Pairwise Test Set Calculation using k-partite Graphs

Pairwise Test Set Calculation using k-partite Graphs

引用

International Conference on Software Maintenance

作者： Salecker, Elke Glesner, Sabine Berlin Inst Technol TU Berlin Berlin Germany

ISBN: (纸本)9781424486298

of input values and can be detected using pairwise test sets that cover each pair of input values. The generation of pairwise test sets with a minimal size is an NP-complete problem which implies that many algorithms are either expensive or based on a random process. In this paper we present a deterministic algorithm that exploits our observation that the pairwise testing problem can be modeled as a k-partite graph problem. We calculate the test set using well investigated graph algorithms that take advantage of properties of k-partite graphs. We present evaluation results that prove the applicability of our algorithm and discuss possible improvement of our approach.

关键词： NP-complete problem computational complexity deterministic algorithm deterministic algorithms fault diagnosis graph theory k-partite graph problem k-partite graphs pairwise test set calculation pairwise testing problem program testing random process software fault tolerance software faults

来源：评论

学校读者我要写书评

暂无评论

Balancing of Legged Mechanism with Multiple Segments

Balancing of Legged Mechanism with Multiple Segments

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Joo, Chang B. Kim, Joo H. NYU Mech & Aerosp Engn Dept Polytech Inst Brooklyn NY 11201 USA

ISBN: (纸本)9781467356411;9781467356435

The purpose of this paper is to investigate what kinds of effects the multi-segmental body with actively controlled body part have on balancing. As part of the research, a biped mechanism is simplified to multi-segmental legged model in sagittal plane where the model is comprised of a stance leg, foot and actively controlled body part. Not only the system parameters are in place but also necessary and sufficient conditions for balancing have been implemented as constraints. The algorithm that we proposed iteratively solves nonlinear constrained optimization problems. The balanced state domain is constructed by connecting velocity extrema. The proposed algorithm is used to identify the balanced state domain in a deterministic scheme using numerical optimization.

关键词： deterministic algorithms legged locomotion mechanical stability optimisation

来源：评论

学校读者我要写书评

暂无评论

The Constrained Ski-Rental Problem and its Application to Online Cloud Cost Optimization

The Constrained Ski-Rental Problem and its Application to On...

引用

32nd IEEE INFOCOM Conference

作者： Khanafer, Ali Kodialam, Murali Puttaswamy, Krishna P. N. Univ Illinois Coordinated Sci Lab 1101 W Springfield Ave Urbana IL 61801 USA Bell Labs Alcatel Lucent Murray Hill NJ 07974 USA

ISBN: (纸本)9781467359467

Cloud service providers (CSPs) enable tenants to elastically scale their resources to meet their demands. In fact, there are various types of resources offered at various price points. While running applications on the cloud, a tenant aiming to minimize cost is often faced with crucial trade-off considerations. For instance, upon each arrival of a query, a web application can either choose to pay for CPU to compute the response fresh, or pay for cache storage to store the response so as to reduce the compute costs of future requests. The Ski-Rental problem abstracts such scenarios where a tenant is faced with a to-rent-or-to-buy trade-off;in its basic form, a skier should choose between renting or buying a set of skis without knowing the number of days she will be skiing. In this paper, we introduce a variant of the classical Ski-Rental problem in which we assume that the skier knows the first (or second) moment of the distribution of the number of ski days in a season. We demonstrate that utilizing this information leads to achieving the best worst-case expected competitive ratio (CR) performance. Our method yields a new class of randomized algorithms that provide arrivals-distribution-free performance guarantees. Further, we apply our solution to a cloud file system and demonstrate the cost savings obtained in comparison to other competing schemes. Simulations illustrate that our scheme exhibits robust average-cost performance that combines the best of the well-known deterministic and randomized schemes previously proposed to tackle the Ski-Rental problem.

关键词： cloud computing cost reduction deterministic algorithms optimisation pricing randomised algorithms

来源：评论

学校读者我要写书评

暂无评论

Treasure Hunt in Graph Using Pebbles 24th

Treasure Hunt in Graph Using Pebbles

引用

24th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)

作者： Bhattacharya, Adri Gorain, Barun Mandal, Partha Sarathi Indian Inst Technol Guwahati Gauhati 781039 India Indian Inst Technol Bhilai Bhilai India

ISBN: (纸本)9783031210167;9783031210174

In this paper, we study the treasure hunt problem in a graph by a mobile agent. The nodes in the graph G = (V, E) are anonymous and the edges incident to a vertex v is an element of V whose degree is deg(v) and they are labeled arbitrarily as 0, 1, ..., deg(v) - 1. At a node t in G a stationary object, called treasure is located. The mobile agent that is initially located at a node s in G, the starting point of the agent, must find the treasure by reaching the node t. The distance from s to t is D. The time required to find the treasure is the total number of edges the agent visits before it finds the treasure. The agent neither have any prior knowledge about the graph nor the position of the treasure. An oracle that knows the graph, the agent's initial position, and the position of the treasure, places some pebbles on the nodes, at most one per node, of the graph to guide the agent towards the treasure. This paper aims to study the trade-off between the number of pebbles provided and the time required to find the treasure. To be specific, we aim to answer the following question: - "What is the minimum time for treasure hunt in a graph with maximum degree Delta and diameter D if k pebbles are placed?" We answer the above question when k < D and k = cD for some positive integer c. We design efficient algorithms for the agent for different values of k. We also propose an almost matching lower bound result for k < D.

关键词： Treasure hunt Mobile agent Anonymous graph Pebbles deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共23页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：