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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

90 篇 期刊文献
39 篇 会议
4 篇 学位论文

馆藏范围

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

日期分布

学科分类号

109 篇 工学
- 81 篇 计算机科学与技术...
- 28 篇 电气工程
- 18 篇 软件工程
- 14 篇 信息与通信工程
- 8 篇 控制科学与工程
- 7 篇 电子科学与技术（可...
- 3 篇 仪器科学与技术
- 3 篇 材料科学与工程（可...
- 2 篇 冶金工程
- 2 篇 土木工程
- 2 篇 水利工程
- 2 篇 石油与天然气工程
- 2 篇 船舶与海洋工程
- 2 篇 网络空间安全
- 1 篇 测绘科学与技术
- 1 篇 轻工技术与工程
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
48 篇 理学
- 35 篇 数学
- 5 篇 物理学
- 4 篇 生物学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
12 篇 管理学
- 10 篇 管理科学与工程(可...
- 2 篇 工商管理
- 1 篇 图书情报与档案管...
3 篇 经济学
- 3 篇 应用经济学
2 篇 农学
- 1 篇 作物学
2 篇 医学
- 1 篇 基础医学(可授医学...

主题

133 篇 probabilistic al...
5 篇 combinatorial op...
4 篇 deterministic al...
4 篇 grasp
4 篇 distributed comp...
3 篇 gcd
3 篇 distributed algo...
3 篇 automata
3 篇 parallel algorit...
3 篇 temporal logic
2 篇 strategy
2 篇 subset sum probl...
2 篇 euler function
2 篇 clustering
2 篇 smartphone secur...
2 篇 linear combinati...
2 篇 reusing past que...
2 篇 computational co...
2 篇 lamb waves
2 篇 binary search

机构

3 篇 univ s carolina ...
3 篇 indiana univ pur...
2 篇 univ calif santa...
2 篇 cepel elect ener...
2 篇 pontificia univ ...
2 篇 indiana univ pur...
2 篇 kobe univ grad s...
2 篇 macquarie univ d...
2 篇 brno university ...
2 篇 at&t labs res in...
2 篇 mines paristech
2 篇 russian acad sci...
2 篇 univ bio bio dep...
2 篇 univ calif berke...
2 篇 univ bonn bit co...
2 篇 hong kong polyte...
2 篇 univ camerino de...
1 篇 petra univ amman...
1 篇 univ hlth networ...
1 篇 natl res univ hi...

作者

5 篇 li feng
4 篇 peng wei
3 篇 huang chin-tser
3 篇 zou xukai
2 篇 resende mgc
2 篇 gutierrez-soto c...
2 篇 lo eric
2 篇 spirakis paul g.
2 篇 di pietro robert...
2 篇 wang dong
2 篇 ye lin
2 篇 mohri masami
2 篇 he zhian
2 篇 lu ye
2 篇 hirotomo masanor...
2 篇 wong petrie
2 篇 mertzios george ...
2 篇 de alfaro l
2 篇 aiex rm
2 篇 vinogradov d. v.

语言

125 篇 英文
7 篇 其他
1 篇 德文
1 篇 法文
1 篇 中文

检索条件"主题词=Probabilistic Algorithm"

共 133 条记录，以下是101-110 订阅

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

详细简洁

排序：

Quantitative solution of omega-regular games

Quantitative solution of omega-regular games

引用

33rd ACM Symposium on Theory of Computing (STOC)

作者： de Alfaro, L Majumdar, R Univ Calif Santa Cruz Dept Comp Engn Santa Cruz CA 95064 USA Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

We consider two-player games played for an infinite number of rounds, with omega-regular winning conditions. The games may be concurrent, in that the players choose their moves simultaneously and independently, and probabilistic, in that the moves determine a probability distribution for the successor state. We introduce quantitative game mu-calculus, and we show that the maximal probability of winning such games can be expressed as the fixpoint formulas in this calculus. We develop the arguments both for deterministic and for probabilistic concurrent games;as a special case, we solve probabilistic turn-based games with omega-regular winning conditions, which was also open. We also characterize the optimality, and the memory requirements, of the winning strategies. In particular, we show that while memoryless strategies suffice for winning games with safety and reachability conditions, Buchi conditions require the use of strategies with infinite memory. The existence of optimal strategies, as opposed to epsilon-optimal, is only guaranteed in games with safety winning conditions. (C) 2003 Elsevier Inc. All rights reserved.

关键词： automata games mu-calculus probabilistic algorithm temporal logic

来源：评论

学校读者我要写书评

暂无评论

Feedback-based Smartphone Strategic Sampling for BYOD Security 23

Feedback-based Smartphone Strategic Sampling for BYOD Securi...

引用

23rd International Conference on Computer Communication and Networks (ICCCN)

作者： Li, Feng Huang, Chin-Tser Huang, Jie Peng, Wei Indiana Univ Purdue Univ Dept Comp Informat & Graph Technol Indianapolis IN 46202 USA Indiana Univ Purdue Univ Dept Comp & Informat Sci Indianapolis IN 46202 USA Univ S Carolina Dept Comp Sci & Engn Columbia SC 29208 USA

ISBN: (纸本)9781479935727

Bring Your Own Device (BYOD) is an information technology (IT) policy that allows employees to use their own wireless devices to access internal network at work. Mobile malware is a major security concern that impedes BYOD's further adoption in enterprises. Existing works identify the need for better BYOD security mechanisms that balance between the strength of such mechanisms and the costs of implementing such mechanisms. In this paper, based on the idea of self-reinforced feedback loop, we propose a periodic smartphone sampling mechanism that significantly improve BYOD security mechanism's effectiveness without incurring further costs. We quantify the likelihood that "a BYOD smartphone is infected by malware" by two metrics, vulnerability and uncertainty, and base the iterative sampling process on these two metrics;the updated values of these metrics are fed back into future rounds of the mechanism to complete the feedback loop. We validate the efficiency and effectiveness of the proposed strategic sampling via simulations driven by publicly available, real-world collected traces.

关键词： Enterprise network vulnerability metric uncertainty metric smartphone security social network strategic sampling probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

Parallel GRASP with path-relinking for job shop scheduling

Parallel GRASP with path-relinking for job shop scheduling

引用

International Conference on Parallel Computing in Numerical Optimization (ParCo 2001)

作者： Aiex, RM Binato, S Resende, MGC AT&T Labs Res Internet & Network Syst Res Ctr Florham Pk NJ 07932 USA Pontificia Univ Catolica Rio de Janeiro BR-22451 Rio De Janeiro Brazil CEPEL Elect Energy Res Ctr BR-21944970 Rio De Janeiro Brazil

In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines under certain constraints, such that the maximum completion time of the jobs is minimized. In this paper, we describe a parallel greedy randomized adaptive search procedure (GRASP) with path-relinking for the JSP. Independent and cooperative parallelization strategies are described and implemented. Computational experience on a large set of standard test problems indicates that the parallel GRASP with path-relinking finds good-quality approximate solutions of the JSP. (C) 2003 Elsevier Science B.V. All rights reserved.

关键词： combinatorial optimization job shop scheduling GRASP path-relinking probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

The Virtue of Patience: Offloading Topical Cellular Content through Opportunistic Links

The Virtue of Patience: Offloading Topical Cellular Content ...

引用

IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS)

作者： Peng, Wei Li, Feng Zou, Xukai Wu, Jie Indiana Univ Purdue Univ Dept Comp & Informat Sci Indianapolis IN 46202 USA Indiana Univ Purdue Univ Dept Comp Informat & Leadership Technol Indianapolis IN 46202 USA Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA

ISBN: (纸本)9780769551043

Mobile data offloading is an approach to alleviating overloaded cellular traffic through alternative communication technologies on smartphones. Inspired by the prospect of spontaneous, peer-assisted, bulk data transfer through NFC or Wi-Fi Direct between proximate users' smartphones, we propose a model for mobile data offloading through the opportunistic proximity (e.g., Wi-Fi Direct) links with bounded content delivery delay and differential interests in content. Unlike the previous formulation of mobile data offloading as a target-set selection problem, which, essentially, asks the question "who (will download the content through the cellular link)," we ask "who" and "when." We present methods for individual users to locally estimate (their and their acquaintances') topological importance on the opportunistic proximity-link-based networks and aggregated interests in content. These factors are consolidated into a time-dependent function that embodies the concept of users' patience for the content. Each individual user, then, periodically make a probabilistic cellular download decision based on its patience at that time. Our motivation and insights are: 1) Involving topologically important, but otherwise disinterested, users in downloading and forwarding content helps improve offloading efficiency;2) situation awareness embodied in the time-dependent patience function is desirable, since it allows users to react to hard-to-predict contact opportunities on the fly. Through trace-driven simulations, we corroborate our insights, and demonstrate the effectiveness of our proposed method in reducing cellular costs.

关键词： mobile data offloading probabilistic algorithm distributed algorithm ego-centric betweenness centrality interest aggregation patience

来源：评论

学校读者我要写书评

暂无评论

Efficient Content Delivery via Interest Queueing

Efficient Content Delivery via Interest Queueing

引用

IEEE International Conference on Communications (IEEE ICC)

作者： Gao, Tianchong Li, Feng Indiana Univ Purdue Univ Indianapolis IN 46202 USA

ISBN: (纸本)9781538680889

Content sharing is an approach to relieve the congestion of cellular networks with alternative communication technologies such as the Wi-Fi and bluetooth. Through a Content Delivery Network (CDN), only a small portion of users need to download the data directly. Other users obtain packets from these users through short-range communications. However, the uncertainty of movement of mobile users challenges the effectiveness of CDNs. Unlike previous CDN solutions, in this paper, we present a novel scheme that studies the probabilistic meeting of users. When the accessibility to the cellular network is limited, we apply the queueing theory to guide the downloading or waiting strategies of users. In this system, the users who hold the content become seeds in the CDN and benefit their neighbors. Therefore we also consider the seed growing performance in the strategy. The purpose of our scheme is to let every user efficiently obtain their target content with restricted cellular data. The evaluation results show that our scheme gains significant satisfaction throughput improvements compared to the performance of basic downloading strategies.

关键词： Content delivery network queueing theory probabilistic algorithm satisfaction

来源：评论

学校读者我要写书评

暂无评论

Using Patterns in the Behavior of the Random Surfer to Detect Webspam Beneficiaries

Using Patterns in the Behavior of the Random Surfer to Detec...

引用

11th International Conference on Web Information Systems Engineering

作者： Largillier, Thomas Peyronnet, Sylvain Univ Paris Sud Lab Rech Informat F-91405 Orsay France

ISBN: (纸本)9783642243950

In order to appear in a good position on a search engine's result list it is not enough to be relevant regarding the request. Someone also have to be "popular". This notion of popularity is calculated by the search engine and is related to links made to the webpage. In order to artificially increase their popularity, webmasters sometimes use malicious techniques referred to as Webspam. It can take many forms and is in constant evolution, but Webspam usually consists of building a specific dedicated structure of spam pages around a given target page. It is really important for a search engine to address the issue of Webspam otherwise it won't be able to provide users with fair and reliable results. In this paper we propose a technique to identify webspam through the frequency language associated with random walks amongst those dedicated structures. We identify the language by calculating the frequency of appearance of k-grains on random walks launch from every node.

关键词： Webspam detection probabilistic algorithm Approximate matching

来源：评论

学校读者我要写书评

暂无评论

Asymmetry of strategies in proposal: Gale-Shapley algorithm on diagrams 20th

Asymmetry of strategies in proposal: Gale-Shapley algorithm ...

引用

20th International Conference on Knowledge - Based and Intelligent Information and Engineering Systems (KES)

作者： Ishida, Yoshiteru Ikeno, Shigetaka Toyohashi Univ Technol Dept Comp Sci & Engn Tempaku Ku Toyohashi Aichi 4418580 Japan

This paper proposes a new diagram for a specific matching problem: the stable marriage problem. The diagram allows us to elicit not only the structure of with a blocking relation among the nodes representing pairs, but also asymmetry in the actions of the DA algorithm (Gale-Shapley algorithm). Symmetry and asymmetry of the stable marriage problems permit us to deduce strategies of whether or not and when proposals should be made. Some implications to the asymmetry in rewarding and penalty in the game theoretic model are also discussed. (C) 2016 The Authors. Published by Elsevier B.V.

关键词： diagram stable marriage problems probabilistic algorithm strategy decision making education model matching automaton

来源：评论

学校读者我要写书评

暂无评论

Monodromy Solver: Sequential and Parallel 18

Monodromy Solver: Sequential and Parallel

引用

43rd ACM International Symposium on Symbolic and Algebraic Computation (ISSAC)

作者： Bliss, Nathan Duff, Timothy Leykin, Anton Sommars, Jeff Univ Illinois Chicago IL 60607 USA Georgia Inst Technol Atlanta GA 30332 USA

ISBN: (纸本)9781450355506

We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows the framework developed in [5] and can operate in the presence of a large number of failures of the homotopy continuation subroutine. We give special attention to parallelization and probabilistic analysis of a model adapted to parallelization and failures. Apart from theoretical results, we developed a simulator that allows us to run a large number of experiments without recomputing the outcomes of the continuation subroutine.

关键词： Solving systems of polynomial equations homotopy continuation monodromy probabilistic algorithm parallel computation

来源：评论

学校读者我要写书评

暂无评论

Locality Sensitive Hashing Revisited: Filling the Gap Between Theory and algorithm Analysis 13

Locality Sensitive Hashing Revisited: Filling the Gap Betwee...

引用

22nd ACM International Conference on Information and Knowledge Management (CIKM)

作者： Wang, Hongya Cao, Jiao Shu, Lihchyun Rafiei, Davood Donghua Univ Sch Comp Sci & Technol Shanghai Peoples R China Natl Cheng Kung Univ Coll Management Tainan Taiwan Univ Alberta Dept Comp Sci Edmonton AB Canada

ISBN: (纸本)9781450322638

Locality Sensitive Hashing (LSH) is widely recognized as one of the most. promising approaches to similarity search in high-dimensional spaces. Based on LSH, a considerable number of nearest neighbor search algorithms have been proposed in the past, with some of them having been used in many real-life applications. Apart from their demonstrated superior performance in practice, the popularity of the LSH algorithms is mainly due to their provable performance bounds on query cost, space consumption and failure probability. In this paper, we show that a surprising gap exists between the LSH theory and widely practiced algorithm analysis techniques. In particular, we discover that a critical assumption made in the classical LSH algorithm analysis does not hold in practice, which suggests that using the existing methods to analyze the performance of practical LSH algorithms is a conceptual mismatch. To address this problem, a novel analysis model is developed that bridges the gap between the LSH theory and the method for analyzing the LSH algorithm performance. With the help of this model, we identify some important flaws in the commonly used analysis methods in the LSH literature. The validity of this model is verified through extensive experiments with real datasets.

关键词： Locality Sensitive Hashing probabilistic algorithm algorithm Analysis

来源：评论

学校读者我要写书评

暂无评论

Fast Evaluation of Iceberg Pattern-Based Aggregate Queries 13

Fast Evaluation of Iceberg Pattern-Based Aggregate Queries

引用

22nd ACM International Conference on Information and Knowledge Management (CIKM)

作者： He, Zhian Wong, Petrie Kao, Ben Lo, Eric Cheng, Reynold Hong Kong Polytech Univ Hong Kong Peoples R China Univ Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781450322638

A Sequence OLAP (S-OLAP) system provides a platform on which pattern-based aggregate (PBA) queries on a sequence database are evaluated. In its simplest form, a PBA query consists of a pattern template T and an aggregate function F. A pattern template is a sequence of variables, each is defined over a domain. For example, the template T = (X, Y, Y, X) consists of two variables X and Y. Each variable is instantiated with all possible values in its corresponding domain to derive all possible patterns of the template. Sequences are grouped based on the patterns they possess. The answer to a PBA query is a sequence cuboid (s-cuboid), which is a multidimensional array of cells. Each cell is associated with a pattern instantiated from the query's pattern template. The value of each s-cuboid cell is obtained by applying the aggregate function F to the set of data sequences that belong to that cell. Since a pattern template can involve many variables and can be arbitrarily long, the induced s-cuboid for a PBA query can be huge. For most analytical tasks, however, only iceberg cells with very large aggregate values are of interest. This paper proposes an efficient approach to identify and evaluate iceberg cells of s-cuboids. Experimental results show that our algorithms are orders of magnitude faster than existing approaches.

关键词： OLAP Iceberg probabilistic algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：